Scribd
Upload
9 views2 pages

CPP-STL time table

The document outlines an 8-week course plan for learning C++ and its Standard Template Library (STL), covering topics such as basics, flow control, data structures, and algorithms. Each week consists of specific daily topics, practice problems, and contests to enhance learning. The plan is flexible, allowing candidates to adapt it based on their availability and efficiency while encouraging simultaneous contest participation.

Uploaded by

teseja3360
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views2 pages

CPP-STL time table

The document outlines an 8-week course plan for learning C++ and its Standard Template Library (STL), covering topics such as basics, flow control, data structures, and algorithms. Each week consists of specific daily topics, practice problems, and contests to enhance learning. The plan is flexible, allowing candidates to adapt it based on their availability and efficiency while encouraging simultaneous contest participation.

Uploaded by

teseja3360
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Week 1

● Day – 1, 2 & 3 : Basics of C++, input/output, loops, operator,


array and string etc.
● Day – 4 : Flow control, Function & Loops
● Day – 5 : Arrays, Strings, Pointer & Reference
● Day – 6 : Structure and Union

Week 2
• Day-1, 2 & 3: Introduction to STL and its Application, iterators and
Templates.
• Day 4, 5: Function and Class Templates in C++.
• Day – 6 : Practice all the available questions, and attempt Contest
1.

Week 3
• Day-1 : Pairs in C++ STL
• Day-2 : Sort an array according to another array.
• Day 3, 4, 5: Vector declaration, how internally work and Sample
Problem.
• Day-6: Solve all the available practice problems.

Week 4
• Day-1, 2 & 3: List, Forward List in STL, josephus problem using list in
STL and a sample Design problem.
• Day 4 & 5: Deque in C++ STL, Sliding window maximum and a
sample Design problem.
• Day – 6 : Practice all the available problems till here.

Week 5
• Day-1, 2: Stack in C++ STL, Stock span, balanced parenthesis and
Next Greater element.
• Day 3: Queue in C++ STL, Reverse first k items in a queue.
• Day 4, 5: Priority Queue in C++, Kth largest element, K most
frequent elements, sort array using priority queue.
• Day – 6 : Practice all the available problems of this track.
Week 6
• Day-1, 2 : Set and MultiSet in C++ STL, sample designing problem.
• Day 3, 4 : Map and Multimap in C++ STL, sample designing
problem, Unordered set in C++ STL.
• Day – 5 : Unordered Map in C++ STL, sample problems.
• Day – 6 : Solve all the available practice problems and attempt
contest 2.

Week 7
• Day-1, 2 & 3: Find, lower and upper bound, fill, rotate, accumulate,
rand, and median.
• Day 4, 5: Sort in C++ STL, merge, reverse, permutation and
sample problems.
• Day – 6 : Practice : All the available problems and attempt contest
3.

Week 8
● Day-1, 2, 3: String in C++, pattern searching, pangram checking.
● Day – 4, 5, 6: sample problems, popcount() and tuple in C++
STL.
● Day-7 onwards: Practice Must do interview questions for
Data Structures and Algorithms.

Note 1: This is a recommended plan to complete the course, but it is the


complete discretion of the candidates to choose their way of completion of
the course depending on the availability and efficiency of the course.

Note 2: Also while solving tracks it is advisable to complete the Contests


simultaneously

You might also like