Engineering Tutorials

CSE-201 E          Data Structures & Algorithms

Class Work:    50
Exam:    100

Unit-1: Introduction to Data Structures: Definition of data structures and abstract data types, Static and Dynamic implementations, Examples and real life applications; The Stacks : Definition, Array based implementation of stacks, Linked List based implementation of stacks, Examples : Infix, postfix, prefix representation, Conversions, Applications.

Unit-2: Queues and Lists: Definition, Array based implementation of Queues / Lists, Linked List implementation of Queues / Lists, Circular implementation of Queues and Singly linked Lists, Straight / circular implementation of doubly linked Queues / Lists, Priority Queues, Applications.

Unit-3: Trees: Definition of trees and Binary trees, Properties of Binary trees and Implementation, Binary Traversal pre-order, post order, In- order traversal, Binary Search Trees, Implementations, Threaded trees, Balanced multi way search trees, AVL Trees, Implementations

Unit-4: Graphs: Definition of Undirected and Directed Graphs and Networks, The Array based implementation of graphs, Adjacency matrix, path matrix implementation, The Linked List representation of graphs, Shortest path Algorithm, Graph Traversal – Breadth first Traversal, Depth first Traversal, Tables : Definition, Hash function, Implementations and Applications.

Unit-5: Running time: Time Complexity, Big – Oh – notation, Running Times, Best Case, Worst Case, Average Case, Factors depends on running time, Introduction to Recursion, Divide and Conquer Algorithm, Evaluating time Complexity.

Unit-6: Sorting Algorithms : Introduction, Sorting by exchange, selection, insertions :  Bubble sort, Straight selection sort, Efficiency of above algorithms,; Shell sort, Performance of shell sort, Merge sort, Merging of sorted arrays& Algorithms; Quick sort Algorithm  analysis,
Heap sort: Heap Construction, Heap sort, bottom – up, Top – down Heap sort approach;
Searching Algorithms: Straight Sequential Search,  Binary Search  (recursive & non–recursive Algorithms)

Text Book:
Data Structures using C by A. M. Tenenbaum, Langsam, Moshe J. Augentem, PHI Pub.
Reference Books:
Data Structures and Algorithms by A.V. Aho, J.E. Hopcroft and T.D. Ullman, Original edition,  Addison-Wesley, 1999, Low Priced Edition.
Fundamentals of Data structures by Ellis Horowitz &    Sartaj Sahni, Pub, 1983,AW
Fundamentals of computer algorithms by  Horowitz     Sahni and Rajasekaran.
Data Structures and Program Design in C By Robert Kruse, PHI,
Theory & Problems of Data Structures by Jr. Symour Lipschetz, Schaum’s outline by TMH
Introduction to Computers Science  -An algorithms approach , Jean Paul Tremblay, Richard B. Bunt, 2002, T.M.H.
Data Structure and the Standard Template library – Willam J. Collins, 2003,  T.M.H 

Note:    Eight questions will be set in all by the examiners taking at least one question from each unit.  Students will be required to attempt five questions in all.

Related posts:

1. MDU Syllabus | F-Scheme | CSE-201 F Data Structures Using ‘C’
2. UPTU Syllabus | ECS-302 : DATA STRUCTURES USING – C
3. CSE-205 E Data Structures & Algorithms Lab.
4. MDU Syllabus | F-Scheme | CSE-205 F Data Structures using ‘C’ Lab.
5. PTU Syllabus | CS-207 DATA STRUCTURES & PROGRAMMING METHODOLOGY