641. For loop in a C program, if the condition is missing?
A. it is assumed to be present and taken to be false
B. it is assumed to be present and taken to the true
C. it result in a syntax error
D. execution will be terminated abruptly

642. How many cases are there, which are used to compare various data structure’s execution time in a relative manner?
A. 2
B. 3
C. 4
D. 5

643. Which case of data structure operation takes maximum time?
A. Worst Case
B. Average Case
C. Best Case
D. None of the above

644. In Average case, if operation takes ƒ(n) time in execution, then m operations will take?
A. ƒ(n)
B. f(m)
C. mf(n)
D. nf(m)

645. __________ is a single elementary unit of information representing an attribute of an entity.
A. Entity Set
B. Record
C. File
D. Field

646. What is true about Interface in data structure?
A. Each data structure has an interface.
B. Interface represents the set of operations that a data structure supports.
C. An interface only provides the list of supported operations, type of parameters they can accept and return type of these operations.
D. All of the above

647. Which of the following is not a Characteristics of a Data Structure?
A. Completeness
B. Correctness
C. Time Complexity
D. Space Complexity

648. Which characteristics shows that running time or the execution time of operations of data structure must be as small as possible?
A. Completeness
B. Correctness
C. Time Complexity
D. Space Complexity

649. Data items that cannot be divided are called as?
A. Group Items
B. Attribute and Entity
C. Elementary Items
D. File items

650. Which of the following analysis known as theoretical analysis of an algorithm?
A. A Posterior Analysis
B. A Priori Analysis
C. A Feasibility Analysis
D. A Independent Analysis