View 1189 notes Detailed Notes on GATE (Graduate Aptitude Test in Engineering) Computer Science

Subscribe now to access pointwise, categorized & easy to understand notes on 1189 notes of GATE (Graduate Aptitude Test in Engineering) Computer Science covering entire 2022 syllabus. With online notes get latest & updated content on the device of your choice. View complete topic-wise distribution of study material below. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Features or choose a topic below to view sample.

Rs. 1000.00 -OR-

How to register? Already Subscribed?

There are 1189 notes study material on GATE (Graduate Aptitude Test in Engineering) Computer Science arranged below by topic-subtopic. Numbers in brackets number of titles on that topic/subtopic and effort as % of the total course. The green bars indicate the progress on a topic/subtopic (based on titles you have marked complete).

%

Mathematical Logic [38 Notes- 2.87% Effort]

Propositional Logic [33 Notes- 2.47% Effort]

First Order Logic [5 Notes- 0.4% Effort]

Probability [1 Notes- 0.02% Effort]

Distributions [1 Notes- 0.02% Effort]

Set Theory & Algebra [35 Notes- 2.38% Effort]

Sets [12 Notes- 0.88% Effort]

Functions [1 Notes- 0.09% Effort]

Partial Orders [1 Notes- 0.15% Effort]

Boolean Algebra [6 Notes- 0.43% Effort]

Groups [15 Notes- 0.81% Effort]

Combinatorics [3 Notes- 0.21% Effort]

Counting [3 Notes- 0.21% Effort]

Graph Theory [14 Notes- 1.1% Effort]

Connectivity [3 Notes- 0.12% Effort]

Spanning Trees [5 Notes- 0.34% Effort]

Cut Vertices & Edges [2 Notes- 0.2% Effort]

Matching [3 Notes- 0.4% Effort]

Colorings [1 Notes- 0.03% Effort]

Linear Algebra [1 Notes- 0.03% Effort]

Systems of Linear Equations [1 Notes- 0.03% Effort]

Digital Logic [23 Notes- 1.57% Effort]

Design and Synthesis of Combinational and Sequential Circuits [16 Notes- 1.1% Effort]

Number Representation and Computer Arithmetic [7 Notes- 0.46% Effort]

Computer Organization and Architecture [86 Notes- 8.09% Effort]

Machine Instructions and Addressing Modes [25 Notes- 2.72% Effort]

ALU and Data-Path [7 Notes- 0.61% Effort]

CPU Control Design [1 Notes- 0.18% Effort]

Memory Interface [24 Notes- 2.3% Effort]

Instruction Pipelining, Cache and Main Memory [24 Notes- 1.83% Effort]

Secondary Storage [5 Notes- 0.43% Effort]

Programming and Data Structures [208 Notes- 22.96% Effort]

Programming in C [72 Notes- 8.01% Effort]

Functions [8 Notes- 0.86% Effort]

Parameter Passing [3 Notes- 0.11% Effort]

Binding [6 Notes- 0.47% Effort]

Abstract Data Types [47 Notes- 6.06% Effort]

Arrays [8 Notes- 0.68% Effort]

Stacks [9 Notes- 0.74% Effort]

Queues [13 Notes- 1.12% Effort]

Linked Lists [9 Notes- 1.05% Effort]

Trees [32 Notes- 3.71% Effort]

Binary Search Trees [1 Notes- 0.1% Effort]

Algorithms [91 Notes- 6.71% Effort]

Analysis [25 Notes- 1.83% Effort]

Asymptotic Notation [8 Notes- 0.54% Effort]

Greedy Approach [1 Notes- 0.07% Effort]

Dynamic Programming [1 Notes- 0.06% Effort]

Divide-And-Conquer [15 Notes- 0.9% Effort]

Shortest Paths [2 Notes- 0.11% Effort]

Hashing [8 Notes- 0.67% Effort]

Sorting [28 Notes- 2.18% Effort]

Searching [2 Notes- 0.11% Effort]

Upper and Lower Bounds [1 Notes- 0.21% Effort]

Theory of Computation [59 Notes- 3.61% Effort]

Regular Languages and Finite Automata [15 Notes- 0.89% Effort]

Context Free Languages and Push-Down Automata [33 Notes- 1.83% Effort]

Recursively Enumerable Sets and Turing Machines [9 Notes- 0.71% Effort]

Undecidability [2 Notes- 0.17% Effort]

Compiler Design [44 Notes- 3.39% Effort]

Lexical Analysis [7 Notes- 0.39% Effort]

Parsing [8 Notes- 0.71% Effort]

Runtime Environments [5 Notes- 1.02% Effort]

Intermediate and Target Code Generation [15 Notes- 0.88% Effort]

Basics of Code Optimization [9 Notes- 0.39% Effort]

Operating System [80 Notes- 7.51% Effort]

Processes [28 Notes- 2.68% Effort]

Concurrency [2 Notes- 0.27% Effort]

Deadlock [5 Notes- 0.6% Effort]

CPU Scheduling [6 Notes- 0.53% Effort]

Memory Management and Virtual Memory [17 Notes- 1.56% Effort]

Input-Output Systems [2 Notes- 0.07% Effort]

Protection and Security [20 Notes- 1.78% Effort]

Databases [97 Notes- 9.95% Effort]

ER-Model [5 Notes- 0.71% Effort]

Relational Model [15 Notes- 2.44% Effort]

Database Design [40 Notes- 3.59% Effort]

Query Languages [22 Notes- 1.89% Effort]

File Structures [13 Notes- 0.98% Effort]

Transactions and Concurrency Control [2 Notes- 0.31% Effort]

Information Systems and Software Engineering [210 Notes- 9.44% Effort]

Information Gathering [39 Notes- 1.52% Effort]

Requirement and Feasibility Analysis [7 Notes- 0.99% Effort]

Process Life Cycle [12 Notes- 0.77% Effort]

Planning and Managing the Project [54 Notes- 2.08% Effort]

Design [36 Notes- 1.54% Effort]

Coding [9 Notes- 0.36% Effort]

Testing [46 Notes- 1.94% Effort]

Maintenance [7 Notes- 0.2% Effort]

Computer Networks [155 Notes- 16.74% Effort]

ISO-OSI Stack [26 Notes- 4.47% Effort]

LAN Technologies (Ethernet, Token Ring) [24 Notes- 2.47% Effort]

Flow and Error Control Techniques [12 Notes- 1.47% Effort]

Routing Algorithms [21 Notes- 2.59% Effort]

Congestion Control [1 Notes- 0.17% Effort]

IP(V4) [21 Notes- 1.41% Effort]

Application Layer Protocols [7 Notes- 0.88% Effort]

Basic Concepts of Hubs [1 Notes- 0.08% Effort]

Switches [3 Notes- 0.55% Effort]

Gateway [1 Notes- 0.18% Effort]

Routers [3 Notes- 0.37% Effort]

Network Security - Public Key and Private Key Cryptography [17 Notes- 0.92% Effort]

Digital Signature [5 Notes- 0.15% Effort]

Firewalls [13 Notes- 0.99% Effort]

Web Technologies [44 Notes- 3.31% Effort]

HTML [21 Notes- 1.34% Effort]

XML [7 Notes- 0.41% Effort]

Basic Concepts of Client-Server Computing [16 Notes- 1.54% Effort]