35. The preorder transversal of a certain binary search tree is 10 532151220. If the value 11 is then added to this tree, what is the preorder transversal of the resulting tre0? A. 11 10 532 15 12 20 B. 10 11 532 15 12 20 C. 10 53215 11 12 20 D. 10 532 15 12 11 20 36. Memory management is necessary 30. What is the 2's complement representation of-24 in a 16 bit microcomputer? to win 100000 0000 B. 1111 1111 1110 0111 C. 1111 11111110 1000 D. 1000 0000 0001 1000 31. Three ways to Improve the performances of a hard disk include A. Disk caching, RAID, and file expansion. B. File compression, disk caching, and file encryption. C. Disk caching, RAID and file compression. D. RAID, file compression and disk expansion. 32. What did Alan Turning propose as a way to answer the question "can computers think?" A. Allowing computers to enter the World Chess Championship B. The imitation game, later called the Turning test C. Programming a computer to sölve calculus problems D. Teaching a computer program itself. 33. The following are the statements regarding the Non- Polynomial (NP) problems. Choose the right option from the followlng options I. because A. The memory is finite B. Many programs have to run simultageously C. Weoperate in a multitask environment D. Albof the above 37. The ROM containing the BIOS can be considered gs Secondary storage unit BA peripheral unit C. Part of memory unit DA processing unit 38. Program pre-emption is A. Forced withdrawal of CPU from a program which is executing. B. Release of CPU from by a program after completing its task. C. Forceful allotment of CPU by a program to itself D. Program termination due to detection of an error 39. An operating system.contain 3 user processes, each process requiring 2 units of the resource R. the minimum number of units R AIRNP-complete problems are not NP- bey II. SomeNP-hardware problems are not known to be NP-complete. A. Both (1) and (II) are true B. Bothe (1) and (II) are false C. Only (1) is true D. Only (II) is true 34. A full-adder is simply a connection of two half-adders joined by A. AND gate B. OR gate C. NAND gate D. NOR gate required such that there is no possibility of dead lock on R is B. 3 C. 5 40. Concurrent processes executing without mutual execution can lead A. Faster execution of processes B. Deadlock