HomeSubjectsUniversityBlogAbout

Sample NSCT MCQs

Below are twenty example questions drawn from across all ten NSCT subjects — two per subject, mixed across Easy, Medium, and Hard difficulty levels. Every question includes the full explanation you would see during live practice. Skim through them to get a feel for the question style and depth before starting your first real quiz.

How to get the most from this page

  • Try to answer each question before reading the highlighted option — the muscle memory matters more than the score.
  • Pay attention to the trap options. Most NSCT questions have three plausible-looking distractors, and learning to spot them is the single biggest accuracy lift.
  • Read every explanation, even for questions you got right. The reasoning is what transfers to new questions; the answer does not.
  • When you spot a topic you struggle with, click through to its subject page for a focused study plan.

Problem Solving & Analytical Skills

3,360+ total MCQs · View subject page

Complexity & Efficiency AwarenessMedium

An algorithm runs in O(n log n) time. If it takes 1 second for n = 1000, approximately how long will it take for n = 1,000,000?

  1. A.~1000 seconds
  2. B.~2000 seconds✓ Correct
  3. C.~6000 seconds
  4. D.~1,000,000 seconds

Explanation

n grows by 1000x, log n grows by roughly 2x (from ~10 to ~20), so total work grows by ~2000x. That puts the runtime near 2000 seconds — not the linear extrapolation (1000s) and nowhere near the O(n^2) answer (1,000,000s).

Algorithmic ThinkingMedium

A function is called recursively with the rule f(n) = f(n/2) + 1, base case f(1) = 0. What does f(n) compute for n = 2^k?

  1. A.The value k (i.e., log₂ n)✓ Correct
  2. B.The value n
  3. C.The value 2n
  4. D.The value n − 1

Explanation

Each recursive call halves n and adds 1 to the result. Starting from n = 2^k, you need exactly k halvings to reach 1, so f(2^k) = k = log₂ n. Recognizing this is the core pattern behind binary search and many divide-and-conquer complexity derivations.

AI / Machine Learning & Data Analytics

3,570+ total MCQs · View subject page

Model Evaluation & ValidationEasy

You train a model that gets 99% training accuracy but 62% test accuracy. What is most likely happening, and what is the first fix to try?

  1. A.Underfitting — train a larger model.
  2. B.Overfitting — add regularization or more data.✓ Correct
  3. C.Data leakage — the test set is too easy.
  4. D.The metric is wrong — switch to precision/recall.

Explanation

A large gap between training and test accuracy is the textbook signature of overfitting. The first line of defence is regularization (L1/L2, dropout) or increasing the training data. Underfitting would show low accuracy on both sets. Data leakage usually inflates test accuracy, not the reverse.

Model Evaluation & ValidationMedium

In a fraud detection dataset where 1% of transactions are fraudulent, which metric is MOST misleading if used alone?

  1. A.F1 score
  2. B.Precision
  3. C.Recall
  4. D.Accuracy✓ Correct

Explanation

A model that predicts 'not fraud' for every transaction scores 99% accuracy on this dataset while catching zero fraud. Accuracy hides class imbalance; precision and recall (and their harmonic mean, F1) reveal it.

Computer Networks & Cloud Computing

2,100+ total MCQs · View subject page

Network LayerMedium

A device has IP address 192.168.1.130 with subnet mask 255.255.255.192. What is the network address?

  1. A.192.168.1.0
  2. B.192.168.1.64
  3. C.192.168.1.128✓ Correct
  4. D.192.168.1.192

Explanation

A /26 mask (255.255.255.192) gives 64-host blocks: .0, .64, .128, .192. The address .130 falls into the .128 block, so the network address is 192.168.1.128. The last valid host in this subnet is .190 and the broadcast is .191.

Transport LayerEasy

Which statement about TCP and UDP is CORRECT?

  1. A.TCP is connectionless; UDP is connection-oriented.
  2. B.TCP guarantees in-order delivery; UDP does not.✓ Correct
  3. C.UDP has flow control; TCP does not.
  4. D.Both protocols require a three-way handshake.

