All mock tests are FREE till 31 December — register to save your progress
Paper 2 CS · UNIT 01 · MOCK TEST

Mock 13 – Mixed Practice (Part 2)

Unit 1: Discrete Structures and Optimisation · 21 questions · about 25 minutes. Press End Mock any time to see your score and the correct answers.

All 14 topic-wise mocks in this unit
0 / 21 answered 00:00
Q1. RAD software process model stands for
Q2. The model in which the requirements are implemented by its category is
Q3. Match List-I with List-II:
List-I (Software process model)
(a) Waterfall model
(b) Incremental development
(c) Prototyping
(d) RAD
List-II (Software system)
(i) An e-business that starts with only the basic functionality and then moves on to more advanced features
(ii) An inventory control system for a supermarket
(iii) A virtual reality system for simulating vehicle navigation in a highway
(iv) Automate the manual system for student record maintenance in a school
Choose the correct answer from the options given below:
Q4. Which of the following statements is/are false?
P: The clean-room strategy to software engineering is based on the incremental software process model.
Q: The clean-room strategy to software engineering is one of the ways to overcome "unconscious" copying of copyrighted code.
Choose the correct answer from the code given below:
Q5. Which of the following is not one of the principles of agile software development method?
Q6. Which of the following is not a key issue stressed by an agile philosophy of software engineering?
Q7. Software Engineering is an engineering discipline that is concerned with:
Q8. The major shortcoming of the waterfall model is
Q9. The quick design of a software that is visible to end users leads to ______.
Q10. The ______ model is preferred for software development when the requirements are not clear.
Q11. Which of the following is not included in the waterfall model?
Q12. Which of the following is not a software process model?
Q13. Which process model is also called the classic life cycle model?
Q14. Three processes arrive as follows:
ProcessArrival TimeBurst Time
P00 ms7 ms
P11 ms3 ms
P22 ms7 ms
The preemptive shortest-job-first (SJF) scheduling algorithm is used, with scheduling decisions made only at a process arrival or completion. What is the average waiting time for the three processes?
Q15. 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 time.
Q16. 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 getting into the CPU?
Q17. If an operating system does not allow a child process to exist when the parent process has been terminated, this phenomenon is called:
Q18. Consider the following four processes with the arrival time and length of CPU burst given in milliseconds:
ProcessArrival TimeBurst Time
P108
P214
P329
P435
Using the preemptive shortest job first (SJF / SRTF) scheduling algorithm, what is the average waiting time (in ms) for these processes?
Q19. Which module gives control of the CPU to the process selected by the short-term scheduler?
Q20. 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
Q21. 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 process to run every T time units. If no process performs I/O and all arrive at time zero, which classical scheduling discipline does this scheme effectively implement?