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

Registration Closed


Online Course
Batch: p-100
Active
Course Rating
5.0

Course Overview

We are closing enrollments in this batch on 27th July 2020. And we are providing INR 1500 GeeksforGeeks Voucher on successful enrollment in this course.
NOTE: The coupon will be received in the enrollment confirmation mail post successful payment.


Are you looking for preparation to get placed in top-notch companies?
This course is proved as the one-stop solution for ones who are looking for preparing to face big shots interviews like Amazon, Microsoft, Ola, etc.

Placement 100 is a 6 months program comprising an online course, assessment exam and placement assistance for top performers. The online course covers all the topics through theory and video lectures required to prepare for placements. And, it comes with a first-in-industry feature: Doubt Assistance to help you when stuck.

Mock tests and Mock interviews are also there to skyrocket your preparations.
This course is best suited for:
  • Final year students looking for placements
  • Pre-final year students preparing for placements

What You Will Learn

  • Learn about the most important placement topics like DSA, OOP, Object Oriented Analysis & Design from basic to advanced level

  • Learn about CS Core subjects, frequently asked in the interviews, like OS, DBMS & Computer Networks.

  • Also learn about Programming Languages (C++/Java) along with Aptitude and Reasoning

  • Learn how to tackle the most frequently asked questions in the interviews of product-based companies (like Amazon, Microsoft, Adobe, etc)

  • Also learn about the questions commonly asked in the interviews of startups (like Ola, Zomato) and service-based companies (like TCS, Cognizant, Deloitte)

  • Learn how to tackle an actual interview experience with the help of mock assessment exams and mock interviews

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 companies 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, Different Errors, Operators, Loops, Arrays, String, Functions, Pointers, Dynamic Memory Allocation, Exception Handling and Smart Pointers.

  • Java : Introduction and Basic I/O, Variables , Operators, Loops, Exception Handling, 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

    • Finding Middle

  • Circular Linked List:

    • Traversal, Insertion and Deletion

  • Doubly Linked List:

    • Traversal, Insertion and Deletion

    • Reversal

    • Circular Doubly Linked List

  • 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

    • Prefix Sum Technique

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Matrix: 

    • Multidimensional Array in CPP and Java

    • Search, Transpose and Rotate

    • Pattern Traversal: Snake, Spiral, Boundary

    • 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

    • Inversions Count

    • Tail Call elimination Quick Sort

    • Cycle Sort

    • Merge of Overlapping Intervals

    • Overview of Sorting Algorithms

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Hashing:

    • Double Hashing

    • Intersection and Union via Hashing

    • Distinct Elements in Window

    • Counting Occurences

    • Subsequence Problems

    • Subarray Problems

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Strings:

    • Pattern Matching Algorithms:

      • Rabin Karp Algorithm

      • KMP Algorithm

    • Rotations Check of two Strings

    • Anagram

    • 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)

    • Loop Detection Algorithms

    • Union and Intersection of LinkedLists

    • Reverse ing Groups

    • LRU Cache Design

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Stack:

    • Next Greater Element

    • Previous Greater

    • Implementing Two Stacks in Single Array

    • Implementing K stacks in Single Array

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

    • Stock Span

    • Largest Rectangular Area in Histogram

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Queue:

    • Stack using Queue

    • Reversal

    • Maximum of all Subarrays of Size K

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Tree:

    • Line By Line Level Order Traversal

    • Printing Left, Right, Top and Bottom Views

    • Binary Tree to Doubly Linked List

    • Binary Tree from Inorder and Postorder Traversal

    • Maximum Width

    • Child Sum Property

    • Convert Binary Tree to Doubly LinkedList

    • Burning a Tree from Leaf

    • Diameter

    • LCA

    • Serialize and Deserialize

    • Count Nodes in Complete Binary Tree

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Binary Search Tree:

    • Floor and Ceil in BST  in CPP and Java

    • Self Balancing BST

    • AVL Tree (Introduction and applications)

    • Red-Black Tree (Introduction and applications)

    • Applications of BST

    • Set in CPP STL

    • Map in CPP STL

    • TreeSet in Java

    • TreeMap in Java

    • Top View

    • Bottom View

    • Vertical Sum

    • Vertical Traversal

    • Fix BST With Two Nodes Swapped

    • Check For BST

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Heap:

    • Heap Sort

    • Video Solutions for some standard and complex problems

    • More Problems for Practice.

  • Graph:

    • Shortest Path Problems

    • Prims Algorithm Introduction and Implementation in CPP and Java

    • Dijkstra’s Algorithm Introduction and Implementation in CPP and Java

    • 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 in CPP and Java

    • Fractional Knapsack in CPP and Java

    • 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

    • LCS and its variations

    • Coin Change

    • KnapSack

    • LIS and its variations

    • Egg Drop Puzzle

    • Subset Sum

    • Matrix Chain Multiplication

    • Palindrome Partitioning

    • 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

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 to 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 the "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. What is the Validity of this course?
    The Course Content, Videos & practice content comes with lifetime validity.
     
  7. Does this program offer a placement guarantee?
    The program is designed to prepare students for placement. You can apply for the Jobs using GeeksforGeeks Job Portal
     
  8. 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
     
  9. 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 Active Online Classes
Registration Closed