Scribd
Upload
205 views2 pages

C++ DSA Placement Course Overview

The document provides a study plan for tech placements that includes: 1) A breakdown of core topics in computer science like arrays, strings, recursion, trees, graphs and their associated time required and number of practice questions. 2) Links to video courses and books for further learning resources. 3) Additional theory topics like OOPs, DBMS, operating systems, and computer networks that are important for placements. 4) A note that more advanced topics like tries, segment trees and Fenwick trees should be attempted after completing the core topics.

Uploaded by

Prakash Gavel
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
205 views2 pages

C++ DSA Placement Course Overview

The document provides a study plan for tech placements that includes: 1) A breakdown of core topics in computer science like arrays, strings, recursion, trees, graphs and their associated time required and number of practice questions. 2) Links to video courses and books for further learning resources. 3) Additional theory topics like OOPs, DBMS, operating systems, and computer networks that are important for placements. 4) A note that more advanced topics like tries, segment trees and Fenwick trees should be attempted after completing the core topics.

Uploaded by

Prakash Gavel
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

Tech Placements

For Language Basics : Index (1, 2, 3, 4, 5, 6, 7) | 10-15 Days

TOPIC No. of Days Minimum Qs Video Index in C++ Placement


Course
Time & Space 1 15 7.1
Complexity
Arrays (with 8 40 8.1 to 8.6
Searching) 9.1 to 9.2
Sorting 10.1

String (Basics) 1 4 13.1 to 13.2


Recursion & 2 10 16.1 to 16.4
Backtracking 18.1 to 18.3
Sorting 1 4-6 19.1 to 19.2
(Quick & Merge) 20.1 (count sort)*
Linked List 2 10 22.1 to 22.11
Stacks & Queues 2 8 23.1 to 23.9
24.1 to 24.5
Binary Trees 6 30 27.1 to 27.16
Binary Search Trees 28.1 to 28.11
Heaps & Priority 2 10 31.1 to 31.6
Queue
Hashing 2 10 32.1 to 32.8
Greedy Algorithm 2 10 33.1 to 33.7
DP Algorithm 5 25 35.1 to 35.20
Graphs 5 25 34.1 to 34.19
String (Advanced) 1 4 39.1 to 39.4
Tries* 1 4 36.1 to 36.4
Segment Trees* 2 5-7 40.1 to 40.7
Fenwick Trees* 1 3 41.1 to 41.3

*Do these topics at the end, as you must complete the important ones first.
**Additional Topics : Bit Manipulation, 2-Pointer Approach

C++ Placement Course : [Link]


Practice Questions for Time & Space Complexity : Cracking The Coding Interview by G. L. McDowell

Theory Topics
1. OOPS (21.1 to 21.4 of C++ Placement Course)
- Objects & Classes
- Abstraction
- Inheritance
- Polymorphism
- Encapsulation

2. Database Management Systems (DBMS)


- SQL
- ACID Properties (Atomicity, Consistency, Isolation, Durability)
- Use of B & B+ Trees
- Concurrency Control

3. Operating Systems
- What is an OS?
- CPU Scheduling algos
- Compiler, Interpreter, Loader, Linker
- Paging, Segmentation
- Process Synchronization
- Threads
- Deadlocks
4. Computer Networks
- OSI Model (Layers in Detail)
- TCP/IP Model
- Devices (Router, Switch, Hub, Repeater, Bridge, Gateways)
- TCP vs UDP
- Network Topologies

You might also like