Data Structures - CST201
8 modules
Malayalam
Access till 2024-12-31
Overview
Data Structures CST201 helps the learners to assess the applicability of
different data structures and associated algorithms for solving real world problem which requires
to compare and select appropriate data structures to solve the problem efficiently. This course
introduces abstract concepts for data organization and manipulation using data structures such as
stacks, queues, linked lists, binary trees, heaps and graphs for designing their own data structures
to solve practical application problems in various fields of Computer Science.
Modules
Module 2
12 attachments • 3 hrs
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
51 pages
Assignment 2 (with key)
3 pages
Module 3
14 attachments • 4 hrs
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
40 pages
Assignment 3 (with key)
4 pages
Module 4
10 attachments • 3 hrs
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
34 pages
Assignment 4 (with key)
4 pages
Module 5
10 attachments • 2 hrs
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
30 pages
Assignment 5 (with key)
9 pages
Live Sessions - Recorded
6 attachments • 4 hrs
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
4 attachments • 2 hrs
Day 1 - CST201
Day 2 - CST201
Day 3 - CST201
Day 4 - CST201
Solved Previous Year University QP
2 attachments
CST201 December 2020
34 pages
CST201 December 2021
30 pages
Rate this Course
₹ 899.00
Order ID:
This course is in your library
What are you waiting for? It’s time to start learning!
Wait up!
We see you’re already enrolled in this course till Access till 2024-12-31 . Do you still wish to enroll again?
