arrow_back
Module 1
Introduction; Algorithms; Frequency count
Examples of frequency count
Asymptotic Notation
Space Complexity; Time Complexity; System Life Cycle
Previous Year Questions
Notes - Module 1
Assignment 1 (with key)
Module 2
Introduction; Stacks
Push and Pop Algorithms with examples
Polynomial representation using Arrays; Sparse matrix; Fast Transpose
Queues
Enqueue and Dequeue Algorithms with examples; Disadvantages of Normal Queue; Circular Queues
Enqueue in Circular Queue Algorithm; Dequeue; Dequeue in Circular Queue Algorithm
Double Ended Queues; Priority Queues
Applications of Stacks - Evaluation of Expressions: Infix to Postfix Conversion
Applications of Stacks - Evaluation of Expressions: Postfix Evaluation and Infix to Prefix Conversion
Linear search; Binary search
Notes - Module 2
Assignment 2 (with key)
Module 3
Introduction; Self Referential Structures; Dynamic Memory Allocation; Pointers
Linked List
Singly Linked List; Operations on Linked List (Part 1)
Operations on Linked List (Part 2)
Deletion in Singly Linked List
Stack and Queue using Singly Linked List
Doubly Linked List (Part 1)
Doubly Linked List (Part 2)
Doubly Linked List (Part 3); Circular Linked List
Polynomial Representation; Polynomial Addition
Polynomial Multiplication
Memory Allocation Scheme (First-fit, Best-fit and Worst-fit)
Notes - Module 3
Assignment 3 (with key)
Module 4
Trees; Types of Trees; Binary Trees
Binary Trees (Representation and Operations)
Binary Trees (Construction); Traversal Algorithm
Binary Search Trees (Part 1)
Binary Search Trees (Part 2)
Binary Search Trees (Algorithms)
Graphs; Representation of a Graph
Graph Traversals
Notes - Module 4
Assignment 4 (with key)
Module 5
Introduction; Selection Sort; Insertion Sort
Quick Sort; Merge Sort; Heaps
Max Heapify; Build Max Heapify
Algorithm for Selection Sort, Insertion Sort, Quick Sort and Partition; Time Complexity of Quick Sort
Algorithm and Time Complexity of Merge Sort; Algorithm for Heap Sort
Hashing
Collision Resolution Technique
Separate Chaining; Problems related to Hashing
Notes - Module 5
Assignment 5 (with key)
Live Sessions - Recorded
CST 201 - 08.10.2022
CST201 - 23.10.2022
CST201 - 12.11.2022
CST201 - 27.11.2022
CST201 - 28.12.2022
CST201 - 07.01.2023
The Final Lap
Day 1 - CST201
Day 2 - CST201
Day 3 - CST201
Day 4 - CST201
Solved Previous Year University QP
CST201 December 2020
CST201 December 2021