computer science
Test Result Analysis
Wrong (25) Right (25) Undone(0) All Questions(50)
1. [Multiple Choice] Merging 4 sorted files containing 50, 10, 25 and 15 records will
take____time
( (1pt)
A. O (100)
B. O (200)
C. O (175)
D. O (125)
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
2. [Multiple Choice] Which data structure is used for implementing recursion? (1pt)
A. Queue.
B. Stack.
C. Arrays.
D. List.
Stu Answer Right Answer Candidate's
A B Score
0/1pt
Question analysis: No analysis
3. [Multiple Choice] 1. Inserting an item into the stack when stack is not full is called ………….
Operation and deletion of item from the stack, when stack is not empty is called ………..operation.
t (1pt)
A. push, pop
B.
pop, push
C.
insert, delete
D. delete, inser
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
4. [Multiple Choice] Linked list are not suitable data structure of which one of the following problems?
(1pt)
A. Insertion sort
B. Binary search
C. Radix sort
D. Polynomial manipulation
Stu Answer Right Answer
B B Candidate's
Score
1/1pt
Question analysis: No analysis
5. [Multiple Choice] The process of accessing data stored in a serial access memory is
similar to manipulating data on a (1pt)
A. heap
B. queue
C. stack
D. binary tree
Stu Answer Right Answer Candidate's
A C Score
0/1pt
Question analysis: No analysis
6. [Multiple Choice] A queue is a, (1pt)
A. FIFO (First In First Out) list.
B. LIFO (Last In First Out) list.
C. Ordered array.
D. Linear tree.
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
7. [Multiple Choice] The largest element of an array index is called its (1pt)
A. lower bound.
B. range.
C. upper bound.
D. All of these.
Stu Answer Right Answer Candidate's
C C Score
1/1pt
Question analysis: No analysis
8. [Multiple Choice] O(N) (linear time) is better than O(1) constant time. (1pt)
A. True
B. False
C. 3 & 3
D. 8 & 3
Stu Answer Right Answer Candidate's
B B Score
1/1pt
Question analysis: No analysis
9. [Multiple Choice] 1. Given two sorted lists of size m and n respectively. The number of comparisons
needed in the worst case by the merge sort algorithm will be?
(1pt)
A. mn
B.
max(m,n)
C. min(m,n)
D. m+n-
Stu Answer Right Answer Candidate's
D D Score
1/1pt
Question analysis: No analysis
10. [Multiple Choice] Consider a linked list of n elements. What is the time taken to
insert an element after an
element pointed by some pointer? (1pt)
A. O (1)
B. O (log2 n)
C. O (n)
D. O (n log2 n)
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
11. [Multiple Choice] 1. The postfix expression for * + a b - c d is?
(1pt)
A. ab + cd - *
B. ab cd + - *
C. ab + cd * -
D. ab + - cd *
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
12. [Multiple Choice] If a variable is a pointer to a structure, then which of the following operator is used
to access data members of the structure through the pointer variable? (1pt)
A. .
B. &
C. *
D. ->
Stu Answer Right Answer Candidate's
B D Score
0/1pt
Question analysis: No analysis
13. [Multiple Choice] 1. The initial configuration of the queue is a,b,c,d (a is the front end). To get the
configuration d,c,b,a one needs a minimum of ?
(1pt)
A. 2 deletions and 3 additions
B. 3 additions and 2 deletions
C. 3 deletions and 3 additions
D. 3 deletions and 4 additions
Stu Answer Right Answer Candidate's
A C Score
0/1pt
Question analysis: No analysis
14. [Multiple Choice] The complexity of multiplying two matrices of order m*n and n*p
is (1pt)
A. mnp
B. mp
C. mn
D. np
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
15. [Multiple Choice] What is the result of the following operation Top (Push (S, X))
(1pt)
A. X
B. null
C. S
D. None of these.
Stu Answer Right Answer Candidate's
C A Score
0/1pt
Question analysis: No analysis
16. [Multiple Choice] A linear list of elements in which deletion can be done from one
end (front) and insertion can take place only at the other end (rear) is known as a (1pt)
A. queue.
B. stack.
C. tree.
D. linked list.
Stu Answer Right Answer Candidate's
C A Score
0/1pt
Question analysis: No analysis
17. [Multiple Choice] The prefix form of A-B/ (C * D ^ E) is, (1pt)
A. -/*^ACBDE
B. -ABCD*^DE
C. -A/B*C^DE
D. -A/BC*^DE
Stu Answer Right Answer Candidate's
D C Score
0/1pt
Question analysis: No analysis
18. [Multiple Choice] The number of interchanges required to sort 5, 1, 6, 2 4 in
ascending order using Bubble Sort is (1pt)
A. 6
B. 5
C. 7
D. 8
Stu Answer Right Answer Candidate's
B B Score
1/1pt
Question analysis: No analysis
19. [Multiple Choice] Time complexities of three algorithms are given. Which should
execute the slowest for large
values of N? (1pt)
A. O(N1/2)
B. O(N)
C. ( O(log N)
D. None of these
Stu Answer Right Answer Candidate's
A B Score
0/1pt
Question analysis: No analysis
20. [Multiple Choice] You have to sort a list L consisting of a sorted list followed by a
few “random” elements. Which of the following sorting methods would be especially
suitable for such a task? (1pt)
A. Bubble sort
B. Selection sort
C. Quick sort
D. Insertion sort
Stu Answer Right Answer Candidate's
B D Score
0/1pt
Question analysis: No analysis
21. [Multiple Choice] The smallest element of an array’s index is called its (1pt)
A. lower bound.
B. upper bound.
C. range.
D. extraction
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
22. [Multiple Choice] In worst case Quick Sort has order (1pt)
A. O (n log n)
B. O (n2/2)
C. O (log n)
D. O (n2/4)
Stu Answer Right Answer Candidate's
C B Score
0/1pt
Question analysis: No analysis
23. [Multiple Choice] The operator used to get value at address stored in a pointer variable is (1pt)
A. *
B. &
C. &&
D. ||
Stu Answer Right Answer Candidate's
B B Score
1/1pt
Question analysis: No analysis
24. [Multiple Choice] The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3,
/, +, * is (1pt)
A. 600.
B. 350.
C. 650.
D. 588
Stu Answer Right Answer Candidate's
B B Score
1/1pt
Question analysis: No analysis
25. [Multiple Choice] 1. What would be the equivalent pointer expression for referring the array element
a[j][k][l] (1pt)
A. ((((a+i)+j)+k)+l)
B. *(*(*(*(a+i)+j)+k)+l)
C. (((a+i)+j)+k+l)
D. ((a+i)+j+k+l)
Stu Answer Right Answer Candidate's
B B Score
1/1pt
Question analysis: No analysis
26. [Multiple Choice] Which data structure is needed to convert infix notation to postfix
notation? (1pt)
A. Branch
B. Queue
C. Tree
D. Stack
Stu Answer Right Answer Candidate's
A D Score
0/1pt
Question analysis: No analysis
27. [Multiple Choice] In a circular linked list (1pt)
A. components are all linked together in some sequential manner.
B. there is no beginning and no end.
C. components are arranged hierarchically.
D. forward and backward traversal within the list is permitted
Stu Answer Right Answer Candidate's
B B Score
1/1pt
Question analysis: No analysis
28. [Multiple Choice] The data structure required to evaluate a postfix expression is
(1pt)
A. queue
B. stack
C. array
D. linked-list
Stu Answer Right Answer Candidate's
B B Score
1/1pt
Question analysis: No analysis
29. [Multiple Choice] What data structure would you mostly likely see in a nonrecursive
implementation of a recursive algorithm? (1pt)
A. Stack
B. Linked list
C. Queue
D. Trees
Stu Answer Right Answer Candidate's
B A Score
0/1pt
Question analysis: No analysis
30. [Multiple Choice] The extra key inserted at the end of the array is called a, (1pt)
A. End key.
B. Stop key.
C. Sentinel.
D. Transposition.
Stu Answer Right Answer Candidate's
C C Score
1/1pt
Question analysis: No analysis
31. [Multiple Choice] Let the following circular queue can accommodate maximum six
elements with the following data front = 2 rear = 4 queue = _______; L, M, N, ___, ___
What will happen after ADD O operation takes place? (1pt)
A. front = 2 rear = 5 queue = ______; L, M, N, O, ___
B. front = 3 rear = 5 queue = L, M, N, O, ___
C. front = 3 rear = 4 queue = ______; L, M, N, O, ___
D. front = 2 rear = 4 queue = L, M, N, O, ___
Stu Answer Right Answer Candidate's
B A Score
0/1pt
Question analysis: No analysis
32. [Multiple Choice] 1. When inorder traversing a tree resulted E A C K F H D B G; the preorder
traversal would return (1pt)
A. FAEKCDBHG
B. FAEKCDHGB
C. EAFKHDCBG
D. FEAKDCHBG
Stu Answer Right Answer Candidate's
D B Score
0/1pt
Question analysis: No analysis
33. [Multiple Choice] A pointer is (1pt)
A. A keyword used to create variables
B. A variable that stores address of an instruction
C. A variable that stores address of other variable
D. All of the above
Stu Answer Right Answer Candidate's
D C Score
0/1pt
Question analysis: No analysis
34. [Multiple Choice] 1. Given the following C++ statement, which of the following is true?
int A[4], B[3][3], *p,*t;
(1pt)
A. p = &A[0]; t = B;
B. p = A; t = B;
C. p = A; t = &B[0][0];
D. None of the above
Stu Answer Right Answer Candidate's
B C Score
0/1pt
Question analysis: No analysis
35. [Multiple Choice] 1. Which of the following algorithm design technique is used in the quick sort
algorithm?
(1pt)
A. Dynamic programming
B. Backtracking
C. Greedy method
D. Divide and conquer
Stu Answer Right Answer Candidate's
C C Score
1/1pt
Question analysis: No analysis
36. [Multiple Choice] The complexity of Binary search algorithm is (1pt)
A. O(n)
B. O(log )
C. O(n2)
D. O(n log n)
Stu Answer Right Answer Candidate's
A B Score
0/1pt
Question analysis: No analysis
37. [Multiple Choice] 1. “Make a pass across the data looking for the largest item, swap the largest with
the last item in the array” is the strategy of : (1pt)
A. Selection sorting
B. Bubble sorting
C. Quick sorting
D. Insertion sorting
Stu Answer Right Answer Candidate's
C A Score
0/1pt
Question analysis: No analysis
38. [Multiple Choice] The complexity of merge sort algorithm is (1pt)
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Stu Answer Right Answer Candidate's
C D Score
0/1pt
Question analysis: No analysis
39. [Multiple Choice] The postfix form of A*B+C/D is (1pt)
A. *AB/CD+
B. AB*CD/+
C. A*BC+/D
D. ABCD+/*
Stu Answer Right Answer Candidate's
B B Score
1/1pt
Question analysis: No analysis
40. [Multiple Choice] The complexity of Bubble sort algorithm is (1pt)
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Stu Answer Right Answer Candidate's
B C Score
0/1pt
Question analysis: No analysis
41. [Multiple Choice] The minimum number of multiplications and additions required
to evaluate the polynomial P = 4x3+3x2-15x+45 is (1pt)
A. 6 & 3
B. 4 & 2
C. 3 & 3
D. 8 & 3
Stu Answer Right Answer Candidate's
A C Score
0/1pt
Question analysis: No analysis
42. [Multiple Choice] 1. The average Big O notation of quick sort is----------
(1pt)
A. O(n2)
B. O(nlogn)
C. 3n+1
D. None
Stu Answer Right Answer Candidate's
B B Score
1/1pt
Question analysis: No analysis
43. [Multiple Choice] The complexity of linear search algorithm is (1pt)
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
44. [Multiple Choice] The equivalent prefix expression for the following infix expression
(A+B)-(C+D*E)/F*G is (1pt)
A. -+AB*/+C*DEFG
B. /-+AB*+C*DEFG
C. -/+AB*+CDE*FG
D. -+AB*/+CDE*FG
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
45. [Multiple Choice] What is the postfix form of the following prefix *+ab–cd (1pt)
A. ab+cd–*
B. abc+*–
C. ab+*cd–
D. ab+*cd–
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
46. [Multiple Choice] The number of possible ordered trees with three nodes A, B, C is? (1pt)
A. 16
B. 12
C. 6
D. 10
Stu Answer Right Answer Candidate's
A B Score
0/1pt
Question analysis: No analysis
47. [Multiple Choice] What is the postfix form of the following prefix expression -
A/B*C$DE (1pt)
A. ABCDE$*/-
B. A-BCDE$*/-
C. ABC$ED*/-
D. A-BCDE$*/
Stu Answer Right Answer Candidate's
B A Score
0/1pt
Question analysis: No analysis
48. [Multiple Choice] 1. The following sequence of operation is performed on stack :
push(1),push(2),pop, push(1),push(2),pop, pop, pop, push(2),pop. The sequence of popped out values are ?
(1pt)
A. 2,2,1,1,2
B. 2,2,1,2,2
C. 2,1,2,2,1
D. 2,1,2,2,2
Stu Answer Right Answer Candidate's
A A Score
1/1pt
Question analysis: No analysis
49. [Multiple Choice] The data structure required to check whether an expression
contains balanced parenthesis is (1pt)
A. Stack
B. Queue
C. Tree
D. Array
Stu Answer Right Answer Candidate's
D A Score
0/1pt
Question analysis: No analysis
50. [Multiple Choice] An algorithm is made up of two independent time complexities f
(n) and g (n). Then the
complexities of the algorithm is in the order of (1pt)
A. f(n) x g(n)
B. Max ( f(n),g(n))
C. Min (f(n),g(n))
D. f(n) + g(n)
Stu Answer Right Answer Candidate's
C B Score
0/1pt
Question analysis: No analysis