Page 34 - R2017-REC-ECE-UG Syllabus

Department of ECE, REC

4. Grewal B.S., ―Higher Engineering Mathematicsǁ, Khanna Publishers, New Delhi, 43rd Edition,
2014.
5. Erwin kreyszig, ―Advanced Engineering Mathematicsǁ, John Wiley & Sons, 9th Edition, New Delhi,
2014.
6. Ramana, B.V. ―Higher Engineering Mathematicsǁ, Tata McGraw Hill, New Delhi, 11th Reprint ,
2010.
TH
7. Gilbert Strang , “Introduction to Linear Algebra” by, 5 Edition, Wellesley College, 2016.

CS17201 DATA STRUCTURES L T P C
(Common to CSE, IT, ECE, BME) 3 0 0 3

OBJECTIVES:
• To recognize and distinguish the applications of various linear and non linear data structures.
• To demonstrate the understanding of stacks, queues and their applications.
• To apply the concepts of List ADT.
• To analyze the concepts of tree and graph data structures.
• To able to incorporate various searching and sorting techniques in real time scenarios.

UNIT I BASIC DATA STRUCTURES 9
Introduction to Data Structure - Classes and Objects in Python – Stack – ADT - Stack Applications -
Balancing symbols -Evaluating the Postfix expressions – Queue - ADT – Queue Applications - Dequeue -
Circular Queue

UNIT II LINKED LIST 9
Linked List Implementation - Singly Linked List- Circular Linked List - Doubly Linked List – All operation
(Insertion, Deletion, Merge, Traversal) - Applications of lists – Polynomial Manipulation

UNIT III TREES 9
Basic Tree Terminologies- Binary Tree, Representation of Trees, Tree Traversal, Binary Search Tree –
Operations, Implementation. Binary Heap- Properties, Heap Operations.

UNIT IV GRAPHS 9
Graph Terminologies, Graph ADT, Traversal- BFS, DFS, Directed Acyclic Graph- Topological Sorting,
Shortest Path- Dijkstra’s Algorithm.

UNIT V SEARCHING AND SORTING 9
Searching- Linear search, Binary search, Hashing- Hash function, Collision resolution techniques- Linear
probing, separate chaining. Sorting- Bubble sort, Selection sort, Insertion sort, Shell sort, Merge sort, Quick
sort.

TOTAL= 45 PERIODS
OUTCOMES:
On successful completion of this course, the student will be able to:
• Analyze the various data structure concepts.
• Apply data structures to solve various problems.

Curriculum and Syllabus | B.E. Electronics and Communication Engineering | R2017 Page 34