". VdoTips: COMPUTER FUNDAMENTAL PRACTICE SET 35

COMPUTER FUNDAMENTAL PRACTICE SET 35

261. In which tree, for every node the height of its left sub tree and right sub tree differ almost by one?
(A). Binary search tree
(B). AVL tree
(C). Threaded Binary Tree
(D). Complete Binary Tree

(B). 262. The design issue of Data link Layer in OSI Reference Model is
(A). Framing
(B). Representation of bits
(C). Synchronization of bits
(D). Connection control

(B). 263. Given the following expressions of a grammar E -> E * F / F + E / F F -> F – F / id Which of the following is true?
(A). * has higher precedence than +
(B). – has higher precedence than *
(C). + and – have same precedence
(D). + has higher precedence than *

(D). 264. The maturity levels used to measure a process are
(A). Initial, Repeatable, Defined, Managed, Optimized.
(B). Primary, Secondary, Defined, Managed, Optimized.
(C). Initial, Stating, Defined, Managed, Optimized.
(D). None of the above

(A). 265. The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using:
(A). Parity bit
(B). Aging
(C). Compaction
(D). Timer

(C).