About Course

This course equips students with the essential building blocks of computer science: data structures and algorithms. Topics include linear data structures such as stacks, queues, and linked lists, as well as hierarchical structures like trees and graphs. Students will learn the operations and applications of each data structure, along with the algorithms commonly used to manipulate them. The course emphasizes the importance of choosing the right data structure for a given task and how to analyse the efficiency of different algorithms. Through practical exercises and coding assignments, students will gain hands-on experience in implementing and using them in real-world scenarios.

Course Syllabus

Stack:

Introduction to stack, applications of stack, implementation of stack in programming.

Queue:

Introduction to Queue, Types of Queues, applications of Queue, implementation of Queue in programming.

Priority Queues/Heaps:

Introduction to Priority Queues, Heap, Implementation of Heaps.

Linked List:

Introduction to Linked Lists, Types of Linked List, implementation of Linked List in programming.

Trees:

Introduction to trees, tree terminology, implementation of BST.

Graph Theory:

Graph Terminology, Representation, Graph Traversal Techniques, Prims / Kruskal’s algorithms, Topological Sort,Dijkstra algorithm, Bellman–Ford algorithm, Floyd- Warshall algorithm, Disjoint set Data Structures.

Syllabus

• Click here to view