Placement 100
Complete Placement Preparation
This course will guide you for placements with theory, lecture videos, weekly assessments, contests and doubt assistance.
Pre-final, Final year students

14999 9999


*Get INR 500 Off
Use Coupon Code: EARLYBIRDP100
Valid for First 100 candidates

Online Course
Upcoming Batch: p-100
17 March to 17 March '22

Course Overview

Whether you’re preparing for product-based companies (like Amazon, Microsoft, Adobe, etc), startups (like Ola, Swiggy, Zomato, etc) and service-based companies (like TCS, Infosys, Cognizant, Deloitte, etc), this course is a one-stop solution for all. Placement 100 is a 6 months program comprising of an online course, assessment exam and placement assistance for top performers. The online course covers all the topics required to prepare for placements.
The course includes theory & lecture videos for improvised learning supported by tracks & contests for practice. It comes with a first-in-industry feature: Doubt Assistance to help you if you are stuck. The course will be followed by mock tests which will prepare you for the assessment exam. The assessment exam will be based on the whole course and will be similar to screening exams conducted by most companies. The top performers in the assessment exam will be prioritized in the placement program by GeeksforGeeks. The program also includes Mock Interviews after the assessment exam for the selected students.
This course is best suited for:

  • Final year students looking for placements
  • Pre-final year students preparing for placements
*The program is designed to prepare you for placements and does not provide any guarantee of the same

What You Will Learn

 

 

Course Features

  1. Learn
    • Theory content designed by our team of experts
    • Premium lecture videos by industry experts
  2. Practice
    • Tracks consisting of MCQs and programming questions
    • Weekly contests based on tracks
  3. Ask doubts
    • Discussion Forum for clearing doubts
    • Weekly doubt sessions for doubt assistance
  4. Compete
    • Assessment exam based on companys' screening exam pattern
    • Mock Tests to prepare for the assessment exam
  5. Get Placed
    • All students can apply to job openings after the course completion
    • Top performers in the assessment exam will be shortlisted on priority
  6. Mock Interviews
    • Similar to interview in top companies
    • Only for students shortlisted after the assessment exam
  7. Certificate upon Course Completion

 

 

 

 

 

 

Course Content

Programming Languages:

  • C++ : Introduction and Basic I/O, Variables, Operators, Loops, Arrays, String, Functions, Pointers and Dynamic Memory Allocation

  • Java : Introduction and Basic I/O, Variables , Operators, Loops, Arrays, String , Immutable Strings, ArrayList , BigInteger

 

 

 

 

 

Object Oriented Programming:

  • Classes and Objects

  • Inheritance and Polymorphism : Overloading and Overriding

  • Abstraction and Encapsulation

  • Access Modifiers

  • Friend and Virtual functions in C++

  • static, final, this and super keywords and Interfaces in Java

 

 

 

 

 

 

 

 

 

 

 

 

 
  • Analysis of Algorithms:

    • Growth of functions

    • Asymptotic Notations Omega, Theta,

    • Recursion Tree Method

    • Space Complexity

  • Arrays:

    • Insertion, Deletion, Updation, Shifting

    • Reversal, Sort Check, Maximum, Minimum

  • Hashing:

    • Introduction to Hashing

    • Collision Handling

    • Chaining Vs Open Addressing

  • String:

    • Creation, Updation

    • Reverse, Pangram, Case conversion

    • Validation, Length

  • Searching:

    • Linear Search

    • Binary Search (Iterative and Recursive)

  • Sorting:

    • Bubble Sort

    • Selection Sort

    • Insertion Sort

    • Quick Sort

    • Different Partition Schemes in QuickSort

    • Merge Sort

    • Counting Sort

    • Radix Sort

  • Linked List:

    • Drawback of Arrays

    • Introduction to Linked List and Implementation

    • Traversal, Insertion and Deletion

    • Reversal

  • Circular Linked List:

    • Traversal, Insertion and Deletion

  • Doubly Linked List:

    • Traversal, Insertion and Deletion

    • Reversal

    • Circular Doubly Linked List

    • Finding Middle

  • Stack:

    • Implement using array

    • Implementation using Linked List

    • Operations

    • Infix to postfix

    • Evaluation of postfix

  • Queue:

    • Implementation using array

    • Implementation using Linked List

    • Implementation using stack

  • Dequeue:

    • Implementations using Array

    • Implementation using Linked List

    • Insertion, Deletion, Updation, Reversal

    • Rotation

  • Tree:

    • Implementation

    • Traversals: preorder, postorder, inorder, level order

    • Height

  • BST:

    • Implementation

    • Search

    • Insertion

    • Deletion

  • Heap:

    • Implementation

    • Operations

    • Heap Sort

  • Graph:

    • Representation: list and matrix

    • DFS and BFS

    • Cycle Detection: Directed and Undirected

    • Topological Sort

 

 

 

 

 

 

 

 

 

 

 

 

 
  • Mathematics

  • Recursion

  • Arrays: 

    • Kadane’s Algorithm

    • Shuffling Algorithms

    • Sliding Window

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Matrix: 

    • Search, Transpose and Rotate

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Searching:

    • Two Pointer Approach

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Sorting: 

    • Union And Intersection of Sorted Arrays

    • Tail Call elimination Quick Sort

    • Cycle Sort

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Hashing:

    • Double Hashing

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Strings:

    • Pattern Matching Algorithms:

      • Rabin Karp Algorithm

      • KMP Algorithm

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Linked List:

    • Doubly Linked List

    • Circular Linked List

    • Loop in Linked List (Detection and Removal)

    • LRU Cache Design

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Stack:

    • Next Greater Element

    • Implementing Two Stacks in Single Array

    • Implementing K stacks in Single Array

    • Stack with getMin() operation in O(1) time.

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Queue:

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Tree:

    • Printing Left, Right, Top and Bottom Views

    • Binary Tree to Doubly Linked List

    • Binary Tree from Inorder and Postorder Traversal

    • Diameter

    • LCA

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Binary Search Tree:

    • Self Balancing BST

    • AVL Tree (Introduction and applications)

    • Red-Black Tree (Introduction and applications)

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Heap:

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Graph:

    • Shortest Path Problems

    • Prims Algorithm

    • Dijkstra’s Algorithm

    • Bellman Ford Algorithm

    • Kosaraju’s Algorithm

    • Articulation Point

    • Bridges in Graph

    • Tarjan’s Algorithm

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Greedy Algorithm:

    • Introduction

    • Activity Selection Problem

    • Fractional Knapsack

    • Job Sequencing Problem

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • BackTracking:

    • Concept of Backtracking

    • Problems: Rat In Maze, N Queen, Sudoku

    • More Problems for Practice.

  • Dynamic Programming:

    • Introduction

    • Memoization

    • Tabulation

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Trie:

    • Introduction

    • Insert, Search, Delete

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Segment Tree:

    • Introduction 

    • Construction

    • Range and Update Query

    • More Problems for Practice.

  • Disjoint-Set

    • Introduction

    • Union-Find

    • Union By Rank

    • Path Compression

    • Kruskal’s Algorithm

    • More Problems for Practice.

 

 

 

 

 
  • Tiny URL Design (Theory Explanation with Diagrams)

  • Elevator Design (Video Explanation)

  • Parking Lot Design (Video Explanation)

  • Design Online book reader system (Theory Explanation with Diagrams)

  • Bookmyshow Design (Video Explanation)

 

 

 

 

 

