Free MCQs for Computer Science Lecturer posts — programming, databases & networks at BS/MSc level.
20 of 450 Lecturer (Computer Science) questions, shown with their correct answers — open an answer to check yourself, then practice the full set free.
A noiseless channel has a bandwidth of 4000 Hz and signals are sent using 16 distinct signal levels. By Nyquist's formula for a noiseless channel, the maximum bit rate is:hard
Correct answer: 32,000 bps
A channel has bandwidth 4000 Hz and a signal-to-noise ratio of 15 dB. By Shannon's theorem its maximum data rate is approximately:
A live look at what's newest across TestGenius
The progress report of a pupil is prepared from the:
Practice thisThe dyer is dyeing the yarn.
Practice thisBrezhnev, the name borne from 1982 to 1988 in honour of the Soviet leader by a city on the Kama River in Tatarstan, is the present-day Russian city of:
Practice 450 Lecturer (Computer Science) multiple-choice questions from Post-Wise Preparation, covering easy, medium and hard level questions (238 easy, 128 medium, 84 hard). Attempt a batch, check each answer instantly and repeat as often as you like — free, with no signup. Explore more subjects in Post-Wise Preparation.
Lecturer (Computer Science) sits in Post-Wise Preparation and currently has 450 practice questions: 53% easy, 28% medium, 19% hard. This set leans towards easier questions, which makes it a comfortable starting point before moving on to harder material.
With 450 questions, doing about 25 a day would take roughly 18 days to complete once, so splitting it into weekly targets works best.
Examples of questions in this subject:
There are 450 Lecturer (Computer Science) MCQs on TestGenius (238 easy, 128 medium, 84 hard), as part of Post-Wise Preparation. You can practise all of them free on this page.
Yes. Lecturer (Computer Science) practice on TestGenius is completely free and guest practice needs no signup. Creating a free account unlocks unlimited questions, timed quizzes and certificates.
Yes. A sample of Lecturer (Computer Science) questions with their correct answers is shown on this page, and in the practice session every answer is checked instantly as you attempt it.
Work through the Lecturer (Computer Science) questions in batches, review each correct answer after you attempt it, and repeat the questions you got wrong until you can answer them confidently. Then take a timed quiz to check yourself under exam pressure.
Correct answer: 20 kbps
Using the basic COCOMO model for an organic project, effort E = 2.4 x (KLOC)^1.05 person-months. For an 8 KLOC project the estimated effort is approximately:easy
Correct answer: 21 person-months
A system uses 48-bit virtual addresses with a page size of 16 KB. The number of bits in the virtual page number field is:medium
Correct answer: 34
In TCP, the receipt of three duplicate ACKs by a sender triggers:easy
Correct answer: Fast retransmit of the missing segment without waiting for the retransmission timer to expire
What is the default subnet mask of a Class B IPv4 network?easy
Correct answer: 255.255.0.0
Using the basic COCOMO model for an embedded project, effort E = 3.6 x (KLOC)^1.20 person-months. For a 4 KLOC project the estimated effort is approximately:easy
Correct answer: 19 person-months
A program's control-flow graph has 22 edges and 17 nodes (a single connected component). Its cyclomatic complexity is:easy
Correct answer: 7
In the Bellman-Ford algorithm, a negative-weight cycle reachable from the source is detected because:hard
Correct answer: After |V| - 1 rounds of relaxation over all edges, some edge can still be relaxed further
A relation is in fourth normal form (4NF) if and only if:easy
Correct answer: For every non-trivial multivalued dependency X ->> Y that holds in it, X is a superkey of the relation
According to the Myhill-Nerode theorem, the number of states in the minimal DFA for a regular language L equals:hard
Correct answer: The number of equivalence classes of the indistinguishability relation of L
In an NFA, state q0 has an epsilon transition to q1, and q1 has an epsilon transition to q2. There are no other epsilon transitions. The epsilon-closure of {q0} is:easy
Correct answer: {q0, q1, q2}
In loop optimisation, an induction variable of a loop is best described as:easy
Correct answer: A variable whose value increases or decreases by a fixed constant amount on every iteration of the loop, so that expensive operations on it, such as multiplication, can often be replaced by cheaper additions
RAID level 6 protects data against:medium
Correct answer: Simultaneous failure of any two disks
Which SQL statement removes all rows of a table while retaining the table's structure?hard
Correct answer: TRUNCATE
According to Armstrong's axioms for functional dependencies, the transitivity rule states that:easy
Correct answer: If X -> Y and Y -> Z both hold, then X -> Z also holds
Which algorithm correctly computes single-source shortest paths in a graph that has negative edge weights but no negative cycles?medium
Correct answer: Bellman-Ford algorithm
A transaction that has finished executing its final statement, but has not yet committed or aborted, is said to be in the:easy
Correct answer: Partially committed state
A compiler that runs on one machine but generates executable code for a different machine is called a:easy
Correct answer: Cross compiler
Deterministic context-free languages are closed under:medium
Correct answer: Complementation
Lecturer (Computer Science) sits in Post-Wise Preparation and currently has 450 practice questions: 53% easy, 28% medium, 19% hard. This set leans towards easier questions, which makes it a comfortable starting point before moving on to harder material.
Yes — signed-in users can take a timed quiz in any subject and earn a certificate by passing it. Practice mode itself is untimed and does not issue certificates.