Download as xlsx, pdf, or txt
Download as xlsx, pdf, or txt
You are on page 1of 2

Days

5
6
7
8
9
10

11

12
13
14
15
Topics
Modular Programming
Problem solving using modular programming, Inter module communications, Memory references as
parameters, Coding on various scopes of data in the code,
Examples,
Recursive Practice problems.
Algorithms
Problem solving approaches implementing recursions, Evaluation of Recursive algorithms, Significance
of mathematical Recurrence Relations, Evaluation of recurrence relations, Time Analysis, Examples,
Practice problems
User-Defined Datastructures
Requirement of User-Defined data, Problem solving implementing structures, Nested Structures,
Unions, Enumeration, Usage of Preprocess statements in coding problems, Examples, Practice
problems
Structure Pointers & Linked lists
Structure member reference, Coding on Structure member pointer reference, Coding to form links,
Example codes, Introduction to Linked list coding, Problem solving on Insertion, deletion, search and
traversal operations
Problem on linked
solving through lists, list
Linked Practice Problems on Linked lists
Classical Problems on Linked Lists: Comparing two linked lists for equality, finding the merge point,
concatenating two linked lists, pseudo code solutions for linked lists, Introduction to Circular Linked
Lists, Operations on CLL, Introduction to Double Linked Lists, operations on DLL, Essential Practice
problems of sorting Algorithms. Problem solving using Quick Sort, Merge Sort, O(n log n) algorithms,
Evaluation
Examples,forPractice
solutions problems of stack using a linked list, Problem solving on expression conversion
the implementation
and evaluation
Problem solving using Queues, Coding solutions for the implementation of Queue using an array,
Coding solutions for the implementation
Problem solving approaches of Queue
using Non-linear datausing a linked
structures, list, Examples,
Coding problems Practice problems.
on the height of a
binary tree, Size of a binary tree, Tree order traversals, Problem Solving on Binary Trees.
Search Trees, Coding on a binary search tree problems, Search/probe sequence validation, Example
problems
Algorithms – Greedy Methods - I
Greedy Strategy, Problem solving on greedy problems: coin change, fractional Knapsack, Scenario
based problem solving implementing Greedy Methods, Practice problems
Algorithms – Greedy Methods - II
Job sequencing solutions, Activity selection problem, Scenario based problem solving implementing
Greedy Methods, Practice Problems
Dynamic Knapsack, Trip optimization problem, Scenario based problem solving using Dynamic
Programming approaches
Coding solutions on Coin-change sub structure, Comparison of Greedy Vs DP for Coin change, Sum of
sub
Problem solving onProblem
sets problem, Longestsolving
Common using
SubGrid Memo
string, Longest Common subsequence and Minimum Edit
Distance problems

You might also like