Weekly Study Plan DSA PDF

Preview

Summary

Download Weekly Study Plan DSA PDF

Description

Student Learning Hours

Week

Topics

Week 1

Introduction to course of Data Structures and Algorithms highlighting its importance in computer science. Stack based and heap based dynamic implementation of Abstract Data Structures in OOP. Pointers and self-referential structures.

3

Week 2

Static and dynamic Multi-dimensional Arrays and Jagged Arrays. Mapping Functions.

3

Week 3

Stack (LIFO) using arrays, CStack class by maintaining nodes in the system heap. Push/Pop operations and preconditions and their implementation.

3

Week 4

Post-condition/Precondition based usage and design of collection structures. Copy constructor, assignment operator and destructor of stack class. Supplying print function to help debugging for users of CStack class objects.

3

Week 5

Conversion of infix Arithmetic expressions to prefix, postfix Arithmetic expressions. Evaluation of 3 Arithmetic Expressions in prefix, postfix notations using stack.

Week 6

Tree representations of expressions and inter conversion to different notation.

3

Week 7

Queues using arrays and dynamic memory, Priority Queue. Singly-linked list and its operations. Their uses to handle different computational tasks.

3

Week 8

Circular and Doubly-linked lists. Uses of such lists. Recursion: decrease and concur strategy for problems

3

Week 9

Binary Trees . Components of a tree-nodes, edges. Types of nodes. Terminology and definitions. Insertion of new nodes. Unique key constraint and its handling issues.

3

Week 10

Binary Search Trees (BST). Searching in linked lists, arrays. Linear and binary search. Order of execution of search techniques. Pros and cons of binary search BST.

3

Week 11

Binary Trees to revisit to infix, prefix, postfix notations and inter conversion to different notation. Threaded Tree, Recursion revisited for tree traversals.

3

Week 12

Balancing Binary Tree and Other Height Balanced Trees (Red-Black Tree/AVL Trees).

3

Week 13

Sorting—Bubble sort, Selection sort, insertion sort, Quick sort, Merge Sort, Recursion revisited for 3 sorting.

Week 14

Hashing, Hash Table its properties, Hash function and its characteristics, Collision, techniques to avoid or resolve collisions, String hashing concepts.

Week 15 Graphs , Basic Operati`ons and traversals, Minimum spanning Tree, Shortest Path problems

Weekly Study Plan

3

3

Subject: Data Structure and Algorithm-CS212 Session-2017...