Explanation

TCP is connection-oriented, reliable, and guarantees in-order delivery via sequence numbers and retransmissions. UDP is connectionless, unreliable, and delivers datagrams in whatever order they arrive. Only TCP uses the three-way handshake; UDP has no handshake at all.

Data Structures & Algorithms

2,520+ total MCQs · View subject page

Linear Data StructuresEasy

Which data structure is BEST for implementing a browser's 'back' button?

  1. A.Queue
  2. B.Stack✓ Correct
  3. C.Priority queue
  4. D.Hash table

Explanation

'Back' undoes the most recent action first — that is LIFO behaviour, which is exactly what a stack provides. A queue would give you the oldest page first, the reverse of what you want. Priority queues and hash tables don't encode action ordering.

Tree AlgorithmsMedium

What is the worst-case time complexity of inserting n elements into an initially empty binary search tree, assuming no rebalancing?

  1. A.O(n)
  2. B.O(n log n)
  3. C.O(n²)✓ Correct
  4. D.O(2^n)

Explanation

If elements arrive in sorted order, each insert walks the full height of the tree, which degenerates into a linked list of length n. That makes the i-th insert O(i), summing to O(n²). With self-balancing (AVL, red-black), the worst case drops to O(n log n).

Operating Systems

2,520+ total MCQs · View subject page

DeadlocksMedium

Which of the following is NOT one of the four Coffman conditions required for deadlock?

  1. A.Mutual exclusion
  2. B.Hold and wait
  3. C.Preemption✓ Correct
  4. D.Circular wait

Explanation

The four Coffman conditions are mutual exclusion, hold and wait, NO preemption, and circular wait. Preemption itself actually PREVENTS deadlock — if we can forcibly take resources from a process, the hold-and-wait chain breaks. The trap here is reading quickly and missing the 'NO'.

Memory ManagementMedium

A system uses 32-bit virtual addresses with 4 KB pages. How many bits are needed for the page offset?

  1. A.10 bits
  2. B.12 bits✓ Correct
  3. C.16 bits
  4. D.20 bits

Explanation

A 4 KB page holds 4096 = 2^12 bytes, so the offset within a page takes 12 bits. The remaining 32 − 12 = 20 bits identify the page number, giving 2^20 = roughly 1 million pages in the virtual address space.

Web Development

3,570+ total MCQs · View subject page

Web Architecture & ProtocolsEasy

Which HTTP status code indicates a resource has moved PERMANENTLY to a new URL?

  1. A.301✓ Correct
  2. B.302
  3. C.307
  4. D.308

Explanation

301 Moved Permanently tells clients (and search engines) to update their bookmarks and index entries to the new URL. 302 and 307 are temporary redirects. 308 is also a permanent redirect but preserves the HTTP method, while 301 historically allowed clients to change POST to GET.

JavaScript FundamentalsHard

In JavaScript, what does the following output? console.log([] == false)

  1. A.true✓ Correct
  2. B.false
  3. C.TypeError
  4. D.undefined

Explanation

With loose equality (==), both sides are coerced. [] converts to '' (empty string), which converts to 0. false also converts to 0. So 0 == 0 → true. This is why style guides push === — loose equality's coercion rules are a reliable trap.

Software Engineering

3,360+ total MCQs · View subject page

Agile DevelopmentEasy

In Scrum, which role is responsible for maximizing the value of the work done by the development team?

  1. A.Scrum Master
  2. B.Product Owner✓ Correct
  3. C.Development Team Lead
  4. D.Project Manager

Explanation

The Product Owner owns the backlog and prioritizes features by business value. The Scrum Master facilitates the process and removes impediments but does not set priorities. There is no 'Development Team Lead' or 'Project Manager' in the official Scrum framework.

Software TestingMedium

