Home └Data Structure
Data Structure

Data Structure

Course Objective:
In data structure we know a particular way of storing and organizing data in a computer’s memory so that it can be used efficiently. We are live in an information age. Everything around us is all about information. what does mean information? after processing the data we get information. we have to store the data somewhere and that’s important how can we store the data. We have to store the data in such a way that is easier to fetch, process and retrieve.

Learning outcomes:
Knowledge of data structures is an extremely important part of any programmer’s arsenal. For almost any programming job, most companies will undoubtedly ask questions regarding data structures. Data structure tells us to make our programs efficient and fast to execute. Data structure helps the students to understand the logic of computer and its related branch

Join Course
Responsible Poly Bhowmik
Last Update 10/24/2021
Completion Time 1 day 2 hours 50 minutes
Members 3
Poly Bhoumik
  • Lecture 1 (Introduction)
  • Lecture 2 (Introduction of Data Structure)
  • Lecture 3 ( Type of Data Structure)
    • Types of Data Structures
    • Data Structure_Tutorialspoint
    • Recoded Video of Lecture 3
    • Chase Your Dream- ICT
  • Lecture 4 (Introduction of Data Structure)
    • Lecture Slide of Introduction to Data Structure
    • Asymptotic Analysis
    • Recoded Video of Lecture 4
    • Chase Your Dream- ICT
  • Lecture 5 (Introduction to Data Structure)
    • Review and Discussion on chapter 1
    • Question List of Chapter 1
    • Quiz on Chapter 1 Introduction and Overview
    • Oral Quiz on chase your dream
  • Lecture 6 (Preliminaries)
    • Lecture Slide of Chapter 2 (Preliminaries)
    • Linear Search Algorithm with example | linear search in C | Data structures
    • Recorded Video of Lecture 6
    • Chase Your Dream -ICT
  • Lecture 7(Preliminaries)
    • Notes on Chapter 2
    • Recorded Video of Lecture 7
    • Question List of Chapter 2 (Preliminaries)
    • Big O notation - Data Structures | Measuring time complexity
    • Chase your Dream-ICT
  • Lecture 8 (String processing)
    • Lecture Slide of Chapter 3 (String Processing)
    • String Operations
    • Recorded Video of lecture 8
  • Lecture 9 (String Processing)
    • Pattern Matching Algorithm - Brute Force
    • Knuth Morris Patterson (KMP) Pattern Matching Algorithm
    • Question list of Chapter 3 (String processing)
    • Recorded Video of Lecture 9
  • Lecture 10 (String Processing)
    • Review Class
    • Quiz on String Processing
    • Oral Quiz on ICT
  • Lecture 11 ( Linear Array)
    • Lecture Slide of Chapter 4 (Linear Array)
    • Bubble Sort
    • Recorded Video of Lecture 11
    • Chase Your Dream - ICT
  • Lecture 12 (Linear Array)
    • Binary Search Algorithm with example | Data structures
    • Note on Linear Array
    • Recorded Video of lecture 12
  • Lecture 13 (Linear Array)
    • Question list on Lecture 4 (Linear Array)
    • Review Class for Mid Exam
    • Recorded Video on review Class
  • Lecture 14 (Mid Exam)
    • Question of Mid Exam
    • Question on Chase your Dream
  • Lecture 15 (Linked List)
    • Lecture Slide of Chapter 5
    • Types of linked list in data structures
    • Arrays vs Linked List | Data structures
    • Recorded Video of Lecture 15
  • Lecture 16 (Linked List)
    • Question list of Lecture 5
    • Chase Your Dream - ICT
    • Recorded Video of Lecture 16
  • Lecture 17 (Stack & Queue)
    • Lecture Slide of Chapter ( Stack & Queue)
    • Assignment on Stack
    • Recorded Video of Lecture 17
  • Lecture 18 (Stack & Queue)
    • Note on Arithmetic Notation
    • Practice on Math of Arithmetic Notation
    • Recorded Video of Lecture 18
    • Chase Your Dream- ICT
  • Lecture 19 ( Stack & Queue)
    • How to write Recursive Functions
    • Practicing Recursion Math
    • Recorded Video of Lecture 19
  • Lecture 20 (Stack & Queue)
    • Practicing Queue
    • Recorded video of Lecture 20
    • Question List of Chapter 6 (Stack & Queue)
  • Lecture 21 ( Tree )
    • Lecture Slide of Chapter 7 (Tree)
    • Chase Your Dream - ICT
    • Recorded Video of Lecture 21
  • Lecture 22 (Tree)
    • Binary Tree Traversals (Inorder, Preorder and Postorder) | Data structures
    • Construct Binary Tree from Preorder and Inorder traversal with example | Data structures
    • Recorded video of Lecture 22
  • Lecture 23 (Tree)
    • Construct Binary Tree from Preorder and Postorder traversal | Data structure
    • Introduction to Heap Tree with examples | Max Min Heap
  • Lecture 24(Tree)
    • Huffman’s Algorithm With Example
    • Recorded Video of Lecture 23
  • Lecture 25 (Tree)
    • Review class on Tree
    • Quiz on Tree
    • Oral Quiz on Chase Your dream
  • Lecture 26 (Graph)
    • Lecture Slide of Chapter 8 (Graph)
    • Graph representation in Data Structure(Graph Theory)|Adjacency Matrix and Adjacency List
    • Floyd Warshall Algorithm All Pair Shortest Path algorithm | data structures and algorithms
  • Lecture 27 (Graph)
    • Dijkstra Algorithm- single source shortest path| With example | Greedy Method
    • BFS and DFS Graph Traversals| Breadth First Search and Depth First Search | Data structures
  • Lecture 28 (Graph)
    • Question list on Tree
    • Question List on Graph
    • Review Class on Graph
    • Quiz on Stack & Queue
  • Lecture 30 (Assignment)
    • Assignment on Previous Year NU Question