Scribd
Upload
4 views

Data Structure and Algorithm Syllabus

DSA syllabus according to University

Uploaded by

ayushkumar32388
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

Data Structure and Algorithm Syllabus

DSA syllabus according to University

Uploaded by

ayushkumar32388
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Here’s your Data Structures and Algorithms syllabus, organized for clarity and focus:

Data Structures and Algorithms Syllabus

UNIT I: Arrays and Lists (CO1)

 Algorithm Concepts:

o Efficiency of an Algorithm, Time and Space Complexity

o Asymptotic Notations: Big Oh Notation

o Time and Space Trade-Off, Abstract Data Types (ADT)

 Arrays:

o Single and Multidimensional Arrays

o Row Major and Column Major Representation

o Applications of Arrays

o Sparse Matrices and Their Representation

 Linked Lists:

o Array and Dynamic Implementation

o Types:

 Singly Linked List

 Doubly Linked List

 Circular Linked List

o Operations: Insertion, Deletion, Traversal

o Polynomial Representation and Addition

UNIT II: Stacks and Queues (CO2)

 Stacks:

o Abstract Data Type

o Primitive Stack Operations: Push, Pop

o Implementation:

 Array-Based

 Linked List-Based (in C)

o Applications:

 Prefix and Postfix Expressions, Evaluation of Postfix Expression

 Towers of Hanoi Problem

 Simulating Recursion, Principles of Recursion

 Queues:
o Operations: Create, Add, Delete, Full, Empty

o Circular Queues, Dequeue, Priority Queues

o Implementation:

 Array-Based

 Linked List-Based (in C)

UNIT III: Trees (CO3)

 Tree Concepts:

o Basic Terminology

o Binary Trees, Representation (Array and Dynamic)

o Complete Binary Tree, Algebraic Expression, Extended Binary Trees

 Search Trees:

o Binary Search Tree (BST): Insertion, Deletion

o Traversal Algorithms:

 Pre-order

 In-order

 Post-order

o Threaded Binary Trees, AVL Trees

UNIT IV: Graphs (CO4)

 Graph Representation:

o Terminology

o Sequential and Linked Representation

o Adjacency Matrices, Adjacency Lists, Adjacency Multi-Lists

 Graph Algorithms:

o Traversal:

 Depth First Search (DFS)

 Breadth First Search (BFS)

o Connected Components, Spanning Trees

o Minimum Cost Spanning Trees:

 Prim’s Algorithm

 Kruskal’s Algorithm

o Transitive Closure and Shortest Path Algorithms:

 Warshall Algorithm
 Dijkstra Algorithm

UNIT V: Sorting and Searching (CO5)

 Searching:

o Sequential Search, Binary Search

o Comparison and Analysis

 Sorting Algorithms:

o Insertion Sort, Selection Sort, Bubble Sort, Quick Sort

o Two-Way Merge Sort, Heap Sort, Radix Sort, Tree Sort

 Advanced Topics:

o Complexity of Search Algorithms

o Introduction to m-Way Search Trees, B-Trees, B+-Trees

o Hashing:

 Hash Functions

 Collision Resolution Strategies

o Storage Management: Garbage Collection, Compaction

This structure highlights each topic for efficient understanding and preparation. Let me know if you need
explanations or resources on any topic!

Important Topics for CT-2

Unit 3- Binary Search Tree, AVL tree, Construction of Binary tree using traversal, Strict and complete Binary Tree

Unit 4- Breadth First Search, Dijkstra algorithm, Kruskal's algorithm, Types of Graph

Unit 5- Binary Search, Heap Sort, Radix Sort, Hashing- Linear Probing

You might also like