1
The definitions in an XML document are said to be __________ when the tagging system and definitions in the DTD are all in compliance.
Answer: Option [A]
Questions
2
A graphic display system has a frame buffer that is 640 pixels wide, 480 pixels high and 1 bit of color depth. If the access time for each pixel on the average is 200 nanoseconds, then the refresh rate of this frame buffer is approximately :
Answer: Option [B]
3
Which one of the following is not typically provided by Source Code Management Software ?
Answer: Option [D]
4
A software system crashed 20 times in the year 2017 and for each crash, it took 2 minutes to restart. Approximately, what was the software availability in that year ?
Answer: Option [A]
5
A software design pattern often used to restrict access to an object is :
Answer: Option [B]
6
Which of the following is not a key strategy followed by the clean room approach to software development ?
Answer: Option [B]
7
The solution of the recurrence relation
T(m) T(3m 4) 1 = + is :
Answer: Option [B]
8
Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are _________ and _________ respectively. (Root is at level 0).
Answer: Option [B]
9
A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18 ?
Answer: Option [B]
10
Which of the following algorithms solves the single-source shortest paths ?
Answer: Option [B]
11
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding technique will have the average length of :
Answer: Option [A]
12
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves :
Answer: Option [B]
13
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number) :
Answer: Option [D]
14
A 5-ary tree is tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be :
Answer: Option [A]
15
Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is :
Answer: Option [B]
16
Two finite state machines are said to be equivalent if they :
Answer: Option [B]
17
A pushdown automata behaves like a Turing machine when the number of auxiliary memory is :
35. To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is : (1) 2n−1 (2) 2n (3) n+1 (4) n2
Answer: Option [B]
18
Pushdown automata can recognize language generated by_________.
Answer: Option [B]
19
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is :
Answer: Option [B]
20
Context sensitive language can be recognized by a :
Answer: Option [B]
