HURTLE’10

STUFF(QUIZ)

C
1.A type of data structure in which elements are added and removed from only one end is known as -----
a). Stack b). Queue c)Linked list
2.The ----- is the high level function and is used to return the current position of the character pointer in the given
file.
a). fseek() b). ftell() c). rewind()
3.The ----- function is used to check whether a given character belongs to a punctuation character or not.
a). isupper() b). isspace() c). ispunct()
4.----- is a variable which holds the memory address of an another variable.
a). pointer b). structure c). function
5.The ----- function is used to read an integer value from a given file.
a). putw() b). fgets() c).getw()

C++
6.The ----- function checks the file position indicator to determine if the end of the file associated with stream has
been reached.
a). feof () b). ferror() c). clearerr()
7.Containers are objects that hold data of -----
a). same type b). different type c). mixed type
8.The process of creating a specific class from a class template is called -----
a). instantiation b). virtualization c). templation
9.The ----- is used to destroy the objects that have been created by a constructor.
a). destructor b). delete c). construct
10.The smallest individual units in a program are known as ------
a). keywords b). identifiers c). tokens

JAVA
11.In Java ----- are mainly used for internet applications.
a). Applets b). Active Server Pages c). Java Beans
12. ------ are collections of related classes in Java.
a).functions b).union c).packages
13. ----- permits an array to store different elements that are of different classes.
a).class b).vector c). constructor
14.When the array index is out of range, then which exception is throwed?
a). ArrayStoreException b). ArrayIndexOutofBoundsException c).ArrayIndexOutvalueException
15.From the following packages, which one contains the JApplet class?
a). javax.swing b). java.applet c)java.util
 DATA STRUCTURES
16. ----- is a set of isolated tree or disjoint tree.
a). forest b). edge c). path
17.The node which is at the end and which does not have any child is called -----
a). degree b). leaf c). child
18. ------ is otherwise called as diminishing increment sort.
a). insertion sort b). merge sort c).shell sort
19.BFS stands for -----
a). Best Fast Search b). Breadth First Search c). Bit First Search
20. ----- is a tool to describe a procedure having several repletion operations of the same.
a). Iteration b). Recursion c). Priority

COMPUTER ALGORITHMS
21.The method of sorting using merging is called as -----
a). Merge Sort b). Divide and Conquer c). Quick Sort
22. ADT stands for-----
a).Abstract Data Transmission b).Abstract Division Type c).Abstract Data Type
23.----- Algorithm is used for minimum cost spanning trees.
a).Divide and Conquer b).Kruskal’s Algorithm c).Minimum Cost Algorithm
24.----- is a technique is used to implement a dictionary ADT.
a).Hashing b).Priority Queues c).Linear Program
25.The HeapSort Algorithm uses a data structure called -----
a).Heapsort b).Sort c).Heap

OPERATING SYSTEMS
26.The file system in UNIX is represented by -----
a).Single Level Tree b) Multi Level Tree c).Hierarchical Tree
27. A process is a program in -----
a).Action b).Execution c).Dead State
28. SCSI stands for -----
a).Small Computer Small Interface
b).Small Computer Standard Interface
c).Small Computing System Interface
29. A basic unit of the CPU utilization which consists of a program counter, a register set and a stack space is -----
a).Process b).Thread c).Semaphore
30.The basic synchronization tool is called -----
a).Semaphore b).Bounded Buffer c).Critical Section
 COMPUTER NETWORKS
31. In networks ATM stands for -----
a).Asynchronous Transfer Mode b).Automated Teller Mode c).Automatic Teller Machine
32. The arrangements in which a network application waits for contact from another application is known as the –
a).Cloud Computing b).Mobile Computing c).Client – Server Computing
33. OSI stands for -----
a).Open Systems Interconnected b).Operating Systems Information c).Operating Systems Interactivity
34.In which topology, each node is directly connected to only its two adjacent neighbours?
a).Bus Topology b).Ring Topology c).Mesh Topology.
35.----- is a form of distortion in networks.
a).Attenuation b).Broadband c).Cable Modem

DBMS
36.OLAP Stands for------
a).OnLine Address Processing b).OnLine Analytical Processing c).OpenLine Active Processing
37.In RDBMS, ----- is a set of all possible data values.
a).tuple b).Attribute c).Domain
38.Who is the author of the book “An Introduction to DataBase Systems” ?
a).H.F.Korth b).E.F.Codd c).C.J.Date
39.A ----- makes periodical backup copies of the database.
a). Checkpoint Facility b).Backup Mechanism c).Backup Transfers.
40.----- is a permission to access a named object in a prescribed manner.
a).Privilege b).Security c).Integrity

HARDWARE
41. A group of lines that serves as a connecting path for several devices is called a -----
a).Integrated Chips b).Bus c).Circuits
42.SDRAM stands for -----
a).Synchronous Dynamic RAM b).Synchronous Digital RAM c).Serial Data RAM
43.A small memory in the keyboard that is having standardized character code tables is known as -----
a).keyboard RAM b).keyboard chip c).keyboard ROM.
44. LCD Stands for -----
a).Liquid Crystal Displays b).Liquid Controller Displays c).Liquid Crystal Digital
45. ----- is the continuous strip of material which is used for recording data.
a).Tape b).Magnet c).Compact Disk
 HURTLE’10
STUFF(QUIZ)
Preliminary Test
Answer Sheet
Name of the Participants : 1.
2.
Name of the College :

1. (a) (b) (c) 24. (a) (b) (c)

2. (a) (b) (c) 25. (a) (b) (c)
3. (a) (b) (c) 26. (a) (b) (c)
4. (a) (b) (c) 27. (a) (b) (c)
5. (a) (b) (c) 28. (a) (b) (c)
6. (a) (b) (c) 29. (a) (b) (c)
7. (a) (b) (c) 30. (a) (b) (c)
8. (a) (b) (c) 31. (a) (b) (c)
9. (a) (b) (c) 32. (a) (b) (c)
10. (a) (b) (c) 33. (a) (b) (c)
11. (a) (b) (c) 34. (a) (b) (c)
12. (a) (b) (c) 35. (a) (b) (c)
13. (a) (b) (c) 36. (a) (b) (c)
14. (a) (b) (c) 37. (a) (b) (c)
15. (a) (b) (c) 38. (a) (b) (c)
16. (a) (b) (c) 39. (a) (b) (c)
17. (a) (b) (c) 40. (a) (b) (c)
18. (a) (b) (c) 41. (a) (b) (c)
19. (a) (b) (c) 42. (a) (b) (c)
20. (a) (b) (c) 43. (a) (b) (c)
21. (a) (b) (c) 44. (a) (b) (c)
22. (a) (b) (c) 45. (a) (b) (c)
23. (a) (b) (c)
MAIL YOUR QUIZ PRELIMS ANSWER TO
arulbenjaminchandru@gmail.com

FOR OUR QUIZ FINALS PLEASE VISIT

http://www.ziddu.com/download/8929150/HurtleQuizFinals.exe.html

PASSWORD TO OPEN THE HURTLE QUIZ FINALS

IS 9894481283