Scribd
Upload
40 views

Data Structures USING C

Uploaded by

Abcd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
40 views

Data Structures USING C

Uploaded by

Abcd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY

[AUTONOMOUS]
Seetharampuram, NARSAPUR-534 280
B. Tech IV SEMESTER SYLLABUS
COMPUTER SCIENCE AND ENGINEERING

T P C
20CS4MN1-MINOR COURSE
- - 3
DATA STRUCTURES USING ‘C’

COURSE OBJECTIVES:
i. To teach efficient storage mechanisms of data for easy access.
ii. To design and implement various basic and advanced data structures.
iii. To introduce various techniques for the representation of the data in the real world.
iv. To develop applications using data structures.
v.To improve logical ability.

COURSE OUTCOMES:
i. Implement and manipulate linear linked lists efficiently.
ii. Perform stack operations using array and linked representations.
iii. Implement queue operations using array and linked list representations.
iv. Apply various sorting algorithms: selection, bubble, insertion, quick, and merge.
v.Perform binary tree traversals (preorder, inorder, postorder).
UNIT 1:
Time and Space Complexity, Data Structures-Introduction to Data Structures, abstract data types,
Linear list-singly linked list implementation, insertion, deletion, and searching operation on the linear
list, circular linked list implementation, Double linked list implementation, insertion, deletion, and
search operations.Applications of linked lists.
UNIT 2:
Stack Operations, array and linked representation of stacks, stack application -infix to postfix
conversion, postfix expression evaluation, recursion implementation.
UNIT 3:
Queue Operations, array, and linked list representations. Circular Queue operations, double-ended
queue (deque), applications of queues.
UNIT 4:
Searching and Sorting -Sorting -selection sort, bubble sort, insertion sort, quick sort, merge sort,
Searching -linear and Binary search methods.
UNIT 5:
Trees-Definitions, tree representation, properties of trees, Binary tree, Binary tree representation.
Binary tree properties.Binary tree traversals, Binary tree implementation, applications of trees.
TEXTBOOKS:
Jean-Paul Tremblay, Paul G. Sorenson, ‘An Introduction to Data Structures with Application’, TMH,
2017.
Richard F, Gilberg, Forouzan, “Data Structures”, Cengage, 2nd Edition, 2004.

REFERENCE BOOKS:
Larry R. Nyhoff, ADTs, Data Structures, and Problem-Solving with C++, Prentice Hall Edition, 2004.
Thomas H. Cormen, Charles E. Leiserson, “Introduction to Algorithms”, 3rd Edition, 2010.

You might also like