PGD Block Chain Technology Data Structures and Algorithms Syllabus - Mumbai University
This is the University of Mumbai syllabus for the P.G. Diploma in Block Chain Technology under NEP 2020, approved by the Academic Council on 7 July 2023 and in force from the academic year 2023-24. It is the only syllabus the University has published for this diploma, and it has not been revised since.
Loading syllabus...
Syllabus for Data Structures and Algorithms
Unit I 15 [OC1 AND OC2]
- Algorithm Analysis: Experimental Studies, functions used in analysis, Asymptotic Analysis, Justification Techniques.
- Recursion: Examples, Analyzing Recursive Algorithms, Linear, binary and multiple recursion, Designing Recursive Algorithms, Eliminating Tail Recursion
- Array-Based Sequences: Low-Level Arrays, Dynamic Arrays and Amortization, Using Array-Based Sequences, Multidimensional Data Sets.
Unit II 15 [OC3, OC4]
- Stacks, Queues, and Deques: Stacks, Queues, Double-Ended Queues
- Linked Lists: Singly Linked Lists, Circularly Linked Lists, Doubly Linked Lists, The Positional List ADT, Sorting a Positional List, Maintaining Access Frequencies, Link-Based vs. Array-Based Sequences
- Trees: General Trees, Binary Trees, Implementing Trees, Tree Traversal Algorithms, An Expression Tree
- Priority Queues: The Priority Queue Abstract Data Type, Implementing a Priority Queue, Heaps, Sorting with a Priority Queue, Adaptable Priority Queues
Unit III 15 [OC4, OC5]
- Maps, Hash Tables, and Skip Lists: Maps and Dictionaries, Hash Tables, Sorted Maps, Skip Lists, Sets, Multisets, and Multimaps,
- Search Trees: Binary Search Trees, Balanced Search Trees, AVL Trees, Splay Trees, (2,4) Trees, Red-Black Trees.
- Sorting and Selection: Merge-Sort, Quick-Sort, g Sorting through an Algorithmic Lens, Comparing Sorting Algorithms, Selection
Unit IV 15 [OC5]
- Text Processing: Abundance of Digitized Text, Pattern-Matching Algorithms, Dynamic Programming, Text Compression and the Greedy Method, Tries
- Graph Algorithms: Graphs, Data Structures for Graphs, Graph Traversals, Transitive Closure, Directed Acyclic Graphs, Shortest Paths, Minimum Spanning Trees
Books and References
- 1 Data Structures and Algorithms in Python, Michael T. Goodrich, Roberto Tamassia. Michael H. Goldwasser, Wiley, 2013
- 2 Teach yourself Data Structures and Algorithms in 24 Hours, Robert Lafore, Sams, 1999
- 3 Data Structures and Algorithms, Alfred V Aho and John E Hopcroft and Jeffrey D Ullman, Pearson Education, 2002
- 4 Data Structures And Algorithmic Thinking With Python, Narasimha Karumanchi, CareetMonk Publications, 2016
- 5 Learning Functional Data Structures and Algorithms, Atul S. Khot Raju Kumar Mishra, Packt Publishing, 2017
- 6 Data Structures And Algorithms Made Easy, Narasimha Karumanchi, CareetMonk Publications, 2017
Reproduced from the University of Mumbai syllabus for P.G. Diploma in Block Chain Technology under NEP 2020, in force from the academic year 2023-24. Wording, unit numbering and lecture allocation are as printed in that syllabus. The PDF above is the syllabus's own page, unaltered.
The complete syllabus
This subject is cut from the University circular for the whole diploma. Open it here if you want the whole thing rather than a single subject.