Friday, 17 February 2017

HSST Computer Science Solved Paper (SR For SC/ST) 86/2016/OL - Part 2

21.       What are units of width and height specified in HTML tag?
(A) Pixels
(B) Bytes
(C) Bits
(D) All of the above
Answer: A
22.       What will be the values of x, m and n after execution of the following statements?
int x, m, n;
m = 10;
n = 15;
x = ++m + n++;
(A) x = 25, m = 10, n = 15
(B) x = 27, m = 10, n = 15
(C) x = 26, m = 11, n = 16
(D) x = 27, m = 11, n = 16
Answer: C
23.       What will be the result of the expression 13 and 25?
(A) 38
(B) 9
(C) 25
(D) 12
Answer: B
24.       Which of the following will produce a value of 22 if x = 22.9?
(A) ceil(x)
(B) log(x)
(C) abs(x)
(D) floor(x)
Answer: D
25.       Which is the legal ways to access a class data member using this pointer?
(A) this.x
(B) *this.x
(C) *(this.x)
(D) (*this).x
Answer: D
26.       Which one of the following is an associative container?
(A) list
(B) queue
(C) map
(D) string
Answer: C
27.       Which one of the following is a sequence container?
(A) stack
(B) deque
(C) queue
(D) set
Answer: B
28.       What does the acronym BCPL stands for?
(A) Basic Combined Programming Language
(B) Basic Compiler Programming Language
(C) Beginners Combined Programming Language
(D) None of the above
Answer: A
29.       What was Ken Thompson's version of C called?
(A) C++
(B) B
(C) P
(D) None of the above
Answer: B
30.    What does the fopen() function return?
(A) address
(B) pointer
(C) file pointer
(D) all of the above
Answer: C

31.    Recursive algorithms are based on
(A) Divide and conquer approach
(B) Top-down approach
(C) Bottom-up approach
(D) Hierarchical approach
Answer: C
32.    The Sorting method which is used for external sort is
(A) Bubble sort
(B) Quick sort
(C) Merge sort
(D) Radix sort
Answer: C
33.    Worst case efficiency of binary search is
(A) log2 n+1
(B) n
(C) 2n
(D) log n
Answer: D
34.    What is the type of the algorithm used in solving the 8 Queens problem?
(A) Dynamic
(B) Backtracking
(C) Branch and Bound
(D) None of the above
Answer: B
35.    The time taken by NP-class sorting algorithm is
(A) O(1)
(B) O(log n)
(C) O(n2)
(D) O(n)
Answer: D
36.    How many nodes are there in a full state space tree with n = 6?
(A) 65
(B) 64
(C) 63
(D) 32
Answer: C
37.    Prims algorithm is based on ............. method.
(A) Divide and conquer method
(B) Greedy method
(C) Dynamic programming
(D) Branch and bound
Answer: B
38.    Graph Colouring is which type of algorithm design strategy
(A) Backtracking
(B) Greedy
(C) Branch and Bound
(D) Dynamic programming
Answer: A
39.    The asymptotic notation for defining the average time complexity is
(A) Equivalence
(B) Symmetric
(C) Reflexive
(D) All of the above
Answer: A
40.    The complexity of merge sort algorithm is
(A) O(n)
(B) O(n2)
(C) O(log n)
(D) O(n log n)
Answer: D

Pages   2   3   4   5 


Post a Comment