Tuesday, 6 February 2018

HSST Computer Science Junior Solved Paper 016/2018 - Part 2

21.       Strassen’s algorithm for multiplying n×n matrices runs in:
(A) O(n2) time
(B) O(n3) time
(C) O(2n) time
(D) O(n2.81) time
Answer: D
22.       The postfix representation of the expression (a+b*c)+((d*e+f)*g) is:
(A) abc*+de*f+g*+
(B) ab+c*de*f+g+*
(C) ab+c*de*f+g*+
(D) abc*+def*+g*+
Answer: A
23.       The worst case time complexity of merge sort is:
(A) O(n2)
(B) O(n log n)
(C) O(n3)
(D) O(2n)
Answer: B
24.       A set of n>=0 disjoint trees:
(A) Tree
(B) Forest
(C) B Tree
(D) All of the above
Answer: B
25.       Which of the following is a linear data structures?
(A) Array
(B) Linked list
(C) Both (A) and (B)
(D) None of the above
Answer: C
26.       The worst case time complexity of Quick sort is:
(A) O(n2)
(B) O(n log n)
(C) O(n3)
(D) O(2n)
Answer: A
27.       Which of the following data structure is frequently used to implement priority queue?
(A) Stack
(B) Heap
(C) Treap
(D) None of the above
Answer: B
28.       A list in which contain nodes of different types:
(A) Homogenous list
(B) Heterogeneous list
(C) Doubly linked list
(D) None of the above
Answer: B
29.       An ordered list in which insertion and deletion of nodes are made at one end?
(A) Deque
(B) Queue
(C) Stack
(D) None of the above
Answer: C
30.    A matrix whose most of the elements are zeroes:
(A) sparse matrix
(B) dense matrix
(C) square matrix
(D) none of the above
Answer: A
31.    Which of the following is a self balancing binary search tree?
(A) B– Tree
(B) AVL Tree
(C) B+ Tree
(D) None of the above
Answer: B
32.    A network with bandwidth of 10 Mbps can pass only an average of 12000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network?
(A) 22 Mbps
(B) 2 Mbps
(C) 10 Mbps
(D) 100 Mbps
Answer: B
33.    A system is using NRZ-l to transfer 10-Mbps data. What is the average signal rate?
(A) 500 Kbaud
(B) 1000 MHz
(C) 500 MHz
(D) 1000 Kbaud
Answer: A
34.    What is the minimum required bandwidth to send data at 1-Mbps rate using Manchester
(A) 10 MHz
(B) 2 MHz
(C) 5 MHz
(D) 1 MHz
Answer: D
35.    To send 3 bits data at a time at a bit rate of 3 Mbps with a carrier frequency of 10 MHz calculate the baud rate and bandwidth:
(A) 10 Mbaud and 10 MHz
(B) 2 Mbaud and 2 MHz
(C) 1 Mbaud and 8 MHz
(D) None of these
Answer: C
36.    Eight channels each with a 100-kHz bandwidth are to be multiplexed together. What is the minimum bandwidth of the link if there is a need for a guard band of 10 kHz between channels to prevent interference?
(A) 540 kHz
(B) 870 kHz
(C) 1020 kHz
(D) 1080 kHz
Answer: B
37.    The digital multiplexing technique for combining several low-rate channels into high-rate one:
(D) none of these
Answer: A
38.    RG-59 category cables are used for:
(A) Telephone
(C) Cable TV networks
(D) None of these
Answer: C
39.    The bit oriented protocol for communication over point to point and multipoint links is:
(B) Stop and wait protocol
Answer: A
40.    The service not provided by PPP is:
(A) network address configuration
(B) authentication
(C) flow control
(D) none of these
Answer: C

Pages   2   3   4   5 


Post a Comment