Bsc(Cs)II-III DataStructures Syllabus

Data Structures(BS306)

Unit –  I
Fundamental Concepts: Introduction to Data Structures, Types of Data Structures, Introduction to Algorithm, Pseudo-code, Flow Chart, Analysis of Algorithms.
Linear Data Structure Using Arrays: 1-D Arrays, 2-D Arrays, N-D Arrays, Memory Representation  and  Address Calculation of 1-D, 2-D, N-D Arrays, Concept of Ordered List, String Manipulation, Pros and Cons of Arrays.

Stacks: Concept, Primitive Operations, Abstract Data Type, Representation Stacks Using Arrays, Prefix, Infix, Postfix Notations for Arithmetic Expression, Applications of Stacks– Converting Infix Expression to Postfix Expression, Evaluating the Postfix Expression, Checking Well-formed (Nested) Parenthesis, Processing of Function Calls, Reversing a String.

Unit –  II

Recursion: Introduction, Recurrence, Use of Stack in Recursion, Variants of Recursion, Execution of Recursive Calls, Recursive Functions, Iteration versus Recursion.

Queues: Concept, Primitive Operations, Abstract Data Type, Representation Queues Using Arrays, Circular Queue, Double-Ended Queue, Applications of Queues.

Linked Lists: Introduction, Concept, Terminology, Primitive Operations-creating, inserting, deleting, traversing, Representation of Linked Lists, Linked List Abstract Data Type, Linked List Variants - Singly  Linked List, Doubly Linked List, Linear and Circular Linked List, Representation Stacks and Queues Using Linked Singly Lists, Application of Linked List–Garbage Collection.

Unit –  III

Trees: Introduction, Representation of a General Tree, Binary Tree Introduction, Binary Tree Abstract Data Type, Implementation of Binary Trees, Binary Tree Traversals – Preorder, Inorder, Postorder Traversals, Applications of Binary Trees Briefly.

Graphs: Introduction, Graph Abstract Data Type, Representation of Graphs, Graph Traversal – Depth-First Search, Breadth-First Search, Spanning Tree – Prim’s Algorithm, Kruskal’s Algorithm.

Hashing: Introduction, Hash Functions, Collision Resolution Strategies.

Unit –  IV

Searching and Sorting: Sequential (Linear) Search, Binary Search, Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Merge Sort, and Comparison of Sorting Techniques.

Heaps: Concept, Implementation, Abstract Data Type, Heap Sort.

Text           Varsha H. Patil, Data Structures Using  C++

References       

1.  Nell Dale, C++ Plus Data Structures
2. Seymor Lipschutz, Data Structures (Revised  1e)
3. Adam Drozdek, Data Structures and Algorithms in C++
4. Mark Allen Weiss, Data structures and Algorithm Analysis in C++  (4e)
5. D.S. Malik, C++ Programming: Program Design Including Data Structures (6e)
6. Michael Main, Walter Savitch, Data Structures and Other Objects Using C++   (4e)
7. Michael T. Goodrich, R. Tamassia, David M. Mount, Data Structures and Algorithms in C++
8. Yonghui Wu, Jiande Wang, Data Structure Practice for Collegiate Programming Contests  and Education                                                   For more info visit    Degreecsa.blogspot.in