9.236 2009 with ans
-
Upload
anju-renjith -
Category
Technology
-
view
575 -
download
2
Transcript of 9.236 2009 with ans
236/2009
1. Worst case complexity of quick sort(A) O(n)(B) O( n log n)(C) O(n^2)(D) O(n^2 log n)
2. The data structure used in BFS algm(A) Queue(B) Stack(C) Heap(D) Hash table
3. Algorithm for External sorting(A) Bubble sort(B) Quick sort(C)Heap sort(D)Merge sort
4. Running time for push in stack (A) O(1)(B) O(log n)(C) O(n)(D) O(n log n)
5. The preorder traversal of a binary tree is CBADEF. The root is(A) F(B) A(C) C(D) B
6. the maximum degree of any node in a simple graph with n vertices is(A) n-1(B) n(C) n/2(D) n-2
7. Which has the best worst case complexity(A) Quick sort(B) Selection sort(C) Heap sort(D) Bubble sort
8. Non recursive implementation of recursive procedures are generally done using (A) Queues(B) Stacks(C) LL(D) Strings
9. the average time required to perform a successful sequential search for an element in an array A(1:n) is given by (A) n+1/2(B) n(n+1)/2(C) log n(D) n^2
10. Polish notation is (A) prefix
(B) infix(C) postfix(D) none
11. The parity bit is added to a message for(A) encryption(B) indexing(C) error detection(D) route control
12. what is the 2s complement representation of -5/8?(A) 0.1010(B) 1.0010(C) -0.1101(D) 1.0110
13. volatile(A) ROM(B) PROM(C) RWM(D) EPROM
14. The principle of locality of reference justifies the use of(A) interrupts(B) virtual memory(C) local hard disks(D)cache memory
15. A decimal number has 30 digits. Approximately how many bits would its binary representation have? (A) 60(B) 120 (C) 90(D)150
16. A computer with a 32bit word size uses 2s complement to represent numbers. The range of integers that can be represented . (A) -2^32 to 2^32(B) -2^31 to 2^32(C) -2^31 to 2^31 -1(D)-2^32 to 2^31
17. The hexadecimal equivalent of 111010 is(A) F2(B) 3A(C) 72(D) 310
18. Four 256*8 PROM chips are used to produce a total capacity of 1024*8. How many address bus lines are required?(A) 4(B)10(C)8(D)16
19. Access to moving head disks requires three periods od delay before information is brought into memory. The response that correctly lists the three time delays for the physical access of data in the order of their relative speeds from slowest to fastest is (A) latency time, cache overhead time, seek time
(B) cache overhead time, seek time, latency time(C) transmission time, latency time, seek time(D)seek time, latency time, transmission time
20. Snoopy protocols are (A) paging(B) segmentation(C) error detection(D)cache coherence
21. Not a parallel processing technique (A) SISD(B) SIMD(C) MIMD(D)MISD
22. The programmers interface to the hardware is (A) OS(B) Insn set(C) Compiler(D)Assembler
23. Transistor densities on a single chip would continue to double every 18 months. Which law? (A) Murphys law(B) Moores law(C) Amdahls law(D)Flynns law
24. Who invented mouse? (A) Douglas Engelbart(B) Ted Nelson(C) Vannevar Bush(D)Wolfgang Haken
25. The CPU of a computer system operates at a much higher rate than peripherals. How is the operating speed difference between the two reduced? (A) using interrupt line(B) using matching peripherals(C) with the help of buffer memory(D)using parallel i/o devices
26. Which NF allows transitive dependencies ?(A) 2NF(B) 3NF(C) BCNF(D)4NF
27. The post fix form of the expn A+(B-C)*(D+E) is (A) ABC-+DE+*(B) A+BC-DE+*(C) ABC-DE+*+(D)A+BC-DE*+
28. The language class accepted by finite automata (A) recursively enumerable(B) context sensitive(C) context free(D)regular
29. What kind of parsers will YACC generate? (A) LL(1)(B) LR(1)(C) LALR(1)(D)SLR(1)
30. Block structured language?(A) LISP(B) FORTRAN(C) C(D) Pascal
31. Consider the regular expression R={ab|abb}*bbab. Which is not in the set denoted by R? (A) ababab(B) abbbab(C) abbabbbab(D)ababbabbbab
32. Parser generator (A) YACC(B) LEX(C) TEX(D)EMACS
33. Which are examples of software development tools (A) ediotrs(B) debuggers(C) assemblers, compilers and interpreters(D) all
34. The compiler produce diagnostic messages identifying (A) syntactical errors(B) logic errors(C) both A and B(D)neither A nor B
35. The grammar G=({S},{0,1},P,S) where P={S->0S1, S->0S, S->S1, S->0} will generate a (A) context free language(B) context sensitive language(C) regular ,, (D) recursively enumerated ,,
36. Not a Cause for deadlock (A) circular wait(B) hold and wait(C) pre-emptive scheduling(D)mutual exclusion
37. Sempahore is(A) deadlock avoidance(B)process synchronization(C)IPC(D)Process creation
38. Unix system call for process creation(A) exec
(B) wait(C) fork(D) signal
39. In which area of programs memory ia activation records stored?(A)code (B) data(C)stack(D)heap
40. The operating system of a computer serves as a s/w interface between the user and(A)peripheral(B)hardware(C)memory(D)screen
41. Which is false?(A) Segmentation suffers from external fragmentation(B)Paging suffers from Internal fragmentation(C)Virtual memory is used in multi user systems(D)Segmented memory can be paged
42. The conditions that must be satisfied for two statements to be executed concurrently and still produce the same result(A)Hansens(B)Bernsteins(C)Dijkstras(D)Hoares
43. Compare a program and a process(A)Program is active and process is passive(B) both are passive(C) both are active(D) process is active and program is passive
44. The following is not a classical example of the process synchronization problem:(A)bounded buffer problem(B)readers/writers problem(C)monkey/banana problem(D)dining philosopher problem
45. The following statement is true for paging.(A)The maximum external fragmentation with paging is almost of the page size(B) The maximum internal fragmentation with paging is almost of the page size(C) The maximum external fragmentation with paging is half of the page size(D) The maximum internal fragmentation with paging is half of the page size
46. Which of the following might prevent a program being modified in the future:(A)logic errors(B)pseudo code(C)lack of program documentation(D)syntax errors
47. Which s/w life cycle model gives the customer the earliest opportunity for a working system (A)waterfall model(B)prototyping model(C)spiral model(D)incremental model
48. Alpha testing is(A)testing by the code developer at his/her site(B)testing by the customer at the code developers site(C)testing by the customer at his / her site(D)testing to satisfy the customer
49. Functional requirement of SRS (A)h/w(B)safety(C)risk containment(D)none
50. Which is false (A)Coding is just one of the aspect of s/w engineering(B)Software maintenance is easy(C)Software maintenance is very expensive(D) SRS often serves as the contract between the software developer and the customer
51. Computer graphics make it easier to prepare accurate and presentable charts of carious types. Which of the foll is a very popular chart for displaying how various parts contribute to a total (A)Bar chart(B)Pie chart(C)Composite bar chart(D)stacked bar chart
52. DIAL (A)Digital Interactive Animation Library(B)Diagrammatic Animation Language(C)Digital Innovative Animation Language(D)Diagrammatic Interactive Animation Language
53. Gouraud shading(A) colour interpolation shading(B)faceted shading(C)flat shading(D)polygon mesh shading
54. Z buffer algorithm(A)visible line algorithm(B)visible surface ,,(C)ray tracing ,,(D)line drawing ,,
55. PHIGS (A)Programmers Highly Interactive Graphics System(B) Programmers Higher Interactive Graphics System(C) Programmers Hypothetical Interactive Graphics System(D) Programmers Hierarchical Interactive Graphics System
56. not a GKS basic primitive(A)TEXT(B)POLYLINE(C)FILL AREA(D)POLYGON
57. This algorithm processes polygons as if they are painted onto the screen in the order of their distance from the viewer
(A)Painters algorithm(B)Ray tracing ,,(C)Visible surface ,,(D)Z-buffer ,,
58. Three dimensional viewing of an object need not require (A) projection plane(B)viewpoint(C)approximation(D)viewport
59. Which is true?(A)A quadric surface is defined by a second degree equation(B)Coons surface is useful for interpolating surface patches(C)Lofting is used where the surface to be constructed stretches in a given direction(D)Bezier B spline approximation provides for the global control of curve shape
60. Not true for LCD displays(A) operates between 0 and 70 degree celsius(B)work by polarizing ambient light(C)no viewing angle limitation(D)requires very little power to operate
61. Which is not true for databases (A)DDL specifies database updates(B)DML expresses database queries(C)ODBC is a Microsoft defined standard(D)The object relational data model combines features of object oriented data model and relational data model
62. Not true of SQL? (A)Dynamic SQL allows programs to construct and submit SQL queries at run time(B)Embedded SQL program must be processed by a special pre-processor before compilation(C)The semantics of SQL standard means that most databases do not ambiguity(D)The complexity and size of the SQL standard means that most databases do not implement the entire standard
63. Which is valid form for database (A)BCNF(B)CJNF(C)PJNF(D)DKNF
64. Which of the following take a number of values as input and return a single value as result (A)natural join(B)select(C)project(D)aggregate
65. The following is a pointer swizzling scheme which permits efficient dereferencing of persistent pointers (A)segmentation swizzling(B)page swizzling(C) Hardware swizzling(D)buffer swizzling
66. Aggregate operator(A)median(B)sum(C)average(D)max
67. one to many relationship(A)chain(B)tree(C)relational(D)n/w
68. Not objective of database normalisation(A)free relations from undesirable modification(B)reduce the need for restructuring the relations as new datatypes introduced(C)make it feasible to represent any relation in the database(D)improve the data integrity
69. which among the foll is not a logical database structure?(A)chain(B)tree(C)relational (D) network
70.Which is based on domain relational calculus?(A) SQL(B)QBE(C)QUEL(D)SEQUEL
71. IEEE 802.3(A) Ethernet(B) Token bus(C) Token ring(D) none
72. IP is (A) connection oriented datagram(B)connecion oriented VC(C)connectionless VC(D)connectionless datagram
73. Identify local multicasting protocol (A)IGMP(B)PIM(C)MOSPF(D)DVMRP
74. IP address 191.200.055.055 is in the class(A)class A(B)class B(C)class C(D)class D
75. port number of HTTP is(A)23(B) 25(C) 80(D) 90
76. The number of bits in MAC address(A) 32(B) 48(C) 64(D) 128
77. Which layer of IP stack provides congestion control(A) application(B) transport(C) network(D) datalink
78. TIA/EIA – 568 standard defines different grades of(A)Optical fibres(B)Coaxial cables(C)UTP cables(D)Flat cables
79. USB(A)Universal Sequence Buffer(B)Unified Serial Bus(C)Uniform Sequence Buffer(D)Universal Serial Bus
80. the technique avoids the need for downloading the entire multimedia file before beginning play out(A)Streaming(B)Buffering(C)Persistent HTTP(D)MPEG 2
81. Apache _____ is a Java servlet engine which provides programmers with access to the Java servlet API(A)JDBC(B)Java beans(C)Jscript(D)Jserv
82. The maximum number of hosts possible in an organization with the address 200.25.18.0/23 is (A)23(B)128(C)512(D)1024
83.IEEE 802.11(A)Wired LAN(B)Wireless LAN(C)MAN(D)WAN
84. The basic Ethernet design does not provide(A)Access control(B)Addressing(C)Automatic retransmission of message(D)Multiple virtual n/w
85. Which is a broad band communication channel
(A)coaxial cable(B)fibre optic cable(C)microwave circuits(D)all
86. Which does not TCP(A)HTTP(B)DNS(C)Telnet(D)SMTP
87. P2P file sharing application(A)Telnet(B)KaZaA(C)Gnutella(D)Napster
88. A network socket is(A)a connector in the physical layer(B)an interface between application process and TCP(C)interface between link layer and physical layer(D)interface between network layer and link layer
89. Routers are _____ layer devices(A)physical(B)datalink(C)network(D)transport
90. Identify the inter AS routing protocol from the following:(A)RIP(B)OSPF(C)IGRP(D)BGP
91. A partial order is(A)a set with more than half the members ascending protocol(B)a relation which is reflexive, antisymmetric, and transitive(C)a set with more than half the members descending (D)a relation which is reflexive, symmetric, transitive
92. Not true for an onto function(A) All the elements in the domain should have unique mapping(B)All the elements in the range are necessarily covered(C)All the elements in the range need not necessarily covered(D)More than one element can be mapped onto a single element
93. Self complementing graph(A) Petersen graph(B)Hexagon(C)Star of David(D)Pentagon
94. Not correct?(A) An euler graph can have odd number of vertices with odd degree(B)Testing the hamiltonicity of a graph may not be easy(C)testing the eulerian nature of a graph is easy(D)some graphs are both Hamiltonian and eulerian
95. For a graph , the eulers tetrahedron formula relates:(A) the sum of node degrees, diameter and number of edges(B) the number of vertices, diameter and number of edges(C) ) the number of vertices, sum of nodes and number of edges(D) ) the number of vertices, regions and number of edges
96. Single source shortest path algorithm(A) Dijkstra(B)Prim(C)Kruskal(D)Floyd-Warshall
97. A connected graph with n vertices is a tree if and only if it has(A) n edges(B) n-1 edges(C) n+1 edges(D) none
98. The computational complexity of Kruskals algorithm(A) O(n)(B)O(n^2)(C)O(n^3)(D)O(n log n)
99. Balancing a binary tree helps in(A) Making the tree as busy as possible(B) Reducing the searching and sorting time(C) Minimizing the efficiency of the search process(D) Reducing the program size
100. The number of nodes in a product graph G1=(V1,E1) and G2=(V2,E2) is given by(A) |V1|+|V2|(B) |V1|*|V2|(C) |V1|*|E2|+|V2|*|E1|(D) |V1|*|E2|+|V2|^2*|E1|