Test Mode
Reading
Mode
Right = 0
Wrong = 0
Assit. Programmer | Sonali Bank, Rubali Bank, BD Krishi Bank - 16.11.2018
All
It selects which process has to be brought into the ready queue
It selects which process has to be executed nest and allocates CPU
It selects which process to remove front memory by swapping
It selects which process needs to be killed next
the maximal set of numbers for which a function is defined
the maximal set of numbers which a function can take values
it is the set of natural numbers for which a function is defined
any set of positive numbers
Dynamic programming algorithms
lesser prone to deadlocks
not at all prone to deadlocks
always results in deadlock
a tow level paging algorithm
attaching portion of the file system into a directory structure
removing portion of the file system into a directory structure
The left child is always lesser than its parent
The right child is always greater than its parent
The left and right sub-should also be binary search trees
Either the left of the right sub- tree should be be binary search tree but not both.
"return-type function name (argument type;)"
"return-type function -name (argument type){}"
"return -type (argument type ) function-name"
"return-type {} function -name"
When the list has only a few elements
When performing a single earch in an unordered list
When list has only a few elements and when performing a single search in an underdone ist