DSLO

Search

• Linear Search
• Linear Search 2
• Binary Search
• Question 1
• Question 2

Linked List

• Node creation
• Nodes linking
• Printing node's data
• Accessing node
• Traverse 1
• Traverse 2
• Node insertion
• Insertion possibilities
• Modify data
• Insertion to front of empty list
• Insertion to front of non empty list
• Insertion to end of list
• Insertion to middle of list
• Insertion to sorted list
• Deletion from empty list
• Deletion of first node
• Deletion of middle node
• Insertion to doubly linked list
• Deletion from double linked list
• Circular double linked list

Recursion

• Analogy
• Programming Example
• Factorial Using Recursion
• Factorial Using Recursion (Program)
• Fibonacci Sequence
• Towers of Hanoi
• Fast Exponentiation Even
• Fast Exponentiation Odd
• Reverse String
• Multiply Two Numbers

Algorithm Analysis

• Algorithm Analysis
  

Stacks

• Push operation
• Pop operation
• Evaluating postfix expression
• Converting infix to postfix
• IsEmpty function
• IsFull function
• Peek function

Queues

• Queue
• FIFO Nature
• Enqueue Operation
• Dequeue Operation
• Peek Operation
• Array Implementation 1
• Array Implementation 2
• Circular Implementation
• Circular Implementation 2
• Question 1
• Question 2
• Question 3
• Question 4

Trees

• Tree
• Depth first search
• Preorder
• Inorder
• Postorder
• Traverse
• Breadth first search
• Breadth first traverse
• All traverses
• BST insertion
• BST searching example 1
• BST searching example 2
• Deletion: node with one child 1
• Deletion: node with one child 2
• Deletion: node with two children
• MCQ

Sorting

• Selection sort
• Insertion sort
• Bubble sort
• Bubble sort 2
• Merge function
• Merge sort
• Partition
• Quick sort
• Question 1
• Question 2
• Question 3
• Question 4
• Question 5
• Question 6
• Question 7

Graphs

• Adjacency matrix
• Adjacency list 1
• Adjacency list 2
• Depth first traversal
• Breadth first traversal

Hash Tables

• Hash function
• Collision
• Linear probing
• Bucket hashing
• Separate chaining 1
• Separate chaining 2
• Question

Heaps

• Max heap
• Min heap
• Add node
• Percolate up
• Delete node
• Percolate down
• Building heap
• Implementing heap
• Question 1
• Question 2
• Question 3
• Question 4

• test