Self Paced Course
Advanced Software System Design
Advanced DSA for FAANG interviews
Software System Design
200 Leetcode Challenge – Coding Interview
DSA Using c++
DSA Using Python
DSA Using Java
Design Patterns Using Python
Data Science Basic & Advanced
Linux Kernel & Device Driver
Live Training
Data Structure & Algorithms
Software System Design (HLD, LLD)
Full Stack Development
Data Science
Digital Marketing
Cloud Certification – Coming Soon
Block Chain – Coming Soon
Cyber Security – Coming Soon
Offerings
Live Batch
Self Paced
Event
Contact us
Job Guarantee
Hire From Us
Corporate Training
Become Our Instructors
COURSES
OFFERINGS
EVENT
CONTACT US
LOGIN
Login
Self Paced Course
Advanced Software System Design
Advanced DSA for FAANG interviews
Software System Design
200 Leetcode Challenge – Coding Interview
DSA Using c++
DSA Using Python
DSA Using Java
Design Patterns Using Python
Data Science Basic & Advanced
Linux Kernel & Device Driver
Live Training
Data Structure & Algorithms
Software System Design (HLD, LLD)
Full Stack Development
Data Science
Digital Marketing
Cloud Certification – Coming Soon
Block Chain – Coming Soon
Cyber Security – Coming Soon
Offerings
Live Batch
Self Paced
Event
Contact us
Live Batch
Self Paced
Self Paced Course
Advanced Software System Design
Advanced DSA for FAANG interviews
Software System Design
200 Leetcode Challenge – Coding Interview
DSA Using c++
DSA Using Python
DSA Using Java
Design Patterns Using Python
Data Science Basic & Advanced
Linux Kernel & Device Driver
Live Training
Data Structure & Algorithms
Software System Design (HLD, LLD)
Full Stack Development
Data Science
Digital Marketing
Cloud Certification – Coming Soon
Block Chain – Coming Soon
Cyber Security – Coming Soon
Offerings
Live Batch
Self Paced
Event
Contact us
Self Paced Course
Advanced Software System Design With Projects for FAANG Interviews
Software System Design (HLD & LLD)
Advanced Data Structures and Algorithms for FAANG interviews
200 Leetcode Challenge – Coding Interview
Data Structure & Algorithm – C++
Data Structure & Algorithm – Python
Data Structure & Algorithm – Java
Design Patterns Using Python
Data Science Basic & Advanced
Linux Kernel & Device Driver
Live Training
Full Stack Development
Software System Design (HLD & LLD)
Data Structure & Algorithm
Data Science
Digital Marketing
Cloud Certification – Coming Soon
Blockchain – Coming Soon
Cybersecurity – Coming Soon
Course Content
Linux Kernel And Device Driver
0/71
Classification of programming language, Compilation vs Interpretation, Compilation stages, Linux Introduction
02:36:12
A – Doubt session – Oracle busy box config
06:42
B – X86 Assembly level language, Calling convention
02:26:57
GCC Assembler Directives, Inline Assembly, shared and dynamic libraries
02:32:39
Error handling, System programming, Process management command, Profiling, Code coverage command, Basics of debugging
02:28:26
Debugging, GDB, Follow fork mode, Address Sanitizer, GDB coredump, Valgrind
02:15:02
System programming, File Operation, Open, Read, Write, Lseek etc
02:37:23
System programming, File Operation, Fcntl, Dupe etc, I-O Multiplexing,
02:51:54
System programming, File Operation – Fread, Fwrite. Makefile
02:31:32
Makefile, Variables, Wildcard, Implicit rule, Phony
02:15:31
Process Management – fork & vfork, clone, getpid, getppid, exit
02:20:49
Process Management – Wait, Waitpid. Thread management, IPC
02:22:30
IPC – Pipe, Named Pipe, Message Queue
01:55:40
IPC – Message queue, Shared Memory
02:25:14
IPC – Named PIPE example, Semaphore, Signals, Critical sectionsson
02:33:09
Synchronization mechanism – Mutex, Conditional variable, Process scheduling
02:25:32
User Groups, Memory management, OOM Killer
02:17:10
Linux Kernel Internals – Introduction, Kernel space, user space, kernel versioning, Kernel source tree, Building qemu
02:27:51
Linux kernel programming – development environment, UML kernel image
02:44:21
Debugging Qemu kernel image, Building kernel image with inbuilt rootfs, Setting up Raspberry pi board, Bootup sequenc
02:37:42
Ull, Kernel helper function, Kernel logs, Printk, Module programmingML, System ca
01:48:37
UML Kernel handson, UML with Filesystem, Open OCD jTag, jTag pin connection with Raspberry pi, Hello World module
02:32:20
Storage strategy, startup init program
02:20:35
Timer, Kthread
02:04:04
Timers, Kthreads, Bottom halves – Tasklets, Workqueue
02:23:22
Doubt session
05:01
Export symbol, Synchronization
02:07:20
Signal, Spinlock, SeqLock
02:16:38
Interrupt safe, SMP-safe, Preempt-safe, Barriers, Kernel data structures
02:35:07
Interrupts, Threaded IRQ, Soft IRQ
02:33:20
Character driver driver, Device fClass ile conceptaft Lesson
02:49:18
Misc Driver, Device tree
02:44:03
Device tree – Discoverable & Non Discoverable, Device tree – x86 & ARM, Platform Driver
02:35:55
Device tree overlay, Platform driver on RPI, GPIO driver, Input driver. Respberry connection serial cable
02:31:35
GPIO Driver & Interrupts, Input Driver
01:58:12
I2C Protocol, I2C driver Linux, SSD1306, I2C – Adaptor & Algorithm
02:22:46
I2C Driver ( Bit banging method ) – GPIO, SPI Driver
02:11:13
GPIO Using sysfs, I2C User Space, PWM
02:04:13
GPIO Controller driver, UART Subsystem
02:44:33
Kernel Module context, RTC
02:00:01
Ideal Task creation, UML debugging, Watchdog, Regmap API
02:06:52
IIO driver, USB
02:33:14
USB driver, Endpoint descriptor, URB
02:23:47
USB Hands-on, PCI driver
02:18:27
EK-TM4C123GXL USB Launchpad Device, PCI Driver, PCI Driver configuration space
02:03:06
EK-TM4C123GXL USB Hands-on, PCI Hands-on
02:06:48
Block driver, Gendisk Functions
02:19:06
Networking Introduction, Network driver
02:06:46
NTP, Bonding, VLAN, SK_Buff, Net_device, Queueing Discipline
02:33:48
Network Interface, Important Macros and functions, NAPI, Packet transmission & Reception,Code walk
02:01:43
Token bucket, Queueing discipline – HTB States, SK Buffer, NAPI API
02:23:49
Net device structure in detail, Interaction between NIC device and kernel, Transmission & reception Path
01:50:54
Debugging, ARP, IPV4
01:48:45
IP Layer internals & Debugging
01:43:05
IP Tables, iptable – process flow, targets, Commands, Persistence changes, Routing, Routing Table, BGP, OSPF
01:32:15
Doubt session SPI
21:08
DHCP, DNS, NTP
01:38:21
a – Doubt session SPI
23:10
Kernel Socket Implementation, TCP States, Netfilter, Netcat. – HD 1080p
01:59:52
UIO Driver, Process Management
01:30:00
Process Management, scheduling
02:07:48
Process Management – CFS
01:47:39
a – Doubt session -CFS & Dasy chaining,Acessing USB
25:22
Process Management – RT, Shed Class – STOP, Deadline, Idle, Preemption, Context Switch, Process States
01:51:51
Process Management Tool – LTTng, RTLinux
02:06:37
Linux Memory Management
01:56:42
Page Allocator, Slab, Slub, Slob, Debugging, KASAN, Interrupt Management, Kernel Vulnerability and Hacking
01:53:51
Interrupt Management – x86, Debugging
02:09:33
Linux kernel debugging, deadlock debugging, Crash dump
01:49:32
Crashdump, Dump_stack, syslog, Trace command
02:02:16
Debugging memory related issue, Decoding OOPs, KASAN, Exploring Crash tool, BPF
02:24:14
Time Complexity
0/16
1 – Time Complexit
06:48
2 – Big O Notation
10:06
3 – Binary Search and its Recurrence Relation
19:16
4 – Question on Time Complexity I
04:16
5 – Master’s Theorem
10:24
6 – Big O Complexity Comparison
04:37
7 – Question on Time Complexity II
20:27
8 – Occurrence of an integer
04:25
9 – Find Minimum path
16:06
10 – Find Minimum path – Optimization
12:59
11 – Time Complexity Notations
15:49
12 – Examples and Questions
07:09
13 – Recap
03:06
14 – Key Takeaways
03:09
15 – Time Complexity.pdf
Quiz
Array
0/9
1 – Find the missing and the repeated number in the array
35:30
2 – Find the missing and the repeated number in the array
36:13
2 – 2 Sum problem
19:49
3 – 2 Sum problem
19:49
4 – 3 Sum problem
12:25
5 – Majority Element in the Array
29:35
6 – Recap
02:21
Array.pdf
Array Quiz
Linked list
0/15
1 – Why do we use Linked List
14:44
2 – What are Linked Lists
06:25
3 – How to create a Linked List
25:57
4 – Deleting a node in a Linked List
16:32
5 – Finding Mid-point of a Linked List
10:36
6 – Detecting Cycle in a Linked List
08:51
7 – Removing Cycle in a Linked List
18:24
8 – Reversing a Linked List
05:21
9 – Big Integer Problem
58:45
10 – Add two big numbers
53:39
11 – Introduction to Doubly Linked List
04:38
12 – Insertion and deletion in Doubly Linked List
11:39
13 – Comparison between Singly Linked List and Doubly Linked List
04:06
Linked List.pdf
Quiz
Stack
0/7
1 Introduction to Stacks
32:02
2 Question on Stacks using STL C++
13:10
3 Postfix Expression Evaluation
27:14
4 Infix to Postfix Evaluation
16:49
5 Next Greater Element
36:07
Stacks.pdf
Stack Quiz
Queue
0/4
1 Introduction to queues
34:45
2- Sliding Window Question
05:26
Queues.pdf
Queue Quiz
Dictionary and Sets STL
0/3
1- Introduction to Dictionary Set
20:11
2- Basics of Dictionary & Sets.pdf
Quiz
Sorting
0/14
1 – Merge Sort
30:43
2 – Quick Sort
33:04
3 – Comparison between Merge Sort, Quick Sort and STL
09:16
4 – Count Sort
16:57
5 – Bucket Sort
08:24
6 – Radix Sort
16:54
7 – Comparison between Count Sort and Bucket Sort
02:47
8 – Problem Count Inversions 1
25:19
9 – Discussion Sort a linked list
01:16
10 – Problem Count Inversions 1 Code Discussion
04:11
11 – Problem Sort a linked list
14:20
12 – Problem Nut and Bolt Problem
08:56
Sorting.pdf
Quiz
Binary Trees
0/13
1 – Introduction to Trees
21:06
2 – Traversal in Binary Trees (Inorder, Preorder, Postorder)
28:01
3 – Level Order Traversal of Binary Trees
10:18
4 – Spiral Order Traversal of Binary Trees
09:34
5 – Views of a Binary Tree (Left, Right)
16:13
6 – Top Bottom View of a Binary Search Tree
21:25
7 – Problem Binary Tree Right Side View
33:23
8 – Problem Validate Binary Search Tree
35:57
9 – Problem Diameter of a Binary Tree
29:10
10 – Post Session Discussion
05:16
11 – Diameter of a Binary Tree
05:07
Binary Tree.pdf
Quiz
Binary Search Tree
0/8
1 – Introduction to Binary Search Trees (BST)
07:10
2 – ChecK if a Binary Tree is a BST or not
13:17
3 – Properties of Binary Search Trees
10:05
4 – Searching in Binary Search Trees
19:44
5 – Balanced Binary Search Trees
06:38
6 – Dictionaries bases on Hashing
06:06
7 – Comparison between Hash Map and Tree Maps
04:11
8 – Insertion Deletion in Binary Search Trees
13:51
Heap
0/9
1 – Introduction
03:27
2 – Binary Heap
29:19
3 – Heapify
31:30
4 – Min and Max Heap
26:45
5 – Operations in heaps
22:31
6 – Heap Sort
20:52
7 – Kth smallest largest element from array
02:31
Binary Heaps.pdf
Quiz
Graph
0/12
1 – Introduction to Graphs
05:21
2 – Representation of Graphs
42:14
3 – Types of Graphs
09:07
4 – Depth First Search Traversal of Graphs
32:57
5 – Breadth First Search Traversal of Graphs
09:42
6 – Comparison between DFS and BFS
03:57
7 – Directed Graph – Cyclic and Acyclic
03:20
8 – Cycles and their Detection
41:37
9 – Topological Sorting
40:59
10 – Shortest Paths – Single Source
36:33
Graphs.pdf
Quiz
Dynamic Programming
0/11
1 – Sum of array elements
11:55
2 – Rod Cutting Problem
29:03
3 – Coin Change Problem
18:35
4 – Subset Sum Problem
25:19
5 – Knapsack Problem
32:49
6 – Coin Game
47:45
7 – Edit Distance
26:28
8 – Bursting Balloons
21:43
10 – Longest Common Subsequence
16:25
Dynamic Programming.pdf
Quiz
Tries
0/3
1 – What are Tries
22:07
2 – Application of Tries
28:03
Tries.pdf
Bit Wise operation
0/4
1 – Bitwise Operations
15:24
2 – Questions on Bitwise Operation
23:36
Bitwise Operation.pdf
Bitwise Quiz
Disjoint set
0/1
1 – Disjoint set
01:11:26
Add-ons
0/7
Leetcode Google Interview questions – Stack
Zoom Real time video chatting – Websocket, WebRTC
Understanding Binary Search – Latest Google Coding Interview Question
Leetcode Google Interview questions – Sorting
Leetcode Google Interview questions – Queue
Leetcode Google Interview questions – Hashing
Resume Building
59:23
Linux Kernel & Device Driver
Overview
Exercise Files
About Lesson
Exercise Files
No Attachment Found
0%
Complete
Mark as Complete
Insert/edit link
Close
Enter the destination URL
URL
Link Text
Open link in a new tab
Or link to existing content
Search
No search term specified. Showing recent items.
Search or use up and down arrow keys to select an item.
Cancel