Programming Course

Data Structures and Algorithms

Data Structures and Algorithms
Course Details

  Total Sessions:

 Total Hours: 100 Hours

  Duration: 3 Month

  Venue: Golap Kutir Bhaban (1st Floor), Govt. Mohila College Road, Cumilla.

Course Fee: ৳6000/-

Discounted Fee: ৳5000/-
Course Outline Enroll Now

Course Outline

Data Structures and Algorithms

 

Data structure course outline

History of data structure
• What is data
• Data structure and types
 
Array
• What is array
• Types of array
• Representation of linear
• Array in memory
• Traversing linear array
• Array insertion and deletion
• Multidimensional array
• Two dimensional array
• Representation of two
• Dimensional array in
• Memory
 
Stack
• What is stack
• Array representation of
• Stack
• Discuss overflow and
• Underflow
 
Queues
• What is queue
• Types of queue
• Representation of queue
 
D-Queues
• What is D-queues
• Representation of D-queue
 
Linked list
• What is linked list
• Types of linked list
• Traversing a linked list
• Searching a linked list
• Linked list operation (Traverse, Insert, Delete)
 
Hashing
• What is hashing
• Types of hashing
• Collision resolution method
 
Trees
• Introduction to trees
• Binary tree
• Application
• Strict/proper binary tree
• Complete binary tree
• Perfect binary tree
• Traversing binary tree
 
Graph
• What is graph, edge, path
• Weighted vs Unweighted
• Adjacency matrix and list
 
Breadth first traversal
Depth first traversal
 

Algorithm course outline

Introduction of algorithm
• What is algorithm
• Characteristics of algorithm
• How to design an algorithm
 
Complexity analysis
• Types of algorithm
• Asymptotic notation
 
Divide and conquer theory
 
Searching algorithm
• Linear search
• Binary search
 
Sorting algorithm
• Merge sort
• Bubble sort
• Selection sort
• Bucket sort
• Quick sort
• Insertion sort
• Radix sort
• Heap sort (Max & Min heap)
 
Greedy algorithm
• Minimum spanning tree (Prims)
• Minimum spanning tree (Kruskal)
• Dijkstra’s algorithm
• Knapsack problem fractional
 
Dynamic algorithm
• Fibonacci numbers
• Longest common subsequence
• Floyd warshall
• Bellman ford
• 0/1 Knapsack problem
 
N-Queen problem
Tower of Hanoi
Breadth first search (BFS)
Depth first search (DFS)
Topological sorting