|
Reference Book Short Notes
|
|
|
|
DBMS
(74 pages)
|
|
|
|
DLDA
(38 pages)
|
|
|
|
OS
(65 pages)
|
|
|
|
TOC
(30 pages)
|
|
|
|
DM
(109 pages)
|
|
|
|
COA
(57 pages)
|
|
|
|
CN
(107 pages)
|
|
|
|
GT
(107 pages)
|
|
|
|
CC
(41 pages)
|
|
|
|
AOA
(116 pages)
|
|
|
Database Management System
|
|
|
|
Assignment 0: ER Model
(6 pages)
|
|
|
|
ER Model Solution
(3 pages)
|
|
|
|
Assignment 1: SQL & Relational Algebra
(6 pages)
|
|
|
|
Assignment 1: SQL,RA,RC QUESTIONS
(3 pages)
|
|
|
|
Assignment 2: Transaction
(7 pages)
|
|
|
|
Transaction Solution
(7 pages)
|
|
|
|
Assignment 3: File Indexing
(4 pages)
|
|
|
|
FILE Indexing Solution
(8 pages)
|
|
|
|
TEST 1 : ER Model
|
|
|
|
TEST 2 : Functional Dependency & Normalization
|
|
|
|
TEST 3: Relational Algebra and Relational Calculus
|
|
|
|
TEST 4: SQL
|
|
|
|
TEST 5: Transaction
|
|
|
|
TEST 6 : File Indexing
|
|
|
Operating System
|
|
|
|
Process ,Threads, System Calls
|
|
|
|
Process scheduling
|
|
|
|
Process Synchronization
|
|
|
|
Deadlock
|
|
|
|
Virtual Memory
|
|
|
Digital Logic
|
|
|
|
Boolean Algebra
|
|
|
|
Boolean Algebra & Minimization : PART 2
|
|
|
|
Combinational Circuit
|
|
|
|
Sequential Circuits
|
|
|
|
Number System
|
|
|
Compiler Design
|
|
|
|
Lexical Analysis
|
|
|
|
Parser
|
|
|
|
Syntax Directed Translation
|
|
|
Data Structure
|
|
|
|
Programming in C
|
|
|
|
Recursion and Arrays
|
|
|
|
Linked List, Stacks and Queues
|
|
|
|
Graphs and binary heaps
|
|
|
|
Trees and Binary search trees
|
|
|
Algorithms
|
|
|
|
Asymptotic notations, Asymptotic analysis, Time and space complexity
|
|
|
|
Searching sorting and Hashing
|
|
|
|
Greedy, Divide and conquer techniques
|
|
|
|
Dynamic programming, Minimum spanning trees
|
|
|
|
Graph traversals and shortest path
|
|
|
Computer Network
|
|
|
|
TEST 1: Physical and Data Link Layer
|
|
|
|
TEST 2: Network Layer
|
|
|
|
TEST 3: Network Layer Ipv4
|
|
|
|
TEST 5: TCP/UDP
|
|
|
|
TEST 6: Application Layer
|
|
|
|
TEST 5: Basic Concepts
|
|
|
Computer organization and architecture
|
|
|
|
Addressing Modes
|
|
|
|
Cache
|
|
|
|
Pipelining
|
|
|
|
ALU, Control Unit, I/O
|
|
|
Theory of Computation
|
|
|
|
Regular Language : Part 1
|
|
|
|
Regular Language : Part 2
|
|
|
|
Context Free Language
|
|
|
|
Push down automata and Pumping Lemma
|
|
|
|
Turing Machine, Undecidability
|
|
|
Mathematics
|
|
|
|
Matrices and Determinants
|
|
|
|
Systems of Linear equations, LU decomposition
|
|
|
|
Eigen values and eigen vectors
|
|
|
|
Limits and continuity
|
|
|
|
Differentiability, Maxima and Minima, Mean value theorem
|
|
|
|
Integration
|
|
|
|
Random Variable, Conditional probablity, and bayes theorem
|
|
|
|
Binomial distributions, Mean, mode, median, SD
|
|
|
Full length Test
|
|
|
|
Mock Test 1
|
|
|
|
Mock Test 2
|
|
|
|
Mock Test 3
|
|
|
|
Mock Test 4
|
|
|
|
Mock Test 5
|
|
|
|
mock test 6
|
|
|
|
Mock Test 7
|
|
|
|
Mock Test 8
|
|
|
|
Mock Test 9
|
|
|
|
Mock Test 10
|
|
|
|
Mock Test 11
|
|
|
|
Mock Test 12
|
|
|
Subject Wise Test
|
|
|
|
Digital Logic
|
|
|
|
Computer Organization and Architecture
|
|
|
|
Operating System
|
|
|
|
Theory of computation
|
|
|
|
Programming and Data Structures
|
|
|
|
Algorithms
|
|
|
|
Computer Networks
|
|
|
|
Databases
|
|
|
|
Compiler Design
|
|
|
How To Prepare Computer Organization and Architecture For GATE Exam | GATE CS/IT
|
|
|
|
Piplining Important Concepts For GATE Exam | GATE 2023
|
|
Launch your Graphy