Escolar Documentos
Profissional Documentos
Cultura Documentos
[A] Edit
[B] REGEDIT
[C] DEVICE MANAGER
[D] Control Panel Applets
[E] None of these
(Ans):-D
3. Stack is structure.
[A] Last in first out (LIFO)
[B] First in First out (FIFO)
[C] First in Last out (FILO)
[D] First come First served (FCFS)
[E] None of these
(Ans):-A
4. A language L allows declaration of arrays whose sizes are not known during compilation.
It is required to use efficient use of memory, which one of the following is true?
5. Which of the following systems implementation approaches should be used if you want to
run the old system and the new system at the same time for a specified period?
[A] Direct
[B] Pilot
(3)Phased
(4)Parallel
[E] None of these
(Ans):-D
6. In open (), the mode, that opens a binary file for readings is
[A] r
[B] r+
[C] rb
(4)r+b
[E] None of these
(Ans):-C
11. Which of the following derivations does a top-down parser while parsing an input string?
The input is assumed to be scanned in left to right order.
[A] Left most derivation
[B] Left most derivation traced out in reverse
[C] Right most derivation
[D] Right most derivation traced out in reverse
[E] None of these
(Ans):-A
13. IE uses
[A] Active X controls for interaction between browser and third party application and the
operating system
[B] Active X control for browser and operating system
[D] ISP
[E] None of these
(Ans):-D
18. Which of the following circuit type is based up on time or clock pulse?
[A] Combinational circuit
[B] Sequential circuit
[C] Full adder
[D] All the above
[E] None of these
(Ans):-B
19. A solution to the problem were the source and destination hosts are on the same type of
network, but there is a different network in between-----[A] Data link
[B] Packet
[C] Tunneling
[D] Hopping
(Ans):-B
23. DMA is
[A] High speed I/O devices
[B] It transfers blocks of data directly to and from its own buffer storage to memory
[C] In DMA transfer for I/O, CPU has no intervention
[D] All the above
[E] None of these
(Ans):-D
24. Randomized quick sort is an extension of quick sort where the pivot is chosen randomly.
What is the worst case complexity of sorting n numbers using randomized quick sort?
[A] 0 (n)
[B] 0 (n log n)
[C] 0 (n2)
[D] 0 (log n)
[E] None of these
(Ans):-B