UPPSC LT Grade Computer subject exam paper 29 July 2018 (Answer key)

51. What is the maximum number of characters (7 bits + parity) that can be transmitted in a second on a 19.2 kbps line? This asynchronous transmission requires 1 start bit and 1 stop bit.
(a) 192
(b) 240
(c) 1920
(d) 1966
Show AnswerAnswer -C

52. In which layer of network architecture, the secured socket layer (SSL) is used?
(a) Physical layer
(b) Session layer
(c) Application layer
(d) Presentation layer
Show AnswerAnswer -D

53. The address resolution protocol (ARP) is used for
(a) Finding the IP address from DNS
(b) Finding the IP address of the default gateway
(c) Finding the IP address that corresponds to a MAC address
(d) Finding the MAC address that corresponds to an IP address
Show AnswerAnswer -D

54. The number of cross points needed for 10 lines in a cross point switch, which is full duplex in nature and there is no self-connection, is
(a) 100
(b) 45
(c) 50
(d) 90
Show AnswerAnswer -B

55. In Huffman’s coding, if the symbol A has probability 0.3, B has probability 0.15, C has probability 0.1, D has probability 0.25 and E has probability 0.2, then the minimum number of bits required to represent all the symbols together is
(a) 14
(b) 11
(c) 12
(d) 15
Show AnswerAnswer -C

56. X.21 is
(a) A method of determining which device has access to the transmission medium at any time
(b) A method access control technique or multiple access transmission media
(c) Very common but oriented at linked protocol issued to ISO
(d) A network access standard for connecting stations to a circuit switch network
Show AnswerAnswer -D

57. Which type of support for TFTP is available from third parties, but is not included in Windows NT?
(a) As client
(b) As server
(c) Windows NT included full TFTP support
(d) None of the above
Show AnswerAnswer -B

58. Two main types of internet-based B2B commerce are
(a) Net marketplaces and private industrial networks
(b) EDI and collaborative commerce
(c) Net marketplaces and collaborative commerce
(d) EDI and private industrial networks
Show AnswerAnswer -D

59. The media access control sub layer resides in which OSI layer?
(a) Transport
(b) Network
(c) Physical
(d) Data link
Show AnswerAnswer -D

60. Which of the following is not a backtracking algorithm?
(a) Knight tour problem
(b) N-queen problem
(c) Towers of Hanoi
(d) M-coloring problem
Show AnswerAnswer -C

61. Which of the following is useful in traversing a given graph by breadth-first search (BFS)?
(a) Stack
(b) Set
(c) List
(d) Queue
Show AnswerAnswer -D

62. Which of the following algorithm design techniques is used in the quick sort algorithm?
(a) Dynamic programming
(b) Backtracking
(c) Divide and conquer
(d) Greedy method
Show AnswerAnswer -C

63. What is the output of the following code snippet?
#included<stdio.h>
#define var 3

void main ()
(
ahort num [3] [2] ={3, 6, 9, 12, 15, 18};
printf (“%d”,*(num+1)(1), **(num+2));
}
(a) 12 15
(b) 15 12
(c) 15 15
(d) 12 12
Show AnswerAnswer -C

64. For merging two sorted lists of sizes m and a into a sorted list of size m+n, how many comparisons are required?
(a) O(m)
(b) O(n)
(c) O(logm+logn)
(d) O(m+n)
Show AnswerAnswer -D

65. Which one the following is prefix representation of the infix expression
A*(B+C)/D?
(a) /*A+BCD
(b) A+B/CD
(c) +* AB/CD
(d) None of the above
Show AnswerAnswer -D

66. A B-tree is of order p and consists of n keys, Its maximum height is
(a) log_(p/2)(n+1)/2
(b) log _pn
(c) log _(p/2) (n+1)
(d) None of the above
Show AnswerAnswer -B

67. The following postfix expression with single -digit operands is evaluated using a stack:
823^/23*+51*-
[Note that ^is the exponentiation operator.] The top two elements the stack after the first * is evaluated, are
(a) 6, 1
(b) 5, 7
(c) 3, 2
(d) 1, 5
Show AnswerAnswer -A

68. A hash function defined as f(key) = key mod 7 with linear probing is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0 to 6 what will be the location of key 11?
(a) 3
(b) 4
(c) 5
(d) 6
Show AnswerAnswer -C

69. The concatenation of two lists is to be performed in 0(1) time. which of the following implementations of lists could be used?
(a) Singly linked list
(b) Doubly linked list
(c) Circular doubly linked list
(d) Array implementation of list
Show AnswerAnswer -C

70. Match List-I with List-II and select the correct answer using the codes given below the Lists :

List-I                                                          List-II
A. All-pairs shortest path                              Greedy
B. Quicksort                                                     Depth-first search
C. Minimum weight spanning tree             Dynamic
D. Connected components                           Divide and conquer
Codes:
.   A B C D
(a) 2 4 1 3
(b) 3 4 1 2
(c) 1 2 3 4
(d) 4 1 2 3
Show AnswerAnswer -B

Pages: 1 2 3 4 5 6