Which testing level would catch a bug where two correctly-tested modules fail to communicate due to a mismatched data format?

  1. A.Unit testing
  2. B.Integration testing✓ Correct
  3. C.Acceptance testing
  4. D.Regression testing

Explanation

Unit tests verify a single module in isolation — they would not exercise the interface between modules. Integration tests specifically target the contracts between modules, which is exactly where this bug lives. Acceptance and regression testing operate at higher levels and usually catch this too, but integration is the first and most economical line of defence.

Programming

3,360+ total MCQs · View subject page

Operators & ExpressionsMedium

In C, what does the following print? int x = 5; printf("%d", x++); printf("%d", ++x);

  1. A.5 6
  2. B.5 7✓ Correct
  3. C.6 7
  4. D.6 6

Explanation

x++ is post-increment: it uses the current value (5) then increments to 6. ++x is pre-increment: it increments first (to 7) then uses that value. So the output is '5' followed by '7'. Any language with both operators will behave this way for primitive integers.

Object-Oriented Programming (OOP)Easy

Which OOP concept is demonstrated when a subclass provides a different implementation of a method already defined in its parent class?

  1. A.Overloading
  2. B.Overriding✓ Correct
  3. C.Encapsulation
  4. D.Abstraction

Explanation

Overriding is exactly this: the subclass replaces the parent's implementation while keeping the same signature, and the choice of which version runs is made at runtime (dynamic dispatch). Overloading is defining multiple methods with the same name but different signatures in the same class, resolved at compile time.

Databases

3,570+ total MCQs · View subject page

Database Design & NormalizationMedium

A table has columns (A, B, C). If A → B and B → C, which normalization form removes this dependency chain?

  1. A.1NF
  2. B.2NF
  3. C.3NF✓ Correct
  4. D.BCNF

Explanation

3NF specifically targets transitive dependencies — situations where a non-key column (B) determines another non-key column (C). Splitting the table so that C lives with its determinant B, separate from A, satisfies 3NF. 2NF removes partial dependencies on composite keys; BCNF tightens 3NF further for edge cases.

SQLEasy

Which SQL clause filters GROUPS after aggregation?

  1. A.WHERE
  2. B.HAVING✓ Correct
  3. C.FILTER
  4. D.GROUP BY

Explanation

HAVING is the post-aggregation filter. WHERE filters rows before they enter the aggregation. GROUP BY defines the grouping but does not filter. FILTER is a PostgreSQL extension used inside aggregate functions, not a top-level filtering clause.

Cyber Security

3,360+ total MCQs · View subject page

Web SecurityMedium

Which attack exploits user trust in a website to execute unintended actions using the user's authenticated session?

  1. A.SQL Injection
  2. B.Cross-Site Scripting (XSS)
  3. C.Cross-Site Request Forgery (CSRF)✓ Correct
  4. D.Man-in-the-Middle

Explanation

CSRF tricks an authenticated user's browser into sending a request the user did not intend (e.g., transfer money while logged into a bank site). XSS runs attacker code in the user's browser. SQLi attacks the database via crafted input. MITM intercepts traffic in transit. The defining CSRF trait is 'uses the existing session without the user's knowledge'.

CryptographyMedium

What is the primary reason passwords should be stored as salted hashes rather than as encrypted values?

  1. A.Hashes are faster to compute than encryption.
  2. B.Hashing is one-way — even the server cannot recover the original password.
  3. C.Encryption keys must be stored somewhere and can be stolen; hashing has no key.
  4. D.Both B and C are correct.✓ Correct

Explanation

Both reasons matter. One-way hashing means a database leak does not expose plaintext passwords, and the absence of a shared key means there is no secondary secret whose compromise would unlock everything. Salting additionally defeats rainbow tables by making each hash unique even for identical passwords.

Ready for the real thing?

The full question bank has 31,290+ MCQs. Pick a subject, choose your difficulty, and start practicing — no signup required.

Browse all subjects