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
C: What, Why and How?
C: What, Why and How?
Instructor:
admin
Duration:
22 mins
Full Screen
Close
Next
Simplified model of a computer
0 Comment(s)
Login to comment
Introduction
1.1
C: What, Why and How?
22 min
1.2
Simplified model of a computer
19 min
1.3
Tools for Coding
10 min
Basics with example
2.1
Input and Output
32 min
2.2
Choosing one option vs another
21 min
2.3
Repeating over and over
24 min
2.4
Reuse and Simplify
18 min
Let's dive in
3.1
Character Set in C
15 min
3.2
Keywords and Identifiers
13 min
3.3
Data Types
29 min
3.4
Variables
14 min
3.5
Constants
25 min
3.6
Input and Output
30 min
3.7
Formatting input and output
30 min
Operators and Expressions
4.1
Integer Arithmetic Operations
10 min
4.2
Floating Point Arithmetic operations
7 min
4.3
Assignment Operators
10 min
4.4
Increment & Decrement Operators
8 min
4.5
Solved Problem
4 min
4.6
Logical or Boolean operators
10 min
Why study DS and Algorithms?
5.1
Why study DS and Algorithms?
20 min
What are Data Structures?
6.1
What are Data Structures?
12 min
Insertion Sort
7.1
How it works: Card-sorting
20 min
7.2
Pseudo code
24 min
7.3
Correctness
6 min
7.4
In-place sorting
8 min
7.5
Stable sort
15 min
7.6
Online sorting
10 min
Analyzing an algorithm
8.1
Model of computation
17 min
8.2
Space and time analysis of Insertion Sort-1
7 min
8.3
Space and time analysis of Insertion Sort-2
22 min
Big O, Theta, Omega notation
9.1
Insertion sort: Big O-notation
15 min
9.2
Notations: Big O
15 min
9.3
Notations: Big Omega, Theta
9 min
9.4
Notations: Small O, Omega, Theta
24 min
9.5
Relationships between various notations
21 min
9.6
Order of common functions & real world applications.
26 min
9.7
Why does asymptotic analysis matter in the real world?
16 min
Merge Sort
10.1
Why learn another sorting algorithm?
6 min
10.2
How it works: Intuition
17 min
10.3
Pseudo Code
19 min
10.4
Merge sort: Analysing time & space complexity
21 min
10.5
Recursion tree method: intuition
13 min
10.6
External Merge-Sort
25 min
Longest Common Prefix
11.1
Longest Common Prefix: Problem Statement [Leetcode]
4 min
11.2
Longest Common Prefix: Approach 1 [Leetcode]
6 min
11.3
Longest Common Prefix: Python code [Leetcode]
7 min
11.4
Longest Common Prefix: Approach 2[Leetcode]
4 min
11.5
Longest Common Prefix: Python code [Leetcode]
6 min
Close