The data structure suitable for scheduling processes is _______

  1. Home

- Online Exam Test Papers | - MCQs[multiple choice questions and answers ] | - Mock Test Papers | - Practice Papers | - Sample Test Papers |

Question:
The data structure suitable for scheduling processes is _______

1.List

2.Heap

3.Queue

4. Stack

More MCQS Questions and answers

  1.  If the subroutine exceeds the private space allocated to it then the values are pushed onto _________
  2.  The assembler stores all the names and their corresponding values in _____
  3.  The instructions like MOV or ADD are called as ____
  4.  The order in which the return addresses are generated and used is _________
  5.  When dealing with the branching code the assembler ___________
  6. In case of nested subroutines the return addresses are stored in __________
  7. In the case of nested subroutines, the stack top is always _________
  8. Instructions which won’t appear in the object program are called as ___
  9.  The Instruction fetch phase ends with _______
  10. The alternate way of writing the instruction, ADD #5,R1 is _____
  11. The appropriate return addresses are obtained with the help of ____ in case of nested routines.
  12. The assembler directive EQU, when used in the instruction: Sum EQU 200 does ____
  13. The assembler stores the object code in ______
  14. The condition flag Z is set to 1 to indicate _____
  15. The data structure suitable for scheduling processes is _______
  16. The directive used to perform initialization before the execution of the code is ______
  17. The Instruction fetch phase ends with _______
  18. The last statement of the source program should be _______
  19. The location to return to, from the subroutine is stored in _______
  20. The most efficient way of handling parameter passing is by using ______
  21. The most Flexible way of logging the return addresses of the subroutines is by using _______
  22. The private space gets allocated to each subroutine when _________
  23. The private work space dedicated to a subroutine is called as ________
  24. The purpose of the ORIGIN directive is ______
  25. The reserved memory or private space of the subroutine gets deallocated when _______
  26. The return address of the Sub-routine is pointed to by ______
  27. The stack frame for each subroutine is present in ______
  28. The sub-routine service procedure is similar to that of the interrupt service routine in ________
  29. The utility program used to bring the object code into memory for execution is _____
  30. To overcome the problems of the assembler in dealing with branching code we use ____
  31. What is subroutine nesting?
  32. When dealing with the branching code the assembler _____
  33. When parameters are being passed on to the subroutines they are stored in ________
  34. When using Branching, the usual sequencing of the PC is altered. A new instruction is loaded which is called as ______
  35. While using the iterative construct (Branching) in execution _____________ instruction is used to check the condition.
  36. ___ directive is used to specify and assign the memory required for the block of code.
  37. ____ the most suitable data structure used to store the return addresses in the case of nested subroutines.
  38. _____ directive specifies the end of execution of a program.
  39. _____ pointer is used to point to parameters passed or local parameters of the subroutine.
  40. ______ converts the programs written in assembly language into machine instructions.
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!