Complete Interview Preparation
Your comprehensive guide to acing placements in your dream company
Pre-final/Final year students & Working Professionals

9999 5999


*All seats Sold Out!
Next sale will be live on 8th July 12:00 PM IST
Only for first 200 users

Online Course
Upcoming Batch: CIP Batch 1
08 July '20

Course Overview

All seats have been Sold Out! The course payments will re-open on 8th July 12:00 PM IST. The payments will only be accepted for the first 200 users. You also get INR 1500 GeeksforGeeks Voucher on successful enrollment in this course.


Want to cover all the important concepts and topics required for the interviews? Looking to get placement ready before the interviews begin? If yes, then we have the perfect tool for you. With our complete interview preparation course, you’ll get access to precise content required for placement preparation, nothing less, nothing more. Your 4 years of learning compressed into an extensive course of 6 months!

This course specifically designed to help the pre-final/final year students and working professionals land their dream job.

Preparing for placements requires smart learning as some subjects hold more weightage than the others. This course is extensively curated to do the same. It will provide you with premium lectures, theory, practice tracks etc sorted in a convenient way to ensure unidirectional, smooth and easy learning.

Be it product-based companies (like Amazon, Microsoft, Adobe, etc), startups (like Ola, Swiggy, Zomato, etc) or service-based companies (like TCS, Infosys, Cognizant, etc), this program is here to make you land the job you want!

What You Will Learn

  • Begin with the basics! Learn about the programming languages, C++ & Java

  • Learn the concepts of Object-Oriented Programming (OOPs)

  • Best in industry DSA learning experience, from basic to advanced

  • Learn the often asked concepts of Object-Oriented Analysis and Design

  • Also, learn about other important CS subjects like OS, CN, DBMS, etc

  • Learn about the frequently asked interview questions

Course Features

  • 200+ algorithmic coding problems

  • Lifetime access to the Course

  • Track-based learning

  • Weekly assessment tests

  • Premium Lecture videos by Mr. Sandeep Jain (CEO & Founder, GeeksforGeeks) and other industry experts

  • Subject-wise Theoretical content by subject experts

  • Objective Questions compiled by subject experts

  • Course Completion Certificate trusted by top universities and companies

  • Internship Opportunities at GeeksforGeeks

  • Access to the GeeksforGeeks Jobs portal

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

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

Object oriented Analysis and Design Concepts

  • Introduction to Object and Classes. 

  • Software Development Process.  

  • UML and its importance.

  • Class Diagrams & Object Diagrams 

  • Use-case Diagrams


Object-oriented Analysis and Design Case Studies: Complete step by step design and analysis of below case studies.

  • BookMyShow : Movie ticket booking application. 

  • MyFlipCart : Complete e-commerce application.

  • ParkingLot : Automated Solution for Parking-Lots. 

  • BlackJack : Most popular card game in casinos.

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. Should I enroll for this course if I have already enrolled for the Placement 100 Course?
    No, if you've enrolled for the Placement 100 Course, it is self-sufficient to prepare you for placements in product-based companies.
     
  2. 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, etc)
     
  3. 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.
     
  4. Is this a paid course?
    Yes, the course is priced at INR 9,999 but will be available at an Offer price of INR 5,999.
     
  5. 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.
     
  6. What is the duration of the course?
    This is a 6 months program comprising of an online course and contests for practice.
     
  7. What is the Validity of this course?
    The Course Content, Videos & practice content comes with lifetime validity.
     
  8. 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 but there is no placement guarantee with this course.
     
  9. 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
     
  10. Can I  make the payment through PayPal?
    Yes. Mail us with your details at geeks.classes@geeksforgeeks.org

Course Registration

Batch Date Type Register
CIP Batch 1 08 July '20 Online Classes