Take a full-length GATE CSE mock test online, free. Each attempt picks 65 questions at random from every GATE CSE practice set on CodingHumans, covering algorithms, operating systems, theory of computation, DBMS, computer networks, computer organization, discrete mathematics and general aptitude. As new sets are published, they join the question bank automatically.
How the mock test works
- 65 questions and a 3-hour timer, like the real exam.
- +1 mark for a correct answer and −0.33 for a wrong one. Unanswered questions score 0.
- Answers stay hidden until you submit. The test submits itself when the time runs out.
- After submitting, every question shows the correct answer, an explanation and a link to the practice set it came from.
- The real GATE paper mixes 1-mark and 2-mark questions and includes numerical answer types. This mock uses multiple-choice questions only, so treat your score as a guide.
The mock test loads here. If it does not appear, please make sure JavaScript is enabled and refresh the page.
Tips for mock tests
- Take the mock in one sitting, with no notes and no breaks, so your score reflects exam conditions.
- Do a first pass answering only the questions you are sure about, then come back to the rest.
- After submitting, spend as long reviewing the explanations as you spent on the test. Note every concept you got wrong and revise it from the linked practice set.
- Retake the mock after a week. Questions are shuffled each time.
Competitive Exams Hub | All GATE CSE practice sets
GATE CSE exam pattern at a glance
| Total | 65 questions, 100 marks, 3 hours |
|---|---|
| General Aptitude | 10 questions, 15 marks |
| Engineering Mathematics and CS subjects | 55 questions, 85 marks |
| Question types | MCQ, MSQ (more than one correct) and NAT (numerical answer) |
| Negative marking | MCQs only: −1/3 for a 1-mark and −2/3 for a 2-mark question; none for MSQ and NAT |
This is the pattern GATE has used in recent years. Check the official information brochure for your year before the exam, because small details do change.
Where the questions come from
The mock draws its questions from these practice sets. If a topic keeps costing you marks, open its set and work through it on its own, with the explanations, before your next attempt.
- GATE CSE MCQs - Data Structures and Algorithms: Recurrences, Trees, Sorting and Graphs
- GATE CSE MCQs - Operating Systems: Scheduling, Paging, Deadlocks and Synchronization
- GATE CSE MCQs - Theory of Computation: DFA, Regular Languages, CFLs and Decidability
- GATE CSE MCQs - DBMS: Keys, Normalization, Transactions and Indexing
- GATE CSE MCQs - Computer Networks: Subnetting, Sliding Window, TCP and MAC Protocols
- GATE CSE MCQs - Computer Organization and Digital Logic: Cache, Pipelining, K-maps and Flip-Flops
- GATE CSE MCQs - Discrete Mathematics: Logic, Combinatorics, Graphs and Groups
- GATE CSE MCQs - General Aptitude: Verbal Ability and Quantitative Aptitude
- GATE CSE MCQs - Engineering Mathematics: Linear Algebra, Probability and Calculus
- GATE CSE MCQs - Compiler Design: Parsing, SDT and Code Optimization
- GATE CSE MCQs - Engineering Mathematics: Probability and Statistics
- GATE CSE MCQs - Engineering Mathematics: Calculus and Linear Algebra Practice
Five sample questions
Here is a taste of the question bank. Try them before you start the full test. The answers are hidden until you open them.
In the IPv4 header, the fragment offset field is measured in units of:
(a) 1 byte
(b) 4 bytes
(c) 8 bytes
(d) 16 bytesShow answer
(c) 8 bytes. The 13-bit offset counts 8-byte blocks, which is why every fragment except the last must carry a multiple of 8 data bytes. More questions like this
A 32 KB 4-way set-associative cache has 64-byte blocks and the machine uses 32-bit byte addresses. How many tag bits are there?
(a) 17
(b) 18
(c) 19
(d) 21Show answer
(c) 19. 512 lines / 4 = 128 sets, so the set index is 7 bits. Tag = 32 − 7 − 6 = 19. More questions like this
The number of requests reaching a server in one second follows a Poisson distribution with mean 2. What is the probability that at least one request arrives in a given second?
(a) 2e⁻²
(b) 1 − e⁻²
(c) e⁻²
(d) 1 − 3e⁻²Show answer
(b) 1 − e⁻². P(X = 0) = e⁻λ = e⁻², so P(X ≥ 1) = 1 − e⁻² ≈ 0.865. The option 1 − 3e⁻² would be P(X ≥ 2). More questions like this
A relation is in 3NF but not in BCNF. Which situation causes this?
(a) A partial dependency on part of a key
(b) A dependency X → A where X is not a superkey but A is a prime attribute
(c) A multivalued attribute
(d) A transitive dependency on a non-prime attributeShow answer
(b) A dependency X → A where X is not a superkey but A is a prime attribute. 3NF allows X → A when A is prime (part of some candidate key). BCNF does not, because it requires every determinant to be a superkey. More questions like this
A 4 × 4 matrix A is idempotent (A² = A) and its trace is 3. What is the rank of A?
(a) 3
(b) 4
(c) 1
(d) Cannot be determinedShow answer
(a) 3. An idempotent matrix has eigenvalues 0 or 1 only and is diagonalisable, so its rank equals the number of eigenvalues equal to 1, which is the trace: 3. More questions like this
How to use your result
If you have a month left, take this mock once a week and use the days between to fix what it shows. Most people lose marks in the same two or three subjects every time, and a mock is the quickest way to find out which ones they are for you. Keep a notebook of every question you got wrong, with one line on why, and read it before the next attempt.
Frequently asked questions
Is this the official GATE mock test?
No. It is an original practice mock built from CodingHumans GATE CSE question sets. For the official interface, use the mock test on the GATE organising institute's website.
Will I get the same questions every time?
No. Questions are picked at random from the full question bank on each attempt, so you can take the mock several times.
Where is my score saved?
Your last score is saved in your browser on this device. It is not uploaded anywhere.
Comments
Post a Comment