CS Core Subjects
Computer Science Theory
Learn core subjects of Computer Science like OS, DBMS & CN to prepare for interview in companies like Google, Microsoft, etc.
Candidates preparing for SDE Interview

4499 2499


Online Course
Live: CS Core {Self Paced}
15 October '19 to 15 October '20

Course Overview

You have just stumbled upon the most complete, in-depth online Computer Science Core Subjects course. This course is designed for the candidates who are looking to strengthen their knowledge of OS, DBMS, Networking and SQL for academic and interview purposes. This course includes all the important topics required for interview preparation.

This course will help you prepare topics like Operating System, DMBS, Computer Networks and SQL for interview in top-notch companies like Google, Microsoft, Amazon, etc. The course has pre-recorded premium lecture videos by Mr. Sandeep Jain and theoretical concepts designed by experts. The course also has objective questions for practice to provide the ultimate learning experience.

This is a self-paced course which implies that you can complete the course at your own pace!


Course Features

  • Premium Recorded Lectures by Industry experts
  • Theory compiled by subject experts
  • Objective Questions compiled by subject experts

 

 

 

 

Course Content

Introduction to OS

  • Services and Examples

  • Types of OS

    • Single Tasking

    • Multiprogramming and Multitasking

    • Multithreading

      • Real-world examples

      • Disadvantages

      • Examples of Race Condition

    • Multiprocessing

    • Multiuser

  • Thread V/S Process

  • User Threads V/S Kernel Threads

 

Virtual Memory

  • Introduction

    • Concept discussion

    • Performance Impact of Page Fault

  • TLB, Demand Paging, Thrashing, Page Replacement Algorithm

Memory Management

  • Working behind the compilation and running of a program

  • Address Binding

    • Compile Time

    • Load Time

    • Run Time

    • Problems of Runtime Binding

    • Logical and Physical Address

  • Runtime Binding

    • Working

  • Memory Management and hierarchy

    • Access time, capacity and cost

  • Evolution of Memory Management

    • Single Tasking

    • Multitasking

    • Memory Allocation

  • Dynamic Partitioning

    • Bitmap

    • Linked List

Deadlock

  • Introduction and Understanding

    • Mutual Exclusion

    • Hold and Wait

    • No Preemption

    • Circular Wait

    • Resource Allocation Graph

  • Deadlock Handling Mechanism

    • Deadlock Prevention

    • Deadlock Avoidance

    • Detection and Recovery

    • Ignoring the Deadlock

    • EDEADLK

  • Deadlock Prevention Mechanism

    • Mutual Exclusion

    • Hold and Wait

    • No Preemption

    • Circular Wait

  • Deadlock Avoidance Mechanism

    • Bankers Algorithm

  • Discussion on Deadlock Detection and Recovery

Process Synchronization

  • Introduction

  • Consumer and Producer Problem

  • Race Condition

  • Goals of Synchronization Mechanism

    • Mutual Exclusion

    • Progress

    • Bounded Waiting

    • Performance

  • Overview of Synchronization Mechanism

    • Disabling Interrupts

    • Locks(or Mutex)

    • Semaphores

    • Monitors

    • Application of Process Synchronization

  • Locks for Synchronization

    • Problems of Deposit and Withdrawl problem

    • TSL Lock mechanism

  • Critical Section

    • Problems of Deposit and Withdrawl problem

    • Entry Section

    • Critical Section 

    • Exit Section

    • Non-Critical Section

  • Semaphores

    • wait() and signal() function

    • Original importance by Dijkstra

  • Binary Semaphore

    • Internal Working of Semaphore

    • Binary Semaphore

    • Wait and Signal Protocol in Binary Semaphore

  • Monitors

    • Introduction, Syntax and Working

