[go: up one dir, main page]
Scribd
Upload
1 views1 page

Sr. No. Topic Name

The document outlines a comprehensive curriculum on data structures and algorithms, covering topics such as arrays, linked lists, stacks, queues, trees, and graphs. It includes fundamental concepts, operations, and various algorithms for searching, sorting, and traversing data structures. Additionally, it discusses the analysis of algorithms and their complexities.

Uploaded by

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

Sr. No. Topic Name

The document outlines a comprehensive curriculum on data structures and algorithms, covering topics such as arrays, linked lists, stacks, queues, trees, and graphs. It includes fundamental concepts, operations, and various algorithms for searching, sorting, and traversing data structures. Additionally, it discusses the analysis of algorithms and their complexities.

Uploaded by

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

Sr.

Topic Name
No.
1 Data structures and Algorithms: Introduction to Data structure: Concept of data structure, choice of right
data structures, types of data structures, Abstract Data types, ,
2 Introduction to algorithms, how to design and develop an algorithm: stepwise refinement, algorithm analysis
3 complexity of algorithms
4 Introduction, One Dimensional Arrays, Two dimensional array, Address Calculation
5 Array operations defined: traversal, selection, searching,
6 linear search, binary search
7 Sorting Introduction: selection sort, bubble sort,
8 insertion sort, quick sort
9 merges sort
10 Introduction to pointers, Pointer variables, Pointer and arrays
11 Array of pointers, pointers and structures,
12 Dynamic allocation.
13 Concept of a linked list, Traversing & searching in Link List
14 Insertion in a linked list,deletion in a linked list
15 Deletion continue,Doubly linked list:Insertion
16 Deletion in doubly linked list,circular linked List
17 Insertion in Circular Link List
18 deletion in Circular Link List
19 Concepts of header linked lists. Applications of linked lists.
20 Introduction to Stacks, array representation of stack, operations on stack: PUSH, POP
21 Concept of precedence and associatively in expressions, difficulties in dealing with infix expressions,
Resolving precedence of operators and association of operands, postfix & prefix expressions
22 conversion of expression from one form to other form using stack.
23 Evaluation of expression in infix, postfix & prefix forms using stack
24 Linked list representation of stack, Applications of stacks
25 Queues, Array representation of Queues,
26 operations on queue: insertion and deletion,
27 Circular queue,operations
28 priority queues, dequeue,
29 Applications of Queues.
30 Trees definition, characteristics concept of child, sibling, parent child relationship etc, binary tree: different
types of binary trees based on distribution of nodes: complete binary tree,
31 binary tree (threaded and unthreaded), operation on binary tree: insertion, deletion, searching and traversal of
binary trees, ,
32 traversing: Preorder, Postorder and Inorder
33 Introduction to binary search tree, operations BST: searching,insertion,
34 Deletion in BST, Introduction to AVL tree: Concept of balanced trees, balance factor in AVL trees
35 Insertion in AVL ,deletion in AVL
36 deletion in AVL
37 B tree insertion, deletion
38 B+ tree insertion, deletion
39 Graphs: Definition, Relation between tree & graph, directed and undirected graph, connected and
disconnected graph
40 Representation of graphs using adjacency matrix and list
41 Depth first and breadth first traversal of graphs
42 finding connected components,Applications of Graph.

You might also like