Have any question ?
+91 8080-806-983
interviewprep@appliedroots.com
Register
Login
COURSES
C Programming
Interview Preparation Course
CRT Program
Diploma in AI and ML
Courses
C Programming
Interview Preparation Course
Success Stories
Forum
FAQ'S
Team
Contact Us
Home
Courses
CRT Program
Terminology & Traversals
Terminology & Traversals
Instructor:
admin
Duration:
18 mins
Full Screen
Close
This content is restricted. Please
Login
Prev
Next
Logical structure & implementation
Satellite data and key
Why study DS and Algorithms?
1.1
Why study DS and Algorithms?
20 min
What are Data Structures?
2.1
What are Data Structures?
12 min
Arrays
3.1
One-dimensional array
17 min
3.2
Multi-dimensional array
31 min
Linked List
4.1
Structure & memory organization
19 min
4.2
Code for node
4 min
4.3
Insertion
19 min
4.4
Deletion
13 min
4.5
Array vs Linked Lists
3 min
Stacks
5.1
Introduction to Stacks
12 min
5.2
Stack Operations: Push and Pop
5 min
Queues
6.1
Motivation: Why we need them?
8 min
6.2
Operations: Enqueue and Dequeue
5 min
Trees
7.1
Logical structure & implementation
12 min
7.2
Terminology & Traversals
18 min
Insertion Sort
8.1
Satellite data and key
11 min
8.2
How it works: Card-sorting
20 min
8.3
Pseudo code
24 min
8.4
Correctness
6 min
8.5
In-place sorting
8 min
8.6
Stable sort
15 min
8.7
Online sorting
10 min
Analyzing an algorithm
9.1
Model of computation
17 min
9.2
Space and time analysis of Insertion Sort-1
7 min
9.3
Space and time analysis of Insertion Sort-2
22 min
Big O, Theta, Omega notation
10.1
Insertion sort: Big O-notation
15 min
10.2
Notations: Big O
15 min
10.3
Notations: Big Omega, Theta
9 min
10.4
Notations: Small O, Omega, Theta
24 min
10.5
Relationships between various notations
21 min
10.6
Order of common functions & real world applications.
26 min
10.7
Why does asymptotic analysis matter in the real world?
16 min
Merge Sort
11.1
Why learn another sorting algorithm?
6 min
11.2
How it works: Intuition
17 min
11.3
Pseudo Code
19 min
11.4
Merge sort: Analysing time & space complexity
21 min
11.5
Recursion tree method: intuition
13 min
11.6
External Merge-Sort
25 min
Close