Process Management

  • Introduction to Program and Process

  • Process States

    • For Single Tasking Systems.

    • Multiprogramming Systems 

    • 5-States Model

    • 7-States Model

  • Process Control Block(PCB)

  • Process Scheduler

    • Long Term Scheduler

    • Short Term Scheduler

    • Medium Term Scheduler

  • Scheduling Algorithms

    • Background

    • Explaining various times in Scheduling algorithms

    • Goals of Scheduling Algorithms

  • FCFS Algorithm (Non-Preemptive)

    • Understanding using a problem

    • Calculating various times

    • Characteristics of FCFS Algo

  • SJFS Algorithm (Non-Preemptive)

    • Understanding using a problem

    • Calculating various times

    • Characteristics of SJFS Algo

  • SJF or SRTF Algorithm(Pre-emptive)

    • Understanding using a problem

    • Calculating various times

    • Characteristics of SJF or SRTF Algo

  • Priority Scheduling (Non-Preemptive)

    • Understanding using a problem

    • Calculating various times

  • Priority Scheduling (Preemptive)

    • Understanding using a problem

    • Calculating various times

  • Problems with Priority Scheduling

  • Round Robin Scheduling (Pre-emptive)

    • Characteristic

    • Calculating various times using a problem

  • Multilevel Queue Scheduling

  • Multilevel Queue Scheduling with Feedback

 

  • Introduction to DBMS

    • Understanding DBMS

    • Evolution of DBMS

      • File-Based

      • Relational DBMS

      • NoSQL

  • ER and Relational Model

    • ER Model

      • Understanding Entity Set, Relationship Set and Attributes.

    • Keys

      • Candidate Key

      • Super Key

      • Primary Key

      • Problems involving identifying keys.

    • ER Diagram

      • Participation 

      • Weak Entity Set

    • Foreign Key

      • Introduction and Identifying foreign keys

      • Understanding Referential Integrity

  • Database Designing

    • Normalization

      • Data Redundancy

      • Data Integrity

      • Objects of Good DB design

      • Understanding Anomalies

        • Updation Anomaly

        • Insertion Anomaly

        • Deletion Anomaly

    • Functional Dependency

      • Explanation using DB tables

      • Need for Functional Dependency

      • Trivial and Non-trivial

    • First Normal Form

    • Second Normal Form

    • Third Normal Form

    • BCNF

  • SQL

    • Introduction

      • DDL, DQL, DML, DCL

      • Understanding the creation of tables using SQL commands

      • INSERT, SELECT, FROM

    • Joins in SQL

      • Cross Product

      • Inner Join - Equal and Natural Join

      • Outer Join - Left, Right and Full Join

      • Self Join

    • Aggregate Functions and Group By

      • SUM, MAX, MIN, COUNT, AVG

      • Group BY

      • Difference b/w WHERE & HAVING

    • Subqueries

      • Understanding querying from the table using SQL commands

      • Various problems in subqueries

    • Correlated subqueries

  • Indexing

    • Indexing in Database

      • Introduction to Clustered and Non clustered indexing

    • Clustered Index

      • Sparse and Dense Index

    • Non-clustered Index

    • Multilevel Indexing B & B+ Trees

  • Transaction and Concurrency Control

    • Introduction and ACID properties

    • Conflict Serializability

      • Conflicting operators in Transactions

      • Given and Serial Schedule

      • Precedence Graph

    • View Serializability

      • Initial Read

      • Updated Read

      • Final Write

    • Recoverable, Cascadeless and Strict Schedule

    • Two-Phase Locking Protocol

      • Understanding Shared and Exclusive Locks

      • Growing and Shrinking phase

    • Problems with basic two-phase locking

      • Deadlock

      • Recoverability

    • Conservative, Strict and Rigorous 2PL

      • Difference between them

    • Timestamp Based Protocols

      • Rules to find:

      • TS

      • RTS

      • WTS

  • Introduction to CN

    • Network Criteria Discussion

    • OSI Model

      • The need for such a model

      • Various layers at Sender and Receiver side

    • TCP/IP Model

      • The need for such a model

      • Various layers at Sender and Receiver side

      • Protocol Data Units

  • Data Link Layer

    • Introduction

      • Explanation using Home and Office network

      • Functionalities

        • Framing

        • Error Detection

        • Error Flow Control

        • Multiple Access

    • Delays

      • Transmission Delay

      • Propagation Delay

      • Queuing Delay

      • Processing Delay

    • Error and Flow Control Protocols

      • Stop and Wait

      • Selective Repeat Protocol

      • Sliding Window Background

      • Go Back N

    • Circuit Switching V/S Packet Switching

      • Difference and explanation

  • Network Layer

    • Introduction

      • Functionalities

    • Network Address Translation

      • Identifying private and public IPs

    • Routing Algorithms

      • Exterior Gateway Protocols

      • Interior Gateway Protocols

      • Static V/S Dynamic Routing Algorithms

      • Unicast, Broadcast, Multicast & Anycast

      • Cost of Links

      • Goals of Routing Algos

    • Distance Vector Routing

      • Introduction

      • Algorithm

      • Problems

      • Routing Information Protocols

    • Link State Routing

      • Introduction

      • Algorithm

      • Use

  • Transport Layer

    • Introduction

      • Use and Examples

    • TCP V/S UDP

      • Difference and explanation

  • Application Layer

    • Introduction

      • Working of various layers

    • Understanding and background of Domain Name System

    • Address Resolution Protocol (ARP)

      • Working

    • Dynamic Host Configuration Protocol (DHCP)

      • Working at Home and Office Network

  • IP Addressing

    • Classful Addressing

      • Problems

    • Subnetting

      • Subnet Mask

      • The division into two or more networks

      • Problems

    • Classless Addressing

      • Classless Inter-Domain Routing

      • Problem with classful addressing

Theoretical Compilation of Most asked Interview Questions from

  • Computer Networks

  • Operating System

  • DBMS

FAQs

  1. Is there any number to contact for any query?
    You may call us on our toll-free number: 1800 123 8622  or Drop us an email at geeks.classes@geeksforgeeks.org
     
  2. How can I register for the course?
    You need to sign up for the course. After signing up, you need to make the payment by clicking "Pay Online" Button
  3. Does this course include Doubt solving assistance?
    No, this course doesn't include doubt solving support.

  4. Does this course include programming questions?
    No, this course contains video lectures, theory and Multiple Choice Questions (MCQs) for practice.

  5. What type of certificate will be offered in this program
    Once the course is completed. You'll be getting a course completion certificate depending on your result in course tracks and contests.

  6. When can I make the payment for the course?
    The payment link will be available on the course page.

  7. Will the course content be available after the course end date?
    Course content comes with lifetime validity.

  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
CS Core {Self Paced} 15 October '19 to 15 October '20 Online Classes