0% found this document useful (0 votes)
57 views5 pages

No. Unit No. Topics To Be Covered Books & Page Nos. Notes Page Nos. Slide Nos. A/V Resource

This document outlines the topics that will be covered in a data structures and algorithms course. It lists 51 lecture units organized into 5 modules (Introduction, Stacks and Queues, Trees, Graphs, Searching and Sorting). Each unit lists the topics to be discussed, relevant textbook pages and notes, and any audio/visual resources. Key topics include data structures like arrays, linked lists, stacks, queues, trees, graphs, and algorithms for searching, sorting, recursion, and graph traversal.

Uploaded by

Minu Choudhary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
57 views5 pages

No. Unit No. Topics To Be Covered Books & Page Nos. Notes Page Nos. Slide Nos. A/V Resource

This document outlines the topics that will be covered in a data structures and algorithms course. It lists 51 lecture units organized into 5 modules (Introduction, Stacks and Queues, Trees, Graphs, Searching and Sorting). Each unit lists the topics to be discussed, relevant textbook pages and notes, and any audio/visual resources. Key topics include data structures like arrays, linked lists, stacks, queues, trees, graphs, and algorithms for searching, sorting, recursion, and graph traversal.

Uploaded by

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

Lecture Unit No. Topics to be covered Books & Notes Page Slide Nos.

A/V
No. Page Nos. Nos. Resource
1 I Introduction: Basic Terminology, Elementary
Data Organization,
2 I Algorithm, Efficiency of an Algorithm, Time and
Space Complexity, Asymptotic notations: Big-Oh,
Time-Space trade-off.
3 I Abstract Data Types (ADT) Arrays: Definition,
Single and Multidimensional Arrays,
4 I Representation of Arrays: Row Major Order, and
Column Major Order, Application of arrays,
5 I Sparse Matrices and their representations.

6 I Linked lists: Array Implementation and Dynamic


Implementation of Singly Linked Lists,
7 I Doubly Linked List, Circularly Linked List,

8 I Operations on a Linked List. Insertion, Deletion,


Traversal,
9 I Polynomial Representation and Addition,
10 I Generalized Linked List.
11 II Stacks: Abstract Data Type, Primitive Stack
operations: Push & Pop,
12 II Array and Linked Implementation of Stack in C,
13 II Application of stack: Prefix and Postfix
Expressions,
14 II Evaluation of postfix expression,
15 II Recursion, Tower of Hanoi Problem, Simulating
Recursion, Principles of recursion,
16 II Tail recursion, Removal of recursion Queues,
17 II Operations on Queue: Create, Add, Delete, Full
and Empty,
18 II Circular queues,

19 II Array and linked implementation of queues in C,


20 II Dequeue and Priority Queue.
21 III Trees: Basic terminology, Binary Trees,
22 III Binary Tree Representation: Array Representation
and Dynamic Representation,
23 III Complete Binary Tree, Algebraic Expressions,
24 III Extended Binary Trees, Array and Linked
Representation of Binary trees,
25 III Tree Traversal algorithms: Inorder,
26 III Preorder and Postorder,
27 III Threaded Binary trees,

28 III Traversing Threaded Binary trees,


29 III Huffman algorithm.

30 III Huffman algorithm.


31 V Searching : Sequential search, Binary Search,
Comparison and Analysis
32 V Internal Sorting: Insertion Sort, Selection,

33 V Bubble Sort, Quick Sort,


34 V Two Way Merge Sort, Heap Sort,.

35 V Radix Sort, Practical consideration for Internal


Sorting.
36 V Search Trees: Binary Search Trees(BST),
Insertion and Deletion in BST,
37 V Complexity of Search Algorithm,
38 V AVL trees,
39 V Introduction to m-way Search Trees, B Trees &
B+ Trees,
40 V Hashing: Hash Function, Collision Resolution
Strategies ,
41 V Storage Management: Garbage Collection and
Compaction
42 IV Graphs: Terminology, Sequential and linked
Representations of Graphs:

43 IV Adjacency Matrices, Adjacency List, Adjacency


Multi list,
44 IV Graph Traversal : Depth First Search and Breadth
First Search,
45 IV Connected Component,
46 IV Spanning Trees, Minimum Cost Spanning Trees:
Prims and
47 IV Kruskal algorithm.
48 IV Transistive Closure and Shortest Path algorithm:
49 IV Warshal Algorithm and
50 IV Dijikstra Algorithm,
51 IV Introduction to Activity Networks

You might also like