1. Consider a set A = {1, 2, 3, …….., 1000}. How many members of A shall be divisible by 3 or by 5 or by both 3 and 5 ?
(A) 533
(B) 599
(C) 467
(D) 66
ANSWER: C
2. A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph ?
(A) 5
(B) n – 3
(C) 20
(D) 11
ANSWER: D
3. Consider the Graph shown below :
This graph is a __________.
(A) Complete Graph
(B) Bipartite Graph
(C) Hamiltonian Graph
(D) All of the above
ANSWER: C
4. A computer program selects an integer in the set {k : 1 ≤ k ≤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ?
(A) 0.5
(B) 0.704
(C) 0.632121
(D) 0.68
ANSWER: C
5. If we define the functions f, g and h that map R into R by :
f(x) =x 4 , g(x) =√ x 2 + 1 , h(x) =x 2 + 72, then the value of the composite functions ho(gof) and (hog)of are given as
(A) x 8 – 71 and x 8 – 71
(B) x 8 – 73 and x 8 – 73
(C) x 8 + 71 and x 8 + 71
(D) x 8 + 73 and x 8+ 73
ANSWER: D
6. The BCD adder to add two decimal digits needs minimum of
(A) 6 full adders and 2 half adders
(B) 5 full adders and 3 half adders
(C) 4 full adders and 3 half adders
(D) 5 full adders and 2 half adders
ANSWER: D
7. The Excess-3 decimal code is a self-complementing code because
(A) The binary sum of a code and its 9’s complement is equal to 9.
(B) It is a weighted code.
(C) Complement can be generated by inverting each bit pattern.
(D) The binary sum of a code and its 10’s complement is equal to 9.
ANSWER: C
8. How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation in a stack machine (A * B) + (C * D/E) ?
(A) 4 PUSH and 3 POP instructions
(B) 5 PUSH and 4 POP instructions
(C) 6 PUSH and 2 POP instructions
(D) 5 PUSH and 3 POP instructions
ANSWER: B
9. The range of representable normalized numbers in the floating point binary fractional representation in a 32-bit word with 1-bit sign, 8-bit excess 128 biased exponent and 23-bit mantissa is
(A) 2 -128 to (1 – 2 -23) × 2 127
(B) (1 – 2 -23) × 2 127 to 2 128
(C) (1 – 2 -23) × 2 -127 to 2 23
(D) 2 -129 to (1 – 2 -23) × 2 127
ANSWER: D
10. The size of the ROM required to build an 8-bit adder/ subtractor with mode control, carry input, carry output and two’s complement overflow output is given as
(A) 216 × 8
(B) 218 × 10
(C) 216 × 10
(D) 218 × 8
ANSWER: B
11. What will be the output of the following ‘C’ code ?main ( ) { int x = 128; printf (“\n%d”, 1 + x ++);}
(A) 128
(B) 129
(C) 130
(D) 131
ANSWER: B
12. What does the following expression means ? char *(*(* a[N]) ( )) ( );
(A) a pointer to a function returning array of n pointers to function returning character pointers.
(B) a function return array of N pointers to functions returning pointers to characters
(C) an array of n pointers to function returning pointers to characters
(D) an array of n pointers to function returning pointers to functions returning pointers to characters.
ANSWER: D
13. Which of the following is not a member of class ?
(A) Static function
(B) Friend function
(C) Const function
(D) Virtual function
ANSWER: B
14. When an array is passed as parameter to a function, which of the following statements is correct ?
(A) The function can change values in the original array.
(B) In C, parameters are passed by value, the function cannot change the original value in the array.
(C) It results in compilation error when the function tries to access the elements in the array.
(D) Results in a run time error when the function tries to access the elements in the array
ANSWER: A
15. Which of the following differentiates between overloaded functions and overridden functions ?
(A) Overloading is a dynamic or runtime binding and overridden is a static or compile time binding.
(B) Overloading is a static or compile time binding and overriding is dynamic or runtime binding.
(C) Redefining a function in a friend class is called overloading, while redefining a function in a derived class is called as overridden function.
(D) Redefining a function in a derived class is called function overloading, while redefining a function in a friend class is called function overriding.
ANSWER: B
16. Division operation is ideally suited to handle queries of the type :
(A) customers who have no account in any of the branches in Delhi.
(B) customers who have an account at all branches in Delhi.
(C) customers who have an account in atleast one branch in Delhi.
(D) customers who have only joint account in any one branch in Delhi
ANSWER: B
17. Which of the following is true ?
I. Implementation of self-join is possible in SQL with table alias.
II. Outer-join operation is basic operation in relational algebra.
III. Natural join and outer join operations are equivalent.
(A) I and II are correct.
(B) II and III are correct.
(C) Only III is correct.
(D) Only I is correct.
ANSWER: D
18. What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ?
(A) Generalization
(B) Aggregation
(C) Specialization
(D) Adding suitable attributes
ANSWER: D
19. The best normal form of relation scheme R(A, B, C, D) along with the set of functional dependencies
F = {AB → C, AB → D, C → A, D → B} is
(A) Boyce-Codd Normal form
(B) Third Normal form
(C) Second Normal form
(D) First Normal form
ANSWER: C
20. Identify the minimal key for relational scheme R(A, B, C, D, E) with functional dependencies
F = {A → B, B → C, AC → D}
(A) A
(B) AE
(C) BE
(D) CE
ANSWER: B
21. Convert the following infix expression into its equivalent post fix expression: (A + B^ D) / (E – F) + G
(A) ABD^ + EF – / G+
(B) ABD + ^EF – / G+
(C) ABD + ^EF / – G+
(D) ABD^ + EF / – G+
ANSWER: A
22. You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task ?
(A) Bubble sort
(B) Selection sort
(C) Quick sort
(D) Insertion sort
ANSWER: D
23. The directory can be viewed as ________ that translates filenames into their directory entries.
(A) Symbol table
(B) Partition
(C) Swap space
(D) Cache
ANSWER: A
24. Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage.
(A) 560
(B) 565
(C) 570
(D) 575
ANSWER: A
25. A full binary tree with n leaves contains
(A) n nodes
(B) log2 n nodes
(C) 2n –1 nodes
(D) 2 n nodes
ANSWER: C
26. The period of a signal is 10 ms. What is its frequency in Hertz ?
(A) 10
(B) 100
(C) 1000
(D) 10000
ANSWER: B
27. In a classful addressing, first four bits in Class A IP address is
(A) 1010
(B) 1100
(C) 1011
(D) 1110
ANSWER:
28. Which of the following algorithms is not a broadcast routing algorithm ?
(A) Flooding
(B) Multidestination routing
(C) Reverse path forwarding
(D) All of the above
ANSWER: D
29. An analog signal has a bit rate of 6000 bps and a baud rate of 2000 baud. How many data elements are carried by each signal element ?
(A) 0.336 bits/baud
(B) 3 bits/baud
(C) 120,00,000 bits/baud
(D) None of the above
ANSWER: B
30. How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ?
(A) 16
(B) 17
(C) 18
(D) 19
ANSWER: D
31. Shift-Reduce parsers perform the following :
(A) Shift step that advances in the input stream by K(K > 1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
(B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
(C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree.
(D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
ANSWER: B
32. Which of the following is true ?
(A) Canonical LR parser is LR (1) parser with single look ahead terminal
(B) All LR(K) parsers with K > 1 can be transformed into LR(1) parsers.
(C) Both (A) and (B)
(D) None of the above
ANSWER: C
33. In a two-pass assembler, symbol table is
(A) Generated in first pass
(B) Generated in second pass
(C) Not generated at all
(D) Generated and used only in second pass
ANSWER: A
34. Debugger is a program that
(A) allows to examine and modify the contents of registers
(B) does not allow execution of a segment of program
(C) allows to set breakpoints, execute a segment of program and display contents of register
(D) All of the above
ANSWER: C
35. The following Context-Free Grammar (CFG) :
S → aB | bA
A → a | as | bAA
B → b | bs | aBB
will generate
(A) odd numbers of a’s and odd numbers of b’s
(B) even numbers of a’s and even numbers of b’s
(C) equal numbers of a’s and b’s
(D) different numbers of a’s and b’s
ANSWER: C
36. Consider the following justifications for commonly using the two-level CPU scheduling :
I. It is used when memory is too small to hold all the ready processes.
II. Because its performance is same as that of the FIFO.
III. Because it facilitates putting some set of processes into memory and a choice is made from that.
IV. Because it does not allow to adjust the set of in-core processes.
Which of the following is true ?
(A) I, III and IV
(B) I and II
(C) III and IV
(D) I and III
ANSWER: D
37. A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ?
(A) 1135 K
(B) 335 K
(C) 1065 K
(D) 320 K
ANSWER: B
38. Which of the following conditions does not hold good for a solution to a critical section problem ?
(A) No assumptions may be made about speeds or the number of CPUs.
(B) No two processes may be simultaneously inside their critical sections.
(C) Processes running outside its critical section may block other processes.
(D) Processes do not wait forever to enter its critical section.
ANSWER: C
39. For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by
(A) x /2
(B) xz / 2
(C) √ 2xy
(D) √ xz / 2
ANSWER: C
40. In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70% of the time ?
(A) 11.6 m.sec.
(B) 16.4 m.sec.
(C) 28 m.sec.
(D) 14 m.sec.
ANSWER: B
41. __________ are applied throughout the software process.
(A) Framework activities
(B) Umbrella activities
(C) Planning activities
(D) Construction activities
ANSWER: B
42. Requirement Development, Organizational Process Focus, Organizational Training, Risk Management and Integrated Supplier Management are process areas required to achieve maturity level
(A) Performed
(B) Managed
(C) Defined
(D) Optimized
ANSWER: C
43. The software _________ of a program or a computing system is the structure or structures of the system, which comprise software components, the externally visible properties of those components, and the relationships among them.
(A) Design
(B) Architecture
(C) Process
(D) Requirement
ANSWER: B
44. Which one of the following set of attributes should not be encompassed by effective software metrics ?
(A) Simple and computable
(B) Consistent and objective
(C) Consistent in the use of units and dimensions
(D) Programming language dependent
ANSWER: D
45. Which one of the following is used to compute cyclomatic complexity ?
(A) The number of regions – 1
(B) E – N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes.
(C) P – 1, where P is the number of predicate nodes in the flow graph G.
(D) P + 1, where P is the number of predicate nodes in the flow graph G.
ANSWER: D
46. Consider the following statements S1 and S2 :
S1 : A hard handover is one in which the channel in the source cell is retained and used for a while in parallel with the channel in the target cell.
S2 : A soft handover is one in which the channel in the source cell is released and only then the channel in the target cell is engaged.
(A) S1 is true and S2 is not true.
(B) S1 is not true and S2 is true.
(C) Both S1 and S2 are true.
(D) Both S1 and S2 are not true.
ANSWER: D
47. Fact-less fact table in a data warehouse contains
(A) only measures
(B) only dimensions
(C) keys and measures
(D) only surrogate keys
ANSWER: D
48. Which e-business model allows consumers to name their own price for products and services ?
(A) B2 B
(B) B2 G
(C) C2 C
(D) C2 B
ANSWER: D
49. __________ model is designed to bring prices down by increasing the number of customers who buy a particular product at once.
(A) Economic Order Quantity
(B) Inventory
(C) Data Mining
(D) Demand-Sensitive Pricing
ANSWER: D
50. Match the following :
List – I List – II
a. Call control protocol i. Interface between Base Transceiver Station (BTS) and Base Station Controller (BSC)
b. A-bis ii. Spread spectrum
c. BSMAP iii. Connection management
d. CDMA iv. Works between Mobile Switching Centre (MSC) and Base Station Subsystem (BSS)
Codes :
a b c d
(A) iii iv i ii
(B) iii i iv ii
(C) i ii iii iv
(D) iv iii ii i
ANSWER: B
www.cbsenetportal.com
Post a Comment