Operating System

  • Operating System and its Types

  • Multiprogramming, Multiprocessing, Multithreading

  • Process Management and Scheduling

  • Process Synchronization.

  • Deadlock

  • Memory Management 

  • Virtual Memory

Database Management System

  • Introduction to DBMS

  • Architectures

  • ER Model

  • Relational Model

  • Keys in Relational Model

  • Database Normalization 

  • Normal Forms

  • Concurrency Control

  • Indexing in Database

  • B+ Tree Introduction

  • SQL

Computer Networks:

  • Introduction to Computer Networks

  • TCP/IP vs OSI Model

  • Circuit Switching vs Packet Switching

  • Flow Control Protocols 

  • IP and Classful Addressing

  • Classless Addressing

  • Routing Protocols

  • ARP & DHCP

  • Transport Layer

  • TCP & UDP

  • Application Layer

Subject Wise Most Asked Interview Questions

 

 

 

 

 

 

 

 

 

 

 

 

 
  • Quantitative Aptitude

  • Logical Reasoning

  • Verbal Ability

 

 

 

 

 

 

 

 

 

 

 
  • Mock Test 1
  • Mock Test 2
  • Mock Test 3
  • Final Assessment Test
  • Mock Interviews for selected students.

 

 

 

 

 

 

 

 

 

 

 

 

 

 
Show More

FAQs

  1. For which companies can I prepare with this course?
    The course will help you prepare for product-based companies (like Amazon, Microsoft, Adobe, etc), startups (like Ola, Swiggy, Zomato, etc) and MNCs (like Infosys, Cognizant, Deloitte, etc)
  2. How can I register for the course?
    You need to sign up for the course. After signing up, you need pay when the payment link opens.
  3. Is this a Paid course?
    Yes, the course is priced at INR 14,999 but will be available at an Offer price of INR 9,999.
  4. When can I make the payment for the course?
    The payment link is active now. You can make the payment by clicking "Pay Online" button. If you're not a logged in user then you need to login & signup for this course then only you can make the payments.
  5. What is the duration of the course?
    This is a 6 months program comprising of an online course followed by an assessment exam.
  6. Does this program offer a placement guarantee?
    The program is designed to prepare students for placement. Top performers will be prioritized during placements but there is no placement guarantee.
  7. Who can I contact for queries regarding the course?
    For any queries regarding the course, you may write to us at geeks.classes@geeksforgeeks.org
  8. Can I  make the payment through PayPal?
    Yes. Mail us with your details at geeks.classes@geeksforgeeks.org

 

 

 

 

 

 

Course Registration

Batch Date Type Register
p-100 17 March to 17 March '22 Online Classes