Department of CS/IT

Data Structures (CS-305)

Semester: 3rd

(Computer science department)

Name of Faculty: Prakash N Hardaha

Department of CS/IT

INDEX

Chapter-1: Scheme & Syllabus

Chapter-2: Theory Lecture Plan (50-60 Lectures)

Chapter-3: Practical Lecture Plan / Lab Demo (15 Lectures)

Chapter-4: Theory Assignment (At Least 20 Questions)

Chapter-5: Lab Assignment (At Least 15 Questions)

Chapter-6: RGPV Papers (At least 2 Years Old Question Papers)

Chapter-7: Viva-Voce Questions (30-50 Questions)

Chapter-8: Web Reference(S)

Chapter-9: Unit-wise Objective Tutorial Sheet

Chapter-10: Unit-wise Subject Tutorial Sheet

Department of CS/IT

Chapter-1 : Scheme & Syllabus

Unit I Introduction: Basic Terminology, Data types and its classification, Algorithm complexity notations like big Oh,�,�. Array Definition, Representation and Analysis of Arrays, Single and Multidimensional Arrays, Address calculation, Array as Parameters, Ordered List and operations, Sparse Matrices, Storage pools, Garbage collection. Recursion-definition and processes, simulating recursion, Backtracking, Recursive algorithms, Tail recursion, Removal of recursion. Tower of Hanoi Problem. UNIT II Stack, Array Implementation of stack, Linked Representation of Stack, Application of stack: Conversion of Infix to Prefix and Postfix Expressions and Expression evaluation, Queue, Array and linked implementation of queues, Circular queues, D-queues and Priority Queues. Linked list, Implementation of Singly Linked List, Two-way Header List, Doubly linked list, Linked List in Array. Generalized linked list, Application: Garbage collection and compaction, Polynomial Arithmetic. UNIT III Trees: Basic terminology, Binary Trees, , algebraic Expressions, Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees, Binary Search Tree (BST ), AVL Trees, B-trees. Application: Algebraic Expression, Huffman coding Algorithm.

Department of CS/IT

UNIT IV Internal and External sorting ,Insertion Sort, Bubble Sort, selection sort Quick Sort, Merge Sort, Heap Sort, Radix sort, Searching & Hashing: Sequential search, binary search, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation. Symbol Table, Static tree table, Dynamic Tree table. Unit V Graphs: Introduction, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees. Reference: 1. R. Kruse et al, “Data Structures and Program Design in C”, Pearson Education Asia, Delhi-2002 2. ISRD Group; Data structures using C; TMH 3. Lipschutz; Data structure (Schaum); TMH 4. Horowitz and Sahani, “Fundamentals of data Structures”, Galgotia Publication Pvt. Ltd., N Delhi. A. M. Tenenbaum, “Data Structures using C & C++”, Prentice-Hall of India Pvt. Ltd., New Delhi. 5. Data Structures Trembley and Sorenson, TMH Publications

Department of CS/IT

Chapter-2: Theory Lecture Plan (50-60 Lectures) Unit No.

Lecture Nos.

Topics to be covered Ref. book

1

1-3 Introduction: Basic Terminology, Data types and its classification, Algorithm complexity notations like big Oh,�,�.

4-5 Array Definition, Representation and Analysis of Arrays, Single and Multidimensional Arrays, Address calculation, Array as Parameters,

6-7 Ordered List and operations, Sparse Matrices, Storage pools, Garbage collection. Recursion-definition and processes,

8-9 Backtracking, Recursive algorithms, Tail recursion, Removal of recursion. Tower of Hanoi Problem.

2

10-11 Stack, Array Implementation of stack, Linked Representation of Stack, Application of stack:

12-13 Conversion of Infix to Prefix and Postfix Expressions and Expression evaluation 14-17 Queue, Array and

linked implementation of queues, Circular queues, D-queues and Priority Queues.

17-20 Linked list, Implementation of Singly Linked List, Two-way Header List, Doubly linked list, Linked List in Array.

20-23 Generalized linked list, Application: Garbage collection and compaction, Polynomial Arithmetic.

3

24-27 Trees: Basic terminology, Binary Trees, , algebraic Expressions, Complete Binary Tree, Extended Binary Trees,

28-29 Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees, Binary Search Tree (BST ),

30-31 AVL Trees, B-trees. Application: Algebraic Expression,

32-33 Huffman coding Algorithm.

4

34-36 Internal and External sorting ,Insertion Sort, Bubble Sort, selection sort

37-38 Quick Sort, Merge Sort,

39-41 Heap Sort, Radix sort, 42-44 Searching & Hashing: Sequential search, binary search, Hash Table,

Hash Functions,

45-46 Collision Resolution Strategies, Hash Table Implementation. Symbol Table, Static tree table, Dynamic Tree table.

5

47-49 Graphs: Introduction, Sequential Representations of Graphs,

50-52 Adjacency Matrices, Traversal, Connected Component

Department of CS/IT

53-56 Spanning Trees, Minimum Cost Spanning Trees.

Chapter-3: Practical Lecture Plan / Lab Demo (15 Lectures)

S.no Lectur

e no

Practical Date

1. 1 Implementation of matrix operations

2. 2 Implementation of Stack

3. 3 Implementation of Queue

4. 4 Implementation of Single Linked List

5. 5 Implementation of Double Linked List

6. 6 Implementation of Circular Queue

7. 7 Implementation of Binary Search

8. 8 Implementation of Sequential Search

9. 9 Implementation of Bubble Sort

10. 10 Implementation of Selection Sort

11. 11 Implementation of Insertion Sort

12. 12 Implementation of Quick Sort

13 13 Implementation of Binary Search Tree

14 14 Implementation of Towers of Hanoi

15 15 Implementation of Merge Sort

Department of CS/IT

Chapter-4: Theory Assignment (At Least 20 Questions) (All questions are compulsory)

1.

2.

3.

Department of CS/IT

4.

5.

Department of CS/IT

6.

7.

Department of CS/IT

Department of CS/IT

Chapter-5: Lab Assignment (At Least 15 Questions) 1. 1. What are various time complexity notations. Describe each one with example. 2. Draw graph of various asymptotic notations. 3. Write and explain address formulae for single and two dimensional arrays in row major and column.

Give suitable example 4. What is recursion? What are various types of recursion? Write algorithm for Fibonacci series. 5. Write algorithm for stack implementation 6. Write algorithm for queue implementation 7. Write algorithm for Single Linked List 8. Write algorithm for Double Linked List 9. Write algorithm for Circular Queue 10. Write algorithm for Dequeue 11. Write short notes on garbage collection. 12. Write algorithm to convert infix to postfix. 13. Write algorithm to evaluate postfix expression. 14. Write algorithm to traverse BST. 15. Write algorithm to implement B Tree 16. Write algorithm for Huffman coding 17. Write algorithm for Bubble Sort 18. Write algorithm for Selection Sort 19. Write algorithm for Insertion Sort 20. Write algorithm for binary Search 21. Write algorithm for Sequential Search 22. Write algorithm for Quick Sort 23. Write algorithm for Merge Sort 24. Write algorithm for DFS and BFS 25. Write algorithm for Kruuskal’s Algorithm 26. Write algorithm for Dijkstra’s Algorithm

Chapter-6: RGPV Papers (At least 2 Years Old Question Papers)

Note: Visit website www.corporatebpl.com