Home
About
Login
About
GATE Mock Test
Select All Subjects, Topics & Subtopics
ENGINEERING MATHEMATICS
Select All
Linear Algebra
Select All
Matrix algebra
Systems of linear equations
Eigenvalues and eigenvectors
Calculus
Select All
Functions of single variable
Limit, continuity and differentiability
Mean value theorems
Indeterminate forms
Evaluation of definite and improper integrals
Partial derivatives
Total derivative
Maxima and minima
Gradient, divergence and curl
Vector identities
Directional derivatives
Line, surface and volume integrals
Stokes, Gauss and Green's theorems
Differential Equations
Select All
First order equations (linear and nonlinear)
Higher order linear differential equations with constant coefficients
Cauchy’s and Euler’s equations
Initial and boundary value problems
Laplace transforms
Solutions of one dimensional heat and wave equations and Laplace equation
Probability and Statistics
Select All
Definitions of probability and conditional probability
Probability theorems
Sampling theorems
Poisson, normal and binomial distributions
Correlation and regression analysis
Mean, median, mode and standard deviation
Hypothesis testing
Numerical Methods
Select All
Solutions of nonlinear algebraic equations
Single and multi-step methods for differential equations
Numerical integration (Trapezoidal and Simpson’s rule)
COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Select All
Digital Logic
Select All
Boolean algebra
Combinational and sequential circuits
Minimization
Number representations and computer arithmetic (fixed and floating point)
Computer Organization and Architecture
Select All
Machine instructions and addressing modes
ALU, data path and control unit
Instruction pipelining
Memory hierarchy
Cache, main memory and secondary storage
I/O interface (interrupt and DMA mode)
Programming and Data Structures
Select All
Programming in C
Recursion
Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps
Graphs
Algorithms
Select All
Searching, sorting, hashing
Asymptotic worst case time and space complexity
Algorithm design techniques: greedy, dynamic programming and divide-and-conquer
Graph search, minimum spanning trees, shortest paths
Theory of Computation
Select All
Regular expressions and finite automata
Context-free grammars and push-down automata
Regular and context-free languages, pumping lemma
Turing machines and undecidability
Compiler Design
Select All
Lexical analysis, parsing
Syntax-directed translation
Runtime environment
Intermediate code generation
Local and global optimization
Operating System
Select All
System calls
Processes, threads, inter-process communication, concurrency and synchronization
Deadlock
CPU scheduling
Memory management and virtual memory
File systems
Databases
Select All
ER-model
Relational model: relational algebra, tuple calculus, SQL
Integrity constraints, normal forms
File organization, indexing (e.g., B and B+ trees)
Transactions and concurrency control
Computer Networks
Select All
ISO/OSI stack
LAN technologies (Ethernet)
Flow and congestion control
TCP/UDP and sockets
IP addressing
Routing
Network security: basic concepts of cryptography
Number of Questions:
Test Duration (minutes):
Select Difficulty:
Easy
Medium
Standard
Hard
Expert
Most Difficult
Random
Generating your test... Please wait.