Discrete Structures and Optimization – Previous Year Questions
272 questions from past UGC NET Paper 2 – Computer Science papers, each with the correct answer. Open any question for its explanation.
- Which of the following is not a key issue stressed by an agile philosophy of software engineering?
- Software Engineering is an engineering discipline that is concerned with:
- The major shortcoming of the waterfall model is
- The quick design of a software that is visible to end users leads to ______.
- The ______ model is preferred for software development when the requirements are not clear.
- Which of the following is not included in the waterfall model?
- Which of the following is not a software process model?
- Which process model is also called the classic life cycle model?
- Match List – I with List – II. List I: (A) LRU (B) Demand cleaning (C) Long term scheduling (D) Medium term scheduling List II: (I) Page not referenced for the longest time is replaced (II) Page is written to secondary…
- Three processes arrive as follows: Process Arrival Time Burst Time P0 0 ms 7 ms P1 1 ms 3 ms P2 2 ms 7 ms The preemptive shortest-job-first (SJF) scheduling algorithm is used, with scheduling decisions made only at a pr…
- For the following set of processes scheduled using FCFS policy, determine the average waiting time. Assume that the processes arrived in the order P1, P2, P3, P4. Process Burst Time (ms) P1 8 P2 15 P3 10 P4 7
- Which of the following statements are true? (A) Shortest remaining time first scheduling may cause starvation. (B) Preemptive scheduling may cause starvation. (C) Round robin is better than FCFS in terms of response tim…
- An OS follows round robin scheduling with a time quantum of 4 ms. Assuming that the CPU is free now and there are 20 processes waiting in the ready queue, what is the maximum amount of time that a process waits before g…
- If an operating system does not allow a child process to exist when the parent process has been terminated, this phenomenon is called:
- Consider the following 3 processes, with the length of the CPU burst time given in milliseconds: Process Arrival Time Burst Time P1 0 8 P2 1 4 P3 2 9 What is the average waiting time for these processes if they are sche…
- Assuming that the system call fork() never fails, consider the following C programs P1 and P2 executed on a UNIX/Linux system. P1 P2 int main() { fork(); fork(); fork(); printf("Happy\n"); } int main() { fork(); printf(…
- Consider the following four processes with the arrival time and length of CPU burst given in milliseconds: Process Arrival Time Burst Time P1 0 8 P2 1 4 P3 2 9 P4 3 5 Using the preemptive shortest job first (SJF / SRTF)…
- Which module gives control of the CPU to the process selected by the short-term scheduler?
- A fair share scheduler computes the priority of a process based on which of the following? (1) Processor utilization by the individual process. (2) Weight assigned to the user/group. (3) Processor utilization by the use…
- Which of the following CPU scheduling algorithms may cause starvation of a process? (1) First-Come-First-Served (2) Round Robin (3) Priority scheduling (4) Shortest-Process-Next (5) Shortest-Remaining-Time-First
- A scheduling algorithm assigns a process's priority proportional to how long it has been waiting; every process starts at priority zero (the lowest), and the scheduler re-evaluates all priorities and picks the next proc…
- Match List I with List II List I List II
- Choose the correct statement for a group G :
- Which one of the following is not a basic solution of the system of linear equations x₁ + 2x₂ + x₃ = 4, 2x₁ + x₂ + 5x₃ = 5?
- Match the logically equivalent propositions. List I: A. p → q, B. ¬(p ∨ (¬p ∧ q)), C. p ↔ q, D. ¬(p ↔ q). List II: I. (p ∧ q) ∨ (¬p ∧ ¬q), II. ¬p ∨ q, III. ¬(p ∨ q), IV. ¬p ↔ q.
- The probability that A hits a target is 1/4 and the probability that B hits it is 2/5. Both shoot at the target. What is the probability that at least one of them hits it?
- Arrange the following graphs in increasing order of number of edges (for n > 3): A. Kₙ (complete graph), B. Cₙ (cycle graph), C. Wₙ (wheel graph), D. Kₙ,ₙ (complete bipartite graph), E. Qₙ (n-cube graph).
- An LPP: Minimize z = 30x − 18y subject to 3x + 4y ≤ 60, 5x − 3y ≥ 20, x, y ≥ 0. In this feasible region, the solution(s) of the LPP is/are: A. (4, 0) B. (2, 0) C. (7, 5) D. (0, 15) E. (8, 5)
- Which of the following Graph is/are planer? Choose the most appropriate answer from the options given below:
- Match List I (law) with List II (axiom). List I: A. Absorption law, B. Bounded law, C. Identity law, D. Distributive law. List II: I. a + 1 = 1; II. a + 0 = a; III. a·(b + c) = (a·b) + (a·c); IV. a + (a·b) = a.