Course title : Data Structures and Algorithms

About : In this program we start with absolute basics of programming, cover fundamentals of data structures & algorithms, problem solving and end with understanding core topics like operating system, computer networks, dbms etc. At the end of program you would be having solid programming fundamentals to built upon.

Start Date : 16-Feb-2025

Mode : Offline i.e In person.

Total lectures : 20

Course duration: 2-2.5 months.

Timings & Venue :

2 hours classes each will be held on weekends (Sat/Sun). Timings would be notified prior to the course. Classes will be held in morning or evening. Classes will be held in Cyber one, Plot No. 4 & 6, Sector 30A, Vashi, Navi Mumbai. Details will be shared prior to program commencement.

Curriculum, Faqs and how to enrol : Check below for details.

Pre-requisite : None

Lecture 1

Introduction, Git, Programming Basics, Naming Conventions, Types, How Data is Stored in memory

Lecture 2

Typecast, Operators, Loops, Precedence of Operators, Keywords, Scope of Variables, Modulo Concept

Lecture 3

Functions, arrays

Lecture 4

Strings and 2D Arrays, Declaring Char, String, Immutability, String Pool, Concatenation, Jagged Array, Conversions Char to String Vice-Versa, Null Pointer Exception

Lecture 5

Search and Sort Algorithms

Lecture 6

Recursion on Array, Merge, Quick Sort Using Recursion, Subsequence of String, Array/Recursion Problems

Lecture 7

Time and Space Complexity, Time Complexity of Sort and Search Algorithms, Loops, Recursive Problems, Auxiliary Space, Max Space, Abstract Class and Function, Function Overloading, Overriding and Final Keyword

Lecture 8

Object-Oriented Programming, Exceptions

Lecture 9

Array List, Linked List, Types of LL, Generic Classes, Generic Methods

Lecture 10

Problems on Linked List

Lecture 11

Stack, Queue, Implementation, Operations, Time Complexity of these Operations

Lecture 12

Generic Trees, Time Complexity of Search in Tree, Binary Tree, BST, Types of Traversals

Lecture 13

Problems on Trees

Lecture 14

Hashset, Hashmap, Implementation, Time Complexity and Space Complexity, Problems

Lecture 15

Heaps and priority queues

Lecture 16

Dynamic Programming

Lecture 17

Dynamic Programming Problems

Lecture 18

Graph, graph Algorithms, backtracking, bit Magic, divide and Conquer, greedy Algorithms

Lecture 19

Question on Graph

Lecture 20

Bonus Topics: OS/Linux/MutliThreading/Computer Network/Basics of DBMS