Study Materials

Syllabus

Von Neumann

Von Neumann

Registers

Registers

Debug

Debug

X86 Architecture

X86 Architecture

Module 1

Module 1

Assembly Language (Introduction)

Assembly Language

Module 8

Module 8 focuses on Dynamic Programming

Module 7

Module 7 focuses on graph algorithms:

Module 6

Module 6 covers transform and conquer algorithms:

Module 5

Module 5 - discusses decrease and conquer algorithms:

Module 4

Module 4 delves into divide and conquer algorithms:

Module 3

Module 3 explores brute force algorithms and their applications.

Module 2

Module 2 introduces foundational algorithmic concepts, recursion, and complexity analysis:

Module 1

This module introduces the foundational concepts of algorithms and their role in solving computational problems. The key objectives are to define what an algorithm is, list the steps involved in solving problems algorithmically, and discuss the essential characteristics of algorithms.

Decrease and Conquer (DFS, BFS)

Decrease and Conquer (DFS, BFS)

Stude Notes 2 - Concurrent Programming

Stude Notes 2 - Concurrent Programming

Study Notes 1 - Threads

Study Notes 1 - Threads