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
81. A full binary tree with n non-leaf nodes contains.
A. (log n) nodes B. n+1 nodes C. 2n+1 nodes D. 2n nodes
Ans C
82. Every element of a data structure has an address and a key associated with it. A search mechanism deals with two or more values assigned to the same address by using the key. What is this search mechanism?
A. Linear Search B. Binary Search C. Hash Coded Search D. None of these
Ans C
83. While calculating time complexity of an algorithm, the designer concerns himself/herself primarily with the run time and not the compile time why?
A. Runtime is always more than compile time B. Compile time is always more than run time
C. Compile time is a function of run time D. A program needs to be compiled once but can run several times.
Ans D
84. Shahana has a 10,000 line code. She is trying to debug it. She knows there is a logical error in the first 25 lines of the code. Which of the following options will be an efficient way of debugging?
A. Compile the whole code and step into it line by line B. Use an interpreter on the first 25 lines
C. Compile the whole code and run it D. None of these
Ans B
85. function main() {
integer i=0.7
static float m=0.7
if (m equals i)
print ”we are Equal”
else if( m>i )
print ”I am greater”
else
print ”I am lesser”
}
86. Sorting is not possible by using which of the following methods?
A. Insertion B. Selection C. Exchange D. Deletion
Ans D
A. Insertion B. Selection C. Exchange D. Deletion
Ans D
87. Consider an array on which bubble sort is used. The bubble sort would compare the element A[x] to which of the following elements in a single iteration?
A. A[x+1] B. A[x+2] C. A[x+2x] D. All of these
Ans D
A. A[x+1] B. A[x+2] C. A[x+2x] D. All of these
Ans D
88. In an implementation of a linked list, each node contains data and address. Which of the following could the address field possibly contain? Choose the correct answer?
A. Address of next node in sequence B. Its own address C. Address of last node D. Address of first node
Ans A
Ans A
89. A variable cannot be used. Choose the correct answer
A. Before it is declared B. After it is declared C. In the function it is declared in D. Can always be used
Ans A
Ans A
90. Shashi writes a program in c++ and passes it on to pankaj; pankaj does some indentation in some statements of the code. What will this lead to? Choose the correct answer?
A. Faster execution B. Lower memory requirement C. Correction of errors D. Better readability
Ans D
Ans D
91. Choose the correct answer?
Question: Consider the given declarations
Integer (*arr1)[10]
Integer *arr2[10]
Which of the following statements is true regarding the above?
A. Arr1 is pointer to an array of integers B. Arr2 is array of integer pointers
C. Arr1 and arr2 both are pointers to array of integers D. Arr1 and arr2 are arrays of integer pointers
E. Arr1 is array of integer pointers F. Arr2 is pointer to an array of integers
92.Himanshu wants to write a program to print the larger of the two inputted number. He writes the
Following code:
Int number1, number2
Input number1, number2
If(??) //statement 1
Print number1
Else
Print number2
End if
Fill in the?? in statement 1. Choose the correct answer
A. Number1 > number2 B. Number2 > number1 C. Number2 equals number1 D. Number1 <= number2
93.A derived class may inherit from the base which of the following? (Consider assumptions as in c++) Choose the correct answer?
A. Data members B. Member functions
C. Constructions and destructors D. Both data members and member functions.
94. Stuti is making a questionnaire of True-false questions. She wants to define a data-type which stores the response of the candidate for the question. What is the most-suited data type for this purpose? Choose the correct answer
A. Integer B. Boolean C. Float D. Character
95. Which of the following options is responsible for taking files and objects from different locations and combining them for execution?
A. Linker B. Loader C. Interconnecting compiler D. Interpreter
96. Shristi writes the code for a function that computes the factorial of the inputted number n.
function factorial (n)
{
if (n equals 1)
return 1
else
--MISSING STATEMENT---
end
}
Fill in the missing statement. Choose the correct answer?
A. Return factorial(n-1) B. Return n*factorial(n) C. return n*(n-1) D. return n*factorial(n-1)
97.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 Choose the correct answer
A. Selection sort B. Insertion sort C. Heap sort D. Quick sort
98.Shashi wants to make a program to print the sum of first 10 multiples of 5. She writes the following program, where statement 5 is missing;
Integer i=0
Integer sum=0
while(i<=50) {
sum=sum+1
--MISSING STATEMENT 5—
}
Print sum
Which of the following options will you use for statement 5? Choose the correct answer
A. l=5 B. I=5*I C. I=i+1 D. I=i+5
99.In which area of a class are data and function directly accessible outside the class? Choose the correct answer
A. Public B. Private C. Protected D. None of these
100. Every element of a data structure has an address and a key associated with it. A search mechanism deals eith teo or more values assigned to the same address y using the key. What is the search mechanism?
A. Linear search B. Binary search C. Hash coded search D. None of these
71. Afzal writes a piece of code, where a set of three lines occur around 10 times in different parts of the program. What programming concept can he use to shorten his program code length?
A. use for loops B. use functions C. use arrays D. use classes
Ans B
Ans B
73. Shravanthi writes the following program:
Integer i =0, j
while(I<2) {
j=0;
while(j<=3*I ) {
Print j
Print blank space
J=j+3
}
Print end-of-line //takes the cursor to the next line
i=i+1
}
What will be the output of the program?
A. 0 B. 0 3 C. 0 D. 0 3 6
0 3 0 3 6 0 3 6 0 3 6 9
0 3 6 9 0 3 6 9 12
74. A destructor may be invoked in which of the following situations?
A. when the object is created B. when the object is assigned value 0
C. only at the end of the code D. when the scope of the object is over
Ans D
Ans D
75. Consider the given statement for their correctness with respect to stacks data structure
1. Stacks follow a LIFO approach
2. Stacks are used to convert binary numbers to corresponding decimal numbers.
3. Stacks use two pointers for performing PUSH and POP respectively
A. TTF B. TTT C. TFF D.FTF
Ans D
Ans D
76. Integer a=40, b=35, c=20, d=10. Comment about the output of the following two statements:
Print a*b/c-d
Print a*b/(c-d)
Choose the correct answer? Assume the following prescedence (high to low).operates in the same row have the same precedence: (.) */ + - AND OR. For operates with equal precedence is from left-to-right in expression.
A. differ by 80 B. same C. differ by 50 D. differ by 160
Ans A
Ans A
77. Stack is useful for implementing.
A. Radix search B. Breadth first search C. Recursion D. None of these
Ans C
Ans C
78. Which of the following options gives the lower bound on running time for an algorithm?
A. Best case complexity of the algorithm B. Average case complexity of the algorithm
C. Worst case complexity of the algorithm D. Number of iterations taking place in the algorithm
Ans C
Ans C
79. A queue is implemented as a (single linked) linked-list. Each node has an element and pointer to another node. Rear and Front contain addresses of the rear and front node respectively. If the condition (rear is equal front) is true and neither is null, what do we infer about the linked list?
A. It has no elements B. It has one element C. There is an error D. None of these
Ans B
Ans B
80. Which of the following options describes a tree?
A. An unconnected graph B. A connected graph C. A connected acyclic graph D. A complete graph
Ans C
Ans C