Scribd
Upload
34 views25 pages

DSA Syllabus

The document outlines the syllabus for a course on data structures and algorithms. It lists 14 topics that will be covered: linked lists, trees, binary search trees, AVL trees, red black trees, splay trees, bitmaps, segment trees, heaps and heap sort, m-way trees, B-trees, Huffman encoding, recursion, and hashing. For some topics like linked lists, trees, and heaps, it describes the concepts and operations that will be discussed like insertion, deletion, traversal, and complexity analysis. Other topics like AVL trees, red black trees, and splay trees focus more on the insertion and deletion algorithms. Simulation and analyzing complexity is mentioned for many topics.

Uploaded by

Ebrahim Siddik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
34 views25 pages

DSA Syllabus

The document outlines the syllabus for a course on data structures and algorithms. It lists 14 topics that will be covered: linked lists, trees, binary search trees, AVL trees, red black trees, splay trees, bitmaps, segment trees, heaps and heap sort, m-way trees, B-trees, Huffman encoding, recursion, and hashing. For some topics like linked lists, trees, and heaps, it describes the concepts and operations that will be discussed like insertion, deletion, traversal, and complexity analysis. Other topics like AVL trees, red black trees, and splay trees focus more on the insertion and deletion algorithms. Simulation and analyzing complexity is mentioned for many topics.

Uploaded by

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

 

         Data Structure       
           And    Algorithm
                                                                                SYLLABUS

                    
Shamim Sir:
1. Linked List(Singly,Doubly,Linier,Circular)

a. Insert(First,Last,After,Before)

b. Delete(First,Last,After,Before)

c. Traverse

d. Complexity
a. Classification

2. Tree
b. Inorder,Postorder,Preorder
a. Creation

b. Insertion
3.
Binary Search Tree
c. Deletion

d. Complexity
4.
a. Insertion b .Deletion 
AVL Tree
5. Red Black Tree

a. b .Deletio
Insertion n
6. a. Search b. Insert c. Delete
Splay Tree
7. BIT

a. Creation b. Update

c. Query d. Complexity
a. Creation

b. Query
8.
Segment Tree c. Update/ Lazy Tree

d. Complexity
a. Max Heap
9. Heap and 
 Heap sort b. Min Heap

c. Complexity
10. M‐ a. b.
Way Tree Insertion Deletion
11. B Tree
12. Huffman Encoding 
4 to 12 only simulation,differene,  c
omplexity.  
Shuvo Sir: 
Memory Management for 
Array ( 1 to n dimensional) 
a. Algorithm/Code 

2.
Binary Search 
b. Simulation 

c. Complexity 
a. Bubble Sort 
b. Insertion sort 
c. Selection Sort 
d. Quick Sort 
e. Merge Sort 
3. Sort  f. Radix Sort 
g. Algorithm/Code 
h. Simulation 
i. Complexity Analysis 
j. Comparison 
1 2
4. Stacks  a. Using array  b.
Using Linked List
5. Expression 

a. Postfix 
b. Prefix 
c. Infix 
d. Evaluation by Stack 
e. Conversion By stack 
• a. Deque 
• b. Priority Queue 
• c. Using Array 
6. Queue  • d. Using Circular Array 
• e. Using Linked List 
• f. Simulation 
7. Recursion
8. Hashing 
•It is f
 unl orbidd
ess  e
writ it is  n to w
e co clea r i t
  are de / r ly w e any 
 som  algo ritte co d
e
was e   a r i th n   i n  o r alg
 not lgor m. F  the o
you  disc ithm o r  S  q u e r i th
  wa u s sed    or   h a m s t i o m
nt.  in cl c o d i m n   t o
ass  e   (4‐12  s ir  if th  
you )   wh e r e
 can i c h     
 wri
te a
s     

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy