KDCSTL8X

1 
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16	If a datagram router goes down then …………..
17
18(A) all packets will suffer
19
20(B) only those packets which are queued in the router at that time will suffer
21
22(C) only those packets which are not queued in the router at that time will suffer
23
24(D) no packets will suffer Answer: B
25
26
27	In datagram subnet new route is chosen …………………
28
29	for every packet sent
30
31	for all the packet sent
32
33	only for the first packet
34
35	for the packet which is not transmitted
36
37
38Answer: A
39
40
41	The PSTN is an example of a ………………… network.
42
43(A) packet switched (B) circuit switched
44
45(C) message switched (D) None of these Answer: B
46
47
48	Each packet is routed independently in ……………….
49
50(A) virtual circuit subnet (B) short circuit subnet
51
52(C) datagram subnet (D) ATM subnet Answer: C
53
54
55	For a connection oriented service, we need a ……………
56
57(A) virtual circuit subnet (B) short circuit subnet
58
59(C) datagram subnet (D) wireless subnet Answer: C
60 
61
62
63
642 of 22	10/20/2016 12:04 PM
65 
66 
67
68
69	Which type of switching uses the entire capacity of a dedicated link?
70
71(A) circuit switching
72
73(B) datagram packet switching
74
75(C) virtual circuit packet switching
76
77(D) message switching Answer: D
78
79
80	In …………… circuit switching, delivery of data is delayed because data must be stored and retrieved from RAM.
81
82(A) space division (B) time division
83
84(C) virtual (D) None of these Answer: B
85
86
87	In ……………., each packet of a message need not follow the same path from sender to receiver.
88
89(A) circuit switching
90
91(B) message switching
92
93(C) virtual approach to packet switching
94
95(D) datagram approach to packet switching Answer: D
96
97
98	In ………………, each packet of a message follows the same path from sender to receiver.
99
100(A) circuit switching
101
102(B) message switching
103
104(C) virtual approach to packet switching
105
106(D) datagram approach to packet switching Answer: A
107
108
109	A permanent virtual circuit involves ……………..
110
111(A) Connection establishment (B) Data transfer
112
113(C) Connection release (D) Connection check Answer: B
114
115
1161. The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as
117
118……………..
119 
120
121
1223 of 22	10/20/2016 12:04 PM
123 
124100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
125 
126
127
128(A) Binary tree (B) Sparse tree
129
130(C) Sink tree (D) AVL tree Answer: C
131
132
133	Adaptive routing algorithms get their information from
134
135………….
136
137(A) only from local environment
138
139(B) only from adjacent routers
140
141(C) from locally, adjacent, external routers
142
143(D) only from external routers Answer: C
144
145
146	If the route from I to J is computed in advance, off line, and downloaded to the routers when the network is booted is called as ……………….
147
148(A) Dynamic routing (B) Session routing
149
150(C) Temporary routing (D) Static routing Answer: D
151
152
153	In Hierarchical routing for N router subnet, the optimal number of levels is …………..
154
155(A) logN (B) log(N -1)
156
157(C) lnN (D) ln(N-1) Answer: C
158
159
160	The router algorithm takes the decision to changes the route when ……………..
161
162(A) router changes
163
164(B) topology changes
165
166(C) user changes
167
168(D) transmission time does not change Answer: B
169
170
171	If route from router I to router J is computed on line based on the current statistics, then it is called as ………………..
172
173(A) Dynamic routing (B) Session routing
174
175(C) Temporary routing (D) None of these Answer: A
176 
177
178
1794 of 22	10/20/2016 12:04 PM
180 
181100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
182 
183
184
185	If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as……………..
186
187(A) Session routing (B) Circuit routing
188
189(C) Datagram routing (D) Forwarding Answer: A
190
191
192	…………….. change their routing decisions to reflect changes in the topology.
193
194(A) Nonadaptive algorithms
195
196(B) Adaptive algorithms
197
198(C) Static algorithms
199
200(D) Recursive algorithms Answer: B
201
202
203	If router J is on the optimal path from router I to router K, then the path from J to K along the same route is ………………
204
205(A) does not exist (B) optimal
206
207(C) maximum (D) constant Answer: B
208
209
210	If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route is known as ………………..
211
212(A) Routing principle (B) Optimality principle
213
214(C) Sink tree principle (D) Network principle Answer: B
215
216
217 ……………. do not base their routing decisions on measurements or estimates of the current traffic and topology.
218
219(A) Non adaptive algorithms
220
221(B) Adaptive algorithms
222
223(C) Static algorithms
224
225(D) Recursive algorithms Answer: A
226
227
228 The method of network routing where every possible path between transmitting and receiving DTE is used is called
229 
230
231
2325 of 22	10/20/2016 12:04 PM
233 
234100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
235 
236
237
238……………
239
240(A) Random Routing (B) Packet Flooding
241
242(C) Directory Routing (D) Message Switching
243
244Answer: B
245
246
247	In Hierarchical routing, the routers are divided into what is called as ……………..
248
249(A) zones (B) Cells
250
251(C) Regions (D) None of these Answer: C
252
253
254	The regions in Hierarchical routing are grouped in to
255
256……………..
257
258(A) Clusters (B) Zones
259
260(C) Blocks (D) Cells Answer: A
261
262
263	The Clusters in Hierarchical routing are grouped in to
264
265………………
266
267(A) Clusters (B) Zones
268
269(C) Blocks (D) Cells Answer: B
270
271
272	If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as ……………..
273
274(A) Random flooding (B) Static flooding
275
276(C) Selective flooding (D) Early flooding Answer: C
277
278
279	In shortest path routing algorithm, the path length is measured based on ……………..
280
281(A) time delay (B) number of hops
282
283(C) size of the routers (D) routing table Answer: B
284
285
286	Flooding always choose the ………………..
287
288(A) Shortest path (B) First path
289 
290
291
2926 of 22	10/20/2016 12:04 PM
293 
294100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
295 
296
297
298(C) Last path (D) Largest path Answer: A
299
300
301	In military applications where large number of routers may be blown to bits at any instant, we use ……………….
302
303(A) Shortest path first (B) First come first serve
304
305(C) Forwarding (D) Flooding Answer: D
306
307
308	In distributed applications, it is sometimes necessary to update all the databases concurrently, we use …………………..
309
310(A) Shortest path first
311
312(B) First come first serve
313
314(C) Forwarding
315
316(D) Flooding Answer: D
317
318
319	In multicast routing with spanning tree method, a network with n groups, each with an average of m members, for each group we require ………………..
320
321(A) n pruned spanning trees must be stored for a total of mn trees
322
323(B) m pruned spanning trees must be stored for a total of m trees
324
325(C) n pruned spanning trees must be stored for a total of n trees
326
327(D) m pruned spanning trees must be stored for a total of mn trees
328
329Answer: D
330
331
332	To do multicast routing, each router computes a
333
334…………………
335
336(A) Binary tree (B) AVL tree
337
338(C) Spanning tree (D) None of these Answer: C
339
340
341	A well -defined groups that are numerically large in size but small compared to the network as a whole are used in
342 
343
344
3457 of 22	10/20/2016 12:04 PM
346 
347100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
348 
349
350
351…………………..
352
353(A) Unicast routing (B) Multicast routing
354
355(C) Broadcast routing (D) Telecast routing Answer: B
356
357
358	The processes that keep track of hosts whose home is in the area, but who currently visiting another area is ……………..
359
360(A) Home agent (B) Mobile agent
361
362(C) Foreign agent (D) User agent Answer: A
363
364
365	In ………………. to send a multicast message a host sends it to the core, which then does the multicast along the spanning tree.
366
367(A) Core based Trees (B) AVL trees
368
369(C) Binary trees (D) Sparse trees Answer: A
370
371
372	Sending a packet to all destinations simultaneously is called
373
374……………….
375
376(A) Multicasting (B) Unicasting
377
378(C) Telecasting (D) Broadcasting Answer: D
379
380
381	A normal Flooding technique is an example of ………………
382
383(A) Multicasting (B) Unicasting
384
385(C) Telecasting (D) Broadcasting Answer: D
386
387
388	In Broadcast routing, if the router does not know anything all about spanning tree, ………………. method is preferred.
389
390(A) Reverse Path forwarding (B) Multidestination
391
392(C) Flooding (D) spanning tree Answer: A
393
394
395	The method of Broadcast routing in which each packet contains either a list of destinations or a bit map indicating the desired destinations is ……………….
396 
397
398
3998 of 22	10/20/2016 12:04 PM
400 
401100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
402 
403
404
405(A) Reverse Path forwarding (B) Spanning tree
406
407(C) Multidestination (D) Flooding
408
409Answer: C
410
411
41210. Sending a message to a well defined group that are numerically large in size but small compared to the network as a whole is called ……………….
413
414(A) Unicasting (B) Multicasting
415
416(C) Broadcasting (D) None of these Answer: B
417
418
419COMPUTER NETWORKS Interview Questions and
420
421Answers :-
422
423	In link state routing, after the construction of link state packets new routes are computed using …………………
424
425(A) Bellman Ford algorithm (B) DES algorithm
426
427(C) Dijkstra’s algorithm (D) Leaky bucket algorithm Answer: C
428
429
430	Count-to-Infinity problem occurs in …………………
431
432(A) distance vector routing (B) short path first
433
434(C) link state routing (D) hierarchical routing Answer: A
435
436
437	In distance vector routing algorithm, each router maintains a separate routing table with the following entries.
438
439(A) preferred input line , estimated time
440
441(B) preferred input line, estimated distance
442
443(C) preferred output line, estimated time
444
445(D) preferred output line, router Answer: C
446
447
448	Link state packets are built in ………………..
449
450(A) short path first (B) distance vector routing
451
452(C) link state routing (D) hierarchical routing Answer: B
453 
454
455
456
457
458
459
4609 of 22	10/20/2016 12:04 PM
461 
462100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
463 
464
465
466	In which routing method do all the routers have a common database?
467
468(A) Distance Vector (B) Link Vector
469
470(C) Shortest path (D) Link State Answer: D
471
472
473	In distance vector routing algorithm, the routing tables are updated …………………
474
475(A) by exchanging information with the neighbours
476
477(B) automatically
478
479(C) using the backup database
480
481(D) by the server Answer: A
482
483
484	Distance vector routing algorithm is implemented in Internet as ……………………
485
486(A) OSPF (B) RIP
487
488(C) ARP (D) APR Answer: B
489
490
491	Which of the following routing algorithm takes into account the current network load.
492
493(A) broadcast (B) shortest path
494
495(C) flooding (D) distance vector routing Answer: D
496
497
498	In distance vector routing the delay metric is ……………….
499
500(A) number of hops (B) geographical distance
501
502(C) number of neighbours (D) queue length Answer: D
503
504
505	In AODV routing algorithm for MANETs, the route is discovered at time
506
507(A) only when the network is established
508
509(B) in middle of the transmission
510
511(C) when there is a need for route by the host
512
513(D) when there is no need for route by the host Answer: C
514 
515
516
51710 of 22	10/20/2016 12:04 PM
518 
519100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
520 
521
522
523	Military vehicles on a battlefield with no existing infrastructure will deploy …………… network.
524
525(A) MANET (B) Cell Network
526
527(C) LAN (D) Wi-Fi Answer: A
528
529
530	The network in which all the nodes are symmetric and there is no central control or hierarchy is ……………..
531
532(A) MANET (B) Client -Server Technology
533
534(C) Peer-to-Peer (D) None of these Answer: C
535
536
537	What is the type of network in which the topology change from time to time?
538
539(A) Wi-Fi (B) Cell Network
540
541(C) LAN (D) MANET Answer: D
542
543
544	The processes that keep track of all mobile hosts visiting the area is ……………..
545
546(A) Home agent (B) Mobile agent
547
548(C) Foreign agent (D) User agent Answer: C
549
550
551	The hosts which are basically stationary hosts who move from one fixed site to another from time to time but use the network only when they are physically connected to it are called
552
553…………….
554
555(A) Migratory hosts (B) Stationary hosts
556
557(C) Mobile hosts (D) Random hosts Answer: A
558
559
560	The hosts who compute on the run and want to maintain their connections as they move around ……………
561
562(A) Migratory hosts (B) Stationary hosts
563
564(C) Mobile hosts (D) Random hosts Answer: C
565 
566
567
568
569
57011 of 22	10/20/2016 12:04 PM
571 
572100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
573 
574
575
576	What is the type of network in which the routers themselves are mobile?
577
578(A) Wide Area Network (B) Mobile Ad hoc Network
579
580(C) Mobile Network (D) Local Area Network Answer: B
581
582
583	What is the routing algorithm used in MANETs?
584
585	Shortest Path First
586
587	Routing Information Protocol
588
589	Distance Vector Protocol
590
591	Ad hoc On -demand Distance Vector Protocol Answer: D
592
593
594	Why probe packets are transmitted in the network?
595
596(A) to know about the capacity of the channel
597
598(B) to count the number of host in the network
599
600(C) to know about efficiency of the routing algorithm
601
602(D) to know about the congestion Answer: D
603
604
605	If the source deduces the existence of congestion by making local observations, such as the time needed for acknowledgements to come back is called as ……………..
606
607(A) Explicit feedback algorithm (B) Implicit feedback algorithm
608
609(C) Explicit forward algorithm (D) Implicit forward algorithm Answer: B
610
611
612	Packet discard policy is implemented in ……………..
613
614(A) Physical layer (B) Data link layer
615
616(C) MAC layer (D) Network layer Answer: D
617
618
619	The solution to decrease the load on the network when congestion occurs is ……………..
620
621(A) splitting the traffic over multiple routes
622
623(B) increasing the transmission power
624
625(C) usage of spare routers
626
627(D) denying service to the users
628 
629
630
63112 of 22	10/20/2016 12:04 PM
632 
633100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
634 
635
636
637Answer: D
638
639
640	While booting the system the IP address is …………….
641
642(A) 1.1.1.1 (B) 1.1.0.0
643
644(C) 0.0.1.1 (D) 0.0.0.0 Answer: D
645
646
647	In open loop congestion control techniques, the decisions are based on the ……………
648
649(A) without regard to the current state of the network
650
651(B) with regard to the current state of the network
652
653(C) with regard to the choice of the host
654
655(D) without regard to the choice of the host Answer: A
656
657
658	In closed loop congestion control techniques, the decisions are based on the ……………..
659
660(A) concept of a feedback loop
661
662(B) concept of a forward loop
663
664(C) concept of current state of network
665
666(D) None of these Answer: A
667
668
6696. ..………..is used to validate the identity of the message sender to the recipient
670
671(A) Encryption (B) Decryption
672
673(C) Digital certificate (D) None of these Answer: C
674
675
676	When too many packets are present in the subnet, and performance degrades then it leads to ………………..
677
678(A) Ingestion (B) Congestion
679
680(C) Digestion (D) Diffusion Answer: B
681
682
683	What is it goal of congestion control?
684
685(A) making sure that subnet is not able to carry the offered traffic
686 
687
688
68913 of 22	10/20/2016 12:04 PM
690 
691100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
692 
693
694
695	making sure that subnet will allow more than the offered packets
696
697	making sure that subnet is able to carry the offered traffic
698
699	making sure that subnet will not allow any traffic Answer: C
700
701
702	The service of open loop congestion control technique is
703
704…………………..
705
706(A) monitor the system to detect when and where congestion occurs
707
708(B) when to accept new traffic
709
710(C) pass the information to places where action can be taken
711
712(D) adjusting the system to correct the problem Answer: B
713
714
715	In …………… case higher bandwidth can be achieved.
716
717(A) connectionless networks (B) connection oriented networks
718
719(C) virtual circuit networks (D) optical networks Answer: A
720
721
722	Time out determination policy is used in …………………..
723
724(A) network layer (B) data link layer
725
726(C) transport layer (D) application layer Answer: C
727
728
729	In transport layer, End to End delivery is the movement of data from ……………….
730
731(A) one station to the next station
732
733(B) one network to the other network
734
735(C) source to destination
736
737(D) one router to another router Answer: C
738
739
740	The service of closed loop congestion control technique is
741
742………………
743
744(A) when to accept new traffic
745
746(B) when to discard the packets
747
748(C) monitor the system to detect when and where congestion
749 
750
751
75214 of 22	10/20/2016 12:04 PM
753 
754100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
755 
756
757
758occurs
759
760(D) which packets to discard Answer: C
761
762
763	The solution to increase the capacity when congestion occurs is …………………
764
765(A) denying service to the users
766
767(B) degrading the service to the users
768
769(C) splitting traffic over multiple routes
770
771(D) rescheduled the demands of the users Answer: C
772
773
774	When routers are being inundated by packets that they cannot handle, they just throw them away is known as
775
776……………….
777
778(A) Jitter control (B) Random early detection
779
780(C) Choke packets (D) Load shedding Answer: D
781
782
783	Upon receipt of a bad segment, UDP …………..
784
785(A) It does flow control (B) It does error control
786
787(C) Retransmission (D) It does not do flow and error control Answer: D
788
789
790	When the source host receives the choke packet, then the source ………………
791
792(A) reduces the capacity of the line
793
794(B) reduces the line utilization factor
795
796(C) reduces the traffic generation
797
798(D) rate reduces the threshold value Answer: C
799
800
801	If the buffer fills and a packet segment is dropped, then dropping all the rest of the segments from that packet, since they will be useless anyway is called ………………..
802
803(A) Priority dropping (B) Tail dropping
804
805(C) Age based dropping (D) None of these Answer: B
806 
807
808
80915 of 22	10/20/2016 12:04 PM
810 
811100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
812 
813
814
815	Flow control policy is implemented in ………………….
816
817(A) network layer (B) transport layer
818
819(C) application layer (D) physical layer Answer: B
820
821
822	For applications such as audio and video streaming, the variation in the packet arrival times is called ……………..
823
824(A) Random early detection (B) Jitter
825
826(C) Delay difference (D) Load shedding Answer: B
827
828
829	Which of the following is required to communicate between two computers?
830
831(A) communications software
832
833(B) protocol
834
835(C) communication hardware
836
837(D) all of above including access to transmission medium Answer: D
838
839
840	Terminals are required for ……………..
841
842	real-time, batch processing & time-sharing
843
844	real time, time-sharing & distributed message processing
845
846	real time, distributed processing & manager inquiry
847
848	real-time, time sharing & message switching
849
850Answer: D
851
852
853	The first collision free protocol is ……………….
854
855(A) Binary countdown (B) Basic bitmap
856
857(C) Reservation protocol (D) SAP Answer: B
858
859
860	Sending of a IP packet from host 1 to host 2 where both are of same LAN but the packet is transferred through different intermediate LANs is called ………………
861
862(A) Tunnelling (B) Routing
863
864(C) Diverting (D) Forwarding Answer: A
865 
866
867
868
869
87016 of 22	10/20/2016 12:04 PM
871 
872100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
873 
874
875
876	LANs can be connected by a device called ……………..
877
878(A) Routers (B) Modems
879
880(C) Ethernet card (D) Bridges Answer: D
881
882
883	In ……………….. all frames are given to the computer, not to those addressed.
884
885(A) Promiscuous mode (B) Miscues mode
886
887(C) Normal mode (D) Special Mode Answer: A
888
889
890	……………… Algorithm is used in transparent bridges.
891
892(A) Forward Learning (B) Backward Learning
893
894(C) Reverse Backward Learning (D) Reverse Forward Learning
895
896Answer: B
897
898
8998. In ………………… each packet of a message need not follow the same path From sender to receiver.
900
901	Circuit switching
902
903	message switching
904
905	a virtual approach to packet switching
906
907	The datagram approach to packet switching Answer: D
908
909
91089. FDDI is an acronym for ……………
911
912(A) Fast data delivery interface (B) Fiber distributed data interface
913
914(C) Fiber distributed digital interface (D) fast distributed data interface
915
916Answer: B
917
918
919	……………….. bridge operates in promiscuous mode.
920
921(A) Transparent bridge (B) Selective flooding
922
923(C) Source Routing (D) Remote Bridges Answer: A
924
925
926	The address field of a frame in HDLC protocol contains the address of the ……………… station.
927 
928
929
93017 of 22	10/20/2016 12:04 PM
931 
932100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
933 
934
935
936(A) primary (B) secondary
937
938(C) tertiary (D) a station Answer: B
939
940
941	In ………………. transmission, the channel capacity is shared by both communicating devices at all times.
942
943(A) Simplex (B) half-duplex
944
945(C) full-duplex (D) automatic Answer: C
946
947
948	The DNS name space is divided into non overlapping
949
950………………….
951
952(A) regions (B) blocks
953
954(C) divisions (D) zones Answer: D
955
956
957	Source routing bridges in the same LANs must have
958
959…………… bridge Number.
960
961(A) Same (B) Different
962
963(C) Source (D) Destination Answer: B
964
965
966	Repeater function in the …………………. layer.
967
968(A) Physical (B) Data link
969
970(C) Network (D) None of these Answer: A
971
972
973	A repeater takes a weakened or corrupted signal and
974
975…………… it.
976
977(A) Amplifies (B) Regenerates
978
979(C) Resample (D) Reroute Answer: B
980
981
982	The PSTN is an example of …………….. network.
983
984(A) packet-switched (B) circuit-switched
985
986(C) message-switched (D) TSI Answer: B
987 
988
989
990
991
99218 of 22	10/20/2016 12:04 PM
993 
994100 TOP COMPUTER NETWORKS Multiple Choice Questions and Ans...	http://engineeringinterviewquestions.com/computer-networks-multiple-ch...
995 
996
997
998	In a time division switch, a ……………… governs the destination of a packet stored in RAM.
999
1000(A) TDM bus (B) cross bar
1001
1002(C) cross point (D) control unit Answer: D
1003
1004
1005	How many cross points are needed in a single stage switch with 40 inputs and 50 outputs.
1006
1007(A) 40 (B) 50
1008
1009(C) 90 (D) 2000 Answer: D
1010
1011
1012	The …………….. of A TSI controls the order of delivering of slot values that are stored in RAM.
1013
1014(A) cross bar (B) cross point
1015
1016(C) control unit (D) transceiver Answer: D
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026Posted in COMPUTER NETWORKS Questions and Answers Tagged Interview Questions and Answers pdf free Download-mcqs-objective type Engineering
1027
1028
1029100 TOP C++ Programming		100 TOP OPERATING
1030Multiple Choice Questions and		SYSTEMS Multiple Choice
1031Answers		Questions and Answers	
1032
1033
1034
103510 THOUGHTS ON “100 TOP COMPUTER
1036
1037NETWORKS MULTIPLE CHOICE QUESTIONS AND
1038
1039ANSWERS”
1040
1041
1042pangulurulakshman
1043
1044AUGUST 29, 2016 AT 9:52 AM
1045
1046very very nice questions
1047 
1048
1049
105019 of 22	10/20/2016 12:04 PM
1051 
1052200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1053 
1054
1055
1056Posted on November 16, 2015	by engineer	1
1057
1058Comment
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073	In Reverse Polish notation, expression A*B+C*D is written
1074
1075as
1076
1077(A) AB*CD*+ (B) A*BCD*+ (C) AB*CD+* (D) A*B*CD+ Ans: A
1078
1079	SIMD represents an organization that ______________.
1080
1081(A) refers to a computer system capable of processing several programs at the same
1082
1083time.
1084
1085(B) represents organization of single computer containing a control unit, processor
1086
1087unit and a memory unit.
1088
1089(C) includes many processing units under the supervision of a common control unit
1090
1091(D) none of the above. Ans: C
1092
1093	Floating point representation is used to store
1094
1095(A) Boolean values (B) whole numbers (C) real integers (D) integers
1096
1097Ans: C
1098
10994. Suppose that a bus has 16 data lines and requires 4 cycles of 250 nsecs each to
1100
1101transfer data. The bandwidth of this bus would be 2 Megabytes/sec. If the cycle time
1102
1103of the bus was reduced to 125 nsecs and the number of cycles required for transfer
1104
1105stayed the same what would the bandwidth of the bus?
1106
1107(A) 1 Megabyte/sec (B) 4 Megabytes/sec
1108
1109(C) 8 Megabytes/sec (D) 2 Megabytes/sec
1110 
1111
1112
1113
1114
11152 of 32	10/20/2016 11:59 AM
1116 
1117200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1118 
1119
1120
1121Ans: D
1122
11235. Assembly language
1124
1125	uses alphabetic codes in place of binary numbers used in machine language
1126
1127	is the easiest language to write programs
1128
1129	need not be translated into machine language
1130
1131	None of these
1132
1133Ans: A
1134
1135	In computers, subtraction is generally carried out by
1136
1137(A) 9’s complement (B) 10’s complement
1138
1139(C) 1’s complement (D) 2’s complement Ans: D
1140
1141	The amount of time required to read a block of data from a disk into memory is
1142
1143composed of seek time, rotational latency, and transfer time. Rotational latency
1144
1145refers to
1146
1147(A) the time its takes for the platter to make a full rotation
1148
1149(B) the time it takes for the read-write head to move into position over the
1150
1151appropriate track
1152
1153(C) the time it takes for the platter to rotate the correct sector under the head
1154
1155(D) none of the above Ans: A
1156
1157	What characteristic of RAM memory makes it not suitable for permanent storage?
1158
1159(A) too slow (B) unreliable (C) it is volatile (D) too bulky Ans: C
1160
1161	Computers use addressing mode techniques for
1162
1163_____________________.
1164
1165(A) giving programming versatility to the user by providing facilities as pointers to
1166
1167memory counters for loop control
1168
1169(B) to reduce no. of bits in the field of instruction
1170
1171(C) specifying rules for modifying or interpreting address field of the instruction
1172
1173(D) All the above
1174 
1175
1176
11773 of 32	10/20/2016 11:59 AM
1178 
1179200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1180 
1181
1182
1183Ans: D
1184
1185	The circuit used to store one bit of data is known as
1186
1187(A) Register (B) Encoder (C) Decoder (D) Flip Flop Ans: D
1188
1189	(2FAOC) 16 is equivalent to
1190
1191	(195 084) 10 (B) (001011111010 0000 1100) 2
1192
1193	Both (A) and (B) (D) None of these Ans: B
1194
119512. The average time required to reach a storage location in memory and obtain its
1196
1197contents is called the
1198
1199	seek time (B) turnaround time (C) access time (D) transfer time
1200
1201Ans: C
1202
120313. Which of the following is not a weighted code?
1204
1205	Decimal Number system (B) Excess 3-cod
1206
1207	Binary number System (D) None of these Ans: B
1208
120914. The idea of cache memory is based
1210
1211	on the property of locality of reference (B) on the heuristic 90-10 rule
1212
1213	on the fact that references generally tend to cluster (D) all of the above
1214
1215Ans: A
1216
121715. Which of the following is lowest in memory hierarchy?
1218
1219	Cache memory
1220
1221	Secondary memory
1222
1223	Registers
1224
1225	RAM
1226
1227	None of these
1228
1229Ans (B) Secondary memory
1230
1231	The addressing mode used in an instruction of the form ADD X Y, is
1232
1233(A) Absolute (B) indirect (C) index (D) none of these Ans: C
1234
1235	If memory access takes 20 ns with cache and 110 ns with out it, then the ratio (
1236
1237cache uses a 10 ns memory) is
1238 
1239
1240
12414 of 32	10/20/2016 11:59 AM
1242 
1243200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1244 
1245
1246
1247	93% (B) 90% (C) 88% (D) 87% Ans: B
1248
124918. In a memory-mapped I/O system, which of the following will not be there?
1250
1251	LDA (B) IN (C) ADD (D) OUT Ans: A
1252
125319. In a vectored interrupt.
1254
1255	the branch address is assigned to a fixed location in memory.
1256
1257	the interrupting source supplies the branch information to the processor through
1258
1259an interrupt vector.
1260
1261	the branch address is obtained from a register in the processor
1262
1263	none of the above
1264
1265Ans: B
1266
126720. Von Neumann architecture is
1268
1269(A) SISD (B) SIMD (C) MIMD (D) MISD
1270
1271Ans: A
1272
1273	The circuit used to store one bit of data is known as
1274
1275(A) Encoder (B) OR gate (C) Flip Flop (D) Decoder Ans: C
1276
1277	Cache memory acts between
1278
1279(A) CPU and RAM (B) RAM and ROM (C) CPU and Hard Disk
1280
1281(D) None of these Ans: A
1282
1283	Write Through technique is used in which memory for updating the data
1284
1285(A) Virtual memory (B) Main memory
1286
1287(C) Auxiliary memory (D) Cache memory Ans: D
1288
1289	Generally Dynamic RAM is used as main memory in a computer system as it
1290
1291(A) Consumes less power (B) has higher speed
1292
1293(C) has lower cell density (D) needs refreshing circuitary Ans: B
1294
1295	In signed-magnitude binary division, if the dividend is (11100) 2 and divisor is
1296 
1297
1298
12995 of 32	10/20/2016 11:59 AM
1300 
1301200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1302 
1303
1304
1305(10011) 2 then the result is
1306
1307(A) (00100) 2 (B) (10100) 2 (C) (11001) 2 (D) (01100) 2 Ans: B
1308
1309	Virtual memory consists of
1310
1311(A) Static RAM (B) Dynamic RAM
1312
1313(C) Magnetic memory (D) None of these Ans: A
1314
1315	In a program using subroutine call instruction, it is necessary
1316
1317(A) initialise program counter (B) Clear the accumulator
1318
1319(C) Reset the microprocessor (D) Clear the instruction register Ans: D
1320
1321	A Stack-organised Computer uses instruction of
1322
1323(A) Indirect addressing (B) Two-addressing (C) Zero addressing
1324
1325(D) Index addressing Ans: C
1326
132729. If the main memory is of 8K bytes and the cache memory is of 2K words. It uses
1328
1329associative mapping. Then each word of cache memory shall be
1330
1331(A) 11 bits (B) 21 bits (C) 16 bits (D) 20 bits Ans: C
1332
133330 A-Flip Flop can be converted into T-Flip Flop by using additional logic circuit
1334
1335(A) n TQD =• (B) T D = (C) D = T . Q n (D) n TQD =? Ans: D
1336
1337	Logic X-OR operation of (4ACO) H & (B53F) H results
1338
1339(A) AACB (B) 0000 (C) FFFF (D) ABCD Ans: C
1340
1341	When CPU is executing a Program that is part of the Operating System, it is said to
1342
1343be in (A) Interrupt mode (B) System mode (C) Half mode (D) Simplex mode
1344
1345Ans: B
1346
1347	An n-bit microprocessor has
1348
1349(A) n-bit program counter (B) n-bit address register
1350
1351(C) n-bit ALU (D) n-bit instruction register Ans: D
1352
135334. Cache memory works on the principle of
1354 
1355
1356
13576 of 32	10/20/2016 11:59 AM
1358 
1359200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1360 
1361
1362
1363(A) Locality of data (B) Locality of memory
1364
1365(C) Locality of reference (D) Locality of reference & memory Ans: C
1366
1367	The main memory in a Personal Computer (PC) is made of
1368
1369(A) cache memory. (B) static RAM
1370
1371(C) Dynamic Ram (D) both (A) and (B) . Ans: D
1372
1373	In computers, subtraction is carried out generally by
1374
1375(A) 1’s complement method (B) 2’s complement method
1376
1377(C) signed magnitude method (D) BCD subtraction method Ans: B
1378
137937. PSW is saved in stack when there is a
1380
1381(A) interrupt recognised (B) execution of RST instruction
1382
1383(C) Execution of CALL instruction (D) All of these Ans: A
1384
1385	The multiplicand register & multiplier register of a hardware circuit implementing
1386
1387booth’s algorithm have (11101) & (1100). The result shall be
1388
1389(A) (812) 10 (B) (-12) 10 (C) (12) 10 (D) (-812) 10 Ans: A
1390
1391	The circuit converting binary data in to decimal is
1392
1393(A) Encoder (B) Multiplexer (C) Decoder (D) Code converter Ans: D
1394
1395	A three input NOR gate gives logic high output only when
1396
1397(A) one input is high (B) one input is low
1398
1399(C) two input are low (D) all input are high Ans: D
1400
1401	n bits in operation code imply that there are
1402
1403___________ possible distinct operators (A) 2n (B) 2n (C) n/2 (D) n2 Ans: B
1404
1405	_________ register keeps tracks of the instructions stored in program stored in
1406
1407memory.
1408
1409(A) AR (Address Register) (B) XR (Index Register)
1410
1411(C) PC (Program Counter) (D) AC (Accumulator) Ans: C
1412
1413	Memory unit accessed by content is called
1414 
1415
1416
14177 of 32	10/20/2016 11:59 AM
1418 
1419200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1420 
1421
1422
1423	Read only memory (B) Programmable Memory
1424
1425	Virtual Memory (D) Associative Memory Ans: D
1426
142744. ‘Aging registers’ are
1428
1429	Counters which indicate how long ago their associated pages have been
1430
1431referenced.
1432
1433	Registers which keep track of when the program was last accessed.
1434
1435	Counters to keep track of last accessed instruction.
1436
1437	Counters to keep track of the latest data structures referred.
1438
1439Ans: A
1440
144145 The instruction ‘ORG O’ is a
1442
1443	Machine Instruction. (B) Pseudo instruction.
1444
1445	High level instruction. (D) Memory instruction. Ans: B
1446
144746 Translation from symbolic program into Binary is done in
1448
1449	Two passes. (B) Directly (C) Three passes. (D) Four passes. Ans: A
1450
145147 A floating point number that has a O in the MSB of mantissa is said to have
1452
1453	Overflow (B) Underflow (C) Important number (D) Undefined
1454
1455Ans: B
1456
145748 The BSA instruction is
1458
1459	Branch and store accumulator (B) Branch and save return address
1460
1461	Branch and shift address (D) Branch and show accumulator Ans: B
1462
146349 State whether True or False.
1464
1465(i) Arithmetic operations with fixed point numbers take longer time for execution as
1466
1467compared to with floating point numbers. Ans: True.
1468
1469(ii) An arithmetic shift left multiplies a signed binary number by 2.
1470
1471Ans: False.
1472 
1473
1474
14758 of 32	10/20/2016 11:59 AM
1476 
1477200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1478 
1479
1480
148150 Logic gates with a set of input and outputs is arrangement of
1482
1483(A) Combinational circuit (B) Logic circuit (C) Design circuits
1484
1485(D) Register
1486
1487Ans: A
1488
148951. MIMD stands for
1490
1491(A) Multiple instruction multiple data (B) Multiple instruction memory data
1492
1493(C) Memory instruction multiple data (D) Multiple information memory data
1494
1495Ans: A
1496
149752 A k-bit field can specify any one of
1498
1499(A) 3k registers (B) 2k registers
1500
1501(C) K2 registers (D) K3 registers Ans: B
1502
150353 The time interval between adjacent bits is called the
1504
1505(A) Word-time (B) Bit-time (C) Turn around time (D) Slice time Ans: B
1506
150754 A group of bits that tell the computer to perform a specific operation is known as
1508
1509(A) Instruction code (B) Micro-operation (C) Accumulator (D) Register
1510
1511Ans: A
1512
151355 The load instruction is mostly used to designate a transfer from memory to a
1514
1515processor register known as
1516
1517(A) Accumulator (B) Instruction Register
1518
1519(C) Program counter (D) Memory address Register Ans: A
1520
152156 The communication between the components in a microcomputer takes place via
1522
1523the address and
1524
1525(A) I/O bus (B) Data bus (C) Address bus (D) Control lines Ans: B
1526
152757 An instruction pipeline can be implemented by means of
1528
1529(A) LIFO buffer (B) FIFO buffer (C) Stack (D) None of the above
1530
1531Ans: B
1532 
1533
1534
15359 of 32	10/20/2016 11:59 AM
1536 
1537200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1538 
1539
1540
154158 Data input command is just the opposite of a
1542
1543	Test command (B) Control command (C) Data output (D) Data channel
1544
1545Ans: C
1546
154759 A microprogram sequencer
1548
1549	generates the address of next micro instruction to be executed.
1550
1551	generates the control signals to execute a microinstruction.
1552
1553	sequentially averages all microinstructions in the control memory.
1554
1555	enables the efficient handling of a micro program subroutine.
1556
1557Ans: A
1558
155960 . A binary digit is called a
1560
1561	Bit (B) Byte (C) Number (D) Character Ans: A
1562
156361 A flip-flop is a binary cell capable of storing information of
1564
1565	One bit (B) Byte (C) Zero bit (D) Eight bit Ans: A
1566
156762 The operation executed on data stored in registers is called
1568
1569	Macro-operation (B) Micro-operation
1570
1571	Bit-operation (D) Byte-operation Ans: B
1572
157363 MRI indicates
1574
1575	Memory Reference Information. (B) Memory Reference Instruction.
1576
1577	Memory Registers Instruction. (D) Memory Register information
1578
1579Ans: B
1580
158164 Self-contained sequence of instructions that performs a given computational task is
1582
1583called
1584
1585	Function (B) Procedure (C) Subroutine (D) Routine Ans: A
1586
158765 Microinstructions are stored in control memory groups, with each group specifying a
1588
1589	Routine (B) Subroutine (C) Vector (D) Address Ans: A
1590 
1591
1592
159310 of 32	10/20/2016 11:59 AM
1594 
1595200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1596 
1597
1598
159966 An interface that provides a method for transferring binary information between
1600
1601internal storage and external devices is called
1602
1603(A) I/O interface (B) Input interface (C) Output interface (D) I/O bus
1604
1605Ans: A
1606
160767 Status bit is also called
1608
1609(A) Binary bit (B) Flag bit (C) Signed bit (D) Unsigned bit Ans: B
1610
161168 An address in main memory is called
1612
1613(A) Physical address (B) Logical address (C) Memory address
1614
1615(D) Word address Ans: A
1616
161769 If the value V(x) of the target operand is contained in the address field itself, the
1618
1619addressing mode is
1620
1621(A) immediate. (B) direct. (C) indirect. (D) implied. Ans: B
1622
162370 can be represented in a signed magnitude format and in a 1’s complement format as
1624
1625(A) 111011 & 100100 (B) 100100 & 111011
1626
1627(C) 011011 & 100100 (D) 100100 & 011011 Ans: A
1628
162971 The instructions which copy information from one location to another either in the
1630
1631processor’s internal register set or in the external main memory are called
1632
1633(A) Data transfer instructions. (B) Program control instructions.
1634
1635(C) Input-output instructions. (D) Logical instructions. Ans: A
1636
163772 A device/circuit that goes through a predefined sequence of states upon the
1638
1639application of input pulses is called
1640
1641(A) register (B) flip-flop (C) transistor. (D) counter. Ans: D
1642
164373. The performance of cache memory is frequently measured in terms of a quantity
1644 
1645
1646
164711 of 32	10/20/2016 11:59 AM
1648 
1649200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1650 
1651
1652
1653called
1654
1655(A) Miss ratio. (B) Hit ratio. (C) Latency ratio. (D) Read ratio. Ans: C
1656
165774. The information available in a state table may be represented graphically in a
1658
1659(A) simple diagram. (B) state diagram. (C) complex diagram.
1660
1661(D) data flow diagram. Ans: B
1662
166375 Content of the program counter is added to the address part of the instruction in
1664
1665order to obtain the effective address is called.
1666
1667(A) relative address mode. (B) index addressing mode.
1668
1669(C) register mode. (D) implied mode. Ans: A
1670
167176 An interface that provides I/O transfer of data directly to and form the memory unit
1672
1673and peripheral is termed as
1674
1675(A) DDA. (B) Serial interface. (C) BR. (D) DMA. Ans: D
1676
167777 The 2s compliment form (Use 6 bit word) of the number 1010 is
1678
1679(A) 111100. (B) 110110. (C) 110111. (D) 1011. Ans: B
1680
168178 A register capable of shifting its binary information either to the right or the left is
1682
1683called a
1684
1685(A) parallel register. (B) serial register. (C) shift register. (D) storage register.
1686
1687Ans: C
1688
168979 What is the content of Stack Pointer (SP)?
1690
1691(A) Address of the current instruction (B) Address of the next instruction
1692
1693(C) Address of the top element of the stack (D) Size of the stack.
1694
1695Ans: C
1696
169780 Which of the following interrupt is non maskable
1698
1699(A) INTR. (B) RST 7.5. (C) RST 6.5. (D) TRAP. Ans: D
1700 
1701
1702
170312 of 32	10/20/2016 11:59 AM
1704 
1705200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1706 
1707
1708
170981 Which of the following is a main memory
1710
1711(A) Secondary memory. (B) Auxiliary memory.
1712
1713(C) Cache memory. (D) Virtual memory. Ans: C
1714
171582 Which of the following are not a machine instructions
1716
1717(A) MOV. (B) ORG. (C) END. (D) (B) & (C) . Ans: D
1718
171983 In Assembly language programming, minimum number of operands required for an
1720
1721instruction is/are
1722
1723(A) Zero. (B) One. (C) Two. (D) Both (B) & (C) . Ans: A
1724
172584 The maximum addressing capacity of a micro processor which uses 16 bit database &
1726
172732 bit address base is
1728
1729(A) 64 K. (B) 4 GB. (C) both (A) & (B) . (D) None of these. Ans: B
1730
173185 The memory unit that communicates directly with the CPU is called the
1732
1733(A) main memory (B) Secondary memory
1734
1735(C) shared memory (D) auxiliary memory. Ans: A
1736
173786 The average time required to reach a storage location in memory and obtain its
1738
1739contents is called
1740
1741(A) Latency time. (B) Access time.
1742
1743(C) Turnaround time. (D) Response time. Ans: B
1744
1745State True or False
1746
174787 A byte is a group of 16 bits. Ans: False
1748
174988 A nibble is a group of 16 bits. Ans: False
1750
175189 When a word is to be written in an associative memory, address has got to be
1752
1753given. Ans: False
1754
175590 When two equal numbers are subtracted, the result would
1756 
1757
1758
175913 of 32	10/20/2016 11:59 AM
1760 
1761200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1762 
1763
1764
1765be ______and not_________. Ans: +ZERO, -ZERO.
1766
176791 A ___________development system and an ______are essential tools for writing
1768
1769large assembly language programs. Ans: Microprocessor, assembler
1770
177192 In an operation performed by the ALU, carry bit is set to 1 if the end carry C 8 is
1772
1773________. It is cleared to 0 (zero) if the carry is ______
1774
1775_______. Ans: One, zero
1776
177793 A successive A/D converter is
1778
1779(A) a high-speed converter. (B) a low speed converter.
1780
1781(C) a medium speed converter. (D) none of these. Ans: C
1782
178394 When necessary, the results are transferred from the CPU to main memory by
1784
1785(A) I/O devices. (B) CPU. (C) shift registers. (D) none of these. Ans: C
1786
178796 A combinational logic circuit which sends data coming from a single source to two
1788
1789or more separate destinations is
1790
1791(A) Decoder. (B) Encoder. (C) Multiplexer. (D) Demultiplexer.
1792
1793Ans: D
1794
179597 In which addressing mode the operand is given explicitly in the instruction
1796
1797(A) Absolute. (B) Immediate . (C) Indirect. (D) Direct.
1798
1799Ans: B
1800
180198 A stack organized computer has
1802
1803(A) Three-address Instruction. (B) Two-address Instruction.
1804
1805(C) One-address Instruction. (D) Zero-address Instruction.
1806
1807Ans: D
1808
180999 A Program Counter contains a number 825 and address part of the instruction
1810
1811contains the number 24. The effective address in the relative address mode, when
1812
1813an instruction is read from the memory is
1814 
1815
1816
181714 of 32	10/20/2016 11:59 AM
1818 
1819200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1820 
1821
1822
1823	849. (B) 850. (C) 801. (D) 802. Ans: B
1824
1825102 A page fault
1826
1827	Occurs when there is an error in a specific page.
1828
1829	Occurs when a program accesses a page of main memory.
1830
1831	Occurs when a program accesses a page not currently in main memory.
1832
1833	Occurs when a program accesses a page belonging to another program.
1834
1835Ans: C
1836
1837103. The load instruction is mostly used to designate a transfer from memory to a
1838
1839processor register known as____.
1840
1841A. Accumulator B. Instruction Register
1842
1843C. Program counter D. Memory address Register Ans: A
1844
1845104. A group of bits that tell the computer to perform a specific operation is
1846
1847known as____.
1848
1849A. Instruction code B. Micro-operation C. Accumulator D. Register
1850
1851Ans: A
1852
1853105. The time interval between adjacent bits is called the_____.
1854
1855A. Word-time B. Bit-time
1856
1857C. Turn around time D. Slice time Ans: B
1858
1859106. A k-bit field can specify any one of_____. A. 3k registers B. 2k registers
1860
1861C. K2 registers D. K3 registers Ans: B
1862
1863107. MIMD stands for _____.
1864
1865A. Multiple instruction multiple data B. Multiple instruction memory data C. Memory instruction multiple data D. Multiple information memory data Ans: A
1866
1867108. Logic gates with a set of input and outputs is arrangement
1868 
1869
1870
187115 of 32	10/20/2016 11:59 AM
1872 
1873200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1874 
1875
1876
1877of______.
1878
1879	Computational circuit
1880
1881	Logic circuit
1882
1883	Design circuits
1884
1885	Register
1886
1887Ans: A
1888
1889	The average time required to reach a storage location in memory and obtain
1890
1891its contents is called_____.
1892
1893A. Latency time. B. Access time.
1894
1895C. Turnaround time. D. Response time. Ans: B
1896
1897	The BSA instruction is______.
1898
1899	Branch and store accumulator B. Branch and save return address
1900
1901	Branch and shift address D. Branch and show accumulator Ans: B
1902
1903111. A floating point number that has a O in the MSB of mantissa is said to
1904
1905have_____.
1906
1907	Overflow B. Underflow
1908
1909C. Important number D. Undefined
1910
1911Ans: B
1912
1913	Translation from symbolic program into Binary is done in_____.
1914
1915A. Two passes. B. Directly
1916
1917C. Three passes. D. Four passes. Ans: A
1918
1919	The instruction ‘ORG O’ is a______.
1920
1921	Machine Instruction. B. Pseudo instruction.
1922
1923	High level instruction. D. Memory instruction. Ans: B
1924
1925114. ‘Aging registers’ are _______.
1926
1927	Counters which indicate how long ago their associated pages have been
1928
1929referenced.
1930
1931	Registers which keep track of when the program was last accessed.
1932 
1933
1934
193516 of 32	10/20/2016 11:59 AM
1936 
1937200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1938 
1939
1940
1941	Counters to keep track of last accessed instruction.
1942
1943	Counters to keep track of the latest data structures referred. Ans: A
1944
1945115. Memory unit accessed by content is called______.
1946
1947	Read only memory B. Programmable Memory
1948
1949	Virtual Memory D. Associative Memory Ans: D
1950
1951116. _________ register keeps tracks of the instructions stored in program stored
1952
1953in memory.
1954
1955	AR (Address Register) B. XR (Index Register)
1956
1957	PC (Program Counter) D. AC (Accumulator) Ans: C
1958
1959117. n bits in operation code imply that there are
1960
1961___________ possible distinct operators.
1962
1963	2n B. 2n
1964
1965	n/2 D. n2 Ans: B
1966
1967118. A three input NOR gate gives logic high output only when_____.
1968
1969	one input is high B. one input is low
1970
1971	two input are low D. all input are high Ans: D
1972
1973119. The circuit converting binary data in to decimal is_____.
1974
1975	Encoder B. Multiplexer
1976
1977	Decoder D.Code converter Ans: D
1978
1979120. The multiplicand register & multiplier register of a hardware circuit
1980
1981implementing booth’s algorithm have (11101) & (1100). The result shall be ______.
1982
1983	(812)10 B. (-12)10
1984
1985	(12)10 D. (-812)10 Ans: A
1986
1987121. PSW is saved in stack when there is a _____.
1988
1989	interrupt recognized B. execution of RST instruction
1990
1991	Execution of CALL instruction D. All of these
1992 
1993
1994
199517 of 32	10/20/2016 11:59 AM
1996 
1997200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
1998 
1999
2000
2001Ans: A
2002
2003	In computers, subtraction is carried out generally by____. A. 1’s complement method B. 2’s complement method
2004
2005C. signed magnitude method D. BCD subtraction method Ans: B
2006
2007	The main memory in a Personal Computer (PC) is made of_____.
2008
2009A. cache memory. B. static RAM C. Dynamic Ram D. bothA.and (B). Ans: D
2010
2011	Cache memory works on the principle of_____.
2012
2013A. Locality of data B. Locality of memory
2014
2015C. Locality of reference D. Locality of reference & memory Ans: C
2016
2017125. An n-bit microprocessor has_____.
2018
2019	n-bit program counter B. n-bit address register
2020
2021	n-bit ALU D. n-bit instruction register Ans: D
2022
2023126. When CPU is executing a Program that is part of the Operating System, it is
2024
2025said to be in _____.
2026
2027	Interrupt mode B. System mode
2028
2029C. Half mode D. Simplex mode
2030
2031Ans: B
2032
2033	Logic X-OR operation of (4ACO)H& (B53F)H results
2034
2035_____.
2036
2037A. AACB B. 0000
2038
2039C. FFFF D. ABCD Ans: C
2040
2041	If the main memory is of 8K bytes and the cache memory is of 2K words. It
2042
2043uses associative mapping. Then each word of cache memory shall be_____.
2044
2045A. 11 bits B. 21 bits C. 16 bits D. 20 bits Ans: C
2046
2047	A Stack-organised Computer uses instruction of _____. A. Indirect addressing B. Two-addressing
2048 
2049
2050
205118 of 32	10/20/2016 11:59 AM
2052 
2053200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2054 
2055
2056
2057C. Zero addressing D. Index addressing
2058
2059Ans: C
2060
2061	In a program using subroutine call instruction, it is necessary______.
2062
2063A. initialize program counter B. Clear the accumulator
2064
2065C. Reset the microprocessor D. Clear the instruction register Ans: D
2066
2067	Virtual memory consists of _______.
2068
2069A. Static RAM B. Dynamic RAM
2070
2071C. Magnetic memory D. None of these
2072
2073Ans: A
2074
2075	In signed-magnitude binary division, if the dividend is (11100)2 and divisor is
2076
2077(10011)2 then the result is ______. A. (00100)2 B. (10100)2
2078
2079C. (11001)2 D. (01100)2 Ans: B
2080
2081	Generally Dynamic RAM is used as main memory in a computer system as
2082
2083it______.
2084
2085A. Consumes less power B. has higher speed
2086
2087C. has lower cell density D. needs refreshing circuitry Ans: B
2088
2089	Write Through technique is used in which memory for updating the data
2090
2091_____.
2092
2093A. Virtual memory B. Main memory C. Auxiliary memory D. Cache memory Ans: D
2094
2095	Cache memory acts between_______.
2096
2097A. CPU and RAM B. RAM and ROM C. CPU and Hard Disk D. None of these Ans: A
2098
2099136. The circuit used to store one bit of data is known as
2100
2101______.
2102
2103A. Encoder B. OR gate C. Flip Flop D. Decoder Ans: C
2104 
2105
2106
210719 of 32	10/20/2016 11:59 AM
2108 
2109200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2110 
2111
2112
2113	Von Neumann architecture is ______.
2114
2115A. SISD B. SIMD
2116
2117C. MIMD D. MISD Ans: A
2118
2119	In a vectored interrupt.
2120
2121	the branch address is assigned to a fixed location in memory.
2122
2123	the interrupting source supplies the branch information to the processor through
2124
2125an interrupt vector.
2126
2127	the branch address is obtained from a register in the processor
2128
2129	none of the above
2130
2131Ans: B
2132
2133139. . In a memory-mapped I/O system, which of the following will not be there?
2134
2135	LDA B. IN
2136
2137	ADD D. OUT Ans: A
2138
2139140. If memory access takes 20 ns with cache and 110 ns without it, then the ratio
2140
2141(cache uses a 10 ns memory) is _____.
2142
2143	93% B. 90%
2144
2145C. 88% D. 87%
2146
2147Ans: B
2148
2149	The addressing mode used in an instruction of the form ADD X Y, is _____.
2150
2151A. Absolute B. indirect C. index D. none of these Ans: C
2152
2153	_________ register keeps track of the instructions stored in program stored
2154
2155in memory.
2156
2157A. AR (Address Register) B. XR (Index Register) C. PC (Program Counter) D. AC (Accumulator) Ans: C
2158
2159	The idea of cache memory is based ______.
2160
2161A. on the property of locality of reference
2162 
2163
2164
216520 of 32	10/20/2016 11:59 AM
2166 
2167200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2168 
2169
2170
2171	on the heuristic 90-10 rule
2172
2173	on the fact that references generally tend to cluster
2174
2175	all of the above
2176
2177Ans: A
2178
2179	Which of the following is not a weighted code? A. Decimal Number system B. Excess 3-cod
2180
2181C. Binary number System D. None of these Ans: B
2182
2183	The average time required to reach a storage location in memory and obtain
2184
2185its contents is called the _____. A. seek time B. turnaround time C. access time D. transfer time Ans: C
2186
2187	(2FAOC)16 is equivalent to _____.
2188
2189	(195 084)10 B. (001011111010 0000 1100)2
2190
2191	Both A.and (B) D. None of these Ans: B
2192
2193147. The circuit used to store one bit of data is known as_______.
2194
2195	Register B. Encoder
2196
2197	Decoder D. Flip Flop Ans: D
2198
2199148. . Computers use addressing mode techniques for
2200
2201____________.
2202
2203	giving programming versatility to the user by providing facilities as pointers to
2204
2205memory counters for loop control
2206
2207	to reduce no. of bits in the field of instruction
2208
2209	specifying rules for modifying or interpreting address field of the instruction
2210
2211	All the above
2212
2213Ans: D
2214
2215149. What characteristic of RAM memory makes it not suitable for permanent
2216
2217storage?
2218
2219A. too slow B. unreliable C. it is volatile D. too bulky
2220 
2221
2222
222321 of 32	10/20/2016 11:59 AM
2224 
2225200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2226 
2227
2228
2229Ans: C
2230
2231150. The amount of time required to read a block of data from a disk into memory
2232
2233is composed of seek time, rotational latency, and transfer time. Rotational latency
2234
2235refers to ______.
2236
2237	the time its takes for the platter to make a full rotation
2238
2239	the time it takes for the read-write head to move into position over the
2240
2241appropriate track
2242
2243	the time it takes for the platter to rotate the correct sector under the head
2244
2245	none of the above
2246
2247Ans: A
2248
2249
2250Computer Organization and Architecture Multiple
2251
2252Choice Questions and Answers :-
2253
2254	In computers, subtraction is generally carried out by
2255
2256______.
2257
2258A. 9’s complement B. 10’s complement C. 1’s complement D. 2’s complement Ans: D
2259
2260	Assembly language ________.
2261
2262	uses alphabetic codes in place of binary numbers used in machine language
2263
2264	is the easiest language to write programs
2265
2266	need not be translated into machine language
2267
2268	None of these
2269
2270Ans: A
2271
2272153. Suppose that a bus has 16 data lines and requires 4 cycles of 250 nsecs each
2273
2274to transfer data. The bandwidth of this bus would be 2 Megabytes/sec. If the cycle
2275
2276time of the bus was reduced to 125 nsecs and the number of cycles required for
2277
2278transfer stayed the same what would the bandwidth of the bus? A. 1 Megabyte/sec B. 4 Megabytes/sec
2279 
2280
2281
2282
2283
228422 of 32	10/20/2016 11:59 AM
2285 
2286200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2287 
2288
2289
2290C. 8 Megabytes/sec D. 2 Megabytes/sec
2291
2292Ans: D
2293
2294	Floating point representation is used to store ______. A. Boolean values B. whole numbers
2295
2296C. real integers D. integers Ans: C
2297
2298	SIMD represents an organization that
2299
2300______________.
2301
2302a. refers to a computer system capable of processing several programs at the same
2303
2304time.
2305
2306b. represents organization of single computer containing a control unit, processor
2307
2308unit and a memory unit.
2309
2310c. includes many processing units under the supervision of a common control unit
2311
2312d. none of the above. Ans: C
2313
2314	In Reverse Polish notation, expression A*B+C*D is written
2315
2316as
2317
2318A. AB*CD*+ B. A*BCD*+ C. AB*CD+* D. A*B*CD+ Ans: A
2319
2320	Processors of all computers, whether micro, mini or mainframe must have
2321
2322a. ALU b. Primary Storage c. Control unit d. All of above Ans b
2323
2324	What is the control unit’s function in the CPU?
2325
2326	To transfer data to primary storage
2327
2328	to store program instruction
2329
2330	to perform logic operations
2331
2332	to decode program instruction Ans e
2333
2334159. What is meant by a dedicated computer?
2335
2336	which is used by one person only
2337
2338	which is assigned to one and only one task
2339
2340	which does one kind of software
2341 
2342
2343
234423 of 32	10/20/2016 11:59 AM
2345 
2346200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2347 
2348
2349
2350	which is meant for application software only Ans f
2351
2352160. The most common addressing techiniques employed by a CPU is
2353
2354	immediate b. direct
2355
2356	indirect d. register e. all of the above Ans d
2357
2358161. Pipeline implement
2359
2360	fetch instruction b. decode instruction
2361
2362	fetch operand d. calculate operand
2363
2364	execute instruction f. all of abve
2365
2366Ans d
2367
2368	Which of the following code is used in present day computing was developed
2369
2370by IBM corporation?
2371
2372a. ASCII b. Hollerith Code
2373
2374c. Baudot code d. EBCDIC code Ans d
2375
2376	When a subroutine is called, the address of the instruction following the CALL
2377
2378instructions stored in/on the a. stack pointer b. accumulator c. program counter d. stack Ans d
2379
2380	A microprogram written as string of 0’s and 1’s is a
2381
2382a. symbolic microinstruction b. binary microinstruction c. symbolic microprogram d. binary microprogram Ans d
2383
2384	Interrupts which are initiated by an instruction are a. internal b. external c. hardware d. software
2385
2386Ans b
2387
2388	Memory access in RISC architecture is limited to instructions
2389
2390a. CALL and RET b. PUSH and POP c. STA and LDA d. MOV and JMP Ans c
2391
2392	A collection of lines that connects several devices is called
2393
2394…………..
2395 
2396
2397
239824 of 32	10/20/2016 11:59 AM
2399 
2400200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2401 
2402
2403
2404A) bus B) peripheral connection wires
2405
2406C) Both a and b D) internal wires
2407
2408Ans A
2409
2410	A complete microcomputer system consist of ………..
2411
2412A) microprocessor B) memory
2413
2414C) peripheral equipment D) all of the above Ans D
2415
2416	PC Program Counter is also called ……………….
2417
2418A) instruction pointer B) memory pointer
2419
2420C) data counter D) file pointer
2421
2422Ans A
2423
2424	In a single byte how many bits will be there? A) 8 B) 16 C) 4 D) 32
2425
2426Ans A
2427
2428	CPU does not perform the operation ………………
2429
2430A) data transfer B) logic operation
2431
2432C) arithmetic operation D) all of the above Ans A
2433
2434	The access time of memory is …………… the time required for performing
2435
2436any single CPU operation.
2437
2438A) Longer thanB) Shorter than C) Negligible than D) Same as Ans A
2439
2440	Memory address refers to the successive memory words and the machine is
2441
2442called as …………
2443
2444A) word addressable B) byte addressable C) bit addressable D) Tera byte addressable Ans A
2445
2446	A microprogram written as string of 0’s and 1’s is a
2447
2448………….
2449
2450A) Symbolic microinstruction B) binary microinstruction C) symbolic microinstruction D) binary microprogram Ans D
2451
2452	A pipeline is like ………………..
2453
2454A) an automobile assembly line B) house pipeline C) both a and b D) a gas line
2455 
2456
2457
245825 of 32	10/20/2016 11:59 AM
2459 
2460200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2461 
2462
2463
2464Ans A
2465
2466	Data hazards occur when …… A) Greater performance loss
2467
2468B) Pipeline changes the order of read/write access to operands C) Some functional unit is not fully pipelined
2469
2470D) Machine size is limited Ans B
2471
2472	Where does a computer add and compare data?
2473
2474	Hard disk B. Floppy disk
2475
2476	CPU chip D:Memory chip Ans C
2477
2478178. Which of the following registers is used to keep track of address of the
2479
2480memory location where the next instruction is located?
2481
2482	Memory Address Register
2483
2484	Memory Data Register
2485
2486	Instruction Register
2487
2488	Program Register Ans D
2489
2490179. A complete microcomputer system consists of A) microprocessor
2491
2492B) memory
2493
2494C) peripheral equipment D) all of above
2495
2496Ans D
2497
2498180. CPU does not perform the operation
2499
2500	data transfer
2501
2502	logic operation
2503
2504	arithmetic operation
2505
2506	all of above Ans B
2507
2508181. Pipelining strategy is called implement
2509
2510	instruction execution
2511
2512	instruction prefetch
2513
2514	instruction decoding
2515
2516	instruction manipulation Ans C
2517
2518182. A stack is
2519 
2520
2521
252226 of 32	10/20/2016 11:59 AM
2523 
2524200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2525 
2526
2527
2528	an 8-bit register in the microprocessor
2529
2530	a 16-bit register in the microprocessor
2531
2532	a set of memory locations in R/WM reserved for storing information temporarily
2533
2534during the execution of computer
2535
2536	a 16-bit memory address stored in the program counter Ans A
2537
2538183. A stack pointer is
2539
2540	a 16-bit register in the microprocessor that indicate the beginning of the stack
2541
2542memory.
2543
2544	a register that decodes and executes 16-bit arithmetic expression.
2545
2546	The first memory location where a subroutine address is stored.
2547
2548	a register in which flag bits are stored Ans A
2549
2550184. The branch logic that provides decision making capabilities in the control
2551
2552unit is known as
2553
2554	controlled transfer
2555
2556	conditional transfer
2557
2558	unconditional transfer
2559
2560	none of above Ans C
2561
2562185. Interrupts which are initiated by an instruction are
2563
2564	internal
2565
2566	external
2567
2568	hardware
2569
2570	software Ans D
2571
2572186. A time sharing system imply
2573
2574	more than one processor in the system
2575
2576	more than one program in memory
2577
2578	more than one memory in the system
2579
2580	None of above Ans B
2581
2582187.Virtual memory is –
2583 
2584
2585
258627 of 32	10/20/2016 11:59 AM
2587 
2588200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2589 
2590
2591
2592	an extremely large main memory
2593
2594	an extremely large secondary memory
2595
2596	an illusion of an extremely large memory
2597
2598	a type of memory used in super computers
2599
2600	None of these
2601
2602Answers:
2603
26043
2605
2606188.Fragmentation is –
2607
2608	dividing the secondary memory into equal sized f ragments
2609
2610	dividing the main memory into equal size f ragments
2611
2612	f ragments of memory words used in a page
2613
2614	f ragments of memory words unused in a page
2615
2616	None of these
2617
2618Answers:: 2
2619
2620189.Which memory unit has lowest access time?
2621
2622(1) Cache (2) Registers
2623
2624	Magnetic Disk (4) Main Memory
2625
2626	Pen drive Answer :2 190.Cache memory-
2627
2628	has greater capacity than RAM
2629
2630	is f aster to access than CPU Registers
2631
2632	is permanent storage
2633
2634	f aster to access than RAM
2635
2636	None of these
2637
2638Answer 4
2639
2640191.When more than one processes are running concurrently on a system-
2641
2642	batched system
2643
2644	real-time system
2645
2646	multi programming system
2647
2648	multiprocessing system
2649
2650	None of these
2651
2652Answers:
2653
26543
2655
2656192.Which of the following memories must be refreshed many times per second?
2657
2658a. Static RAM b. Dynamic RAM c. EPROM
2659 
2660
2661
266228 of 32	10/20/2016 11:59 AM
2663 
2664200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2665 
2666
2667
2668	ROM e. None of these ans Static RAM 193.RAM stands for
2669
2670	Random origin money b. Random only memory
2671
2672	Read only memory d. Random access memory
2673
2674	None of these
2675
2676ans Random access memory
2677
2678194.CPU fetches the instruction from memory according to the value of
2679
2680	program counter
2681
2682	status register
2683
2684	instruction register
2685
2686	program status word Answer:a.
2687
2688195.A memory buffer used to accommodate a speed differential is called
2689
2690	stack pointer
2691
2692	cache
2693
2694	accumulator
2695
2696	disk buffer Answer:b.
2697
2698196.Which one of the following is the address generated by CPU?
2699
2700	physical address
2701
2702	absolute address
2703
2704	logical address
2705
2706	none of the mentioned Answer:c.
2707
2708197.Run time mapping from virtual to physical address is done by
2709
2710	memory management unit
2711
2712	CPU
2713
2714	PCI
2715
2716	none of the mentioned Answer:a.
2717
2718198.Memory management technique in which system stores and retrieves
2719
2720data from secondary storage for use in main memory is called
2721 
2722
2723
272429 of 32	10/20/2016 11:59 AM
2725 
2726200 TOP Computer Organization and Architecture Multiple Choice Quest...	http://engineeringinterviewquestions.com/computer-organization-and-arch...
2727 
2728
2729
2730	fragmentation
2731
2732	paging
2733
2734	mapping
2735
2736	none of the mentioned Answer:b
2737
2738199.The address of a page table in memory is pointed by
2739
2740	stack pointer
2741
2742	page table base register
2743
2744	page register
2745
2746	program counter 200.Program always deals with
2747
2748	logical address
2749
2750	absolute address
2751
2752	physical address
2753
2754	relative address Answer:a
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764Posted in Computer Organization and Architecture Multiple
2765
2766Choice Questions
2767
2768
2769Series Circuits Online Test –	100 TOP THEORY of
2770Multiple Choice Questions and	COMPUTATION Multiple
2771Answers	Choice Questions and
2772		Answers	
2773
2774
2775
2776ONE THOUGHT ON “200 TOP COMPUTER
2777
2778ORGANIZATION AND ARCHITECTURE MULTIPLE
2779
2780CHOICE QUESTIONS AND ANSWERS”
2781
2782
2783sai
2784
2785SEPTEMBER 11, 2016 AT 9:26 AM
2786
2787165 ans d
2788 
2789
2790
2791
2792
279330 of 32	10/20/2016 11:59 AM
2794 
27952013	COMPUTER SCIENCE & INFORMATION TECH. - CS
2796
2797Q.1 to Q.25 carry one mark each.
2798
2799Q.1	A binary operation   on a set of integers is defined as x ⊕ y  x2    y 2 . Which one of the following
2800	statements is TRUE about   ?	
2801	(A) Commutative but not associative	(B) Both commutative and associative
2802	(C) Associative but not commutative	(D) Neither commutative nor associative
2803Q.2	Suppose p is the number of cars per minute passing through a certain road junction between 5 PM
2804	and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer
2805	than 3 cars during any given minute in this interval?
2806
2807(A) 8/(2e3)	(B) 9/(2e3)	(C) 17/(2e3)	(D) 26/(2e3)
2808 
2809
2810Q.3
2811 
2812
2813
2814									1	x
2815Which one of the following does NOT equal	1	y
2816									1	z
2817	1	x  x + 1	x + 1					
2818								
2819(A)	1	y  y + 1	y + 1					(B)
2820	1	z  z + 1	z + 1					
2821		x − y	x 2 − y 2			
2822	0					
2823(C)	0	y − z	y 2 − z 2			(D)
2824	1	z		2						
2825				z			
2826										
2827 
2828
2829	2
2830	2  ?
2831	2
2832
28331	x + 1	x 2 + 1	
28341	y + 1	y 2 + 1	
28351	z + 1	z 2 + 1	
2836	x + y	x 2 + y 2
28372		
28382	y + z	y 2 + z 2
28391	z	z 2
2840 
2841
2842Q.4
2843
2844
2845Q.5
2846 
2847
2848The smallest integer that can be represented by an 8-bit number in 2’s complement form is
2849
2850(A) -256	(B) -128	(C) -127	(D) 0
2851
2852In the following truth table, V = 1 if and only if the input is valid.
2853
2854	Inputs		Outputs	
2855D0	D1	D2	D3	X0	X1		V
28560	0	0	0	x	x		0
28571	0	0	0	0	0		1
2858x	1	0	0	0	1		1
2859x	x	1	0	1	0		1
2860x	x	x	1	1	1		1
2861What function does the truth table represent?
2862 
2863
2864(A) Priority encoder	(B) Decoder
2865
2866(C) Multiplexer	(D) Demultiplexer
2867
2868Q.6 Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
2869
2870(A) O(log n)	(B) O(n)	(C) O(n log n)	(D) O(n2)
2871
2872Q.7 Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
2873
2874(A) O(1)	(B) O(log n)	(C) O(n)	(D) O(n log n)
2875 
2876
2877CS-A	2/20
2878 
28792013			COMPUTER SCIENCE & INFORMATION TECH. - CS
2880Q.8	Consider the languages L1 = Φ   and L2 =  a . Which one of the following represents L1 L∗2 U L1∗   ?
2881	(A) {є}	(B) Φ	(C) a*	(D) {є, a}
2882
2883Q.9	What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → є and A → a) to parse a string with n tokens?
2884
2885(A) n/2	(B) n-1	(C) 2n-1	(D) 2n
2886
2887Q.10	A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
2888
2889	This algorithm is equivalent to the first-come-first-serve algorithm.
2890	This algorithm is equivalent to the round-robin algorithm.
2891	This algorithm is equivalent to the shortest-job-first algorithm.
2892	This algorithm is equivalent to the shortest-remaining-time-first algorithm.
2893
2894Q.11	Match the problem domains in GROUP I with the solution technologies in GROUP II.
2895
2896GROUP I			GROUP II
2897(P) Service oriented computing		(1)	Interoperability
2898(Q) Heterogeneous communicating systems	(2)	BPMN
2899(R) Information representation		(3)	Publish-find-bind
2900(S) Process description		(4)	XML
2901(A) P-1, Q-2, R-3, S-4	(B) P-3, Q-4, R-2, S-1
2902(C) P-3, Q-1, R-4, S-2	(D) P-4, Q-3, R-2, S-1
2903
2904Q.12	The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
2905
2906	TCP, UDP, UDP and TCP
2907
2908	UDP, TCP, TCP and UDP
2909	UDP, TCP, UDP and TCP
2910	TCP, UDP, TCP and UDP
2911
2912Q.13	Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ>, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
2913
2914	Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed by Y’s public key
2915
2916	Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed by Y’s private key
2917
2918	Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed by X’s private key
2919
2920	Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed by X’s public key
2921 
2922
2923
2924
2925CS-A	3/20
2926 
29272013	COMPUTER SCIENCE & INFORMATION TECH. - CS
2928
2929Q.14	Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.
2930
2931
2932
2933
2934
2935
2936	Network layer – 4 times and Data link layer – 4 times
2937	Network layer – 4 times and Data link layer – 3 times
2938	Network layer – 4 times and Data link layer – 6 times
2939	Network layer – 2 times and Data link layer – 6 times
2940
2941Q.15	An index is clustered, if
2942
2943	it is on a set of fields that form a candidate key.
2944	it is on a set of fields that include the primary key.
2945	the data records of the file are organized in the same order as the data entries of the index.
2946	the data records of the file are organized not in the same order as the data entries of the index.
2947
2948Q.16	Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?
2949 
2950
2951	X: P(a)P(b)P(c)   Y: P(b)P(c)P(d)
2952
2953	X: P(b)P(a)P(c)   Y: P(b)P(c)P(d)
2954	X: P(b)P(a)P(c)   Y: P(c)P(b)P(d)
2955	X: P(a)P(b)P(c)   Y: P(c)P(b)P(d)
2956 
2957
2958Z: P(c)P(d)P(a) Z: P(a)P(c)P(d) Z: P(a)P(c)P(d) Z: P(c)P(d)P(a)
2959 
2960
2961Q.17	Which of the following statements is/are FALSE?
2962
2963	For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
2964	Turing recognizable languages are closed under union and complementation.
2965	Turing decidable languages are closed under intersection and complementation.
2966	Turing recognizable languages are closed under union and intersection.
2967
2968(A) 1 and 4 only	(B) 1 and 3 only	(C) 2 only	(D) 3 only
2969Q.18	Which of the following statements are TRUE?
2970
2971	The problem of determining whether there exists a cycle in an undirected graph is in P.
2972
2973	The problem of determining whether there exists a cycle in an undirected graph is in NP.
2974
2975	If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
2976
2977(A) 1, 2 and 3	(B) 1 and 2 only	(C) 2 and 3 only	(D) 1 and 3 only
2978 
2979
2980
2981
2982
2983CS-A	4/20
2984 
29852013	COMPUTER SCIENCE & INFORMATION TECH. - CS
2986
2987Q.19	What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
2988
2989(A) Θ(n2)	(B) Θ(n2log n)	(C) Θ(n3)	(D) Θ(n3log n)
2990
2991Q.20	In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from
2992
2993(A) (j mod v) * k			to	(j mod v) * k + (k-1)		(B) (j mod v) to	(j mod v) + (k-1)		
2994(C) (j mod k) to (j mod k) + (v-1)			(D) (j mod k) * v to (j mod k) * v + (v-1)	
2995Q.21   Which one of the following expressions does NOT represent exclusive NOR of x and y?	
2996(A) xy + x′ y′				(B) x ⊕ y′			(C)	x′ ⊕ y						(D)  x′ ⊕ y′		
2997Q.22   Which one of the following functions is continuous at x = 3?								
2998								x = 3																
2999											(B)	f  x =   4,				x = 3		
3000(A)		2,				if								if			
3001	f  x =   x − 1,				if   x > 3						8 − x			if	x ≠ 3		
3002			x + 3			x < 3																
3003								,	if																	
3004																										
3005			3																						
3006(C)	f  x =   x + 3,		if	x ≤ 3			(D)	f  x =	1			,   if		x ≠  3		
3007				x > 3													
3008			x − 4				if									x 3 − 27					
3009Q.23   Function f is known at the following points:														
3010																						
3011	x		0				0.3	0.6		0.9	1.2		1.5		1.8		2.1		2.4		2.7	3.0
3012	f(x)		0				0.09	0.36		0.81	1.44		2.25		3.24		4.41		5.76		7.29	9.00
3013	The value of  ∫3	f  x dx	computed using the trapezoidal rule is								
3014		0																							
3015(A) 8.983				(B) 9.003			(C) 9.017						(D) 9.045		
3016
3017Q.24	Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
3018
3019(A) 1/8	(B) 1	(C) 7	(D) 8
3020
3021Q.25	Which of the following statements is/are TRUE for undirected graphs?
3022
3023	Number of odd degree vertices is even.
3024	Sum of degrees of all vertices is even.
3025
3026(A) P only	(B) Q only	(C) Both P and Q	(D) Neither P nor Q
3027 
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038CS-A	5/20
3039 
30402012	COMPUTER SCIENCE & INFORMATION TECH. ± CS
3041
3042Q. 1 ± Q. 25 carry one mark each.
3043
3044Q.1	Consider the following logical inferences.
3045
3046I1: If it rains then the cricket match will not be played.
3047The cricket match was played.
3048Inference: There was no rain.
3049I2: If it rains then the cricket match will not be played.
3050It did not rain.
3051
3052Inference: The cricket match was played.
3053
3054Which of the following is TRUE?
3055
3056	Both I1 and I2 are correct inferences
3057
3058	I1 is correct but I2 is not a correct inference
3059
3060	I1 is not correct but I2 is a correct inference
3061	Both I1 and I2 are not correct inferences
3062
3063Q.2	Which of the following is TRUE?
3064
3065	Every relation in 3NF is also in BCNF
3066
3067	A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
3068
3069	Every relation in BCNF is also in 3NF
3070
3071	No relation can be in both BCNF and 3NF
3072
3073Q.3	What will be the output of the following C program segment?
3074
3075FKDU LQ&KDU   ¶$·  
3076switch ( inChar ) {
3077
3078FDVH ¶$·   SULQWI 
3079´&KRLFH $\ Qµ 
3080   FDVH ¶%·   FDVH ¶&·   SULQWI 
3081´&KRLFH %µ 
3082   FDVH ¶'·   
3083
3084
3085case ¶(·   GHIDXOW    SULQWI 
3086 ´ 1R &KRLFHµ  
3087   `
3088
3089	No Choice
3090
3091	Choice A
3092
3093	Choice A
3094
3095Choice B No Choice
3096
3097	Program gives no output as it is erroneous
3098
3099Q.4	$VVXPLQJ 3  13  ZKLFK RI WKH IROORZLQJ LV TRUE?	
3100	(A) NP-complete = NP		(B) NP-coPSOHWH   3 	 ‡
3101	(C) NP-hard = NP		(D) P = NP-complete	
3102Q.5	The worst case running time to search for an element in a balanced binary search tree with n2n
3103	elements is			
3104	
3105$   
3106n log n)	
3107%   
3108n2n)	
3109&    
3110n)	
3111'   
3112ORJ n)
3113 
3114
3115
3116
3117
3118
3119
3120CS-A	2/20
3121 
31222012						COMPUTER SCIENCE & INFORMATION TECH. ± CS
3123Q.6	The truth table							
3124			X	Y		f (X, Y)		
3125			0	0		0		
3126			0	1		0		
3127			1	0		1		
3128			1	1		1		
3129	represents the Boolean function					
3130	(A) X	(B) X + Y		(C) X † Y	(D) Y
3131
3132Q.7	The decimal value 0.5 in IEEE single precision floating point representation has
3133
3134
3135$ 
3136 IUDFWLRQ ELWV RI         DQG H[SRQHQW YDOXH RI 0 
3137% 
3138 IUDFWLRQ ELWV RI         DQG H[SRQHQW YDOXH RI í 
3139
3140& 
3141 IUDFWLRQ ELWV RI    	    DQG H[SRQHQW YDOXH RI  
3142(D) no exact representation
3143
3144Q.8 A process executes the code fork();
3145
3146fork();
3147fork();
3148The total number of child processes created is
3149 
3150
3151
3152
3153Q.9
3154
3155
3156
3157
3158
3159
3160
3161
3162Q.10
3163 
3164
3165(A) 3	(B) 4	(C) 7	(D) 8
3166
3167Consider the function f(x) = sin(x) in the interval x  >         @  7KH QXPEHU DQG ORFDWLRQ
3168V 
3169 RI WKH  local minima of this function are
3170
3171
3172$ 
3173 2QH  DW     
3174% 
3175 2QH  DW      
3176& 
3177 7ZR  DW     DQG      
3178' 
3179 7ZR  DW     DQG     
3180
3181
3182The protocol data unit (PDU) for the application layer in the Internet stack is
3183
3184(A) Segment	(B) Datagram	(C) Message	(D) Frame
3185 
3186
3187Q.11	Let A be the 2 × 2 matrix with elements a11 = a12 = a21 = +1 and a22    í   7KHQ WKH HLJHQYDOXHV RI 
3188the matrix A19 are
3189
3190
3191$ 
3192      DQG í    	(B)     ¥  DQG í    ¥ 
3193
3194
3195& 
3196  ¥  DQG í ¥ 	
3197' 
3198    ¥  DQG í   ¥ 
3199
3200Q.12	What is the complement of the language accepted by the NFA shown below? Assume  = {a} and  is the empty string.
3201
3202
3203
3204a	
3205
3206
3207
3208
3209
3210(A) ‡	(B) {}	(C) a*	(D) {a , }
3211 
3212
3213CS-A	3/20
3214 
32152012	COMPUTER SCIENCE & INFORMATION TECH. ± CS
3216
3217Q.13	What is the correct translation of the following statement into mathematical logic?
3218³6RPH UHDO QXPEHUV DUH UDWLRQDO´
3219
3220	x (real(x) › rational(x))
3221
3222	 x (real(x) o rational(x))
3223
3224	x (real(x) š rational(x))
3225
3226	x (rational(x) o real(x))
3227
3228Q.14	Given the basic ER and relational models, which of the following is INCORRECT?
3229
3230	An attribute of an entity can have more than one value
3231	An attribute of an entity can be composite
3232
3233	In a row of a relational table, an attribute can have more than one value
3234	In a row of a relational table, an attribute can have exactly one value or a NULL value
3235
3236Q.15	Which of the following statements are TRUE about an SQL query?
3237
3238P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause
3239
3240R : All attributes used in the GROUP BY clause must appear in the SELECT clause
3241S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
3242
3243(A) P and R	(B) P and S	(C) Q and R	(D) Q and S
3244
3245Q.16	The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
3246
3247(A) T(n) = 2T(n í   
3248  
3249  	(B) T(n) = 2T(n í   
3250  
3251 n
3252(C) T(n) = 2T(n/2) + 1	(D) T(n) = 2T(n í   
3253  
3254  
3255
3256Q.17	Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
3257
3258(A) 3	(B) 4	(C) 5	(D) 6
3259
3260Q.18	Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
3261
3262(A) A(n 
3263     
3264:
3265n))	(B) A(n 
3266     
3267:
3268n))
3269
3270(C) A(n) = O (W(n))	(D) A(n) = o (W(n))
3271
3272Q.19	The amount of ROM needed to implement a 4 bit multiplier is
3273
3274(A) 64 bits	(B) 128 bits	(C) 1 Kbits	(D) 2 Kbits
3275
3276Q.20	Register renaming is done in pipelined processors
3277
3278	as an alternative to register allocation at compile time
3279
3280	for efficient access to function parameters and local variables
3281
3282	to handle certain kinds of hazards
3283
3284	as part of address translation
3285
3286Q.21	Consider a random variable X that takes values +1 and í  ZLWK SUREDELOLW\     HDFK  7KH YDOXHV RI 
3287
3288the cumulative distribution function F(x) at x	 í  DQG   DUH	
3289(A) 0 and 0.5	(B) 0 and 1	(C) 0.5 and 1	(D) 0.25 and 0.75
3290 
3291
3292
3293CS-A	4/20
3294 
32952012	COMPUTER SCIENCE & INFORMATION TECH. ± CS
3296
3297Q.22	Which of the following transport layer protocols is used to support electronic mail?
3298
3299(A) SMTP	(B) IP	(C) TCP	(D) UDP
3300
3301Q.23	In the IPv4 addressing format, the number of networks allowed under Class C addresses is
3302
3303(A) 214	(B) 27	(C) 221	(D) 224
3304
3305Q.24	Which of the following problems are decidable?
3306
3307	Does a given program ever produce an output?
3308
3309	If L is a context-free language, then, is L also context-free?
3310
3311	If L is a regular language, then, is L also regular?
3312
3313	If L is a recursive language, then, is L also recursive?
3314
3315(A) 1, 2, 3, 4	(B) 1, 2	(C) 2, 3, 4	(D) 3, 4
3316
3317Q.25	Given the language L = {ab, aa, baa}, which of the following strings are in L*?
3318
33191)	abaabaaabaa
33202)	aaaabaaaa
33213)	baaaaabaaaab
33224)	baaaaabaa
3323(A) 1, 2 and 3	(B) 2, 3 and 4
3324(C) 1, 2 and 4	(D) 1, 3 and 4
3325 
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361CS-A	5/20
3362 
33632013	COMPUTER SCIENCE & INFORMATION TECH. - CS
3364
3365Q.1 to Q.25 carry one mark each.
3366
3367Q.1	A binary operation   on a set of integers is defined as x ⊕ y  x2    y 2 . Which one of the following
3368	statements is TRUE about   ?	
3369	(A) Commutative but not associative	(B) Both commutative and associative
3370	(C) Associative but not commutative	(D) Neither commutative nor associative
3371Q.2	Suppose p is the number of cars per minute passing through a certain road junction between 5 PM
3372	and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer
3373	than 3 cars during any given minute in this interval?
3374
3375(A) 8/(2e3)	(B) 9/(2e3)	(C) 17/(2e3)	(D) 26/(2e3)
3376 
3377
3378Q.3
3379 
3380
3381
3382									1	x
3383Which one of the following does NOT equal	1	y
3384									1	z
3385	1	x  x + 1	x + 1					
3386								
3387(A)	1	y  y + 1	y + 1					(B)
3388	1	z  z + 1	z + 1					
3389		x − y	x 2 − y 2			
3390	0					
3391(C)	0	y − z	y 2 − z 2			(D)
3392	1	z		2						
3393				z			
3394										
3395 
3396
3397	2
3398	2  ?
3399	2
3400
34011	x + 1	x 2 + 1	
34021	y + 1	y 2 + 1	
34031	z + 1	z 2 + 1	
3404	x + y	x 2 + y 2
34052		
34062	y + z	y 2 + z 2
34071	z	z 2
3408 
3409
3410Q.4
3411
3412
3413Q.5
3414 
3415
3416The smallest integer that can be represented by an 8-bit number in 2’s complement form is
3417
3418(A) -256	(B) -128	(C) -127	(D) 0
3419
3420In the following truth table, V = 1 if and only if the input is valid.
3421
3422	Inputs		Outputs	
3423D0	D1	D2	D3	X0	X1		V
34240	0	0	0	x	x		0
34251	0	0	0	0	0		1
3426x	1	0	0	0	1		1
3427x	x	1	0	1	0		1
3428x	x	x	1	1	1		1
3429What function does the truth table represent?
3430 
3431
3432(A) Priority encoder	(B) Decoder
3433
3434(C) Multiplexer	(D) Demultiplexer
3435
3436Q.6 Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
3437
3438(A) O(log n)	(B) O(n)	(C) O(n log n)	(D) O(n2)
3439
3440Q.7 Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
3441
3442(A) O(1)	(B) O(log n)	(C) O(n)	(D) O(n log n)
3443 
3444
3445CS-A	2/20
3446 
34472013			COMPUTER SCIENCE & INFORMATION TECH. - CS
3448Q.8	Consider the languages L1 = Φ   and L2 =  a . Which one of the following represents L1 L∗2 U L1∗   ?
3449	(A) {є}	(B) Φ	(C) a*	(D) {є, a}
3450
3451Q.9	What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → є and A → a) to parse a string with n tokens?
3452
3453(A) n/2	(B) n-1	(C) 2n-1	(D) 2n
3454
3455Q.10	A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
3456
3457	This algorithm is equivalent to the first-come-first-serve algorithm.
3458	This algorithm is equivalent to the round-robin algorithm.
3459	This algorithm is equivalent to the shortest-job-first algorithm.
3460	This algorithm is equivalent to the shortest-remaining-time-first algorithm.
3461
3462Q.11	Match the problem domains in GROUP I with the solution technologies in GROUP II.
3463
3464GROUP I			GROUP II
3465(P) Service oriented computing		(1)	Interoperability
3466(Q) Heterogeneous communicating systems	(2)	BPMN
3467(R) Information representation		(3)	Publish-find-bind
3468(S) Process description		(4)	XML
3469(A) P-1, Q-2, R-3, S-4	(B) P-3, Q-4, R-2, S-1
3470(C) P-3, Q-1, R-4, S-2	(D) P-4, Q-3, R-2, S-1
3471
3472Q.12	The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
3473
3474	TCP, UDP, UDP and TCP
3475
3476	UDP, TCP, TCP and UDP
3477	UDP, TCP, UDP and TCP
3478	TCP, UDP, TCP and UDP
3479
3480Q.13	Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ>, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
3481
3482	Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed by Y’s public key
3483
3484	Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed by Y’s private key
3485
3486	Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed by X’s private key
3487
3488	Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed by X’s public key
3489 
3490
3491
3492
3493CS-A	3/20
3494 
34952013	COMPUTER SCIENCE & INFORMATION TECH. - CS
3496
3497Q.14	Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.
3498
3499
3500
3501
3502
3503
3504	Network layer – 4 times and Data link layer – 4 times
3505	Network layer – 4 times and Data link layer – 3 times
3506	Network layer – 4 times and Data link layer – 6 times
3507	Network layer – 2 times and Data link layer – 6 times
3508
3509Q.15	An index is clustered, if
3510
3511	it is on a set of fields that form a candidate key.
3512	it is on a set of fields that include the primary key.
3513	the data records of the file are organized in the same order as the data entries of the index.
3514	the data records of the file are organized not in the same order as the data entries of the index.
3515
3516Q.16	Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?
3517 
3518
3519	X: P(a)P(b)P(c)   Y: P(b)P(c)P(d)
3520
3521	X: P(b)P(a)P(c)   Y: P(b)P(c)P(d)
3522	X: P(b)P(a)P(c)   Y: P(c)P(b)P(d)
3523	X: P(a)P(b)P(c)   Y: P(c)P(b)P(d)
3524 
3525
3526Z: P(c)P(d)P(a) Z: P(a)P(c)P(d) Z: P(a)P(c)P(d) Z: P(c)P(d)P(a)
3527 
3528
3529Q.17	Which of the following statements is/are FALSE?
3530
3531	For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
3532	Turing recognizable languages are closed under union and complementation.
3533	Turing decidable languages are closed under intersection and complementation.
3534	Turing recognizable languages are closed under union and intersection.
3535
3536(A) 1 and 4 only	(B) 1 and 3 only	(C) 2 only	(D) 3 only
3537Q.18	Which of the following statements are TRUE?
3538
3539	The problem of determining whether there exists a cycle in an undirected graph is in P.
3540
3541	The problem of determining whether there exists a cycle in an undirected graph is in NP.
3542
3543	If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
3544
3545(A) 1, 2 and 3	(B) 1 and 2 only	(C) 2 and 3 only	(D) 1 and 3 only
3546 
3547
3548
3549
3550
3551CS-A	4/20
3552 
35532013	COMPUTER SCIENCE & INFORMATION TECH. - CS
3554
3555Q.19	What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
3556
3557(A) Θ(n2)	(B) Θ(n2log n)	(C) Θ(n3)	(D) Θ(n3log n)
3558
3559Q.20	In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from
3560
3561(A) (j mod v) * k			to	(j mod v) * k + (k-1)		(B) (j mod v) to	(j mod v) + (k-1)		
3562(C) (j mod k) to (j mod k) + (v-1)			(D) (j mod k) * v to (j mod k) * v + (v-1)	
3563Q.21   Which one of the following expressions does NOT represent exclusive NOR of x and y?	
3564(A) xy + x′ y′				(B) x ⊕ y′			(C)	x′ ⊕ y						(D)  x′ ⊕ y′		
3565Q.22   Which one of the following functions is continuous at x = 3?								
3566								x = 3																
3567											(B)	f  x =   4,				x = 3		
3568(A)		2,				if								if			
3569	f  x =   x − 1,				if   x > 3						8 − x			if	x ≠ 3		
3570			x + 3			x < 3																
3571								,	if																	
3572																										
3573			3																						
3574(C)	f  x =   x + 3,		if	x ≤ 3			(D)	f  x =	1			,   if		x ≠  3		
3575				x > 3													
3576			x − 4				if									x 3 − 27					
3577Q.23   Function f is known at the following points:														
3578																						
3579	x		0				0.3	0.6		0.9	1.2		1.5		1.8		2.1		2.4		2.7	3.0
3580	f(x)		0				0.09	0.36		0.81	1.44		2.25		3.24		4.41		5.76		7.29	9.00
3581	The value of  ∫3	f  x dx	computed using the trapezoidal rule is								
3582		0																							
3583(A) 8.983				(B) 9.003			(C) 9.017						(D) 9.045		
3584
3585Q.24	Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
3586
3587(A) 1/8	(B) 1	(C) 7	(D) 8
3588
3589Q.25	Which of the following statements is/are TRUE for undirected graphs?
3590
3591	Number of odd degree vertices is even.
3592	Sum of degrees of all vertices is even.
3593
3594(A) P only	(B) Q only	(C) Both P and Q	(D) Neither P nor Q
3595 
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606CS-A	5/20
3607 
3608100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
3609 
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620DATABASE MANAGEMENT SYSTEM
3621
3622Questions and Answers :-
3623
36241. A Database Management System (DBMS) is
3625
3626	Collection of interrelated data
3627
3628	Collection of programs to access data
3629
3630	Collection of data describing one particular enterprise
3631
3632	All of the above
3633
3634
36352. Which of the following is not a level of data abstraction?
3636
3637	Physical Level
3638
3639	Critical Level
3640
3641	Logical Level
3642
3643	View Level
3644
3645
3646	Disadvantages of File systems to store data is: A. Data redundancy and inconsistency
3647
3648B. Difficulty in accessing data C. Data isolation
3649
3650D. All of the above
3651
3652
3653	In an Entity-Relationship Diagram Rectangles represents
3654
3655A. Entity sets
3656
3657	Attributes
3658
3659	Database
3660
3661	Tables
3662
3663
36645. Which of the following is not a Storage Manager Component?
3665
3666	Transaction Manager
3667
3668	Logical Manager
3669
3670	Buffer Manager
3671
3672	File Manager
3673 
3674
3675
3676
3677
3678
36792 of 34	10/20/2016 12:12 PM
3680 
3681100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
3682 
3683
3684
3685	Data Manipulation Language enables users to A. Retrieval of information stored in database
3686
3687B. Insertion of new information into the database C. Deletion of information from the database
3688
3689D. All of the above
3690
3691
3692	Which of the following is not an Schema?
3693
3694	Database Schema
3695
3696	Physical Schema
3697
3698	Critical Schema
3699
3700	Logical Schema
3701
3702
3703	Which of the following is Database Language? A. Data Definition Language
3704
3705B. Data Manipulation Language C. Query Language
3706
3707D. All of the above
3708
3709
3710	Which of the following in not a function of DBA?
3711
3712	Network Maintenance
3713
3714	Routine Maintenance
3715
3716	Schema Definition
3717
3718	Authorization for data access
3719
3720
372110. Which of the following is a Data Model?
3722
3723	Entity-Relationship model
3724
3725	Relational data model
3726
3727	Object-Based data model
3728
3729	All of the above
3730
3731
37321. Which of the following represents a relationship among a set of values.
3733
3734	A Row
3735
3736	A Table
3737
3738	A Field
3739
3740	A Column
3741 
3742
3743
3744
3745
3746
3747
37483 of 34	10/20/2016 12:12 PM
3749 
3750100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
3751 
3752
3753
3754	Column header is refer as A. Table
3755
3756B. Relation C. Attributes D. Domain
3757
3758	A Relation is a
3759
3760	Subset of a Cartesian product of a list of attributes
3761
3762	Subset of a Cartesian product of a list of domains
3763
3764	Subset of a Cartesian product of a list of tuple
3765
3766	Subset of a Cartesian product of a list of relations
3767
3768
3769	In mathematical term Table is referred as A. Relation
3770
3771B. Attribute C. Tuple D. Domain
3772
3773
3774	In mathematical term Row is referred as A. Relation
3775
3776B. Attribute C. Tuple D. Domain
3777
3778
3779	_______ allow us to identify uniquely a tuple in the relation.
3780
3781A. Superkey B. Domain C. Attribute D. Schema
3782
3783	Minimal Superkeys are called
3784
3785	Schema keys
3786
3787	Candidate keys
3788
3789	Domain keys
3790
3791	Attribute keys
3792
3793
37948. Which of the following is not Modification of the Database
3795 
3796
3797
37984 of 34	10/20/2016 12:12 PM
3799 
3800100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
3801 
3802
3803
3804	Deletion
3805
3806	Insertion
3807
3808	Sorting
3809
3810	Updating
3811
3812
3813	Which of the following is Relation-algebra Operation A. Select
3814
3815B. Union C. Rename
3816
3817D. All of the above
3818
3819
3820	Which of the following in not Outer join?
3821
3822	Left outer join
3823
3824	Right outer join
3825
3826	Full outer join
3827
3828	All of the above Answers
3829
38301 – A / 2 – C / 3 – B / 4 – A / 5 – C / 6 – A / 7 – B / 8 – C / 9 –
3831
3832	/ 10 – D
3833
3834
3835	Who proposed the relational model? A. Bill Gates
3836
3837B. E.F. Codd
3838
3839C. Herman Hollerith D. Charles Babbage
3840
3841
3842	Set of premitted values of each attribute is called A. Domain
3843
3844B. Tuple C. Relation D. Schema
3845
3846
3847	Which of the following in true regarding Null Value? A. Null = 0
3848
3849B. Null 0 D. Null 0
3850
3851	Logical design of database is called
3852 
3853
3854
38555 of 34	10/20/2016 12:12 PM
3856 
3857100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
3858 
3859
3860
3861	Database Instance
3862
3863	Database Snapshot
3864
3865	Database Schema
3866
3867	All of the above
3868
3869
3870	Snapshot of the dta in the database at a given instant of time is called
3871
3872A. Database Schema B. Database Instance C. Database Snapshot D. All of the above
3873
3874	Which of the following is not Unary operation?
3875
3876	Select
3877
3878	Project
3879
3880	Rename
3881
3882	Union
3883
3884
3885	Which of the following is not binary operation? A. Union
3886
3887B. Project
3888
3889C. Set Difference
3890
3891D. Cartesian Product
3892
3893
3894	Which of the following is correct regarding Aggregate functions?
3895
3896A. it takes a list of values and return a single values as result B. it takes a list of values and return a list of values as result C. it takes a single value and returns a list of values as result D. it takes a single value and returns a single value as result
3897
3898	The Primary key must be
3899
3900	Non Null
3901
3902	Unique
3903
3904	Option A or B
3905
3906	Option A and B
3907
3908
390910. A command to remove a relation from an SQL database
3910 
3911
3912
39136 of 34	10/20/2016 12:12 PM
3914 
3915100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
3916 
3917
3918
3919	Delete table <table name>
3920
3921	Drop table <table name>
3922
3923	Erase table <table name>
3924
3925	Alter table <table name> Answers :-
3926
39271 – B / 2 – A / 3 – D / 4 – C / 5 – B / 6 – D / 7 – B / 8 – A / 9 –
3928
3929	/ 10 – B
3930
3931
3932	which of the following is not an Aggregate function? A. Min
3933
3934B. Max C. Select D. Avg
3935
3936
3937	The attribute that can be divided into other attributes is called
3938
3939A. Simple Attribute
3940
3941B. Composite Attribute C. Multi-valued Attribute D. Derived Attribute
3942
3943
3944	In an Entity-Relationship Diagram “Ellipses” represents A. Attributes
3945
3946B. Weak entity set C. Relationship sets
3947
3948D. Multi-valued attributes
3949
3950
3951	In an Entity-Relationship Diagram “Diamonds” represents A. Attributes
3952
3953B. Multi-valued attributes C. Weak entity set
3954
3955D. Relationship sets
3956
3957
3958	What is ACID properties of Transactions?
3959
3960	Atomicity, Consistency, Isolation, Database
3961
3962	Atomicity, Consistency, Isolation, Durability
3963
3964	Atomicity, Consistency, Inconsistent, Durability
3965
3966	Automatically, Concurrency, Isolation, Durability
3967 
3968
3969
39707 of 34	10/20/2016 12:12 PM
3971 
3972100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
3973 
3974
3975
3976	If every non-key attribute is functionally dependent on the primary key, the relation will be in
3977
3978A. First Normal Form B. Second Normal Form C. Third Normal Form D. Fourth Formal Form
3979
3980
3981	Database locking concept is used to solve the problem of A. Lost Update
3982
3983B. Uncommitted Dependency C. Inconsistent Data
3984
3985D. All of the above
3986
3987
3988	UML is stands for
3989
3990	Universal Modeling Language
3991
3992	Unified Modeling Language
3993
3994	United Modeling Language
3995
3996	Uni Modeling Language
3997
3998
3999	Data Manipulation Language (DML) is not to A. Create information table in the Database
4000
4001B. Insertion of new information into the Database C. Deletion of information in the Database
4002
4003D. Modification of information in the Database
4004
4005
4006	Which of the following in true regarding Referential Integrity?
4007
4008A. Every primary-key value must match a primary-key value in an associated table
4009
4010B. Every primary-key value must match a foreign-key value in an associated table
4011
4012C. Every foreign-key value must match a primary-key value in an associated table
4013
4014D. Every foreign-key value must match a foreign-key value in an associated table
4015
4016Answers :-
4017
4018	– C / 2 – B / 3 – A / 4 – D / 5 – B / 6 – C / 7 – D / 8 – B / 9 – A / 10 – C
4019 
4020
4021
40228 of 34	10/20/2016 12:12 PM
4023 
4024100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4025 
4026
4027
4028	Which of the following option is use to retrieval of data? a. Stack
4029
4030b. Data Structure c. Linked list
4031
4032d. Query
4033
4034
4035	ODBC stands for ______
4036
4037	Offline database connection
4038
4039	Oriented database connection
4040
4041	Open database connection
4042
4043	None of above
4044
4045
4046	Which algebra is widely used in DBMS? a. Relational algebra
4047
4048b. Arithmetic algebra c. Both
4049
4050d. None
4051
4052
4053	Which of the following is an unary operation? a. Selection operation
4054
4055b. Generalized selection c. Primitive operation d. Projection operation
4056
4057
4058	Which SQL Query is use to remove a table and all its data from the database?
4059
4060a. Create Table b. Alter Table c. Drop Table d. None of these
4061
4062
4063	In precedence of set operators the expression is evaluated from:
4064
4065a. Left to Left b. Left to Right c. Right to Right d. Right to Left
4066 
4067
4068
4069
4070
40719 of 34	10/20/2016 12:12 PM
4072 
4073100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4074 
4075
4076
4077	In DBMS FD stands for _______
4078
4079a. Facilitate data b. Functional data
4080
4081c. Facilitate dependency d. Functional dependency
4082
4083
4084	How many types of keys in Database Design? a. Candidate key
4085
4086b. Primary key c. Foreign key d. All of these
4087
4088
4089	Which of the following is based on Multi Valued Dependency?
4090
4091a. First b. Second c. Third d. Fourth
4092
4093
4094	Which of the following is the structure of the Database? a. Table
4095
4096b. Schema c. Relation
4097
4098d. None of these
4099
4100
4101Answers :-
4102
41031 – d / 2 – c / 3 – a / 4 – b / 5 – c / 6 – b / 7 – d / 8 – d / 9 – d / 10 – b
4104
4105
4106	The minimal set of super key is called A. Primary key
4107
4108B. Secondary key C. Candidate key D. Foreign key
4109
4110
4111	A relation that has no partial dependencies is in which normal form
4112
4113A. First
4114 
4115
4116
411710 of 34	10/20/2016 12:12 PM
4118 
4119100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4120 
4121
4122
4123	Second
4124
4125	Third
4126
4127	BCNF
4128
4129
4130	A functional dependency between two or more non-key attributes is called
4131
4132A. Transitive dependency
4133
4134B. Partial transitive dependency C. Functional dependency
4135
4136D. Partial functional dependency
4137
4138
4139	A logical description of some portion of database that is required by a user to perform task is called as
4140
4141A. System View B. User View C. Logical View D. Data View
4142
4143
4144	______________ is a classical approach to database design?
4145
4146A. Left – Right approach B. Right – Left approach C. Top – Down approach D. Bottom – Up approach
4147
4148
4149	_____________ refers to the correctness and completeness of the data in a database?
4150
4151A. Data security B. Data integrity C. Data constraint
4152
4153D. Data independence
4154
4155
4156	A table that displays data redundancies yields
4157
4158____________ anomalies A. Insertion
4159
4160B. Deletion C. Update
4161
4162D. All of the above
4163 
4164
4165
416611 of 34	10/20/2016 12:12 PM
4167 
4168100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4169 
4170
4171
4172	A lock that allows concurrent transactions to access different rows of the same table is known as a
4173
4174A. Field-level lock B. Row-level lock C. Table-level lock
4175
4176D. Database-level lock
4177
4178
4179	A type of query that is placed within a WHERE or HAVING clause of another query is called
4180
4181A. Super query B. Sub query C. Master query D. Multi-query
4182
4183	A transaction completes its execution is said to be
4184
4185	Saved
4186
4187	Loaded
4188
4189	Rolled
4190
4191	Committed
4192
4193
4194Answers :-
4195
41961 – C / 2 – B / 3 – A / 4 – B / 5 – C / 6 – B / 7 – D / 8 – A / 9 – B / 10 – D
4197
419861.
4199
4200When converting one (1) to many (N) binary relationship into tables, the recommended solution is usually
4201
4202(a)
4203
4204One big table with all attributes from both entities included
4205
4206(b)
4207
4208Foreign key added on the Child (many side) referencing the parent
4209
4210(c)
4211
4212Foreign key added on the Parent (one side) referencing the child
4213
4214(d)
4215
4216Foreign key added on both sides (both tables)
4217
4218(e)
4219
4220Primary Key is added on one side.
4221 
4222
4223
422412 of 34	10/20/2016 12:12 PM
4225 
4226100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4227 
4228
4229
423062.
4231
4232Which of the following is not correct?
4233
4234(a)
4235
4236Each entity must include some descriptive information
4237
4238(b)
4239
4240If an object only requires an identifier, it should be classified as an attribute
4241
4242(c)
4243
4244Each multivalued attribute should be classified as an entity even if it does not have any descriptive information
4245
4246(d)
4247
4248The procedure of identifying entities and attaching attributes always leads to a unique solution
4249
4250(e)
4251
4252Every entity is a collection of attributes. 63.
4253
4254The property of transaction which ensures that either all operations of the transaction are reflected properly in the database or none, is called
4255
4256(a) Atomicity
4257
4258(b) Durability
4259
4260(c) Isolation
4261
4262(d) Consistency
4263
4264(e)
4265
4266Deadlock.
4267
426864.
4269
4270Which of the following is correct?
4271
4272(a)
4273
4274Function dependencies are not associated with relations; they are based on the semantics of information that we are dealing with
4275
4276(b)
4277
4278If a relation has no redundant information its attributes must not have any function dependencies
4279 
4280
4281
428213 of 34	10/20/2016 12:12 PM
4283 
4284100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4285 
4286
4287
4288(c)
4289
4290Functional dependencies may be determined if we are given several instances of a relation
4291
4292(d)
4293
4294The FDs that hold for attributes of a relation need not be satisfied at all times
4295
4296(e)
4297
4298BCNF is a fourth normal form. 65.
4299
4300An entity type whose existence depends on another entity type is called a _____ entity.
4301
4302(a) Strong
4303
4304(b) Weak
4305
4306(c) Codependent
4307
4308(d) Variant
4309
4310(e)
4311
4312Independent.
4313
431466.
4315
4316A property or characteristic of an entity type that is of interest to the organization is called an
4317
4318(a) Attribute
4319
4320(b)
4321
4322Coexisting entity
4323
4324(c) Relationship
4325
4326(d) Cross-function
4327
4328(e)
4329
4330Weak entity. 67.
4331
4332A relationship between the instances of a single entity type is called a _____ relationship.
4333
4334(a)
4335 
4336
4337
433814 of 34	10/20/2016 12:12 PM
4339 
4340100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4341 
4342
4343
4344Ternary
4345
4346(b) Primary
4347
4348(c) Binary
4349
4350(d) Auxiliary
4351
4352(e)
4353
4354Unary.
4355
435668.
4357
4358A ________ attribute is an attribute that can be further subdivided to yield additional attributes.
4359
4360(a) Composite
4361
4362(b) Simple
4363
4364(c) Single-valued
4365
4366(d) Multi-valued
4367
4368(e)
4369
4370Derived.
4371
437269.
4373
4374In a super type/subtype hierarchy, each subtype has
4375
4376(a)
4377
4378Only one super type
4379
4380(b)
4381
4382Many super types
4383
4384(c)
4385
4386At most two super types
4387
4388(d)
4389
4390At least one subtype
4391
4392(e)
4393
4394Not at all. 70.
4395
4396The hierarchical database model uses the hierarchic sequence that always starts at
4397
4398(a)
4399 
4400
4401
440215 of 34	10/20/2016 12:12 PM
4403 
4404100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4405 
4406
4407
4408The right side of the tree
4409
4410(b)
4411
4412The left side of the tree
4413
4414(c)
4415
4416The top of the tree
4417
4418(d)
4419
4420The bottom of the tree
4421
4422(e)
4423
4424Middle of the above.
4425
4426
4427Answers
4428
4429
443061.
4431
4432Answer : (b)
4433
4434Reason: When converting one (1) to many (N) binary relationship into tables, the recommended solution is Foreign key added on the Child (many side) referencing the parent 62.
4435
4436Answer : (d)
4437
4438Reason: The procedure of identifying entities and attaching attributes always leads to a unique solution
4439
444063.
4441
4442Answer : (a)
4443
4444Reason: Atomicity is the property of transaction which ensures that either all operations of the transaction are reflected properly in the database or none
4445
444664.
4447
4448Answer : (a)
4449
4450Reason: Function dependencies are not associated with relations; they are based on the semantics of information that we are dealing with.
4451
445265.
4453
4454Answer : (b)
4455
4456Reason: Entity type whose existence depends on another entity type is called a weak entity
4457
445866.
4459
4460Answer : (a)
4461
4462Reason: A property or characteristic of an entity type that is of
4463 
4464
4465
446616 of 34	10/20/2016 12:12 PM
4467 
4468100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4469 
4470
4471
4472interest to the organization is called attribute 67.
4473
4474Answer : (e)
4475
4476Reason: A relationship between the instances of a single entity type is called a Unary relationship.
4477
447868.
4479
4480Answer : (a)
4481
4482Reason: Composite attribute is an attribute that can be further subdivided to yield additional attributes.
4483
448469.
4485
4486Answer : (a)
4487
4488Reason: In a super type/subtype hierarchy, each subtype has only one super type
4489
449070.
4491
4492Answer : (b)
4493
4494Reason: The hierarchical database model uses the hierarchic sequence that always starts at the left side of the tree
4495
449671.
4497
4498Which of the following is a component of the relational data model included to specify business rules to maintain the integrity of data when they are manipulated?
4499
4500(a)
4501
4502Business rule constraint
4503
4504(b)
4505
4506Data integrity
4507
4508(c)
4509
4510Business integrity
4511
4512(d)
4513
4514Data structure
4515
4516(e)
4517
4518Entity Integrity. 72.
4519
4520A null value is created or represented by
4521
4522(a)
4523
4524A zero
4525
4526(b)
4527
4528A space
4529 
4530
4531
453217 of 34	10/20/2016 12:12 PM
4533 
4534100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4535 
4536
4537
4538(c)
4539
4540Entering a value
4541
4542(d)
4543
4544Pressing the ESC key
4545
4546(e)
4547
4548Pressing the Enter key without making a prior entry of any kind.
4549
455073.
4551
4552A functional dependency between two or more non-key attributes is called
4553
4554(a)
4555
4556Partial functional dependency
4557
4558(b)
4559
4560Partial non-key dependency
4561
4562(c)
4563
4564Transitive dependency
4565
4566(d)
4567
4568Partial transitive dependency
4569
4570(e)
4571
4572Key dependency. 74.
4573
4574Which of the following is a classical approach to database design?
4575
4576(a)
4577
4578Top-down approach
4579
4580(b)
4581
4582Left-side approach
4583
4584(c)
4585
4586Right-side approach
4587
4588(d)
4589
4590Backwards approach
4591
4592(e)
4593
4594Middleware.
4595
459675.
4597
4598In the context of a database table, the statement “A determines B” indicates that
4599
4600(a)
4601
4602Knowing the value of attribute A you can not look up the value
4603 
4604
4605
460618 of 34	10/20/2016 12:12 PM
4607 
4608100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4609 
4610
4611
4612of attribute B
4613
4614(b)
4615
4616You do not need to know the value of attribute A in order to look up the value of attribute B
4617
4618(c)
4619
4620Knowing the value of attribute B you can look up the value of attribute A
4621
4622(d)
4623
4624Knowing the value of attribute A you can look up the value of attribute B
4625
4626(e)
4627
4628None of the above. 76.
4629
4630Which of the following Relational Algebra operations require that both tables (or virtual tables) involved have the exact same attributes/data types?
4631
4632(a)
4633
4634Join, Projection, Restriction
4635
4636(b)
4637
4638Multiplication and Division
4639
4640(c)
4641
4642Union, Intersection, Minus
4643
4644(d)
4645
4646Minus, Multiplication, Intersection
4647
4648(e)
4649
4650Projection, Selection, Rename. 77.
4651
4652Which type of file is easiest to update?
4653
4654(a) Sequential
4655
4656(b) Hashed
4657
4658(c) Indexed
4659
4660(d) Clustered
4661
4662(e)
4663
4664Random.
4665 
4666
4667
466819 of 34	10/20/2016 12:12 PM
4669 
4670100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4671 
4672
4673
467478.
4675
4676A method that speeds query processing by running a query at the same time against several partitions of a table using multi processors is called
4677
4678(a)
4679
4680Multiple partition query
4681
4682(b)
4683
4684Perpendicular query processing
4685
4686(c)
4687
4688Parallel query processing
4689
4690(d)
4691
4692Query optimization
4693
4694(e)
4695
4696Query Execution. 79.
4697
4698The protocol that ensures conflict serializability is
4699
4700(a)
4701
4702Time stamp ordering protocol
4703
4704(b)
4705
4706Two phase locking protocol
4707
4708(c)
4709
4710Concurrency protocol
4711
4712(d)
4713
4714Tree protocol
4715
4716(e)
4717
4718Layered Protocol. 80.
4719
4720Indexes are created in most RDBMS’s to
4721
4722(a)
4723
4724Provide a quicker way to store data
4725
4726(b)
4727
4728Decrease the amount of disk space utilized
4729
4730(c)
4731
4732Provide rapid, random and sequential access to base-table data
4733
4734(d)
4735
4736Increase the cost of implementation
4737
4738(e)
4739
4740Decrease the cost of implementation.
4741 
4742
4743
474420 of 34	10/20/2016 12:12 PM
4745 
4746100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4747 
4748
4749
4750Answers
4751
4752
475371.
4754
4755Answer : (b)
4756
4757Reason: Data integrity is a component of the relational data model included to specify business rules to maintain the integrity of data when they are manipulated
4758
475972.
4760
4761Answer : (e)
4762
4763Reason: A null value is created or represented by Pressing the Enter key without making a prior entry of any kind
4764
476573.
4766
4767Answer : (c)
4768
4769Reason: A functional dependency between two or more non-key attributes is called transitive dependency
4770
477174.
4772
4773Answer : (a)
4774
4775Reason: top-down approach is a classical approach to database design
4776
477775.
4778
4779Answer : (d)
4780
4781Reason: Knowing the value of attribute A you can look up the value of attribute B.
4782
478376.
4784
4785Answer : (c)
4786
4787Reason: n relational algebra Union, Intersection, Minus operations require that both tables (or virtual tables) involved have the exact same attributes/data types.
4788
478977.
4790
4791Answer : (b)
4792
4793Reason: Hash file is easiest to update 78.
4794
4795Answer : (c)
4796
4797Reason: A method that speeds query processing by running a query at the same time against several partitions of a table using multi processors is called parallel query processing. 79.
4798
4799Answer : (a)
4800 
4801
4802
480321 of 34	10/20/2016 12:12 PM
4804 
4805100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4806 
4807
4808
4809Reason: The protocol that ensures conflict serializability is time stamp ordering protocol.
4810
481180. Answer : (c)
4812
4813Reason: Indexes are created in most RDBMS’s to Provide rapid, random and sequential access to base-table data
4814
4815DATABASE MANAGEMENT SYSTEM SET 9
4816
4817
4818Database Management System
4819
4820Questions 81 To 90
4821
482281.
4823
4824What does the following SQL statement do?
4825
4826Select * From Customer Where Cust_Type = “Best”;
4827
4828(a)
4829
4830Selects all the fields from the Customer table for each row with a customer labeled “best”
4831
4832(b)
4833
4834Selects the “*” field from the Customer table for each row with a customer labeled “best”
4835
4836(c)
4837
4838Selects fields with a “*” in them from the Customer table
4839
4840(d)
4841
4842Selects all the fields from the Customer table for each row with a customer labeled “*”
4843
4844(e)
4845
4846Counts all records and displays the value. 82.
4847
4848In an SQL statement, which of the following parts states the conditions for row selection?
4849
4850(a) Select
4851
4852(b) From
4853
4854(c) Order By
4855
4856(d) Group By
4857
4858(e)
4859 
4860
4861
486222 of 34	10/20/2016 12:12 PM
4863 
4864100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4865 
4866
4867
4868Where.
4869
487083.
4871
4872Which of the following questions is answered by the SQL statement?
4873
4874Select Count (Product_Description) from Product_T;
4875
4876(a)
4877
4878How many products are in the Product Table?
4879
4880(b)
4881
4882How many different product descriptions are in the Product Table?
4883
4884(c)
4885
4886How many characters are in the field name “Product_Description”?
4887
4888(d)
4889
4890How many different columns named “Product Description” is there in table Product_T?
4891
4892(e)
4893
4894How many total records in a table? 84.
4895
4896All of the following are advantages of SQL-invoked routines
4897
4898EXCEPT
4899
4900(a) Flexibility
4901
4902(b) Efficiency
4903
4904(c) Sharability
4905
4906(d) Security
4907
4908(e)
4909
4910Easy of use. 85.
4911
4912A type of query that is placed within a WHERE or HAVING clause of another query is called
4913
4914(a)
4915
4916Master query
4917
4918(b)
4919
4920Sub query
4921 
4922
4923
492423 of 34	10/20/2016 12:12 PM
4925 
4926100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4927 
4928
4929
4930(c)
4931
4932Super query
4933
4934(d) Multi-query
4935
4936(e)
4937
4938Co-related query. 86.
4939
4940Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary locks are acquired before any are released?
4941
4942(a)
4943
4944Record controller
4945
4946(b)
4947
4948Exclusive lock
4949
4950(c)
4951
4952Authorization rule
4953
4954(d)
4955
4956Two phase lock
4957
4958(e)
4959
4960Three Phase lock. 87.
4961
4962Out of the following activities, which is the one that normally performed by DBMS, without the interference of the DBA?
4963
4964(a) Integrity
4965
4966(b) Retention
4967
4968(c) Security
4969
4970(d)
4971
4972Granting the Privileges
4973
4974(e)
4975
4976Recovery.
4977
497888.
4979
4980Horizontal Fragmentation is
4981
4982(a)
4983
4984Divide the data up by logical groups of records
4985
4986(b)
4987 
4988
4989
499024 of 34	10/20/2016 12:12 PM
4991 
4992100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
4993 
4994
4995
4996Divide the data up by logical groups of attributes
4997
4998(c)
4999
5000Divide the data up by logical groups of entities
5001
5002(d)
5003
5004Divide the data up by logical groups of files
5005
5006(e)
5007
5008Divide the data up by logical frames. 89.
5009
5010An index record appears for every search key value in the file is
5011
5012(a)
5013
5014Secondary index
5015
5016(b)
5017
5018Dense index
5019
5020(c)
5021
5022Sparse index
5023
5024(d)
5025
5026Multi level index
5027
5028(e)
5029
5030B+ tree. 90.
5031
5032Which of the following type of index is automatically created when we do not specify?
5033
5034(a) Bitmap
5035
5036(b)
5037
5038Balanced Tree Index
5039
5040(c)
5041
5042Binary Tree Index
5043
5044(d) Hashed
5045
5046(e)
5047
5048Sparse Index.
5049
5050
5051Answers 81.
5052
5053Answer : (a) Reason: Select 82.
5054 
5055
5056
505725 of 34	10/20/2016 12:12 PM
5058 
5059100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
5060 
5061
5062
5063Answer : (e)
5064
5065Reason: In an SQL statement where clause states the conditions for row selection
5066
506783.
5068
5069Answer : (b)
5070
5071Reason: How many different product descriptions are in the Product Table?
5072
507384.
5074
5075Answer : (d) Reason: Security 85.
5076
5077Answer : (b)
5078
5079Reason: Sub-query that is placed within a WHERE or HAVING clause of another query
5080
508186.
5082
5083Answer : (d)
5084
5085Reason: Two-phase lock is a procedure for acquiring the necessary locks for a transaction where all necessary locks are acquired before any are released
5086
508787.
5088
5089Answer : (e)
5090
5091Reason: Recovery is the one that normally is performed by DBMS, without the interference of the DBA
5092
509388.
5094
5095Answer : (a)
5096
5097Reason: Divide the data up by logical groups of records. 89.
5098
5099Answer : (b)
5100
5101Reason: Dense Index record appears for every search key valued in the file.
5102
510390.
5104
5105Answer : (b)
5106
5107Reason: Balanced Tree Index is automatically created when we do not specify.
5108
5109
511091.
5111
5112A database management software (DBMS) includes
5113
5114(a)
5115 
5116
5117
511826 of 34	10/20/2016 12:12 PM
5119 
5120100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
5121 
5122
5123
5124Automated tools (CASE) used to design databases and application programs
5125
5126(b)
5127
5128A software application that is used to define, create, maintain and provide controlled access to user databases
5129
5130(c)
5131
5132Application programs that are used to provide information to users
5133
5134(d)
5135
5136Database that contains occurrences of logically organised data or information
5137
5138(e)
5139
5140Repository of meta data, which is a central storehouse for all data definitions, data relationships,
5141
5142screen and report formats and other system components. 92.
5143
5144Making a change to the conceptual schema of a database but not affecting the existing external schemas is an example of
5145
5146(a)
5147
5148Physical data independence
5149
5150(b)
5151
5152Concurrency Control
5153
5154(c)
5155
5156Logical data independence
5157
5158(d)
5159
5160Functional dependency
5161
5162(e)
5163
5164Integrity Control. 93.
5165
5166If K is a foreign key in a relation R1, then
5167
5168(a)
5169
5170Every tuple of R1 has a distinct value for K
5171
5172(b)
5173
5174K cannot have a null value for tuples in R1
5175
5176(c)
5177
5178K is a key for some other relation
5179
5180(d)
5181
5182K is a Primary key for R1
5183 
5184
5185
518627 of 34	10/20/2016 12:12 PM
5187 
5188100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
5189 
5190
5191
5192(e)
5193
5194K is a Composite key for R1. 94.
5195
5196Which of the following concept is applicable with respect to 2NF?
5197
5198(a)
5199
5200Full functional dependency
5201
5202(b)
5203
5204Partial dependency
5205
5206(c)
5207
5208Transitive dependency
5209
5210(d)
5211
5212Non-transitive dependency
5213
5214(e)
5215
5216Data independence.
5217
5218
521995. State the unit of storage that can store one or more records in a hash file organization
5220
5221(a) Buckets
5222
5223(b)
5224
5225Disk pages
5226
5227(c) Blocks
5228
5229(d) Nodes
5230
5231(e)
5232
5233Baskets.
5234
5235
523696.
5237
5238Embedded SQL means
5239
5240(a)
5241
5242Using the EMBED key word in a SQL statement
5243
5244(b)
5245
5246Writing a SQL statement to retrieve data from more than one relation
5247
5248(c)
5249
5250Writing SQL statements within codes written in a general
5251 
5252
5253
525428 of 34	10/20/2016 12:12 PM
5255 
5256100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
5257 
5258
5259
5260programming language
5261
5262(d)
5263
5264Specifying a condition and action to be taken in case the given condition is satisfied in a trigger
5265
5266(e)
5267
5268Using SQL language constructs like revoke and grant respectively for revoking and granting privileges to users. 97.
5269
5270“In 1978 committee proposed a generalized framework for database systems and it provides a three_level architecture. The of the architecture defines user views of the database. The defines the physical view of the database. The defines the logical schema of the database.”
5271
5272Which of the following set is suitable to fill the blanks in the above paragraph?
5273
5274(a)
5275
5276	ANSI/ARPANET
5277
5278	Conceptual Level
5279
5280	External Level
5281
5282	Internal Level
5283
5284(b)
5285
5286	ANSI/SPARC
5287
5288	Conceptual Level
5289
5290	External Level
5291
5292	Internal Level
5293
5294(c)
5295
5296	.ANSI/ARPANET
5297
5298	External Level
5299
5300	Internal Level
5301
5302	Conceptual Level
5303
5304(d)
5305
5306	ANSI/SPARC
5307
5308	External Level
5309
5310	Internal Level
5311
5312	Conceptual Level
5313
5314(e)
5315
5316	W3C
5317
5318	Internal Level
5319 
5320
5321
532229 of 34	10/20/2016 12:12 PM
5323 
5324100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
5325 
5326
5327
5328	External Level
5329
5330	Conceptual Level. 98.
5331
5332Consider the following ER diagram depicting the relationship of an employee and supervisor:
5333
5334
5335What is the possible relation if the above ERD is mapped into a relational model?
5336
5337(a)
5338
5339Employee (EmpID, BirthDate, Salary, Name(FirstName,
5340
5341MiddleName, LastName))
5342
5343(b)
5344
5345Employee (EmpID, BirthDate, Salary, Name(FirstName,
5346
5347MiddleName, LastName)}
5348
5349(c)
5350
5351Supervision (EmpID, BirthDate, Salary, Name(FirstName,
5352
5353MiddleName, LastName), EmpID)
5354
5355(d)
5356
5357Supervisor (SupervisorID, BirthDate, Salary, Name(FirstName,
5358
5359MiddleName, LastName),EmpID), {EmpID})
5360
5361(e)
5362
5363Employee (EmpID, BirthDate, Salary, Name(FirstName,
5364
5365MiddleName, LastName), SupervisorID).
5366
536799.
5368
5369Select the correct statement from the following on proper naming of schema constructs:
5370
5371(a)
5372
5373Entity type name applies to all the entities belonging to that entity type and therefore a plural name is selected for entity type
5374
5375(b)
5376
5377In the narrative description of the database requirements, verbs tend to indicate the names of
5378
5379relationship types
5380
5381(c)
5382
5383The nouns arising from a database requirement description can be considered as names of attributes
5384
5385(d)
5386 
5387
5388
538930 of 34	10/20/2016 12:12 PM
5390 
5391100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
5392 
5393
5394
5395Additional nouns which are appearing in the narrative description of the database requirements
5396
5397represent the weak entity type names
5398
5399(e)
5400
5401Adjectives written in the database requirement description help to identify the partial relationships among entities. 100.
5402
5403Consider the following table obtained using Student and Instructor relations.
5404
5405Fname :
5406
5407Ajith
5408
5409Sujith
5410
5411Kasun
5412
5413
5414Lname :
5415
5416Gamage
5417
5418Hewage
5419
5420Peiris
5421
5422Which relational algebra operation could have been applied on the pair of relations Student and Instructor to obtain the above data?
5423
5424(a)
5425
5426Student n Instructor
5427
5428(b)
5429
5430Instructor ÷ Student
5431
5432(c)
5433
5434Student – Instructor
5435
5436(d)
5437
5438Student ? Instructor
5439
5440(e)
5441
5442Instructor – Student.
5443
5444
5445Answers
5446
5447
544891.
5449
5450Answer : (b)
5451
5452Reason : A software application that is used to define, create, maintain and provide controlled access to user databases.
5453 
5454
5455
545631 of 34	10/20/2016 12:12 PM
5457 
5458100 TOP DATABASE MANAGEMENT SYSTEM Questions and Answe...	http://engineeringinterviewquestions.com/database-management-system-qu...
5459 
5460
5461
546292.
5463
5464Answer : (c)
5465
5466Reason : Logical data independence refers to making a change to the conceptual schema of a database but not affecting the existing external schemas.
5467
546893.
5469
5470Answer : (c)
5471
5472Reason : If k is a foreign key in a relation R1, then K is a key for some other relation.
5473
547494.
5475
5476Answer : (a)
5477
5478Reason : Full functional dependency is applicable with respect to 2NF.
5479
548095.
5481
5482Answer : (a)
5483
5484Reason : Buckets are used to store one or more records in a hash file organization.
5485
548696.
5487
5488Answer : (c)
5489
5490Reason : Embedded SQL refers to writing SQL statements within codes written in a general programming language. 97.
5491
5492Answer : (d)
5493
5494Reason : i).ANSI/SPARC ii) External Level iii)Internal Level iv) Conceptual Level
5495
549698.
5497
5498Answer : (e)
5499
5500Reason : Employee(EmpID, BirthDate, Salary, Name(FirstName, MiddleName, LastName),SupervisorID) is the possible relation if the given ERD is mapped into a relational data model.
5501
550299.
5503
5504Answer : (b)
5505
5506Reason : In the narrative description of the database requirements, verbs tend to indicate the names of relationship types.
5507
5508100. Answer : (e)
5509 
5510
5511
551232 of 34	10/20/2016 12:12 PM
5513 
5514Set - 3
5515
5516
5517	Which data structure allows deleting data elements from front and inserting at rear? a. Stacks
5518b. Queues c. Deques
5519d. Binary search tree
5520
5521	Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
5522a. Input-restricted deque b. Output-restricted deque c. Priority queues
5523d. None of above
5524
5525	Which of the following data structure is non-linear type?
5526
5527	Strings
5528	Lists
5529	Stacks
5530	None of above
5531
5532	Which of the following data structure is linear type? a. Strings
5533b. Lists
5534c.  Queues
5535d. All of above
5536
5537	To represent hierarchical relationship between elements, which data structure is suitable? a. Deque
5538b. Priority c. Tree
5539d. All of above
5540
5541	A binary tree whose every node has either zero or two children is called
5542
5543	Complete binary tree
5544	Binary search tree
5545	Extended binary tree
5546	None of above
5547
55487.	The depth of a complete binary tree is given by
5549	Dn = n log2n
5550	Dn = n log2n+1
5551	Dn = log2n
5552
5553	Dn = log2n+1
5554 
5555
5556	When representing any algebraic expression E which uses only binary operations in a 2-tree, a. the variable in E will appear as external nodes and operations in internal nodes
5557b. the operations in E will appear as external nodes and variables in internal nodes c. the variables and operations in E will appear only in internal nodes
5558d. the variables and operations in E will appear only in external nodes
5559
5560	A binary tree can easily be converted into q 2-tree
5561
5562	by replacing each empty sub tree by a new internal node
5563	by inserting an internal nodes for non-empty node
5564	by inserting an external nodes for non-empty node
5565	by replacing each empty sub tree by a new external node
5566
5567	When converting binary tree into extended binary tree, all the original nodes in binary tree
5568
5569are
5570a. internal nodes on extended tree b. external nodes on extended tree c. vanished on extended tree
5571d. None of above
5572
5573	The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
5574
5575	ABFCDE
5576	ADBFEC
5577	ABDECF
5578	ABDCEF
5579
5580	Which of the following sorting algorithm is of divide-and-conquer type? a. Bubble sort
5581b. Insertion sort c. Quick sort d. All of above
5582
5583	An algorithm that calls itself directly or indirectly is known as
5584
5585	Sub algorithm
5586	Recursion
5587	Polish notation
5588	Traversal algorithm
5589
5590	In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
5591a. Leaf b. branch c. path d. thread
5592
5593	The in order traversal of tree will yield a sorted listing of elements of tree in
5594 
5595	Binary trees
5596
5597	Binary search trees
5598	Heaps
5599	None of above
5600
560116. In a Heap tree
5602
5603a. Values in a node is greater than every value in left sub tree and smaller than right sub tree b. Values in a node is greater than every value in children of it
5604c. Both of above conditions applies d. None of above conditions applies
5605
560617. In a graph if e=[u, v], Then u and v are called a. endpoints of e
5607
5608b. adjacent nodes c. neighbors
5609
5610d. all of above
5611
561218. A connected graph T without any cycles is called a. a tree graph
5613
5614b. free tree c. a tree
5615d. All of above
5616
561719. In a graph if e=(u, v) means
5618
5619	u is adjacent to v but v is not adjacent to u
5620	e begins at u and ends at v
5621
5622	u is processor and v is successor
5623	both b and c
5624
562520. If every node u in G is adjacent to every other node v in G, A graph is said to be
5626
5627	isolated
5628	complete
5629	finite
5630	strongly connected
5631
5632
5633
5634
5635
5636
5637
5638
5639Answers:
5640 
5641
5642
5643	Which data structure allows deleting data elements from front and inserting at rear? b. Queues
5644
5645	Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
5646a. Input-restricted deque
5647
5648	Which of the following data structure is non-linear type?
5649
5650d. None of above
5651
5652	Which of the following data structure is linear type? d. All of above
5653
5654	To represent hierarchical relationship between elements, which data structure is suitable? c. Tree
5655
5656	A binary tree whose every node has either zero or two children is called
5657
5658c. Extended binary tree
5659
5660	The depth of a complete binary tree is given by d. Dn = log2n + 1
5661
5662	When representing any algebraic expression E which uses only binary operations in a 2-tree, a. the variable in E will appear as external nodes and operations in internal nodes
5663
5664	A binary tree can easily be converted into q 2-tree
5665
5666d. by replacing each empty sub tree by a new external node
5667
5668	When converting binary tree into extended binary tree, all the original nodes in binary tree
5669
5670are
5671a. internal nodes on extended tree
5672
5673	The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
5674
5675c.  ABDECF
5676
5677	Which of the following sorting algorithm is of divide-and-conquer type? c. Quick sort
5678
5679	An algorithm that calls itself directly or indirectly is known as
5680
5681b. Recursion
5682
568314. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
5684
5685d. thread
5686 
5687
5688	The in order traversal of tree will yield a sorted listing of elements of tree in b. Binary search trees
5689
5690	In a Heap tree
5691
5692b. Values in a node is greater than every value in children of it
5693
5694	In a graph if e=[u, v], Then u and v are called d. all of above
5695
5696	A connected graph T without any cycles is called d. All of above
5697
5698	In a graph if e=(u, v) means d. both b and c
5699
5700	If every node u in G is adjacent to every other node v in G, A graph is said to be b. complete
5701 
5702Set - 2
5703
5704
5705
5706
57071. The memory address of the first element of an array is called
5708
5709	floor address
5710
5711	foundation address
5712	first address
5713	base address
5714
5715
5716
5717
57182. The memory address of fifth element of an array can be calculated by the formula
5719
5720	LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
5721	LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
5722	LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
5723	None of above
5724
5725
5726
5727
57283. Which of the following data structures are indexed structures?
5729
5730	linear arrays
5731
5732	linked lists
5733	both of above
5734	none of above
5735
5736
5737
5738
57394. Which of the following is not the required condition for binary search algorithm?
5740
5741	The list must be sorted
5742
5743	there should be the direct access to the middle element in any sublist
5744	There must be mechanism to delete and/or insert elements in list
5745	none of above
5746 
5747
5748
5749
5750
57515. Which of the following is not a limitation of binary search algorithm?
5752 
5753	must use a sorted array
5754
5755	requirement of sorted array is expensive when a lot of insertion and deletions are needed
5756	there must be a mechanism to access middle element directly
5757	binary search algorithm is not efficient when the data elements are more than 1000.
5758
5759
5760
5761
57626. Two dimensional arrays are also called
5763
5764	tables arrays
5765
5766	matrix arrays
5767
5768	both of above
5769	none of above
5770
5771
5772
5773
57747. A variable P is called pointer if
5775
5776	P contains the address of an element in DATA.
5777
5778	P points to the address of first element in DATA
5779	P can store only memory addresses
5780	P contain the DATA and the address of DATA
5781
5782
5783
5784
57858. Which of the following data structure can't store the non-homogeneous data elements?
5786
5787	Arrays
5788
5789	Records
5790	Pointers
5791	None
5792
5793
5794
5795
57969. Which of the following data structure store the homogeneous data elements?
5797
5798	Arrays
5799
5800	Records
5801	Pointers
5802	None
5803
5804
5805
5806
580710. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
5808 
5809	elementary items
5810
5811	atoms
5812	scalars
5813	all of above
5814
5815
5816
5817
581811. The difference between linear array and a record is
5819
5820	An array is suitable for homogeneous data but hte data items in a record may have different data type
5821
5822	In a record, there may not be a natural ordering in opposed to linear array.
5823	A record form a hierarchical structure but a lienear array does not
5824	All of above
5825
5826
5827
5828
582912. Which of the following statement is false?
5830
5831	Arrays are dense lists and static data structure
5832
5833	data elements in linked list need not be stored in adjecent space in memory
5834	pointers store the next data element of a list
5835	linked lists are collection of the nodes that contain information part and next pointer
5836
5837
5838
5839
584013. Binary search algorithm can not be applied to
5841
5842	sorted linked list
5843
5844	sorted binary trees
5845	sorted linear array
5846	pointer array
5847
5848
5849
5850
585114. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
5852
5853	underflow
5854
5855	overflow
5856	housefull
5857	saturated
5858 
5859
5860
5861
5862
586315. The situation when in a linked list START=NULL is
5864 
5865	underflow
5866
5867	overflow
5868	housefull
5869	saturated
5870
5871
5872
5873
587416. Which of the following is two way list?
5875
5876	grounded header list
5877
5878	circular header list
5879
5880	linked list with header and trailer nodes
5881	none of above
5882
5883
5884
5885
588617. Which of the following name does not relate to stacks?
5887
5888	FIFO lists
5889
5890	LIFO list
5891	Piles
5892	Push-down lists
5893
5894
5895
5896
589718. The term "push" and "pop" is related to the
5898
5899	array
5900
5901	lists
5902	stacks
5903	all of above
5904
5905
5906
5907
590819. A data structure where elements can be added or removed at either end but not in the middle
5909
5910	Linked lists
5911
5912	Stacks
5913	Queues
5914	Deque
5915
5916
5917
5918
591920. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
5920 
5921	FAEKCDBHG
5922
5923	FAEKCDHGB
5924	EAFKHDCBG
5925	FEAKDCHBG
5926
5927
5928
5929
5930
5931Answers
5932
5933
5934
5935
5936
5937
5938
5939	The memory address of the first element of an array is called d. base address
5940
5941
5942	The memory address of fifth element of an array can be calculated by the formula
5943
5944a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
5945
5946
5947	Which of the following data structures are indexed structures? a. linear arrays
5948
5949
5950	Which of the following is not the required condition for binary search algorithm? c. There must be mechanism to delete and/or insert elements in list
5951
5952
5953	Which of the following is not a limitation of binary search algorithm?
5954
5955d. binary search algorithm is not efficient when the data elements are more than 1000.
5956
5957
5958	Two dimensional arrays are also called c. both of above
5959
5960
5961	A variable P is called pointer if
5962
5963a. P contains the address of an element in DATA.
5964 
5965
5966
59678. Which of the following data structure can't store the non-homogeneous data elements?
5968 
5969a. Arrays
5970
5971
5972	Which of the following data structure store the non-homogeneous data elements? b. Records
5973
5974
5975	Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
5976d. all of above
5977
5978
5979	The difference between linear array and a record is
5980
5981d. All of above
5982
5983
5984	Which of the following statement is false? c. pointers store the next data element of a list
5985
5986
5987	Binary search algorithm can not be applied to a. sorted linked list
5988
5989
5990	When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
5991
5992b. overflow
5993
5994
5995	The situation when in a linked list START=NULL is
5996
5997a. underflow
5998
5999
6000	Which of the following is two way list? d. none of above
6001
6002
6003	Which of the following name does not relate to stacks? a. FIFO lists
6004
6005
6006	The term "push" and "pop" is related to the c. stacks
6007
6008
6009	A data structure where elements can be added or removed at either end but not in the middle
6010 
6011d. Deque
6012
6013
601420. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
6015
6016b. FAEKCDHGB
6017 
6018Set - 1
6019
6020
6021	Two main measures for the efficiency of an algorithm are a. Processor and memory
6022b. Complexity and capacity c. Time and space
6023d. Data and space
6024
6025
6026	The time factor when determining the efficiency of algorithm is measured by a. Counting microseconds
6027b. Counting the number of key operations c. Counting the number of statements
6028
6029d. Counting the kilobytes of algorithm
6030
6031
6032
6033
6034	The space factor when determining the efficiency of algorithm is measured by a. Counting the maximum memory needed by the algorithm
6035b. Counting the minimum memory needed by the algorithm c. Counting the average memory needed by the algorithm
6036
6037d. Counting the maximum disk space needed by the algorithm
6038
6039
6040
6041
6042	Which of the following case does not exist in complexity theory
6043
6044	Best case
6045	Worst case
6046	Average case
6047	Null case
6048
6049
6050
6051
6052	The Worst case occur in linear search algorithm when a. Item is somewhere in the middle of the array
6053b. Item is not in the array at all
6054c. Item is the last element in the array
6055d. Item is the last element in the array or is not there at all
6056
6057
6058
6059
6060	The Average case occur in linear search algorithm
6061
6062	When Item is somewhere in the middle of the array
6063	When Item is not in the array at all
6064 
6065	When Item is the last element in the array
6066
6067	When Item is the last element in the array or is not there at all
6068
6069
6070
6071
60727. The complexity of the average case of an algorithm is
6073
6074	Much more complicated to analyze than that of worst case
6075	Much more simpler to analyze than that of worst case
6076	Sometimes more complicated and some other times simpler than that of worst case
6077	None or above
6078
6079
6080
6081
6082	The complexity of linear search algorithm is a. O(n)
6083b. O(log n) c. O(n2)
6084
6085d. O(n log n)
6086
6087
6088
6089
6090	The complexity of Binary search algorithm is a. O(n)
6091b. O(log ) c. O(n2)
6092
6093d. O(n log n)
6094
6095
6096
6097
6098	The complexity of Bubble sort algorithm is a. O(n)
6099b. O(log n) c. O(n2)
6100
6101d. O(n log n)
6102
6103
6104
6105
6106	The complexity of merge sort algorithm is a. O(n)
6107b. O(log n) c. O(n2)
6108
6109d. O(n log n)
6110
6111
6112
6113
6114	The indirect change of the values of a variable in one module by another module is called
6115 
6116	internal change
6117
6118	inter-module change
6119	side effect
6120	side-module update
6121
6122
6123
6124
6125	Which of the following data structure is not linear data structure? a. Arrays
6126b. Linked lists c. Both of above d. None of above
6127
6128
6129
6130	Which of the following data structure is linear data structure?
6131
6132	Trees
6133	Graphs
6134	Arrays
6135	None of above
6136
6137
6138
6139
6140	The operation of processing each element in the list is known as a. Sorting
6141b. Merging c. Inserting d. Traversal
6142
6143
6144
6145	Finding the location of the element with a given value is:
6146
6147	Traversal
6148	Search
6149	Sort
6150	None of above
6151
6152
6153
6154
615517. Arrays are best data structures
6156
6157	for relatively permanent collections of data
6158	for the size of the structure and the data in the structure are constantly changing
6159	for both of above situation
6160	for none of above situation
6161 
6162
616318. Linked lists are best suited
6164
6165	for relatively permanent collections of data
6166	for the size of the structure and the data in the structure are constantly changing
6167	for both of above situation
6168	for none of above situation
6169
6170
6171
6172
6173	Each array declaration need not give, implicitly or explicitly, the information about a. the name of array
6174b. the data type of array
6175c. the first data from the set to be stored d. the index set of the array
6176
6177
6178
6179	The elements of an array are stored successively in memory cells because
6180
6181	by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
6182	the architecture of computer memory does not allow arrays to store other than serially
6183	both of above
6184	none of above
6185
6186
6187
6188Answers
6189
6190
6191
6192
6193
6194	Two main measures for the efficiency of an algorithm are c. Time and space
6195
6196	The time factor when determining the efficiency of algorithm is measured by b. Counting the number of key operations
6197
6198	The space factor when determining the efficiency of algorithm is measured by a. Counting the maximum memory needed by the algorithm
6199
6200	Which of the following case does not exist in complexity theory
6201
6202d. Null case
6203
62045. The Worst case occur in linear search algorithm when d. Item is the last element in the array or is not there at all
6205 
6206
6207	The Average case occur in linear search algorithm a. When Item is somewhere in the middle of the array
6208
6209	The complexity of the average case of an algorithm is
6210
6211a. Much more complicated to analyze than that of worst case
6212
6213	The complexity of linear search algorithm is a. O(n)
6214
6215	The complexity of Binary search algorithm is b. O(log n)
6216
6217	The complexity of Bubble sort algorithm is c. O(n2)
6218
6219	The complexity of merge sort algorithm is d. O(n log n)
6220
6221	The indirect change of the values of a variable in one module by another module is called c. side effect
6222
6223	Which of the following data structure is not linear data structure?
6224
6225d. None of above
6226
6227	Which of the following data structure is linear data structure? c. Arrays
6228
6229	The operation of processing each element in the list is known as d. Traversal
6230
6231	Finding the location of the element with a given value is:
6232
6233b. Search
6234
623517. Arrays are best data structures
6236
6237a. for relatively permanent collections of data
6238
623918. Linked lists are best suited
6240
6241b. for the size of the structure and the data in the structure are constantly changing
6242
6243	Each array declaration need not give, implicitly or explicitly, the information about c. the first data from the set to be stored
6244
6245	The elements of an array are stored successively in memory cells because
6246
6247a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
6248 
6249
6250 
6251System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6252
6253
6254	Structured English is used to describe
6255
6256	how programs are to be written
6257
6258	processes in a DFD in a reasonably precise manner
6259
6260	how DFDs are used in data processing
6261
6262	data flows in DFD
6263
6264	Structured English is a
6265
6266	structured programming language
6267
6268	description of processes in simple English
6269
6270	method of describing computational procedures reasonably precisely in English
6271	natural language based algorithmic language
6272
6273	The objective of using structured English is to
6274
6275	describe computational procedures reasonably precisely which can be understood by any user
6276	expand a DFD so that a user can understand it
6277
6278	develop algorithms corresponding to processes in a DFD
6279
6280	ease writing programs for DFDs
6281
62826.4	Structured English  description  of  processes
6283
6284	should be understandable to a user of a computer based system
6285
6286	should be understandable to a programmer
6287
6288	can be descriptive in nature
6289
6290	should be translatable by a compiler
6291
6292	i and iii
6293
6294	ii and iv
6295
6296	i, ii and iv
6297
6298	i and ii
6299
6300	A decision table is
6301
6302	a truth table
6303
6304	a table which facilitates taking decisions
6305
6306	a table listing conditions and actions to be taken based on the testing of conditions
6307 
6308
6309
6310V. Rajaraman/IISc. Bangalore	M6/V1/July 04/1
6311 
6312System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6313
6314
6315	a table in a Decision Support System
6316
6317	A decision table
6318
6319	has a structured English equivalent representation
6320
6321	cannot be represented using structured English
6322
6323	does not have an equivalent algorithmic representation
6324
6325	cannot be used to represent processes in a DFD
6326
6327	A decision table is preferable when the number of
6328
6329	conditions to be checked in a procedure is small
6330
6331	conditions to be checked in a procedure is large
6332
6333	actions to be carried out are large
6334
6335	actions to be carried out are small
6336
63376.8  Select  from the	following list which are appropriate to use in structured
6338English	description	of	a	process
6339
6340(i)process inventory records
6341
6342(ii)find the sum of outstanding billed amounts (iii)check if outstanding amount >= Rs. 5000 (iv)check if stock is low
6343	i and ii
6344
6345	i and iii
6346
6347	iii and iv
6348
6349	ii and iii
6350
6351	Structured English statements must be
6352
6353	short and clear
6354
6355	specified quantitatively
6356
6357	specified qualitatively
6358
6359	detailed and descriptive
6360
6361	Select statements from the following list which may be used in structured English
6362
6363(i)if marks are too low fail student (ii)if marks >=60 enter first class (iii)if average height select candidate
6364 
6365
6366
6367V. Rajaraman/IISc. Bangalore	M6/V1/July 04/2
6368 
6369System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6370
6371
6372(iv)if weight < 40 kg. reject candidate
6373
6374	i and ii
6375
6376	ii and iii
6377
6378	iii and iv
6379
6380	ii and iv
6381
63826.11 Select	correct	decision	structures	from	the	following
6383
6384
6385(i)if total marks>=75
6386
6387then enter distinction in student record end if
6388	if   total marks >=50
6389
6390then enter pass in student record else enter fail in student record
6391end if
6392
6393	if   total marks >=60
6394
6395then enter first class in student record else if total marks>= 50
6396then enter second class in student record else
6397enter fail in student record end if
6398
6399end if
6400
6401	if   attendance <30%
6402
6403then
6404
6405do not admit in examination
6406
6407else
6408
6409	ii and iii
6410
6411	i and ii
6412
6413	iii and iv
6414
6415	i and iv
6416 
6417
6418
6419
6420
6421
6422V. Rajaraman/IISc. Bangalore	M6/V1/July 04/3
6423 
6424System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6425
6426
64276.12 The	following	structured	English	procedure	is	incorrect	because
6428
6429
6430if balance in account <=0
6431
6432then
6433
6434{issue exception note to dept. mark “stop future issues” in departments record}
6435
6436else
6437
6438if balance in account <minimum balance
6439
6440then
6441
6442{ issue item to dept. issue warning to dept.}
6443end if end if
6444
6445	end if in second if is not needed
6446
6447	nesting of ifs is not correct
6448
6449	no action is specified when balance in account >=minimum balance
6450
6451	the value of minimum balance is not specified
6452
64536.13 The	following	structural	English	is	incorrect	because
6454	case (income slab)				
6455	Income slab =1 :	tax= 10%			
6456	Income slab =2 or 3 :	tax= 20%		
6457	Income slab =5 :	tax= 30%			
6458	end case					
6459
6460a. no action is specified for income slab of 4 b. income slab has to be rupees
6461c. income slab =2 or 3 is wrong d. number of cases is too small
6462 
6463
6464
6465
6466
6467
6468
6469
6470V. Rajaraman/IISc. Bangalore	M6/V1/July 04/4
6471 
6472System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6473
6474
64756.14	The  following  structured  English  procedure  is  incorrect  because
6476
6477
6478case (code)
6479
6480Code=2 : if purchase amount >=5000 then discount=5%
6481
6482Code=1 :discount=2%
6483
6484Code=3 :if purchase amount >=4000 then discount =2%
6485else if code=4
6486
6487then discount =5%
6488
6489end if
6490
6491None of the above codes : discount=0
6492
6493end case
6494
6495	code=2 should appear after code=1
6496
6497	if statement cannot be used within a case
6498
6499	code=4 should not be used in the action for code=3
6500
6501	The statement is correct
6502
65036.15  The	following	while	structure	is	wrong	because
6504
6505
6506balance =500
6507
6508while balance <=1000 do Write (amount due – balance) Read next record
6509
6510end while
6511
6512	read must appear before write
6513
6514	this loop will never terminate
6515
6516	no read allowed in a loop
6517
6518	the contents of next record is not known
6519
6520	Structured English description of data processing is a
6521
6522	non-procedural specification
6523
6524	procedural specification
6525 
6526
6527
6528
6529V. Rajaraman/IISc. Bangalore	M6/V1/July 04/5
6530 
6531System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6532
6533
6534	purely descriptive specification
6535
6536	very imprecise specification
6537
6538	Decision table description of data processing is
6539
6540	non-procedural specification
6541
6542	procedural specification
6543
6544	purely descriptive specification
6545
6546	very imprecise specification
6547
6548	In the following word statement the conditions are:“if a student gets 50 marks or more in mathematics and 40 marks or more in English he passes the examination, otherwise he fails”
6549	student passes the examination
6550
6551	student fails the examination
6552
6553	student gets 50 marks or more in mathematics
6554
6555	student mathematics marks >= 50 and student English marks
6556
6557	In the following word statement the actions are“if a student gets 50 marks or more in mathematics and 40 marks or more in English he passes the
6558examination,	otherwise	he	fails”
6559
6560(i)student passes the examination (ii)student fails the examination
6561(iii)student gets 50 marks or more in mathematics
6562
6563(iv)student mathematics marks >= 50 and student English marks >= 40
6564	i and ii
6565
6566	i and iii
6567
6568	ii and iii
6569
6570	iii and iv
6571
6572	In a limited entry decision table the condition stub
6573
6574	lists X or – corresponding to actions to be executed
6575
6576	lists the conditions to be tested
6577
6578	has Y or N or – entries
6579
6580	lists the actions to be taken
6581 
6582
6583
6584
6585V. Rajaraman/IISc. Bangalore	M6/V1/July 04/6
6586 
6587System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6588
6589
6590	In a limited entry decision table the condition entries
6591
6592	list X or – corresponding to actions to be executed
6593
6594	list the conditions to be tested
6595
6596	have Y or N or – entries
6597
6598	list the actions to be taken
6599
6600	In a limited entry decision table the action stub
6601
6602	lists X or – corresponding to actions to be executed
6603
6604	lists the conditions to be tested
6605
6606	has Y or N or – entries
6607
6608	lists the actions to be taken
6609
6610	In a limited entry decision table the action entries
6611
6612	list X or – corresponding to actions to be executed
6613
6614	list the conditions to be tested
6615
6616	have Y or N or – entries
6617
6618	list the actions to be taken
6619
6620	In a limited entry decision table the condition entries may be
6621
6622	Y or N only
6623
6624	Y, N or –
6625
6626	A binary digit
6627
6628	Any integer
6629
6630	In a limited entry decision table a—entry against a condition signifies that
6631
6632
6633	the outcome of testing the condition is irrelevant
6634
6635	it is an important condition
6636
6637	the condition should be tested
6638
6639	the condition is a Boolean condition
6640
6641	A rule in a limited entry decision table is a
6642
6643	row of the table consisting of condition entries
6644
6645	row of the table consisting of action entries
6646
6647	column of the table consisting of condition entries and the corresponding action entries
6648 
6649
6650
6651V. Rajaraman/IISc. Bangalore	M6/V1/July 04/7
6652 
6653System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6654 
6655
6656
6657	columns of the tables consisting of conditions of the stub
6658
6659	The conditions in the condition stub of a limited entry decision table
6660
6661	must be in sequential order
6662
6663	must be in the order in which they are to be tested
6664
6665	may be in any order
6666
6667	must be in the order in which they are to be executed
6668
6669	The actions in the action stub of a limited entry decision table
6670
6671	must be in sequential order
6672
6673	must be in the order in which they are to be tested
6674
6675	may be in any order
6676
6677	must be in the order in which they are to be executed
6678
6679	A X against an action in an action row signifies that the
6680
6681	action is not to be taken
6682
6683	action is to be taken
6684
6685	action is important
6686
6687	action is not important
6688
6689	A—against an action in an action row signifies that the
6690
6691	action is not to be taken
6692
6693	action is to be taken
6694
6695	action is important
6696
6697	action is not important
6698
6699	An extended entry decision table has
6700
6701	only Y, N or – entries
6702
6703	entries which extend the condition
6704
6705	questions asked extended into the condition entry part of the table
6706
6707	only numerical entries
6708
6709	An extended entry decision table
6710
6711	has no limited entry equivalent
6712
6713	cannot be replaced by a table with only Y, or – entries
6714
6715	may have Yes, No answers to conditions
6716
6717	can always be converted to an equivalent limited entry decision tabl
6718 
6719
6720
6721
6722V. Rajaraman/IISc. Bangalore	M6/V1/July 04/8
6723 
6724System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6725
6726
6727	An extended entry decision table is
6728
6729	very difficult to understand
6730
6731	quite concise compared to a limited entry decision table developed for the same task
6732	large compared to a limited entry table developed for the same task
6733
6734	is not very often used
6735
6736	A mixed entry decision table
6737
6738	may have some conditions with Y, N, or – entries
6739
6740	may not have any Y, N, or – entry
6741
6742	may have only non-numerical entries
6743
6744d.		may	mix	numerical	and	non-numerical	entries
6745				Given a decision table “test” shown below	
6746				R1	R2	R3			
6747C1				Y	N	Y			
6748									
6749C2				N	–	Y			
6750									
6751									
6752A1				X	––			Decision table–“test”	
6753A2				–	X	–			
6754									
6755A3			X	–	X			
6756
6757Answer the following questions:
6758
6759	Rule R1 is interpreted as follows:
6760
6761	If C1 is TRUE and C2 is FALSE then perform action A2
6762
6763	If C1 is TRUE and C2 is FALSE then perform action A1 and then action A2
6764	If C1 is TRUE and C2 is FALSE then perform action A3 and then action A1
6765	If C1 is TRUE and C2 is FALSE then perform action A1 and then action A3
6766
6767	Rule R3 is interpreted as follows:
6768 
6769
6770
6771
6772V. Rajaraman/IISc. Bangalore	M6/V1/July 04/9
6773 
6774System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6775
6776
6777	If C1 is TRUE and C2 is TRUE then perform action A1 and A
6778
6779	If C1 is TRUE or C2 is TRUE then perform action A3
6780
6781	If C1 is TRUE and C2 is TRUE then perform action A1 or A2
6782
6783	If C1 is TRUE and C2 is TRUE then perform action A3
6784
6785	Structured English equivalent of the decision table “test” are given below
6786
6787
6788	if C1 TRUE then if C2 TRUE
6789then do A3
6790
6791else do A1 and A3 end if
6792else do A2 end if
6793
6794	if C1 FALSE then do A2 else if C2 TRUE then do A3
6795else do A1 and A3 end if
6796end if
6797
6798(iii)if C2 TRUE then if C1 TRUE then do A3
6799
6800else do A2 end if
6801else do A1 and A3
6802
6803end if
6804
6805
6806(iv)if C2 FALSE
6807
6808then if C1 TRUE
6809
6810then do A1 and A3
6811 
6812
6813
6814V. Rajaraman/IISc. Bangalore	M6/V1/July 04/10
6815 
6816System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6817
6818
6819else do A2 end if else do A3 end if
6820
6821Which of the following are correct?
6822
6823	i and iii
6824
6825	i and ii
6826
6827	iii and iv
6828
6829	ii and iv
6830
6831	Structured English equivalents of decision table “test” are given below. Pick the right one
6832
6833(i)if C1 TRUE and C2 FALSE then R=1 end if if C1 FALSE then R=2 end if
6834if C1 TRUE and C2 TRUE then R=3 end if case (R)
6835R=1; perform actions A1 and A3 R=2; perform action A2
6836
6837R=3; perform action A3
6838
6839end case
6840
6841(ii)if C1 TRUE and C2 FALSE then perform actions A1,
6842
6843A3 end if
6844
6845if C1 FALSE then perform action A2 end if
6846
6847if C1 TRUE and C2 TRUE then perform action A3 end if
6848
6849
6850(iii)case (C1 TRUE and C2 FALSE) Rule R1 case (C1 FALSE) Rule R2
6851
6852case (C1 TRUE and C2 TRUE) Rule R3 end case
6853
6854(iv)if C1 TRUE and C2 TRUE then do Rule R3 end if
6855 
6856
6857
6858
6859
6860V. Rajaraman/IISc. Bangalore	M6/V1/July 04/11
6861 
6862System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6863 
6864
6865
6866if C1 TRUE and C2 FALSE then do Rule R1 end if if C1 TRUE then do Rule R2 end if
6867
6868	i and ii
6869
6870	i and iii
6871
6872	ii and iii
6873
6874	iii and iv
6875
6876a.   The Elementary Rule Decision Table equivalent of decision table “test” is
6877
6878C1				Y	N	Y
6879C2				N	N	Y
6880						
6881						
6882							
6883A1				X	–	–
6884A2				–	X	–
6885A3				X –			X
6886							
6887
6888
6889
6890
6891
6892
6893b.C1  Y				N	Y	
6894						
6895	C2				N	Y	Y
6896							
6897							
6898	A1				X	–	–
6899	A2				–	X	–
6900							
6901	A3				X	–	X
6902
6903
6904
6905c.C1				Y	N	N	Y
6906	C2				N	N	Y	Y
6907								
6908	A1				X	–	–	–
6909	A2				–	X	X	–
6910								
6911	A3					X –	–	X
6912 
6913
6914
6915
6916
6917V. Rajaraman/IISc. Bangalore	M6/V1/July 04/12
6918 
6919System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6920 
6921
6922
6923d.  C1					Y	N	N  Y
6924							
6925	C2				N	N	Y	Y
6926									
6927									
6928	A1				X	–	–	–
6929	A2				–	X	–	–
6930								
6931	A3				X	–	X	X
6932
6933
6934	The decision table “test” is
6935
6936	ambiguous
6937
6938	contradictory
6939
6940	incomplete
6941
6942	complete
6943
6944
6945Answer the following referring to the decision table “test2”
6946
6947				R1	R2	
6948						
6949						
6950	C1 : x <= 50			N	–	
6951	C2 : x >= 70			–	N	
6952						
6953						
6954	A1			X	–	
6955						
6956	A2			–	X	
6957
6958
6959Decision Table: “test2”
6960
6961	Decision table “test2” is
6962
6963	really incomplete
6964
6965	complete
6966
6967	apparently incomplete
6968
6969	apparently complete
6970
6971	Decision table “test2”
6972
6973	has a real ambiguity
6974
6975	has an apparent ambiguity
6976
6977	is logically correct
6978 
6979
6980
6981V. Rajaraman/IISc. Bangalore	M6/V1/July 04/13
6982 
6983System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
6984
6985
6986d.  is incomplete					
6987	C1				N	–
6988						
6989	C2				–	N
6990						
6991	A1				Y	–
6992	A2				Y	
6993						
6994
6995
6996DECISION TABLE “testing”–
6997
6998
69996.42 Decision	table	“testing”	can	be	made	complete
7000
7001(i)by putting an ELSE rule
7002
7003(ii)is as it is complete and does not need any more rules (iii)by specifying actions when C1 = Y and C2 = Y (iv)by specifying actions when C1 = N and C2 = N
7004	(i), (ii)
7005
7006	(i), (iii)
7007
7008	(ii), (iii)
7009
7010	(ii), (iv)
7011
70126.43 The	K-map	equivalent	of	decision  table  “test2”  is
7013C 1						
7014					C1	
7015						
7016
7017
7018
7019
7020
7021a.			Y	N	b.			Y	N
7022						C2			
7023	C2									
7024									
7025													
7026		Y			A1			Y		A1	A2
7027		N						N			
7028				A2	A1						
7029										A2	A1
7030													
7031													
7032 
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042V. Rajaraman/IISc. Bangalore	M6/V1/July 04/14
7043 
7044System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7045
7046
7047
7048
7049
7050
7051
7052c.							d.					
7053		C1							C1			
7054				Y	N						Y	N
7055																
7056																
7057	C2								C2					
7058														
7059																
7060																
7061		Y				A1			Y				A1
7062		N		A2	A1,A2			N		A2	A2
7063																
7064
7065
7066
7067
7068
7069
70706.44								The  decision  table  equivalent  of  the
7071following			structured		English	statement	is
7072						if		C2 TRUE		
7073						then	if		C1TRUE		
7074						then	do		A3		
7075						else	do		A2		
7076						end if					
7077						else	do		A1 and A3		
7078						end if					
7079									
7080a.C1				Y	Y	N				
7081	C2				Y	N	–				
7082											
7083	A1				–	–	X				
7084	A2				–	X	–				
7085											
7086	A3		X	–	X				
7087
7088
7089
7090
7091b.	C2	Y	Y	N
7092
7093
7094
7095
7096V. Rajaraman/IISc. Bangalore	M6/V1/July 04/15
7097 
7098System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7099
7100
7101	C1		Y	N	N
7102						
7103						
7104	A1		–	–	X
7105	A2		–	X	–
7106	A3		X	–	X
7107c.	C1		Y	N	–
7108					
7109	C2		Y	Y	N
7110						
7111						
7112	A1		–	–	X
7113	A2		–	X	–
7114	A3		X	–	X
7115d. C1	Y		N	Y		
7116						
7117	C2		Y	Y	N
7118						
7119						
7120	A1		–	–	X
7121	A2		–	X	–
7122					
7123	A3		X	–	X
7124
7125
7126
7127
7128	The decision table equivalent of the following structured English
7129
7130statement	is
7131
7132
7133if	balance in account <=0
7134
7135then{issue exception note to dept. and mark “stop future issues”} else if balance in account <min. balance
7136then {issue item to dept.
7137
7138issue warning to dept.}
7139 
7140
7141
7142
7143V. Rajaraman/IISc. Bangalore	M6/V1/July 04/16
7144 
7145System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7146 
7147
7148
7149else {issue item to dept.}
7150
7151end if end if
7152
7153C1=balance in account <=0; C2=balance in account < min. balance
7154
7155A1=issue exception note and mark “no future issues” A2=issue item to dept
7156A3=issue warning to dept.
7157
7158a.	C1				Y	N	N		
7159		C2				–	Y	N		
7160										
7161										
7162		A1				X	–	–		
7163		A2				–	X	X		
7164										
7165		A3				–	X	–		
7166b.	C1				Y	N	N		Y
7167									
7168		C2				N	Y	N		Y
7169										
7170		A1				X	–	–		–
7171										
7172		A2				–	X	X		X
7173		A3				–	X	–		–
7174c.	C1				N	N	N		
7175									
7176		C2				–	Y	N		
7177										
7178										
7179		A1				X	–	–		
7180		A2				–	X	X		
7181										
7182		A3				–	X	–		
7183 
7184
7185
7186
7187
7188
7189
7190V. Rajaraman/IISc. Bangalore	M6/V1/July 04/17
7191 
7192System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7193
7194
7195d.	C1	Y	N	Y
7196		C2	N	Y	N
7197					
7198					
7199		A1	X	–	–
7200		A2	–	X	X
7201	A3	–	X	–
7202
7203	The decision table given in answer (a) of question 9.4.3 is
7204
7205	incomplete
7206
7207	apparently ambiguous
7208
7209	has contradictory specifications
7210
7211	logically complete
7212
7213	The rule C1=Y, C2=Y in the decision table given in answer (a) of question 6.3.7 is
7214
7215	logically impossible
7216
7217	logically possible
7218
7219	has no action specified
7220
7221	has multiple actions specified
7222
7223	If min. balance > 0 then the rule C1=Y, C2= – in the decision table given in answer (a) of question 6.3.7 may be replaced by the rule
7224	C1=Y, C2=N
7225
7226	C1=Y, C2=Y
7227
7228	C1= –, C2=Y
7229
7230	C1= –, C2=N
7231
72326.49 The actions of a decision table are  mapped  on  a  K-map  shown be
7233
7234The boxes marked X denote impossible rules
7235
7236
7237				C1C2						
7238										
7239											
7240	C3			NN	NY	YYYN		
7241											
7242		Y		A1	A1	A2			
7243		N								
7244				A1	A2	A2			
7245											
7246											
7247 
7248
7249V. Rajaraman/IISc. Bangalore	M6/V1/July 04/18
7250 
7251System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7252
7253
7254
7255
7256
7257
7258The rule for action A1 may be represented by the following minimal Boolean expression
7259
7260	C1.C2 + C1.C2.C3
7261
7262	C1.C2.C3 + C1.C3
7263
7264	C1.C3 + C2
7265
7266d.  C1.C3 + C2.C1
7267
7268	The following decision table may be replaced by its best equivalent
7269
7270	shown										below:
7271		C1		N	N	N	N		Y	Y  Y	Y		
7272													
7273			C2		N	N	Y	Y		Y	Y	N	N
7274			C3		Y	N	N	Y		Y	N	N	Y
7275														
7276			A1	X	–	–	X		–	–	X	X
7277			A2	–	X	X	–		X	X	X	X
7278a.		C1	N	N	Y	Y						
7279			C2	–	–	Y	N						
7280			C3	Y	N	–	–						
7281													
7282													
7283			A1	X	–	–	X						
7284			A2	–	X	X	X						
7285												
7286b.		C1		–	Y	N	Y						
7287			C2		–	–	–	N						
7288			C3		N	–	Y	–						
7289														
7290														
7291			A1	–	–	X	X						
7292 
7293
7294
7295
7296V. Rajaraman/IISc. Bangalore	M6/V1/July 04/19
7297 
7298System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7299
7300
7301		A2				X	X	–	X		
7302c.	C1				N	–	Y	N	Y
7303									
7304		C2				–	Y	Y	–	N
7305		C3				N	N	–	Y		–
7306											
7307											
7308		A1				–	–	–	X	X
7309		A2				X	X	X	–	X
7310d.	C1				Y	N	N	Y		
7311										
7312		C2				–	–	–	N		
7313		C3				–	N	Y	–		
7314											
7315		A1				–	–	X	X		
7316											
7317						A2	X	X	–	X
7318
73196.51 The following decision table may be replaced by its best equivalent shown
7320
7321below:											
7322											
7323	C1				N	N	N	N	Y	Y  Y	Y	
7324	C2				N	N	Y	Y	Y	Y	N	N
7325	C3				Y	N	N	Y	Y	N	N	Y
7326												
7327	A1				X	–	–	X	–	–	X	X
7328												
7329	A2		–	X	X	–	X	X	X	X
7330
7331
7332
7333a.	C1		N	N	Y	Y
7334		C2		–	–	Y	N
7335		C3		Y	N	–	–
7336							
7337							
7338		A1		X	–	–	X
7339		A2		–	X	X	X
7340 
7341
7342
7343
7344V. Rajaraman/IISc. Bangalore	M6/V1/July 04/20
7345 
7346System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7347 
7348
7349
7350
7351
7352
7353b.	C1		–	Y	N	Y
7354		C2		–	–	–	N
7355		C3		N	–	Y	–
7356							
7357							
7358		A1		–	–	X	X
7359		A2		X	X	–	X
7360
7361
7362
7363
7364c.	C1				N	–	Y	N	Y
7365									
7366		C2				–	Y	Y	–	N
7367		C3				N	N	–	Y	–
7368										
7369										
7370		A1				–	–	–	X	X
7371		A2				X	X	X	–	X
7372
7373
7374
7375d.	C1		Y	N	N	Y		
7376		C2		–	–	–	N		
7377		C3		–	N	Y	–		
7378									
7379		A1		–	–	X	X		
7380									
7381				A2	X	X	–	X
7382
7383
7384
7385
73866.52   C1	N	N	N	N	Y	Y  Y	Y	
7387	C2	N	N	Y	Y	Y	Y	N	N
7388	C3	Y	N	N	Y	Y	N	N	Y
7389									
7390	A1	X	–	–	X	–	–	X	X
7391 
7392
7393
7394
7395V. Rajaraman/IISc. Bangalore	M6/V1/July 04/21
7396 
7397System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7398 
7399
7400
7401A2	–	X	X	–	X	X	X	X
7402
7403
7404
7405a.	C1		N	N	Y	Y
7406		C2		–	–	Y	N
7407		C3		Y	N	–	–
7408							
7409							
7410		A1		X	–	–	X
7411		A2		–	X	X	X
7412
7413
7414
7415b.	C1		–	Y	N	Y
7416		C2		–	–	–	N
7417		C3		N	–	Y	–
7418							
7419							
7420		A1		–	–	X	X
7421		A2		X	X	–	X
7422
7423
7424
7425
7426c.	C1				N	–	Y	N	Y
7427									
7428		C2				–	Y	Y	–	N
7429		C3				N	N	–	Y	–
7430										
7431										
7432		A1				–	–	–	X	X
7433		A2				X	X	X	–	X
7434
7435
7436
7437d.	C1		Y	N	N	Y	
7438		C2		–	–	–	N	
7439		C3		–	N	Y	–	
7440								
7441								
7442								
7443 
7444
7445V. Rajaraman/IISc. Bangalore	M6/V1/July 04/22
7446 
7447System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7448
7449
7450A1–	–	X	X	
7451A2	X	X	–	X
7452
74536.53	Given the	decision table “test 3”answer the following questions:
7454
7455
7456R1		R2	R3	R4		R5	R6	R7	R8
7457x>=20	Y	Y	Y	Y	N	N	N	N	
7458x<=30	Y	Y	N	N	Y	Y	N	N	
7459y>=x	Y	N	Y	N	Y	N	Y	N	
7460									
7461A1	X	X	X	X	–	–	–	–	
7462A2	–	–	–	–	X	X	–	–	
7463A3	–	–	–	–	–	–	X	X	
7464
7465	Rules R7, R8 are logically impossible
7466
7467	Rules R5, R6 are logically impossible
7468
7469	Rules R3, R4 are logically impossible
7470
7471	Rules R1, R2 are logically impossible
7472
7473	Pick the correct equivalent of “test 3”
7474
7475a. C1		Y		N		b.	C1				Y	N	N
7476													
7477								C2				–	Y	N
7478														
7479														
7480	A1				X	–								
7481														
7482	A2	–	X	A1				X	–	–
7483								A2				–	X	–
7484														
7485								A3				–	–	X
7486
7487
7488
7489c.  C1		Y	Y	N	N	d.   C1				Y	N	N
7490	C3		N	Y	N	Y		C2				–	Y	N
7491	C2		–	–	–	–								
7492														
7493														
7494	A1		X	X	–	–		A1				X	–	–
7495														
7496														
7497	A2		–	–	X	X		A2				–	X	–
7498 
7499
7500
7501V. Rajaraman/IISc. Bangalore	M6/V1/July 04/23
7502 
7503System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7504 
7505
7506
7507A3	–	–	X
7508
7509
7510
7511
7512	The decision table “test 3“ is
7513
7514	Incomplete
7515
7516	Ambiguous
7517
7518	Incorrect
7519
7520d.  .has redundancies
7521
7522	The decision table equivalent of the following Boolean expression is
7523
7524
7525
7526
7527
7528A1=  C3.C1.C2 + C2.C3.C1
7529
7530
7531A2=  C1.C3 + C3.C2.C1+ C1.C2.C3
7532
7533
7534
7535a.  C1		Y	Y	Y	N	N
7536	C2		Y	N	–	N	N
7537	C3		N	Y	Y	Y	N
7538							
7539							
7540	A1		X	X	–	–	–
7541							
7542	A2		–	–	X	X	X
7543
7544
7545
7546
7547b.  C1				Y	Y	Y	N	N
7548								
7549	C2				Y	N	N	N	N
7550	C3				Y	Y	–	Y	N
7551									
7552	A1				X	X	–	–	–
7553									
7554	A2				–	–	X	X	X
7555 
7556
7557
7558
7559
7560
7561
7562V. Rajaraman/IISc. Bangalore	M6/V1/July 04/24
7563 
7564System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7565 
7566
7567
7568c.  C2	Y	Y	Y	N	N
7569	C1	Y	N	–	N	N
7570	C3	N	Y	Y	Y	N
7571						
7572						
7573	A1	X	X	–	–	–
7574	A2	–	–	X	X	X
7575
7576
7577
7578d.  C1		Y	Y	Y	N	N
7579	C2		Y	N	–	N	N
7580	C3		N	Y	Y	Y	N
7581							
7582							
7583	A1		X	X	–	–	–
7584	A2		X	X	X	X	X
7585
7586	A decision table “test 4” is given below
7587
7588C1				Y	Y	N	–	–	N	Y	N
7589C2				Y	–	N	Y	–	N	N	–
7590C3				Y	Y	Y	–	Y	N	N	N
7591C4				–	Y	–	Y	N	–	–	N
7592											
7593A1				X	X	X	–	–	–	–	–
7594A2				–	–	–	X	X	–	–	–
7595											
7596A3				–	–	–	–	–	X	X	–
7597?				–	–	–	–	–	–	–	I
7598
7599
7600
7601where I indicates impossible rule
7602
7603
7604
7605
7606The contradictory rules are
7607
7608a.	YYYY, NYYY, NNYY
7609 
7610
7611
7612V. Rajaraman/IISc. Bangalore	M6/V1/July 04/25
7613 
7614System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7615
7616
7617	YYYN, NYYN, NNYN
7618
7619	YYYY, YYYN, NNYN
7620
7621	There are no contradictory rules
7622
7623	In “test 4” the contradictory actions are:
7624
7625	A1, A3
7626
7627	A1, A2
7628
7629	A2, A3
7630
7631	A2, I
7632
7633	In “test 4” missing rule is:
7634
7635	NYNN
7636
7637	NYYN
7638
7639	YYNN
7640
7641	YNYN
7642
7643	If in “test 4” the rules where the contradictory actions or unspecified actions are present, the action is replaced by A2 only, the reduced decision table using impossible rules also for reduction is:
7644
7645a.C1				–	–	–	–	–	N
7646	C2				N	–	Y	Y	–	N
7647	C3				Y	Y	–	Y	N	N
7648	C4				Y	N	Y	–	N	–
7649										
7650										
7651	A1				X	–	–	–	–	–
7652										
7653	A2				–	X	X	X	–	–
7654	A3				–	–	–	–	X	X
7655
7656
7657
7658
7659b.    C1	NY–––NN
7660
7661
7662
7663
7664V. Rajaraman/IISc. Bangalore	M6/V1/July 04/26
7665 
7666System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7667 
7668
7669
7670C2	N	N	Y	Y	–	–	N
7671C3	Y	Y	N	Y	Y	N	N
7672C4	Y	Y	Y	–	N	N	–
7673							
7674A1	X	X	–	–	–	–	–
7675A2	–	–	X	X	X	–	–
7676A3	–	–	–	–	–	X	X
7677
7678
7679
7680
7681
7682
7683c .	C1				–	–	–	–	N
7684		C2				N	–	Y	–	N
7685		C3				Y	Y	–	N	N
7686		C4				Y	N	Y	N	–
7687											
7688		A1				X	–	–	–	–
7689										
7690		A2				–	X	X	–	–
7691		A3				–	–	–	X	X
7692d .		C2				N	Y	–	N		
7693											
7694		C3				Y	–	Y	N		
7695		C4				Y	–	N	–		
7696											
7697											
7698		A1				X	–	–	–		
7699		A2				–	X	X	–		
7700		A3				–	–	–	X		
7701
77026.61 Decision Trees are preferred when
7703
7704	Too many conditions need to be tested
7705
7706	Sequencing of testing conditions is important
7707
7708	When there are many loops to be performed
7709
7710	When too many actions are to be taken
7711 
7712
7713
7714V. Rajaraman/IISc. Bangalore	M6/V1/July 04/27
7715 
7716System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7717
7718
7719	Decision Tables are preferred when
7720
7721	Too many conditions need to be tested
7722
7723	Sequencing of testing conditions is important
7724
7725	When there are many loops to be performed
7726
7727	When too many actions are to be taken
7728
7729	Structured English is preferred when
7730
7731	any conditions need to be tested
7732
7733	Sequencing of testing conditions is important
7734
7735	When there are many loops to be performed
7736
7737	When too many actions are to be taken
7738
7739	The objective of using decision trees is to
7740
7741	Expand a DFD so that a user can understand it
7742
7743	To specify sequence of conditions to be tested and actions to be taken
7744
7745	Describe a computational procedure that can be easily understood by a person
7746	Use it as a tool in decision support system
7747
7748	Decision trees are superior to decision tables when
7749
7750	The number of conditions to be tested is very large
7751
7752	When sequence of testing conditions is not particularly important
7753
7754	When sequence of testing conditions is not particularly important
7755
7756	When a large number of actions are to be specified
7757
7758	Logical correctness of a specifications can be systematically checked by
7759
7760	Using decision trees
7761
7762	Using structured English
7763
7764	Using DFD’s
7765
7766	Using decision tables
7767
7768	The decision tree equivalent of the following structured English is
7769
7770
7771if C2 then
7772
7773if C1
7774
7775then A3
7776 
7777
7778
7779
7780V. Rajaraman/IISc. Bangalore	M6/V1/July 04/28
7781 
7782System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7783
7784
7785else A2 endif
7786else A1,A3
7787
7788endif
7789
7790
7791
7792			A3
7793		Y	
7794	Y	C2	
7795			
7796a.		N	A2
7797	C1		
7798 
7799
7800N  
7801 
7802
7803A1, A3
7804
7805
7806
7807
7808
7809
7810Y	  A3
7811 
7812
7813b.
7814
7815Y
7816
7817
7818C2
7819 
7820
7821C1
7822
7823
7824
7825N
7826 
7827
7828
7829
7830
7831
7832A2
7833 
7834
7835N
7836 
7837
7838Y
7839
7840C1
7841 
7842
7843A1
7844 
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857Y
7858
7859c.
7860
7861C2
7862 
7863
7864
7865
7866N		A3
7867		
7868
7869
7870
7871	Y	A3
7872C1	N	A2
7873		
7874 
7875
7876
7877N
7878 
7879
7880A1, A3
7881 
7882
7883V. Rajaraman/IISc. Bangalore	M6/V1/July 04/29
7884 
7885System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7886
7887
7888
7889
7890
7891A2
7892
7893C1
7894d.
7895A3
7896
7897C2
7898
7899A1A3
7900
7901
7902	Decision tables are better then Decision trees when
7903
7904	Conditions are to be isolated from actions in a word statement
7905
7906	Condition sequences are to be found from a word statement
7907
7908	Logical correctness of a word statement is to be established
7909
7910	Large number of actions is to be performed
7911
7912	The decision table equivalent of the Decision tree of choice (a) of 6.5.7 is
7913
7914
7915a.										
7916	C2				Y	N	N	Y
7917								
7918	C1				N	Y	N	Y
7919										
7920										
7921	A1				X	-	X	-		
7922	A2				-	X	X	-		
7923	A3				X	-	-	X
7924								
7925										
7926
7927b.
7928
7929	C1		Y	Y	N	
7930	C2		Y	N	-	
7931						
7932						
7933	A1		-	-	X	
7934	A2		-	X	-	
7935	A3		X	-	X	
7936
7937c.
7938
7939			C1				Y	Y	N	
7940			C2				Y	N	Y	
7941										
7942										
7943			A1				-	-	X	
7944			A2				-	X	-	
7945			A3				X	-	X	
7946										
7947 
7948
7949V. Rajaraman/IISc. Bangalore	M6/V1/July 04/30
7950 
7951System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
7952 
7953
7954
7955
7956
7957
7958
7959d.
7960
7961		C1				Y	Y	N
7962		C2				Y	N	Y
7963											
7964											
7965		A1				-	-	X			
7966		A2				-	X	-	Error
7967		A3				X	-	X	
7968									
7969											
7970 
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021V. Rajaraman/IISc. Bangalore	M6/V1/July 04/31
8022 
8023System Analysis and Design/Structured Systems Analysis and Design Multiple Choice Questions
8024
8025
8026Key to Objective Questions											
80276.1	b	6.2	c	6.3	a		6.4	d	6.5	c	6.6	a		
80286.7	b	6.8	d	6.9		b		6.10	d	6.11	a	6.12	c	
80296.13	a	6.14	c	6.15		b		6.16	b	6.17		a	6.18		d
80306.19	a	6.20	b	6.21		c		6.22	d	6.23		a	6.24		b
80316.25	a	6.26	c	6.27		c		6.28	d	6.29		b	6.30		a
80326.31	c	6.32	d	6.33		b		6.34	a	6.35	d	6.36		d
80336.37	b	6.38	a	6.39		c		6.40	d	6.41		c	6.42		a
80346.43	b	6.44	c	6.45		c		6.46	a	6.47		d	6.48	b
80356.49	b	6.50	c	6.51		a		6.52	b	6.53		a	6.54	a
80366.55	d	6.56	a	6.57		c		6.58	b	6.59		c	6.60		d
80376.61	b	6.62	a	6.63		c	6.64	b	6.65	c	6.66		d
80386.67	c	6.68	c	6.69		b									
8039 
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078V. Rajaraman/IISc. Bangalore	M6/V1/July 04/32
8079 
8080100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8081 
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
80961. If there are multiple recycle bin for a hard disk
8097
8098
8099	you can set different size for each recycle bin
8100
8101	you can choose which recycle bin to use to store your deleted files
8102
8103	You can make any one of them default recycle bin
8104
8105	None of above
8106
8107
81082. Identify false statement
8109
8110
8111	You can find deleted files in recycle bin
8112
8113	You can restore any files in recycle bin if you ever need
8114
8115	You can increase free space of disk by sending files in recycle bin
8116
8117	You can right click and choose Empty Recycle Bin to clean it at once
8118
8119
81203. If the displayed system time and date is wrong, you can reset it using
8121
8122
8123	Write
8124
8125	Calendar
8126
8127	Write file
8128
8129	Control panel
8130
8131
81324. You should save your computer from?
8133
8134
8135	Viruses
8136
8137	Time bombs
8138
8139	Worms
8140
8141	All of the above
8142 
8143
8144
8145
8146
81472 of 29	10/20/2016 12:07 PM
8148 
8149100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8150 
8151
8152
81535. World Wide Web is being standard by
8154
8155
8156	Worldwide corporation
8157
8158	W3C
8159
8160	World Wide Consortium
8161
8162	World Wide Web Standard
8163
8164
81656. A co-processor
8166
8167
8168	Is relatively easy to support in software
8169
8170	Causes all processor to function equally
8171
8172	Works with any application
8173
8174	Is quite common in modern computer
8175
8176
81777. A Microsoft Windows is ….. a(n)
8178
8179
8180	Operating system
8181
8182	Graphic program
8183
8184	Word Processing
8185
8186	Database program
8187
8188
81898. Which of the following is program group?
8190
8191
8192	Accessories
8193
8194	Paint
8195
8196	Word
8197
8198	All of above
8199
8200
82019. Which is not application software?
8202
8203
8204	Windows NT
8205
8206	Page Maker
8207
8208	WinWord XP
8209
8210	Photoshop
8211
8212
821310. The ….. program compresses large files into a smaller file
8214
8215
8216a. WinZip
8217 
8218
8219
82203 of 29	10/20/2016 12:07 PM
8221 
8222	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8223
8224
8225	WinShrink
8226
8227	WinStyle
8228
8229	None of above
8230
8231
823211. Which of the following is an example of a real time operating system?
8233
8234
8235	Lynx
8236
8237	MS DOS
8238
8239	Windows XP
8240
8241	Process Control
8242
8243
824412. Which of the following operating system does not implement the multitasking truly?
8245
8246
8247	Windows 98
8248
8249	Windows NT
8250
8251	Windows XP
8252
8253	MS DOS
8254
8255
825613. Which of the following windows version support 64 bit processor?
8257
8258
8259	Windows 98
8260
8261	Windows 2000
8262
8263	Windows XP
8264
8265	Windows 95
8266
8267
826814. Which of the following Operating System does not implement multitasking truly?
8269
8270
8271	Windows 98
8272
8273	Windows NT
8274
8275	Windows XP
8276
8277	MS DOS
8278
8279
828015. What program runs first after computer is booted and loading GUI?
8281 
8282
8283
82844 of 29	10/20/2016 12:07 PM
8285 
8286	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8287
8288
8289	Desktop Manager
8290
8291	File Manager
8292
8293	Windows Explorer
8294
8295	Authentication
8296
8297
829816. Which of the following operating system do you choose to implement a client server network?
8299
8300
8301	MS DOS
8302
8303	Windows
8304
8305	Windows 98
8306
8307	Windows 2000
8308
8309
831017. Which of the following Operating systems is better for implementing a Client-Server network
8311
8312
8313	MS DOS
8314
8315	Windows 95
8316
8317	Windows 98
8318
8319	Windows 2000
8320
8321
832218. My Computer was introduced from
8323
8324
8325	Windows 3.1
8326
8327	Windows 3.11
8328
8329	Windows 95
8330
8331	Windows 98
8332
8333
833419. Which of the following Windows do not have Start button
8335
8336
8337	Windows Vista
8338
8339	Windows 7
8340
8341	Windows 8
8342
8343	None of above
8344
8345
834620. Which is the latest version of MS Windows?
8347
8348
8349a. Windows 2007
8350 
8351
8352
83535 of 29	10/20/2016 12:07 PM
8354 
8355	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8356
8357
8358	Windows 8.1
8359
8360	Windows 2008
8361
8362	Windows 7
8363
8364
836521. Which operating system doesn’t support networking between computers?
8366
8367
8368	Windows 3.1
8369
8370	Windows 95
8371
8372	Windows 2000
8373
8374	Windows NT
8375
8376
837722. Which Operating System doesn’t support networking between computers?
8378
8379
8380	Windows 3.1
8381
8382	Windows 95
8383
8384	Windows 2000
8385
8386	Windows NT
8387
8388
838923. Which of the following does not support more than one program at a time?
8390
8391
8392	DOS
8393
8394	Linux
8395
8396	Windows
8397
8398	Unix
8399
8400
840124. Which of the following is not an operating system?
8402
8403
8404	DOS
8405
8406	Linux
8407
8408	Windows
8409
8410	Oracle
8411
8412
841325. Linux is a(n) … operating system
8414
8415
8416a. Open source
8417 
8418
8419
84206 of 29	10/20/2016 12:07 PM
8421 
8422	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8423
8424
8425	Microsoft
8426
8427	Windows
8428
8429	Mac
8430
8431
843226. Which operating system can you give smallest file name?
8433
8434
8435	Ps/2
8436
8437	Dos
8438
8439	Windows
8440
8441	Windows NT
8442
8443
844427. Which one is not operating system?
8445
8446
8447	P11
8448
8449	OS/2
8450
8451	Windows
8452
8453	Unix
8454
8455
845628. Which of the following is not a multitasking operating system?
8457
8458
8459	Windows
8460
8461	Linux
8462
8463	Win NT
8464
8465	DOS
8466
8467
846829. You should choose Sleep option when
8469
8470
8471	The computer is tired after working for the whole day
8472
8473	You are leaving for a very short time and want to resume you work shortly
8474
8475	When computer gets hanged frequently. Let it sleep for some time
8476
8477	You finish working and going to bed
8478
8479
848030. The …. displays the name of every computer user on the computer
8481 
8482
8483
8484
8485
84867 of 29	10/20/2016 12:07 PM
8487 
8488	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8489
8490
8491	Wish list screen
8492
8493	Command screen
8494
8495	Welcome screen
8496
8497	None of the above
8498
8499
850031. The category of software most appropriate for controlling the design and layout of complex document like newsletters and brochure is:
8501
8502	Word processing
8503
8504	Computer aided design
8505
8506	Web page authoring
8507
8508	Desktop publishing
8509
8510
851132. Which one is not a system tool?
8512
8513
8514	Backup
8515
8516	Disk defragment
8517
8518	Virus scanning
8519
8520	All of the above
8521
8522
852333. The memory which allocates space for DOS and application is called
8524
8525
8526	Expanded memory
8527
8528	Cache memory
8529
8530	Virtual memory
8531
8532	Conventional memory
8533
8534
853534. The operating system creates … from the physical computer
8536
8537
8538	Virtual space
8539
8540	Virtual computer
8541
8542	Virtual device
8543
8544	None
8545
8546
854735. The operating system creates _____ from the physical computer
8548 
8549
8550
85518 of 29	10/20/2016 12:07 PM
8552 
8553	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8554
8555
8556	Virtual space
8557
8558	Virtual computers
8559
8560	Virtual device
8561
8562	None
8563
8564
856536. Which menu bar selection would you access to open file?
8566
8567
8568	Option
8569
8570	Help
8571
8572	View
8573
8574	None of above
8575
8576
857737. Which mode loads minimal set of drivers when starting Windows?
8578
8579
8580	Safe Mode
8581
8582	Normal Mode
8583
8584	VGA Mode
8585
8586	Network Support Mode
8587
8588
858938. Which of the following are loaded in safe mode?
8590
8591
8592	Keyboard driver
8593
8594	Mouse driver
8595
8596	VGA drive
8597
8598	All of above
8599
8600
860139. A …. is a named location on a disk where files are stored
8602
8603
8604	Folder
8605
8606	Pod
8607
8608	Version
8609
8610	None of the above
8611
8612
861340. Which command is used to see the version of operating system?
8614
8615
8616a. Vol
8617 
8618
8619
86209 of 29	10/20/2016 12:07 PM
8621 
8622	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8623
8624
8625	Version
8626
8627	Ver
8628
8629	None of the above
8630
8631
863241. Which type of command requires additional files to perform specific operations?
8633
8634
8635	Internal commands
8636
8637	External commands
8638
8639	Valuable commands
8640
8641	Primary commands
8642
8643
864442. Which of the following is system software?
8645
8646
8647	Operating system
8648
8649	Compiler
8650
8651	Utilities
8652
8653	All of the above
8654
8655
865643. A user-interface that is easy to use is considered to be
8657
8658
8659	User-happy
8660
8661	User-simple
8662
8663	User-friendly
8664
8665	None of the above
8666
8667
866844. A ….is a flash memory storage device that plugins into a USB port
8669
8670
8671	USB snap drive
8672
8673	USB flash drive
8674
8675	USB memory maker drive
8676
8677	None of above
8678
8679
868045. The ….is the drive containing the files to be copied
8681
8682
8683	Source drive
8684
8685	Destination drive
8686 
8687
8688
868910 of 29	10/20/2016 12:07 PM
8690 
8691	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8692
8693
8694	USB drive
8695
8696	None of the above
8697
8698
869946. The number of character contained in primary name (DOS)?
8700
8701
8702	Up to 8 characters
8703
8704	3 characters
8705
8706	Up to 10 characters
8707
8708	None of the above
8709
8710
871147. Which one of the following is not a multitasking operating system?
8712
8713
8714	DOS
8715
8716	Windows
8717
8718	Unix
8719
8720	Linux
8721
8722
872348. The most recent version of MAC OS is based on the … operating system
8724
8725
8726	Windows
8727
8728	Linux
8729
8730	Unix
8731
8732	CMOS
8733
8734
873549. The … operating system was initially created in the early 1970s at AT and T’s Bell Labs
8736
8737
8738	Linux
8739
8740	DOS
8741
8742	Unix
8743
8744	GNU
8745
8746
874750. Which command is used to undelete a bunch of files with extension .doc that you have just deleted?
8748 
8749
8750
8751
8752
875311 of 29	10/20/2016 12:07 PM
8754 
8755	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8756
8757
8758	Undelete
8759
8760	Undelete/all
8761
8762	Undelete *.doc
8763
8764	All of above
8765
8766
8767OPERATING SYSTEMS Interview Questions and
8768
8769Answers ::
8770
877151. Which command is used to display the contents of the text file of DOS?
8772
8773
8774	Copy con
8775
8776	Copy
8777
8778	Type
8779
8780	Dir
8781
8782
878352. In Windows, start button is used to
8784
8785
8786	Run applications
8787
8788	Device setting
8789
8790	Turn off the system
8791
8792	All of above
8793
8794
879553. Which of the following is an essential file of a MS-DOS boot disk?
8796
8797
8798	COMMAND.COM
8799
8800	START.COM
8801
8802	TREE.COM
8803
8804	VER.COM
8805
8806
880754. Which one is true for unconditional disk formatting?
8808
8809
8810	Destroys every byte of data on a disk by overwriting it with with blank spaces
8811
8812	Do not check/scan surface after format
8813
8814	Transfer system files after format
8815
8816	All of above
8817 
8818
8819
8820
8821
882212 of 29	10/20/2016 12:07 PM
8823 
8824100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8825 
8826
8827
882855. Once text has been cut to the clipboard, you can …..that text into another document
8829
8830
8831	Paste
8832
8833	Copy
8834
8835	Transfer
8836
8837	None of the above
8838
8839
884056. What is the function of radio button?
8841
8842
8843	To select multiple option
8844
8845	To select single option
8846
8847	To select all option
8848
8849	All of above
8850
8851
885257. The Banker’s algorithm is used
8853
8854
8855	to rectify deadlock
8856
8857	to detect deadlock
8858
8859	to prevent deadlock
8860
8861	to slove deadlock
8862
8863
886458. The primary purpose of an operating system is:
8865
8866
8867	To make the most efficient use of the computer hardware
8868
8869	To allow people to use the computer,
8870
8871	To keep systems programmers employed
8872
8873	To make computers easier to use
8874
8875
887659. The primary purpose of an operating system is a …
8877
8878
8879	To make the most efficient use of computer hardware
8880
8881	To allow people to use the computer
8882
8883	To keep system programmer employed
8884
8885	To make computer easier to use
8886
8887
888860. You can use print manage window
8889 
8890
8891
8892
8893
889413 of 29	10/20/2016 12:07 PM
8895 
8896	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8897
8898
8899	To check status of files in the print queue
8900
8901	To cancel the print job
8902
8903	To interrupt printing
8904
8905	All of the above
8906
8907
890861. Which of the following operating system reads and reacts in actual time?
8909
8910
8911	Quick Response System
8912
8913	Real Time System
8914
8915	Time Sharing System
8916
8917	Batch Processing System
8918
8919
892062. All of the following are TRUE regarding virtual memory
8921
8922EXCEPT
8923
8924
8925	Any amount of RAM can be allocated to virtual memory
8926
8927	The setting for the amount of hard disk drive space to allocate virtual memory can be manually change
8928
8929	This temporary storage is called the swap file or page file
8930
8931	Virtual memory is the physical space o the hard drive
8932
8933
893463. The essential difference between an operating system like Linux and one like Windows is that
8935
8936
8937	Windows can run with an Intel processor, whereas Linux cannot
8938
8939	Linux is a proprietary whereas Windows is not
8940
8941	There are multiple versions of Linux, but only one version of Windows
8942
8943	Any programmer can modify Linux code which is not permitted with Windows
8944
8945
894664. What is dispatch latency?
8947
8948
8949	The time taken by the dispatcher to stop one process and start another
8950
8951	The time taken by the processor to write a file into disk
8952 
8953
8954
895514 of 29	10/20/2016 12:07 PM
8956 
8957	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
8958
8959
8960	The whole time taken by all processor
8961
8962	None of Above
8963
8964
896565. A page fault occurs when
8966
8967
8968	the Deadlock happens
8969
8970	the Segmentation starts
8971
8972	the page is found in the memory
8973
8974	the page is not found in the memory
8975
8976
897766. Whenever you move a directory from one location to another
8978
8979
8980	All files inside the directory are moved
8981
8982	All the subdirectory inside that directory are moved
8983
8984	The directory is moved the source file is not moved
8985
8986	Both a and b
8987
8988
898967. The Basic Input Output System (BIOS) resides in
8990
8991
8992	RAM
8993
8994	ROM
8995
8996	The CPU
8997
8998	Memory Cache
8999
9000
900168. Which of the following does not occur during the power-on-self-test (POST)?
9002
9003
9004	The scandisk utility begins to run
9005
9006	The video card and video memory are tested
9007
9008	The BIOS identification process occurs
9009
9010	Memory chip are checked to ensure that they are working properly
9011
9012
901369. The maximum size of a write file is limited to only
9014
9015
9016	Name of the file
9017
9018	Extension of the file
9019 
9020
9021
902215 of 29	10/20/2016 12:07 PM
9023 
9024	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9025
9026
9027	The amount of memory in your computer
9028
9029	All of above
9030
9031
903270. Which of the following is drop down list?
9033
9034
9035	List
9036
9037	Combo box
9038
9039	Text area
9040
9041	None
9042
9043
904471. Recently deleted files are stored in
9045
9046
9047	Recycle bin
9048
9049	Desktop
9050
9051	Taskbar
9052
9053	My computer
9054
9055
905672. Which components appear in the initial Windows start up display?
9057
9058
9059	Dialog boxes
9060
9061	Start menu
9062
9063	Taskbar
9064
9065	All of above
9066
9067
906873. A small part of taskbar that has icons of background running applications is
9069
9070
9071	Start button
9072
9073	Quick launch
9074
9075	Task bar
9076
9077	System tray
9078
9079
908074. An operating system version designed for use with a media center PC is Microsoft Windows XP
9081
9082
9083	Home edition
9084
9085	Media center edition
9086 
9087
9088
908916 of 29	10/20/2016 12:07 PM
9090 
9091	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9092
9093
9094	Tablet PC edition
9095
9096	None of above
9097
9098
909975. An operating system version designed for use with a tablet PC is Microsoft Windows XP
9100
9101
9102	Home edition
9103
9104	Media center edition
9105
9106	Tablet PC edition
9107
9108	None of the above
9109
9110
911176. The date and time displays on
9112
9113
9114	Taskbar
9115
9116	Status bar
9117
9118	System tray
9119
9120	Launch pad
9121
9122
912377. …. runs on a computer hardware and serves as a platform for other system to run on
9124
9125
9126	Operating system
9127
9128	Application system
9129
9130	System software
9131
9132	All of above
9133
9134
913578. Which runs on computer hardware and serve as platform for other software to run on?
9136
9137
9138	Operating System
9139
9140	Application Software
9141
9142	System Software
9143
9144	All
9145
9146
914779. … is the program run on a computer when the computer boots up
9148
9149
9150a. System software
9151 
9152
9153
915417 of 29	10/20/2016 12:07 PM
9155 
9156	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9157
9158
9159	Operating system
9160
9161	System operations
9162
9163	None
9164
9165
916680. Which is the first program run on a computer when the computer boots up?
9167
9168
9169	System software
9170
9171	Operating system
9172
9173	System operations
9174
9175	None
9176
9177
917881. The ….contains commands associated with the My Computer window
9179
9180
9181	Standard menu
9182
9183	Start menu
9184
9185	System menu
9186
9187	None of the above
9188
9189
919082. …. is the layer of a computer system between the hardware and the user program
9191
9192
9193	Operating environment
9194
9195	Operating system
9196
9197	System environment
9198
9199	None of these
9200
9201
920283. Which is the layer of a computer system between the hardware and the user program
9203
9204
9205	Operating environment
9206
9207	Operating system
9208
9209	System environment
9210
9211	None
9212
9213
921484. When you start up the computer the boot up storage at which the BIOS versions manufacturer and data are displayed
9215 
9216
9217
921818 of 29	10/20/2016 12:07 PM
9219 
9220100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9221 
9222
9223
9224on the monitor is called
9225
9226
9227	Bootstrap
9228
9229	Power on self test (POST)
9230
9231	System configuration
9232
9233	Kernel loading
9234
9235
923685. The operating system is the most common type of …. Software
9237
9238
9239	Communication
9240
9241	Application
9242
9243	System
9244
9245	Word processing software
9246
9247
924886. Which of the following is/are external commands?
9249
9250
9251	Edit
9252
9253	Label
9254
9255	Sys
9256
9257	All of above
9258
9259
926087. Which is not an external command?
9261
9262
9263	Edit
9264
9265	XCOPY
9266
9267	Sys
9268
9269	None of the above
9270
9271
927288. Which of the following is not essential to shut down your computer?
9273
9274
9275	Save all opened files
9276
9277	Close all running applications
9278
9279	Switch off monitor
9280
9281	Cut off the power supply
9282
9283
928489. What is Dr. Watson?
9285 
9286
9287
928819 of 29	10/20/2016 12:07 PM
9289 
9290	TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...  http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9291
9292
9293	IT Expert
9294
9295	Diagnosis tool
9296
9297	Surgeon
9298
9299	None
9300
9301
930290. The command allows you to create logical drive
9303
9304
9305	Sort
9306
9307	Path
9308
9309	Subst
9310
9311	Batch
9312
9313
931491. The command used to create logical drive for specific location of disk
9315
9316
9317	Fdisk
9318
9319	Format
9320
9321	Subst
9322
9323	All of the above
9324
9325
932692. You can move a window to a different position on your screen by dragging it by its
9327
9328
9329	Move handle
9330
9331	Tail
9332
9333	Status bar
9334
9335	Title bar
9336
9337
933893. A bar that inform you the available options in your computer, opened applications, background running applications and can be used to switch between applications quickly is
9339
9340	Menu bar
9341
9342	Tool bar
9343
9344	Status bar
9345
9346	Task bar
9347 
9348
9349
9350
9351
935220 of 29	10/20/2016 12:07 PM
9353 
9354100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9355 
9356
9357
935894. Which components appear in the initial windows start up display?
9359
9360
9361	Dialog box
9362
9363	Task bar
9364
9365	Start menu
9366
9367	All of the above
9368
9369
937095. Taskbar is used for
9371
9372
9373	Navigation program
9374
9375	Switching between program
9376
9377	Start a program
9378
9379	All of above
9380
9381
938296. To install the new font
9383
9384
9385	Start -> setting -> control panel -> font
9386
9387	Start -> setting -> control panel -> font -> install new font
9388
9389	Start -> control panel -> font -> install new font
9390
9391	Start -> setting -> font
9392
9393
939497. When a peripheral device needs immediate attention from the operating system, it generates a(n)
9395
9396
9397	Interrupt
9398
9399	Spool
9400
9401	Stack
9402
9403	Page file
9404
9405
940698. Underlined text, such as text and folder names is referred to as
9407
9408
9409	Hyperlink
9410
9411	Menu
9412
9413	Source drive
9414
9415	None of these
9416 
9417
9418
9419
9420
942121 of 29	10/20/2016 12:07 PM
9422 
9423100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9424 
9425
9426
942799. Which of the following is suitable after you install new drivers?
9428
9429
9430	Shut Down
9431
9432	Restart
9433
9434	Sleep
9435
9436	Hibernate
9437
9438
9439100. Windows displays various options to shutdown. Which is suitable at the end of day?
9440
9441
9442	Shut Down
9443
9444	Restart
9445
9446	Sleep
9447
9448	Hibernate
9449
9450Q.No-Correct Answer
9451
9452
94531 – a
9454
9455
94562 – c
9457
9458
94593 – d
9460
9461
94624 – d
9463
9464
94655 – b
9466
9467
94686 – a
9469
9470
94717 – a
9472
9473
94748 – a
9475
9476
94779 – a
9478
9479
948010 – a
9481
9482
948311 – d
9484 
9485
9486
948722 of 29	10/20/2016 12:07 PM
9488 
9489100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9490 
9491
9492
949312 – d
9494
9495
949613 – a
9497
9498
949914 – d
9500
9501
950215 – d
9503
9504
950516 – d
9506
9507
950817 – d
9509
9510
951118 – c
9512
9513
951419 – c
9515
9516
951720 – b
9518
9519
952021 – a
9521
9522
952322 – a
9524
9525
952623 – a
9527
9528
952924 – d
9530
9531
953225 – a
9533
9534
953526 – b
9536
9537
953827 – a
9539
9540
954128 – d
9542
9543
954429 – b
9545
9546
954730 – c
9548 
9549
9550
9551
9552
955323 of 29	10/20/2016 12:07 PM
9554 
9555100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9556 
9557
9558
955931 – a
9560
9561
956232 – c
9563
9564
956533 – d
9566
9567
956834 – b
9569
9570
957135 – b
9572
9573
957436 – d
9575
9576
957737 – a
9578
9579
958038 – d
9581
9582
958339 – a
9584
9585
958640 – c
9587
9588
958941 – b
9590
9591
959242 – d
9593
9594
959543 – c
9596
9597
959844 – b
9599
9600
960145 – a
9602
9603
960446 – a
9605
9606
960747 – a
9608
9609
961048 – c
9611
9612
961349 – c
9614 
9615
9616
9617
9618
961924 of 29	10/20/2016 12:07 PM
9620 
9621100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9622 
9623
9624
962550 – c
9626
9627
962851 – c
9629
9630
963152 – d
9632
9633
963453 – a
9635
9636
963754 – a
9638
9639
964055 – a
9641
9642
964356 – b
9644
9645
964657 – c
9647
9648
964958 – a
9650
9651
965259 – a
9653
9654
965560 – d
9656
9657
965861 – b
9659
9660
966162 – a
9662
9663
966463 – d
9665
9666
966764 – a
9668
9669
967065 – d
9671
9672
967366 – d
9674
9675
967667 – b
9677
9678
967968 – a
9680 
9681
9682
9683
9684
968525 of 29	10/20/2016 12:07 PM
9686 
9687100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9688 
9689
9690
969169 – c
9692
9693
969470 – b
9695
9696
969771 – a
9698
9699
970072 – c
9701
9702
970373 – d
9704
9705
970674 – b
9707
9708
970975 – c
9710
9711
971276 – c
9713
9714
971577 – a
9716
9717
971878 – a
9719
9720
972179 – b
9722
9723
972480 – b
9725
9726
972781 – c
9728
9729
973082 – b
9731
9732
973383 – b
9734
9735
973684 – b
9737
9738
973985 – c
9740
9741
974286 – d
9743
9744
974587 – d
9746 
9747
9748
9749
9750
975126 of 29	10/20/2016 12:07 PM
9752 
9753100 TOP OPERATING SYSTEMS Multiple Choice Questions and Answe...	http://engineeringinterviewquestions.com/operating-systems-multiple-choi...
9754 
9755
9756
975788 – c
9758
9759
976089 – b
9761
9762
976390 – c
9764
9765
976691 – c
9767
9768
976992 – a
9770
9771
977293 – d
9773
9774
977594 – b
9776
9777
977895 – d
9779
9780
978196 – b
9782
9783
978497 – a
9785
9786
978798 – a
9788
9789
979099 – b
9791
9792
9793100 – a
9794
9795
9796
9797
9798
9799
9800
9801
9802
9803Posted in OPERATING SYSTEMS Questions and
9804
9805Answers Tagged Interview Questions and Answers pdf free Download-mcqs-objective type Engineering
9806
9807
9808100 TOP COMPUTER		100 TOP SOFTWARE
9809NETWORKS Multiple Choice	ENGINEERING Multiple
9810Questions and Answers	Choice Questions and
9811 
9812
9813
9814
9815
981627 of 29	10/20/2016 12:07 PM
9817 
9818100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
9819 
9820
9821
9822
9823
9824
9825
9826
9827
9828
9829
9830
9831
9832
9833
98341.Identify, from among the following, the correct statement.
9835
9836	One of the main challenges Software Engineering facing today is the requirement of most software systems to work with a multitude of homogenous systems
9837
9838	‘Legacy systems’ are custom developed software systems for the legal domain
9839
9840	Software does not wear-out in the traditional sense of the term, but software does tend to deteriorate as it evolves
9841
9842	Since software is essentially ‘intangible’ it is relatively easy to manage software projects
9843
9844	With the advent of component based software assembly, we find that only less than 20% of today’s software is still custom built.
9845
9846
98472.Software Engineering:
9848
9849	Is a set of rules about developing software products
9850
9851	Has been around as a discipline since the early 50’s
9852
9853	Started as a response to the so-called ‘Software Crisis’ of the late 90’s
9854
9855	Is an engineering discipline concerned with all the aspects of software production
9856
9857	Is now a mature discipline on par with other established engineering fields.
9858
98593.
9860
9861Read the following paragraph and identify the correct statement.
9862
9863“Imagine that you were recently hired as a software engineer to a company that specializes in aircraft navigation control software. While orientating yourselves to the company’s work practices, you observe that they in fact do not conduct a few tests that they should in order to comply with the relevant
9864 
9865
9866
9867
98682 of 39	10/20/2016 12:10 PM
9869 
9870100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
9871 
9872
9873
9874safety standard. When you inquire about this from the project manager, he dismisses it saying that those tests are really unnecessary (and takes an unreasonably long time to conduct, as well as being superfluous) and that they have managed with the other tests for so long, without any problems.”
9875
9876	You should immediately resign from the company and file a complaint with the relevant standard institution
9877
9878	You should do nothing and let the matter slide
9879
9880	Although you are new to the company, and you hardly know anything about the internal processes and politics, you should insist on the company changing its work practices immediately; failing which you threaten to report the matter
9881
9882	Since you are new to the company, and you are unfamiliar with the internal processes and politics, you should first find-out more about the issue and its background
9883
9884	None of the above statements are correct.
9885
98864.
9887
9888With regard to Evolutionary development, identify the correct statement.
9889
9890	Evolutionary development usually comes in two flavors; exploratory development, and throw-away prototyping
9891
9892	Very large projects are natural candidates for an evolutionary development based approach
9893
9894	Exploratory development is used in situations where most of the requirements are well understood in advance
9895
9896	One of the strong points of evolutionary development is that it facilitates easy project management, through the high volume of documentation it generates
9897
9898	Often the construction of a throw-away prototype is not followed by a reimplementation of the system using a more structured approach.
9899
99005.
9901
9902What is the fundamental reason that software cannot be considered to be engineered?
9903
9904	It is designed by humans and therefore flawed
9905
9906	Software engineering (as opposed to other forms of engineering, such as Civil) is an art – not a science
9907
9908	The discipline is relatively new, say in comparison to bridge
9909 
9910
9911
99123 of 39	10/20/2016 12:10 PM
9913 
9914100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
9915 
9916
9917
9918building that is an activity that has millennia of practice
9919
9920	None of these are true. Software Engineering is a truly rigorous discipline
9921
9922	The complexity of systems and their interaction continues faster than we can understand it.
9923
99246.
9925
9926The software life cycle can be said to consist of a series of phases. The classical model is referred to as the waterfall model. Which phase may be defined as “The concept is explored and refined, and the client’s requirements are elicited?”
9927
9928	Requirements (b) Specification (c) Design
9929
9930	Implementation (e) Integration.
9931
99327.
9933
9934The individual or organisation who wants a product to be developed is known as the:
9935
9936	Developer (b) User (c) Contractor (d) Initiator (e) Client.
9937
99388.
9939
9940Which of the following items should not be included in the software project management plan?
9941
9942	The techniques and case tools to be used
9943
9944	Detailed schedules, budgets and resource allocations
9945
9946	The life cycle model to be used
9947
9948	The organisational structure of the development organisation, project responsibilities, managerial objectives and priorities
9949
9950	None of the above.
9951
99529.
9953
9954The final form of testing COTS software is _________
9955
9956testing.
9957
9958	Unit (b) Integration (c) Alpha (d) Module (e) Beta.
9959
996010.
9961
9962In the maintenance phase the product must be tested against previous test cases. This is known as __________ testing.
9963
9964	Unit (b) Integration (c) Regression (d) Module (e) Beta.
9965
9966
9967Answers
9968 
9969
9970
9971
9972
99734 of 39	10/20/2016 12:10 PM
9974 
9975100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
9976 
9977
9978
99791.
9980
9981Answer : ©
9982
9983Reason: Remaining all are contradictory. 2.
9984
9985Answer : (d)
9986
9987Reason: Software crisis of the late 60’s . 3.
9988
9989Answer : (d)
9990
9991Reason: D is the appropriate choice. 4.
9992
9993Answer : (a)
9994
9995Reason: Evolutionary development usually comes in two flavors; exploratory development, and throw-away prototyping is the correct statement with respect to Evolutionary development.
9996
99975.
9998
9999Answer : (e)
10000
10001Reason: The fundamental reason that software can not be considered to be engineered is the complexity of systems and their interaction continues faster than we can understand it. 6.
10002
10003Answer : (a)
10004
10005Reason: In the requirements phase the concept is explored and refined and the clients requirements are elicited.
10006
100077.
10008
10009Answer : (e)
10010
10011Reason: The individual or organisation who wants a product to be developed is known as the client.
10012
100138.
10014
10015Answer : (e)
10016
10017Reason: The software project management plan should include: the life cycle model to be used, the organisational structure of the development organisation, project responsibilities, managerial objectives and priorities, the life cycle model to be used, detailed schedules, budgets and resource allocations.
10018
100199.
10020
10021Answer : (e)
10022 
10023
10024
100255 of 39	10/20/2016 12:10 PM
10026 
10027100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10028 
10029
10030
10031Reason: Beta testing occurs when a commercial form of the software is released to selected clients.
10032
1003310. Answer : ©
10034
10035Reason: Regression testing occurs when the product is tested against previous test cases. This most frequently occurs in the maintenance phase.
10036
10037
1003811.
10039
10040Which property of the rapid prototype is not important?
10041
10042	The speed with which it can be developed
10043
10044	The speed with which it can be modified
10045
10046	Its ability to determine the client’s real needs
10047
10048	The insights that the design team can gain from it, even if they are of the ‘how not to do it’ variety
10049
10050	Its internal structure.
10051
10052
1005312.
10054
10055
10056An example of the risk involved in software development is
10057
10058	Key personnel may resign before the product is complete
10059
10060	The manufacturer of critical components (e.g. the hardware associated with a real-time system) may go bankrupt
10061
10062	Technology changes may render the product obsolete
10063
10064	Competitors may market a fully functional lower-cost equivalent package
10065
10066	All of these are risks involved in software development.
10067
10068
1006913.
10070
10071
10072A simple way of looking at the spiral software life-cycle model is as a waterfall model with each phase proceeded by
10073
10074	Build-and-fix
10075
10076	Freezing
10077
10078	Synchronization
10079
10080	Testing
10081
10082	Risk analysis.
10083 
10084
10085
10086
10087
100886 of 39	10/20/2016 12:10 PM
10089 
10090100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10091 
10092
10093
1009414.
10095
10096
10097The degree of interaction between two modules is known as
10098
10099	Cohesion
10100
10101	Strength
10102
10103	Inheritance
10104
10105	Coupling
10106
10107	Instantiation.
10108
10109
1011015.
10111
10112
10113The relationship between a derived class (or subclass) and base class is referred to as
10114
10115	Association
10116
10117	Inheritance
10118
10119	Polymorphism
10120
10121	Instantiation
10122
10123	Aggregation.
10124
10125
1012616.
10127
10128
10129Myers (1978) identifies seven levels of cohesion. Which level of cohesion may be defined as followed; “the output from one element in the component serves as input for some other element”?
10130
10131	Communicational cohesion
10132
10133	Functional cohesion
10134
10135	Communicational cohesion
10136
10137	Temporal cohesion
10138
10139	None of these.
10140
10141
1014217.
10143
10144A design is said to be a good design if the components are
10145
10146	Strongly coupled
10147
10148	Weakly cohesive
10149
10150	Strongly coupled and Weakly cohesive
10151
10152	Strongly coupled and strongly cohesive
10153
10154	Strongly cohesive and weakly coupled.
10155 
10156
10157
101587 of 39	10/20/2016 12:10 PM
10159 
10160100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10161 
10162
10163
1016418.
10165
10166If a control switch is passed as an argument this is an example of _______ coupling.
10167
10168	Content
10169
10170	Common
10171
10172	Control
10173
10174	Stamp
10175
10176	Data.
10177
10178
1017919.
10180
10181Which of the following is a type of abstraction?
10182
10183	Data
10184
10185	Procedural
10186
10187	Iteration
10188
10189	All of the above
10190
10191	None of the above.
10192
10193
1019420.
10195
10196In the classical chief programmer team approach, the team member responsible for maintaining the detailed design and coding is
10197
10198	The chief programmer
10199
10200	The programming secretary
10201
10202	A specialized function that exists outside ‘the team’
10203
10204	The individual coder (i.e. programmer)
10205
10206	The back-up programmer.
10207
10208
10209Answers
10210
10211
1021211.
10213
10214Answer : (c)
10215
10216Reason: The sole use of the rapid prototype is to determine what the client’s real needs are as rapidly as possible. The rapid prototype is then effectively discarded so its internal structure is not relevant.
10217
1021812.
10219
10220Answer : (e)
10221
10222Reason: There are many risks involved in software
10223 
10224
10225
102268 of 39	10/20/2016 12:10 PM
10227 
10228100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10229 
10230
10231
10232development.
10233
1023413.
10235
10236Answer : (e)
10237
10238Reason: A simple way of looking at the spiral software life-cycle model is as a waterfall model with each phase proceeded by risk analysis.
10239
1024014.
10241
10242Answer : (d)
10243
10244Reason: The degree of interaction between two modules is known as coupling.
10245
1024615.
10247
10248Answer : (b)
10249
10250Reason: A derived class inherits all the attributes of a base class.
10251
1025216.
10253
10254Answer : (a)
10255
10256Reason: In communicational cohesion the output from one element in the component serves as input for some other element.
10257
1025817.
10259
10260Answer : (e)
10261
10262Reason: You should aim to maximize the interaction within a module and minimize the interaction between modules.
10263
1026418.
10265
10266Answer : (c)
10267
10268Reason: Two modules are control coupled if one passes an element of control to another.
10269
1027019.
10271
10272Answer : (d)
10273
10274Reason: The three types of abstraction (data, procedural and iteration) are all instances of the more general concept of information hiding.
10275
1027620.
10277
10278Answer : (d)
10279
10280Reason: In the classical chief programmer team approach, the team member responsible for maintaining the detailed design and coding is the individual coder (i.e. programmer).
10281 
10282
10283
10284
10285
102869 of 39	10/20/2016 12:10 PM
10287 
10288100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10289 
10290
10291
1029221.
10293
10294Internal costs include
10295
10296	Developers salaries
10297
10298	Managers and support personnel salaries
10299
10300	The cost of overheads such as utilities, rent and senior managers
10301
10302	Materials (such as manuals) and services such as travel
10303
10304	All of the above.
10305
10306
1030722.
10308
10309Problems with using Lines of Code to measure the size of a product include(s)
10310
10311	The creation of source code is only part of the development effort
10312
10313	The Lines of Code (LOC) will differ between languages and cannot be measured for some languages
10314
10315	Should comments, data definitions etc (i.e. non-executable LOC) be included as well?
10316
10317	The final size (kLOC) can only be determined once the product is delivered
10318
10319	All of the above.
10320
10321
1032223.
10323
10324Software Science bases its estimation of the size of a product on
10325
10326	Files (Fi), Flows (Fl) and Processes (Pr)
10327
10328	Lines of Code (kLOC)
10329
10330	Function Points (FP)
10331
10332	operands and operators
10333
10334	Feature Points (FeP).
10335
10336
1033724.
10338
10339In Intermediate COCOMO the mode that represents complex products is referred to as
10340
10341	Embedded
10342
10343	Semidetached
10344
10345	Organic
10346
10347	Multiplicative
10348
10349	Monolithic.
10350 
10351
10352
1035310 of 39	10/20/2016 12:10 PM
10354 
10355100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10356 
10357
10358
1035925.
10360
10361Work that continues throughout the project and does not relate to any specific phase of software development is termed a(n)
10362
10363	Milestone
10364
10365	Project function
10366
10367	Activity
10368
10369	Task
10370
10371	Baseline.
10372
10373
1037426.
10375
10376The advantage of following the IEEE Standard for drawing up a Software Project Management Plan (SPMP) – see IEEE Standard 1059.1 1987 – is
10377
10378	It is drawn up by representatives from major software development organisations
10379
10380	It is designed for all types of software products
10381
10382	It is a framework that can be used irrespective of process model or specific techniques
10383
10384	It can be tailored for each organisation for a particular application area, development team or technique.
10385
10386	All of the above.
10387
10388
1038927.
10390
10391The best way to test the Software Project Management Plan (SPMP) is by
10392
10393	Prototyping
10394
10395	Inspection
10396
10397	Simulation
10398
10399	Compilation
10400
10401	Debugging.
10402
10403
1040428.
10405
10406Algorithmic cost estimation in different organisations may be different for the same application development, because
10407
10408	Different organisations consider complexity factors differently
10409
10410	Different organisations may use different programming languages
10411 
10412
10413
1041411 of 39	10/20/2016 12:10 PM
10415 
10416100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10417 
10418
10419
10420	Developers’ skills may vary
10421
10422	Techniques for the measurement of productivity may vary
10423
10424	All of the above may be true.
10425
10426
1042729.
10428
10429The aim of software engineering is to produce software that is
10430
10431	Fault-free
10432
10433	Delivered on time
10434
10435	Delivered within budget
10436
10437	Satisfies users’ needs
10438
10439	All of these are the aims of software engineering.
10440
10441
1044230.
10443
10444Object-oriented concepts are not new. The first OO language was considered to be
10445
10446	ALGOL-68
10447
10448	FORTRAN 77
10449
10450	C
10451
10452	MODULA
10453
10454	SIMULA 67.
10455
10456
10457Answers
10458
10459
1046021.
10461
10462Answer : (a)
10463
10464Reason: Internal costs comprise all the costs to the developers. 22.
10465
10466Answer : (e)
10467
10468Reason: There are many problems with using Lines of Code to measure the size of a product.
10469
1047023.
10471
10472Answer : (d)
10473
10474Reason: Software Science bases its estimation of the size of a product on the number of operands and operators.
10475
1047624.
10477
10478Answer : (a)
10479
10480Reason: In Intermediate COCOMO there are three modes: organic, semidetached and imbedded.
10481 
10482
10483
1048412 of 39	10/20/2016 12:10 PM
10485 
10486100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10487 
10488
10489
1049025.
10491
10492Answer : (b)
10493
10494Reason: Work that continues throughout the project and does not relate to any specific phase of software development is termed a project function.
10495
1049626.
10497
10498Answer : (e)
10499
10500Reason: There are many advantages of using a standard. 27.
10501
10502Answer : (b)
10503
10504Reason: The best way to test the Software Project Management Plan (SPMP) is by a plan inspection by the SQA team. In order to further reduce risk the duration and cost estimates should further be independently computed by people other than the original project team.
10505
1050628.
10507
10508Answer : (e)
10509
10510Reason: Cost estimation incorporates a number of factors. 29.
10511
10512Answer : (e)
10513
10514Reason: The aim of software engineering is to produce software that is fault-free, delivered on time, delivered within budget, and satisfies users’ needs.
10515
1051630.
10517
10518Answer : (e)
10519
10520Reason: The first OO language was considered to be SIMULA 67.
10521
10522
1052331.
10524
10525Software engineering is the systematic approach to the
10526
10527(a)
10528
10529Development of software
10530
10531(b)
10532
10533Operation of software
10534
10535(c)
10536
10537Maintenance of software
10538
10539(d)
10540
10541Retirement of software
10542 
10543
10544
1054513 of 39	10/20/2016 12:10 PM
10546 
10547100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10548 
10549
10550
10551(e)
10552
10553All of the above.
10554
10555
1055632.
10557
10558Brooks’ view of the essence of software included
10559
10560(a)
10561
10562People, Quality, Process and Productivity
10563
10564(b)
10565
10566Performance, Robustness, Maintainability and Reusability
10567
10568(c)
10569
10570Complexity, Conformity, Changeability and Invisibility
10571
10572(d)
10573
10574Efficiency, Reliability, Usability and Robustness
10575
10576(e)
10577
10578Accuracy, Testability, Visibility and Changeability.
10579
10580
1058133.
10582
10583What is the essence of software engineering?
10584
10585(a)
10586
10587Requirements Definition, Design Representation, Knowledge
10588
10589Capture and Quality Factors
10590
10591(b)
10592
10593Maintaining Configurations, Organizing Teams, Channeling
10594
10595Creativity and Planning Resource Use
10596
10597(c)
10598
10599Time/Space Tradeoffs, Optimizing Process, Minimizing
10600
10601Communication and Problem Decomposition
10602
10603(d)
10604
10605Managing Complexity, Managing Personnel Resources, Managing Time and Money and Producing Useful Products
10606
10607(e)
10608
10609Maintaining Communication, Managing unuseful products and Not optimizing process.
10610
10611
1061234.
10613
10614Which of the following is a life-cycle concern?
10615
10616(a) Testing
10617 
10618
10619
1062014 of 39	10/20/2016 12:10 PM
10621 
10622100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10623 
10624
10625
10626(b) Portability
10627
10628(c) Programming
10629
10630(d) Planning
10631
10632(e)
10633
10634All of the above.
10635
10636
1063735.
10638
10639Which best captures the nature of the quality paradigm?
10640
10641(a)
10642
10643The Nature of Quality, A Process Perspective, Defect
10644
10645Elimination
10646
10647(b)
10648
10649Process, Product, People, Problem
10650
10651(c)
10652
10653Measurement, Quality Control, Validation
10654
10655(d)
10656
10657Feasibility, Requirements, Economics, Customer’s Needs
10658
10659(e)
10660
10661Analysis, Testing, Design.
10662
10663
1066436.
10665
10666Prototyping is appropriate for
10667
10668(a)
10669
10670Data-oriented applications
10671
10672(b)
10673
10674Applications with emphasis on the user interface
10675
10676(c)
10677
10678Applications which are highly interactive
10679
10680(d)
10681
10682Development teams who lack domain experience
10683
10684(e)
10685
10686All of the above.
10687
10688
1068937.
10690
10691What are the major activities of the spiral model of software
10692 
10693
10694
1069515 of 39	10/20/2016 12:10 PM
10696 
10697100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10698 
10699
10700
10701engineering?
10702
10703(a)
10704
10705Planning, Risk Analysis, Engineering, Customer Evaluation
10706
10707(b)
10708
10709Defining, Prototyping, Testing, Delivery
10710
10711(c) Requirements
10712
10713(d)
10714
10715Quick Design, Build Prototype, Evaluate Prototype, Refine
10716
10717Prototype
10718
10719(e)
10720
10721Testing.
10722
10723
1072438.
10725
10726In choosing a development life-cycle model, one would consider the
10727
10728(a)
10729
10730Development Group Expertise, Problem Characteristics, User
10731
10732Expectations
10733
10734(b)
10735
10736Languages, Development Schedule, Competition
10737
10738(c)
10739
10740System Context, User Population, Platforms
10741
10742(d)
10743
10744Organizational Structure, User Tasks, Performance Criteria
10745
10746(e)
10747
10748System Analysis, User interface, Testing.
10749
10750
1075139.
10752
10753What are the factors to be considered when planning a software development effort?
10754
10755(a)
10756
10757Performance, Problem, Product, Planning
10758
10759(b)
10760
10761People, Problem, Product, Process
10762
10763(c)
10764
10765People, Problem, Productivity, Performance
10766
10767(d)
10768 
10769
10770
1077116 of 39	10/20/2016 12:10 PM
10772 
10773100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10774 
10775
10776
10777People, Problem, Product, Portability
10778
10779(e)
10780
10781Productivity, Programming, Performance, Pay-Off.
10782
10783
1078440.
10785
10786Which of the following could be a deliverable for a software system?
10787
10788(a)
10789
10790Source Code
10791
10792(b)
10793
10794Reference Manual
10795
10796(c)
10797
10798Requirements Document
10799
10800(d)
10801
10802User’s Guide
10803
10804(e)
10805
10806All of the above.
10807
10808
10809Answers
10810
10811
1081231.
10813
10814Answer : (e)
10815
10816Reason: Software engineering is the systematic approach to the development of software , operation of software , maintenance of software and retirement of software .
10817
1081832.
10819
10820Answer : (c)
10821
10822Reason: Brooks’ view of the essence of software included Complexity, conformity, changeability &invisibility.
10823
1082433.
10825
10826Answer : (d)
10827
10828Reason: The essence of software engineering is managing complexity, personnel resources, time and money and producing useful products.
10829
1083034.
10831
10832Answer : (d)
10833
10834Reason: Planning is life-cycle concern. 35.
10835 
10836
10837
1083817 of 39	10/20/2016 12:10 PM
10839 
10840100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10841 
10842
10843
10844Answer : (a)
10845
10846Reason: Process perspective and defect elimination best captures the quality paradigm.
10847
1084836.
10849
10850Answer : (e)
10851
10852Reason: Prototyping seems appropriate for Data-oriented applications, Applications with emphasis on the user interface, Applications which are highly interactive and Development teams who lack domain experience
10853
1085437.
10855
10856Answer : (a)
10857
10858Reason: Planning , risk analysis ,engineering and customer evaluation are the important four major activities of the spiral model.
10859
1086038.
10861
10862Answer : (a)
10863
10864Reason: Choice A is the apt among all the answers for choosing a development life cycle model.
10865
1086639.
10867
10868Answer : (b)
10869
10870Reason: People, Problem, Product& Process factors are considered when planning a software development effort. 40.
10871
10872Answer : (e)
10873
10874Reason: Soruce code, reference manual ,requirements document and user’s guide are the deliverables for a software system.
10875
10876SOFTWARE ENGINEERING Interview Questions
10877
10878and Answers ::
10879
1088041.
10881
10882Which of the following is not viewed as a primary mover in
10883
10884improving the software process?
10885
10886(a)
10887
10888Increased Effectiveness
10889
10890(b)
10891
10892Better Product Quality
10893 
10894
10895
10896
10897
1089818 of 39	10/20/2016 12:10 PM
10899 
10900100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10901 
10902
10903
10904(c)
10905
10906Improved Staff Satisfaction
10907
10908(d)
10909
10910Reduced Costs
10911
10912(e)
10913
10914Tighter managerial control.
10915
10916
1091742.
10918
10919Symptoms of the software crisis would include
10920
10921(a)
10922
10923Software delivered behind schedule
10924
10925(b)
10926
10927Software exceeding cost estimate
10928
10929(c) Unreliable
10930
10931(d)
10932
10933Difficult to maintain
10934
10935(e)
10936
10937All of the above.
10938
10939
1094043.
10941
10942Which of the following projects would be a good one for adopting the prototyping paradigm for software development?
10943
10944(a)
10945
10946Accounting System
10947
10948(b) Spreadsheet
10949
10950(c)
10951
10952Automobile Cruise Control
10953
10954(d)
10955
10956Telephone Switching System
10957
10958(e)
10959
10960Algebra Tutor. 44.
10961
10962Views of quality software would not include
10963
10964(a)
10965
10966Optimizing price and performance
10967
10968(b)
10969 
10970
10971
1097219 of 39	10/20/2016 12:10 PM
10973 
10974100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
10975 
10976
10977
10978Minimizing the execution errors
10979
10980(c)
10981
10982Conformance to specification
10983
10984(d)
10985
10986Establishing valid requirements
10987
10988(e)
10989
10990Maximizing errors. 45.
10991
10992Software configuration activities would not include
10993
10994(a)
10995
10996Identify change
10997
10998(b)
10999
11000Control change
11001
11002(c)
11003
11004Ensure improper implementation of change
11005
11006(d)
11007
11008Report change to interested parties
11009
11010(e)
11011
11012All of the above. 46.
11013
11014In planning a software project one would
11015
11016(a)
11017
11018Find ways to produce results using limited resources
11019
11020(b)
11021
11022Pad the schedule to accommodate errors
11023
11024(c)
11025
11026Overestimate the budget
11027
11028(d)
11029
11030Structure the team to prevent administrative interference
11031
11032(e)
11033
11034All of the above. 47.
11035
11036A systematic approach to software development, as epitomized by the various life-cycle models, is useful in
11037
11038(a)
11039
11040Helping us understand the nature of the software product
11041
11042(b)
11043
11044Convincing the customer that we know what we are doing
11045 
11046
11047
1104820 of 39	10/20/2016 12:10 PM
11049 
11050100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11051 
11052
11053
11054(c)
11055
11056Filling texts on software engineering
11057
11058(d)
11059
11060Managing the various activities necessary to get the job done
11061
11062(e)
11063
11064Testing the entire project 48.
11065
11066A process view in software engineering would consider which of the following
11067
11068(a)
11069
11070Product performance
11071
11072(b) Staffing
11073
11074(c) Functionality
11075
11076(d) Reliability
11077
11078(e)
11079
11080Usability.
11081
1108249.
11083
11084Software measurement is useful to
11085
11086(a)
11087
11088Indicate quality of the product
11089
11090(b)
11091
11092Track progress
11093
11094(c)
11095
11096Assess productivity
11097
11098(d)
11099
11100Form a baseline for estimation and prediction
11101
11102(e)
11103
11104All of the above. 50.
11105
11106Which of the following is not a ‘concern’ during the management of a software project?
11107
11108(a) Money
11109
11110(b) Time
11111 
11112
11113
1111421 of 39	10/20/2016 12:10 PM
11115 
11116100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11117 
11118
11119
11120(c)
11121
11122Product quality
11123
11124(d)
11125
11126Project/product information
11127
11128(e)
11129
11130Product quantity.
11131
11132
11133Answers
11134
11135
1113641.
11137
11138Answer : (e)
11139
11140Reason: Tightermanageiral control is not viewed as a primary mover in improving the software process
11141
1114242.
11143
11144Answer : (e)
11145
11146Reason: When software delivered behind schedule, software exceeding cost estimate ,unreliable and difficult to maintain then it is said that software crisis.
11147
1114843.
11149
11150Answer : (e)
11151
11152Reason: Algebra Tutor would be a good candidate for adoting the prototyping paradigm.
11153
1115444.
11155
11156Answer : (b)
11157
11158Reason: minimizing the execution errors would not included in views of quality software.
11159
1116045.
11161
11162Answer : (c)
11163
11164Reason: Software configuration activities would include proper implementation of change.
11165
1116646.
11167
11168Answer : (a)
11169
11170Reason: In planning a software project I would find ways to produce results using limited resources
11171
1117247.
11173
11174Answer : (d)
11175
11176Reason: A systematic approach to software development, as epitomized by the various life-cycle models, is useful in
11177 
11178
11179
1118022 of 39	10/20/2016 12:10 PM
11181 
11182100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11183 
11184
11185
11186managing the various activities necessary to get the job done. 48.
11187
11188Answer : (b)
11189
11190Reason: Staffing is the apt choice among the given 49.
11191
11192Answer : (e)
11193
11194Reason: Software measurement is useful to , indicate quality of the product , track progress , assess productivity and form a baseline for estimation and prediction.
11195
1119650.
11197
11198Answer : (e)
11199
11200Reason: Product quantity would not include during the management of a software project.
11201
11202
1120351.
11204
11205What would be investigated during Requirements analysis?
11206
11207(a)
11208
11209System performance , Test Scheduling, Organizational Structure
11210
11211(b)
11212
11213Languages , Platforms, Competition
11214
11215(c)
11216
11217System Context , User Populations, User Tasks
11218
11219(d)
11220
11221Verification, Formal Methods, Accuracy
11222
11223(e)
11224
11225Validation, Informal methods, Inaccuracy. 52.
11226
11227Which of the following is not a description of planning?
11228
11229(a)
11230
11231Planning is used to find credible ways to produce results with limited resources and limited schedule flexibility
11232
11233(b)
11234
11235Planning is finding new personnel resources to support labor intensive development
11236
11237(c)
11238
11239Planning is identifying and accommodating the unforeseen
11240
11241(d)
11242 
11243
11244
1124523 of 39	10/20/2016 12:10 PM
11246 
11247100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11248 
11249
11250
11251Planning is blending the efforts of many people to produce a product that satisfies the customer’s need
11252
11253(e)
11254
11255Planning is negotiating compromises in completion dates and resource allocation.
11256
1125753.
11258
11259The information we need to capture during requirements analysis not include
11260
11261(a)
11262
11263Hiring Authority
11264
11265(b)
11266
11267Communication Paths
11268
11269(c) Synchronization
11270
11271(d)
11272
11273Temporal Dependencies
11274
11275(e)
11276
11277Data Aggregation. 54.
11278
11279What do you call when two modules are coupled, when they communicate via a composite data item?
11280
11281(a)
11282
11283Content coupling
11284
11285(b)
11286
11287Common coupling
11288
11289(c)
11290
11291Control coupling
11292
11293(d)
11294
11295Data coupling
11296
11297(e)
11298
11299Stamp coupling. 55.
11300
11301Which among the following measures how strongly the elements within a module are related?
11302
11303(a) Coupling
11304
11305(b) Cohesion
11306 
11307
11308
1130924 of 39	10/20/2016 12:10 PM
11310 
11311100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11312 
11313
11314
11315(c) Aggregation
11316
11317(d) Inheritance
11318
11319(e)
11320
11321Abstraction.
11322
1132356.
11324
11325What do you call, when the elements of a module, all operate on the same data?
11326
11327(a)
11328
11329Functional cohesion
11330
11331(b)
11332
11333Temporal cohesion
11334
11335(c)
11336
11337Procedural cohesion
11338
11339(d)
11340
11341Communicational cohesion
11342
11343(e)
11344
11345Coincidental cohesion. 57.
11346
11347Which tests are designed to confront the program with abnormal situations?
11348
11349(a)
11350
11351Recovery testing
11352
11353(b)
11354
11355Security testing
11356
11357(c)
11358
11359Stress testing
11360
11361(d)
11362
11363Performance testing
11364
11365(e)
11366
11367Usage testing. 58.
11368
11369To which software category does Knowledge based system belongs?
11370
11371(a)
11372
11373System software
11374
11375(b)
11376 
11377
11378
1137925 of 39	10/20/2016 12:10 PM
11380 
11381100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11382 
11383
11384
11385Real time software
11386
11387(c)
11388
11389Embedded software
11390
11391(d)
11392
11393Personnel software
11394
11395(e)
11396
11397Artificial Intelligent software. 59.
11398
11399Which is not involved in software development process?
11400
11401(a) People
11402
11403(b) Problem
11404
11405(c) Practice
11406
11407(d) Process
11408
11409(e)
11410
11411Product.
11412
1141360.
11414
11415Which of the following are direct measures?
11416
11417I. Size.
11418
11419II. Effort.
11420
11421III. Schedule.
11422
11423IV. Quality.
11424
11425(a)
11426
11427Both (I) and (II) above
11428
11429(b)
11430
11431Both (I) and (III) above
11432
11433(c)
11434
11435Both (I) and (IV) above
11436
11437(d)
11438
11439Both (II) and (III) above
11440
11441(e)
11442
11443All (I), (II), (III) and (IV) above.
11444
11445
11446Answers
11447 
11448
11449
11450
11451
1145226 of 39	10/20/2016 12:10 PM
11453 
11454100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11455 
11456
11457
1145851.
11459
11460Answer : (c)
11461
11462Reason: C is the right choice. 52.
11463
11464Answer : (b)
11465
11466Reason: Planning is finding new personnel resources to support labor intensive development is not descriptive of planning
11467
1146853.
11469
11470Answer : (a)
11471
11472Reason: The information we need to capture during requirements analysis would probably not include hiring Authority .
11473
1147454.
11475
11476Answer : (e)
11477
11478Reason: Stamp coupling is that when two modules are coupled if they communicate via composite data item.
11479
1148055.
11481
11482Answer : (b)
11483
11484Reason: Cohesion measures how strongly the elements within a module are related.
11485
1148656.
11487
11488Answer : (d)
11489
11490Reason: when the elements of a module all operate on the same data we call it as a communicational cohesion.
11491
1149257.
11493
11494Answer : (c)
11495
11496Reason: Stress testing is to confront the program with abnormal situations.
11497
1149858.
11499
11500Answer : (e)
11501
11502Reason: Artificial Intelligent software belongs to knowledge based system.
11503
1150459.
11505
11506Answer : (c)
11507
11508Reason: practice is not involved in software development process.
11509
1151060.
11511 
11512
11513
1151427 of 39	10/20/2016 12:10 PM
11515 
11516100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11517 
11518
11519
11520Answer : (e)
11521
11522Reason: size, effort, schedule and quality are the direct measures.
11523
11524
1152561.
11526
11527How does a software project manager need to act to minimize the risk of software failure?
11528
11529(a)
11530
11531Double the project team size
11532
11533(b)
11534
11535Request a large budget
11536
11537(c)
11538
11539Form a small software team
11540
11541(d)
11542
11543Track progress
11544
11545(e)
11546
11547Request for more period of time. 62.
11548
11549To be an effective aid in process improvement the baseline metrics used must be
11550
11551(a)
11552
11553Based on reasonable estimates from failed projects
11554
11555(b)
11556
11557Measured consistently across projects
11558
11559(c)
11560
11561Drawn from large projects only
11562
11563(d)
11564
11565Based only on successful projects
11566
11567(e)
11568
11569Drawn from failed projects. 63.
11570
11571Empirical estimation models are typically based on
11572
11573(a)
11574
11575Expert judgment based on past project experiences
11576
11577(b)
11578
11579Refinement of current project estimation
11580
11581(c)
11582
11583Regression models derived from historical project data
11584 
11585
11586
1158728 of 39	10/20/2016 12:10 PM
11588 
11589100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11590 
11591
11592
11593(d)
11594
11595Trial and error determination of the parameters and coefficients
11596
11597(e)
11598
11599Estimation of present data. 64.
11600
11601Which of the following is not the guiding principle of software project scheduling?
11602
11603(a) Compartmentalization
11604
11605(b)
11606
11607Market assessment
11608
11609(c)
11610
11611Time allocation
11612
11613(d)
11614
11615Effort validation
11616
11617(e)
11618
11619Interdependency.
11620
1162165.
11622
11623The tools for computing critical path and project completion times from activity networks is/are
11624
11625I. CPM.
11626
11627II. DRE.
11628
11629III. FP.
11630
11631IV. PERT.
11632
11633(a)
11634
11635Both (I) and (III) above
11636
11637(b)
11638
11639Both (I) and (IV) above
11640
11641(c)
11642
11643Both (II) and (IV) above
11644
11645(d)
11646
11647Both (II) and (III) above
11648
11649(e)
11650
11651All (I), (II), (III) and (IV) above. 66.
11652
11653The purpose of earned value analysis is to
11654
11655(a)
11656 
11657
11658
1165929 of 39	10/20/2016 12:10 PM
11660 
11661100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11662 
11663
11664
11665Determine how to compensate developers based on their productivity
11666
11667(b)
11668
11669Provide a quantitative means of assessing software project progress
11670
11671(c)
11672
11673Provide a qualitative means of assessing software project progress
11674
11675(d)
11676
11677Set the price point for a software product based on development effort
11678
11679(e)
11680
11681Provide qualitative and quantitative measure of assesing software project progress.
11682
1168367.
11684
11685The rapid application development model is
11686
11687(a)
11688
11689Same as component-based development
11690
11691(b)
11692
11693A useful approach when a customer cannot define requirements clearly
11694
11695(c)
11696
11697A high-speed adaptation of the linear sequential model
11698
11699(d)
11700
11701Same as incremental model
11702
11703(e)
11704
11705Same as water fall model. 68.
11706
11707Which of the following is not an objective for building analysis models?
11708
11709(a)
11710
11711Define set of software requirements that can be validated
11712
11713(b)
11714
11715Describe customer requirements
11716
11717(c)
11718
11719Develop a solution for the problem
11720
11721(d)
11722
11723Establish basis for software design
11724 
11725
11726
1172730 of 39	10/20/2016 12:10 PM
11728 
11729100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11730 
11731
11732
11733(e)
11734
11735Define set of software requirements that can be verified. 69.
11736
11737The entity relationship diagram
11738
11739(a)
11740
11741Depicts relationships between data objects
11742
11743(b)
11744
11745Depicts functions that transform the data flow
11746
11747(c)
11748
11749Indicates how data are transformed by the system
11750
11751(d)
11752
11753Indicates system reactions to external events
11754
11755(e)
11756
11757Depicts the physical design of the data. 70.
11758
11759Which of the following is not an area of concern in the design model?
11760
11761(a) Architecture
11762
11763(b)
11764
11765Data design
11766
11767(c)
11768
11769Interfaces design
11770
11771(d)
11772
11773Project scope
11774
11775(e)
11776
11777Modular design.
11778
11779
11780Answers
11781
11782
1178361.
11784
11785Answer : (d)
11786
11787Reason : a software project manager need to act to minimize the risk of software failure by Tracking the progress of software 62.
11788
11789Answer : (b)
11790
11791Reason : To be an effective aid in process improvement the baseline metrics used must be Measured consistently across
11792 
11793
11794
1179531 of 39	10/20/2016 12:10 PM
11796 
11797100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11798 
11799
11800
11801projects 63.
11802
11803Answer : (c)
11804
11805Reason : Empirical estimation models are typically based on Regression models derived from historical project data.
11806
1180764.
11808
11809Answer : (b)
11810
11811Reason : Market Assessment is not one of the guiding principles of software project scheduling:
11812
1181365.
11814
11815Answer : (b)
11816
11817Reason : Two tools for computing critical path and project completion times from activity networks are CPM &PERT 66.
11818
11819Answer : (b)
11820
11821Reason : The purpose of earned value analysis is to Provide a quantitative means of assessing software project progress 67.
11822
11823Answer : (c)
11824
11825Reason : The rapid application development model is A high-speed adaptation of the linear sequential model. 68.
11826
11827Answer : (c)
11828
11829Reason : Develop a solution for the problem is not an objective for building analysis models?
11830
1183169.
11832
11833Answer : (a)
11834
11835Reason : The entity relationship diagram depicts relationships between data objects
11836
1183770.
11838
11839Answer : (d)
11840
11841Reason : Project Scope is not an area of concern in the design model
11842
11843
1184471.
11845
11846Coupling is a qualitative indication of the degree to which a module
11847
11848(a)
11849 
11850
11851
1185232 of 39	10/20/2016 12:10 PM
11853 
11854100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11855 
11856
11857
11858Can be written more compactly
11859
11860(b)
11861
11862Focuses on just one thing
11863
11864(c)
11865
11866Is able to complete its function in a timely manner
11867
11868(d)
11869
11870Is connected to other modules
11871
11872(e)
11873
11874Is able to completed its logic in a timely manner.
11875
11876
1187772.
11878
11879Which of the following interface design principles reduces the user’s memory load?
11880
11881e. Define intuitive shortcuts
11882
11883II. Disclose information in a progressive fashion III. Establish meaningful defaults
11884
11885IV. Provide an on-line tutorial
11886
11887(a)
11888
11889Only (I) above
11890
11891(b)
11892
11893Only (II) above
11894
11895(c)
11896
11897Only (III) above
11898
11899(d)
11900
11901(I), (II) and (III) above
11902
11903(e)
11904
11905All (I), (II), (III) and (IV) above.
11906
11907
1190873.
11909
11910Black box testing is also called
11911
11912(a)
11913
11914Specification-based testing
11915
11916(b)
11917
11918Structural testing
11919
11920(c) Verification
11921
11922(d)
11923
11924Unit testing
11925 
11926
11927
1192833 of 39	10/20/2016 12:10 PM
11929 
11930100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
11931 
11932
11933
11934(e)
11935
11936Stress testing.
11937
11938
1193974.
11940
11941Which configuration objects would not typically be found in the project database?
11942
11943(a)
11944
11945Design specification
11946
11947(b)
11948
11949Marketing data
11950
11951(c)
11952
11953Executable code
11954
11955(d)
11956
11957Test plans
11958
11959(e)
11960
11961Test procedures.
11962
11963
1196475.
11965
11966Which of the following task(s) is/are not part of software configuration management?
11967
11968e. Change control.
11969
11970II. Reporting.
11971
11972III. Statistical quality control.
11973
11974(a)
11975
11976Only (I) above
11977
11978(b)
11979
11980Only (II) above
11981
11982(c)
11983
11984Only (III) above
11985
11986(d)
11987
11988Both (I) and (II) above
11989
11990(e)
11991
11992Both (I) and (III) above.
11993
11994
1199576.
11996
11997Which box specification is not associated with cleanroom approach?
11998
11999(a)
12000 
12001
12002
1200334 of 39	10/20/2016 12:10 PM
12004 
12005100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
12006 
12007
12008
12009Black box
12010
12011(b) Clear box
12012
12013(c)
12014
12015State box
12016
12017(d) White box
12018
12019(e)
12020
12021Silver box.
12022
12023
1202477.
12025
12026Which of the following is not a logical layer of the application in client server system?
12027
12028(a)
12029
12030Presentation layer
12031
12032(b)
12033
12034Application layer
12035
12036(c)
12037
12038Data Management layer
12039
12040(d)
12041
12042Programming layer
12043
12044(e)
12045
12046Business layer.
12047
12048
1204978.
12050
12051Which of the following is true for a thin-client?
12052
12053(a)
12054
12055Processes application logic
12056
12057(b)
12058
12059Performs data management task
12060
12061(c)
12062
12063Places heavy processing load on the server
12064
12065(d)
12066
12067Makes use of processing power of the client
12068
12069(e)
12070
12071Places heavy processing load on the client.
12072
12073
1207479.
12075 
12076
12077
1207835 of 39	10/20/2016 12:10 PM
12079 
12080100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
12081 
12082
12083
12084Traditionally, the phase of software development where a formal approach used is
12085
12086(a) Programming
12087
12088(b) Design
12089
12090(c) Requirements
12091
12092(d) Planning
12093
12094(e)
12095
12096Testing.
12097
12098
1209980.
12100
12101Domain Engineering in CBSE is to
12102
12103(a)
12104
12105Identification of components
12106
12107(b)
12108
12109Catalogue reusable components
12110
12111(c)
12112
12113Domain modeling
12114
12115(d)
12116
12117Structural modeling
12118
12119(e)
12120
12121All the above.
12122
12123
12124Answers:
12125
12126
1212771.
12128
12129Answer : (d)
12130
12131Reason : Coupling is a qualitative indication of the degree to which a module is connected to other modules.
12132
12133
1213472.
12135
12136Answer : (d)
12137
12138Reason : The following Define intuitive shortcuts ,Disclose information in a progressive fashion, Establish meaningful defaults interface design principles reduces the user’s memory
12139 
12140
12141
1214236 of 39	10/20/2016 12:10 PM
12143 
12144100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
12145 
12146
12147
12148load
12149
12150
1215173.
12152
12153Answer : (a)
12154
12155Reason : Black box testing is another name for
12156
12157Specification-based testing.
12158
12159
1216074.
12161
12162Answer : (b)
12163
12164Reason : Marketing data configuration objects would not typically be found in the project database
12165
12166
1216775.
12168
12169Answer : (c)
12170
12171Reason : the following task Statistical quality control is not part of software configuration management
12172
12173
1217476.
12175
12176Answer : (d)
12177
12178Reason : White box specification is not associated with cleanroom approach
12179
12180
1218177.
12182
12183Answer : (d)
12184
12185Reason : Programming is not a logical layer of the application in client server
12186
12187system
12188
12189
1219078.
12191
12192Answer : (c)
12193
12194Reason : Places heavy processing load on the server
12195
12196
1219779.
12198
12199Answer : (a)
12200
12201Reason : Traditionally, the only phase of software development where a formal approach is used is Programming.
12202
1220380.
12204 
12205
12206
1220737 of 39	10/20/2016 12:10 PM
12208 
12209100 TOP SOFTWARE ENGINEERING Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/software-engineering-multiple-c...
12210 
12211
12212
12213Answer : (e)
12214
12215Reason : Domain Engineering in CBSE is toIdentification of components,Catalogue reusable components,Domain modeling, Structural modeling.
12216
12217
12218
12219
12220
12221
12222
12223
12224
12225Posted in SOFTWARE ENGINEERING Questions and Answers Tagged Interview Questions and Answers pdf free Download-mcqs-objective type Engineering
12226
12227
12228100 TOP OPERATING		100 TOP WEB
12229SYSTEMS Multiple Choice	TECHNOLOGIES Multiple
12230Questions and Answers	Choice Questions and
12231			Answers	
12232
12233
12234
12235ONE THOUGHT ON “100 TOP SOFTWARE
12236
12237ENGINEERING MULTIPLE CHOICE QUESTIONS
12238
12239AND ANSWERS”
12240
12241
12242shabbir marri
12243
12244SEPTEMBER 18, 2016 AT 3:55 PM
12245
12246Respected Sir i want mcqz of Software Engineer-ing….so please send me multiple question,….i am from Balochistan.
12247
12248
12249REPLY
12250
12251
12252
12253
12254
12255
12256
12257
12258Your email address will not be published. Required fields are marked *
12259
12260
12261Comment
12262 
12263
12264
12265
12266
1226738 of 39	10/20/2016 12:10 PM
12268 
12269100 TOP THEORY of COMPUTATION Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/theory-of-computation-multiple...
12270 
12271
12272
12273
12274
12275
12276
12277
12278
12279
12280
12281
12282
12283
12284
122851. The following grammar G = (N, T, P, S)
12286
12287N = {S, A, B} T = {a, b, c} P : S ? aSa
12288
12289S ? aAa A ? bB B ? bB B ? c is
12290
12291	is type 3
12292
12293	is type 2 but not type 3
12294
12295	is type 1 but not type 2
12296
12297	is type 0 but not type 1
12298
12299
123002.The following grammar G = (N, T, P, S)
12301
12302N = {S, A, B, C, D, E} T = {a, b, c}
12303
12304P : S ? aAB AB ? CD CD ? CE C ? aC
12305
12306C ? b
12307
12308bE ? bc is
12309
12310
12311	is type 3
12312
12313	is type 2 but not type 3
12314
12315	is type 1 but not type 2
12316
12317	is type 0 but not type 1
12318
12319
123203. The following grammar
12321 
12322
12323
12324
12325
123262 of 12	10/20/2016 12:15 PM
12327 
12328100 TOP THEORY of COMPUTATION Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/theory-of-computation-multiple...
12329 
12330
12331
12332G = (N, T, P, S)
12333
12334N = {S, A, B, C}
12335
12336T = {a, b, c}
12337
12338P : S ? aS
12339
12340A ? bB
12341
12342B ? cC
12343
12344C ? a is
12345
12346	is type 3
12347
12348	is type 2 but not type 3
12349
12350	is type 1 but not type 2
12351
12352	is type 0 but not type 1
12353
12354
123554. The following grammar G = (N, T, P, S)
12356
12357N = {S, A, B, C, D, E} T = (a, b, c}
12358
12359P : S ? ABCD
12360
12361BCD ? DE D ? aD
12362
12363D ? a E ? bE E ? c is
12364
12365	is type 3
12366
12367	is type 2 but not type 3
12368
12369	is type 1 but not type 2
12370
12371	is type 0 but not type 1
12372
12373
123745. Consider the following CFG S ? aB S ? bA
12375
12376B ? b A ? a B ? bS A ? aS
12377
12378B ? aBB A ? bAA
12379
12380
12381Consider the following derivation S ? aB
12382
12383	aaBB
12384
12385	aaBb
12386 
12387
12388
123893 of 12	10/20/2016 12:15 PM
12390 
12391100 TOP THEORY of COMPUTATION Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/theory-of-computation-multiple...
12392 
12393
12394
12395	aabSb
12396
12397	aabbAb
12398
12399	aabbab
12400
12401
12402This derivation is
12403
12404	a leftmost derivation
12405
12406	a rightmost derivation
12407
12408	both leftmost and rightmost derivation
12409
12410	neither leftmost nor rightmost derivation
12411
124126.
12413
12414Consider the following language L = {anbncndn|n = 1}
12415
12416L is
12417
12418	CFL but not regular
12419
12420	CSL but not CFL
12421
12422	regular
12423
12424	type 0 language but not type 1
12425
124267.
12427
12428Consider the following language L = {anbn|n = 1}
12429
12430L is
12431
12432	CFL but not regular
12433
12434	CSL but not CFL
12435
12436	regular
12437
12438	type 0 language but not type 1
12439
124408.
12441
12442Consider the following language L = {anbmcpdq|n, m, p, q = 1} L is
12443
12444	CFL but not regular
12445
12446	CSL but not CFL
12447
12448	regular
12449
12450	type 0 language but not type 1
12451
124529.
12453
12454The following CFG is in S ? AB
12455
12456B ? CD B ? AD
12457 
12458
12459
124604 of 12	10/20/2016 12:15 PM
12461 
12462100 TOP THEORY of COMPUTATION Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/theory-of-computation-multiple...
12463 
12464
12465
12466B ? b
12467
12468D ? AD
12469
12470D ? d
12471
12472A ? a
12473
12474C ? a
12475
12476	Chomsky normal form but not strong Chomsky normal form
12477
12478	Weak Chomsky normal form but not Chomsky normal form
12479
12480	Strong Chomsky normal form
12481
12482	Greibach normal form
12483
1248410.
12485
12486The following CFG is in
12487
12488S ? aBB
12489
12490B ? bAA
12491
12492A ? a
12493
12494B ? b
12495
12496	Chomsky normal form but not strong Chomsky normal form
12497
12498	Weak Chomsky normal form but not Chomsky normal form
12499
12500	Strong Chomsky normal form
12501
12502	Greibach normal form
12503
1250411.
12505
12506Which of the following CF language is inherently ambiguous?
12507
12508	{anbncmdm|n, m = 1}
12509
12510	{anbmcpdq|n = p or m = q, n, m, p, q = 1}
12511
12512	{anbmcpdq|n ? m ? p ? q}
12513
12514	{anbmcpdq|n ? m ? p ? q}
12515
12516
1251714.
12518
12519Can a DFSA simulate a NFSA
12520
12521	No
12522
12523	Yes
12524
12525	sometimes
12526
12527	depends on NFA
12528
12529
1253016.
12531
12532The concept of FSA is much used in this part of the compiler
12533
12534	lexical analysis
12535
12536	parser
12537
12538	code generation
12539 
12540
12541
125425 of 12	10/20/2016 12:15 PM
12543 
12544100 TOP THEORY of COMPUTATION Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/theory-of-computation-multiple...
12545 
12546
12547
12548d. code optimization 17.
12549
12550The concept of grammar is much used in this part of the compiler
12551
12552	lexical analysis
12553
12554	parser
12555
12556	code generation
12557
12558	code optimization 18.
12559
12560(a + b)(cd)*(a + b) denotes the following set
12561
12562	{a(cd)nb|n = 1}
12563
12564	{a(cd)na|n = 1} ? {b(cd)nb/n = 1}
12565
12566	{a(cd)na|n = 0} ? {a(cd)nb/n = 0} ? {b(cd)na/n = 0} ? {b(cd)nb/n = 0}
12567
12568	{acndnb|n = 1} 19.
12569
12570baa*c denotes the set
12571
12572	{bnamcp|n, m, p = 1}
12573
12574	{banc|n = 0}
12575
12576	{banc|n = 1}
12577
12578	{w|w is a string of a, b, c}
12579
1258020. The set of all strings over the alphabet S = {a, b} (including e) is denoted by
12581
12582	(a + b)*
12583
12584	(a + b)+
12585
12586	a+b+
12587
12588	a*b*
12589
12590
12591THEORY of COMPUTATION Multiple Choice
12592
12593Questions and Answers :-
12594
1259521. Palindromes can’t be recognized by any FSA because
12596
12597	FSA cannot remember arbitrarily large amount of information
12598
12599	FSA cannot deterministically fix the midpoint
12600
12601	Even if the mid point is known an FSA cannot find whether the second half of the string matches the first half
12602
12603	all of the above
12604 
12605
12606
12607
12608
126096 of 12	10/20/2016 12:15 PM
12610 
12611100 TOP THEORY of COMPUTATION Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/theory-of-computation-multiple...
12612 
12613
12614
1261522.
12616
12617Let S = {a, b, c, d, e}. The number of strings in S* of length 4 such that no symbol is used more than once in a string is
12618
12619	360
12620
12621	120
12622
12623	35d. 36
12624
1262523.
12626
12627Which of the following denotes Chomskian hiearchy?
12628
12629	REG ? CFL ? CSL ? type0
12630
12631	CFL ? REG ? type0 ? CSL
12632
12633	CSL ? type0 ? REG ? CFL
12634
12635	CSL ? CFL ? REG ? type0
12636
1263724.
12638
12639A language L is accepted by a FSA iff it is
12640
12641	CFL
12642
12643	CSL
12644
12645	recursive
12646
12647	regular 25.
12648
12649Which of the following regular expressions denotes a language comprising of all possible strings over S = {a, b} of length n where n is a multiple of 3.
12650
12651	(a + b + aa + bb + aba + bba)*
12652
12653	(aaa + bbb)*
12654
12655	((a + b)(a + b)(a + b))*
12656
12657	(aaa + ab + a) + (bbb + bb + a) 26.
12658
12659A language is represented by a regular expression (a)*(a + ba). Which of the following string does not belong to the regular set represented by the above expression.
12660
12661	aaa
12662
12663	aba
12664
12665	ababad. aa 27.
12666
12667Which of the following is not primitive recursive but partially recursive?
12668
12669	McCarthy’s function
12670
12671	Riemann function
12672 
12673
12674
126757 of 12	10/20/2016 12:15 PM
12676 
12677100 TOP THEORY of COMPUTATION Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/theory-of-computation-multiple...
12678 
12679
12680
12681	Ackermann’s function
12682
12683	Bounded function 28.
12684
12685Consider the following right-linear grammar G = (N, T, P, S) N = {S}
12686
12687P : S ? aS|aA T = {a, b} A ? bA|b
12688
12689Which of the following regular expression denotes L(G)?
12690
12691	(a + b)*
12692
12693	a(ab)*b
12694
12695	aa*bb*
12696
12697	a*b*
12698
1269929.
12700
12701Which of the following strings is not generated by the following grammar? S ? SaSbS|e
12702
12703	aabb
12704
12705	abab
12706
12707	aababb
12708
12709	aaabb
12710
12711
1271231.
12713
12714Consider a language L for which there exists a Turing machine â„¢, T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is
12715
12716	NP hard
12717
12718	NP complete
12719
12720	recursive
12721
12722	recursively enumerable 32.
12723
12724Consider the following statements
12725
12726I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation
12727
12728Which of the above statement are TRUE?
12729
12730	I only
12731
12732	I and II
12733
12734	I and III
12735 
12736
12737
127388 of 12	10/20/2016 12:15 PM
12739 
12740100 TOP THEORY of COMPUTATION Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/theory-of-computation-multiple...
12741 
12742
12743
12744d. II and III 33.
12745
12746Which of the following statement is wrong?
12747
12748	Any regular language can be generated by a context-free grammar
12749
12750	Some non-regular languages cannot be generated by any
12751
12752CFG
12753
12754	the intersection of a CFL and regular set is a CFL
12755
12756	All non-regular languages can be generated by CFGs. 34.
12757
12758Recursively enumerable languages are not closed under
12759
12760	union
12761
12762	homomorphism
12763
12764	complementation
12765
12766	concatenation 35.
12767
12768Which of the following problem is undecidable?
12769
12770	membership problem for CFL
12771
12772	membership problem for regular sets
12773
12774	membership problem for CSL
12775
12776	membership problem for type 0 languages 36.
12777
12778Recursive languages are
12779
12780	a proper superset of CFL
12781
12782	always recognized by PDA
12783
12784	are also called type 0 languages
12785
12786	always recognized by FSA 37.
12787
12788R1 and R2 are regular sets. Which of the following is not true?
12789
12790	R1 n R2 neet not be regular
12791
12792	S* – R1 is regular
12793
12794	R1 ? R2 is regular
12795
12796	is regular
12797
12798
1279938.
12800
12801Which of the following regular expression identity is true?
12802
12803	r(*) = r*
12804
12805	(r*s*)* = (r + s)*
12806 
12807
12808
128099 of 12	10/20/2016 12:15 PM
12810 
12811100 TOP THEORY of COMPUTATION Multiple Choice Questions and ...	http://engineeringinterviewquestions.com/theory-of-computation-multiple...
12812 
12813
12814
12815	(r + s)* = r* + s*
12816
12817	r*s* = r* + s* 39.
12818
12819Which one of the following statement is FALSE?
12820
12821	context-free languages are closed under union
12822
12823	context-free languages are closed under concatenation
12824
12825	context-free languages are closed under intersection
12826
12827	context-free languages are closed under Kleene closure 40.
12828
12829Which of the following conversion is not possible (algorithmically)?
12830
12831	regular grammar to context-free grammar
12832
12833	nondeterministic FSA to deterministic FSA
12834
12835	nondeterministic PDA to deterministic PDA
12836
12837	nondeterministic TM to deterministic TM
12838
12839Answers ::
12840
128411.b 2.c 3.a 4.d 5.d 6.b 7.a 8.c 9.c 10.d 11.b 12.a 13.b 14.b 15.b 16.a 17.b18.c 19.c 20.a 21.d 22.b 23.a 24.d 25.c 26.c 27.c 28.c 29.d 30.c 31.d 32.b 33.d 34.c 35.d 36.a 37.a 38.b 39.c 40.c
12842
12843
12844
12845
12846
12847
12848
12849
12850
12851Posted in Theory of Computation Questions and Answers
12852
12853
12854200 TOP Computer	100 TOP DATA STRUCTURES
12855		and ALGORITHMS Multiple
12856Organization and Architecture	
12857Multiple Choice Questions and	Choice Questions and
12858Answers		Answers	
12859
12860
12861
12862ONE THOUGHT ON “100 TOP THEORY OF
12863
12864COMPUTATION MULTIPLE CHOICE QUESTIONS
12865
12866AND ANSWERS”
12867
12868
12869baskar
12870
12871SEPTEMBER 13, 2016 AT 3:33 PM
12872 
12873
12874
1287510 of 12	10/20/2016 12:15 PM