111. Which of the following accessibility modes can be the specifier of a top level class?
1. Private 2. Protected 3. Public 4. No modifier
A. only 3 B. only 44 C. Both 1 and 3 D. Both 2 and 3 E. Both 3 and 4
Solution: Answer will be Option A.
112. A language has 28 different letters in total. Each word in language is composed of maximum 7 letters .you want to create a data type to store a word of this language. You decide to store the word as an array of letters. How many bits will you assigns to the database to store all kind of word of language?
A. 7 B. 35 C. 28 D. 196
Solution: Answer will be Option B.
To represent 28 different letters we need 5 bits per each (2^5=32). Each word contains max letters 7. Hence number of bits=5*7=35.
113. Recursive function is executed in a ___________________________
A. Last in First Out Order B. First in First Out Order C. Parallel Fashion D. All of the above
Solution: Answer will be Option A.
114. Yukta created an interface to use it in different parts of the program by implementing it. But she forgot to specify the access specifier for each contained method. What will be the access specifier of the methods that will be inherited/implemented?
A. Public B. Private C. Protected D. An error will be generated
Solution: Answer will be Option A.
115. Which of the following statements are true?
1)An Arithmetic left shift multiplies a signed number by two
2)An Arithmetic right shift divides a signed number by two
3)Mask operation is an AND micro-operation and insert is an OR micro-operation
4)In a logical shift, the serial input to the shift is one
A. Both 1 and 2 B. Both 3 and 4 C. 1, 2 and 3 D. 2, 3 and 4
Solution: Answer will be Option C.
116. Choose the correct answer. A Queue is implemented by a linear array of size 10 (and not as a circularly connected array). Front and Rear are represented as an index in the array. To add an element, the rear index is incremented and the element is added. To delete an element, the front index is incremented. The following operations are done on an empty queue.
ADD 1; DELETE; ADD 2; ADD 3; ADD 4; DELETE, DELETE.
After this set of operations, what is the maximum capacity of the queue?
A. 6 B. 7 C. 10 D. None of these
Solution: Answer will be option B.
In queue initially the both Front and Rear assigned by the value -1 means the queue is empty. The size of the queue is 10 (array index no from 0 to 9).
ADD 1 it will increment both Front and Rear (in case of first element)
DELETE deletion of element set the Front and Rear to -1(queue is empty)
ADD 2 Front = 0 ,Rear = 0
ADD 3 Front = 0 ,Rear = 1
ADD 4 Front = 0 ,Rear = 2
DELETE Front = 1 ,Rear = 2
DELETE Front = 2 ,Rear = 2
Now the empty location in the queue is 7 so the maximum capacity of queue is 7 . In spite 2 location is empty in left side of the last element 4 but queue cannot access these location as the front on the location 2 this is the disadvantage of simple to queue to overcome this problem circular queue is implemented.
117. A tree has 5 levels and each has either 4 children or no children. All nodes on the same level have the same number of children. How many nodes are there in the tree? (Root is Level 1)
A. 341 B. 256 C. 1024 D. None of these
Solution: Answer will be option A. 1 + 4 + 16 + 64 + 256
118. A 8-bit signed integer has the following range?
A. 0 to 255 B. -128 to 127 C. -255 to 254 D. 0 to 509
Solution: Answer will be option B.
119. What will be the output of the following code statements?
integer x = 34. 54, y = 20, z =
print ( y > 50 AND z > 10 or x > 30 )
A. 0 B. 1 C. -1 D. 10
Solution: Answer will be option B.
120. Pankaj makes a program to print the product of cubes of the first 10 whole numbers
She writes the following program:
integer x = 0 // statement 1
integer sum = 0 // statement 2
while ( x < 10 ) // statement 3
{
sum = x*x*x // statement 4
x = x + 1 // statement 5
}
print sum // statement 6
Is her program correct? If not, which statement will you modify to correct it?
A. No error, the program is correct B. Statement 1 C. Statement 4 D. statement 6
Solution: Answer will be option C.
121. I have a problem to solve which takes as input a number n property that given the solution for (n
programming technique will I use to solve such a problem?
A. Iteration B. Decision-making C. Object Oriented Programming D. Recursion
Solution: Answer will be option B.
122. Here is an infix notation: ((A+B)*C-(D-E))^(F+G) Choose the correct postfix notation of the above from the given options?
A. AB+CD*E--FG+^ B. AB+C*DE--FG+^ C. AB+C*DE-FG-+^ D. A+BC*DE-FG-+^
Solution: Answer will be option B.
123. 123. If the depth of a tree is 3 levels, then what is the size of the Tree?
A. 2 B. 4 C. 6 D. 8
Solution: Answer will be option D.
124. One of the following options is a form of access used to add and remove nodes from a queue.
A. LIFO B. FIFO C. Both LIFO and FIFO D. None of these
Solution: Answer will be option C.
125. What is the time complexity of adding three matrices of size NXN cell-by-cell?
A. O (N) B. O (N^2) C. O (N^3) D. None of these
Solution: Answer will be option B.
126. Choose the correct answer. A sort which uses the binary tree concept such that any number in the tree is larger than all the numbers in the sub tree below it is called
A. Selection sort B. Insertion sort C. Heap sort D. Quick sort
Solution: Answer will be option C.
101. Which will be the input to second pass? If the list before starting the Radix sort is: 729, 150, 123, 931, 348, and 517?
A. 150,123,348,517,729,931 B. 150,931,123,517,348,729
C. 517,729,123,931,348,150 D. 123,150,348,517,729,931
102. Sorting is not possible by using which of the following methods?
A. Insertion B. Selection C. Exchange D. Deletion
Ans D
Ans D
103. Srujan writes a sorting algorithm. The algorithm takes different of time to sort two different list of equal size. What is the possible difference between two lists?
A. All numbers in one list are more than 100, while in the others are less than 100.
B. The ordering of numbers with respect to magnitude in two list has has different properties.
C. One list has all negative numbers, while others has all positive numbers.
D. One list contains 0 as an element, while the other does not.
104. Srishti writes a program to find an element in array A[5] with following elements In order 8 30 40 45 70.she runs the program to find number x. x is found in first Iteration of binary search. What is value of x?
A. 40 B. 8 C. 70 D. 30
105. Abhinav wants to find largest number in a given list of 20 numbers. Which of following is an efficient approach to do this?
A. Use bubble sort to sort the list in ascending order and Then print first number of series
B. Use selection sort to sort the list in descending order and Then printf first number of series
C. Implement on iteration of selection sort for descending order and printf first number in series
D. None of these.
106. Null function is also known as___________
A. Anonymous function B. Generic function C. void function D. Null operator
Ans D
Ans D
107. In breath first rule which of the following option is true?
A. Beginning from a node, first all its adjacent nodes are traversed.
B. Beginning from a node, each adjacent node is fully explored before traversing next adjacent node.
C. Beginning from a node, nodes are traversed in cyclical order.
D. None of these.
Ans B
Ans B
108. Which one of following is lowest level format to which computer converts a higher Language program before execution?
A. English code B. Machine code C. Assembly language D. System language
Ans B
Ans B
109. Choose the correct answer. Consider the statement
while (a < 10.0) {
a = a*a
}
Assuming a is positive, for what value of a will this code statement result in an infinite loop?
A. a < 1.0 B. a < sqrt (10) C. a > sqrt (10) D. a = 0
Solution: Answer will be Option A. Option 4 can’t be true as 0 is neither + ve, or –ve.
110. Choose the correct answer. Ankita takes as input 2 integer numbers, a and b, whose value can be between 0 and 31. He stores them as 5 bit numbers. He writes the following code to process these numbers to produce a third number c.
c = 2*(a - b)
In how many minimum bits should Ankita store c?
A. 6 bits B. 7 bits C. 8 bits D. 9 bits
Solution: Answer will be Option B.
c = 2*(a - b)
Lowest number will be generated when a=0 and b=31
c= 2*(0-31) = -64
Highest number will be generated when a=31 and b=0
c= 2*(31-0) = 64
range = -64 to 64
bits required = 7