How does a web session work
Placement Mentor
How does a web session work
8:48
MySQL tutorial for beginners - Full Course
Placement Mentor
MySQL tutorial for beginners - Full Course
3:09:00
8 detective riddles to test your logic skills
Placement Mentor
8 detective riddles to test your logic skills
12:07
7 riddles to test your brain power
Placement Mentor
7 riddles to test your brain power
7:45
DS-42: Graph Representation - Part 3 - Adjacency list
Placement Mentor
DS-42: Graph Representation - Part 3 - Adjacency list
27:51
DS-41: Graph Representation - Part 2 - Adjacency Matrix
Placement Mentor
DS-41: Graph Representation - Part 2 - Adjacency Matrix
14:45
DS-40: Graph Representation - Part 1 - Edge List
Placement Mentor
DS-40: Graph Representation - Part 1 - Edge List
13:45
DS-39: Properties of Graphs
Placement Mentor
DS-39: Properties of Graphs
15:16
DS-37: In-order successor in a binary search tree
Placement Mentor
DS-37: In-order successor in a binary search tree
17:52
DS-38: Introduction to graphs
Placement Mentor
DS-38: Introduction to graphs
16:43
DS-36: Delete a node from Binary Search Tree
Placement Mentor
DS-36: Delete a node from Binary Search Tree
17:48
DS-35: Check if a binary tree is binary search tree or not
Placement Mentor
DS-35: Check if a binary tree is binary search tree or not
16:30
DS-34: Binary tree traversal - Preorder, Inorder, Postorder
Placement Mentor
DS-34: Binary tree traversal - Preorder, Inorder, Postorder
14:30
DS-33: Binary tree - Level Order Traversal
Placement Mentor
DS-33: Binary tree - Level Order Traversal
11:23
DS-32: Binary tree traversal - breadth first and depth first strategies
Placement Mentor
DS-32: Binary tree traversal - breadth first and depth first strategies
11:54
DS-31: Find height of a binary tree
Placement Mentor
DS-31: Find height of a binary tree
7:09
DS-30: Find min and max element in a binary search tree
Placement Mentor
DS-30: Find min and max element in a binary search tree
5:48
DS-29: BST implementation - memory allocation in stack and heap
Placement Mentor
DS-29: BST implementation - memory allocation in stack and heap
13:05
DS-28: Binary search tree - Implementation in C/C++
Placement Mentor
DS-28: Binary search tree - Implementation in C/C++
18:36
DS-27: Binary Search Trees
Placement Mentor
DS-27: Binary Search Trees
19:28
DS-26: Binary Trees
Placement Mentor
DS-26: Binary Trees
10:27
DS-25: Introduction to Trees
Placement Mentor
DS-25: Introduction to Trees
15:50
DS-24: Linked List implementation of Queue
Placement Mentor
DS-24: Linked List implementation of Queue
14:17
DS-23: Array implementation of Queue
Placement Mentor
DS-23: Array implementation of Queue
14:59
DS-22: Introduction to Queues
Placement Mentor
DS-22: Introduction to Queues
9:19
DS-21: Infix to Postfix using stack
Placement Mentor
DS-21: Infix to Postfix using stack
18:20
DS-20: Evaluation of Prefix and Postfix expressions using stack
Placement Mentor
DS-20: Evaluation of Prefix and Postfix expressions using stack
14:10
DS-19: Infix Prefix and Postfix
Placement Mentor
DS-19: Infix Prefix and Postfix
13:38
DS-18: Check for balanced parentheses using stack
Placement Mentor
DS-18: Check for balanced parentheses using stack
14:13
DS-17: Reverse a string or linked list using stack
Placement Mentor
DS-17: Reverse a string or linked list using stack
16:25
DS-16: Linked List implementation of stack
Placement Mentor
DS-16: Linked List implementation of stack
10:58
DS-15: Array implementation of stacks
Placement Mentor
DS-15: Array implementation of stacks
10:40
DS-14: Introduction to stack
Placement Mentor
DS-14: Introduction to stack
8:26
DS-13: Doubly Linked List - Implementation in C/C++
Placement Mentor
DS-13: Doubly Linked List - Implementation in C/C++
15:22
DS-12: Introduction to Doubly Linked List
Placement Mentor
DS-12: Introduction to Doubly Linked List
7:13
DS-11: Reverse a linked list using recursion
Placement Mentor
DS-11: Reverse a linked list using recursion
8:55
DS-10: Print elements of a linked list in forward and reverse order using recursion
Placement Mentor
DS-10: Print elements of a linked list in forward and reverse order using recursion
14:24
DS-09: Reverse a linked list - Iterative method
Placement Mentor
DS-09: Reverse a linked list - Iterative method
13:50
DS-08: Linked List in C/C++ - Delete a node at nth position
Placement Mentor
DS-08: Linked List in C/C++ - Delete a node at nth position
12:30
DS-07: Linked List in C/C++ - Insert a node at nth position
Placement Mentor
DS-07: Linked List in C/C++ - Insert a node at nth position
15:15
DS-06: Linked List in C/C++ - Inserting a node at beginning
Placement Mentor
DS-06: Linked List in C/C++ - Inserting a node at beginning
12:50
DS-05: Linked List - Implementation in C / C++
Placement Mentor
DS-05: Linked List - Implementation in C / C++
13:59
DS-04: Arrays vs Linked Lists
Placement Mentor
DS-04: Arrays vs Linked Lists
12:16
DS-03: Introduction to linked list
Placement Mentor
DS-03: Introduction to linked list
17:13
DS-02: List as abstract data type
Placement Mentor
DS-02: List as abstract data type
13:08
DS-01: Introduction to data structures
Placement Mentor
DS-01: Introduction to data structures
6:34
How to crack off-campus placements (IT companies) - Part 2 - How to build a strong profile
Placement Mentor
How to crack off-campus placements (IT companies) - Part 2 - How to build a strong profile
19:03
How to crack off-campus placements (IT companies) - Part 1 - What to study
Placement Mentor
How to crack off-campus placements (IT companies) - Part 1 - What to study
20:43