Connected successfully Syllabus || SNS Courseware
Subject Details
Dept     : CSD
Sem      : 3
Regul    : 2023
Faculty : Mr. Rajesh H
phone  : 7760432921
E-mail  : rajesh.h.mca@snsct.org
125
Page views
15
Files
3
Videos
3
R.Links

Icon
Syllabus

UNIT
1
LIST ADT

Abstract Data Types (ADTs) –Introduction to analysis of algorithms – asymptotic notations – Non recursion & recursion – analyzing recursive algorithms- List ADT – array-based implementations – linked list implementations – singly linked lists – circularly linked lists – doubly linked lists Exercise: 1. Implement List ADT 2. Linked list implementations of List

UNIT
2
STACK ADT & QUEUE ADT

Stack ADT – Applications of Stack: Infix to Postfix conversion-Postfix Evaluation- Balanced parentheses - Function Call. Queue ADT – Circular Queue- double ended queues – applications Queue Exercise: 3.Implementation of Stack and Queue ADTs 4.Applications of Stack and Queue ADTs

UNIT
3
SORTING, SEARCHING & HASHING

Bubble sort – selection sort – insertion sort – divide & conquer- merge sort – quick sort – analysis of sorting algorithms – linear search – binary search – hashing – hash functions – collision handling – load factors, rehashing, and efficiency Exercise: 5.Implementation of sorting and searching algorithms 6.Implementation of Hash tables

UNIT
4
TREE ADT

Tree ADT – Binary Tree ADT – tree traversals – Back Tracking - binary search trees – AVL trees – heaps – multi- way search trees- Branch & Bound: Knapsack Problem Exercise: 7. Tree representation and traversal algorithms 8. Implementation of Binary Search Trees 9. Implementation of Heaps

UNIT
5
GRAPH ADT

Graph ADT – representations of graph – graph traversals – DAG – topological ordering –dynamic programming: shortest paths – greedy algorithms: minimum spanning trees – Limitations of Algorithm Power-P, NP and NP-Complete Problems Exercise: 10. Graph representation and Traversal algorithms 11. Implementation of single source shortest path algorithm 12. Implementation of minimum spanning tree algorithms

Reference Book:

1. Lee, KentD., Hubbard, Steve, “Data Structures and Algorithms” Springer Edition2015 2. Rance D.Necaise, “Data Structures and Algorithms”, John Wiley & Sons, 2011 3. Aho, Hopcroft, and Ullman,“DataStructuresandAlgorithms”,PearsonEducation,1983. 4. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, and Clifford Stein, “Introduction to Algorithms", Second Edition,McGrawHill,2002. 5. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Fourth Edition, Pearson Education, 2014

Text Book:

Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures & Algorithms”, An Indian Adaptation, John Wiley & Sons Inc., 2021