Scribd
Upload
24 views

Dsasyallabus

Uploaded by

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

Dsasyallabus

Uploaded by

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

DSA :-

1. Introduction to Data Structures: Linear and Non Linear Data Structures,


Static and Dynamic Data Structures.
Concept of Stack and Queue. Array Implementation of Stack and
Queue, Circular Queue, Double Ended Queue, Priority Queue. Concept
of Linked Lists. Singly linked lists, doubly linked lists and circular
linked lists. Insertion, deletion, update and copying operations with
Singly linked lists, doubly linked lists and circular linked lists.
Reversing a singly linked list.

Self-learning Topics: Linked List Implementation of Stack, Linked


List implementation of Queue, Circular Queue, Double Ended Queue,
Priority Queue.

2. Introduction to Trees: Terminology, Types of Binary trees. Non


recursive Preorder, in-order and post-order traversal. Creation of binary
trees from the traversal of binary trees. Binary search tree: Traversal,
searching, insertion and deletion in binary search tree. Threaded Binary
Tree: Finding in-order successor and predecessor of a node in threaded
tree. Insertion and deletion in threaded binary tree. AVL Tree: Searching
and traversing in AVL trees. Tree Rotations: Right Rotation, Left
Rotation. Insertion and Deletion in an AVL Tree.

Self-learning Topics: Implementation of AVL Tree

3. Introduction to Graphs: Undirected Graph, Directed Graph, graph


terminology, Connectivity in Undirected and Directed Graphs.
Spanning tree. Representation of graph: adjacency matrix, adjacency
list, Transitive closure of a directed graph and path matrix.
Traversals: Breadth First Search, Depth First Search.

Self-learning Topics: Implementation of BFS, DFS

4. Searching: Sequential Search, Binary Search. Hashing: Hash Functions:


Truncation, Mid-square Method, Folding Method, Division Method.
Collision Resolution: Open Addressing: Linear Probing, Quadratic
Probing, Analysis of all searching techniques

Self-learning Topics: Double Hashing, Separate Chaining Bucket


Hashing.

5. Sorting: Insertion sort, Selection sort, Merge sort, Quick sort and Radix sort.
Analysis of all sorting techniques.

Self-learningTopics: Radix-Exchange Sort,shell sort

6. Applications of Linked Lists: Addition of 2 Polynomials and


Multiplication of 2 polynomials.
Applications of Stacks: Reversal of a String, Checking validity of an
expression containing nested parentheses, Function calls, Polish
Notation: Introduction to infix, prefix and postfix expressions and their
evaluation and conversions.
Application of Queues: Scheduling, Round Robin Scheduling
Applications of Trees: Huffman Tree and Heap Sort.
Applications of Graphs: Dijkstra’s Algorithm, Minimum
Spanning Tree: Prim’s Algorithm, Kruskal’s Algorithm.
Practical Applications and Case Studies: Real-world
applications of data structures and algorithms

You might also like