Course Schedule

16th FEB, Sunday

ORIENTATION + ARRAYS

Speaker: PRITAM PAUL

Content

  • Introduction to Array Data Structure
  • Arrays Creation
  • Input, Output and Update
  • Arrays as Function Arguments

Problems

  • Largest Element
  • Reverse an Array
  • Pairs in an Array
  • Print SubArrays
  • Check if an Array is Sorted or not
17th FEB, Monday

STRINGS

Speaker: TUNIR ADHUKARY

Content

  • Introduction to String
  • Difference between String & Char array
  • String Inbuilt Functions
  • Basic Idea of MAP - SET

Problems

  • String size, isalnum - isalpha - toupper - tolower - string::npos uses, string - '0'=int
  • Reverse a String
  • Check if a String is Palindrome
  • Count the Number of Vowels and Consonants
  • Count Number of Words in a string
  • Print the words in the String which starts with a vowel
  • Find the Longest Word in a Sentence
23rd FEB, Sunday

SEARCHING

Speaker: SOHAM MONDAL

Content

  • Linear Search Explanation
  • Leetcode Problem as an example
  • Time Complexity Analysis
  • Binary Search explanation
  • Leetcode problem as an example (Basic Binary Search)
  • Time Complexity Analysis
  • Comparison of Linear Search and Binary Search
  • Problems on Search Space: Book Allocation, Aggressive Cows, Flower Bouquet
16th MAR, Sunday

STACK

Speaker: RIYA GUPTA

Content

  • Stack explanation
  • Implementation of Stack
  • Time complexity analysis
  • Problem Solving based on the above data structure
  • Monotonic Stack
17th MAR, Monday

QUEUE

Speaker: RIYA GUPTA

Content

  • Queue, Dequeue Explanation
  • Implementation of Queue, Dqueue
  • Time complexity analysis
  • Problem Solving based on the above data structure
  • Problems on CPU Scheduling
22nd MAR, Saturday

POINTERS AND LINKED-LIST BASICS

Speaker: SOHOOMLAL BANNERJEE

Content

  • Pointers
  • Basics of Singly Linked Lists
  • Stack and Queue Implementation Using Linked Lists
  • Different Types of Linked Lists
23rd MAR, Sunday

ADVANCED PROBLEMS ON RECURSIONS

Speaker: SOHOOMLAL BANNERJEE

Content

  • Problem-Solving Techniques
  • Pointer Manipulation and Traversal Strategies
  • Cycle Detection Using Optimized Techniques
  • Various Problem-Solving Approaches on Linked Lists