EADH5r0f

1Cracking the Comprehensive Exam
2'Allo, 'Allo!
3Always a pleasure serving you. All the Best!
41. Which is not the commonly used programming language for AI?
5A. PROLOG
6B. Java
7C. LISP
8D. Perl
9Answer: Choice D
10Introduction to Artificial Intelligence
112. What is state space?
12A. The whole problem
13B. Representing your problem with variable and parameter
14C. Your Definition to a problem
15D. A space where You know the solution.
16Answer: Choice B
17Introduction to Artificial Intelligence
183. Which search method takes less memory?
19A. Depth-First Search
20B. Breadth-First Search
21C. Linear Search
22D. Optimal Search
23Answer: Choice A
24Introduction to Artificial Intelligence
254. A* algorithm is based on
26A. Depth-First Search
27B. Breadth-First Search
28C. Best-First Search
29D. Hill Climbing
30Answer: Choice C
31Introduction to Artificial Intelligence
325. Which is the best way to go for Game playing problem?
33A. Linear Approach
34B. Heuristic Approach
35C. Random Approach
36D. Stratified Approach
37Answer: Choice B
38Introduction to Artificial Intelligence
396. How do you represent “All dogs have tails”.
40A. ۷x: dog(x)àhastail(x)
41B. ۷x: dog(x)àhastail(y)
42C. ۷x: dog(y)àhastail(x)
43D. ۷x: dog(x)àhasàtail(x)
44Answer: Choice A
45Introduction to Artificial Intelligence
467. Which is not a property of representation of knowledge?
47A. Representational Verification Adequacy
48B. Representational Adequacy
49C. Inferential Adequacy
50D. Inferential Adequacy
51Answer: Choice A
52Introduction to Artificial Intelligence
538. Which is not a type of First Order Logic (FOL) Sentence?
54A. Atomic Sentences
55B. Complex Sentences
56C. Quantified Sentences
57D. Quality Sentences
58Answer: Choice D
59Introduction to Artificial Intelligence
609. A plan that describe how to take actions in levels of increasing
61refinement and specificity is
62A. Problem-Solving
63B. Planning
64C. Hierarchical Plan
65D. Inheritance
66Answer: Choice C
67Introduction to Artificial Intelligence
6810. Partial order planning involves
69A. Searching over possible situations
70B. Searching over the space of possible plans
71C. Searching the whole problem at once
72D. Searching the best
73Answer: Choice B
74Introduction to Artificial Intelligence
7511. Uncertainty arises in the wumpus world because the agent’s sensors
76give only
77A. Full & Global information
78B. Partial & Global Information
79C. Partial & local Information
80D. Full & local information
81Answer: Choice C
82Introduction to Artificial Intelligence
8312. In an Unsupervised learning
84A. Specific output values are not given
85B. No specific Inputs are given
86C. Both inputs and outputs are given
87D. Neither inputs nor outputs are given.
88Answer: Choice A
89Introduction to Artificial Intelligence
9013. Inductive learning involves finding a
91A. Consistent Hypothesis
92B. Inconsistent Hypothesis
93C. Regular Hypothesis
94D. Estimated Hypothesis.
95Answer: Choice A
96Introduction to Artificial Intelligence
9714. If a hypothesis says it should be positive, but in fact it is negative, we
98call it
99A. Consistent Hypothesis
100B. A false negative hypothesis
101C. A false positive hypothesis
102D. A specialized hypothesis
103Answer: Choice C
104Introduction to Artificial Intelligence
10515. Neural Networks are complex -----------------------with many
106parameters.
107A. Linear Functions
108B. Non Linear Functions
109C. Discrete Functions
110D. Exponential Functions
111Answer: Choice B
112Introduction to Artificial Intelligence
11316. SMALLTALK comes under __________________
114A. Object oriented programming
115B. procedural programming
116C. Logical programming
117D. Imperative Programming
118Answer: A
119The object oriented paradigm
12017. LISP stands for ________________________
121A. List Processing
122B. List procession
123C. List Programming
124D. Linked programming
125Answer: A
126The object oriented paradigm
12718. Let g(x) ≡ x * x. h(x) ≡ 2 * x, i(x) ≡ x / 2. Then the construction is [g, h,
128i](10) = ?
129A. [100, 20, 5]
130B. [100, 10, 2]
131C. [100, 20, 1]
132D. [100, 20, 2]
133Answer: A
134The object oriented paradigm
13519. Programming paradigm helps us in __________________ design
136A. functional
137B. object
138C. Procedural
139D. Programming language
140Answer: D
141The object oriented paradigm
14220. friend functions are called _________
143A. With a reference of a object
144B. With a reference of a structure instance
145C. None of the options
146D. With a reference of a class
147Answer: C
148The object oriented paradigm
14921. calling a method from an object is often referred as____________
150A. OBJECT CREATION
151B. OBJECT INSTANTIATION
152C. MESSAGE PASSING
153D. MESSAGE RETRIVAL
154Answer: C
155The object oriented paradigm
15622. Interpretor is used to ___________________
157A. Only compile
158B. Only for execution
159C. Both for execution & compilation
160D. None of the options
161Answer: C
162The object oriented paradigm
16323. Static scoping is identified by _____________________
164A. Spatial
165B. Time
166C. Execution
167D. Debug
168Answer: A
169The object oriented paradigm
17024. Activation record of a program helps in___________________
171A. compilation
172B. execution
173C. identify error
174D. None of the options
175Answer: B
176The object oriented paradigm
17725. Local offset in activation record means___________________
178A. Used to identify a variable address
179B. Used to identify a function address
180C. Used to identify a object address
181D. Used to identify a pointer address
182Answer: A
183The object oriented paradigm
18426. Static depth of a function is identified by its__________________-
185A. Calling sequence
186B. Compiling sequence
187C. Nesting level
188D. None of the options
189Answer: C
190The object oriented paradigm
19127. Valid strings for the Regular Expression (0 | 1)* 011 is
192A. 10101
193B. 100001
194C. 111011
195D. 111000
196Answer: C
197The object oriented paradigm
19828. Epsilon transitions are not permitted in
199A. NFA
200B. DFA
201C. NFA & DFA
202D. None of the options
203Answer: B
204The object oriented paradigm
20529. ________takes a string from a source code as input and validates
206against _____ and answers whether the input string is valid or not.
207A. Token & Lexeme
208B. Finite Automaton & Regular Expression
209C. Sentinel & Token
210D. Input string & token
211Answer: B
212The object oriented paradigm
21330. Platform independence is supported in java by _______________
214A. Byte code
215B. Virtual machine
216C. A & B
217D. only A
218Answer: C
219The object oriented paradigm
22031. The screen must be refreshed at the rate of ____ frames per second.
221A. 40
222B. 50
223C. 60
224D. 70
225Answer: 60
226Computer Graphics
22732. 2D scaling equation is
228A. x’ = x*sx, y’ = y * sy
229B. x’ = x + sx, y’ = y + sy
230C. x’ = x – sx, y’ = y – sy
231D. x’ = x * sy, y’ = y * sx
232Answer: x’ = x*sx, y’ = y * sy
233Computer Graphics
23433. The basic 2D transformations are
235A. Scaling, Reflection, Shearing
236B. Scaling, Rotation, Reflection
237C. Scaling, Rotation, Translation
238D. Scaling, Translation, Shearing
239Answer: Scaling, Rotation, Translation
240Computer Graphics
24134. In which transformation the shape and size of the object is changed
242A. Translation
243B. Rotation
244C. Scaling
245D. Shearing
246Answer: Shearing
247Computer Graphics
24835. Stereoscopic viewing is also a component in ___________ system
249A. Display
250B. Audio
251C. Virtual-reality
252D. None of the above
253Answer: Virtual-Reality
254Computer Graphics
25536. Space ball provides _____ degree of freedom
256A. Two
257B. Three
258C. Four
259D. Six
260Answer: Six
261Computer Graphics
26237. In which transformation object is moved in circular path
263A. Translation
264B. Rotation
265C. Shearing
266D. Scaling
267Answer: rotation
268Computer Graphics
26938. Z-buffer method is also known as
270A. Back-Face Detection
271B. Scan -Line Method
272C. Depth-Sorting Method
273D. Depth-Buffer Method
274Answer: Depth-Buffer method
275Computer Graphics
27639. Which method use linked list to represent surfaces?
277A. Painter’s algorithm
278B. A-Buffer Method
279C. Z-Buffer Method
280D. Depth-Sorting Method
281Answer: A-Buffer Method
282Computer Graphics
28340. Which Method is called as hidden-line detection methods.
284A. Ray casting method
285B. Scan line method
286C. BSP-tree Method
287D. None of the above
288Answer: None of the above
289Computer Graphics
29041. The two types of parallel Projections are
291A. Axonometric and Isometric Projections
292B. Orthographic and Oblique Projections
293C. Cabinet and Cavalier Projections
294D. Elevation and Plain view
295Answer: Orthographic and Oblique Projections
296Computer Graphics
29742. _________ method for solving the hidden-surface problem is often
298referred to as Painter’s Algorithm .
299A. Back-Face Detection
300B. Scan -Line Method
301C. Depth-Sorting Method
302D. Depth-Buffer Method
303Answer: Depth-Sorting Method
304Computer Graphics
30543. In the Area subdivision method given one square is divided into
306______ equal squares
307A. Four
308B. Eight
309C. Twelve
310D. Sixteen
311Answer: Four
312Computer Graphics
31344. A fast and simple method for rendering an object with polygon
314surfaces is ______________
315A. Constant-intensity shading
316B. Gouraud Shading
317C. Phong Shading
318D. Fast Phong Shading
319Answer: Constant-intensity shading
320Computer Graphics
32145. Reflection and refraction rays are referred to as __________ rays.
322A. Reflected
323B. Refracted
324C. Secondary
325D. Binary
326Answer: Secondary
327Computer Graphics
32846. If no surface are intersected by a pixel ray, the ray-tracing tree is
329_________
330A. Empty
331B. Full
332C. binary tree
333D. Complete binary tree
334Answer: Empty
335Computer Graphics
33647. The artist adds a black pigment to produce different ________ of that
337color.
338A. Shades
339B. tints
340C. Tones
341D. model
342Answer: Shades
343Computer Graphics
34448. Blue and green combined you will get _______ color.
345A. Cyan
346B. Magenta
347C. Yellow
348D. White
349Answer: Cyan
350Computer Graphics
35149. The combination of light reflections from various surfaces to produce
352a uniform illumination called the ________________
353A. Diffuse reflection
354B. Specular reflection
355C. Ambient Light
356D. Light sources
357Answer: Ambient Light
358Computer Graphics
35950. In fast phong shading the Taylor-series expansion and retain terms
360upto ______ degree in x and y.
361A. First
362B. Second
363C. Third
364D. Fourth
365Answer: Second
366Computer Graphics
36751. The environment map is defined over the surface of an enclosing
368universe
369A. environment array
370B. enclosing universe
371C. reflection mapping
372D. environment mapping
373Answer: enclosing universe
374Computer Graphics
37552. Blue and red combined you will get ________ color.
376A. Cyan
377B. Magenta
378C. Yellow
379D. White
380Answer: Magenta
381Computer Graphics
38253. 1) Multi-core processors plays a central role in driving important
383advancements in _______________
384A. PC Security
385B. Resource allocation
386C. Digital media computing
387D. Locator sychronization
388Answer: A
389MULTI CORE SYSTEMS PROGRAMMING
39054. 2) Multicore design offers enhancement in _________________
391A. System resources
392B. System tools
393C. System performance
394D. System attributes
395Answer: C
396MULTI CORE SYSTEMS PROGRAMMING
39755. 3) A multi-core processor implements _________________in a single
398physical package.
399A. multithreading
400B. multiprocessing
401C. multiprogramming
402D. multitasking
403Answer: B
404MULTI CORE SYSTEMS PROGRAMMING
40556. 4) __________________ is the term which is used generally to refer
406multi-core microprocessors that are manufactured on the same
407integrated circuit
408A. Embeded systems
409B. Digital signal processors
410C. System-on-a-chip
411D. Multi-chip module
412Answer: D
413MULTI CORE SYSTEMS PROGRAMMING
41457. 5) When it is not feasible to construct a System-on-a-Chip for a
415particular application ___________________ is an alternative
416A. Multi chip
417B. System in Package
418C. Package on Package
419D. Micro chip
420Answer: B
421MULTI CORE SYSTEMS PROGRAMMING
42258. 6) Multi-core processor is finding increasing deployment in
423__________________
424A. Artifical intelligent devices
425B. Page mapping
426C. Packet switching
427D. Mmemory mapping
428Answer: A
429MULTI CORE SYSTEMS PROGRAMMING
43059. 7) The abstraction provided by ________________ to each virtual
431machine running over it is that of a 100% dedicated CPU and memory
432address space.
433A. Instruction set
434B. Physical memory
435C. Virtualization
436D. Indirection layer
437Answer: C
438MULTI CORE SYSTEMS PROGRAMMING
43960. 8) Embedded virtualization also makes possible _______________ and
440the ability to enable legacy software to run in a multicore operation
441A. Direct addressing
442B. Segmentation
443C. Addressing mapping
444D. Secure partitioning
445Answer: D
446MULTI CORE SYSTEMS PROGRAMMING
44761. 9) In multiprocessor machines, __________________ are an efficient
448way for application developers to utilize the parallelism of the hardware.
449A. Paging
450B. Multiple threads
451C. Virtual memory
452D. Job scheduling
453Answer: B
454MULTI CORE SYSTEMS PROGRAMMING
45562. 10) The kernel is aware of each ______________ as a scheduled entity
456and it can take the advantage of multiple processors.
457A. Thread
458B. Data flow
459C. Fuction extension
460D. Interface
461Answer: A
462MULTI CORE SYSTEMS PROGRAMMING
46363. 11) ____________ should be optimized for tightly coupled operation of
464multiple control flows within a process.
465A. Thread Management
466B. Harmonization
467C. Mutual exclusion
468D. Kernel threads
469Answer: C
470MULTI CORE SYSTEMS PROGRAMMING
47164. 12) When the program requests a block of memory,
472____________must allocate that block out of the larger blocks it has
473received from the operating system
474A. Process manager
475B. Program manager
476C. Kernal manager
477D. Memory manager
478Answer: D
479MULTI CORE SYSTEMS PROGRAMMING
48065. 13) The additional time taken by the memory manager while the
481program is running is to be considered as _______________
482A. Memory Overhead
483B. CPU overhead
484C. Process overhead
485D. Interactive pause times
486Answer: B
487MULTI CORE SYSTEMS PROGRAMMING
48866. 14) Many programs give up memory, but attempt to access it later
489and crash or behave randomly. This condition is known
490as________________
491A. External fragmentation
492B. Memory leak
493C. Premature free
494D. Poor locality of reference
495Answer: C
496MULTI CORE SYSTEMS PROGRAMMING
49767. 15) ____________ has become the standard means of reasoning
498about the correctness of concurrent objects
499A. Linearizability
500B. Flexibility
501C. Reusability
502D. Scalability
503Answer: A
504MULTI CORE SYSTEMS PROGRAMMING
50568. The data rate of a PCM-coded stereo-audio signal with a sampling
506rate of 44.1 KHz and sampling size of 8 bits.
507A. 176,400 bytes/sec
508B. 88, 200 bytes/sec
509C. 715600 bits/sec
510D. 70050 bits/ sec
511Answer: B
512MULTIMEDIA SYSTEMS AND ALGORITHMS
51369. MPEG compression method is
514A. Weakly regular data stream
515B. Irregular data stream
516C. Strongly regular data stream
517D. None of the above
518Answer: A
519MULTIMEDIA SYSTEMS AND ALGORITHMS
52070. In a CDROM the sector address is stored in
521A. PCA
522B. Lead in
523C. PMA
524D. Lead out
525Answer: C
526MULTIMEDIA SYSTEMS AND ALGORITHMS
52771. A data stream that can be found in cooperative application with
528shared windows
529A. Strongly periodic data stream
530B. Weakly periodic data stream
531C. aperiodic data stream
532D. None of the above
533Answer: C
534MULTIMEDIA SYSTEMS AND ALGORITHMS
53572. -------------------- marks the variants of a phone
536A. Fundamental frequency
537B. morph
538C. vowels
539D. allophones
540Answer: D
541MULTIMEDIA SYSTEMS AND ALGORITHMS
54273. In a CDROM the 8-bit data is converted to
543A. 12-bit modulations
544B. 14-bit modulations
545C. 16-bit modulations
546D. 24-bit modulations
547Answer: B
548MULTIMEDIA SYSTEMS AND ALGORITHMS
54974. In JPEG compression AC coefficients are encoded by
550A. AC-AC-1
551B. Quantization matrix
552C. Entropy encoding
553D. Zigzag ordering
554Answer: D
555MULTIMEDIA SYSTEMS AND ALGORITHMS
55675. For each subband in audio encoding the noise level is calculated
557using
558A. FFT
559B. zigzag ordering
560C. Psychoacoustic model
561D. PCM
562Answer: C
563MULTIMEDIA SYSTEMS AND ALGORITHMS
56476. ------------------------- compression is specifically designed for video
565telecommunication applications
566A. MPEG
567B. JPEG
568C. DVI
569D. H.261
570Answer: D
571MULTIMEDIA SYSTEMS AND ALGORITHMS
57277. MPEG supports only
573A. interleaved video
574B. all kinds of video
575C. non interlaced video
576D. none of the above
577Answer: C
578MULTIMEDIA SYSTEMS AND ALGORITHMS
57978. ................................ aborts all task that cannot meet their deadline
580anymore
581A. EDF
582B. RM
583C. Pre-emptive
584D. non pre-emptive
585Answer: A
586MULTIMEDIA SYSTEMS AND ALGORITHMS
58779. ----------------- checks whether the request can be guaranteed or not
588A. Requestor
589B. Resource manager
590C. Resource reservation
591D. Resource scheduling
592Answer: B
593MULTIMEDIA SYSTEMS AND ALGORITHMS
59480. Textural and Numerical content is which type of datatype
595A. Raw data type
596B. Registered data type
597C. Descriptive data type
598D. none of the above
599Answer: C
600MULTIMEDIA SYSTEMS AND ALGORITHMS
60181. ---------------describes all operations allowed on the document
602A. Manipulation model
603B. Representation model
604C. Presentation model
605D. none of the above
606Answer: A
607MULTIMEDIA SYSTEMS AND ALGORITHMS
60882. The position of one object may influence the motion of another in
609A. Full Explicit control
610B. Procedural Control
611C. Constraint based systems
612D. Tracking live action
613Answer: B
614MULTIMEDIA SYSTEMS AND ALGORITHMS
61583. Assembly language
616A. uses alphabetic codes in place of binary numbers used in machine language
617B. is the easiest language to write programs
618C. need not be translated into machine language
619D.
620Answer: A
621Computer Architecture and Organization
62284. ___register keeps track of the instructions stored in program stored
623in memory
624A. AR (Address Register)
625B. XR (Index Register)
626C. PC (Program Counter)
627D. AC (Accumulator)
628Answer: C
629Computer Architecture and Organization
63085. Von Neumann architecture is
631A. SISD
632B. SIMD
633C. MIMD
634D. MISD
635Answer: A
636Computer Architecture and Organization
63786. In Assembly language programming, minimum number of operands
638required for an instruction is/are
639A. Zero.
640B. One.
641C. Two.
642D. Both (B) & (C).
643Answer: A
644Computer Architecture and Organization
64587. In which addressing mode the operand is given explicitly in the
646instruction
647A. Absolute.
648B. Immediate.
649C. Indirect.
650D. Direct.
651Answer: B
652Computer Architecture and Organization
65388. A stack organized computer has
654A. Three-address Instruction
655B. Three-address Instruction
656C. Three-address Instruction
657D. Zero-address Instruction.
658Answer: D
659Computer Architecture and Organization
66089. A data movement instruction will
661A. modify the status register
662B. modify the stack pointer
663C. modify the program counter
664D. . transfer data from one location to another
665Answer: D
666Computer Architecture and Organization
66790. Which register example hold the instruction itself?
668A. . Program Counter
669B. Instruction Register
670C. Control Unit
671D. ALU
672Answer: B
673Computer Architecture and Organization
67491. What are important aspects of the von Neumann architecture?
675A. Instruction are data
676B. memory for programs and data
677C. Inventted in Germany
678D. Uses a program counter
679Answer: B
680Computer Architecture and Organization
68192. Which of the following would cause quickest acess
682A. direct access from a magnetic tape
683B. direct access from a hard disk
684C. direct access from a floppy disk
685D. direct access from a cassette tape
686Answer: B
687Computer Architecture and Organization
68893. The Device which converts instructions into the binary form that is
689understood by the computer and supply to the computer is known as ---
690----
691A. Input
692B. output
693C. automatic
694D. memory
695Answer: A
696Computer Architecture and Organization
69794. Laptop PCs are also known as __________Computers
698A. Mainframe
699B. Super
700C. Notebook
701D. personal
702Answer: C
703Computer Architecture and Organization
70495. daisy wheel is a type of --- ?
705A. printer
706B. storage device
707C. pointing device
708D.
709Answer: A
710Computer Architecture and Organization
71196. Data transfer to and from peripherals may be handed in any one
712following three possible modes.
713A. Programmed initiated
714B. Interrupt-initiated I/O
715C. Direct memory access
716D. All the above
717Answer: D
718Computer Architecture and Organization
71997. The DMA transfer takes place between magnetic disk and memory is
720takes place in any one of the following method
721A. burst transfer
722B. cycle stealing
723C. program initiated I/O
724D. Both A and B
725Answer: D
726Computer Architecture and Organization
72798. 1. Represent the decimal number 937.25 to BCD form
728A. a. 100000110111.101
729B. b. 100100010111.011
730C. c. 100100110110.00110101
731D. d. 100100110111.00100101
732Answer: D
733Digital Logic
73499. 2. Write the next four numbers in the hex counting sequence
735E9A,E9B,E9C,E9D, _ , _ , _,
736A. a) E9E , E9F, EA0 , EA1
737B. b) E9E , E9F, E100, E101
738C. c) E9E , E9F, E00, E01
739D. d) None of the above
740Answer: A
741Digital Logic
742100. 3. Apply duality principle for the given equation ab’+c+0.d’(1+e)
743A. a) (a+b’)c(1+d’+0.e)
744B. b) (a+b)’c(0+d’+1.e)
745C. c) (ab’)c(1+d’+1.e)
746D. d) (ab’)c(1+d’+0.e)
747Answer: A
748Digital Logic
749101. 4. What is x if (1A5)16 = (1141)x?
750A. a) 5
751B. b) 7
752C. c) 8
753D. d) 9
754Answer: B
755Digital Logic
756102. 5. For the given message 111100 identify the Odd and even parity
757A. a) 1 & 0
758B. b) 1 & 1
759C. c) 0 & 0
760D. d) 0 & 1
761Answer: A
762Digital Logic
763103. 6. A Magnitude Comparator is designed to compare the magnitude
764of two 2-bit numbers, A (A1A0) and B (B1B0). The output of circuit is F
765(A>B). What is the SOP form of F?
766A. a. A1B1’ + A1A0B1B0’ + A1’A0B1’B0’
767B. b. A1B1’ + A1A0B0’ + A0B1’B0’
768C. c. A1B1’ + A1B1B0’ + A0B1’B0’
769D. d. A1B1’ + A1A0B0’+ A1’A0B1’
770Answer: A
771Digital Logic
772104. 7. To design the full adder using multiplexer, determine the number
773of input lines, size of Decoder and number of multiplexers used
774A. a.2, 2x4, 1
775B. b. 4, 2x4, 2
776C. c. 3, 3x8, 2
777D. d. 3, 2x4, 1
778Answer: B
779Digital Logic
780105. 8. The circuit of 3 bit odd parity generator has a combination of
781A. a. 2 x-or gates
782B. b. X-or followed by x-nor
783C. c. X-nor followed by x-or
784D. d. 2 x-nor gates
785Answer: B/C
786Digital Logic
787106. 9. PLA is used to implement the Boolean function in the form of
788A. a. Standard form
789B. b. Canonical form
790C. c. Only sop
791D. d. Only sum of minterms
792Answer: A
793Digital Logic
794107. 10.How many links will be broken at input of AND gates to
795implement a half adder using PLA of size 2x3x1
796A. a. 2,2,2
797B. b. 3,3,3
798C. c. 1,2,3
799D. d. 2,2,1
800Answer: A
801Digital Logic
802108. 11 Given the function G(A,B,C) = Σ (1,3) + d(4,5,6,7). What is the
803minimum number of gate that can be used to implement this function?
804A. a.0
805B. b.1
806C. c.2
807D. d. 3, 2x4, 1
808Answer: A
809Digital Logic
810109. 12. The content of the 4-bit shift register is initially 1101. The
811register is shifted six times to the right, with the serial input being
812101101. What is the content of the register at the end of the shifting
813process?
814A. A. 1011
815B. B. 1101
816C. C. 1110
817D. D. 0111
818Answer: A
819Digital Logic
820110. 13 . A comparison between ring and Johnson counters indicates
821that:
822A. a. A ring counter has fewer flip-flops but requires more decoding circuitry
823B. b. A ring counter has an inverted feedback path
824C. c. A Johnson counter has more flip-flops but less decoding circuitry
825D. d. A Johnson counter has an inverted feedback path
826Answer: D
827Digital Logic
828111. 14. Circuit output functions and flip-flop input functions can be
829obtained from
830A. a. Excitation and output tables
831B. b. State and excitation tables
832C. c. State and output tables
833D. d. State and output tables
834Answer: A
835Digital Logic
836112. 15.5. On the fifth clock pulse, a 4-bit Johnson sequence is Q0 = 0,
837Q1 = 1, Q2 = 1, and Q3 = 1. On the sixth clock pulse, the sequence is
838________.
839A. a. Q0 = 1, Q1 = 0, Q2 = 0, Q3 = 0
840B. b. Q0 = 1, Q1 = 1, Q2 = 1, Q3 = 0
841C. c. Q0 = 0, Q1 = 0, Q2 = 1, Q3 = 1
842D. d. Q0 = 0, Q1 = 0, Q2 = 0, Q3 = 1
843Answer: C
844Digital Logic
845113. Interval between the time of submission and completion of the job
846is called
847A. Waiting time
848B. Turnaround time
849C. Throughput
850D. Response time
851Answer: Turnaround time
852OPERATING SYSTEMS
853114. ___________ is a technique of improving the priority of process
854waiting in Queue for CPU allocation
855A. Starvation
856B. Revocation
857C. Ageing
858D. Relocation
859Answer: Ageing
860OPERATING SYSTEMS
861115. A program in execution is called
862A. Procedure
863B. Instruction
864C. Process
865D. Function
866Answer: Process
867OPERATING SYSTEMS
868116. In which of the following page replacement policies Balady’s
869anomaly occurs?
870A. LRU
871B. NRU
872C. LFU
873D. FIFO
874Answer: FIFO
875OPERATING SYSTEMS
876117. The total time to prepare a disk drive mechanism for a block of data
877to be read from is its
878A. latency
879B. latency plus transmission time
880C. latency plus seek time
881D. latency plus seek time plus transmission time
882Answer: latency plus seek time
883OPERATING SYSTEMS
884118. A set of techniques that allow to execute a program which is not
885entirely in memory is called
886A. demand paging
887B. auxiliary memory
888C. virtual memory
889D. secondary memory
890Answer: virtual memory
891OPERATING SYSTEMS
892119. Jobs which are admitted to the system for processing is called
893A. long-term scheduling
894B. short-term scheduling
895C. medium-term scheduling
896D. queuing
897Answer: long-term scheduling
898OPERATING SYSTEMS
899120. Locality of reference implies that the page reference being made by
900a process
901A. will always be to one of the pages existing in memory.
902B. is likely to be the one of the pages used in the last few page references.
903C. will always be to the page used in the previous page reference.
904D. will always lead to a page fault.
905Answer: is likely to be the one of the pages used in the last few
906page references.
907OPERATING SYSTEMS
908121. ___________ is a technique of temporarily removing inactive
909programs from the memory of computer system
910A. Swapping
911B. Spooling
912C. Semaphore
913D. Scheduler
914Answer: Swapping
915OPERATING SYSTEMS
916122. A critical section is a program segment
917A. which should run in a certain specified amount of time.
918B. which avoids deadlocks.
919C. where shared resources are accessed.
920D. which must be enclosed by a pair of semaphore operations, P and V.
921Answer: where shared resources are accessed.
922OPERATING SYSTEMS
923123. Which scheduling policy is most suitable for a time-shared
924operating system
925A. Elevator.
926B. Shortest-job First.
927C. First-Come-First-Serve.
928D. Round-Robin.
929Answer: Round-Robin.
930OPERATING SYSTEMS
931124. Program ‘preemption’ is
932A. forced de allocation of the CPU from a program which is executing on the CPU.
933B. release of CPU by the program after completing its task.
934C. forced allotment of CPU by a program to itself.
935D. a program terminating itself due to detection of an error.
936Answer: forced de allocation of the CPU from a program which is
937executing on the CPU.
938OPERATING SYSTEMS
939125. The term ‘page traffic’ describes
940A. number of pages in memory at a given instant
941B. number of papers required to be brought in at a given page request.
942C. the movement of pages in and out of memory.
943D. number of pages of executing programs loaded in memory.
944Answer: the movement of pages in and out of memory.
945OPERATING SYSTEMS
946126. The “turn-around” time of a user job is the
947A. time since its submission to the time its results become available.
948B. total time taken to execute the job.
949C. time duration for which the CPU is allotted to the job.
950D. time taken for the job to move from assembly phase to completion phase.
951Answer: total time taken to execute the job.
952OPERATING SYSTEMS
953127. Memory utilization factor shall be computed as follows
954A. memory in use/allocated memory.
955B. memory in use/total memory connected.
956C. memory allocated/free existing memory.
957D. memory committed/total memory available.
958Answer: memory in use/total memory connected.
959OPERATING SYSTEMS
960128. What would be the output of the following: <script
961type="text/javascript"> x=3+'2'; y=4+"5"; document.write(x + y);
962</script>
963A. 15
964B. 3245
965C. 77
966D. None
967Answer: 3245
968Scripting Languages
969129. <script type="text/javascript" language="javascript"> var a =
970"India"; var result = a.split(""); document.write(result); </script>
971A. India
972B. I n d i a
973C. I,n,d,i,a
974D. None
975Answer: I,n,d,i,a
976Scripting Languages
977130. What happens to the following code: <html> <script
978language="javascript"> function f1() { document.write("In f1();"); function
979f2() { document.write("In f2();"); } } </script> <input type="button" value=
980"click" onClick="f1();"> </html>
981A. no output
982B. In f1();
983C. In f1();Inf2();
984D. None
985Answer: In f1();
986Scripting Languages
987131. <html> <script language="javascript"> function x() { var s= "Good
988100%"; var pattern = /\D/g; var output= s.match(pattern);
989document.write(output); } </script> <input type="button" value= "click"
990onClick="x();"> <html>
991A. Good %
992B. 1,0,0
993C. G,o,o,d,%
994D. Error
995Answer: G,o,o,d,%
996Scripting Languages
997132. <script Xlanguage="javascript"> var a="VIT Vellore";
998alert(a.charAt(a.length()-1)); </script>
999A. e
1000B. erroe
1001C. r
1002D. None
1003Answer: error
1004Scripting Languages
1005133. Syntax for creating a RegExp object: (a). var txt=new
1006RegExp(pattern,attributes); (b). var txt=/pattern/attributes; Which of the
1007above mentioned syntax will correct?
1008A. a) only
1009B. (b) only
1010C. Both (a) and (b)
1011D. None
1012Answer: Both (a) and (b)
1013Scripting Languages
1014134. <script language="javascript"> var arr= new Array(); arr[0] =
1015"Javascript"; arr[1]="supports" arr[2]="object oriented" arr[3] =
1016"paradigm"; document.write(arr[0,1,2,3]); </script> What is the output?
1017A. Error
1018B. Javascript
1019C. Javascript supports object oriented paradigm
1020D. paradigm
1021Answer: paradigm
1022Scripting Languages
1023135. <script language="javascript"> function demo() {
1024document.write(2+5+'8'); } </script> <input type="button" value= "click"
1025onClick="demo();"> What will be the result?
1026A. 15
1027B. 78
1028C. 258
1029D. Error
1030Answer: 78
1031Scripting Languages
1032136. How to assign a function to a variable with the JavaScript Function
1033constructor ? a) var f=Function("x","y","return x+y"); b) var
1034f=Function(x,y){ return x+y;} c) var f= new Function("x", "y", "return x +
1035y");
1036A. a) only
1037B. (c) only
1038C. Both (a) and (c)
1039D. None
1040Answer: None
1041Scripting Languages
1042137. In JavaScript, Window.prompt() method return true or false value ?
1043A. TRUE
1044B. FALSE
1045C.
1046D.
1047Answer: FALSE
1048Scripting Languages
1049138. The following statement does not declares dynamic array in
1050VBscript. Dim Names()
1051A. TRUE
1052B. FALSE
1053C.
1054D.
1055Answer: FALSE
1056Scripting Languages
1057139. In Vbscript, one can invoke the function with and without
1058the______________ keyword
1059A.
1060B.
1061C.
1062D.
1063Answer: call
1064Scripting Languages
1065140. VBScript does not support early binding – True/False
1066A. TRUE
1067B. FALSE
1068C.
1069D.
1070Answer: TRUE
1071Scripting Languages
1072141. ______________Statement forces explicit declaration of all variables
1073in a Vbscript
1074A.
1075B.
1076C.
1077D.
1078Answer: option explicit
1079Scripting Languages
1080142. What's the default setting for the expires attribute of the
1081document.cookie property?
1082A. The duration of the browser session.
1083B. The duration the current document stays loaded
1084C. Twenty-four hours from the time the cookie is set.
1085D. There is no default setting
1086Answer: The duration of the browser session.
1087Scripting Languages
1088143. A language is represented by a regular expression (a)*(a + ba).
1089Which of the following string does not belong to the regular set
1090represented by the above expression.
1091A. aaa
1092B. aba
1093C. abab
1094D. aa
1095Answer: C
1096Algorithm Design and Analysis
1097144. A language L is accepted by a FSA if it is
1098A. CFL
1099B. CSL
1100C. Recursive
1101D. Regular
1102Answer: D
1103Algorithm Design and Analysis
1104145. To generate a Counter Automaton we need……
1105A. Need multi tape TM
1106B. Need Multi head TM
1107C. Need Multi tape and multi head TM
1108D. Single Tape and Head TM
1109Answer: D
1110Algorithm Design and Analysis
1111146. Which of the following statements is false?
1112A. The halting problem for Turing machines is undecidable
1113B. Determining whether a context-free grammar is ambiguous is undecidable
1114C. Given two arbitrary context-free grammar, G1 and G2, it is undecidable with L(G1) = L(G2)
1115D. Given two regular grammars G1 and G2, it is undecidable whether L(G1) = L(G2)
1116Answer: B
1117Algorithm Design and Analysis
1118147. Consider three decision problems P1, P2 and P3. It is known that
1119P1 is decidable and P2 is undecidable. Which one of the following is
1120TRUE?
1121A. P3 is decidable if P1 is reducible to P3
1122B. P3 is undecidable if P3 is reducible to P2
1123C. P3 is undecidable if P2 is reducible to P3
1124D. P3 is decidable if P3 is reducible to P2’s complement
1125Answer: A
1126Algorithm Design and Analysis
1127148. Consider three problems P1, P2 and P3. It is known that P1 has
1128polynomial time solution and P2 is NP-complete and P3 is in NP. Which
1129one of the following is true?
1130A. P3 has polynomial time solution if P1 is polynomial time reducible to P3
1131B. P3 is NP complete if P3 is polynomial time reducible to P2
1132C. P3 is NP complete if P2 is reducible to P3
1133D. P3 has polynomial time complexity and P3 is reducible to P2
1134Answer: C
1135Algorithm Design and Analysis
1136149. Which of the following statement is false?
1137A. Divide and Conquer is independent
1138B. Dynamic programming is dependent
1139C. Dynamic programming is independent
1140D. None of the above
1141Answer: B
1142Algorithm Design and Analysis
1143150. Aggregate analysis determines the…………… T(n) on the total cost
1144of a sequence of n operations.
1145A. Lower bound
1146B. upper bound
1147C. Middle bound
1148D. None.
1149Answer: B
1150Algorithm Design and Analysis
1151151. Dynamic programming divides problems into a number of
1152conflicting objective functions
1153A. decision stages.
1154B. unrelated constraints.
1155C. policies.
1156D. none of the above
1157Answer: A
1158Algorithm Design and Analysis
1159152. The ________ cipher reorders the plaintext characters to create a
1160ciphertext.
1161A. Substitution
1162B. Transposition
1163C. either (a) or (b)
1164D. neither (a) nor (b)
1165Answer: B
1166Algorithm Design and Analysis
1167153. Jarvi's March algorithm uses _________ approach
1168A. Rational Sweep
1169B. Divide and Conquer
1170C. Top down
1171D. Bottom Up
1172Answer: A
1173Algorithm Design and Analysis
1174154. The first step in developing a parallel algorithm is to decompose the
1175problem into tasks that can be executed………
1176A. serially
1177B. Consecutively
1178C. Concurrently
1179D. None
1180Answer: C
1181Algorithm Design and Analysis
1182155. Achieving mutual exclusion,
1183A. is only required in distributed systems, and also for single-processor systems;
1184B. enhance the performance;
1185C. is necessary for a process to read or write certain shared data;
1186D. none of the above.
1187Answer: C
1188Algorithm Design and Analysis
1189156. In the analysis of Randomized Quick sort, what is Pr(Xij = 1)?
1190Assume that i ≠ j
1191A. Pr(Xij = 1) = 1/(|j − i| + 1)
1192B. Pr(Xij = 1) = 1/(j + i)
1193C. Pr(Xij = 1) = 2/(|j − i| + 1)
1194D. Pr(Xij = 1) = 2/(j + i)
1195Answer: C
1196Algorithm Design and Analysis
1197157. Minimum-path search is a(n) _____ problem
1198A. Non optimization
1199B. optimization
1200C. behavior-of-program;
1201D. Interactive computation
1202Answer: B
1203Algorithm Design and Analysis
1204158. Which of the following data type can be used for storing a floating
1205A. int
1206B. long int
1207C. double
1208D. unsigned char
1209Answer: C
1210C Programming
1211159. point constant?
1212A.
1213B.
1214C.
1215D.
1216Answer:
1217C Programming
1218160. What is the result of running the following code snippet?float result;
1219result = 5/2; printf("%.1f",result);
1220A. 2
1221B. 2.5
1222C. 0
1223D.
1224Answer: B
1225C Programming
1226161. Output of running the following code snippet is int i; for ( i = 0; i < 3;
1227i++ ) { if(i == 2) { printf("%d\t",i); } }
1228A. 0 1 2 3
1229B. 0 1 2
1230C. 2
1231D. none
1232Answer: C
1233C Programming
1234162. What is the result of running the following code snippet if(0)
1235printf("The Sun rises in the East"); else printf("The Sun rises in the
1236West");
1237A. The Sun rises in the East
1238B. The Sun rises in the West
1239C. Compilation Error
1240D. none
1241Answer: B
1242C Programming
1243163. ____________ is a symbolic language
1244A. Assembly language
1245B. COBOL
1246C. FORTRAN
1247D. BASIC
1248Answer: A
1249C Programming
1250164. __________ in machine language tells the computer what function to
1251perform
1252A. Opcode
1253B. OperationID
1254C. both
1255D. none
1256Answer: A
1257C Programming
1258165.
1259A.
1260B.
1261C.
1262D.
1263Answer:
1264C Programming
1265166.
1266A.
1267B.
1268C.
1269D.
1270Answer:
1271C Programming
1272167. The conversion specifier for printing an integer in hexadecimal
1273number using printf is
1274A. %x
1275B. %d
1276C. %ld
1277D. %hx
1278Answer: A
1279C Programming
1280168.
1281A.
1282B.
1283C.
1284D.
1285Answer:
1286C Programming
1287169. The following C statement causes an infinite loop (true/false):while
1288(1);
1289A. TRUE
1290B. FALSE
1291C.
1292D.
1293Answer: A
1294C Programming
1295170.
1296A.
1297B.
1298C.
1299D.
1300Answer:
1301C Programming
1302171. Output of following statement is:
1303A. 5
1304B. 6
1305C. Compilation error
1306D. none
1307Answer: C
1308C Programming
1309172. #define NUM 5
1310A.
1311B.
1312C.
1313D.
1314Answer:
1315C Programming
1316173. int main()
1317A.
1318B.
1319C.
1320D.
1321Answer:
1322C Programming
1323174. {
1324A.
1325B.
1326C.
1327D.
1328Answer:
1329C Programming
1330175. NUM++;
1331A.
1332B.
1333C.
1334D.
1335Answer:
1336C Programming
1337176. printf("%d", NUM);
1338A.
1339B.
1340C.
1341D.
1342Answer:
1343C Programming
1344177. return 0;
1345A.
1346B.
1347C.
1348D.
1349Answer:
1350C Programming
1351178. Output of the following statement is
1352A.
1353B.
1354C.
1355D.
1356Answer:
1357C Programming
1358179. int i = 5;
1359A. Structured programming language
1360B. Object Oriented Programming
1361C. Compilation error
1362D. none
1363Answer: C
1364C Programming
1365180. if(i = 5)
1366A.
1367B.
1368C.
1369D.
1370Answer:
1371C Programming
1372181. {
1373A.
1374B.
1375C.
1376D.
1377Answer:
1378C Programming
1379182. puts("Structured programming language");
1380A.
1381B.
1382C.
1383D.
1384Answer:
1385C Programming
1386183. }
1387A.
1388B.
1389C.
1390D.
1391Answer:
1392C Programming
1393184. else
1394A.
1395B.
1396C.
1397D.
1398Answer:
1399C Programming
1400185. {
1401A.
1402B.
1403C.
1404D.
1405Answer:
1406C Programming
1407186. puts("Object oriented programming language");
1408A.
1409B.
1410C.
1411D.
1412Answer:
1413C Programming
1414187. }
1415A.
1416B.
1417C.
1418D.
1419Answer:
1420C Programming
1421188.
1422A.
1423B.
1424C.
1425D.
1426Answer:
1427C Programming
1428189. What is the value of variable ‘i’ after running the following
1429statements?
1430A.
1431B.
1432C.
1433D.
1434Answer:
1435C Programming
1436190. int main( ){ i = 10;
1437A. 0
1438B. 1
1439C. 2
1440D. 2.5
1441Answer: B
1442C Programming
1443191. i = i / 2;
1444A.
1445B.
1446C.
1447D.
1448Answer:
1449C Programming
1450192. i = i % 2; return 0}
1451A.
1452B.
1453C.
1454D.
1455Answer:
1456C Programming
1457193. void *ptr; mystruct myArray[10]; ptr=myArray; Which of the
1458following is the correct way to increment the variable "ptr"?
1459A. ptr=ptr+sizeof(mystruct)
1460B. ptr+(int)ptr
1461C. ptr+sizeof(myArray)
1462D. ptr+sizeof(ptr)
1463Answer: A
1464C Programming
1465194.
1466A.
1467B.
1468C.
1469D.
1470Answer:
1471C Programming
1472195.
1473A.
1474B.
1475C.
1476D.
1477Answer:
1478C Programming
1479196.
1480A.
1481B.
1482C.
1483D.
1484Answer:
1485C Programming
1486197.
1487A.
1488B.
1489C.
1490D.
1491Answer:
1492C Programming
1493198.
1494A.
1495B.
1496C.
1497D.
1498Answer:
1499C Programming
1500199.
1501A.
1502B.
1503C.
1504D.
1505Answer:
1506C Programming
1507200. int testarray[3][2][2] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
1508A. 3
1509B. 5
1510C. 7
1511D. 11
1512Answer: D
1513C Programming
1514201. What value does testarray[2][1][0] in the sample code above
1515contain?
1516A.
1517B.
1518C.
1519D.
1520Answer:
1521C Programming
1522202.
1523A.
1524B.
1525C.
1526D.
1527Answer:
1528C Programming
1529203. int a=10,b;
1530A. 12,10,11,13
1531B. 22,10,11,13
1532C. 12,11,12,11
1533D. 22,13,13,13,13
1534Answer: D
1535C Programming
1536204. b=a++ + ++a;
1537A.
1538B.
1539C.
1540D.
1541Answer:
1542C Programming
1543205. printf(“%d,%d,%d,%d”,b,a++,a,++a);
1544A.
1545B.
1546C.
1547D.
1548Answer:
1549C Programming
1550206. what will be the output when following code is executed
1551A.
1552B.
1553C.
1554D.
1555Answer:
1556C Programming
1557207.
1558A.
1559B.
1560C.
1561D.
1562Answer:
1563C Programming
1564208. . void Funct(int x)
1565A. 1,2,3,4,5,5
1566B. 4,3,2,1,0,0
1567C. 0,0,1,2,3,4
1568D. 5,4,3,2,1,0
1569Answer: C
1570C Programming
1571209. {if(x>0)
1572A.
1573B.
1574C.
1575D.
1576Answer:
1577C Programming
1578210. Funct(--x);
1579A.
1580B.
1581C.
1582D.
1583Answer:
1584C Programming
1585211. printf(“%d”,x);
1586A.
1587B.
1588C.
1589D.
1590Answer:
1591C Programming
1592212. }
1593A.
1594B.
1595C.
1596D.
1597Answer:
1598C Programming
1599213. int main()
1600A.
1601B.
1602C.
1603D.
1604Answer:
1605C Programming
1606214. {
1607A.
1608B.
1609C.
1610D.
1611Answer:
1612C Programming
1613215. Funct(5);
1614A.
1615B.
1616C.
1617D.
1618Answer:
1619C Programming
1620216. return 0;}
1621A.
1622B.
1623C.
1624D.
1625Answer:
1626C Programming
1627217.
1628A.
1629B.
1630C.
1631D.
1632Answer:
1633C Programming
1634218.
1635A.
1636B.
1637C.
1638D.
1639Answer:
1640C Programming
1641219. . How is a variable accessed from another file?
1642A. The global variable is referenced via the extern specifier
1643B. The global variable is referenced via the auto specifier.
1644C. The global variable is referenced via the pointer specifier.
1645D. The global variable is referenced via the ext specifier.
1646Answer: A
1647C Programming
1648220. Which of the statement is false with respect to Virtual memory and
1649Cache?
1650A. The Size of processor address determines the size of Virtual memory
1651B. Virtual memory can be classified as pages and segments
1652C. Virtual memory replacement is controlled by OS
1653D. Replacement on cache miss controlled by OS
1654Answer: D
1655Computer Architecture and Organization
1656221. The capacity of a memory is defined by the number of words
1657multiplied by the number of bits/word. How many separate address and
1658data lines are needed for a memory of 4K*16?
1659A. 10 address,16 data lines
1660B. 11 address,8 data lines
1661C. 12 address ,16 data lines
1662D. 12 address ,12 data lines
1663Answer: C
1664Computer Architecture and Organization
1665222. Which of the following is true?
1666A. Unless enabled, a CPU will not be able to process interrupts
1667B. Loop Instructions cannot be interrupted till they complete
1668C. A processor check for interrupts before they executing a new instruction
1669D. Only level triggered interrupts are possible on microprocessors
1670Answer: A
1671Computer Architecture and Organization
1672223. Which of the following is not a form of memory
1673A. Instruction cache
1674B. Instruction register
1675C. Instruction Opcode
1676D. Translation look aside buffer
1677Answer: C
1678Computer Architecture and Organization
1679224. -----------------Access method, Cylce time is same for all blocks of
1680memory.
1681A. Random Access
1682B. Sequential Access
1683C. Direct Access
1684D. Semi Random Access
1685Answer: A
1686Computer Architecture and Organization
1687225. Assume Word 20 contains 40
1688A.
1689B.
1690C.
1691D.
1692Answer:
1693Computer Architecture and Organization
1694226. Word 30 contains 50
1695A.
1696B.
1697C.
1698D.
1699Answer:
1700Computer Architecture and Organization
1701227. Word 40 contains 60
1702A.
1703B.
1704C.
1705D.
1706Answer:
1707Computer Architecture and Organization
1708228. Word 50 contains 70
1709A.
1710B.
1711C.
1712D.
1713Answer:
1714Computer Architecture and Organization
1715229. Which of the following instructions does not, Load 60 into the
1716Accumulator?
1717A. Load immediate 60
1718B. Load Direct 30
1719C. Load indirect 20
1720D. Both A) & C)
1721Answer: B
1722Computer Architecture and Organization
1723230. The common fields found in instruction formats are:
1724A. opcode field, address field, mode field
1725B. opcode field, operand field, address field, mode field,
1726C. opcode field, address field, next address field, mode field.
1727D. opcode field, address field1, address field1, mode field,
1728Answer: A
1729Computer Architecture and Organization
1730231. What is the range of numbers for n-bits if negative numbers are
1731represented in two's complement format?
1732A. (-2n – 1 to 2n – 1)
1733B. (-2n-1 to 2n-1-1)
1734C. (0 to 2n-1)
1735D. (-2n to 2n-1-1)
1736Answer: B
1737Computer Architecture and Organization
1738232. If a number has k-bits(k is even), how many bits will its square-root
1739have?
1740A. K-1
1741B. K/2
1742C. K
1743D. k-2
1744Answer: B
1745Computer Architecture and Organization
1746233. Floating point numbers are typically packet in to a computer datum
1747as the sign bit, the exponent field, and the significand (mantissa) , from
1748left to right. Specify the the fields IEEE double formats.
1749A. 1,8,23
1750B. 1,11,52
1751C. 1,5,10
1752D. 1,5,112
1753Answer: B
1754Computer Architecture and Organization
1755234. What is the access type of cache memories?
1756A. Associative
1757B. Direct
1758C. Random
1759D. Sequential
1760Answer: A
1761Computer Architecture and Organization
1762235. Cycle Stealing is used in
1763A. Interrupt based data transfer
1764B. DMA based data transfer
1765C. Polled mode data transfer
1766D. None of these
1767Answer: B
1768Computer Architecture and Organization
1769236. Data transfer rate for Random access Memory is
1770A. TN=TA+N/R
1771B. 1/cycle time
1772C. Access time + minimum time between two consequetive access operation
1773D. access time + cycle time
1774Answer: B
1775Computer Architecture and Organization
1776237.
1777A. (11100110)2
1778B. (10011000)2
1779C. (10011000)2
1780D. (01100110)2
1781Answer: A
1782Computer Architecture and Organization
1783238. If a register containing data (11001100)2 is subjected to arithmetic
1784shift right operation, then the content of the register after one arithmetic
1785shift right shall be
1786A.
1787B.
1788C.
1789D.
1790Answer:
1791Computer Architecture and Organization
1792239. PAL circuit consists of
1793A. Fixed OR and programmable AND logic
1794B. Programmable OR and Fixed AND logic
1795C. Fixed OR and fixed AND logic
1796D. Programmable OR and Programmable AND logic
1797Answer: A
1798Computer Architecture and Organization
1799240. the main difference between the variuos 802.11 standards is the
1800A. data transfer rate
1801B. maximum allowable cable length
1802C. simplicity of installation
1803D. collision detection rate
1804Answer: A
1805Computer Networks
1806241. what is the default subnet mask for a class C network?
1807A. 127.0.0.0
1808B. 255.0.0.0
1809C. 255.255.0.0
1810D. 255.255.255.0
1811Answer: D
1812Computer Networks
1813242. when you ping the loopback address, a packet is sent wher?
1814A. on the network
1815B. down through the layers of the IP architecture and then up the layres again
1816C. across the wire
1817D. through the loopback dongle
1818Answer: B
1819Computer Networks
1820243. In CRC there is no error if the remainder at the receiver is ___
1821A. equal to the remainder at the sender
1822B. zero
1823C. non zero
1824D. the quotient at the sender
1825Answer: B
1826Computer Networks
1827244. what type of network device allows you to share your connection to
1828the internet with other computer in your home?
1829A. ethernet card
1830B. NIC
1831C. router
1832D. Cat5
1833Answer: C
1834Computer Networks
1835245. Frequency of failure and network recovery time after a failure are
1836measures of the ___ of a network
1837A. performance
1838B. reliability
1839C. security
1840D. feasibility
1841Answer: B
1842Computer Networks
1843246. The Hamming distance between 100 and 001 is
1844A. 0
1845B. 1
1846C. 2
1847D. 3
1848Answer: C
1849Computer Networks
1850247. In CSMA, the vulnerable period is equal to
1851A. 1 frame transmission time
1852B. one way propagation time
1853C. 2 frame transmission times
1854D. round trip time
1855Answer: B
1856Computer Networks
1857248. How long is an IPv6 address?
1858A. 32 bits
1859B. 128 bytes
1860C. 64 bits
1861D. 128 bits
1862Answer: D
1863Computer Networks
1864249. which protocol does ping use?
1865A. TCP
1866B. ARP
1867C. ICMP
1868D. BootP
1869Answer: C
1870Computer Networks
1871250. What does router do in a network?
1872A. forwards a packet to all outgoing links
1873B. forwards a packet to the next free outgoing link
1874C. determines on which outgoing linka packet is to be forwarded
1875D. frowards a packet to all outgoing links except the orginated link
1876Answer: C
1877Computer Networks
1878251. Linear topology is also called?
1879A. Star topology
1880B. Bus topology
1881C. Ring topology
1882D. Mesh topology
1883Answer: B
1884Computer Networks
1885252. A logical network that consisits of two or more physical networks?
1886A. Networking
1887B. Internetworking
1888C. LAN
1889D. WAN
1890Answer: B
1891Computer Networks
1892253. UDP has which of the following characteristics?
1893A. Three way handshake for connection establishment
1894B. connection state at the server
1895C. regulated send rate
1896D. checksum for error detection
1897Answer: D
1898Computer Networks
1899254. which of the following is not provided by TCP?
1900A. reliable, in order data delivery
1901B. flow control
1902C. congestion control
1903D. minimum bandwidth guarntees
1904Answer: D
1905Computer Networks
1906255. Every node has a point to point connection to every other node in
1907the network
1908A. Bus
1909B. Star
1910C. Mesh
1911D. Ring
1912Answer: C
1913Computer Networks
1914256. Which of the following is the functionality of Physical Layer
1915A. Type of Encoding
1916B. Encryption
1917C. Mail Services
1918D. Logical address
1919Answer: A
1920Computer Networks
1921257. Which multiplexing method is common for multiplexing optical
1922signals to allow the multiplex- ing of signals with a very high frequency
1923A. FDM
1924B. TDM
1925C. WDM
1926D. FHSS
1927Answer: C
1928Computer Networks
1929258. A need for end-to-end addressing during the setup and teardown
1930phases to make the corresponding entry in the switching table
1931A. Datagram
1932B. Vitual Circuit
1933C. Ciruit Switching
1934D. ATM
1935Answer: B
1936Computer Networks
1937259. It is the number of differences between correspond bits between
1938two words
1939A. CRC
1940B. LRC
1941C. Checksum value
1942D. Hamming distance
1943Answer: D
1944Computer Networks
1945260. Character-oriented protocols use a method to be able to carry an 8-
1946bit pattern that is same as the flag
1947A. Byte-Stuffing
1948B. Bit - Stuffing
1949C. Flow Control
1950D. Error Control
1951Answer: A
1952Computer Networks
1953261. A random access method, nwhere no station is superior to another
1954station and none is assigned the control over another
1955A. Aloha
1956B. Reservation
1957C. Token Passing
1958D. Channelization
1959Answer: A
1960Computer Networks
1961262. A device which can raise bandwidth and can seperate collision
1962domain
1963A. Router
1964B. Gateway
1965C. Brouter
1966D. Bridge
1967Answer: D
1968Computer Networks
1969263. In UNI total length of VPI + VCI is
1970A. 24 bits
1971B. 22 bits
1972C. 20 bits
1973D. 26 bits
1974Answer: A
1975Computer Networks
1976264. What type of address is this 127.240.103.125
1977A. Class A
1978B. Class B
1979C. Class C
1980D. Class D
1981Answer: A
1982Computer Networks
1983265. IPv6 normally provides a connectionless service, but it can provide
1984a connection - oriented service if uses which of the following
1985A. Service Type
1986B. Checksum
1987C. Flow label
1988D. FragmentationOffset
1989Answer: C
1990Computer Networks
1991266. Which of the following is a Intra Domain Protocol
1992A. OSPF
1993B. IGMP
1994C. RIP
1995D. TCP
1996Answer: C
1997Computer Networks
1998267. Those port numbers are only used for the duration of a single
1999communication between client and server, so they are indeed short-lived
2000A. Ephernal Port Numbers
2001B. Fixed Port Numbers
2002C. Well Known Port Numbers
2003D. Dynamic Port Numbers
2004Answer: A
2005Computer Networks
2006268. Which con-gestion control policies try to alleviate the effects of
2007congestion
2008A. Open Loop Congestion Control
2009B. Closed Loop Congestion Control
2010C. Forward Explicit Congestion Control
2011D. Backward Explicit Congestion Control
2012Answer: B
2013Computer Networks
2014269. Which technology allows an organization to use the global Internet
2015yet safely maintain private internal communication
2016A. Firewall
2017B. Kerbros
2018C. Vitual Private Network
2019D. Frame Relay
2020Answer: C
2021Computer Networks
2022270. A complete microcomputer system consists of
2023A. microprocessor
2024B. memory
2025C. Peripheral equipment
2026D. All of the above
2027Answer: All of the above
2028Computer organization and design
2029271. Pipelining strategy is called implement
2030A. instruction execution
2031B. instruction prefetch
2032C. instruction decoding
2033D. instruction manipulation
2034Answer: instruction prefetch
2035Computer organization and design
2036272. Interrupts which are initiated by an instruction are
2037A. internal
2038B. external
2039C. hardware
2040D. software
2041Answer: software
2042Computer organization and design
2043273. A timing sharing system imply
2044A. more than one processor in the system
2045B. more than one processor in the system
2046C. more than one memory in the system
2047D. None of the above
2048Answer: more than one processor in the system
2049Computer organization and design
2050274. The performance of a processor can be measured using
2051A. Clocks period
2052B. Cycles per Instruction
2053C. Throughput
2054D. All of the above
2055Answer: All of the above
2056Computer organization and design
2057275. Which of the following is not a state of the instruction cycle
2058A. Operand address calculation
2059B. Data write back
2060C. Instruction fetch
2061D. Instruction fetch
2062Answer: Data write back
2063Computer organization and design
2064276. Which of the following is a bus arbitration scheme?
2065A. Round-robin
2066B. First come first serve
2067C. Priority
2068D. All of the above
2069Answer: All of the above
2070Computer organization and design
2071277. When is a cache block is written into the main memory
2072A. Every cycle
2073B. Dirty bit is set
2074C. Valid bit is not set
2075D. None of the above
2076Answer: Dirty bit is set
2077Computer organization and design
2078278. Which of the following is a example for a communication I/O?
2079A. Monitor
2080B. Mouse
2081C. Modem
2082D. USB
2083Answer: Modem
2084Computer organization and design
2085279. Memory access in RISC architecture is limited to instructions
2086A. CALL and RET
2087B. PUSH and POP
2088C. STA and LDA
2089D. MOV and JMP
2090Answer: STA and LDA
2091Computer organization and design
2092280. Redundancy is a built-in feature here
2093A. Serial I/O tapes
2094B. RAID
2095C. Optical disks
2096D. Magnetic disks
2097Answer: RAID
2098Computer organization and design
2099281. Microprocessor 8085 can address location upto
2100A. 32K
2101B. 128K
2102C. 64K
2103D. 1M
2104Answer: 64K
2105Computer organization and design
2106282. A microporgram is sequencer perform the operation
2107A. execute
2108B. read and execute
2109C. read and write
2110D. execute and write
2111Answer: read and execute
2112Computer organization and design
2113283. RAID level 0 is primarily used in applications where
2114A. Cost is a priority
2115B. Area is a priority
2116C. Reliability is a priority
2117D. All of the above
2118Answer: Cost is a priority
2119Computer organization and design
2120284. How often/how is data written into the ROM
2121A. Anytime/when required
2122B. Before use – by microprogramming
2123C. During manufacturing
2124D. All of the above
2125Answer: During manufacturing
2126Computer organization and design
2127285. int main() { int i; int a[3]={1,2,3}; int *b[3]={&a[0],&a[1],&a[2]};
2128printf("%d",*b[1]); }
2129A. a)address of a[1]
2130B. b)2
2131C. c)3
2132D. d)Compiler Error
2133Answer: b)2
2134Computer Programming and Problem Solving
2135286. #include<stdio.h> #include<conio.h> int main() { int sum = 0; int i=1;
2136while(i <= 20) { if((i%2) == 1) { ++i; continue; } sum = sum + i; ++i; }
2137printf("%d",sum); getch(); return 0; }
2138A. Sum of even numbers from 1 to 20
2139B. Sum of odd numbers from 1 to 20
2140C. Sum of first 20 natural numbers
2141D. Error
2142Answer: Sum of even numbers from 1 to 20
2143Computer Programming and Problem Solving
2144287. Initialization of the array int a[4]={2,1} will assign
2145A. a) a[0]=2,a[1]=0,a[2]=2,a[3]=0
2146B. b) a[0]=2,a[1]=1,a[2]=0,a[3]=0,
2147C. c) a[0]=2,a[1]=1,a[2]=garbage,a[3]=garbage value
2148D. d) a[0]=2,a[1]=2,a[2]=2,a[3]=garbage value
2149Answer: b) a[0]=2,a[1]=1,a[2]=0,a[3]=0,
2150Computer Programming and Problem Solving
2151288. If S has got an ascii value 83 and s has an ascii value 115. The
2152strcmp function on these two strings strcmp(“Sam”,”sam”) returns
2153A. -1
2154B. 1
2155C. 0
2156D. Error
2157Answer: -1
2158Computer Programming and Problem Solving
2159289. There are two arrays int a[3]={1,2,3} and b[3]={2,4,6} What will be
2160the output of the following statement? a=b;
2161A. a) the values of array a get assigned to b
2162B. b) the values of array b get assigned to a
2163C. c) there is a compilation error
2164D. d) the values of a and b are swapped.
2165Answer: c) there is a compilation error
2166Computer Programming and Problem Solving
2167290. Which array technique the following program represents if n is the
2168size of the array for(i=0;i<=n/2;i++) { t=a[i]; a[i]=a[n-i]; a[n-i]=t; }
2169A. a) Array counting
2170B. b) Array order reversal
2171C. c) Finding the maximum number in a array
2172D. d) Array sorting
2173Answer: a) Array order reversal
2174Computer Programming and Problem Solving
2175291. What will be output of this program (the input is - Computer
2176Programming)? #include<stdio.h> #include<conio.h> #include<string.h>
2177int main() { char name[20]; printf("Enter your name"); scanf("%s",name);
2178printf("%s",name); getch(); }
2179A. a) compilation error
2180B. b) computer programming
2181C. c) Computer
2182D. d) Programming
2183Answer: c) Computer
2184Computer Programming and Problem Solving
2185292. int main() { float a[]={1,2,3}; printf("%d",sizeof(a)); }
2186A. a)Compiler Error
2187B. b)12 Bytes
2188C. c)4 Bytes
2189D. d)Run Time Error
2190Answer: b)12 Bytes
2191Computer Programming and Problem Solving
2192293. int a=10; printf("%d &i",a,10);
2193A. a)error
2194B. b)10
2195C. c)10 10
2196D. d)None
2197Answer: c)10 10
2198Computer Programming and Problem Solving
2199294. int a = 4, b = 7,c; c = a = = b; printf("%d",c);
2200A. a)0
2201B. b)error
2202C. c)1
2203D. d)Garbage Value
2204Answer: a)0
2205Computer Programming and Problem Solving
2206295. void main() { printf("hello"); main(); } What will be the output of the
2207above code?
2208A. a)1
2209B. b)2
2210C. c)Infinite number of times
2211D. d)none of these
2212Answer: c)Infinite number of times
2213Computer Programming and Problem Solving
2214296. int main() { int a = 2; switch(a) { case 1: printf("goodbye"); break;
2215case 2: continue; case 3: printf("bye"); } }
2216A. a)error
2217B. b)goodbye
2218C. c)bye
2219D. d)byegoodbye
2220Answer: a)error
2221Computer Programming and Problem Solving
2222297. int i=1,k=i-- +2; printf("%d",k);
2223A. a)Error
2224B. b)3
2225C. c)2
2226D. d)1
2227Answer: b)3
2228Computer Programming and Problem Solving
2229298. What will be the output of following statements ? char x[ ] = "hello
2230hi"; printf("%d%d",sizeof(*x),sizeof(x));
2231A. a)88
2232B. b)18
2233C. c)29
2234D. d)19
2235Answer: d)19
2236Computer Programming and Problem Solving
2237299. int a=11,b=6,c=9,d,x; d= (a >(x=(c>b?c:b))?a:x); printf("%d",d);
2238what is the output of the above code?
2239A. a)11
2240B. b)6
2241C. c)9
2242D. d)error
2243Answer: a)11
2244Computer Programming and Problem Solving
2245300. The _______ is the physical path over which a message travels.
2246A. Protocol
2247B. Medium
2248C. Signal
2249D. All the above
2250Answer: Medium
2251Data Communication
2252301. The information to be communicated in a data communications
2253system is the _______.
2254A. Medium
2255B. Protocol
2256C. Message
2257D. Transmission
2258Answer: Message
2259Data Communication
2260302. Frequency of failure and network recovery time after a failure are
2261measures of the _______ of a network
2262A. Performance
2263B. Reliability
2264C. Security
2265D. Feasibility
2266Answer: Reliability
2267Data Communication
2268303. An unauthorized user is a network _______ issue
2269A. Performance
2270B. Reliability
2271C. Security
2272D. All the above
2273Answer: Security
2274Data Communication
2275304. Which topology requires a central controller or hub?
2276A. Mesh
2277B. Star
2278C. Bus
2279D. Ring
2280Answer: Star
2281Data Communication
2282305. Which topology requires a multipoint connection?
2283A. Mesh
2284B. Star
2285C. Bus
2286D. Ring
2287Answer: Bus
2288Data Communication
2289306. Communication between a computer and a keyboard involves
2290______________ transmission
2291A. simplex
2292B. half-duplex
2293C. full-duplex
2294D. automatic
2295Answer: Simplex
2296Data Communication
2297307. A television broadcast is an example of _______ transmission
2298A. simplex
2299B. half-duplex
2300C. full-duplex
2301D. automatic
2302Answer: Simplex
2303Data Communication
2304308. A _______ connection provides a dedicated link between two
2305devices.
2306A. point-to-point
2307B. multipoint
2308C. primary
2309D. secondary
2310Answer: point-to-point
2311Data Communication
2312309. In a _______ connection, more than two devices can share a single
2313link
2314A. point-to-point
2315B. multipoint
2316C. primary
2317D. secondary
2318Answer: Multipoint
2319Data Communication
2320310. In _______ transmission, the channel capacity is shared by both
2321communicating devices at all times
2322A. simplex
2323B. half-duplex
2324C. full-duplex
2325D. half-simplex
2326Answer: full-duplex
2327Data Communication
2328311. In the original ARPANET, _______ were directly connected together
2329A. IMPs
2330B. host computers
2331C. networks
2332D. routers
2333Answer: IMPs
2334Data Communication
2335312. This was the first networ
2336A. CSNET
2337B. NSFNET
2338C. ANSNET
2339D. ARPANET
2340Answer: ARPANET
2341Data Communication
2342313. Which organization has authority over interstate and international
2343commerce in the communications field?
2344A. ITU-T
2345B. IEEE
2346C. FCC
2347D. ISOC
2348Answer: FCC
2349Data Communication
2350314. _______ are special-interest groups that quickly test, evaluate, and
2351standardize new technologies.
2352A. Forums
2353B. Regulatory agencies
2354C. Standards organizations
2355D. All of the above
2356Answer: Forums
2357Data Communication
2358315. The number of leaf nodes in a complete binary tree of depth d is
2359A. 2d
2360B. 2d–1+1
2361C. 2d+1+1
2362D. 2d +1
2363Answer: a
2364Data Structures and Algorithm
2365316. The number of interchanges required to sort 5, 1, 6, 2 4 in
2366ascending order using Bubble Sort is
2367A. 6
2368B. 5
2369C. 7
2370D. 8
2371Answer: b
2372Data Structures and Algorithm
2373317. If there are 17 elements in an array, how many maximum
2374comparisons are required to search an element using binary search?
2375A. 5
2376B. 4
2377C. 3
2378D. 2
2379Answer: a
2380Data Structures and Algorithm
2381318. A hash function f defined as f(key) = key mod 7, with linear probing,
2382is used to insert the keys 37,38,72,48,98,11,56,into a table indexed from
23830 to 6. 11 will be stored in the location
2384A. 5
2385B. 4
2386C. 3
2387D. 2
2388Answer: a
2389Data Structures and Algorithm
2390319. The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /,
2391+, * is
2392A. 600
2393B. 350
2394C. 588
2395D. 650
2396Answer: b
2397Data Structures and Algorithm
2398320. If h is any hashing function and is used to hash n keys in to a table
2399of size m, where n<=m, the expected number of collisions involving a
2400particular key x is :
2401A. <1
2402B. <m
2403C. <n
2404D. <n/2
2405Answer: a
2406Data Structures and Algorithm
2407321. A graph with n vertices will definitely have a parallel edge or self
2408loop of the total number of edges are
2409A. >n
2410B. >n+1
2411C. >(n+1)/2
2412D. >n(n-1)/2
2413Answer: d
2414Data Structures and Algorithm
2415322. An algorithm is made up of two independent time complexities f (n)
2416and g (n). Then the complexities of the algorithm is in the order of
2417A. f(n) x g(n)
2418B. Max (f(n),g(n))
2419C. Min (f(n),g(n))
2420D. f(n) + g(n)
2421Answer: b
2422Data Structures and Algorithm
2423323. A machine took 200 sec to sort 200 names, using bubble sort. In
2424800secs, it can approximately sort how many names. [Hint: No. of
2425comparisons bubble sort makes for n items]
2426A. 800 aprox
2427B. 600 aprox
2428C. 500 aprox
2429D. 400 aprox
2430Answer: d
2431Data Structures and Algorithm
2432324. The average number of comparisons performed by the merge sort
2433algorithm,in merging two sorted lists of length 2 is
2434A. 8/3
2435B. 8/7
2436C. 11/7
2437D. 11/6
2438Answer: a
2439Data Structures and Algorithm
2440325. There are four different algorithms A1,A2,A3 and A4 to solve a given
2441problem with the order log(n), loglog(n), nlog(n) ,n/log(n) respectively.
2442Which is the best algorithm?
2443A. A1
2444B. A2
2445C. A3
2446D. A4
2447Answer: b
2448Data Structures and Algorithm
2449326. Which of the following are not a valid queue application
2450A. Printing jobs in printer
2451B. Line at Ticket counter
2452C. Evaluating Math Expression
2453D. Telephone call
2454Answer: d
2455Data Structures and Algorithm
2456327. What is the minimum number of queues needed to implement a
2457priority queue
2458A. 1
2459B. 2
2460C. 3
2461D. 4
2462Answer: b
2463Data Structures and Algorithm
2464328. If node having 2 children is deleted from a binary tree, it is replaced
2465by its
2466A. Inorder predecessor
2467B. preorder predecessor
2468C. post predecessor
2469D. Inorder successor
2470Answer: d
2471Data Structures and Algorithm
2472329. If a node in BST has two children, then Inorder predecessor has
2473A. no left child
2474B. no right child
2475C. two children
2476D. no child
2477Answer: b
2478Data Structures and Algorithm
2479330. The time required to delete a node x from doubly liked list having n
2480node is
2481A. O(n)
2482B. O(log n)
2483C. O(1)
2484D. O(n log n)
2485Answer: c
2486Data Structures and Algorithm
2487331. In the relational modes, cardinality is termed as:
2488A. Number of tuples.
2489B. Number of attributes.
2490C. Number of tables.
2491D. Number of constraints.
2492Answer: A
2493Database Systems
2494332. Relational calculus is a
2495A. Procedural language.
2496B. Non- Procedural language.
2497C. Data definition language.
2498D. High level language.
2499Answer: B
2500Database Systems
2501333. In the architecture of a database system external level is the
2502A. physical level.
2503B. logical level.
2504C. conceptual level
2505D. view level.
2506Answer: D
2507Database Systems
2508334. An entity set that does not have sufficient attributes to form a
2509primary key is a
2510A. strong entity set.
2511B. weak entity set.
2512C. simple entity set.
2513D. primary entity set.
2514Answer: B
2515Database Systems
2516335. In tuple relational calculus P1 ®P2 is equivalent to
2517A. ¬P1 Ú P2
2518B. P1 Ú P2
2519C. P1 Ù P2
2520D. P1 Ù¬P2
2521Answer: A
2522Database Systems
2523336. The database environment has all of the following components
2524except:
2525A. users.
2526B. separate files.
2527C. database.
2528D. database administrator.
2529Answer: A
2530Database Systems
2531337. A subschema expresses
2532A. the logical view.
2533B. the physical view.
2534C. the external view.
2535D. all of the above.
2536Answer: C
2537Database Systems
2538338. SET concept is used in :
2539A. Network Model
2540B. Hierarchical Model
2541C. Relational Model
2542D. None of these
2543Answer: A
2544Database Systems
2545339. Relational Algebra is
2546A. Data Definition Language
2547B. Meta Language
2548C. Procedural query Language
2549D. None of the above
2550Answer: C
2551Database Systems
2552340. _______ produces the relation that has attributes of R1 and R2
2553A. Cartesian product
2554B. Difference
2555C. Intersection
2556D. Product
2557Answer: A
2558Database Systems
2559341. DBMS helps achieve
2560A. Data independence
2561B. Centralized control of data
2562C. Neither (A) nor (B)
2563D. both (A) and (B)
2564Answer: D
2565Database Systems
2566342. In a relation
2567A. Ordering of rows is immaterial
2568B. No two rows are identical
2569C. (A) and (B) both are true
2570D. None of these.
2571Answer: C
2572Database Systems
2573343. Which of the following operations need the participating relations to
2574be union compatible?
2575A. UNION
2576B. INTERSECTION
2577C. DIFFERENCE
2578D. All of the above
2579Answer: D
2580Database Systems
2581344. Which of the following is an advantage of view?
2582A. Data security
2583B. Derived columns
2584C. Hiding of complex queries
2585D. All of the above
2586Answer: D
2587Database Systems
2588345. The users who use easy-to-use menu are called
2589A. Sophisticated end users.
2590B. Naïve users.
2591C. Stand-alone users.
2592D. Casual end users.
2593Answer: B
2594Database Systems
2595346. ODBC stands for
2596A. Object Database Connectivity
2597B. Oral Database Connectivity
2598C. Oracle Database Connectivity
2599D. Open Database Connectivity
2600Answer: D
2601Database Management System
2602347. An entity set that does not have sufficient attributes to form a
2603primary key is a
2604A. strong entity set
2605B. weak entity set
2606C. simple entity set
2607D. primary entity set
2608Answer: B
2609Database Management System
2610348. In an E-R diagram attributes are represented by
2611A. rectangle
2612B. square
2613C. ellipse
2614D. triangle
2615Answer: C
2616Database Management System
2617349. In case of entity integrity, the primary key may be
2618A. not Null
2619B. Null
2620C. both Null & not Null
2621D. any value
2622Answer: A
2623Database Management System
2624350. In tuple relational calculus P 1 P2 is equivalent to
2625A. P1 v P 2
2626B. P1 v P 2
2627C. P1^ P 2
2628D. P1 ^ P 2
2629Answer: A
2630Database Management System
2631351. A logical schema
2632A. is the entire database
2633B. is a standard way of organizing information into accessible parts
2634C. describes how data is actually stored on disk
2635D. both (A) and (C)
2636Answer: A
2637Database Management System
2638352. The method in which records are physically stored in a specified
2639order according to a key field in each record is
2640A. hash
2641B. direct
2642C. sequential
2643D. all of the above
2644Answer: A
2645Database Management System
2646353. The statement in SQL which allows to change the definition of a
2647table is
2648A. Alter
2649B. Update
2650C. Create
2651D. select
2652Answer: A
2653Database Management System
2654354. Which are the two ways in which entities can participate in a
2655relationship?
2656A. Passive and active
2657B. Total and partial
2658C. Simple and Complex
2659D. All of the above
2660Answer: B
2661Database Management System
2662355. Using Relational Algebra the query that finds customers, who have
2663a balance of over 1000 is
2664A. P Customer_name( s balance >1000(Deposit))
2665B. s Customer_name( P balance >1000(Deposit))
2666C. P Customer_name( s balance >1000(Borrow))
2667D. s Customer_name( P balance >1000(Borrow))
2668Answer: A
2669Database Management System
2670356. _________ data type can store unstructured data
2671A. RAW
2672B. CHAR
2673C. NUMERIC
2674D. VARCHAR
2675Answer: A
2676Database Management System
2677357. A table joined with itself is called
2678A. Join
2679B. Self Join
2680C. Outer Join
2681D. Equi Join
2682Answer: B
2683Database Management System
2684358. _________ is a virtual table that draws its data from the result of an
2685SQL SELECT statement
2686A. View
2687B. Synonym
2688C. Sequence
2689D. Transaction
2690Answer: A
2691Database Management System
2692359. A B-tree of order m has maximum of _____________ children
2693A. m
2694B. m+1
2695C. m-1
2696D. m/2
2697Answer: A
2698Database Management System
2699360. To delete a particular column in a relation the command used is:
2700A. UPDATE
2701B. DROP
2702C. ALTER
2703D. DELETE
2704Answer: C
2705Database Management System
2706361. The highest level in the hierarchy of data organization is called
2707A. data bank
2708B. data base
2709C. data file
2710D. data record
2711Answer: data file
2712Database Systems
2713362. An audit trail
2714A. is used to make backup copies
2715B. can be used to restore lost information
2716C. is the recorded history of operations performed on a file
2717D. None
2718Answer: can be used to restore lost information
2719Database Systems
2720363. Which of the following is not a relational database
2721A. Dbase IV
2722B. 4th Dimension
2723C. FoxPro
2724D. Reflex
2725Answer: Reflex
2726Database Systems
2727364. A top-to-bottom relationship among the items in a database is
2728established by a
2729A. hierarchical schema
2730B. network schema
2731C. relational schema
2732D. All the above
2733Answer: hierarchical schema
2734Database Systems
2735365. Data security threats include
2736A. hardware failure
2737B. privacy invasion
2738C. fraudulent manipulation of data
2739D. All of the above
2740Answer: privacy invasion
2741Database Systems
2742366. A command that lets you change one or more fields in a record is
2743A. insert
2744B. modify
2745C. lookup
2746D. none of above
2747Answer: modify
2748Database Systems
2749367. This is an open standard application programming interface (API)
2750for accessing a database
2751A. Universal Data Access
2752B. Open Database Connectivity
2753C. Topic Map Query Language
2754D. Open Data-Link Interface
2755Answer: Open Database Connectivity
2756Database Systems
2757368. This is a standard interactive and programming language for getting
2758information from and updating a database
2759A. dynamic data exchange
2760B. Structured Query Language
2761C. ASCII
2762D. Erlang programming language
2763Answer: Structured Query Language
2764Database Systems
2765369. Report generators are used to
2766A. store data input by a user
2767B. retrieve information from files
2768C. answer queries
2769D. both b and c
2770Answer: answer queries
2771Database Systems
2772370. Batch processing is appropriate if
2773A. large computer system is available
2774B. only a small computer system is available
2775C. only a few transactions are involved
2776D. none of the above
2777Answer: none of the above
2778Database Systems
2779371. Which is the make given to the database management system
2780which is able to handle full text data, image data, audio and video?
2781A. full media
2782B. graphics media
2783C. multimedia
2784D. hypertext
2785Answer: multimedia
2786Database Systems
2787372. A file produced by a spreadsheet
2788A. is generally stored on disk in an ASCII text fromat
2789B. can be used as is by the DBMS
2790C. both a and b
2791D. none of the above
2792Answer: is generally stored on disk in an ASCII text fromat
2793Database Systems
2794373. Primitive operations common to all record management system
2795include
2796A. print
2797B. sort
2798C. look-up
2799D. all of above
2800Answer: look-up
2801Database Systems
2802374. What process does the technical term normalization describe?
2803A. Creating tables from an ER diagram
2804B. Creating larger tables from smaller tables
2805C. Expressing a database's design in terms of set theory
2806D. Breaking larger tables into smaller tables
2807Answer: Breaking larger tables into smaller tables
2808Database Systems
2809375. To what does the term normal form refer?
2810A. A stage in a process that breaks up large tables into smaller, more efficient tables
2811B. A standard database included with most RDBMSs
2812C. A standard table included with most RDBMSs
2813D. A methodology for representing tables in an ER diagram
2814Answer: A stage in a process that breaks up large tables into
2815smaller, more efficient tables
2816Database Systems
2817376. Given an unknown base Y, and given that for a particular number X,
2818(X)Y = (Z)10, what is (100000 * X)Y in base 10? ( “*” is the multiply
2819operation)
2820A. Z * Y5
2821B. 100000Z
2822C. log Y100000 * Z
2823D. Not enough information to tell
2824Answer: A
2825Digital Logic
2826377. In a 4-variable Boolean function, what are the minterms that differ
2827from m10 by one literal?
2828A. m0, m5, m7, m15
2829B. m4, m8, m6, m14
2830C. m0, m2, m8, m11
2831D. m2, m8, m11, m14
2832Answer: D
2833Digital Logic
2834378. A certain 5-bit self-complementary code is used to represent the 10
2835decimal digits 0 through 9. Given that (246)10 is represented as 00010
283600100 00110 in this code, what is the representation for (375)10?
2837A. 00110 00100 00010
2838B. 00011 00111 00101
2839C. 11101 11011 11001
2840D. 11001 11101 11011
2841Answer: D
2842Digital Logic
2843379. If one input to the circuit consisting of a cascade of 20 EX-OR is X
2844and the other is 1 , then what is the final EX-OR gate Output.
2845A. 0
2846B. 1
2847C. X
2848D.
2849Answer: C
2850Digital Logic
2851380. A certain four-variable Boolean function contains 9 minterms. At
2852least how many product terms and at most how many product terms are
2853there in the minimal sum-of-products expression for this function?
2854A. At least zero and at most 9.
2855B. At least 1 and at most 9.
2856C. At least 2 and at most 8.
2857D. At least 2 and at most 9.
2858Answer: C
2859Digital Logic
2860381. Write the next four numbers in the hex counting sequence
2861E9A,E9B,E9C,E9D, _ , _ , _,
2862A. E9E , E9F, EA0 , EA1
2863B. E9E , E9F, E100, E101
2864C. E9E , E9F, E00, E01
2865D. None of the above
2866Answer: A
2867Digital Logic
2868382. For Boolean algebra Associativity is a:
2869A. Theorem
2870B. Postulate
2871C. Expression
2872D. Identity
2873Answer: A
2874Digital Logic
2875383. In the expression A(A+B) , by writing the first term A as A+0, the
2876expression is best simplified as
2877A. A+AB
2878B. AB
2879C. A
2880D. A+B
2881Answer: C
2882Digital Logic
2883384. Which statement is true:
2884A. All canonical form are standard form
2885B. All standard form are canonical forms
2886C. Standard form must consists of minterms
2887D. Canonical form can consist of a term with a literal missing
2888Answer: A
2889Digital Logic
2890385. What is x if (1A5)16 = (1141)x?
2891A. 5
2892B. 7
2893C. 8
2894D. 9
2895Answer: B
2896Digital Logic
2897386. =
2898A. A (x-or) B (x-nor) C
2899B. A (x-nor) B (x-nor) C
2900C. A (x-nor) B (x-or) C
2901D. All the above
2902Answer: B
2903Digital Logic
2904387. To implement a 4 bit binary to 5 bit BCD converter using ROM, the
2905size of ROM, decoder inside ROM and number of OR gates will be
2906A. 16x5, 1x5, 4
2907B. 16x5, 4x16, 5
2908C. 32x4, 5x32, 4
2909D. 32x4, 1x4, 5
2910Answer: B
2911Digital Logic
2912388. How many 4-bit parallel adders would be required to add two
2913binary numbers each representing decimal numbers up to 300?
2914A. 1
2915B. 2
2916C. 3
2917D. 4
2918Answer: C
2919Digital Logic
2920389. How many possible state assignments would be there for 5 states?
2921A. 3
2922B. 8C3
2923C. 8P3
2924D. 8P5
2925Answer: D
2926Digital Logic
2927390. In the sequential circuit, the output is
2928A. Independent on the clock pulse
2929B.
2930C. Dependent of the +ve edge triggering of the clock pulse
2931D. Dependent of the –ve edge triggering of the clock pulse
2932Answer: A
2933Digital Logic
2934391. The image formation process can be summarized as
2935A. image=noise*object function+psf
2936B. image=psf*image function+noise
2937C. Image=psf*object function+noise
2938D. None of the above
2939Answer: C
2940Digital Image Processing
2941392.
2942A.
2943B.
2944C.
2945D.
2946Answer:
2947Digital Image Processing
2948393. The key problem in which 99% of cases where image processing
2949techniques either fail or further image processing is required to achieve
2950the required result is
2951A. noise
2952B. sampling
2953C. quantization
2954D. metrics
2955Answer: A
2956Digital Image Processing
2957394.
2958A.
2959B.
2960C.
2961D.
2962Answer:
2963Digital Image Processing
2964395. An alternative edge enhancement filter to the Laplacian-based
2965approaches is the
2966A. median filter
2967B. smoothening filter
2968C. unsharp mask filter
2969D. band pass filter
2970Answer: C
2971Digital Image Processing
2972396.
2973A.
2974B.
2975C.
2976D.
2977Answer:
2978Digital Image Processing
2979397. Fourier transform operates on the
2980A. frequency space
2981B. real space
2982C. fourier space
2983D. time space
2984Answer: A
2985Digital Image Processing
2986398.
2987A.
2988B.
2989C.
2990D.
2991Answer:
2992Digital Image Processing
2993399. The process of breaking down a periodic signal as a sum of sine
2994and cosine function is called
2995A. fourier breakage
2996B. fourier partition
2997C. fourier division
2998D. fourier decomposition
2999Answer: D
3000Digital Image Processing
3001400.
3002A.
3003B.
3004C.
3005D.
3006Answer:
3007Digital Image Processing
3008401. PSNR refers to
3009A. Progressive signal to noise ratio
3010B. Peak signal to noise ratio
3011C. Perceptual signal to noise ratio
3012D. None of the above
3013Answer: B
3014Digital Image Processing
3015402.
3016A.
3017B.
3018C.
3019D.
3020Answer:
3021Digital Image Processing
3022403. A key assumption in deriving the least-squares estimators given by
3023equation
3024A. g(x,y)-f(x,y)**h(x,y)=0
3025B. g(x,y)+f(x,y)**h(x,y)=0
3026C. g(x,y)+f(x,y)*h(x,y)=0
3027D. g(x,y)-f(x,y)*h(x,y)=0
3028Answer: A
3029Digital Image Processing
3030404.
3031A.
3032B.
3033C.
3034D.
3035Answer:
3036Digital Image Processing
3037405. A rectangular array of pixels containing the values either 1 or 0 is
3038called as
3039A. pixel structures
3040B. structuring element
3041C. neighbourhood pixel
3042D. none of the above
3043Answer: B
3044Digital Image Processing
3045406.
3046A.
3047B.
3048C.
3049D.
3050Answer:
3051Digital Image Processing
3052407. The positions where a certain pattern occurs in the input image is
3053indicated by the
3054A. laplace transform
3055B. wavlet transform
3056C. fourier transform
3057D. hit-or-miss transform
3058Answer: D
3059Digital Image Processing
3060408.
3061A.
3062B.
3063C.
3064D.
3065Answer:
3066Digital Image Processing
3067409. The representation of a 2-D boundary as a 1-D function is the
3068A. signature
3069B. transformation
3070C. sampling
3071D. quantization
3072Answer: A
3073Digital Image Processing
3074410.
3075A.
3076B.
3077C.
3078D.
3079Answer:
3080Digital Image Processing
3081411. measures the attempt to capture characteristics of the intensity
3082fluctuations between groups of neighbouring pixels, sometimes to which
3083the human eye is very sensitive.
3084A. feature
3085B. roughness
3086C. texture
3087D. none of the above
3088Answer: C
3089Digital Image Processing
3090412.
3091A.
3092B.
3093C.
3094D.
3095Answer:
3096Digital Image Processing
3097413. An approach to segmentation in which pixels are grouped into
3098larger regions based on their similarity according to predefined similarity
3099is
3100A. region segmentation
3101B. region splitting
3102C. region transform
3103D. region growing
3104Answer: D
3105Digital Image Processing
3106414.
3107A.
3108B.
3109C.
3110D.
3111Answer:
3112Digital Image Processing
3113415. A process in which an expert human user assigns examples to
3114specific classes based on selected and salient properties is called
3115A. class labelling
3116B. supervised labelling
3117C. unsupervised labeling
3118D. object labelling
3119Answer: A
3120Digital Image Processing
3121416.
3122A.
3123B.
3124C.
3125D.
3126Answer:
3127Digital Image Processing
3128417. An instance of something serving as a typical example or standard
3129for other things of the same category is a
3130A. classifier
3131B. pixel
3132C. prototype
3133D. object
3134Answer: C
3135Digital Image Processing
3136418.
3137A.
3138B.
3139C.
3140D.
3141Answer:
3142Digital Image Processing
3143419. A conceptually simple structure for representing imagesat more tha
3144one resolution is the
3145A. image cube
3146B. image pyramid
3147C. image cone
3148D. none of the above
3149Answer: C
3150Digital Image Processing
3151420. Data by itself is not useful unless
3152A. It is massive
3153B. It is processed to obtain information
3154C. It is collected from diverse sources
3155D. It is properly stated
3156Answer: B
3157Data warehousing and Data mining
3158421. In a hospital information system the following type of information is
3159tactical
3160A. Opening a new children’s’ ward
3161B. Data on births and deaths
3162C. Preparing patients’ bill
3163D. Buying an expensive diagnostic system such as CAT scan
3164Answer: A
3165Data warehousing and Data mining
3166422. The quality of information which does not hide any unpleasant
3167information is known as
3168A. Complete
3169B. Trustworthy
3170C. Relevant
3171D. None of the above
3172Answer: B
3173Data warehousing and Data mining
3174423. Every record stored in a Master file has a key field because
3175A. it is the most important field
3176B. it acts as a unique identification of record
3177C. it is the key to the database
3178D. it is a very concise field
3179Answer: B
3180Data warehousing and Data mining
3181424. A management information system is one which
3182A. is required by all managers of an organization
3183B. processes data to yield information of value in tactical management
3184C. provides operational information
3185D. allows better management of organizations
3186Answer: B
3187Data warehousing and Data mining
3188425. Data mining is used to aid in
3189A. operational management
3190B. analyzing past decision made by managers
3191C. detecting patterns in operational data
3192D. retrieving archival data
3193Answer: C
3194Data warehousing and Data mining
3195426. Data mining requires
3196A. large quantities of operational data stored over a period of time
3197B. lots of tactical data
3198C. several tape drives to store archival data
3199D. large mainframe computers
3200Answer: A
3201Data warehousing and Data mining
3202427. Data mining can not be done if
3203A. operational data has not been archived
3204B. earlier management decisions are not available
3205C. the organization is large
3206D. all processing had been only batch processing
3207Answer: A
3208Data warehousing and Data mining
3209428. Decision support systems are used for
3210A. Management decision making
3211B. Providing tactical information to management
3212C. Providing strategic information to management
3213D. Better operation of an organization
3214Answer: C
3215Data warehousing and Data mining
3216429. Which is the right approach of Data Mining?
3217A. Infrastructure, exploration, analysis, interpretation, exploitation
3218B. Infrastructure, exploration, analysis, exploitation, interpretation
3219C. Infrastructure, analysis, exploration, interpretation, exploitation
3220D. Infrastructure, analysis, exploration, exploitation, interpretation
3221Answer: A
3222Data warehousing and Data mining
3223430. Which of the following issue is considered before investing in Data
3224Mining?
3225A. Functionality
3226B. Vendor consideration
3227C. Compatibility
3228D. All of the above
3229Answer: D
3230Data warehousing and Data mining
3231431. The automated, prospective analyses offered by data mining move
3232beyond the analyses of past events provided by _____________ tools
3233typical of decision support systems.
3234A. Introspective
3235B. Intuitive
3236C. Reminiscent
3237D. Retrospective
3238Answer: D
3239Data warehousing and Data mining
3240432. During business hours, most ______ systems should probably not
3241use parallel execution.
3242A. OLAP
3243B. DSS
3244C. Data Mining
3245D. OLTP
3246Answer: D
3247Data warehousing and Data mining
3248433. Data mining evolve as a mechanism to cater the limitations of
3249________ systems to deal massive data sets with high dimensionality,
3250new data types, multiple heterogeneous data resources etc.
3251A. OLTP
3252B. OLAP
3253C. DSS
3254D. DWH
3255Answer: A
3256Data warehousing and Data mining
3257434. The term DSS refer to __________.
3258A. Data Supply System
3259B. Decision Support System
3260C. Deducted Services System
3261D. None of the above
3262Answer: B
3263Data warehousing and Data mining
3264435. The time required to insert an element in a stack with linked
3265implementation is
3266A. O(1)
3267B. O(log2 n)
3268C. O(n)
3269D. O(nlog2 n)
3270Answer: A
3271Data Structures and Algorithms
3272436. A list of integers is read in , one at a time and a binary search tree is
3273constructed.Next the tree is traversed and the integers are printed.
3274Which traversal result in a printout which duplicated the original order of
3275the list of integers.
3276A. preorder
3277B. postorder
3278C. inorder
3279D. None of the above
3280Answer: D
3281Data Structures and Algorithms
3282437. which of the following is a tabular listing of contents of certain
3283registers and memory locations at different times during the execution
3284of a program
3285A. loop program
3286B. program trace
3287C. sub routine program
3288D. byte sorting program
3289Answer: B
3290Data Structures and Algorithms
3291438. which of the following types of expressions doenot require
3292precedence rule for evaluaed?
3293A. Full parenthesised infix expression
3294B. prefix expression
3295C. partially parenthesized infix expression
3296D. more than one of these
3297Answer: D
3298Data Structures and Algorithms
3299439. which of the following is not correct?
3300A. f(n)=O(f(n))
3301B. c*f(n)=O(f(n)) for constant 'c'
3302C. O(f(n)+g(n))=(f(n))+O(g(n))
3303D. O[f(n)2]=O(f(n))2
3304Answer: C
3305Data Structures and Algorithms
3306440. consider the following tree.If the post order traversal gives ab-cd*+
3307then label of the nodes 1,2,3,….. Will be
3308A. "+,-,*,a,b,c,d"
3309B. "a,-,b,+,c,*,d"
3310C. "a,b,c,d,-,*,+"
3311D. "-,a,b,+,*,c,d"
3312Answer: A
3313Data Structures and Algorithms
3314441. The running time of an algorithm T(n) , where n is the input size
3315given by T(n)= 8T(n/2) +q n if n>1 = p if n=1 where p,q,are constants.The
3316order of the algorithm is
3317A. n2
3318B. nn
3319C. n3
3320D. n
3321Answer: C
3322Data Structures and Algorithms
3323442. The number of edges in a regular graph of degree 'd' and 'n'
3324vertices is
3325A. maximum of n,d
3326B. n+d
3327C. nd
3328D. nd/2
3329Answer: D
3330Data Structures and Algorithms
3331443. If hashing function is the remiander on division, then clustering is
3332more likely to occur if the storage space is divided in to 40 sections than
333341. Thisconclusion is
3334A. More likely to be false
3335B. more likely to be true
3336C. always true
3337D. always false
3338Answer: B
3339Data Structures and Algorithms
3340444. consider an undirected graph 'G' with 'n' vertices and 'e' edges.
3341What is the time taken by 'DFS' if the graph is represented by adjacency
3342matrix and adjacency list
3343A. O(n2),O(n)
3344B. O(n2),O(e)
3345C. O(e),O(n2)
3346D. O(e+n),O(e)
3347Answer: B
3348Data Structures and Algorithms
3349445. A strictly binary tree with 10 leaves
3350A. cannot have more than 19 nodes
3351B. has exactly 19 nodes
3352C. has exactly 17 nodes
3353D. cannot have more than 17 nodes
3354Answer: B
3355Data Structures and Algorithms
3356446. In evaluating the arthimetic expression 2*3-(4+5), using stacks to
3357evaluate its equivalent postfix form , which of the following stack
3358configuration is not possible?
3359A. 6,4
3360B. 6,4,5
3361C. 6,9
3362D. 2,3,9
3363Answer: D
3364Data Structures and Algorithms
3365447. Number of possible binary trees with 3 nodes is
3366A. 12
3367B. 13
3368C. 14
3369D. 15
3370Answer: D
3371Data Structures and Algorithms
3372448. The expression which access the (i,j)th entry of a mxn matrix stored
3373in column major form is
3374A. nx(i-1)+j
3375B. mx(j-1)+i
3376C. mx(n-j)+j
3377D. nx(m-i)+j
3378Answer: B
3379Data Structures and Algorithms
3380449. A complete binary tree with the property that the value each node is
3381atleast as large as the values at its children is called
3382A. Binary search tree
3383B. AVL tree
3384C. completely balanced tree
3385D. Heap
3386Answer: D
3387Data Structures and Algorithms
3388450. A characteristic of the data that binary search uses but the linear
3389search ignores is
3390A. (A) Order of the elements of the list.
3391B. (B) Length of the list.
3392C. (C) Maximum value in list.
3393D. (D) Type of elements of the list.
3394Answer: (A)
3395Data Structures and alogrithm
3396451. the___________.
3397A.
3398B.
3399C.
3400D.
3401Answer:
3402Data Structures and alogrithm
3403452.
3404A.
3405B.
3406C.
3407D.
3408Answer:
3409Data Structures and alogrithm
3410453.
3411A.
3412B.
3413C.
3414D.
3415Answer:
3416Data Structures and alogrithm
3417454. How many nodes in a tree have no ancestors.
3418A. (A) 0
3419B. (B) 1
3420C. (C) 2
3421D. (D) n
3422Answer: (B)
3423Data Structures and alogrithm
3424455.
3425A.
3426B.
3427C.
3428D.
3429Answer:
3430Data Structures and alogrithm
3431456.
3432A.
3433B.
3434C.
3435D.
3436Answer:
3437Data Structures and alogrithm
3438457.
3439A.
3440B.
3441C.
3442D.
3443Answer:
3444Data Structures and alogrithm
3445458. Which of the following sorting algorithm is stable
3446A. (A) Insertion sort.
3447B. (B) Bubble sort.
3448C. (C) Quick sort
3449D. (D) Heap sort
3450Answer: (D)
3451Data Structures and alogrithm
3452459.
3453A.
3454B.
3455C.
3456D.
3457Answer:
3458Data Structures and alogrithm
3459460.
3460A.
3461B.
3462C.
3463D.
3464Answer:
3465Data Structures and alogrithm
3466461. The time required to delete a node x from a doubly linked list having
3467n nodes is
3468A. (A) O (n)
3469B. (B) O (log n)
3470C. (C) O (1)
3471D. (D) O (n log n)
3472Answer: ( C )
3473Data Structures and alogrithm
3474462.
3475A.
3476B.
3477C.
3478D.
3479Answer:
3480Data Structures and alogrithm
3481463.
3482A.
3483B.
3484C.
3485D.
3486Answer:
3487Data Structures and alogrithm
3488464.
3489A.
3490B.
3491C.
3492D.
3493Answer:
3494Data Structures and alogrithm
3495465. Ackerman’s function is defined on the non-negative integers as
3496follows
3497A. (A) 4.
3498B. (B) 5.
3499C. (C) 6.
3500D. (D) 7.
3501Answer: (B)
3502Data Structures and alogrithm
3503466. a (m,n) = n+1 if m=0
3504A.
3505B.
3506C.
3507D.
3508Answer:
3509Data Structures and alogrithm
3510467. = a (m-1, 1) if m≠ 0, n=0
3511A.
3512B.
3513C.
3514D.
3515Answer:
3516Data Structures and alogrithm
3517468. = a (m-1, a(m, n-1)) if m≠ 0, n ≠ 0
3518A.
3519B.
3520C.
3521D.
3522Answer:
3523Data Structures and alogrithm
3524469. The value of a (1, 3) is
3525A.
3526B.
3527C.
3528D.
3529Answer:
3530Data Structures and alogrithm
3531470.
3532A.
3533B.
3534C.
3535D.
3536Answer:
3537Data Structures and alogrithm
3538471.
3539A.
3540B.
3541C.
3542D.
3543Answer:
3544Data Structures and alogrithm
3545472.
3546A.
3547B.
3548C.
3549D.
3550Answer:
3551Data Structures and alogrithm
3552473. Let the following circular queue can accommodate maximum six
3553elements with the
3554A. (A) front = 2 rear = 5
3555B. (B) front = 3 rear = 5
3556C. (C) front = 3 rear = 4
3557D. (D) front = 2 rear = 4
3558Answer: (A)
3559Data Structures and alogrithm
3560474. following data
3561A. queue = ______; L, M, N, O, ___
3562B. queue = L, M, N, O, ___
3563C. queue = ______; L, M, N, O, ___
3564D. queue = L, M, N, O, ___
3565Answer:
3566Data Structures and alogrithm
3567475. front = 2 rear = 4
3568A.
3569B.
3570C.
3571D.
3572Answer:
3573Data Structures and alogrithm
3574476. queue = _______; L, M, N, ___, ___
3575A.
3576B.
3577C.
3578D.
3579Answer:
3580Data Structures and alogrithm
3581477. What will happen after ADD O operation takes place?
3582A.
3583B.
3584C.
3585D.
3586Answer:
3587Data Structures and alogrithm
3588478.
3589A.
3590B.
3591C.
3592D.
3593Answer:
3594Data Structures and alogrithm
3595479.
3596A.
3597B.
3598C.
3599D.
3600Answer:
3601Data Structures and alogrithm
3602480.
3603A.
3604B.
3605C.
3606D.
3607Answer:
3608Data Structures and alogrithm
3609481.
3610A.
3611B.
3612C.
3613D.
3614Answer:
3615Data Structures and alogrithm
3616482. A graph with n vertices will definitely have a parallel edge or self
3617loop if the total number of
3618A. (A) greater than n–1
3619B. (B) less than n(n–1)
3620C. (C) greater than n(n–1)/2
3621D. (D) less than n/2
3622Answer: (A)
3623Data Structures and alogrithm
3624483. edges are
3625A.
3626B.
3627C.
3628D.
3629Answer:
3630Data Structures and alogrithm
3631484.
3632A.
3633B.
3634C.
3635D.
3636Answer:
3637Data Structures and alogrithm
3638485.
3639A.
3640B.
3641C.
3642D.
3643Answer:
3644Data Structures and alogrithm
3645486.
3646A.
3647B.
3648C.
3649D.
3650Answer:
3651Data Structures and alogrithm
3652487. The total number of companions required to merge 4 sorted files
3653containing 15, 3, 9 and 8 records into a single sorted file is
3654A. (A) 66
3655B. (B) 39
3656C. (C) 15
3657D. (D) none above
3658Answer: (D)
3659Data Structures and alogrithm
3660488.
3661A.
3662B.
3663C.
3664D.
3665Answer:
3666Data Structures and alogrithm
3667489.
3668A.
3669B.
3670C.
3671D.
3672Answer:
3673Data Structures and alogrithm
3674490.
3675A.
3676B.
3677C.
3678D.
3679Answer:
3680Data Structures and alogrithm
3681491.
3682A.
3683B.
3684C.
3685D.
3686Answer:
3687Data Structures and alogrithm
3688492. . The minimum number of multiplications and additions required to
3689evaluate the polynomial
3690A. (A) 6 & 3
3691B. (B) 4 & 2
3692C. (C) 3 & 3
3693D. (D) 8 & 3
3694Answer: (C)
3695Data Structures and alogrithm
3696493. P = 4x3+3x2-15x+45 is
3697A.
3698B.
3699C.
3700D.
3701Answer:
3702Data Structures and alogrithm
3703494.
3704A.
3705B.
3706C.
3707D.
3708Answer:
3709Data Structures and alogrithm
3710495.
3711A.
3712B.
3713C.
3714D.
3715Answer:
3716Data Structures and alogrithm
3717496.
3718A.
3719B.
3720C.
3721D.
3722Answer:
3723Data Structures and alogrithm
3724497. An undirected graph G with n vertices and e edges is represented
3725by adjacency list.
3726A. (A) O (n)
3727B. (B) O (e)
3728C. (C) O (e+n)
3729D. (D) O (e2)
3730Answer: Ans:C
3731Data Structures and alogrithm
3732498. What is the time required to generate all the connected
3733components?
3734A.
3735B.
3736C.
3737D.
3738Answer:
3739Data Structures and alogrithm
3740499.
3741A.
3742B.
3743C.
3744D.
3745Answer:
3746Data Structures and alogrithm
3747500.
3748A.
3749B.
3750C.
3751D.
3752Answer:
3753Data Structures and alogrithm
3754501.
3755A.
3756B.
3757C.
3758D.
3759Answer:
3760Data Structures and alogrithm
3761502. . A full binary tree with n leaves contains
3762A. (A) n nodes.
3763B. (B) n log2 nodes.
3764C. (C) 2n –1 nodes.
3765D. (D) n 2 nodes.
3766Answer: Ans:C
3767Data Structures and alogrithm
3768503.
3769A.
3770B.
3771C.
3772D.
3773Answer:
3774Data Structures and alogrithm
3775504.
3776A.
3777B.
3778C.
3779D.
3780Answer:
3781Data Structures and alogrithm
3782505.
3783A.
3784B.
3785C.
3786D.
3787Answer:
3788Data Structures and alogrithm
3789506. The complexity of multiplying two matrices of order m*n and n*p is
3790A. (A) mnp
3791B. (B) mp
3792C. (C) mn
3793D. (D) np
3794Answer: Ans:A
3795Data Structures and alogrithm
3796507.
3797A.
3798B.
3799C.
3800D.
3801Answer:
3802Data Structures and alogrithm
3803508.
3804A.
3805B.
3806C.
3807D.
3808Answer:
3809Data Structures and alogrithm
3810509.
3811A.
3812B.
3813C.
3814D.
3815Answer:
3816Data Structures and alogrithm
3817510. You have to sort a list L consisting of a sorted list followed by a few
3818“random” elements.
3819A. (A) Bubble sort
3820B. (B) Selection sort
3821C. (C) Quick sort
3822D. (D) Insertion sort
3823Answer: Ans:D
3824Data Structures and alogrithm
3825511. Which of the following sorting methods would be especially suitable
3826for such a task?
3827A.
3828B.
3829C.
3830D.
3831Answer:
3832Data Structures and alogrithm
3833512.
3834A.
3835B.
3836C.
3837D.
3838Answer:
3839Data Structures and alogrithm
3840513.
3841A.
3842B.
3843C.
3844D.
3845Answer:
3846Data Structures and alogrithm
3847514.
3848A.
3849B.
3850C.
3851D.
3852Answer:
3853Data Structures and alogrithm
3854515. Let A be an adjacency matrix of a graph G. The ij th entry in the
3855matrix
3856A. (A) The number of paths of length K from vertex Vi to vertex Vj.
3857B. (B) Shortest path of K edges from vertex Vi to vertex Vj.
3858C. (C) Length of a Eulerian path from vertex Vi to vertex Vj.
3859D. (D) Length of a Hamiltonian cycle from vertex Vi to vertex Vj.
3860Answer: Ans:B
3861Data Structures and alogrithm
3862516. A K gives
3863A.
3864B.
3865C.
3866D.
3867Answer:
3868Data Structures and alogrithm
3869517.
3870A.
3871B.
3872C.
3873D.
3874Answer:
3875Data Structures and alogrithm
3876518.
3877A.
3878B.
3879C.
3880D.
3881Answer:
3882Data Structures and alogrithm
3883519.
3884A.
3885B.
3886C.
3887D.
3888Answer:
3889Data Structures and alogrithm
3890520. If h is any hashing function and is used to hash n keys in to a table
3891of size m, where n<=m,
3892A. (A) less than 1.
3893B. (B) less than n.
3894C. (C) less than m.
3895D. (D) less than n/2.
3896Answer: Ans:A
3897Data Structures and alogrithm
3898521. the expected number of collisions involving a particular key x is :
3899A.
3900B.
3901C.
3902D.
3903Answer:
3904Data Structures and alogrithm
3905522. 1.In divide and conquer recursion reffers to
3906A. Conquer
3907B. divide
3908C. routines
3909D. subproblem
3910Answer: b
3911Programming Fundamentals
3912523. 2.Use of Driver Routine
3913A. Test the validity of base
3914B. call recursive routines
3915C. c.none of the above
3916D. d.a&b
3917Answer: d
3918Programming Fundamentals
3919524. 3.Narrate the use of bookkeeping
3920A. solve without recrusion
3921B. .track of pending recursive calls.
3922C. to call function
3923D. Delete the recursive calls.
3924Answer: b
3925Programming Fundamentals
3926525. 4.Method which should not alter the values of object by function.
3927A. call by refrence
3928B. call by vale
3929C. call by constant refrence
3930D. call by constant value.
3931Answer: c
3932Programming Fundamentals
3933526. 5.What is the fuctionality of push_back
3934A. make the object to attain original value
3935B. Decrease the value by 1
3936C. Increase the value by one
3937D. Delete an item.
3938Answer: c
3939Programming Fundamentals
3940527. 6. s .c-str ( ) deals with
3941A. length of the string
3942B. pointer reference
3943C. primitive of the string
3944D. assingning functions.
3945Answer: c
3946Programming Fundamentals
3947528. 7.Generic exception class is the mother of all exception say TRUR
3948OR FALSE
3949A.
3950B.
3951C.
3952D.
3953Answer: TRUE
3954Programming Fundamentals
3955529. 8.Semantics deals with
3956A. to create well-formed sentences (or programs) in the language.
3957B. the meaning of syntactically valid strings in a language.
3958C. issues such as ease of implementation, efficiency in application, and programming
3959methodology
3960D. part of the language for describing grammars.
3961Answer: b
3962Programming Fundamentals
3963530. 9. phrase-structur e syntax that explains how -------------- are
3964arranged into programs
3965A. semantics
3966B. language
3967C. symbols
3968D. tokens.
3969Answer: d
3970Programming Fundamentals
3971531. 10.Which of the following is Semantic errors.
3972A. variable that has not been initialized is accessed.
3973B. read command is executed when the input file is empty
3974C. Above all
3975D. None of above.
3976Answer: c
3977Programming Fundamentals
3978532. 11.%2f relates
3979A. used to represent float numbers.
3980B. Display only 2 numbers
3981C. display two digits after decimal point.
3982D. divide with hundred.
3983Answer: c
3984Programming Fundamentals
3985533. 12syntax for condition operation is
3986A. Condition:result 1:result 2;
3987B. Condition?result 1,result 2;
3988C. Condition:result 1? result 2;
3989D. condition?result1:result2;
3990Answer: d
3991Programming Fundamentals
3992534. 13.Do-While loop relates for
3993A. no.of repetition is known in advance.
3994B. no.of.repetition are unkown .
3995C. loop to be executed atleast once regards the code.
3996D. need when condition fails.
3997Answer: c
3998Programming Fundamentals
3999535. 14.Continue keyword refers
4000A. skip the next loop
4001B. bypass the loop
4002C. execute loops even condition fails
4003D. none of the above
4004Answer: b
4005Programming Fundamentals
4006536. 15.sorting refers to arrangement say true or false.
4007A.
4008B.
4009C.
4010D.
4011Answer: FALSE
4012Programming Fundamentals
4013537. Which of the following are recognised kinds of prototypes
4014A. A. Interactive sketches
4015B. B. Conceptual models.
4016C. C. Beta versions
4017D. D. Paper mock-ups.
4018Answer: a,d
4019Human Computer Interaction
4020538. . In a heuristic evaluation:
4021A. A. a group of usability experts judges an interface with a detailed checklist of guidelines.
4022B. B. a group of test users conducts a formal experiment
4023C. C. a group of psychologists administers a questionnaire
4024D. D. a group of usability experts reviews a user interface according to a small set of general
4025principles.
4026Answer: d
4027Human Computer Interaction
4028539. Valid reasons for usability testing are:
4029A. More often than not, intuitions are wrong.
4030B. . Designers believe users follow illogical paths.
4031C. . Experience changes ones perception of the world.
4032D. . Testing performance under user stress is important.
4033Answer: a,c
4034Human Computer Interaction
4035540. Thinking aloud testing:
4036A. slows down the user by about 17%.
4037B. cannot provide performance data.
4038C. . cannot provide process data.
4039D. . is a formative evaluation method.
4040Answer: a,b,d
4041Human Computer Interaction
4042541. Regarding a formal experiment:
4043A. Process data are collected.
4044B. Objective measurements are made.
4045C. A larger number of test users is needed.
4046D. . A fully implemented system is required.
4047Answer: b,c,d
4048Human Computer Interaction
4049542. Post-test questionnaires (conducted after a usability test) are
4050particularly useful for measuring
4051A. safety.
4052B. efficiency.
4053C. learnability.
4054D. user satisfaction
4055Answer: d
4056Human Computer Interaction
4057543. A pluralistic walkthrough
4058A. ) is usually conducted at the end of the development process.
4059B. is often conducted with low-fidelity designs.
4060C. requires having several alternate designs.
4061D. requires a fully functional prototype.
4062Answer: b
4063Human Computer Interaction
4064544. . Providing accelerators (e.g. keyboard shortcuts) mostly addresses
4065A. utility.
4066B. efficiency.
4067C. ) learnability.
4068D. attitude (or likeability).
4069Answer: b
4070Human Computer Interaction
4071545. A method that does not require human participants serving as test
4072users is the
4073A. usability test.
4074B. pluralistic walkthrough.
4075C. Rubin’s comparison test.
4076D. heuristic evaluation
4077Answer: d
4078Human Computer Interaction
4079546. The cognitive walkthrough mainly evaluates a product's
4080A. utility.
4081B. efficiency.
4082C. learnability.
4083D. likeability..
4084Answer: c
4085Human Computer Interaction
4086547. The basic requirements of HCI are
4087A. Knowledge about the interplay among users
4088B. ) tasks,task contexts
4089C. ITand the environments in which the systems are used
4090D. all the above
4091Answer: d
4092Human Computer Interaction
4093548. . Complex tasks that require human, system, and task interaction
4094are supported by a)ecommerce b) Web systems
4095A. A only
4096B. b only
4097C. a and b
4098D. neither a nor b
4099Answer: c
4100Human Computer Interaction
4101549. The "task" among the human, computer leads to performance and
4102well-being.
4103A. FALSE
4104B. TRUE
4105C. always true
4106D. always false
4107Answer: d
4108Human Computer Interaction
4109550. An icon of a file folder, which users can drop files on in order to
4110move them into the folder, is an example of which of the following:
4111A. (a) the “recognition rather than recall” principle
4112B. (b) direct manipulation
4113C. (c) a metaphor
4114D. (d) all of the above
4115Answer: d
4116Human Computer Interaction
4117551. You drag a folder to make a copy of its contents. An animation
4118appears on the screen, showing files moving from one folder to another.
4119This is an example of which of the following
4120A. (a) visibility
4121B. (b) mapping
4122C. (c) an affordance
4123D. (d) feedback
4124Answer: d
4125Human Computer Interaction
4126552. Which of the following fields is not an influence on HCI?
4127A. (a) ergonomics
4128B. (b) cognitive psychology
4129C. c) computer science
4130D. (d) all of the above are an influence on HCI
4131Answer: d
4132Human Computer Interaction
4133553. Scripting (the ability to record and play back programmable
4134sequences of actions) is an example of:
4135A. speaking the user's language
4136B. allowing the user model to grow
4137C. the “recognition rather than recall” principle
4138D. a mode in the user interface design
4139Answer: b
4140Human Computer Interaction
4141554. An icon of a file folder, which users can drop files on in order to
4142move them into the folder, is an example of which of the following:
4143A. (a) the “recognition rather than recall” principle
4144B. (b) direct manipulation
4145C. (c) a metaphor
4146D. (d) all of the above
4147Answer: d
4148Human Computer Interaction
4149555. You drag a folder to make a copy of its contents. An animation
4150appears on the screen, showing files moving from one folder to another.
4151This is an example of which of the following
4152A. (a) visibility
4153B. (b) mapping
4154C. (c) an affordance
4155D. (d) feedback
4156Answer: d
4157Human Computer Interaction
4158556. Your new sound card is packaged in a plastic anti-static bag. The
4159bag is sealed with a yellow sticker with a written warning not to expose
4160the card to static electricity. The sticker is an example of:
4161A. (a) perceptual constraint
4162B. (b) cultural constraint
4163C. (c) physical constraint
4164D. (d) logical constraint
4165Answer: b/c
4166Human Computer Interaction
4167557. . Which of the following statements is false?
4168A. Norman's logical constraints are one way to implement Nielsen's principle of error
4169prevention
4170B. The help and documentation called for by Nielsen's usability principle form part of
4171Norman's defnition of the system image.
4172C. Norman's principle of feedback is one way to implement Nielsen's principle of
4173“recognition rather than recall”.
4174D. All of the above statements are true.
4175Answer: c
4176Human Computer Interaction
4177558. Which of the following statements is true?
4178A. (a) Violating Norman's feedback principle interferes with the fourth stage
4179B. (b) There is no ethical way to collect data about people without their informed consent
4180C. (c) Structured interviews are less likely to miss salient details than un-structured ones.
4181D. (d) All of the above statements are false.
4182Answer: d
4183Human Computer Interaction
4184559. Which of the following gestures makes use of a quasi-mode?
4185A. Selecting one of the commands (draw, spray paint, etc.) in the tool palette of a paint
4186program
4187B. Using the Ctrl-V shortcut to paste text.
4188C. Clicking a link in a web browser.
4189D. All of the above make use of quasi-modes.
4190Answer: b
4191Human Computer Interaction
4192560. Unlike traditional observation, guided observation:
4193A. sets strict guidelines for session activities
4194B. reduces error introduced by the experimenter
4195C. sets strict guidelines for session lengths
4196D. includes some interaction with participants
4197Answer: d
4198Human Computer Interaction
4199561. The Num Lock key found on many keyboards, which enables the
4200user to use the number functions of the numeric kerpad rather than the
4201cursor control functions, indicates which of the following features is
4202present:
4203A. a) a mode
4204B. (b) a quasi-mode
4205C. c) a physical constraint
4206D. (d) a logical constraint
4207Answer: a
4208Human Computer Interaction
4209562. . As we have used the terms in this course, what is the relationship
4210between tasks, actions, and goals?
4211A. (a) a task is composed of goals and actions to accomplish those goals
4212B. (b) an action rei_es a task into a goal
4213C. c) a goal is composed of a set of actions that accomplish a task
4214D. d) none of the above
4215Answer: d/c
4216Human Computer Interaction
4217563. Affordances are:
4218A. A. possibilities for using an object or interface
4219B. B. the costs of buying user interface components
4220C. C. the completion times for a typical task.
4221D. D. classified into real and perceived affordances
4222Answer: a
4223Human Computer Interaction
4224564. Which of these are attributes of usability?
4225A. A. Learnability
4226B. B. Usefulness.
4227C. C. Generalisability
4228D. D. Subjective satisfaction
4229Answer: a&d
4230Human Computer Interaction
4231565. How do you get to know the user in the usability engineering
4232lifecycle?
4233A. A. Draw up a user profile.
4234B. B. Run a thinking aloud test
4235C. C. Assume the role of an apprentice learning from the master craftsman
4236D. D. Observe representative users.
4237Answer: a,c,d
4238Human Computer Interaction
4239566. Concerning competitive analysis, it is true that:
4240A. A. two groups of usability testers compare their results for the same interface.
4241B. B. it is used for usability benchmarking
4242C. C. it is an online comparision of data transfer rates
4243D. D. competing systems are analysed
4244Answer: b,d
4245Human Computer Interaction
4246567. A persona in the context of goal-oriented interaction design:
4247A. A. is used to role-play through an interface design.
4248B. B. is a real person.
4249C. C. represents a particular type of user.
4250D. D. should represent an average user.
4251Answer: a,c
4252Human Computer Interaction
4253568. The phrase __________ describes viruses, worms, Trojan horse
4254attack applets, and attack scripts.
4255A. malware
4256B. spam
4257C. phish
4258D. virus
4259Answer: malware
4260Information Security
4261569. Hackers often gain entry to a network be pretending to be at a
4262legitimate computer.
4263A. spoofing
4264B. forging
4265C. IP spoofing
4266D. ID theft
4267Answer: IP spoofing
4268Information Security
4269570. A hacker that changes or forges information in an electronic
4270resource, is engaging in __________.
4271A. denial of service
4272B. sniffing
4273C. terrorism
4274D. data diddling
4275Answer: data diddling
4276Information Security
4277571. __________cookies are also known as transient cookies.
4278A. Third-party
4279B. First-party
4280C. Session
4281D. Persistent
4282Answer: Session
4283Information Security
4284572. Which of the following will not protect you from spam?
4285A. spam blockers
4286B. e-mail rules
4287C. popup blocker
4288D. filters
4289Answer: popup blocker
4290Information Security
4291573. In the right setting a thief will steal your information by simply
4292watching what you type.
4293A. snagging
4294B. spying
4295C. social engineering
4296D. shoulder surfing
4297Answer: shoulder surfing
4298Information Security
4299574. A hacker contacts you my phone or email and attempts to acquire
4300your password.
4301A. spoofing
4302B. spoofing
4303C. spamming
4304D. bugging
4305Answer: spoofing
4306Information Security
4307575. The __________ prevents unlawful access to voice communications
4308by wire.
4309A. Electronic Communications Privacy Act
4310B. Freedom of Information Act
4311C. USA Patriot Act
4312D. Privacy Act of 1974
4313Answer: Electronic Communications Privacy Act
4314Information Security
4315576. If configured correctly, the __________ will prevent interaction with
4316your computer after a specified time period
4317A. firewall
4318B. filter
4319C. screen saver
4320D. popup blocker
4321Answer: screen saver
4322Information Security
4323577. A security measure to stop unauthorized access to documents is:
4324A. business continuity/disaster recovery.
4325B. backup/restore
4326C. physical access restrictions
4327D. network access control
4328Answer: network access control
4329Information Security
4330578. Which of the following is not an accepted approach to controlling a
4331computer-based information system?
4332A. Recovery.
4333B. Obfuscation
4334C. Deterrence
4335D. Prohibition
4336Answer: Prohibition
4337Information Security
4338579. This type of virus is activated when a user runs an applications
4339such as a wordprocessor or spreadsheet.
4340A. E-mail virus
4341B. Trojan virus
4342C. Macro-virus
4343D. Worm
4344Answer: Macro-virus
4345Information Security
4346580. In order to prevent any damage being caused to data by the failure
4347of a storage device, such as a hard disk drive, which of the following
4348would you be most likely to use?
4349A. RAID
4350B. TSR program.
4351C. Backup site
4352D. Incremental backup.
4353Answer: RAID
4354Information Security
4355581. Which of the following is capable of altering its form in order to
4356avoid discovery by certain virus detection programs?
4357A. Trojan
4358B. Stealth virus.
4359C. Polymorphic virus
4360D. Logic bomb
4361Answer: Stealth virus.
4362Information Security
4363582. To recover files from a backup, you perform a __________.
4364A. restore
4365B. scan
4366C. unerase
4367D. copy
4368Answer: restore
4369Information Security
4370583. What is the return value of this substr function? <?php $rest =
4371substr("abcdef", -1); $rest = substr("abcdef", 0, -1); ?>
4372A. f,abcde
4373B. a,fedcb
4374C. b,abcdef
4375D. a,abcde
4376Answer: A
4377Internet and Web Programming
4378584. What is the strpos() function used for in PHP?
4379A. Find the last occurrence of the string within a string
4380B. Find the first occurrence of the string within a string
4381C. Both a and b
4382D. Search for all occurrence within a string
4383Answer: B
4384Internet and Web Programming
4385585. What does explode do?
4386A. Used to convert a string to an array.
4387B. Used to split a given string into the number of chunks specified
4388C. Used to split a string by a string
4389D. Used to split string into two equal halves
4390Answer: A
4391Internet and Web Programming
4392586. In CSS, you have the following options for changing line-height?
4393A. number, length, %
4394B. normal, number, length, %
4395C. normal, number, length
4396D. number and length only
4397Answer: B
4398Internet and Web Programming
4399587. Which command we use to set an image on background?
4400A. image-background:url('R4R_Logo.jpg')
4401B. background-image:url('R4R_Logo.jpg')
4402C. bg-image:url('R4R_Logo.jpg')
4403D. background-image:href('R4R_Logo.jpg')
4404Answer: B
4405Internet and Web Programming
4406588. How do you add a background color for all <h1> elements?
4407A. h1.all {background-color:#FFFFFF}
4408B. all.h1 {background-color:#FFFFFF}
4409C. h1 {background-color:#FFFFFF}
4410D. None of the above
4411Answer: C
4412Internet and Web Programming
4413589. How do you locate the first X in a string txt?
4414A. txt.find('X');
4415B. txt.locate('X');
4416C. txt.indexOf('X');
4417D. txt.countTo('X');
4418Answer: C
4419Internet and Web Programming
4420590. How do substring() and substr() differ?
4421A. One is not a method of the String object
4422B. substr() takes three arguments, substring() only two
4423C. Only one accepts a desired string length as an argument
4424D. Besides the spelling, nothing
4425Answer: C
4426Internet and Web Programming
4427591. What is the correct way to include the file "time.inc”?
4428A. <?php include_file("time.inc"); ?>
4429B. <?php require("time.inc"); ?>
4430C. <% include file="time.inc" %>
4431D. <!--include file="time.inc"-->
4432Answer: B
4433Internet and Web Programming
4434592. What is the purpose of the basename function?
4435A. Returns last accessed time of the file
4436B. Returns first accessed time of the file
4437C. Strips of the path and returns the file name
4438D. Strips of the path and returns the folder name
4439Answer: C
4440Internet and Web Programming
4441593. What is the purpose of $_SESSION []?
4442A. Used to register a global variable
4443B. Used to initialize a session
4444C. Used to store variables of the current session
4445D. None of the above
4446Answer: C
4447Internet and Web Programming
4448594. A script is a
4449A. Program or sequence of instructions that is interpreted or carried out by processor
4450directly
4451B. Program or sequence of instruction that is interpreted or carried out by another program
4452C. Program or sequence of instruction that is interpreted or carried out by web server only
4453D. None of above
4454Answer: B
4455Internet and Web Programming
4456595. In PHP, Which method is used to getting browser properties
4457A. $_SERVER ['HTTP_USER_AGENT']
4458B. $_SERVER ['PHP_SELF']
4459C. $_SERVER ['SERVER_NAME']
4460D. $_SERVER ['HTTP_VARIENT']
4461Answer: B
4462Internet and Web Programming
4463596. How much storage space does DATETIME require?
4464A. 4 bytes
4465B. 2 bytes
4466C. 8 bytes
4467D. 1 byte
4468Answer: C
4469Internet and Web Programming
4470597. <script language="javascript"> function x() { var s= "Good 100%";
4471var pattern = /\D/g; var output= s.match(pattern);
4472document.write(output); } </script>
4473A. Good %
4474B. 1,0,0
4475C. G,o,o,d,%
4476D. Error
4477Answer: C
4478Internet and Web Programming
4479598. How do you display a border like this? The top border = 10 pixels
4480The bottom border = 5 pixels The left border = 20 pixels The right border
4481= 1pixel
4482A. border-width: 10px 1px 5px 20px
4483B. border-width: 10px 5px 20px 1px
4484C. border-width: 5px 20px 10px 1px
4485D. border-width: 10px 20px 5px 1px
4486Answer: A
4487Internet and Web Programming
4488599. How do you display hyperlinks without an underline?
4489A. a {text-decoration:no underline}
4490B. a {underline:none}
4491C. a {decoration:no underline}
4492D. a {text-decoration:none}
4493Answer: D
4494Internet and Web Programming
4495600. Defining clickable sub-areas on an image is called?
4496A. image linking
4497B. image mapping
4498C. multiple linking
4499D. image selection
4500Answer: B
4501Internet and Web Programming
4502601. There are many ____ images that exist on the Web that you can
4503freely use on your Web sites.
4504A. public-domain
4505B. commercial
4506C. registered
4507D. copyrighted
4508Answer: A
4509Internet and Web Programming
4510602. If a browser has Javascript turned off it will
4511A. ignore all <script> and <noscript> tags
4512B. display the content of <script> tags
4513C. display the content of <noscript> tags
4514D. display the content of <script> and <noscript> tags
4515Answer: C
4516Internet and Web Programming
4517603. <html><head><script type="text/javascript"
4518language="javascript"> var qpt= new Array(); qpt[0] =
4519"WebDevelopment"; qpt[1]="ApplicationDevelopment" qpt[2]="Testing"
4520qpt[3] = "QualityPointTechnologies"; document.write(qpt[0,1,2,3]);
4521</script></head></html> Show the answer?
4522A. Error
4523B. QualityPointTechnologies
4524C. WebDevelopment
4525D. Testing
4526Answer: B
4527Internet and Web Programming
4528604. <html> <head> <script type="text/javascript"> var qpt = "Quality
4529Point Technologies"; var result = qpt.split(" "); document.write(result);
4530</script> </head> </html> Show the answer?
4531A. Quality
4532B. Q,u,a,l,i,t,y,P,o,i,n,t,T,e,c,h,n,o,l,o,g,i,e,s
4533C. Quality,Point,Technologies
4534D. QualityPointTechnologies
4535Answer: C
4536Internet and Web Programming
4537605. Which of the following is NOT a type of popup box ?
4538A. Alert
4539B. Confirm
4540C. Radio
4541D. Text
4542Answer: D
4543Internet and Web Programming
4544606. How do you read the first character in a string ?
4545A. stringName.charAt(0);
4546B. stringName.substring(1);
4547C. stringName.charAt(1);
4548D. stringName.charAt(2);
4549Answer: B
4550Internet and Web Programming
4551607. Which method is used to search for a substring ?
4552A. stringVariable.indexOf(charAt(0))
4553B. stringVariable.substring(subString)
4554C. stringVariable.find(subString)
4555D. stringVariable.indexOf(subString)
4556Answer: B
4557Internet and Web Programming
4558608. What is the correct way to connect to a MySQL database?
4559A. mysql_open("localhost");
4560B. mysql_connect("localhost");
4561C. connect_mysql("localhost");
4562D. dbopen("localhost");
4563Answer: B
4564Internet and Web Programming
4565609. How do you get information from a form that is submitted using the
4566"get" method?
4567A. Request.QueryString;
4568B. $_GET[];
4569C. Request.Form;
4570D. $_POST[];
4571Answer: B
4572Internet and Web Programming
4573610. <link rel=stylesheet href="whatever.css" type="text/css"> is used
4574for adding CSS to the entire site ?
4575A. Yes - if present on all pages in the site.
4576B. Only if written in the <body>-section of the page.
4577C. no
4578D. error
4579Answer: A
4580Internet and Web Programming
4581611. What is the correct HTML for referring to an external style sheet?
4582A. <stylesheet>mystyle.css
4583B. <link rel="stylesheet" type="text/css" href="mystyle.css">
4584C. <style src="mystyle.css">
4585D. none
4586Answer: B
4587Internet and Web Programming
4588612. What is the correct way to open the file "time.txt" as readable?
4589A. open("time.txt");
4590B. open("time.txt","read");
4591C. fopen("time.txt","r");
4592D. fopen("time.txt","r+");
4593Answer: C
4594Internet and Web Programming
4595613. Which attribute specify where to send a form in HTML
4596A. Method
4597B. input
4598C. output
4599D. action
4600Answer: action
4601Internet and Web Programming
4602614. In CSS, How do you make a list that list that lists its items with
4603squares
4604A. type: square
4605B. list-style-type: square
4606C. list-type:square
4607D. style-list:square
4608Answer: list-style-type: square
4609Internet and Web Programming
4610615.
4611A.
4612B.
4613C.
4614D.
4615Answer:
4616Internet and Web Programming
4617616.
4618A.
4619B.
4620C.
4621D.
4622Answer:
4623Internet and Web Programming
4624617. What is the correct CSS syntax for making all the <p> elements
4625bold
4626A. p{text-size:bold}
4627B. p{font-weight:bold}
4628C. <p style="font-size:bold">
4629D. <p style="text-size:bold">
4630Answer: p{font-weight:bold}
4631Internet and Web Programming
4632618. How do you display hyperlinks without an underline in HTML
4633A. a {text-decoration:no underline}
4634B. a {underline:none}
4635C. a {decoration:no underline}
4636D. a {text-decoration:none}
4637Answer: a {text-decoration:none}
4638Internet and Web Programming
4639619. <html><head><script language="javascript"> qpt=((45%2)==0)?
4640"hello" : "bye"; document.write(qpt); </script></head></html> Show the
4641answer?
4642A. hello
4643B. bye
4644C. Error in string handling
4645D. None of the above
4646Answer: bye
4647Internet and Web Programming
4648620.
4649A.
4650B.
4651C.
4652D.
4653Answer:
4654Internet and Web Programming
4655621.
4656A.
4657B.
4658C.
4659D.
4660Answer:
4661Internet and Web Programming
4662622.
4663A.
4664B.
4665C.
4666D.
4667Answer:
4668Internet and Web Programming
4669623.
4670A.
4671B.
4672C.
4673D.
4674Answer:
4675Internet and Web Programming
4676624. A variable $word is set to “WELCOME TO VIT”, which of the
4677following php script returns in title case________________
4678A. echo ucwords($word)
4679B. echo ucwords(strtolower($word))
4680C. echo ucfirst($word)
4681D. echo ucfirst(strtolower($word))
4682Answer: echo ucwords(strtolower($word))
4683Internet and Web Programming
4684625. The following piece of php script will output <?php $n1=016;$n2=9;
4685$n=$n1+$n2; print($n); ?>
4686A. 23
4687B. 25
4688C. 23
4689D. none
4690Answer: 23
4691Internet and Web Programming
4692626.
4693A.
4694B.
4695C.
4696D.
4697Answer:
4698Internet and Web Programming
4699627.
4700A.
4701B.
4702C.
4703D.
4704Answer:
4705Internet and Web Programming
4706628.
4707A.
4708B.
4709C.
4710D.
4711Answer:
4712Internet and Web Programming
4713629. Which of the following method is suitable when you need to send
4714larger form submissions
4715A. Get
4716B. Post
4717C. Both Get and Post
4718D. none
4719Answer: post
4720Internet and Web Programming
4721630.
4722A.
4723B.
4724C.
4725D.
4726Answer:
4727Internet and Web Programming
4728631. Which of the following is not true
4729A. PHP can be used to develop web applications
4730B. PHP makes a website dynamic
4731C. PHP applications can not be compiled
4732D. PHP can not be embedded into html
4733Answer: PHP can not be embedded into html
4734Internet and Web Programming
4735632.
4736A.
4737B.
4738C.
4739D.
4740Answer:
4741Internet and Web Programming
4742633. Which of the following variables is not a predefined variable in PHP
4743A. $_get
4744B. $_ask
4745C. $_request
4746D. $_post
4747Answer: $_ask
4748Internet and Web Programming
4749634. Which of the following command is valid in MYSQL
4750A. show tables
4751B. show column
4752C. show column from Table
4753D. None
4754Answer: show tables
4755Internet and Web Programming
4756635. Which parameter of PHP mail function contains the BCC, CC
4757address
4758A. To
4759B. From
4760C. Header
4761D. Sub
4762Answer: Header
4763Internet and Web Programming
4764636. Study following steps and determine the correct order (1) Open a
4765connection to MySql server (2) Execute the SQL query (3) Fetch the data
4766from query (4) Select database (5) Close Connection
4767A. 1, 4, 2, 3, 5
4768B. 4, 1, 2, 3, 5
4769C. 1, 5, 4, 2, 1
4770D. 1, 4, 3, 2, 5
4771Answer: 1, 4, 2, 3, 5
4772Internet and Web Programming
4773637.
4774A.
4775B.
4776C.
4777D.
4778Answer:
4779Internet and Web Programming
4780638.
4781A.
4782B.
4783C.
4784D.
4785Answer:
4786Internet and Web Programming
4787639.
4788A.
4789B.
4790C.
4791D.
4792Answer:
4793Internet and Web Programming
4794640. In mail($param2, $param2, $param3, $param4), the $param3
4795contains
4796A. The message
4797B. The recipient
4798C. The header
4799D. The subject
4800Answer: The message
4801Internet and Web Programming
4802641. What is a frameset
4803A. A set of different pages grouped together in frames
4804B. A set of different pages grouped together in frames
4805C. One page that is split up over different pages
4806D. A set of pages linked to each other with hyperlinks
4807Answer: One page that is split up over different pages
4808Internet and Web Programming
4809642.
4810A.
4811B.
4812C.
4813D.
4814Answer:
4815Internet and Web Programming
4816643.
4817A.
4818B.
4819C.
4820D.
4821Answer:
4822Internet and Web Programming
4823644. (1) Assume CS=03E0h and IP=1F20h, from what address is the
4824next instruction fetched?
4825A. 05D20h
4826B. 12345h
4827C. 23456h
4828D. 05D2Fh
4829Answer: a
4830Microprocessor and Interfacing
4831645.
4832A.
4833B.
4834C.
4835D.
4836Answer:
4837Microprocessor and Interfacing
4838646. (2) The Pentium uses the following technique to maintain a steady
4839flow of instructions into pipelines?
4840A. Priority Inversion
4841B. Recursion
4842C. Branch Prediction
4843D. None of the above
4844Answer: c
4845Microprocessor and Interfacing
4846647.
4847A.
4848B.
4849C.
4850D.
4851Answer:
4852Microprocessor and Interfacing
4853648.
4854A.
4855B.
4856C.
4857D.
4858Answer:
4859Microprocessor and Interfacing
4860649. (3) Compute the average memory access time from the following
4861information:
4862A.
4863B.
4864C.
4865D.
4866Answer:
4867Microprocessor and Interfacing
4868650. RAM access time = 80ns / cache access time =10ns / hit ratio =
48690.92
4870A. 122ns
4871B. 0.92(10ns) + (1-0.92) (90ns)
4872C. 21ns
4873D. 0.92*80ns
4874Answer: b
4875Microprocessor and Interfacing
4876651.
4877A.
4878B.
4879C.
4880D.
4881Answer:
4882Microprocessor and Interfacing
4883652.
4884A.
4885B.
4886C.
4887D.
4888Answer:
4889Microprocessor and Interfacing
4890653. (4) The instruction MOV [BP+SI] , AH is an example of ------
4891addressing mode
4892A.
4893B.
4894C.
4895D.
4896Answer:
4897Microprocessor and Interfacing
4898654.
4899A. Relative
4900B. Based indexed
4901C. Immediate
4902D. register
4903Answer: b
4904Microprocessor and Interfacing
4905655.
4906A.
4907B.
4908C.
4909D.
4910Answer:
4911Microprocessor and Interfacing
4912656. (5) The result of IMUL CL if AL contains 20h and CL contains 80h is
4913---------
4914A. F000h
4915B. 4096h
4916C. 1234h
4917D. 4069h
4918Answer: a
4919Microprocessor and Interfacing
4920657.
4921A.
4922B.
4923C.
4924D.
4925Answer:
4926Microprocessor and Interfacing
4927658.
4928A.
4929B.
4930C.
4931D.
4932Answer:
4933Microprocessor and Interfacing
4934659. (6) The result of NEG AX is ------------if AX contains FFECh
4935A. 0024h
4936B. 0014h
4937C. 0041h
4938D. 0023h
4939Answer: b
4940Microprocessor and Interfacing
4941660.
4942A.
4943B.
4944C.
4945D.
4946Answer:
4947Microprocessor and Interfacing
4948661. (7) How many times does the NOP instruction execute in the
4949following sequence?
4950A.
4951B.
4952C.
4953D.
4954Answer:
4955Microprocessor and Interfacing
4956662.
4957A.
4958B.
4959C.
4960D.
4961Answer:
4962Microprocessor and Interfacing
4963663.
4964A.
4965B.
4966C.
4967D.
4968Answer:
4969Microprocessor and Interfacing
4970664. MOV CX, 02h
4971A. 8
4972B. 80
4973C. 12
4974D. 11
4975Answer: a
4976Microprocessor and Interfacing
4977665. XYZ :PUSH CX
4978A.
4979B.
4980C.
4981D.
4982Answer:
4983Microprocessor and Interfacing
4984666. MOV CX, 04h
4985A.
4986B.
4987C.
4988D.
4989Answer:
4990Microprocessor and Interfacing
4991667. ABC: NOP
4992A.
4993B.
4994C.
4995D.
4996Answer:
4997Microprocessor and Interfacing
4998668. LOOP ABC
4999A.
5000B.
5001C.
5002D.
5003Answer:
5004Microprocessor and Interfacing
5005669. POP CX
5006A.
5007B.
5008C.
5009D.
5010Answer:
5011Microprocessor and Interfacing
5012670. LOOP XYZ
5013A.
5014B.
5015C.
5016D.
5017Answer:
5018Microprocessor and Interfacing
5019671.
5020A.
5021B.
5022C.
5023D.
5024Answer:
5025Microprocessor and Interfacing
5026672. (8) Which interrupt is recognized first? NMI or single step?
5027A. NMI
5028B. Single Step
5029C.
5030D.
5031Answer: a
5032Microprocessor and Interfacing
5033673.
5034A.
5035B.
5036C.
5037D.
5038Answer:
5039Microprocessor and Interfacing
5040674.
5041A. 20 and 16
5042B. 16 and 22
5043C. 16 and 20
5044D. 12 and 21
5045Answer: a
5046Microprocessor and Interfacing
5047675. (9) The 8086 has ----------address lines and -------------data lines?
5048A.
5049B.
5050C.
5051D.
5052Answer:
5053Microprocessor and Interfacing
5054676.
5055A.
5056B.
5057C.
5058D.
5059Answer:
5060Microprocessor and Interfacing
5061677. (10) ----------------is the IC number of USART?
5062A. IC 8255
5063B. IC8257
5064C. IC8259
5065D. IC8251
5066Answer: d
5067Microprocessor and Interfacing
5068678.
5069A.
5070B.
5071C.
5072D.
5073Answer:
5074Microprocessor and Interfacing
5075679.
5076A.
5077B.
5078C.
5079D.
5080Answer:
5081Microprocessor and Interfacing
5082680. (11) What interrupts are disabled by writing 10100001 into OCW1?
5083A. IR7,IR5,IR0
5084B. IR6 and IR 4
5085C. IR1
5086D. IR2
5087Answer: a
5088Microprocessor and Interfacing
5089681.
5090A.
5091B.
5092C.
5093D.
5094Answer:
5095Microprocessor and Interfacing
5096682.
5097A.
5098B.
5099C.
5100D.
5101Answer:
5102Microprocessor and Interfacing
5103683. (12) The sequence of instructions will store -----------in DL when it
5104exits the loop.
5105A.
5106B.
5107C.
5108D.
5109Answer:
5110Microprocessor and Interfacing
5111684.
5112A.
5113B.
5114C.
5115D.
5116Answer:
5117Microprocessor and Interfacing
5118685.
5119A.
5120B.
5121C.
5122D.
5123Answer:
5124Microprocessor and Interfacing
5125686. MOV DL,00h
5126A. 9
5127B. 10
5128C. 11
5129D. 12
5130Answer: a
5131Microprocessor and Interfacing
5132687. MOV CL,01h
5133A.
5134B.
5135C.
5136D.
5137Answer:
5138Microprocessor and Interfacing
5139688. MOV CX,09h
5140A.
5141B.
5142C.
5143D.
5144Answer:
5145Microprocessor and Interfacing
5146689. Next:ADD DL,01h
5147A.
5148B.
5149C.
5150D.
5151Answer:
5152Microprocessor and Interfacing
5153690. LOOP Next
5154A.
5155B.
5156C.
5157D.
5158Answer:
5159Microprocessor and Interfacing
5160691.
5161A.
5162B.
5163C.
5164D.
5165Answer:
5166Microprocessor and Interfacing
5167692.
5168A.
5169B.
5170C.
5171D.
5172Answer:
5173Microprocessor and Interfacing
5174693.
5175A.
5176B.
5177C.
5178D.
5179Answer:
5180Microprocessor and Interfacing
5181694. (13) The use of indexing or base addressing does not increase the
5182instruction execution.
5183A. TRUE
5184B. FALSE
5185C.
5186D.
5187Answer: b
5188Microprocessor and Interfacing
5189695.
5190A.
5191B.
5192C.
5193D.
5194Answer:
5195Microprocessor and Interfacing
5196696.
5197A.
5198B.
5199C.
5200D.
5201Answer:
5202Microprocessor and Interfacing
5203697. (14) After the following sequence of operations contents of AX is ---
5204------------
5205A.
5206B.
5207C.
5208D.
5209Answer:
5210Microprocessor and Interfacing
5211698. PUSH AX; AX contains 20h
5212A.
5213B.
5214C.
5215D.
5216Answer:
5217Microprocessor and Interfacing
5218699. PUSH BX; BX contains 24h
5219A. 22h
5220B. 24h
5221C. 20h
5222D. 04h
5223Answer: c
5224Microprocessor and Interfacing
5225700. MOV AX, 22h
5226A.
5227B.
5228C.
5229D.
5230Answer:
5231Microprocessor and Interfacing
5232701. POP BX
5233A.
5234B.
5235C.
5236D.
5237Answer:
5238Microprocessor and Interfacing
5239702. POP AX
5240A.
5241B.
5242C.
5243D.
5244Answer:
5245Microprocessor and Interfacing
5246703. MOV BX, 2Ah
5247A.
5248B.
5249C.
5250D.
5251Answer:
5252Microprocessor and Interfacing
5253704.
5254A.
5255B.
5256C.
5257D.
5258Answer:
5259Microprocessor and Interfacing
5260705.
5261A.
5262B.
5263C.
5264D.
5265Answer:
5266Microprocessor and Interfacing
5267706. (15) The following sequence of instructions is used to compute -----
5268-------------
5269A.
5270B.
5271C.
5272D.
5273Answer:
5274Microprocessor and Interfacing
5275707. PUSH X
5276A.
5277B.
5278C.
5279D.
5280Answer:
5281Microprocessor and Interfacing
5282708. PUSH Y
5283A. X-Y
5284B. Y-X
5285C. Y-AX
5286D. X-BX
5287Answer: b
5288Microprocessor and Interfacing
5289709. POP AX
5290A.
5291B.
5292C.
5293D.
5294Answer:
5295Microprocessor and Interfacing
5296710. 8086 is interfaced to two 8259s (Programmable interrupt
5297controllers). If 8259s are in master slave configuration the number of
5298interrupts available to the 8086 microprocessor is
5299A. 8
5300B. 16
5301C. 15
5302D. 64
5303Answer: D
5304Microprocessor and Interfacing
5305711.
5306A.
5307B.
5308C.
5309D.
5310Answer:
5311Microprocessor and Interfacing
5312712.
5313A.
5314B.
5315C.
5316D.
5317Answer:
5318Microprocessor and Interfacing
5319713.
5320A.
5321B.
5322C.
5323D.
5324Answer:
5325Microprocessor and Interfacing
5326714. 8086 microprocessor is interfaced to 8253 a programmable interval
5327timer. The maximum number by which the clock frequency on one of the
5328timers is divided by
5329A. 216
5330B. 28
5331C. 210
5332D. 220
5333Answer: A
5334Microprocessor and Interfacing
5335715.
5336A.
5337B.
5338C.
5339D.
5340Answer:
5341Microprocessor and Interfacing
5342716.
5343A.
5344B.
5345C.
5346D.
5347Answer:
5348Microprocessor and Interfacing
5349717.
5350A.
5351B.
5352C.
5353D.
5354Answer:
5355Microprocessor and Interfacing
5356718. . Give the control word address if port C lower bit is to be
5357configured as input Port, port A as an output port in mode 0 and port B
5358is not used in I/O mode?
5359A. 80
5360B. 81
5361C. 87
5362D. 7
5363Answer: B
5364Microprocessor and Interfacing
5365719. If the programmable counter timer 8254 is set in mode 1 and is to
5366be used to count six events, the output will remain at logic 0 for _____
5367number of counts
5368A. 5
5369B. 6
5370C. 0
5371D. None of the above
5372Answer: B
5373Microprocessor and Interfacing
5374720. Conversion of the +1000 decimal number into signed binary word
5375results
5376A. 0000 0011 1110 1000
5377B. 1111 1100 0001 1000
5378C. 1000 0011 1110 1000
5379D. 0111 1100 0001 1000
5380Answer: C
5381Microprocessor and Interfacing
5382721. The 8255 Programmable Peripheral Interface isused as described
5383below. (i)An A/D converter is interfaced to a icroprocessor through an
53848255. The conversion is initiated by a signal from the 8255 on Port C. A
5385signal on Port C causes data to be stored into Port A. (ii) Two computers
5386exchange data using a pair of 8255s.Port A works as a bidirectional data
5387port supported by appropriate handshaking signals. The appropriate
5388modes of operation of the 8255 for (i) and (ii) would be
5389A. Mode 0 for (i) and Mode 1 for (ii)
5390B. Mode 1 for (i) and Mode 2 for (ii)
5391C. Mode 2 for (i) and Mode 0 for (ii)
5392D. Mode 2 for (i) and Mode 1 for (ii)
5393Answer: D
5394Microprocessor and Interfacing
5395722. Given that the bl register contains ‘B’, the effect of the following
5396instruction or bl, 0010 0000 is to
5397A. clear bl
5398B. store ‘b’ in bl
5399C. store 0010 0000 in bl
5400D. leave bl unchanged
5401Answer: D
5402Microprocessor and Interfacing
5403723. Which type of JMP instruction assembles if the distance is 0020 h
5404bytes
5405A. near
5406B. far
5407C. short
5408D. long
5409Answer: A
5410Microprocessor and Interfacing
5411724. Number of the times the instruction sequence below will loop
5412before coming out of loop is MOV AL, 00h A1: INC AL JNZ A1
5413A. 0
5414B. 1
5415C. 255
5416D. 256
5417Answer: D
5418Microprocessor and Interfacing
5419725. What will be the contents of register AL after the following has been
5420executed MOV BL, 8C MOV AL, 7E ADD AL, BL
5421A. 0A and carry flag is set
5422B. 0A and carry flag is reset
5423C. 6A and carry flag is set
5424D. 6A and carry flag is reset
5425Answer: A
5426Microprocessor and Interfacing
5427726. Ready pin of a microprocessor is used
5428A. to indicate that the microprocessor is ready to receive inputs.
5429B. to indicate that the microprocessor is ready to receive outputs.
5430C. to introduce wait states.
5431D. to provide direct memory access.
5432Answer: C
5433Microprocessor and Interfacing
5434727. LOCK prefix is used most often
5435A. during normal execution.
5436B. during DMA accesses
5437C. during interrupt servicing.
5438D. during memory accesses.
5439Answer: C
5440Microprocessor and Interfacing
5441728. Which pins are general purpose I/O pins during mode-2 operation
5442of the 82C55?
5443A. PA0 – PA7
5444B. PB0-PB7
5445C. PC3-PC7
5446D. PC0-PC2
5447Answer: A
5448Microprocessor and Interfacing
5449729. The no. of address lines required to address a memory of size 32 K
5450is
5451A. 15 lines
5452B. 16 lines
5453C. 18 lines
5454D. 14 lines
5455Answer: A
5456Microprocessor and Interfacing
5457730. 8088 microprocessor has
5458A. 16 bit data bus
5459B. 4 byte pre-fetch queue
5460C. 7 byte pre-fetch queue
5461D. 16 bit address bus
5462Answer: D
5463Microprocessor and Interfacing
5464731. What is the advantage of modeling and simulation.
5465A. Better understanding of the system
5466B. Experimenting new or unknown situation
5467C. Employ system approach to problem solving
5468D. All the above.
5469Answer: All the above.
5470Modelling and Simulation
5471732. Systems in which the changes are predominantly smooth are called
5472__________
5473A. Discrete System
5474B. Continuous system
5475C. Dynamic system
5476D. Static system
5477Answer: Continuous system
5478Modelling and Simulation
5479733. When we should not go for simulations (i) To experiment with new
5480designs or policies prior to implementation. (ii) To verify analytic
5481solutions. (iii) If the simulation costs exceeds savings. (iv) If the
5482resources or time are not available.
5483A. Both i and ii
5484B. Both i and iii
5485C. Both iii and iv
5486D. only i.
5487Answer: Both iii and iv
5488Modelling and Simulation
5489734. The term ___________ is used to describe activities and events in
5490the environment that affect the system.
5491A. Endogenous System
5492B. Exogenous System
5493C. Closed System
5494D. open system
5495Answer: Exogenous System
5496Modelling and Simulation
5497735. Monte-Carlo simulation is otherwise called as
5498A. Mathematical Model
5499B. Dynamic Model
5500C. Static Model
5501D. Deterministic Model
5502Answer: Static Model
5503Modelling and Simulation
5504736. A system for which there is exogenous activity and event is said to
5505be
5506A. Endogenous System
5507B. Exogenous System
5508C. Closed System
5509D. open system
5510Answer: open system
5511Modelling and Simulation
5512737. _______________ Model represents systems as they change over
5513time.
5514A. Static Model
5515B. Dynamic model.
5516C. Deterministic Model
5517D. Stochastic Model
5518Answer: Dynamic model.
5519Modelling and Simulation
5520738. _____________ refers to customer actions while in a queue waiting
5521for service to begin.
5522A. FIFO
5523B. Queue behavior
5524C. Queue discipline
5525D. None of the above.
5526Answer: Queue discipline
5527Modelling and Simulation
5528739. In a single channel Queue (i) the calling population is infinite (ii) the
5529calling population is finite (iii) if a unit leaves the calling population and
5530joins the waiting line there is no change in the arrival rate of other units
5531that may need service. (iv) if a unit leaves the calling population and
5532joins the waiting line there is a change in the arrival rate of other units
5533that may need service.
5534A. I and iii
5535B. i and iv
5536C. ii and iii
5537D. ii and iv
5538Answer: I and iii
5539Modelling and Simulation
5540740. which test Uses the Kolmogorov-Smirnov or the chi- square test to
5541compare the distribution of the set of numbers generated to a uniform
5542distribution.
5543A. Frequency test.
5544B. Autocorrelation test.
5545C. Gap test
5546D. Poker test
5547Answer: Frequency test.
5548Modelling and Simulation
5549741. Consider a random variable X that is uniformly distributed on the
5550interval [a, b]. A reasonable guess for generating X is given by
5551A. X = a + (a - b)
5552B. a +(b - a)R
5553C. X = a + (b + a)R
5554D. X = a-(b - a)
5555Answer: a +(b - a)R
5556Modelling and Simulation
5557742. which distribution technique Models the number of independent
5558events that occur in a fixed amount of time or space .
5559A. Binomial Distribution
5560B. Negative Bi nomial Distribution
5561C.
5562D. Poison distribution
5563Answer: Normal Distribution.
5564Modelling and Simulation
5565743. Which model contains no Random variables .
5566A. Static Model
5567B. Dynamic Model
5568C. Deterministic Model
5569D. Stochastic Model
5570Answer: Deterministic Model
5571Modelling and Simulation
5572744. The average waiting time for a customer is 2.8minutes. The total
5573time for customers to wait in the queue is 56 minutes find the total
5574number of customers standing in the queue.
5575A. 156
5576B. 157
5577C. 20
5578D. 24
5579Answer: 20
5580Modelling and Simulation
5581745. The Number of customers who are waiting in the queue is 13 and
5582the total number of customers is 20. Find out the pro ability of waiting
5583time of each customer.
5584A. 53
5585B. 0.2
5586C. 0.5
5587D. 0.65
5588Answer: 0.65
5589Modelling and Simulation
5590746. A computer cannot boot if it does not have the
5591A. Compiler
5592B. Loader
5593C. Assembler
5594D. Interpreter
5595Answer: Loader
5596Operating Systems
5597747. In real time computing, priority inheritance protocol doesn’t
5598accomplish one of the following issues
5599A. Occurrence of deadlock
5600B. Priority inversion
5601C. Preempt the resources
5602D. Assigning the resources
5603Answer: Occurrence of deadlock
5604Operating Systems
5605748. Disadvantage of Spin lock is
5606A. Avoid overhead from rescheduling
5607B. Do not acquire lock
5608C. Do not support atomic operations
5609D. Require re-scheduling
5610Answer: Do not acquire lock
5611Operating Systems
5612749. Which of the following CPU scheduling criteria must be reduced
5613A. Waiting time
5614B. Throughput
5615C. Response time
5616D. Both a and c
5617Answer: Both a and c
5618Operating Systems
5619750. Part of program, where the shared memory is accessed and which
5620should be executed indivisibly is called
5621A. semaphores
5622B. directory
5623C. critical section
5624D. mutual exclusion
5625Answer: critical section
5626Operating Systems
5627751. What are the possible approaches to deadlock recovery?
5628A. Avoiding mutual Exclusion
5629B. Avoid Hold and Wait
5630C. Preemption
5631D. Avoid Circular Wait
5632Answer: Preemption
5633Operating Systems
5634752. All details regarding the physical page frames are maintained in a
5635data structure called ____________.
5636A. Frame table
5637B. Page table
5638C. Free frame list
5639D. Sparse address space
5640Answer: Frame table
5641Operating Systems
5642753. Function of the syntax phase scheduler is………….
5643A. Allocate CPU time to process from ready queue
5644B. Decides which process should enter into the ready queue
5645C. Swaps the process from the main memory to secondary memory
5646D. dispatch tasks according to execution characteristics
5647Answer: Allocate CPU time to process from ready queue
5648Operating Systems
5649754. While running DOS on a PC, which command would be used to
5650duplicate entire diskette?
5651A. `Diskcopy
5652B. Extend
5653C. DiskPart
5654D. Fdisk
5655Answer: Diskcopy
5656Operating Systems
5657755. What is the state of processor, when a process is waiting for some
5658event to occur?
5659A. Ready State
5660B. Blocked State
5661C. Active State
5662D. Running State
5663Answer: Blocked State
5664Operating Systems
5665756. What command will you use to review boot messages?
5666A. fdisk
5667B. Dmesg
5668C. Deloldos
5669D. dblspace
5670Answer: Dmesg
5671Operating Systems
5672757. You have been assigned the task of determining if there are any
5673user accounts defined on your system that have not been used during
5674the last three months. Which log file should you examine to determine
5675this information?
5676A. /var/log/wtmp
5677B. /var/log/lastlog
5678C. /var/log/utmp
5679D. /var/log/messages
5680Answer: /var/log/lastlog
5681Operating Systems
5682758. Which log contains information on currently logged in users?
5683A. /var/log/utmp
5684B. /var/log/wtmp
5685C. /var/log/lastlog
5686D. /var/log/messages
5687Answer: /var/log/utmp
5688Operating Systems
5689759. An ----------- uniquely identifies a process and provides addressspace
5690protection for that process.
5691A. Address-space identifier
5692B. Port number
5693C. IP address
5694D. none
5695Answer: Address-space identifier
5696Operating Systems
5697760. In working-set model the set of pages in the most recent page
5698references is called the -----------.
5699A. Page table
5700B. Page table Descripter
5701C. working-set
5702D. none
5703Answer: working-set
5704Operating Systems
5705761. What is a difference between a declaration and a definition of a
5706variable?
5707A. Both can occur multiple times, but a declaration must occur first.
5708B. There is no difference between them.
5709C. A definition occurs once, but a declaration may occur many times.
5710D. A declaration occurs once, but a definition may occur many times.
5711Answer: D
5712Programming Fundamentals
5713762. "My salary was increased by 15%!". Select the statement which will
5714EXACTLY reproduce the line of text above.
5715A. printf("⧵"My salary was increased by 15/%⧵!⧵"⧵n");
5716B. printf("My salary was increased by 15%!⧵n");
5717C. printf("My salary was increased by 15'%'!⧵n");
5718D. printf("⧵"My salary was increased by 15%%!⧵"⧵n");
5719Answer: D
5720Programming Fundamentals
5721763. what will be the output when following code is executed int a=10,b;
5722b=a++ + ++a; printf("%d,%d,%d,%d",b,a++,a,++a);
5723A. 22,13,13,13
5724B. 12,10,11,13
5725C. 22,10,11,13
5726D. 22,11,11,11
5727Answer: A
5728Programming Fundamentals
5729764. Which one of the following provides conceptual support for
5730function calls?
5731A. The system stack
5732B. The data segment
5733C. The processor's registers
5734D. The heap
5735Answer: A
5736Programming Fundamentals
5737765. The time factor when determining the efficiency of algorithm is
5738measured by
5739A. Counting microseconds
5740B. Counting the number of key operations
5741C. Counting the number of statements
5742D. Counting the kilobytes of algorithm
5743Answer: B
5744Programming Fundamentals
5745766. The Worst case occur in linear search algorithm when
5746A. Item is somewhere in the middle of the array
5747B. Item is the last element in the array
5748C. Item is not in the array at all
5749D. Item is the last element in the array or is not there at all
5750Answer: D
5751Programming Fundamentals
5752767. The complexity of merge sort algorithm is
5753A. O(n)
5754B. O(logn)
5755C. O(n2)
5756D. O(nlogn)
5757Answer: D
5758Programming Fundamentals
5759768. Which of the following data structure is not linear data structure
5760A. arrays
5761B. linked list
5762C. stack
5763D. none of the answers
5764Answer: D
5765Programming Fundamentals
5766769. Linked lists are best suited
5767A. for relatively permanent collections of data
5768B. for the size of the structure and the data in the structure are constantly changing
5769C. for both of above situation
5770D. for none of above situation
5771Answer: B
5772Programming Fundamentals
5773770. The difference between linear array and a record is
5774A. An array is suitable for homogeneous data but the data items in a record may have
5775different data type
5776B. In a record, there may not be a natural ordering in opposed to linear array.
5777C. A record form a hierarchical structure but a lienear array does not
5778D. All of above
5779Answer: D
5780Programming Fundamentals
5781771. Which data structure allows deleting data elements from front and
5782inserting at rear?
5783A. Stacks
5784B. Queues
5785C. Dequeues
5786D. Binary search tree
5787Answer: B
5788Programming Fundamentals
5789772. Which of the following sorting algorithm is of divide-and-conquer
5790type?
5791A. Bubble sort
5792B. Insertion sort
5793C. Quick sort
5794D. All of the answers
5795Answer: C
5796Programming Fundamentals
5797773. In event-driven programming an event is generated by:
5798A. the system.
5799B. a user’s action.
5800C. the program itself.
5801D. All of the answers
5802Answer: D
5803Programming Fundamentals
5804774. An Exception is another name for a:
5805A. compile time error
5806B. runtime error
5807C. logic error
5808D. syntax error
5809Answer: B
5810Programming Fundamentals
5811775. With every use of a memory allocation function, what function
5812should be used to release allocated memory which is no longer needed?
5813A. unalloc()
5814B. dealloc()
5815C. release()
5816D. free()
5817Answer: D
5818Programming Fundamentals
5819776. The automated tool used for lexical analysis phase (a) LEX (b) FLEX
5820(c ) BISON (d) YACC
5821A. (a) and (b)
5822B. (b) and (c )
5823C. (a) and (d)
5824D. (c ) and (d)
5825Answer: A
5826Programming Language Translators
5827777. For the given grammar S--> uBDz B--> Bv | w D-->EF E--> y | ô€€€ E-->
5828x | ô€€€ the FOLLOW(B) is
5829A. {v,x,y,z}
5830B. {x,y,z}
5831C. {x,y}
5832D. {y,z}
5833Answer: A
5834Programming Language Translators
5835778. Type checking is done which phase of the compiler (a) Lexical (b)
5836syntax (c ) semantic (d) intermediate code generation
5837A. (a)
5838B. (b)
5839C. (c )
5840D. (d)
5841Answer: C
5842Programming Language Translators
5843779. Let a grammar G be S-->Aa | bAc | Bc | bBa For the viable prefixes
5844b and bd the grammar will have
5845A. reduce- reduce conflict
5846B. Shift-reduce conflict
5847C. both
5848D. no conflicts
5849Answer: A
5850Programming Language Translators
5851780. The interdependencies between the synthesized attribute and
5852inherited attribute is given by (a) dependency graph (b) directed acyclic
5853graph (c ) syntax tree (d) postfix notation
5854A. (a)
5855B. (b)
5856C. (c )
5857D. (d)
5858Answer: A
5859Programming Language Translators
5860781. The use of control stack in an activation record is to keep track of
5861(a) static and dynamic link (b) information about the identifiers (c ) live
5862procedure activations (d) actual paramters in the function
5863A. (a) and (b)
5864B. (c ) and (d)
5865C. all the above
5866D. (a) and (d)
5867Answer: C
5868Programming Language Translators
5869782. All the optimization techniques should be carried out only after the
5870code generation phase
5871A. TRUE
5872B. FALSE
5873C.
5874D.
5875Answer: B
5876Programming Language Translators
5877783. The given grammar is S--> Aa | bAc | dc | bda A-->d
5878A. not LL(1)
5879B. not SLR(1)
5880C. LL(1) but not SLR(1)
5881D. not LL(1) and not SLR(1)
5882Answer: D
5883Programming Language Translators
5884784. After elimintating the common subexpression in a syntax tree the
5885resultant becomes
5886A. postfix notation
5887B. dependency graph
5888C. directed acyclic graph
5889D. three address code
5890Answer: C
5891Programming Language Translators
5892785. While desining the code generator which of the following factors
5893should be considered (a) memory managment (b) input to the code
5894generator (c ) instruction selection (d) target program
5895A. (a) and (b)
5896B. (b) and (c )
5897C. all the above
5898D. (a), (b) and (d)
5899Answer: C
5900Programming Language Translators
5901786. Scanning of the source program is done in which phase of the
5902compiler
5903A. Lexical
5904B. semantic
5905C. syntax
5906D. code generation
5907Answer: A
5908Programming Language Translators
5909787. A parser which is a variant of top-down parsing without
5910backtracking is
5911A. recursive descent
5912B. operator precedence
5913C. LL(1)
5914D. LALR(1)
5915Answer: A
5916Programming Language Translators
5917788. In syntax directed translation if the value of attribute depends on
5918the children node then the attribute is
5919A. synthesized
5920B. inherited
5921C. skewed
5922D.
5923Answer: A
5924Programming Language Translators
5925789. The intermediate code can be represented by (a) 3AC (b) syntax
5926tree (c) DAG
5927A. (a) and (b)
5928B. (c)
5929C. (a)
5930D. (b)
5931Answer: A
5932Programming Language Translators
5933790. If the length of the string w is n, then the number of prefixes and
5934suffixes will be always be
5935A. n+1, n
5936B. n, n
5937C. n, n+1
5938D. n+1, n+1
5939Answer: D
5940Programming Language Translators
5941791. 1. Hardware/Software Codesign deals with
5942A. the cooperative design of hardware and software components
5943B. the unification of currently separate hardware and software paths
5944C. the movement of functionality between hardware and software
5945D. all of the above
5946Answer: Choice D
5947Hardware/Software Codesign
5948792. 2. _______________ means meeting system-level objectives by
5949exploiting the synergism of hardware and software through their
5950concurrent design.
5951A. Hardware/software co-design
5952B. Embedded system
5953C. Computer Architechture
5954D. Degree of Programmability
5955Answer: Choice A
5956Hardware/Software Codesign
5957793. 3. Expand the term CFSM
5958A. Co-design Final State Machine
5959B. Co-design Finite State Machine
5960C. Co-design Finite State Mapping
5961D. Co-design Final State Mapping
5962Answer: Choice B
5963Hardware/Software Codesign
5964794. 4.Drawback of solving Mixed Intergar Linear Programming(MILP) to
5965solve the partitioning problem is,
5966A. It requires high computation time
5967B. it requires less computational speed
5968C. it requires less meomory space
5969D. None of the above
5970Answer: Choice A
5971Hardware/Software Codesign
5972795. 5.Goal of Hardware/Software Codesign is
5973A. to shorten the time-to-market
5974B. reducing the design effort
5975C. reducing the cost of the product
5976D. all of the above
5977Answer: Choice D
5978Hardware/Software Codesign
5979796. 6.Hardware/Software Codesign includes
5980A. Partitioning
5981B. Cosynthesis
5982C. Cosimulation
5983D. all of the above
5984Answer: Choice D
5985Hardware/Software Codesign
5986797. 7.The method for updating the main memory as soon as a word is
5987removed from the Cache is called
5988A. Write-through
5989B. write-back
5990C. protected write
5991D. cache-write
5992Answer: Choice B
5993Hardware/Software Codesign
5994798. 8. Expand the term FPGA
5995A. Field Programmable Gate Alignment
5996B. Flexible Programmable Gate Arrays
5997C. Flexible Programmable Gate Alignment
5998D. Field Programmable Gate Arrays
5999Answer: Choice D
6000Hardware/Software Codesign
6001799. 9.Stack overflow causes
6002A. Hardware interrupt.
6003B. External interrupt.
6004C. Internal interrupt.
6005D. Software interrupt.
6006Answer: Choice C
6007Hardware/Software Codesign
6008800. 10.The ASCII code for letter A is
6009A. 1100011
6010B. 1000001
6011C. 1111111
6012D. 10011
6013Answer: Choice B
6014Hardware/Software Codesign
6015801. 11.Which of the following technology can give high speed RAM?
6016A. TTL
6017B. CMOS
6018C. ECL
6019D. NMOS
6020Answer: Choice C
6021Hardware/Software Codesign
6022802. 12.Pipeline implement
6023A. fetch instruction
6024B. decode instruction
6025C. calculate operand
6026D. All of the above
6027Answer: Choice D
6028Hardware/Software Codesign
6029803. 13.COMET (COdesign METhodology) Hardware-Software Codesign
6030which uses________________ as the software and hardware description
6031of an embedded system
6032A. Java and VHDL
6033B. C and VHDL
6034C. Pascal and VHDL
6035D. basic and VHDL
6036Answer: Choice B
6037Hardware/Software Codesign
6038804. 14. Hardware/Software Partitioning Using the ____________ System
6039A. COSMOS
6040B. COSYMA
6041C. LYCOS
6042D. All the above
6043Answer: Choice C
6044Hardware/Software Codesign
6045805. 15. the term ASIP stands for
6046A. Application Specific Instruction processors
6047B. Architechture Specific Instruction processors
6048C. Application Specific Instruction programs
6049D. Architechture Specific Instruction programs
6050Answer: Choice A
6051Hardware/Software Codesign
6052806. 1. Methodologies adopted while performing Maintenance Testing
6053are
6054A. Breadth Test and Depth Test
6055B. Retesting
6056C. Confirmation Testing
6057D. Sanity Testing
6058Answer: Choice A
6059Software Practice and Testing
6060807. 2. Which of the following is true about Formal Review or Inspection
6061A. Led by Trained Moderator
6062B. No Pre Meeting Preparations
6063C. Formal Follow up process
6064D. Main Objective is to find defects
6065Answer: A, C and D
6066Software Practice and Testing
6067808. 3. Arrange the Phases of formal review process mentioned below in
6068the correct order
6069A. Review Meeting and Individual preparation
6070B. Followup
6071C. Rework
6072D. Planning and kickoff
6073Answer: D, A, C,B
6074Software Practice and Testing
6075809. 4. Consider the following state transition diagram of a two-speed
6076hair dryer,
6077A. C,B,A
6078B. A,C,B
6079C. B,C,A
6080D. A,B,C
6081Answer: Choice D
6082Software Practice and Testing
6083810. which is operated by pressing its one button. The first press of the
6084button turns
6085A.
6086B.
6087C.
6088D.
6089Answer:
6090Software Practice and Testing
6091811. it on to Speed 1, second press to Speed 2 and the third press turns
6092it off.
6093A.
6094B.
6095C.
6096D.
6097Answer:
6098Software Practice and Testing
6099812.
6100A.
6101B.
6102C.
6103D.
6104Answer:
6105Software Practice and Testing
6106813.
6107A.
6108B.
6109C.
6110D.
6111Answer:
6112Software Practice and Testing
6113814.
6114A.
6115B.
6116C.
6117D.
6118Answer:
6119Software Practice and Testing
6120815.
6121A.
6122B.
6123C.
6124D.
6125Answer:
6126Software Practice and Testing
6127816.
6128A.
6129B.
6130C.
6131D.
6132Answer:
6133Software Practice and Testing
6134817.
6135A.
6136B.
6137C.
6138D.
6139Answer:
6140Software Practice and Testing
6141818.
6142A.
6143B.
6144C.
6145D.
6146Answer:
6147Software Practice and Testing
6148819.
6149A.
6150B.
6151C.
6152D.
6153Answer:
6154Software Practice and Testing
6155820.
6156A.
6157B.
6158C.
6159D.
6160Answer:
6161Software Practice and Testing
6162821.
6163A.
6164B.
6165C.
6166D.
6167Answer:
6168Software Practice and Testing
6169822. 5. White Box Techniques are also called as
6170A. Structural testing
6171B. Design Based Testing
6172C. Error Guessing Technique
6173D. Experirnce based Technique
6174Answer: Choice A
6175Software Practice and Testing
6176823. 6. Exhaustive Testing is
6177A. Is impractical but possible
6178B. Is practically possible
6179C. Is impractical and impossible
6180D. None of the Above
6181Answer: Choice A
6182Software Practice and Testing
6183824. 7. Which of the following is not a part of the Test Implementation
6184and Execution Phase
6185A. Creating test suites from test cases
6186B. Executing test cases either manually or by using test executiontools
6187C. Comparing actual results
6188D. Designing the Tests
6189Answer: choice D
6190Software Practice and Testing
6191825.
6192A.
6193B.
6194C.
6195D.
6196Answer:
6197Software Practice and Testing
6198826. 8. Which of the following techniques is NOT a White box technique?
6199A. Statement Testing and Coverage
6200B. Decision Testing and Coverage
6201C. Condition coverage
6202D. Boundary value analysis
6203Answer: Choice D
6204Software Practice and Testing
6205827. 9. A Project risk includes which of the following
6206A. Organizational Factors
6207B. Poor Software characteristics
6208C. Error Prone software delivered
6209D. Software that does not perform its intended functions
6210Answer: Choice A
6211Software Practice and Testing
6212828. 10. In a risk-based approach the risks identified may be used to
6213A. b is True; a, c, d are False
6214B. a,b,c are true and d is false
6215C. b and c are True; a, d are False
6216D. b,c d are True; a is false
6217Answer: Choice B
6218Software Practice and Testing
6219829. a. Determine the test technique to be employed
6220A.
6221B.
6222C.
6223D.
6224Answer:
6225Software Practice and Testing
6226830. b. Determine the extent of testing to be carried out
6227A.
6228B.
6229C.
6230D.
6231Answer:
6232Software Practice and Testing
6233831. c. Prioritize testing in an attempt to find critical defects
6234A.
6235B.
6236C.
6237D.
6238Answer:
6239Software Practice and Testing
6240832. d. Determine the cost of the project
6241A.
6242B.
6243C.
6244D.
6245Answer:
6246Software Practice and Testing
6247833. 11. A Person who documents all the issues, problems and open
6248points that were identified during a forfal review
6249A. Moderator
6250B. Author
6251C. Scriber
6252D. Manager
6253Answer: Choice C
6254Software Practice and Testing
6255834. 12. Which of the following is a Key Characteristics of Walk Through
6256A. Scenario , Dry Run , Peer Group
6257B. Pre Meeting Preparations
6258C. Formal Follow Up Process
6259D. Including Metrics
6260Answer: Choice A
6261Software Practice and Testing
6262835. 13. What can not be found through static analysis?
6263A. the use of a variable before it has been defined
6264B. unreachable code
6265C. memory leaks
6266D. array bound violations
6267Answer: Choice C
6268Software Practice and Testing
6269836. 14. A Type of functional Testing, which investigates the functions
6270relating
6271A. Recovery Testing
6272B. Security Testing
6273C. Functionality Testing
6274D. Performance Testing
6275Answer: Choice B
6276Software Practice and Testing
6277837. to detection of threats, such as virus from malicious outsider is
6278A.
6279B.
6280C.
6281D.
6282Answer:
6283Software Practice and Testing
6284838. 15. Which of the following is not a major task of Exit criteria?
6285A. Checking test logs against the exit
6286B. Logging the outcome of
6287C. Assessing if more tests
6288D. Writing a test summary
6289Answer: Choice B
6290Software Practice and Testing
6291839.
6292A. criteria specified in test planning
6293B. test execution
6294C. are needed
6295D. report for stakeholders
6296Answer:
6297Software Practice and Testing
6298840. In OSI network architecture, the dialogue control and token
6299management are responsibility of
6300A. session layer
6301B. network layer
6302C. transport layer
6303D. data link layer
6304Answer: session layer
6305Computer Networks
6306841. Which of the following communication modes support two-way
6307traffic but in only one direction at a time?
6308A. simplex
6309B. half duplex
6310C. three-quarters duplex
6311D. full duplex
6312Answer: half duplex
6313Computer Networks
6314842. Which of the following is an advantage to using fiber optics data
6315transmission?
6316A. resistance to data theft
6317B. fast data transmission rate
6318C. low noise level
6319D. all of above
6320Answer: all of above
6321Computer Networks
6322843. This was the first network.
6323A. CSNET
6324B. NSFNET
6325C. ARPANET
6326D. ANSNET
6327Answer: ARPANET
6328Computer Networks
6329844. ……………….is the protocol suite for the current Internet.
6330A. TCP/IP
6331B. NCP
6332C. UNIX
6333D. ACM
6334Answer: TCP/IP
6335Computer Networks
6336845. A _______ is a data communication system within a building, plant,
6337or campus, or between nearby buildings.
6338A. MAN
6339B. LAN
6340C. WAN
6341D. none of the above
6342Answer: LAN
6343Computer Networks
6344846. Which of the following is not a transmission medium?
6345A. telephone lines
6346B. coaxial cables
6347C. Modem
6348D. microwave systems
6349Answer: Modem
6350Computer Networks
6351847. Which of the following is required to communicate between two
6352computers?
6353A. communications software
6354B. Protocol
6355C. communication hardware
6356D. all of above including access to transmission medium
6357Answer: all of above including access to transmission medium
6358Computer Networks
6359848. Which organization has authority over interstate and international
6360commerce in the communications field?
6361A. ITU-T
6362B. IEEE
6363C. FCC
6364D. ISOC
6365Answer: ITU-T
6366Computer Networks
6367849. ________ defines how a particular pattern to be interpreted, and
6368what action is to be taken based on that interpretation.
6369A. Semantics
6370B. Syntax
6371C. Timing
6372D. None of the above
6373Answer: Semantics
6374Computer Networks
6375850. Primary structure protein is related to
6376A. Assembly
6377B. Folding
6378C. Packing
6379D. Interaction
6380Answer: Assembly
6381Bioinformatics
6382851. Binding sites are found in
6383A. Primary structure protein
6384B. Secondary structure protein
6385C. Tertiary structure protein
6386D. Quaternary structure protein
6387Answer: Secondary structure protein
6388Bioinformatics
6389852. Window filtering is done in
6390A. Dynamic programming
6391B. Global alignment
6392C. Dot Matrix
6393D. Local alignment
6394Answer: Dot Matrix
6395Bioinformatics
6396853. “Descent from a common ancestor” is a statement of
6397A. Analogy
6398B. Similarity
6399C. Alignment
6400D. Homology
6401Answer: Homology
6402Bioinformatics
6403854. Edit distance is also called as
6404A. Grossberg’s distance
6405B. Darwin’s distance
6406C. Mendel’s distance
6407D. Leveinstein’s distance
6408Answer: Leveinstein’s distance
6409Bioinformatics
6410855. CGC BEST FIT program is for
6411A. Local alignment
6412B. Dot Matrix
6413C. Global alignment
6414D. Dynamic programming
6415Answer: Local alignment
6416Bioinformatics
6417856. Which of the following Scoring matrices are widely used in
6418sequence alignments?
6419A. PAM260,BLOSSOM62
6420B. PAM250,BLOSSUM60
6421C. PAM252, BLOSSOM62
6422D. PAM250,BLOSSUM62
6423Answer: PAM250, BLOSSUM62
6424Bioinformatics
6425857. The expansion of BLAST is
6426A. BLossum Alignment Search Technique
6427B. Basic Local Alignment Search Technique
6428C. BLossum Alignment Search Technique
6429D. Bases Loop alignment Search Technique
6430Answer: Basic Local Alignment Search Technique
6431Bioinformatics
6432858. "Maximum good for the maximum people for the maximum time"
6433relates to
6434A. Principlism theory
6435B. Deontology theory
6436C. Utilitarianism theory
6437D. Virtue ethics
6438Answer: Utilitarianism theory
6439Bioinformatics
6440859. Arden Syntax V2.7 is a standard produced by
6441A. HL7
6442B. Telemedecine
6443C. UMLS
6444D. ICD-10
6445Answer: HL7
6446Bioinformatics
6447860. Lexical tool used for generating lexical variants in UMLS is
6448A. NORM
6449B. WORDIND
6450C. LVG
6451D. UMLS-LEX
6452Answer: LVG
6453Bioinformatics
6454861. which department of Telemedicine uses Otoscope
6455A. Opthalmology
6456B. Pathology
6457C. ENT
6458D. Deramtology
6459Answer: ENT
6460Bioinformatics
6461862. How many semantic types and semantic relationships are available
6462in semantic network of UMLS
6463A. 135, 54
6464B. 145, 45
6465C. 155, 55
6466D. 165, 45
6467Answer: 135, 54
6468Bioinformatics
6469863. Write the one letter code of Tryptophan Amino acid
6470A. P
6471B. T
6472C. W
6473D. Z
6474Answer: W
6475Bioinformatics
6476864. AMD 3000 Dispatch case is an equipment of
6477A. HL7
6478B. UMLS
6479C. NCBI
6480D. Telemedicine
6481Answer: Telemedicine
6482Bioinformatics
6483865. Microcontrollers most often have parallel I/O as --------------and
6484serial I/O as-----------feature.
6485A. Built in & Peripheral
6486B. Synchronous & Asynchronous
6487C. Peripheral & Built in
6488D. Synchronous & Built in
6489Answer: A
6490EMBEDDED SYSTEMS
6491866. ALE/PROG pin is also the program pulse input during
6492A. Memory Read
6493B. Memory Write
6494C. Flash Programming
6495D. Device Execution
6496Answer: C
6497EMBEDDED SYSTEMS
6498867. Priority interrupts eliminates --------------------signal
6499A. INT0/INT1
6500B. Data/Ready
6501C. Busy/Wait
6502D. Read/Write
6503Answer: C
6504EMBEDDED SYSTEMS
6505868. A-------------is a technique for reordering instructions across
6506several loop iterations to reduce pipeline bubbles.
6507A. Operator Scheduling
6508B. Dead Code Elimination
6509C. Frame Pointer
6510D. Software Pipelining
6511Answer: D
6512EMBEDDED SYSTEMS
6513869. Which allows a program to be stitched together out of several
6514smaller pieces.
6515A. Entry Point
6516B. Linker
6517C. Parser
6518D. Loop Fusion
6519Answer: B
6520EMBEDDED SYSTEMS
6521870. In logic analyzer, a timing mode uses an -----------clock that is fast
6522enough to take ----------samples per clock period in a typical system.
6523A. Internal,Several
6524B. External,One
6525C. Internal,One
6526D. External,Several
6527Answer: A
6528EMBEDDED SYSTEMS
6529871. A--------------Communication allows the process to continue
6530execution after sending the communication.
6531A. Message Passing
6532B. Blocking
6533C. Non Blocking
6534D. All the above
6535Answer: C
6536EMBEDDED SYSTEMS
6537872. The ---------------------for a process is defined as the instant during
6538execution at which the task has the largest response time.
6539A. Critical instant
6540B. CPU utilization
6541C. Unrolled Schedule
6542D. Scheduling Overhead
6543Answer: A
6544EMBEDDED SYSTEMS
6545873. A--------is a strategy for determining when to perform certain power
6546management operations.
6547A. Predictive shutdown
6548B. Power management policy
6549C. Scheduling Policies
6550D. None of these
6551Answer: B
6552EMBEDDED SYSTEMS
6553874. In CAN terminology, a logical 1 on the bus is called--------and a
6554logical 0 is --------------
6555A. CSMA CA/CSMA CD
6556B. Stack Pointer, Frame Pointer
6557C. Recessive,Dominant
6558D. Data Frames,Control Frames
6559Answer: C
6560EMBEDDED SYSTEMS
6561875. An----------is used as the basis for the network management
6562services provided by the Simple Network Management Protocol(SNMP).
6563A. TCP
6564B. HTTP
6565C. SMTP
6566D. UDP
6567Answer: D
6568EMBEDDED SYSTEMS
6569876. In I²C, a start is signaled by leaving the -----------and sending a 1 to
65700 transition on ---------------
6571A. SCL high and SDL
6572B. SDL high and SCL
6573C. Both SDL and SCL high
6574D. Both B& C
6575Answer: A
6576EMBEDDED SYSTEMS
6577877. A-----------Port allows A/D registers to be read and written and a ---
6578------input tells when to start the next conversion.
6579A. Control, Serial
6580B. Data,Clock
6581C. Address,Counter
6582D. SFR,Timer
6583Answer: B
6584EMBEDDED SYSTEMS
6585878. The -------------bus supports CPUs, memories, and peripherals
6586integrated in a system-on-silicon.
6587A. AMBA
6588B. Peripheral
6589C. Both A & B
6590D. USB
6591Answer: A
6592EMBEDDED SYSTEMS
6593879. 8051 has-----number of register banks with----bits and ---bytes of
6594general-puropose data memory.
6595A. 36, 8, 128
6596B. 4, 8, 128
6597C. 8, 18, 80
6598D. 4, 8, 80
6599Answer: D
6600EMBEDDED SYSTEMS
6601880. Main components of an embedded system are
6602A. Hardware
6603B. Main application software
6604C. RTOS
6605D. All the Above
6606Answer: D
6607EMBEDDED SYSTEMS
6608881. Types of embedded system are
6609A. Small scale embedded systems
6610B. Medium scale embedded systems
6611C. Sophisticated embedded systems
6612D. All the Above
6613Answer: D
6614EMBEDDED SYSTEMS
6615882. DSP used in embedded systems are
6616A. TMS320Cxx
6617B. SHARC
6618C. 5600xx
6619D. All the Above
6620Answer: D
6621EMBEDDED SYSTEMS
6622883. Software’s used for the detailed designing of an embedded
6623systems are
6624A. Final machine implement able software for a product
6625B. Assembly language
6626C. High level language
6627D. All the Above
6628Answer: D
6629EMBEDDED SYSTEMS
6630884. Examples for small scale embedded systems.
6631A. Washing or cooking system
6632B. Router, a hub and a gateway
6633C. Entertainment systems
6634D. Signal tracking systems
6635Answer: A
6636EMBEDDED SYSTEMS
6637885. Examples for medium scale embedded systems
6638A. Stepper motor controllers for a robotic syste
6639B. Banking systems
6640C. Multitasking toys
6641D. ACVM
6642Answer: B
6643EMBEDDED SYSTEMS
6644886. Examples for sophisticated embedded systems
6645A. Signal tracking systems
6646B. Entertainment systems
6647C. Security products
6648D. ACVM
6649Answer: C
6650EMBEDDED SYSTEMS
6651887. HDLC stands for
6652A. Higher Data Link
6653B. Higher Data Link Control
6654C. High Data Level control
6655D. High Level Data Link Control
6656Answer: D
6657EMBEDDED SYSTEMS
6658888. CPCI stands for
6659A. Compact peripheral component Interfaces.
6660B. Central peripheral component Interfaces.
6661C. Compact peripheral central Interfaces.
6662D. Compact physical component Interfaces.
6663Answer: A
6664EMBEDDED SYSTEMS
6665889. Header files used in ‘C’ language in embedded system
6666A. stdio.h
6667B. stdlib.h
6668C. timer.h
6669D. syslib.h
6670Answer: D
6671EMBEDDED SYSTEMS
6672890. Important terms of RTOS are
6673A. Scheduler
6674B. Shared data
6675C. Reentrancy
6676D. All the Above
6677Answer: D
6678EMBEDDED SYSTEMS
6679891. Interrupt service functions supported by Vx Works
6680A. intVectGet()
6681B. intvect()
6682C. intsetvect()
6683D. interrupt()
6684Answer: A
6685EMBEDDED SYSTEMS
6686892. Task service functions supported by MUCOS
6687A. void OSEnter()
6688B. void OSIntEnter(void)
6689C. OSIntEnter(void)
6690D. void Osin(void)
6691Answer: B
6692EMBEDDED SYSTEMS
6693893. Alternative systems in RTOS for responding a hardware source call
6694A. Indirect call to ISR
6695B. Interrupt source call
6696C. Direct call to ISR by an interrupt source
6697D. No alternate call
6698Answer: C
6699EMBEDDED SYSTEMS
6700894. Two standards of USB
6701A. USB 1.1 & USB 2.0
6702B. USB 1.0 & USB 1.1
6703C. USB 2.0 & USB 2.1
6704D. USB 2.1 & USB 1.1
6705Answer: A
6706EMBEDDED SYSTEMS
6707895. A programming language is strongly typed if _____________ .
6708A. type errors are always detected
6709B. it supports coercion
6710C. it supports abstract data types
6711D. None
6712Answer: A
6713The Object Oriented Paradigm
6714896. Binding a variable to a type in C language takes place at
6715___________________ time.
6716A. language implementation
6717B. compile
6718C. load
6719D. language design
6720Answer: B
6721The Object Oriented Paradigm
6722897. Deriving two or more new classes from a single base classes is
6723____________ .
6724A. Single Inheritance
6725B. Multiple Inheritance
6726C. Hierarchical Inheritance
6727D. Multilevel Inheritance
6728Answer: C
6729The Object Oriented Paradigm
6730898. Redefining a base class function in the subclass with the same
6731signature is _________ .
6732A. inheritance
6733B. Overloading
6734C. Dynamic binding
6735D. Overriding
6736Answer: D
6737The Object Oriented Paradigm
6738899. OOP promotes a way of programming that allows programmers to
6739think in terms of _______ .
6740A. Data
6741B. Procedures
6742C. Objects
6743D. Messages
6744Answer: C
6745The Object Oriented Paradigm
6746900. Mechanism of hiding the implementation details of an object and
6747there fore hides its complexity.
6748A. Message passing
6749B. Deligation
6750C. Polymorphism
6751D. Encapsulation
6752Answer: D
6753The Object Oriented Paradigm
6754901. The lifetime of a variable is ____________________________.
6755A. the time during which it is bound to a particular memory cell
6756B. the range of statements over which it is visible
6757C. the range of statements inside the block where it is declared
6758D. None
6759Answer: A
6760The Object Oriented Paradigm
6761902. Which of the following is not a correct variable type in C++?
6762A. float
6763B. real
6764C. int
6765D. double
6766Answer: B
6767The Object Oriented Paradigm
6768903. Identify the correct statement in C++.
6769A. Programmer can use comments to include short explanations within the source code
6770itself.
6771B. All lines beginning with two slash signs are considered comments.
6772C. Comments very important effect on the behaviour of the program
6773D. All the three
6774Answer: B
6775The Object Oriented Paradigm
6776904. The directives for the preprocessors in C++ begin with
6777A. mpersand symbol (&)
6778B. Two Slashes (//)
6779C. Hash Symbol (#)
6780D. Less than symbol (<)
6781Answer: C
6782The Object Oriented Paradigm
6783905. The file iostream in C++ includes
6784A. The declarations of the basic standard input-output library.
6785B. The streams of includes and outputs of program effect.
6786C. Both of these
6787D. None of these
6788Answer: A
6789The Object Oriented Paradigm
6790906. There is a unique function in C++ program by where all C++
6791programs start their execution
6792A. Start( )
6793B. Begin( )
6794C. Main( )
6795D. Output( )
6796Answer: C
6797The Object Oriented Paradigm
6798907. Identify which of the following is false.
6799A. cout represents the standard output stream in c++.
6800B. cout is declared in the iostream standard file
6801C. cout is declared within the std namespace
6802D. None of above
6803Answer: D
6804The Object Oriented Paradigm
6805908. Which of the following can not be used as identifiers?
6806A. Letters
6807B. Underscores
6808C. Digits
6809D. Spaces
6810Answer: D
6811The Object Oriented Paradigm
6812909. How many times is a do while loop guaranteed to loop?
6813A. 0
6814B. Infinitely
6815C. 1
6816D. Variable
6817Answer: C
6818The Object Oriented Paradigm
6819910. Finite automata recognizes --------grammars
6820A. type-1
6821B. type-2
6822C. type-3
6823D. type-0
6824Answer: type-3
6825Theory of Computation
6826911. A minimum state DFA accepting the language L={w/w belongs
6827{0,1}*} number of 0s and 1s in w are divisible by 3 and 5, respectively}
6828has
6829A. 15 states
6830B. 7 states
6831C. 9 states
6832D. 8 states
6833Answer: 15 states
6834Theory of Computation
6835912. Which of the following statement is true?
6836A. NFA is more powerful than DFA
6837B. DFA is more powerful than NFA
6838C. NFA and DFA have equal power
6839D. All the are true
6840Answer: NFA and DFA have equal power
6841Theory of Computation
6842913. If M1 machine recognizing L with n states, then M2 recognizing L*
6843constructed Using Thompson construction will have ------------- states.
6844A. n
6845B. n+1
6846C. n+2
6847D. n-1
6848Answer: n+2
6849Theory of Computation
6850914. (a+b)(cd)*(a+b) denotes the following set
6851A. {a(cd)^nb|n>=1}
6852B. {a(cd)^n>=1}U{b(cd)^n|n>=1}
6853C. {a(cd)^na|n>=0}U{a(cd)^nb|n>=0}U{b(cd)^na|n>=0}U{b(cd)^nb|n>=0}
6854D. {ac^nd^nb|n>=1}
6855Answer:
6856{a(cd)^na|n>=0}U{a(cd)^nb|n>=0}U{b(cd)^na|n>=0}U{b(cd)^nb|n>=0}
6857Theory of Computation
6858915. Which one of the following regular expressions over {0,1} denotes
6859the set of all strings not containing 100 as a substring?
6860A. 0*(11*0)*
6861B. 0*1010*
6862C. 0*(10+1)*
6863D. 0*1*01
6864Answer: 0*(10+1)*
6865Theory of Computation
6866916. The concept of grammar is much used in this part of the compiler
6867A. lexical analysis
6868B. parser
6869C. code generation
6870D. code optimization
6871Answer: parser
6872Theory of Computation
6873917. consider a language L for which there exists a Turing machine T,
6874that accepts every word in L and either rejects or loops for every word
6875that is not in L. The language L is
6876A. NP hard
6877B. NP Complete
6878C. recursive
6879D. recursively enumerable
6880Answer: recursively enumerable
6881Theory of Computation
6882918. Which of the following conversion is not possible?
6883A. regular grammar to contextfree grammar
6884B. NFSA to FSA
6885C. nondeterminstic PDA to deterministic PDA
6886D. nondeterminstic TM to deterministic TM
6887Answer: nondeterminstic PDA to deterministic PDA
6888Theory of Computation
6889919. which one of the following statement is FALSE?
6890A. context-free languages are closed under union
6891B. context-free languages are closed under concatenation
6892C. context-free languages are closed under intersection
6893D. context-free languages are closed under kleene closure
6894Answer: context-free languages are closed under intersection
6895Theory of Computation
6896920. Recursively enumerable languages are not closed under
6897A. union
6898B. homomorphism
6899C. complementation
6900D. concatenation
6901Answer: complementation
6902Theory of Computation
6903921. Consider S->SS|a what is the number of different derivation trees
6904for aaaaa
6905A. 3
6906B. 5
6907C. 7
6908D. 14
6909Answer: 14
6910Theory of Computation
6911922. consider the regular language L=(111+11111)* The minimum
6912number of syayes in any DFA accepting the language is
6913A. 3
6914B. 5
6915C. 9
6916D. 8
6917Answer: 9
6918Theory of Computation
6919923. Which of the following instances of the post correspondence
6920problem has a viable sequence(a solution)?
6921A. {(b,bb),(bb,bab),(bab,abb),(abb,babb)}
6922B. {(ab,aba),(baa,aa),(aba,baa)}
6923C. {(ab,abb),(ba,aaa),(aa,a)
6924D. All the options are wrong
6925Answer: {(ab,abb),(ba,aaa),(aa,a)
6926Theory of Computation
6927924. It is undecidable, whether
6928A. an arbitary TM has 15 states
6929B. an arbitary TM halts after 10 steps
6930C. an arbitary TM ever prints a specific letter
6931D. an arbitary TM accepts a string w in 5 steps
6932Answer: an arbitary TM ever prints a specific letter
6933Theory of Computation
6934925. 1. The diameter for connectivity in completely connected network is
6935A. 1
6936B. p-1
6937C. log p
6938D.
6939Answer: A
6940Parallel Algorithms
6941926. 2. Which of the following parallelism technique need equal memory
6942cycles
6943A. Temporal
6944B. Spatial
6945C. None
6946D.
6947Answer: A
6948Parallel Algorithms
6949927. 3. X=A+B; D=X*T . Identify the type of Dependency
6950A. Reductions
6951B. Output Dependency
6952C. Anti Dependency
6953D.
6954Answer: C
6955Parallel Algorithms
6956928. 4. Calculate the cost of communication for number of processors
6957=4; parallel processing time=10 ns
6958A. 45.5
6959B. 40
6960C. 40.09
6961D.
6962Answer: B
6963Parallel Algorithms
6964929. 5. Distributed Memory Systems are
6965A. Dynamic Network
6966B. Static Network
6967C. Hypercube
6968D.
6969Answer: A
6970Parallel Algorithms
6971930. 6. ------------------------ have excellent performance scalability
6972A. Hypercube
6973B. Bus
6974C. Crossbar
6975D.
6976Answer: C
6977Parallel Algorithms
6978931. 7.In PRAM, every Processor has ------------------ time access to
6979every memory location
6980A. Ø(1)
6981B. Ø(n)
6982C. Ø(log n)
6983D.
6984Answer: A
6985Parallel Algorithms
6986932. 8.which of the following is a shared address space based. -----------
6987--------------------
6988A. UMA
6989B. NUMA
6990C. both A&B
6991D.
6992Answer: A
6993Parallel Algorithms
6994933. 9. In PRAM, Multiple processors write simultaneously to a memory
6995location using
6996A. Common CW Arbitrary CW
6997B.
6998C. Combining CW
6999D.
7000Answer: A
7001Parallel Algorithms
7002934. 10.Pointer Jumping given 10 elements determine the running time --
7003---------------------
7004A. 3
7005B. 4
7006C. 1
7007D.
7008Answer: A
7009Parallel Algorithms
7010935. 11. In Hypersort, Each processor sorts it’s N items independently
7011using
7012A. Ø(NlogN)
7013B. Ø(dN)
7014C. Ø(d(N+1))
7015D.
7016Answer: A
7017Parallel Algorithms
7018936. 12. The no of processors required in parallel matrix multiplication
7019for I x J ,J x K matrices are,
7020A. I x J
7021B. K x J
7022C. I x K
7023D.
7024Answer: C
7025Parallel Algorithms
7026937. 13 Given 25% of parallel algorithm is performed sequentially
7027calculate maximum speedup
7028A. 0.25
7029B. 4
7030C. 6
7031D.
7032Answer: B
7033Parallel Algorithms
7034938. 14 The potential problem in Divide and Conquer Algorithms is
7035A. Communication
7036B. Network Topology
7037C. Load Sharing
7038D.
7039Answer: C
7040Parallel Algorithms
7041939. 15 InOpenMP,write the construct for getting no. of processors
7042A. omp_get_num_threads()
7043B. omp_get_maxthreads()
7044C. omp_get_threadid()
7045D.
7046Answer: A
7047Parallel Algorithms
7048940. Reliability means
7049A. Ease with which software can be adapted for use in different contexts
7050B. Prevention of unauthorized access
7051C. The ability of the software to integrate with existing systems.
7052D. None of the above
7053Answer: D
7054Software Engineerring
7055941. What are all the possible risks could be occur in software
7056development.
7057A. People ,Product, Technical
7058B. Product, Process, Technical
7059C. Process, Design, Technical
7060D. None of the above
7061Answer: A
7062Software Engineerring
7063942. RUP model is explains
7064A. OOAD with UML
7065B. UML with OOAD
7066C. UML only
7067D. none of the above
7068Answer: A
7069Software Engineerring
7070943. ______________ Phase answers the question: How to meet the user
7071needs?
7072A. Design
7073B. Analysis
7074C. Coding
7075D. None of the above
7076Answer: A
7077Software Engineerring
7078944. Requirements are stable but not clear, this situation which process
7079model will be most suitable one?
7080A. Water Fall Model
7081B. Prototype Model
7082C. Spiral Model
7083D. None of the above
7084Answer: D
7085Software Engineerring
7086945. __________ means to check if the task has been executed correctly.
7087A. Testing
7088B. Verification
7089C. Unit Testing
7090D. Validation
7091Answer: B
7092Software Engineerring
7093946. Quality is defined
7094A. Fitness for purpose
7095B. Zero defects
7096C. Customer Satisfaction
7097D. All the above
7098Answer: D
7099Software Engineerring
7100947. ____________ associated with every instance of the first entity there
7101will be at least one instance of the second entity
7102A. cardinality
7103B. attribute
7104C. mandatory
7105D. optionally
7106Answer: C
7107Software Engineerring
7108948. Identify the relationship for the given statement ,Teacher can guide
7109any number of students but at least she /he should guide one student.
7110A. many to many ,optionally
7111B. one to many , mandatory
7112C. one to one ,mandatory
7113D. many to one ,optionally
7114Answer: B
7115Software Engineerring
7116949. The output of the requirements engineering phase is
7117______________
7118A. Software Requirement Specification
7119B. Software Design Specification
7120C. Detailed Design Specification
7121D. None of the above.
7122Answer: A
7123Software Engineerring
7124950. _____________ is composed of data structures and /or data
7125elements.
7126A. Data flow
7127B. Data element
7128C. Data structure
7129D. Data Dictionary
7130Answer: A
7131Software Engineerring
7132951. _____________ is composed of data elements or other data
7133structures.
7134A. Data flow
7135B. Data element
7136C. Data structure
7137D. Data Dictionary
7138Answer: C
7139Software Engineerring
7140952. Match the following DFD - a)To model state changes of the system ,
7141ERD - b) Process and their interaction ,STD – c) To model complex
7142decision ,DT&DT – d) data and their relationship
7143A. a ,d,b,c
7144B. d,b,a,c
7145C. b,d,a,c
7146D. b,d,c,a
7147Answer: C
7148Software Engineerring
7149953. _____________ helps to ensure completeness of the design
7150A. DFD
7151B. ERD
7152C. Data Dictionary
7153D. All of the above.
7154Answer: B
7155Software Engineerring
7156954. Who is not a stake holder of ATM Banking System.
7157A. Administrator
7158B. customer
7159C. Bank Client
7160D. developer
7161Answer: D
7162Software Engineerring
7163955. Virtual memory is
7164A. a portion of RAM
7165B. a portion of HDD used as RAM
7166C. non existing memory
7167D. Volatile memory
7168Answer: b
7169Operating Systems
7170956. The initial program that runs on a system is
7171A. loader program
7172B. bootstrap program
7173C. system program
7174D. none of these
7175Answer: b
7176Operating Systems
7177957. Monitor call will be initiated by
7178A. software
7179B. hardware
7180C. frimware
7181D. cpu
7182Answer: a
7183Operating Systems
7184958. SCSI is a standard for
7185A. communication
7186B. data transfer
7187C. storage
7188D. execution
7189Answer: b
7190Operating Systems
7191959. Direct Memory Access is a way of
7192A. bypassing storage
7193B. using RAM
7194C. bypassing CPU
7195D. using high speed bus
7196Answer: c
7197Operating Systems
7198960. Before the jobs are brought to the RAM, they are stored in
7199A. cache
7200B. RAM pool
7201C. secondary disk
7202D. job pool in disk
7203Answer: d
7204Operating Systems
7205961. A software generated interrupt caused by error is called
7206A. interrupt error
7207B. processing error
7208C. trap
7209D. OS error
7210Answer: c
7211Operating Systems
7212962. The lowest level of abstraction of hardware to be controlled by
7213applications is provided by
7214A. system calls
7215B. kernal
7216C. API
7217D. none of these
7218Answer: b
7219Operating Systems
7220963. Memory mapped file is a method of
7221A. file management
7222B. memory management
7223C. IPC
7224D. API
7225Answer: c
7226Operating Systems
7227964. the OS that runs on processor with rigid time requirements is
7228A. open source
7229B. realtime
7230C. online
7231D. client/server
7232Answer: b
7233Operating Systems
7234965. An user interface where the input given as commands
7235A. CLI
7236B. GUI
7237C. UI
7238D. batch interface
7239Answer: a
7240Operating Systems
7241966. The topmost layer of a layered OS is
7242A. UI
7243B. hardware
7244C. software
7245D. kernel
7246Answer: a
7247Operating Systems
7248967. A memory that is dynamically assigned for the process is called
7249A. Stack
7250B. static
7251C. heap
7252D. dynamic
7253Answer: c
7254Operating Systems
7255968. The information associated with the process is contained in
7256A. task control bloack
7257B. process block
7258C. data block
7259D. program counter
7260Answer: a
7261Operating Systems
7262969. Which scheduler is called a long term scheduler
7263A. cpu
7264B. memory
7265C. I/O
7266D. Job
7267Answer: d
7268Operating Systems
7269970. Context switching is done by
7270A. memory
7271B. I/O
7272C. CPU
7273D. data
7274Answer: c
7275Operating Systems
7276971. Which of the following statement is true regarding equivalent
7277grammars?
7278A. both of them must have same production rules and same alphabet (terminal symbols
7279B. they may have different set of production rules but same alphabet (terminal symbols)
7280C. both of them must have same production rules but different alphabet
7281D. they may have different set of production rules and different alphabet
7282Answer: B
7283Algorithm Design and Analysis
7284972. Which one falls under a Primitive Regular Expression ?
7285A. +
7286B. union
7287C. bracket
7288D. a terminal
7289Answer: D
7290Algorithm Design and Analysis
7291973. In a partial derivation tree, every leaf has a label from
7292A. the set of terminals and lambda
7293B. the set of nonterminals, terminals and lambda
7294C. the set of nonterminals and lambda
7295D. none of the above
7296Answer: B
7297Algorithm Design and Analysis
7298974. Let Σ = {a, b, c, d, e}. The number of strings in Σ* of length 4 such
7299that no symbol is used more than once in a string is
7300A. 360
7301B. 120
7302C. 35
7303D. 36
7304Answer: B
7305Algorithm Design and Analysis
7306975. Which of these is a true statement?
7307A. Dynamic programming approach can be applied to any problem
7308B. Optimal solutions provided by backtracking and dynamic progr. can be different
7309C. All sub problems in a dynamic programming approach will be used more than once
7310D. Dynamic programming does more computations than divide and conquer
7311Answer: B
7312Algorithm Design and Analysis
7313976. In matrix chain problem by dynamic programming approach, the
7314value of k, which signifies the order of the parentheses,
7315A. has the range from 1 to n-1
7316B. has the range from 2 to n
7317C. hss the range from 1 to n
7318D. has the range from 1 to n/2
7319Answer: A
7320Algorithm Design and Analysis
7321977. While generating the sequence for a binary counter of length k bits,
7322the maximum actual cost possible (including reset and set) after a single
7323call to increment function, is
7324A. k-2
7325B. k-1
7326C. k
7327D. k+1
7328Answer: C
7329Algorithm Design and Analysis
7330978. Which of these algorithms is poly time?
7331A. Reducibility Function / Algorithm used in NPC
7332B. General Longest Common Subsequence problem
7333C. 3-CNF Problem
7334D. none of the above
7335Answer: A
7336Algorithm Design and Analysis
7337979. A malicious person has intercepted a cipher in the network and
7338wants to crack it thinking that it was encrypted by mono alphabetic
7339cipher. How many combinations he/she must use?
7340A. 26!
7341B. 26
7342C. 48 bit key
7343D. k mod 26
7344Answer: A
7345Algorithm Design and Analysis
7346980. If a problem can be solved by both dynamic programming and
7347backtracking, which of these statements is true?
7348A. backtracking method always finishes equal or later than dynamic programming
7349B. backtracking method always finishes equal or faster than dynamic programming
7350C. backtracking method and dynamic programming always takes equal time
7351D. can’t say
7352Answer: A
7353Algorithm Design and Analysis
7354981. If we put the amortized cost of set to be 0 and reset to be 2, how
7355many times do we violate the positive credit rule of accounting method
7356for the binary counter of 3 bits?
7357A. 0
7358B. 1
7359C. 6
7360D. 7
7361Answer: D
7362Algorithm Design and Analysis
7363982. In matrix chain problem by dynamic programming approach, in
7364order to fill up the entry in the (i,j) location of the cost matrix, the number
7365of possible k values to be considered are ,
7366A. j
7367B. j-i+2
7368C. j-i+1
7369D. j-i
7370Answer: D
7371Algorithm Design and Analysis
7372983. Let us say that for a given problem all four types of randomized
7373algorithm can be applied. Which one is the most reliable?
7374A. Numerical algorithm
7375B. Monte-Carlo algorithm
7376C. Las Vegas algorithm
7377D. Sherwood algorithm
7378Answer: D
7379Algorithm Design and Analysis
7380984. If two line segments, P1P2, P3P4 are there, and only endpoint P3 is
7381on the line segment P1P2, then which is true ?
7382A. cross product of P1P3 and P1P4 will give opposite signs
7383B. cross product of P1P3 and P1P4 will give different signs
7384C. the boundary box for each line segment may not overlap
7385D. none of the above
7386Answer: B
7387Algorithm Design and Analysis
7388985. In order to generate p processors, from the first active processor, in
7389PRAM model, the number of activation steps required are
7390A. p-1
7391B. floor(log p)
7392C. ceiling (log p)
7393D. p/2
7394Answer: C
7395Algorithm Design and Analysis
7396986. <script type="text/javascript" language="javascript"> var qpt =
7397"Qualiyt Point Technologies"; var result = qpt.split(" ");
7398document.write(result); </script>
7399A. Quality
7400B. Q,u,a,l,i,t,y,P,o,i,n,t,T,e,c,h,n,o,l,o,g,i,e,s
7401C. Qualiyt,Point,Technologies
7402D. QualityPointTechnologies
7403Answer: c
7404Scripting Languages
7405987. <script type="text/javascript"> x=4+"4"; document.write(x);
7406</script>
7407A. 44
7408B. 8
7409C. 4
7410D. Error Output
7411Answer: a
7412Scripting Languages
7413988. Which of the following is true?
7414A. If onKeyDown returns false, the key-press event is cancelled.
7415B. If onKeyPress returns false, the key-down event is cancelled.
7416C. If onKeyDown returns false, the key-up event is cancelled.
7417D. If onKeyPress returns false, the key-up event is canceled.
7418Answer: a
7419Scripting Languages
7420989. Which best explains getSelection()?
7421A. Returns the VALUE of a selected OPTION
7422B. Returns document.URL of the window in focus.
7423C. Returns the value of cursor-selected text
7424D. Returns the VALUE of a checked radio input.
7425Answer: c
7426Scripting Languages
7427990. <script language="javascript"> function x() { var s= "Good 100%";
7428var pattern = /\D/g; var output= s.match(pattern);
7429document.write(output); } </script>
7430A. Good %
7431B. 1,0,0
7432C. G,o,o,d,%
7433D. Error
7434Answer: c
7435Scripting Languages
7436991. Scripting language are
7437A. High Level Programming language
7438B. Assembly Level programming language
7439C. Machine level programming language
7440D. None of the above
7441Answer: a
7442Scripting Languages
7443992. <script language="javascript"> var qpt="QUALITY POINT
7444TECHNOLOGIES"; alert(qpt.charAt(qpt.length-1)); </script>
7445A. P
7446B. E
7447C. S
7448D. Error
7449Answer: c
7450Scripting Languages
7451993. Choose the client-side JavaScript object:
7452A. Database
7453B. Cursor
7454C. Client
7455D. FileUpLoad
7456Answer: d
7457Scripting Languages
7458994. <script language="javascript"> function x(z,t) { alert(x.length); }
7459</script> output: ?
7460A. Error
7461B. 2
7462C. 1
7463D. 3
7464Answer: b
7465Scripting Languages
7466995. What is mean by "this" keyword in javascript?
7467A. It refers current object
7468B. It referes previous object
7469C. It is variable which contains value
7470D. None of the above
7471Answer: a
7472Scripting Languages
7473996. Math. round(-20.51)=?
7474A. 20
7475B. -21
7476C. 19
7477D. None
7478Answer: b
7479Scripting Languages
7480997. <script language="javascript"> function x() { var s = "Quality 100%!
7481{[!!"; var pattern = /\w/g; var output = s.match(pattern);
7482document.write(output); } </script>
7483A. %,!,{,[,!,!
7484B. Q,u,a,l,i,t,y,1,0,0
7485C. Quality 100
7486D. Error
7487Answer: b
7488Scripting Languages
7489998. <script language="javascript"> function x() {
7490document.write(2+5+"8"); } </script>
7491A. 258
7492B. Error
7493C. 7
7494D. 78
7495Answer: d
7496Scripting Languages
7497999. In Javascript, Which of the following method is used to evaluate the
7498regular expression?
7499A. eval(2*(3+5))
7500B. evaluate(2*(3+5))
7501C. evalu(2*(3+5))
7502D. None of the above
7503Answer: a
7504Scripting Languages
75051000. <script type="text/javascript" language="javascript"> qpt=
7506((45%2)==0)? "hello" : "bye"; document.write(qpt); </script>
7507A. hello
7508B. bye
7509C. Error in string handling
7510D. None of the above
7511Answer: b
7512Scripting Languages
75131001. How does soft computing differ from Hard Computing
7514A. imprecision
7515B. uncertanity
7516C. crisp
7517D. Partial truth
7518Answer: A,B,D
7519Soft Computing
75201002. which of the ANN architecture achievies stability and plasticity
7521A. Perceptron
7522B. ART
7523C. reccurent
7524D. maxican Hat
7525Answer: ART
7526Soft Computing
75271003. which of the following learning rule comes under Supervised
7528learning
7529A. Hebb
7530B. Competative net
7531C. Perceptron
7532D. all the above
7533Answer: Perceptron
7534Soft Computing
75351004. what is threshold value
7536A. it amplifies the signal
7537B. weight adjustment
7538C. inhibit/excibit
7539D. fire or not fire
7540Answer: fire/not fire
7541Soft Computing
75421005. which of the following problem are linear seperable
7543A. AND
7544B. OR
7545C. ANDNOT
7546D. XOR
7547Answer: A,B,C
7548Soft Computing
75491006. Associative memory
7550A. Content addressable
7551B. address addressable
7552C. pattern addressable
7553D. all the above
7554Answer: A
7555Soft Computing
75561007. hamming distance
7557A. distance between two neuron
7558B. difference between the two input
7559C. number of mismatch components
7560D. measure to analysis thestability
7561Answer: C
7562Soft Computing
75631008. which of the following are Unsupervised learning network
7564A. ART
7565B. LVQ
7566C. SOM
7567D. none of these
7568Answer: all the above (choice E)
7569Soft Computing
75701009. Union between two Fuzzy set can be found by
7571A. min
7572B. max
7573C. min-max
7574D. max-min
7575Answer: B
7576Soft Computing
75771010. Fuzzy Relation can be obtained by
7578A. min
7579B. max
7580C. min-max
7581D. max-min
7582Answer: D
7583Soft Computing
75841011. which of the following relation satisfies tolerance
7585A. ponints on a map is connected by a road to
7586B. people is brother of
7587C. positive integer, for some k equals to 10k times
7588D. people has same parents
7589Answer: A
7590Soft Computing
75911012. Can a tolerance relation be converted to equivalance relation
7592A. No
7593B. Yes
7594C.
7595D.
7596Answer: B
7597Soft Computing
75981013. What is sub normal Fuzzy Set? Fuzzy set having membership
7599value between-------------------
7600A. >=0 and <= 1
7601B. >0 and <= 1
7602C. >0 and <1
7603D. >=0 and <1
7604Answer: D
7605Soft Computing
76061014. which one of the following is fuzzification method
7607A. intution
7608B. Genetic Algorithm
7609C. inductive reasoning
7610D. none of these
7611Answer: all the above (choice E)
7612Soft Computing
76131015. In a lamda-cuts of Fuzzy sets if the lamda value is reduced, the
7614number of elements in the fuzzy set
7615A. decreases
7616B. cannot predicit
7617C. increases
7618D. varies according to suituation
7619Answer: C
7620Soft Computing
76211016. the primary work of Fuzzy Inference System is
7622A. optimization
7623B. parallel processing
7624C. decision making
7625D. pattern matching
7626Answer: C
7627Soft Computing
76281017. Software configuration management involves identifying the
7629configuration of the software:
7630A. prior to the beginning of the lifecycle.
7631B. at the beginning of the lifecycle only.
7632C. at predefined points of time during the lifecycle.
7633D. at the end of the lifecycle only.
7634Answer: c
7635Software Engineering
76361018. An engineer is developing a web presentation layer for a mission
7637critical project. The technology chosen for the presentation layer is
7638making it difficult to implement the user interface design. The engineer
7639reads about a new technology for creating the type of web interface the
7640project needs. It is decided that a rapid prototype will be created to
7641perform an initial evaluation of the new technology. Which of the
7642following criteria is the LEAST important when doing the prototype?
7643A. Exercising the entire breadth of functionality
7644B. Simulating the operational environment
7645C. Exercising critical functionality
7646D. Stepping through source with a debugger
7647Answer: d
7648Software Engineering
76491019. A technical lead is working on an iterative lifecycle project that is
7650creating a well understood application using a technology the team has
7651experience with. The project has 10 major use cases to implement; two
7652have just been delivered on schedule in the first iteration. At the request
7653of the project manager, who is concerned about the amount of effort
7654being spent fixing defects, the lead has collected some data on quality
7655performance during the first iteration. The data shows that planned
7656reviews of requirements and design are not occurring. It shows that 22
7657defects are being detected during unit and system testing per 100
7658SLOC. The lead is asked to predict the defect trend for the project going
7659forward. They calculate that with no changes in process the defect rate:
7660A. will likely drop later in the project as kinks are worked out.
7661B. will remain the same.
7662C. will likely increase as the project progresses .
7663D. cannot be predicted at this point.
7664Answer: c
7665Software Engineering
76661020. During a software development project two similar requirements
7667defects were detected. One was detected in the requirements phase,
7668and the other during the implementation phase. Which of the following
7669statements is mostly likely to be true?
7670A. The most expensive defect to correct is the one detected during the requirements phase.
7671B. The most expensive defect to correct is the one detected during the implementation
7672phase.
7673C. The cost of fixing either defect will usually be similar.
7674D. There is no relationship between the phase in which a defect is discovered and its repair
7675cost. .
7676Answer: b
7677Software Engineering
76781021. An engineer is tasked to verify a software release for a mission
7679critical system. The plan is for the release of software for verification to
7680occur on a Monday, with verification complete the following Friday. The
7681release turns out not to be available until Thursday. The best route for
7682the engineer is to:
7683A. verify release criteria regardless of time line.
7684B. do whatever testing they can by Friday.
7685C. volunteer to work the weekend.
7686D. relax release criteria .
7687Answer: a
7688Software Engineering
76891022. Which of the following do NOT affect the accuracy of the reliability
7690estimate during statistical testing? I. The validity of the usage profile. II.
7691The number of test cases executed. III. The programming language used
7692to implement the code. IV. The cyclomatic complexity of the code.
7693A. I and II only.
7694B. II and III only.
7695C. III and IV only.
7696D. I and III only.
7697Answer: c
7698Software Engineering
76991023. A new engineer has been assigned to a project team. The current
7700project is 1 month into construction, and another 6 months of
7701construction are expected. The engineer discovers that the only design
7702document is an overview of the logical architecture. There are over 70
7703source code files, most over 600 lines long, residing in a single folder. It
7704is very difficult to follow the module design of the system, but there
7705appears to be functionality redundantly coded among the files shared
7706between files. The best steps for improvement would be to: I. Combine
7707files together to reduce the number of files II. Rework files to group
7708functionality together III. Use folders to group related files together IV.
7709Change programming languages
7710A. I and II
7711B. I and III
7712C. II and III
7713D. II and IV
7714Answer: c
7715Software Engineering
77161024. In Structured Design, why are afferent and efferent flows identified
7717when performing Transform Analysis?
7718A. The flows represent data internal to the system.
7719B. The flows are limited by the physical constraints of the devices.
7720C. The system design should be independent of the format of the data.
7721D. The system performance depends mainly on the time of the flows.
7722Answer: c
7723Software Engineering
77241025. Paul has drafted a software project management plan. Which of
7725the following items should be discussed in this plan? I. Schedule II.
7726Budget III. Requirements IV. Staffing
7727A. I, III, IV only
7728B. I, II, III only
7729C. I, II, IV only
7730D. I, II, III, IV
7731Answer: c
7732Software Engineering
77331026. Quality assurance may be applied to: I. Requirements II. Design III.
7734Code IV. Testing
7735A. I and II only
7736B. I, II, and III only
7737C. I, II, III, and IV
7738D. IV only
7739Answer: c
7740Software Engineering
77411027. Equivalence partitioning is:
7742A. a modular programming technique where the application domain is sub-divided into
7743similarly sized functional areas
7744B. a black box testing technique that divides the input domain of a program into classes of
7745data from which test cases can be derived
7746C. an object oriented design technique for improving program structure by replacing
7747inheritance with delegation
7748D. a software project management technique for distributing test responsibility within a
7749project
7750Answer: b
7751Software Engineering
77521028. You are a requirements engineer working on a project to develop a
7753new racing game. Your organization has experience in developing
7754educational games, but this genre is new. In order to gain market share
7755in the gaming market your organization needs to deliver a next
7756generation product. Several features are planned, which require
7757hardware that is itself under development. You have access to the
7758hardware, which introduces some risk. Thankfully, the development
7759schedule is much longer than that of typical game development
7760projects. In order to maximize user satisfaction, your organization can
7761pay local high school students to play the game while it is in
7762development. The company is re-examining the lifecycle development
7763model to be used for this product. Which of the following life cycle
7764models will enable you to leverage user feedback during the
7765development of the game I. Waterfall II. Spiral III. Evolutionary IV. Codeand-
7766Fix
7767A. III and IV
7768B. II and III
7769C. I and IV
7770D. II and IV
7771Answer: b
7772Software Engineering
77731029. UML notations that can be used to model the hardware and
7774software elements of a system are
7775A. Activity diagrams, class diagrams and Deployment diagrams
7776B. Activity diagrams, class diagrams and Use-Case diagrams
7777C. Sequence diagrams, class diagrams and Deployment diagrams
7778D. Colloboration diagrams, class diagrams and Deployment diagrams
7779Answer: a
7780Software Engineering
77811030. The state diagram
7782A. depicts relationships between data objects
7783B. depicts functions that transform the data flow
7784C. indicates how data are transformed by the system
7785D. indicates system reactions to external events
7786Answer: d
7787Software Engineering
77881031. The testing technique that requires devising test cases to exercise
7789the internal logic of a software module is called
7790A. behavioral testing
7791B. black-box testing
7792C. grey-box testing
7793D. white-box testing
7794Answer: d
7795Software Engineering
77961032. The entity integrity rule states that
7797A. no primary key attribute may be null
7798B. no primary key can be composite
7799C. no primary key may be unique
7800D. no primary key may be equal to a value in a foreign key
7801Answer: A
7802Database Design
78031033. When mapping a many-to-many unary relationship into a relation
7804which of the following is true
7805A. One relation is created
7806B. Two relations are created.
7807C. Three relations are created.
7808D. Four relations are created.
7809Answer: B
7810Database Design
78111034. If no multivalued attributes exist and no partial dependencies exist
7812in a relation, then the relation is in what normal form?
7813A. First normal form
7814B. Second normal form
7815C. Third normal form
7816D. Fourth normal form
7817Answer: B
7818Database Design
78191035. A foreign key is which of the following?
7820A. Any attribute
7821B. The same thing as a primary key
7822C. An attribute that serves as the primary key of another relation
7823D. An attribute that serves no purpose
7824Answer: C
7825Database Design
78261036. A transitive dependency is which of the following?
7827A. A functional dependency between two or more key attributes.
7828B. A functional dependency between two or more nonkey attributes.
7829C. A relation that is in first normal form.
7830D. A relation that is in second normal form.
7831Answer: B
7832Database Design
78331037. When mapping a multivalued attribute into a relation which of the
7834following is true?
7835A. One relation is created.
7836B. Two relation is created.
7837C. three relation is created.
7838D. Four relation is created.
7839Answer: B
7840Database Design
78411038. If no multivalued attributes exist in a relation, then the relation is in
7842what normal form?
7843A. First normal form
7844B. Second normal form
7845C. Third normal form
7846D. Fourth normal form
7847Answer: A
7848Database Design
78491039. A primary key is which of the following?
7850A. Any attribute
7851B. An attribute that uniquely identifies each row
7852C. An attribute that uniquely identifies each column
7853D. A derived attribute
7854Answer: B
7855Database Design
78561040. The relational model consists of:
7857A. data in the form of tables.
7858B. data redundancy.
7859C. operations using non-SQL languages.
7860D. unorganized data.
7861Answer: A
7862Database Design
78631041. When mapping a binary many-to-many relationship into a relation
7864which of the following is true?
7865A. One relation is created.
7866B. Two relation is created.
7867C. Three relation is created.
7868D. Four relation is created.
7869Answer: C
7870Database Design
78711042. A relation has which of the following properties?
7872A. Each row is not unique.
7873B. Attributes can have the same name within a given table.
7874C. Each relation has a unique name.
7875D. The order of the columns is significant.
7876Answer: C
7877Database Design
78781043. When mapping a ternary relationship with an associative entity
7879into a relation which of the following is true?
7880A. One relation is created.
7881B. Two relation is created.
7882C. Three relation is created.
7883D. Four relation is created.
7884Answer: D
7885Database Design
78861044. When mapping a regular entity into a relation which of the
7887following is true?
7888A. One relation is created.
7889B. Two relation is created.
7890C. Three relation is created.
7891D. Four relation is created.
7892Answer: A
7893Database Design
78941045. When mapping a supertype/subtype relationship which of the
7895following is true?
7896A. The supertype primary key is assigned to each subtype.
7897B. The subtype primary key is assigned to each supertype.
7898C. There is no link between the supertype/subtype entities.
7899D. There is no primary key/foreign key relationship between a supertype/subtype.
7900Answer: A
7901Database Design
79021046. Relations are
7903A. two-dimensional tables.
7904B. three-dimensional tables.
7905C. four-dimensional tables.
7906D. five-dimensional tables.
7907Answer: A
7908Database Design
79091047. In homogeneous distributed database
7910A. Difference in software is a major problem for transaction processing
7911B. Difference in schema is a major problem for query processing
7912C. Sites may not be aware of each other and may provide only limited facilities for
7913cooperation in transaction processing
7914D. All sites have identical software
7915Answer: D
7916DataBase Design
79171048. If you use a user-defined routine as part of the fragmentation
7918expression, that information is recorded in
7919A. sysfragexprudrdep.
7920B. sysprocauth
7921C. sysprocbody
7922D. sysprocedures
7923Answer: A
7924DataBase Design
79251049. Specify which of the following is not a Predefined constraints
7926A. Unique Key
7927B. Null Attribute
7928C. Foreign key
7929D. Functional dependency
7930Answer: B
7931DataBase Design
79321050. The following is not an objective of distributed query processing
7933A. translate a high-level language query on a single logically distributed database (as seen by
7934the users) into low-level language queries on physically distributed local databases.
7935B. reduce the response time of a distributed query
7936C. select an efficient execution strategy for the execution of a distributed query that
7937minimizes the consumption of computing resources.
7938D. Maximize the total cost of time required to execute a query.
7939Answer: D
7940DataBase Design
79411051. In the above table ‘Book’,Write the relational operation to Select
7942from the relation “Book” all the books whose year of publication is 1992.
7943A. σ Yr-pub=1992(Book)
7944B. σ Yr-pub=Book(1992)
7945C. Π Yr-pub, 1992(Book)
7946D. Π Yr-pub, Book(1992)
7947Answer: A
7948DataBase Design
79491052. R-S represents
7950A. R-S=S-R
7951B. Set of elements in S but not in R
7952C. Set of elements in R but not in S
7953D. R=S
7954Answer: C
7955DataBase Design
79561053. Out of the 2 queries X and Y,which query follows SQL optimization
7957technique X. SELECT name FROM employee WHERE (salary, age ) =
7958(SELECT MAX (salary), MAX (age) FROM employee_details) AND dept =
7959'Electronics'; Y. SELECT name FROM employee WHERE salary =
7960(SELECT MAX(salary) FROM employee_details) AND age = (SELECT
7961MAX(age) FROM employee_details) AND emp_dept = 'Electronics';
7962A. X
7963B. Y
7964C. X and Y
7965D. None
7966Answer: A
7967DataBase Design
79681054. Which of the following is the condition for Direct join ordering of
7969two relation/fragments located at different sites
7970A. Move the smaller relation to the other site
7971B. We have to estimate the size of R and S
7972C. Direct join ordering of queries involving more than two relations is substantially more
7973Complex
7974D. all the above
7975Answer: D
7976DataBase Design
79771055. Which of the following are query optimization algorithms
7978A. INGRES
7979B. System R
7980C. Hill Climbing
7981D. All the above
7982Answer: D
7983DataBase Design
79841056. When a transaction sequence is initiated it must continue through
7985all succeeding SQL statements until:
7986A. The Program is Abnormally Terminated (Rollback)
7987B. A Rollback Statement is not Reached
7988C. The End of the Program is not Reached (Commit)
7989D. END Statement is reached
7990Answer: A
7991DataBase Design
79921057. Transaction log
7993A. Keeps track of all transactions that update the database
7994B. Does not keep track of Names of objects/tables affected by the transaction
7995C. Not Used for recovery in case of a Rollback
7996D. all the above
7997Answer: A
7998DataBase Design
79991058. Serial Execution of transaction means that
8000A. There is Concurrency Control Problems
8001B. the transactions are performed one after another.
8002C. Serial Execution will leave the database in an inconsistent state
8003D. There is interaction between transactions
8004Answer: B
8005DataBase Design
80061059. Site(System) Failures in distributed DBMS
8007A. Partial Failure indicates the failure of all sites.
8008B. Incorrect input data
8009C. Always assumed to result in the loss of main memory contents.
8010D. Refers to the failures of the secondary storage devices that store the database.
8011Answer: C
8012DataBase Design
80131060. Place Update Recovery Information is
8014A. Necessary to store info about database state changes, inorder to recover back.
8015B. Every time an update is made, the old stable storage page, called shadow page is left
8016intact and a new page with the updated data item values is written into the stable
8017database.
8018C. Makes sense to permit the operation of the partition that contains the primary site, since it
8019manages the lock.
8020D. In case of non replicated databases, this involves the integration of the voting principle
8021with commit protocols.
8022Answer: A
8023DataBase Design
80241061. Path partitioning means
8025A. Can be represented as a hierarchy of nodes forming a structural index.
8026B. Index does not contains the references to all the component objects of a composite
8027object
8028C. to improve the performance of user queries and applications by reducing the irrelevant
8029data access.
8030D. the object to which it is applied, and the arguments are all co-located.
8031Answer: A
8032DataBase Design
80331062. Removal of left recursion is necessary because
8034A. it cacuses recursive decent parser to loop forever
8035B. it generates an ambiguous grammar
8036C. both a &b
8037D. none of these
8038Answer: a
8039Programming Language Translators
80401063. A parse tree showing attribute value at each node is called
8041A. concrete tree
8042B. syntex tree
8043C. Annotated parse tree
8044D. both a&b
8045Answer: c
8046Programming Language Translators
80471064. the role of predictive parsing is
8048A. to construct a top-down parser never backtracks
8049B. to construct a top-down parser backtracks
8050C. to construct a bottom up parser that never backtracks
8051D. none of these
8052Answer: a
8053Programming Language Translators
80541065. if we construct parsing table for above grammar,the parsing table
8055entry[S',e]
8056A. S'→ε
8057B. S'→eS
8058C. S'→ε S'→eS
8059D. none of these
8060Answer: c
8061Programming Language Translators
80621066. parsing table entry [S',$] will contain,
8063A. S'→eS
8064B. S→iEtss
8065C. S'→a
8066D. S'→ε
8067Answer: d
8068Programming Language Translators
80691067. which of the following is true regarding LL(1) grammar?
8070A. no ambiguous or left rcursive grammar can be LL(1)
8071B. no ambiguous but left recursive grammar can be LL(1)
8072C. no left recursive but ambiguous grammar can be LL(1)
8073D. both ambiguous and left recursive grammar can be LL(1)
8074Answer: a
8075Programming Language Translators
80761068. Whish of the following checks are include with in static checking?
8077A. type checks
8078B. flow checks
8079C. uniqueness checks
8080D. all of these
8081Answer: d
8082Programming Language Translators
80831069. if an array variable and a function variable are added
8084together,which type of static will be generated?
8085A. name related checks
8086B. uniqueness checks
8087C. type checks
8088D. none of these
8089Answer: c
8090Programming Language Translators
80911070. if an error is detected within a ststement,the type assigned to the
8092statement is,
8093A. type constructor
8094B. type expression
8095C. error type
8096D. type error
8097Answer: d
8098Programming Language Translators
80991071. if conversion from one type to another type is done automatically
8100by the compiler then,it is called
8101A. implicit conversion
8102B. coercions
8103C. both a &b
8104D. none of these
8105Answer: c
8106Programming Language Translators
81071072. system programs such as compilers are designed so that they are
8108A. recursive
8109B. serially usable
8110C. non-reusable
8111D. re-enterable
8112Answer: d
8113Programming Language Translators
81141073. All data objects in FORTRAN language cant be allocated
8115A. dynamically
8116B. statically
8117C. globally
8118D. both a and b
8119Answer: b
8120Programming Language Translators
81211074. the output of the code generator is target program that includes
8122A. absolute machine language
8123B. relocatable machine language
8124C. assembly language
8125D. all of these
8126Answer: d
8127Programming Language Translators
81281075. replacement of an expensive operation by a cheaper one is
8129termed as
8130A. reduction in strength
8131B. code motion
8132C. loop in variant computation
8133D. none of these
8134Answer: c
8135Programming Language Translators
81361076. a basic block can be analyzed by
8137A. flow graph
8138B. a graph with cycles
8139C. a DAG
8140D. none of these
8141Answer: c
8142Programming Language Translators
81431077. What is the output of the following program?
8144A. 14,24
8145B. 11,21
8146C. 10,20
8147D. Error
8148Answer: C
8149Coputer programming and problem solving
81501078. #include<stdio.h>
8151A.
8152B.
8153C.
8154D.
8155Answer:
8156Coputer programming and problem solving
81571079. void swap(int&, int&);
8158A.
8159B.
8160C.
8161D.
8162Answer:
8163Coputer programming and problem solving
81641080. int main(){
8165A.
8166B.
8167C.
8168D.
8169Answer:
8170Coputer programming and problem solving
81711081. int a = 10,b=20;
8172A.
8173B.
8174C.
8175D.
8176Answer:
8177Coputer programming and problem solving
81781082. swap (a++,b++);
8179A.
8180B.
8181C.
8182D.
8183Answer:
8184Coputer programming and problem solving
81851083. printf("\n%d,%d\t",a, b);}
8186A.
8187B.
8188C.
8189D.
8190Answer:
8191Coputer programming and problem solving
81921084.
8193A.
8194B.
8195C.
8196D.
8197Answer:
8198Coputer programming and problem solving
81991085. void swap(int& x, int& y){
8200A.
8201B.
8202C.
8203D.
8204Answer:
8205Coputer programming and problem solving
82061086. x+=2;
8207A.
8208B.
8209C.
8210D.
8211Answer:
8212Coputer programming and problem solving
82131087. y+=3;}
8214A.
8215B.
8216C.
8217D.
8218Answer:
8219Coputer programming and problem solving
82201088.
8221A.
8222B.
8223C.
8224D.
8225Answer:
8226Coputer programming and problem solving
82271089. What is the output of the following program segment?
8228A. 123000
8229B. 123456
8230C. junk data display
8231D. Error
8232Answer: A
8233Coputer programming and problem solving
82341090. int a[6]={1,2,3};
8235A.
8236B.
8237C.
8238D.
8239Answer:
8240Coputer programming and problem solving
82411091. int j;
8242A.
8243B.
8244C.
8245D.
8246Answer:
8247Coputer programming and problem solving
82481092. for(j=0;j<6;j++)
8249A.
8250B.
8251C.
8252D.
8253Answer:
8254Coputer programming and problem solving
82551093. cout<<a[j];
8256A.
8257B.
8258C.
8259D.
8260Answer:
8261Coputer programming and problem solving
82621094.
8263A.
8264B.
8265C.
8266D.
8267Answer:
8268Coputer programming and problem solving
82691095. What is the output of the following program segment?
8270A. Error
8271B. 0
8272C. 4
8273D. 5
8274Answer: C
8275Coputer programming and problem solving
82761096. char* ch="\0123\0";
8277A.
8278B.
8279C.
8280D.
8281Answer:
8282Coputer programming and problem solving
82831097. cout<<sizeof(ch)<<endl;
8284A.
8285B.
8286C.
8287D.
8288Answer:
8289Coputer programming and problem solving
82901098.
8291A.
8292B.
8293C.
8294D.
8295Answer:
8296Coputer programming and problem solving
82971099. Binary Search algorithm cannot be applied to
8298A. Sorted linked list
8299B. Sorted binary trees
8300C. Sorted linear array
8301D. Pointer array
8302Answer: A
8303Coputer programming and problem solving
83041100.
8305A.
8306B.
8307C.
8308D.
8309Answer:
8310Coputer programming and problem solving
83111101. A variable P is called pointer if
8312A. P contains address of an element in Data
8313B. P points to the address of first element in Data
8314C. P can store only memory addresses
8315D. P contain Data and address of Data
8316Answer: A
8317Coputer programming and problem solving
83181102.
8319A.
8320B.
8321C.
8322D.
8323Answer:
8324Coputer programming and problem solving
83251103. Syntax of the programming language is
8326A. the form of its expressions, statements and program units
8327B. meaning of those statements, expressions and program units
8328C. Both a and b
8329D. Neither a nor b
8330Answer: A
8331Coputer programming and problem solving
83321104.
8333A.
8334B.
8335C.
8336D.
8337Answer:
8338Coputer programming and problem solving
83391105.
8340A.
8341B.
8342C.
8343D.
8344Answer:
8345Coputer programming and problem solving
83461106. int a=10,b;
8347A. 22,11,11,11
8348B. 12,10,11,13
8349C. 22,10,11,13
8350D. 22,13,13,13
8351Answer: D
8352Coputer programming and problem solving
83531107. b=a++ + ++a;
8354A.
8355B.
8356C.
8357D.
8358Answer:
8359Coputer programming and problem solving
83601108. printf("%d,%d,%d,%d",b,a++,a,++a);
8361A.
8362B.
8363C.
8364D.
8365Answer:
8366Coputer programming and problem solving
83671109.
8368A.
8369B.
8370C.
8371D.
8372Answer:
8373Coputer programming and problem solving
83741110. what will be the output when following code is executed
8375A.
8376B.
8377C.
8378D.
8379Answer:
8380Coputer programming and problem solving
83811111.
8382A.
8383B.
8384C.
8385D.
8386Answer:
8387Coputer programming and problem solving
83881112. Which programming language does not need Translator?
8389A. Middle Level
8390B. High Level
8391C. Assembly Level
8392D. Machine Level
8393Answer: D
8394Coputer programming and problem solving
83951113.
8396A.
8397B.
8398C.
8399D.
8400Answer:
8401Coputer programming and problem solving
84021114.
8403A.
8404B.
8405C.
8406D.
8407Answer:
8408Coputer programming and problem solving
84091115. Code:
8410A. z=1.00
8411B. z=0.00
8412C. z=2.00
8413D. z=1.50
8414Answer: A
8415Coputer programming and problem solving
84161116.
8417A.
8418B.
8419C.
8420D.
8421Answer:
8422Coputer programming and problem solving
84231117. int i = 4;
8424A.
8425B.
8426C.
8427D.
8428Answer:
8429Coputer programming and problem solving
84301118. int x = 6;
8431A.
8432B.
8433C.
8434D.
8435Answer:
8436Coputer programming and problem solving
84371119. double z;
8438A.
8439B.
8440C.
8441D.
8442Answer:
8443Coputer programming and problem solving
84441120. z = x / i;
8445A.
8446B.
8447C.
8448D.
8449Answer:
8450Coputer programming and problem solving
84511121. printf("z=%.2f\n", z);
8452A.
8453B.
8454C.
8455D.
8456Answer:
8457Coputer programming and problem solving
84581122.
8459A.
8460B.
8461C.
8462D.
8463Answer:
8464Coputer programming and problem solving
84651123. What will print when the sample code above is executed?
8466A.
8467B.
8468C.
8469D.
8470Answer:
8471Coputer programming and problem solving
84721124.
8473A.
8474B.
8475C.
8476D.
8477Answer:
8478Coputer programming and problem solving
84791125. Which one of the following variable names is NOT valid?
8480A. __s
8481B. s__
8482C. 1__
8483D. __1
8484Answer: C
8485Coputer programming and problem solving
84861126.
8487A.
8488B.
8489C.
8490D.
8491Answer:
8492Coputer programming and problem solving
84931127. Which of the following statements is true about variables?
8494A. Value of variable will never change
8495B. Value of the variables will change during loading of the program
8496C. Value of the variables will change during Execution of the program
8497D. Value of the variables will change during compailing of the program
8498Answer: C
8499Coputer programming and problem solving
85001128.
8501A.
8502B.
8503C.
8504D.
8505Answer:
8506Coputer programming and problem solving
85071129.
8508A.
8509B.
8510C.
8511D.
8512Answer:
8513Coputer programming and problem solving
85141130. what is the output for the following code?
8515A. 10
8516B. 15
8517C. 25
8518D. Error
8519Answer: B
8520Coputer programming and problem solving
85211131.
8522A.
8523B.
8524C.
8525D.
8526Answer:
8527Coputer programming and problem solving
85281132. int a=10,b,c,d;
8529A.
8530B.
8531C.
8532D.
8533Answer:
8534Coputer programming and problem solving
85351133. a=b=c=d=15;
8536A.
8537B.
8538C.
8539D.
8540Answer:
8541Coputer programming and problem solving
85421134. printf("%d",a);
8543A.
8544B.
8545C.
8546D.
8547Answer:
8548Coputer programming and problem solving
85491135.
8550A.
8551B.
8552C.
8553D.
8554Answer:
8555Coputer programming and problem solving
85561136. In a C expression, how is a logical AND represented?
8557A. &&
8558B. .AND.
8559C. @@
8560D. ||
8561Answer: A
8562Coputer programming and problem solving
85631137.
8564A.
8565B.
8566C.
8567D.
8568Answer:
8569Coputer programming and problem solving
85701138.
8571A.
8572B.
8573C.
8574D.
8575Answer:
8576Coputer programming and problem solving
85771139. Code:
8578A. 3
8579B. 0
8580C. 1
8581D. 2
8582Answer: D
8583Coputer programming and problem solving
85841140.
8585A.
8586B.
8587C.
8588D.
8589Answer:
8590Coputer programming and problem solving
85911141. x = 3, counter = 0;
8592A.
8593B.
8594C.
8595D.
8596Answer:
8597Coputer programming and problem solving
85981142. while ((x-1))
8599A.
8600B.
8601C.
8602D.
8603Answer:
8604Coputer programming and problem solving
86051143. {
8606A.
8607B.
8608C.
8609D.
8610Answer:
8611Coputer programming and problem solving
86121144. ++counter;
8613A.
8614B.
8615C.
8616D.
8617Answer:
8618Coputer programming and problem solving
86191145. x--;
8620A.
8621B.
8622C.
8623D.
8624Answer:
8625Coputer programming and problem solving
86261146. }
8627A.
8628B.
8629C.
8630D.
8631Answer:
8632Coputer programming and problem solving
86331147.
8634A.
8635B.
8636C.
8637D.
8638Answer:
8639Coputer programming and problem solving
86401148. Referring to the sample code above, what value will the variable
8641counter have when completed?
8642A.
8643B.
8644C.
8645D.
8646Answer:
8647Coputer programming and problem solving
86481149.
8649A.
8650B.
8651C.
8652D.
8653Answer:
8654Coputer programming and problem solving
86551150.
8656A.
8657B.
8658C.
8659D.
8660Answer:
8661Coputer programming and problem solving
86621151. what is the output for the following statements?
8663A. A is 10
8664B. A is not 10
8665C. no output
8666D. Error
8667Answer: D
8668Coputer programming and problem solving
86691152.
8670A.
8671B.
8672C.
8673D.
8674Answer:
8675Coputer programming and problem solving
86761153. float a=10.0;
8677A.
8678B.
8679C.
8680D.
8681Answer:
8682Coputer programming and problem solving
86831154. if(a==10)
8684A.
8685B.
8686C.
8687D.
8688Answer:
8689Coputer programming and problem solving
86901155. {
8691A.
8692B.
8693C.
8694D.
8695Answer:
8696Coputer programming and problem solving
86971156. printf("A is 10");
8698A.
8699B.
8700C.
8701D.
8702Answer:
8703Coputer programming and problem solving
87041157. else
8705A.
8706B.
8707C.
8708D.
8709Answer:
8710Coputer programming and problem solving
87111158. printf("A is not 10");
8712A.
8713B.
8714C.
8715D.
8716Answer:
8717Coputer programming and problem solving
87181159. }
8719A.
8720B.
8721C.
8722D.
8723Answer:
8724Coputer programming and problem solving
87251160. Which of the following is not a logical data-base structure?
8726A. chain
8727B. relational
8728C. network
8729D. tree
8730Answer: A
8731Data Base Design
87321161. The data dictionary tells the DBMS
8733A. what files are in the database
8734B. what attribute are possessed by the data
8735C. what these files contain
8736D. All of the above
8737Answer: D
8738Data Base Design
87391162. An-owner-member set in the CODASYL specifications may have
8740A. only one member but many member occurrence
8741B. only one owner but many owner occurrences
8742C. more than one member but only one occurrence per member
8743D. All of the above
8744Answer: B
8745Data Base Design
87461163. A top-to-bottom relationship among the items in a database is
8747established by a
8748A. Hierarchical schema
8749B. Network schema
8750C. Relational schema
8751D. All of the above
8752Answer: A
8753Data Base Design
87541164. The PROJECT command will create new table that has
8755A. more fields than the original table
8756B. more rows than the original table
8757C. both (a) and (b)
8758D. all the fields of master table
8759Answer: D
8760Data Base Design
87611165. In a _____ a parent record type can be linked to one or more
8762"child" record types, but a child record type can have only one parent.
8763A. Network database
8764B. Relational database
8765C. Hierarchical database
8766D. Distributed database
8767Answer: C
8768Data Base Design
87691166. Which of the following is not a relational database?
8770A. Reflex
8771B. dBASE IV
8772C. 4th Dimension
8773D. FoxPro
8774Answer: A
8775Data Base Design
87761167. Which of the following is true of a network structure?
8777A. It is a physical representation of the data
8778B. It allows a many-to-many relationship
8779C. It is conceptually simple
8780D. t will be the dominant data base of the future
8781Answer: B
8782Data Base Design
87831168. Sort/report generators
8784A. are faster than index/report generators
8785B. require more disk space than index/report generators
8786C. do not need to sort before generating a report
8787D. both (a) and (b)
8788Answer: B
8789Data Base Design
87901169. Which of the following is not associated with database design?
8791A. Structure the data in stable structures that are not likely to change over time and that have
8792minimal redundancy
8793B. The preparation of a final conceptual model and the implementation of the database.
8794C. Develop a logical database design from which we can do physical database design.
8795D. Develop a logical database design that reflects the actual data requirements that exist in
8796the forms and reports of an information system.
8797Answer: B
8798Data Base Design
87991170. When each nonprimary key attribute is identified by the whole key,
8800the relation is said to be in at least:
8801A. second normal form
8802B. third normal form
8803C. fourth normal form
8804D. fifth normal form
8805Answer: A
8806Data Base Design
88071171. A functional dependency between two (or more) nonprimary key
8808attributes in a relation defines a:
8809A. weak dependency
8810B. partial dependency
8811C. simple dependency
8812D. transitive dependency
8813Answer: D
8814Data Base Design
88151172. The primary deliverable from logical database design is:
8816A. normalized relations
8817B. design specifications
8818C. an updated baseline project plan
8819D. a list of alternative design strategies
8820Answer: A
8821Data Base Design
88221173. The following are steps to transforming an E-R diagram into
8823normalized relations and then merging all the relations into one final,
8824consolidated set of relations except for:
8825A. represent entities
8826B. represent relationships
8827C. normalize the relations
8828D. denormalize the relations
8829Answer: D
8830Data Base Design
88311174. For a unary one-to-one relationship between two entities A and B,
8832the relationship is represented by:
8833A. adding the primary key of A as a foreign key of B
8834B. adding the primary key of B as a foreign key of A
8835C. combining the two entities into one relation
8836D. either a or b
8837Answer: D
8838Data Base Design
88391175. Convert from binary to octal (11010111110.0011) 2
8840A. (3386.24)8
8841B. (4276.14)8
8842C. (3276.148)8
8843D. (3312.24)8
8844Answer: C
8845Digital Logic
88461176. The range of numbers which can be stored in a 8 bit register is
8847A. -128 to +127
8848B. -128 to +128
8849C. -999999 to +999999
8850D. None of these
8851Answer: A
8852Digital Logic
88531177. To find the Complement of a function which law is used?
8854A. Commutative law
8855B. Distributive law
8856C. Duality
8857D. De Morgans Law
8858Answer: D
8859Digital Logic
88601178. Which one is a self complementary code?
8861A. Excess 3 code
8862B. 8 4 2 1
8863C. Reflected code
8864D. 2 4 2 1
8865Answer: D
8866Digital Logic
88671179. The output of logic gate is ‘1’ when all its input are at logic ‘0’ .
8868The gate is either
8869A. a NAND or an EX-OR gate
8870B. a NOR or an EX- NOR gate
8871C. an OR or an EX-NOR gate
8872D. an AND or an EX-OR gate
8873Answer: B
8874Digital Logic
88751180. Theorem Absorption is state as
8876A. x+x’y=x
8877B. x+xy=x’
8878C. x+x’y’=x
8879D. x+xy=x
8880Answer: D
8881Digital Logic
88821181. Which of the following is not typically found in status register of a
8883microprocessor
8884A. Overflow
8885B. Zero result
8886C. Negative result
8887D. None of these
8888Answer: D
8889Digital Logic
88901182. Duality of an expression is obtained by
8891A. interchanging 0 and 1
8892B. interchanging AND & OR
8893C. both a and b
8894D. by complementing the variables
8895Answer: C
8896Digital Logic
88971183. A Binary with n digits all of which are unity has the value
8898A. n2 -1
8899B. 2n-1
8900C. 2n
8901D. 2n-1
8902Answer: B
8903Digital Logic
89041184. How is a J-K flip-flop made to toggle
8905A. How is a J-K flip-flop made to toggle
8906B. when the gate is HIGH
8907C. both of the above
8908D. neither of the above
8909Answer: B
8910Digital Logic
89111185. Express Y = (A+B+C ) (A+ B ô€€€ C )(A+B+C) in maxterm designation
8912A. Y= M4M6M7
8913B. Y= M0M1M3
8914C. Y= m4m6m7
8915D. m0m1m3
8916Answer: B
8917Digital Logic
89181186. Assign the proper odd parity bit to the code 111001 in MSB
8919A. 111001
8920B. 1111001
8921C. 1110011
8922D. 1110010
8923Answer: A
8924Digital Logic
89251187. Identify the form of the given function F = (AB+CD) (A’B’+C’D’)
8926A. Standard Form
8927B. Sum of Minterms
8928C. Product of Maxterms
8929D. Non standard form
8930Answer: B
8931Digital Logic
89321188. 2’s Complement of 0101010111 will be
8933A. 101010111
8934B. 1010101001
8935C. 10101011111
8936D. 1010100011
8937Answer: B
8938Digital Logic
89391189. Write the next four numbers in the hex counting sequence
8940E9A,E9B,E9C,E9D, _ , _ , _,
8941A. E9E , E9F, EA0 , EA1
8942B. E9E , E9F, E100, E101
8943C. E9E , E9F, E00, E01
8944D. None of the above
8945Answer: A
8946Digital Logic
89471190. You need at least bits to represent 32 in two's complement format
8948A. 4
8949B. 5
8950C. 6
8951D. 7
8952Answer: D
8953Computer Architecture and Organization
89541191. In two's complement addition, if the last two carry bits are not the
8955same, what does it indicate?
8956A. carry
8957B. negative result
8958C. overflow
8959D. underflow
8960Answer: C
8961Computer Architecture and Organization
89621192. If the subtraction of two numbers results in a carry, what does this
8963indicate? Assume the numbers are represented in sign-magnitude form.
8964A. Overflow
8965B. negative result
8966C. Positive result
8967D. carry
8968Answer: C
8969Computer Architecture and Organization
89701193. What is the value of exponent bias for IEEE 754 double precision
8971format?
8972A. 1023
8973B. 1024
8974C. 127
8975D. 1000
8976Answer: A
8977Computer Architecture and Organization
89781194. In booth's multiplication algorithm, if QnQn+1= 10, what operation
8979will you perform?
8980A. Right shift AQQn+1
8981B. Left shift AQQn+1
8982C. Add A and Multiplier, and then right shift AQQn+1
8983D. Subtract Multiplier from A and right shift AQQn+1
8984Answer: D
8985Computer Architecture and Organization
89861195. If a number has k-bits(k is even), how many bits will its square-root
8987have?
8988A. K-1
8989B. K/2
8990C. k
8991D. k-2
8992Answer: B
8993Computer Architecture and Organization
89941196. In number representation, 1111 in memory represents -1.
8995A. unsigned integers
8996B. one’s complement
8997C. sign-and-magnitude
8998D. two’s complement
8999Answer: D
9000Computer Architecture and Organization
90011197. Random access memories are useful in applications where
9002A. Data consists of numbers
9003B. Short access time is required
9004C. Each stored word is processed differently
9005D. Data naturally needs to flow in and out in serial form
9006Answer: B
9007Computer Architecture and Organization
90081198. when the overflow do not occur in fixed point addition?
9009A. when the signs of addend and augend are same
9010B. 2's complement addition
9011C. when the signs of addend and augend are different
9012D. all the above
9013Answer: C
9014Computer Architecture and Organization
90151199. when the overflow do not occur in fixed point subtraction?
9016A. when the signs of addend and augend are same
9017B. 2's complement subtraction
9018C. when the signs of addend and augend are different
9019D. all the above
9020Answer: A
9021Computer Architecture and Organization
90221200. when Qn and Qn+1 = 01 then the action taken is
9023A. subtract multiplicand from partial product
9024B. add multiplicand to partial product
9025C. arithmetic shift right
9026D. logical shift right
9027Answer: B
9028Computer Architecture and Organization
90291201. when do we restore the partial remainder in signed-magnitude
9030division?
9031A. when partial remainder is greater than divisor
9032B. when partial remainder is equal to the divisor
9033C. when partial remainder is less than the divisor
9034D. none of the above
9035Answer: C
9036Computer Architecture and Organization
90371202. To reduce the exponent value by 2, the radix point is moved to
9038wards
9039A. left by 2 bits
9040B. right by 2 bits
9041C. left by 1 bit
9042D. right by 1 bit
9043Answer: B
9044Computer Architecture and Organization
90451203. ……………………... number of unsigned numbers can be
9046generated using 4 bits
9047A. 4
9048B. 8
9049C. 16
9050D. 20
9051Answer: C
9052Computer Architecture and Organization
90531204. Binary Multiplication algorithm is also called as……………
9054A. Lattice multiplication algorithm
9055B. Long multiplication algorithm
9056C. Sunzi multiplication algorithm
9057D. Peasant multiplication algorithm
9058Answer: D
9059Computer Architecture and Organization
90601205. Name the algorithm which is used for singed multiplication using
90612’s Complement
9062A. Booth's
9063B. Von Nuemann
9064C. Charles Babbage
9065D. Ada
9066Answer: A
9067Computer Architecture and Organization
90681206. The speed of floating-point operations is an important measure of
9069performance for computers in many application domains. It is measured
9070in FLOPS
9071A. MIPS
9072B. FIPS
9073C. FLOPS
9074D. FOPS
9075Answer: C
9076Computer Architecture and Organization
90771207. Identify the Type of IEEE format for the flowing point numbers
9078having the sign bit=1, the exponent field=15, and the significand
9079(mantissa)=112
9080A. Half
9081B. Single
9082C. Double
9083D. Quad
9084Answer: D
9085Computer Architecture and Organization
90861208. Match the following P. Sequential access i. Flopy Disc Q. Direct
9087access ii. RAM R. Random access iii. Magnetic Tape S. Associative
9088access iv. Cache Memory
9089A. P-ii, Q-iii, R-i, S-iv
9090B. P-iii, Q-iii, R-i, S-iv
9091C. P-ii, Q-ii, R-iii, S-iv
9092D. P-i, Q-ii, R-iii, S-iv
9093Answer: B
9094Computer Architecture and Organization
90951209. Charles Babbage started Difference engine in1821 but failed its
9096test in 1833, Why?
9097A. Lack of funds
9098B. Lack of Resources
9099C. Lack Enouragement
9100D. Lack of Memory Technology
9101Answer: D
9102Computer Architecture and Organization
91031210. Compute the memory traffic for the following Code
9104fragment,Assume that opcode occupy one byte, address occupies two
9105bytes, data values occupy two bytes and word length is one byte LOAD
9106A,B SUB A,C MPY A,D
9107A. 15
9108B. 20
9109C. 3
9110D. 21
9111Answer: C
9112Computer Architecture and Organization
91131211. Which one of the following statement is wrong
9114A. “Multiple memory accesses” is a disadvantage of Indirect addressing mode
9115B. Stack addressing mode has limited applicability
9116C. Immediate addressing mode has limited operand magnitude
9117D. Register Indirect addressing mode has limited address space
9118Answer: D
9119Computer Architecture and Organization
91201212. Which of the following justification is correct if an one word
9121instruction opcode length is 4 bit and address field is 12 bits length.
9122A. The number of instruction of processor is 16 and total memory capacity is 1MB
9123B. The number of instruction of processor is 32 and total memory capacity is 4MB
9124C. The word legth is 16 bit and total memory capacity is 1KB
9125D. The number of instruction of processor is 32 and total memory capacity is 8KB
9126Answer: A
9127Computer Architecture and Organization
91281213. Differentiate between implicit and Immdiate Addressing modes
9129A. Immediate addressing mode instruction contians no address field and implied addressing
9130mode no opcode field
9131B. Implied addressing mode instruction contians no address field and Immediate addressing
9132mode contains no opcode field
9133C. Implied addressing mode instruction contians no address field and Immediate addressing
9134mode contains 2's complement value in its address field
9135D. None of the above
9136Answer: C
9137Computer Architecture and Organization
91381214. In IAS computer ,IAS stands for:
9139A. Indian administrative services
9140B. Institute for Advanced Studies
9141C. Institute of Arts & Science
9142D. None of the above
9143Answer: B
9144Computer Architecture and Organization
91451215. In IAS Computer………………Register employed to temporarily
9146hold the right –hand instruction from a word in memory
9147A. MBR
9148B. MAR
9149C. IR
9150D. IBR
9151Answer: D
9152Computer Architecture and Organization
91531216. In IAS computer for a multiplication operation result , the Most
9154Significant 40 bits will be in ………register and least significant 40 bits
9155will be in …………register.
9156A. AC, MBR
9157B. MBR,MQ
9158C. AC,MQ
9159D. MQ,AC
9160Answer: C
9161Computer Architecture and Organization
91621217. Source and result operands can be stored in one of …….areas
9163A. 2
9164B. 3
9165C. 5
9166D. 7
9167Answer: B
9168Computer Architecture and Organization
91691218. The address where data is available is part of the instruction is
9170called as ………addressing mode
9171A. Implied
9172B. Immediate
9173C. Indirect
9174D. Direct
9175Answer: D
9176Computer Architecture and Organization
91771219. Compute Number of memory accesses for executing a 4-address
9178instruction if wordlength is 3 byte, opcode is 1byte, and operand
9179address/operand is 3 byte.
9180A. 7
9181B. 10
9182C. 9
9183D. 5
9184Answer: A
9185Computer Architecture and Organization
91861220. Match the following 1. MOV 2000,R1 A. Implied Addressing Mode
91872. MVI 01, R2 B. Indirect Addressing Mode 3. MOV (2000), R1 C. Direct
9188Addressing Mode 4. DEC D. Immediate Addressing Mode
9189A. 1-A,2-B,3-C,4-D
9190B. 1-C,2-A,3-C,4-D
9191C. 1-C,2-D,3-B,4-A
9192D. 1-D,2-C,3-B,4-A
9193Answer: C
9194Computer Architecture and Organization
91951221. In Relative Addressing mode, The Effective Address(EA)=
9196A. PC+AC
9197B. AC+2's Complement value
9198C. PC+2's Complement value
9199D. MBR+PC
9200Answer: C
9201Computer Architecture and Organization
92021222. Which one of the following is correct sequence of Instruction
9203Cycle 1. Instruction Fetch 2. Operand Address Calculation for
9204Computation 3. Operand Fetch 4. Intruction Decode 5. next Instruction
9205address calculation 6. Operand Address Calulation for store 7. Operand
9206Store 8. Instruction Execution
9207A. 1-2-5-3-4-6-7-8
9208B. 1-4-2-3-5-6-8-7
9209C. 1-2-3-4-5-6-7-8
9210D. 1-4-2-3-8-6-7-5
9211Answer: D
9212Computer Architecture and Organization
92131223. The memory of IAS consists of
9214A. 1000 storage locations, 30 bit words
9215B. 8000 storage locations, 40 bit words
9216C. 2000 storage locations, 80 bit words
9217D. a.1000 storage locations, 40 bit words
9218Answer: D
9219Computer Architecture and Organization
92201224. An assembly language program is translated to machine code by
9221A. an assembler
9222B. a compiler
9223C. an interpreter
9224D. a linker
9225Answer: A
9226Computer Architecture and Organization
92271225. What is Op-code?
9228A. The instruction that is to be executed
9229B. The value in which an operation acts upon
9230C. A mnemonic that defines a data size
9231D. The compiled assembly code
9232Answer: A
9233Computer Architecture and Organization
92341226. The von Neumann bottleneck is due to
9235A. mismatch in speed between secondary and primary storage
9236B. mismatch in speed between the CPU and primary storage
9237C. slow speed I/O devices
9238D. Slow clock speed
9239Answer: B
9240Computer Architecture and Organization
92411227. Perform the logic AND, XOR with binary strings 10011100 and
924210101010
9243A. AND= 10001000 XOR= 00110110
9244B. AND= 10111000 XOR= 00110110
9245C. AND= 10011000 XOR= 00110111
9246D. a) AND= 10001011 XOR= 00111110
9247Answer: A
9248Computer Architecture and Organization
92491228. The CPU deals with each instruction in a cycle. The sequence of
9250instructions to carry out one machine instruction is called the instruction
9251or machine cycle. The first action is to fetch the instruction from memory
9252and then the program counter is updated (reset). The other three phases
9253of the machine cycle in the correct order are:
9254A. Decode the instruction; Execute the instruction; Transfer the data
9255B. Decode the instruction; Transfer the data; Execute the instruction
9256C. Execute the instruction; Decode the instruction; Transfer the data
9257D. Transfer the data; Execute the instruction; Decode the instruction
9258Answer: A
9259Computer Architecture and Organization
92601229. An instruction stored at location 300 with its address field at
9261location 301. The address field has the value 400. A processor register
9262R1 contains the number 200. Evaluate the effective address if the
9263addressing mode of the instruction is (a) relative (b) index with R1 as the
9264index register.
9265A. 702, 600
9266B. 400,600
9267C. 400, 700
9268D. 700, 200
9269Answer: A
9270Computer Architecture and Organization
92711230. A data movement instruction will
9272A. modify the status register
9273B. modify the stack pointer
9274C. modify the program counter
9275D. transfer data from one location to another
9276Answer: D
9277Computer Architecture and Organization
92781231. Which register example hold the instruction itself?
9279A. . Program Counter
9280B. Instruction Register
9281C. Control Unit
9282D. Arithmetic Logic Unit
9283Answer: B
9284Computer Architecture and Organization
92851232. Name the addressing mode where the data is directly available as
9286an operand
9287A. immediate
9288B. relative
9289C. direct
9290D. indirect
9291Answer: A
9292Computer Architecture and Organization
92931233. The common fields found in instruction formats are:
9294A. opcode field,address field,mode field
9295B. opcode field, operand field, address field, mode field,
9296C. opcode field, address field, next address field, mode field
9297D. opcode field, address field1, address field1, mode field,
9298Answer: A
9299Computer Architecture and Organization
93001234. The memory address register is used to store
9301A. data to be transferred to memory
9302B. data that has been transferred from memory
9303C. the address of a memory location
9304D. an instruction that has been transferred from
9305Answer: C
9306Computer Architecture and Organization
93071235. What are important aspects of the von Neumann architecture?
9308A. Instruction are data
9309B. Separate memory for programs and data
9310C. invented in Germany
9311D. Uses a program counter
9312Answer: B
9313Computer Architecture and Organization
93141236. When creating a subroutine in assembly, what needs to be
9315handled?
9316A. Passing parameters to the subroutine
9317B. Returning values from the subroutine
9318C. Returning to the proper location when the subroutine is finished
9319D. All of the above
9320Answer: D
9321Computer Architecture and Organization
93221237. According to the von Neumann model, stored in memory.
9323A. only data are
9324B. only programs are
9325C. data and programs are
9326D. none of the above
9327Answer: C
9328Computer Architecture and Organization
93291238. If the memory address space is 64 MB and the word size is 8 bits,
9330then bits are needed to access each word.
9331A. 26
9332B. 24
9333C. 28
9334D. 32
9335Answer: A
9336Computer Architecture and Organization
93371239. Which data structure is used for the subroutine?
9338A. Queue
9339B. Stack
9340C. Array
9341D. List
9342Answer: B
9343Computer Architecture and Organization
93441240. For the instruction MOV R1, (2000) calculate the effective address
9345__________ and the content of R1 __________
9346A. 2000, M (2000)
9347B. M (2000), 2000
9348C. 2000, M(2000
9349D. M(2000) , M(M(2000))
9350Answer: D
9351Computer Architecture and Organization
93521241. The address of memory location containing the instruction code
9353for next instruction is stored in _________________.
9354A. IBR
9355B. MAR
9356C. IR
9357D. PC
9358Answer: D
9359Computer Architecture and Organization
93601242. __________languages are also known as assembly languages.
9361A. Machine
9362B. Symbolic
9363C. High-level
9364D. Natural
9365Answer: B
9366Computer Architecture and Organization
93671243. The three steps in the running of a program on a computer are
9368performed in this specific order
9369A. Fetch, execute, and decode
9370B. decode, execute, and fetch
9371C. Decode, fetch, and execute
9372D. fetch, decode, and execute
9373Answer: D
9374Computer Architecture and Organization
93751244. The purposes of IBR register in von Neumann architecture is to
9376hold _____________
9377A. Left Instruction
9378B. Right Instruction
9379C. Opcode
9380D. Address field
9381Answer: B
9382Computer Architecture and Organization
93831245. Segment Pointer is a register to hold the __________________
9384A. Address
9385B. Data
9386C. both Address & Data
9387D. Condition
9388Answer: A
9389Computer Architecture and Organization
93901246. In the von Neumann model, the subsystem serves as a manager of
9391the other subsystems.
9392A. ALU
9393B. input/output
9394C. memory
9395D. control unit
9396Answer: D
9397Computer Architecture and Organization
93981247. Von Neumann machine follows _____________ instruction format
9399A. Zero Address
9400B. One Address
9401C. Two Address
9402D. Three Address
9403Answer: B
9404Computer Architecture and Organization
94051248. . Load (R1) +” , Identify the addressing mode.
9406A. Register Indirect
9407B. Pre Auto Increment
9408C. Post Auto Increment
9409D. Index Register
9410Answer: C
9411Computer Architecture and Organization
94121249. Give the last instruction in the subroutine.______________________
9413A. Call
9414B. Return
9415C. Skip
9416D. Jump
9417Answer: B
9418Computer Architecture and Organization
94191250. In a Division operation result, the quotient will be in
9420________register and Remainder will be_________________register.
9421A. AC & MBR
9422B. AC & MQ
9423C. MQ & AC
9424D. MQ & IR
9425Answer: C
9426Computer Architecture and Organization
94271251. IAS machine supports __________ bit instruction.
9428A. 20
9429B. 40
9430C. 30
9431D. 10
9432Answer: A
9433Computer Architecture and Organization
94341252. The IAS machine is a address machine
9435A. 4
9436B. 0
9437C. 1
9438D. 3
9439Answer: C
9440Computer Architecture and Organization
94411253. The DIV M(X) instruction in IAS has the dividend in the register
9442A. AC
9443B. PC
9444C. MQ
9445D. None of the above
9446Answer: A
9447Computer Architecture and Organization
94481254. If a machine supports 256 unique instructions, the width of the
9449opcode field is
9450A. 256
9451B. 8
9452C. 16
9453D. 4
9454Answer: B
9455Computer Architecture and Organization
94561255. What type of instruction is JUMP M(X), where X is the address of a
9457memory location?
9458A. Logical
9459B. Arithmetic
9460C. Control
9461D. Load
9462Answer: C
9463Computer Architecture and Organization
94641256. What is the function of the IBR register?
9465A. To save the right instruction
9466B. To save the opcode of the instruction
9467C. To save the left instruction
9468D. To save the address field of the instruction
9469Answer: A
9470Computer Architecture and Organization
94711257. What is the addressing mode used in the instruction ADD R1, R2,
9472[R3], which adds the contents of registers R2 and that pointed by R3
9473and stores the result in R1?
9474A. Direct
9475B. Register
9476C. Implied
9477D. Indirect
9478Answer: D
9479Computer Architecture and Organization
94801258. If you were to add the instruction ADD R1, R2, R3 to the IAS
9481instruction set, what changes will you make to the datapath?
9482A. Add an additional input to the ALU which takes operands from a register file
9483B. Add a register file
9484C. Connect the output of ALU to register file
9485D. Add an additional adder
9486Answer: A,B &C
9487Computer Architecture and Organization
94881259. What is the addressing mode used in the instruction BEQ R1, R2,
9489Offset, which compares the contents of registers R1 and R2 and if they
9490are equal, transfers program control to PC+offset
9491A. Immediate
9492B. Direct
9493C. PC -Relative
9494D. Indexed
9495Answer: C
9496Computer Architecture and Organization
94971260. What is the addressing mode used in the instruction ADD for the
9498stack-organised machine?
9499A. Implied
9500B. Direct
9501C. Register
9502D. Indirect
9503Answer: A
9504Computer Architecture and Organization
95051261. Write a program to evaluate the expression (a+b)/c for a 0-address
9506machine
9507A.
9508B.
9509C.
9510D.
9511Answer:
9512Computer Architecture and Organization
95131262. If a machine has a unified memory of 256 bytes which is byte
9514addressable, what would be the size of the PC register? Assume each
9515instruction is of one byte.
9516A. 16 bits
9517B. 32 bits
9518C. 8bits
9519D. 256 bits
9520Answer: C
9521Computer Architecture and Organization
95221263. What is the addressing mode used in the instruction IN 10h which
9523is used to read the input from an input device into accumulator?
9524A. Immediate
9525B. Relative
9526C. Indirect
9527D. Direct
9528Answer: D
9529Computer Architecture and Organization
95301264. The DIV M(X) instruction in the IAS machine stores the quotient in
9531the register and the remainder in the register
9532A. AC, MQ
9533B. MQ,AC
9534C. AC,IR
9535D. MDR,MQ
9536Answer: B
9537Computer Architecture and Organization
95381265. What is the use of the base indexed addressing mode?
9539A. To make the program re-locatable
9540B. To reduce the size of the program
9541C. To reduce the size of individual instructions
9542D. To access memory locations
9543Answer: A
9544Computer Architecture and Organization
95451266. Match the following 1. MOV 2000,R1 A. Implied Addressing Mode
95462. MVI 01, R2 B. Indirect Addressing Mode 3. MOV (2000), R1 C. Direct
9547Addressing Mode 4. DEC D. Immediate Addressing Mode
9548A. 1-A,2-B,3-C,4-D
9549B. 1-C,2-A,3-C,4-D
9550C. 1-C,2-D,3-B,4-A
9551D. 1-D,2-C,3-B,4-A
9552Answer: C
9553Computer Architecture and Organization
95541267. In Relative Addressing mode, The Effective Address(EA)=
9555A. PC+AC
9556B. AC+2's Complement value
9557C. PC+2's Complement value
9558D. MBR+PC
9559Answer: C
9560Computer Architecture and Organization
95611268. Which one of the following is correct sequence of Instruction
9562Cycle 1. Instruction Fetch 2. Operand Address Calculation for
9563Computation 3. Operand Fetch 4. Intruction Decode 5. next Instruction
9564address calculation 6. Operand Address Calulation for store 7. Operand
9565Store 8. Instruction Execution
9566A. 1-2-5-3-4-6-7-8
9567B. 1-4-2-3-5-6-8-7
9568C. 1-2-3-4-5-6-7-8
9569D. 1-4-2-3-8-6-7-5
9570Answer: D
9571Computer Architecture and Organization
95721269. DMQL is used in
9573A. Data Warehouse
9574B. Data Mining
9575C. Concept Hierarchy
9576D. All the of the choices
9577Answer: D
9578Data Warehousing and Data Mining
95791270. Data Mining algorithms are applied on
9580A. Relational Database
9581B. Time Series Database
9582C. Spatial Database
9583D. All the of the choices
9584Answer: D
9585Data Warehousing and Data Mining
95861271. Missing data are handled in
9587A. Data Transformation
9588B. Data Integration
9589C. Data Cleaning
9590D. Data Reduction
9591Answer: C
9592Data Warehousing and Data Mining
95931272. Find out which of the following technique is used for 'Predicting
9594whether today is a rainy day or not based on humidity and temperature'.
9595A. Prediction
9596B. Classification
9597C. Clustering
9598D. Association
9599Answer: B
9600Data Warehousing and Data Mining
96011273. One of the supervised learning technique is
9602A. Prediction
9603B. Association
9604C. Clustering
9605D. Discrimination
9606Answer: A
9607Data Warehousing and Data Mining
96081274. Relative grading in grade calculation is an example of
9609A. Set Grouping Hierarchy
9610B. Rule Based Hierarchy
9611C. Operation Derived Hierarchy
9612D. Schema Hierarchy
9613Answer: B
9614Data Warehousing and Data Mining
96151275. Confidence measures the __________ of the rules
9616A. Certainity
9617B. Utility
9618C. Simplicity
9619D. Novelty
9620Answer: A
9621Data Warehousing and Data Mining
96221276. Redundant patterns are removed with the help of the following
9623measure estimation
9624A. Certainity
9625B. Utility
9626C. Simplicity
9627D. Novelty
9628Answer: D
9629Data Warehousing and Data Mining
96301277. Pattern Evaluation is a term appropriate to which of the following
9631A. Concept Hierarchy
9632B. Measures
9633C. Data Warehouse
9634D. Bar Chart
9635Answer: B
9636Data Warehousing and Data Mining
96371278. One of the Association algorithm is
9638A. K Means
9639B. Naïve Bayesian
9640C. FP Tree
9641D. Regression
9642Answer: C
9643Data Warehousing and Data Mining
96441279. Which of the following is an representation of 'Knowledge Base'
9645A. Concept Hierarchy
9646B. Star Schema
9647C. Bar Chart
9648D. Data Warehouse
9649Answer: A
9650Data Warehousing and Data Mining
96511280. In a Data Warehouse which of the following is a very rare
9652operation?
9653A. Update
9654B. Read
9655C. Retrieve
9656D. Rollup
9657Answer: A
9658Data Warehousing and Data Mining
96591281. If there are 4 dimensions in a Data Warehouse, then the possible
9660number of cuboids are
9661A. 4
9662B. 16
9663C. 81
9664D. 24
9665Answer: B
9666Data Warehousing and Data Mining
96671282. A system has space constraints but has an efficient processor.
9668Which of the following algorithm would you suggest for this system to
9669perform Association technique?
9670A. FP growth
9671B. Apriori
9672C. K Means
9673D. Naïve Bayesian
9674Answer: A
9675Data Warehousing and Data Mining
96761283. You are asked to design a Data Warehouse for a University and
9677most of the operations are retrieval from all of the dimension tables. The
9678Data Warehouse should perform fast. What is the schema would you use
9679for this scenario?
9680A. Snow Flake Schema
9681B. ER Schema
9682C. Star Schema
9683D. Fact Constellation
9684Answer: C
9685Data Warehousing and Data Mining
96861284. What does HTML stand for
9687A. Home Tool Markup Language
9688B. Hyperlinks and Text Markup Language
9689C. Hyper Text Markup
9690D. Language
9691Answer: C
9692Internet and Web Programming
96931285. Who is making the Web standards?
9694A. Microsoft
9695B. The World Wide Web Consortium
9696C. Mozilla
9697D. Google
9698Answer: B
9699Internet and Web Programming
97001286. Choose the correct HTML tag for the largest heading
9701A. <h1>
9702B. <head>
9703C. <h6>
9704D. <heading>
9705Answer: A
9706Internet and Web Programming
97071287. What is the correct HTML tag for inserting a line break?
9708A. <br/>
9709B. <break />
9710C. <lb />
9711D. <hr />
9712Answer: A
9713Internet and Web Programming
97141288. What is the preferred way for adding a background color in
9715HTML?
9716A. <body style="background-color:yellow">
9717B. <body background="yellow">
9718C. <body background-color="yellow">
9719D. <background>yellow</background>
9720Answer: A
9721Internet and Web Programming
97221289. Choose the correct HTML tag to make a text bold
9723A. <bold>
9724B. <b>
9725C. <weight>
9726D. <font>
9727Answer: B
9728Internet and Web Programming
97291290. Choose the correct HTML tag to make a text italic
9730A. <i>
9731B. <italic>
9732C. <style>
9733D. <emph>
9734Answer: A
9735Internet and Web Programming
97361291. What is the correct HTML for creating a hyperlink?
9737A. <a url="http://www.anthoniraja.com">anthoniraja.com</a>
9738B. <a href="http://www.anthoniraja.com">anthoniraja</a>
9739C. <a name="http://www.anthoniraja.com">anthoniraja.com</a>
9740D. <a>http://www.anthoniraja.com</a>
9741Answer: B
9742Internet and Web Programming
97431292. How can you open a link in a new browser window?
9744A. <a href=http://www.anthoniraja.com" new>
9745B. <a href="http://www.anthoniraja.com" target="new">
9746C. <a href="http://www.anthoniraja.com" target="_blank">
9747D. href="http://www.anthoniraja.com" target="_">
9748Answer: C
9749Internet and Web Programming
97501293. Which of these tags are all <table> tags?
9751A. <table><tr><td>
9752B. <table><head><tfoot>
9753C. <table><tr><tt>
9754D. <thead><body><tr>
9755Answer: A
9756Internet and Web Programming
97571294. Choose the correct HTML to left-align the content inside a
9758tablecell
9759A. <td leftalign>
9760B. <tdleft>
9761C. <td valign="left">
9762D. <td align="left">
9763Answer: D
9764Internet and Web Programming
97651295. How can you make a list that lists the items with numbers?
9766A. <dl>
9767B. <list>
9768C. <ul>
9769D. <ol>
9770Answer: D
9771Internet and Web Programming
97721296. What is the correct HTML for making a text input field?
9773A. <input type="text" />
9774B. <textinput type="text" />
9775C. <input type="textfield" />
9776D. <textfield>
9777Answer: A
9778Internet and Web Programming
97791297. What is the correct HTML for inserting an image?
9780A. <image src="image.gif" alt="MyImage" />
9781B. <img src="image.gif" alt="MyImage" />
9782C. <img href="image.gif" alt="MyImage" />
9783D. <img alt="MyImage">image.gif</img>
9784Answer: B
9785Internet and Web Programming
97861298. Which one is not HTML5 input type?
9787A. email
9788B. url
9789C. search
9790D. list
9791Answer: D
9792Internet and Web Programming
97931299. Which tag is used to group inline-elements in HTML5?
9794A. <div>
9795B. <span>
9796C. <inline>
9797D. <section>
9798Answer: B
9799Internet and Web Programming
98001300. What is the correct HTML5 Docukment type syntax?
9801A. <!DOCTYPE html>
9802B. <html doctype="http://www.w3.org/2004/html5">
9803C. <html doctype="http://www.w3.org/2000/xhtml">
9804D. <!DOCTYPE html5>
9805Answer: A
9806Internet and Web Programming
98071301. How do you specify the width and height of the video tag in
9808HTML5
9809A. <video width="300" height="400"></video>
9810B. <video w="300" h="400"></video>
9811C. <video length="300" h="400"></video>
9812D. <video "300x400"></video>
9813Answer: A
9814Internet and Web Programming
98151302. Find the Hexadecimal Value of "IndianRed" Color
9816A. #CD5C5C
9817B. #CDCCCC
9818C. #CD555C
9819D. #CA5C5C
9820Answer: A
9821Internet and Web Programming
98221303. The Fuzzy Set differs from crisp set by
9823A. Demorgan's
9824B. Associative property
9825C. Excluded Middle Axiom
9826D. All the above
9827Answer: C
9828Soft Computing
98291304. The error signal generator in Supervised learning algorithm takes
9830the input as
9831A. Actual output and Desired Output
9832B. Actual output and reinforcement signal
9833C. Actual output only
9834D. None of the Options Given
9835Answer: A
9836Soft Computing
98371305. The cardinality of the fuzzy set is
9838A. 1
9839B. N
9840C. Infinity
9841D. cannot say
9842Answer: C
9843Soft Computing
98441306. For Disjunctive system of rules ,the aggregated output is found by
9845A. Union
9846B. Intersection
9847C. difference
9848D. None of the Options Given
9849Answer: A
9850Soft Computing
98511307. Genetic Algorithm is
9852A. Calculus based Search Algorithm
9853B. Random Guided Search Algorithm
9854C. Random Undirected Search Algorithm
9855D. Randomized Algorithm
9856Answer: B
9857Soft Computing
98581308. The process of obtaining the overall consequent from the
9859indivisual consequents contributed by each rule in the rule base is
9860known as
9861A. Aggregation of fuzzy rules
9862B. Composition of fuzzy rules
9863C. Conjunction
9864D. Disjunction
9865Answer: A
9866Soft Computing
98671309. Which AI System will continue to analyze a problem until it finds
9868the best solution
9869A. Genetic Algorithm
9870B. Neural Network
9871C. Intelligent Agent
9872D. Expert System
9873Answer: A
9874Soft Computing
98751310. Hard C means is used to classify data in
9876A. Crisp Sense
9877B. Fuzzy Sense
9878C. Both Supervised and Unsupervised
9879D. None of the Options Given
9880Answer: A
9881Soft Computing
98821311. Weight adjustment takes place in
9883A. Supervised Learning Only
9884B. Unsupervised Learning Only
9885C. Both Supervised and Unsupervised
9886D. Neither Supervised nor unsupervised
9887Answer: C
9888Soft Computing
98891312. Which among these are defuzzification methods
9890A. last maxima
9891B. weighted Average
9892C. Centroid Sum
9893D. All of the options given
9894Answer: D
9895Soft Computing
98961313. Proximity relation satisfies
9897A. Symmetric,reflexive and transitive
9898B. refexive and symmetric
9899C. reflexive nad transitive
9900D. Symmetric and refexive
9901Answer: B
9902Soft Computing
99031314. Fuzzy Logic has Values
9904A. 1 and 0
9905B. between 1 and 0
9906C. true or false
9907D. All of the options given
9908Answer: B
9909Soft Computing
99101315. Fuzzy Set as
9911A. Crisp boundary
9912B. Vague Boundary
9913C. Certain Boundary
9914D. None of the Options Given
9915Answer: B
9916Soft Computing
99171316. Belongingness of the object in fuzzy set is defined by
9918A. Boolean Value
9919B. relation
9920C. membership function
9921D. All of the options given
9922Answer: C
9923Soft Computing
99241317. Fuzzification Methods are
9925A. Intuition
9926B. Inference
9927C. Rank Ordering
9928D. All of the options given
9929Answer: D
9930Soft Computing
99311318. 1.Which of the following conversion is not possible
9932(algorithmically)?
9933A. regular grammar to context-free grammar
9934B. nondeterministic FSA to deterministic FSA
9935C. nondeterministic PDA to deterministic PDA
9936D. nondeterministic TM to deterministic TM
9937Answer: c
9938Theory of Computation
99391319. 2.Which of the following regular expression identity is true?
9940A. r(*) = r*
9941B. (r*s*)* = (r + s)*
9942C. (r + s)* = r* + s*
9943D. r*s* = r* + s*
9944Answer: b
9945Theory of Computation
99461320. 3.Which of the following regular expressions denotes a language
9947comprising of all possible strings over Σ = {a, b} of length n where n is a
9948multiple of 3.
9949A. (a + b + aa + bb + aba + bba)*
9950B. (aaa + bbb)*
9951C. ((a + b)(a + b)(a + b))*
9952D. (aaa + ab + a) + (bbb + bb + a)
9953Answer: c
9954Theory of Computation
99551321. 4.Can a DFSA simulate a NFSA
9956A. . No
9957B. Yes
9958C. sometimes
9959D. depends on NFA
9960Answer: b
9961Theory of Computation
99621322. 5.Consider the following statements
9963A.
9964B.
9965C.
9966D.
9967Answer:
9968Theory of Computation
99691323.
9970A.
9971B.
9972C.
9973D.
9974Answer:
9975Theory of Computation
99761324. I. Recursive languages are closed under complementation
9977A. I only
9978B. I and II
9979C. I and III
9980D. II and III
9981Answer: b
9982Theory of Computation
99831325. II. Recursively enumerable languages are closed under union
9984A.
9985B.
9986C.
9987D.
9988Answer:
9989Theory of Computation
99901326. III. Recursively enumerable languages are closed under
9991complementation
9992A.
9993B.
9994C.
9995D.
9996Answer:
9997Theory of Computation
99981327. Which of the above statement are TRUE?
9999A.
10000B.
10001C.
10002D.
10003Answer:
10004Theory of Computation
100051328. 6.Consider the following language
10006A. CFL but not regular
10007B. CSL but not CFL
10008C. regular
10009D. type 0 language but not type 1
10010Answer: b
10011Theory of Computation
100121329. L = {anbncndn|n ≥ 1}
10013A.
10014B.
10015C.
10016D.
10017Answer:
10018Theory of Computation
100191330. L is
10020A.
10021B.
10022C.
10023D.
10024Answer:
10025Theory of Computation
100261331. 7.Consider three decision problems P1, P2 and P3. It is known
10027that P1 is decidable and P2 is undecidable. Which one of the following is
10028TRUE?
10029A. P3 is decidable if P1 is reducible to P3
10030B. P3 is undecidable if P3 is reducible to P2
10031C. P3 is undecidable if P2 is reducible to P3
10032D. P3 is decidable if P3 is reducible to P2’s complement
10033Answer: c
10034Theory of Computation
100351332. 8.Which one is of the following is not decidable?
10036A. given a Turing machine M, a string s, and an integer k, M accepts s with k steps
10037B. equivalence of two given Turing machines
10038C. language accepted by a given DFSA is nonempty
10039D. language generated by a CFG is nonempty
10040Answer: b
10041Theory of Computation
100421333.
10043A.
10044B.
10045C.
10046D.
10047Answer:
10048Theory of Computation
100491334. 9.Which of the following instances of the post correspondence
10050problem has a viable sequence (a solution)?
10051A. {(b, bb), (bb, bab), (bab, abb), (abb, babb)}
10052B. {(ab, aba), (baa, aa), (aba, baa)}
10053C. {(ab, abb), (ba, aaa), (aa, a)}
10054D. none of the above
10055Answer: c
10056Theory of Computation
100571335. 10.Which one of the following grammar generates L = {ai bj ck|i ≠
10058k, i, j, k ≥ 1}
10059A. a. S → AC|CB
10060B. b. S → aS|aA
10061C. c. S → AB
10062D. d. S → AC|CB
10063Answer: a
10064Theory of Computation
100651336.
10066A. A → aA|a
10067B. A → bA|bB
10068C. A → aAb|ab
10069D. A → aA|ε
10070Answer:
10071Theory of Computation
100721337.
10073A. B → Bc|c
10074B. B → cB|c
10075C. B → bBc|bc
10076D. B → Bc|ε
10077Answer:
10078Theory of Computation
100791338.
10080A. C → aCc|bD|b
10081B.
10082C.
10083D. C → aCc|ε|bD
10084Answer:
10085Theory of Computation
100861339.
10087A. D → bD|b
10088B.
10089C.
10090D. D → bD|b|ε
10091Answer:
10092Theory of Computation
100931340.
10094A.
10095B.
10096C.
10097D.
10098Answer:
10099Theory of Computation
101001341. 11.Let S be a NP–complete problem and Q and R be two other
10101problems not known to be in NP. Q is polynomial time reducible to S and
10102S is polynomial time reducible to R. Which one of the following
10103statements is TRUE?
10104A. R is NP complete
10105B. R is NP hard
10106C. Q is NP complete
10107D. Q is NP hard
10108Answer: b
10109Theory of Computation
101101342.
10111A.
10112B.
10113C.
10114D.
10115Answer:
10116Theory of Computation
101171343. 12.Consider the following statements about the context-free
10118grammar G = {S → SS, S → ab, S → ba, S → c}
10119A. I only
10120B. I and III only
10121C. II and III only
10122D. I, II and III
10123Answer: b
10124Theory of Computation
101251344.
10126A.
10127B.
10128C.
10129D.
10130Answer:
10131Theory of Computation
101321345. I. G is ambiguous
10133A.
10134B.
10135C.
10136D.
10137Answer:
10138Theory of Computation
101391346. II. G produces all strings with equal number of a’s and b’s
10140A.
10141B.
10142C.
10143D.
10144Answer:
10145Theory of Computation
101461347. III. G can be accepted by a deterministic PDA
10147A.
10148B.
10149C.
10150D.
10151Answer:
10152Theory of Computation
101531348. 13.Which combination below expresses all the true statements
10154about G?
10155A.
10156B.
10157C.
10158D.
10159Answer:
10160Theory of Computation
101611349.
10162A.
10163B.
10164C.
10165D.
10166Answer:
10167Theory of Computation
101681350. Let Σ = {0, 1}, L1 = Σ* and L2 = {0n 1n|n ≥ 1} then the languages L1
10169∪ L2 and L2 are respectively
10170A. regular, regular
10171B. regular, not regular
10172C. not regular, regular
10173D. not regular, not regular
10174Answer: b
10175Theory of Computation
101761351.
10177A.
10178B.
10179C.
10180D.
10181Answer:
10182Theory of Computation
101831352. 14.Which of the following statements is false?
10184A. The halting problem for Turing machines is undecidable
10185B. determining whether a context-free grammar is ambiguous is un-decidable
10186C. given two arbitrary context-free grammar, G1 and G2, it is undecidable with L(G1) = L(G2)
10187D. given two regular grammars G1 and G2, it is undecidable whether L(G1) = L(G2)
10188Answer: d
10189Theory of Computation
101901353.
10191A.
10192B.
10193C.
10194D.
10195Answer:
10196Theory of Computation
101971354. 15.Define for a CFL L, init (L) = {u | uv ε L for some v ε {0, 1}*}. In
10198other words init (L) is the set of prefixes of L. Let L = {w|w ε {0, 1}+, w has
10199equal number of 0’s and 1’s}. Then init (L) is
10200A. the set of all binary strings with unequal number of 0’s and 1’s
10201B. the set of all binary stings including ε
10202C. the set of all binary strings with exactly one more 0 than the number of 1’s or one more 1
10203than the number of 0’s.
10204D. none of the above
10205Answer: b
10206Theory of Computation
102071355. 1. If the depth of a tree is 3 levels, then what is the Size of the
10208Tree?
10209A. 3
10210B. 4
10211C. 8
10212D. 12
10213Answer: C
10214ProgrammingFundamentals
102151356. A linked list index is ____ that represents the position of a node in
10216a linked list.
10217A. An Integer
10218B. A Variable
10219C. A character
10220D. A Boolean
10221Answer: A
10222ProgrammingFundamentals
102231357. 3. Which among the following can be solved using Divide-and-
10224Conquer strategies?
10225A. Merge Sort
10226B. Linear Search
10227C. Binary Search
10228D. Insertion sort
10229Answer: a,d
10230ProgrammingFundamentals
102311358. 4. What are the suitable operations of Priority Queues (Heaps)?
10232A. delMin
10233B. delAll
10234C. Insert
10235D. delLast
10236Answer: a,c
10237ProgrammingFundamentals
102381359. 5. Identify the storage type of variables whose lifetime begin with
10239the evaluation of a specific statement or expression and ends either at
10240an explicit deallocation statement or at program termination.
10241A. Static storage
10242B. Local storage
10243C. Dynamic Storage
10244D. PermanentStorage
10245Answer: c
10246ProgrammingFundamentals
102471360. 6. Which of the following are correct on int (*a)[35] ?
10248A. declares an array of 35 pointers to ints
10249B. declares a pointer to an array of 35 ints
10250C. such a proposition does not exist
10251D. 1 and 2
10252Answer: b
10253ProgrammingFundamentals
102541361. 7. What type of error will the following generate? Choose more
10255than one answer, if necessary. int *x;*x=100;
10256A. compilation error
10257B. logical error
10258C. no compilation error
10259D. no logical error
10260Answer: b,c
10261ProgrammingFundamentals
102621362. 8. Which among the following checks for an empty stack?
10263A. int isempty (stack *s) { if (s->top == 100) return 1; else return (0); }
10264B. int isempty (stack *top) {if (top == 0) return (1); else return (0);}
10265C. int isempty (stack *top) { if (top == NULL) return (1); Else return (0); }
10266D. All of the above
10267Answer: c
10268ProgrammingFundamentals
102691363. 9. Which of the following is true about a Binary Search Tree?
10270A. All the elements of the left subtree of x are < x
10271B. All the elements of the left subtree of x are > x
10272C. Both
10273D. None
10274Answer: a
10275ProgrammingFundamentals
102761364. 10. Which traversal algorithm uses recursion?
10277A. Breadth First Search
10278B. Depth First Search
10279C. Root First Search
10280D. Linear Search
10281Answer: a
10282ProgrammingFundamentals
102831365. 11. If a node in a data structure has multiple predecessors and
10284multiple successors, it is
10285A. Stack
10286B. Linked list
10287C. Tree
10288D. Graph
10289Answer: d
10290ProgrammingFundamentals
102911366. 12. Which data structure has applications in modeling city map,
10292social networks, state machines etc.,?
10293A. Tree
10294B. Graph
10295C. Binary Search Tree
10296D. Balanced Binary Search Tree
10297Answer: b
10298ProgrammingFundamentals
102991367. 13. Which among the following represents information of its
10300neighbours?
10301A. Adjacency List
10302B. Adjacency Node
10303C. Adjacency Matrix
10304D. All of the above
10305Answer: c
10306ProgrammingFundamentals
103071368. 14. State true or false:
10308A. A tree is a graph with cycles.
10309B. A graph is connected only if it has a spanning tree
10310C.
10311D.
10312Answer: a - false ; b - true
10313ProgrammingFundamentals
103141369. 15. Which of the following is a two-dimensional array?
10315A. array anarray[20][20];
10316B. int anarray[20][20];
10317C. int array[20, 20];
10318D. char array[20];
10319Answer: b
10320ProgrammingFundamentals
103211370. Backpropagation is the most popular neural network training
10322technique for many practical problems. The main reason is:
10323A. Since there are no hidden layers it converges faster than other techniques
10324B. Less computational expensive when compared to other supervised learning techniques
10325C. a and b
10326D. none of the above
10327Answer: b
10328Soft Computing
103291371. Which of the following closely associates artificial neural networks
10330and biological neural systems
10331A. Processing element receives many signals
10332B. Processing elements sums the weighted inputs
10333C. Fault tolerance
10334D. all the above
10335Answer: b
10336Soft Computing
103371372. Which of the following is false about fuzzy systems?
10338A. Fuzzy systems cannot be interpreted
10339B. Fuzzy systems always require expert knowledge
10340C. Fuzzy logic helps to make decisions from imprecise data
10341D. None of the above
10342Answer: d
10343Soft Computing
103441373. What learning rate should be used for backpropagation training?
10345A. Low learning rate (0.01-0.09) to ensure convergence
10346B. High learning rate (0.6-0.90) for faster convergence
10347C. Moderate learning rate (0.05-0.25) to ensure convergence and prevent oscillation
10348D. It could be decided only by a trial and error approach
10349Answer: d
10350Soft Computing
103511374. For a given problem which learning method could be the most
10352complicated to understand
10353A. Supervised learning
10354B. Unsupervised learning
10355C. All the above
10356D. Hybrid learning techniques
10357Answer: d
10358Soft Computing
103591375. Which of the following you would suggest as the best technique
10360for preconditioning the training data?
10361A. Normalize the data by dividing with a norm to make the Euclidian length of the vector
10362equal to 1.
10363B. Standardizing the data sets by subtracting a measure of location and dividing by a
10364measure of scale
10365C. Raw data is enough to train the network
10366D. There is no best technique that would perform for all problems
10367Answer: a
10368Soft Computing
103691376. Performance of neural networks for a particular application will
10370depend on
10371A. Architecture of the neural network
10372B. Learning algorithm
10373C. Initialization of weights
10374D. all the above
10375Answer: d
10376Soft Computing
103771377. A bias in a neural network is
10378A. A connection weight from a neuron with a constant activation value
10379B. A weight that can be learned like other weights
10380C. To improve learning and faster convergence
10381D. None of the above
10382Answer: c
10383Soft Computing
103841378. Compared to other optimization techniques an important feature
10385of evolutionary computation is
10386A. Possibility of hybridization with other techniques
10387B. Solution to difficult problems
10388C. Conceptual simplicity
10389D. Population based collective search
10390Answer: d
10391Soft Computing
103921379. Which coding is most suitable for representing a multi period job
10393scheduling problem using a simple genetic algorithm?
10394A. Binary encoding
10395B. Real value representation
10396C. Permutation encoding
10397D. None of the above
10398Answer: c
10399Soft Computing
104001380. The basic difference between genetic algorithm and evolutionary
10401programming is
10402A. Data representation
10403B. Reproduction operators
10404C. Selection methods
10405D. a and b
10406Answer: c
10407Soft Computing
104081381. Chose an application where evolutionary technique might not give
10409good results
10410A. Multi-objective optimization problem
10411B. Financial forecasting problem
10412C. Timetabling problem
10413D. none of the above
10414Answer: d
10415Soft Computing
104161382. Given the language L = {ab, aa, baa}, which of the following strings
10417are in L*?
10418A. abaabaaabaa, aaaabaaaa, baaaaabaaaab
10419B. aaaabaaaa, baaaaabaaaab, baaaaabaa
10420C. abaabaaabaa, aaaabaaaa, baaaaabaa
10421D. abaabaaabaa, baaaaabaa, abaabaaabaa
10422Answer: abaabaaabaa, aaaabaaaa, baaaaabaa
10423Theory of Computation
104241383. Given an arbitrary non-deterministic finite automaton (NFA). with N
10425states, the maximum number of states in an equivalent minimized DFA is
10426at least.
10427A. N^2
10428B. 2^N
10429C. 2N
10430D. N!
10431Answer: 2^N
10432Theory of Computation
104331384. Definition of a language L with alphabet {a} is given as following.
10434L= { a^nk | k > 0, and n is a positive integer constant} What is the
10435minimum number of states needed in a DFA to recognize L?
10436A. k+1
10437B. n+1
10438C. 2^n+1
10439D. 2^k+1
10440Answer: n+1
10441Theory of Computation
104421385. The lexical analysis for a modern language such as Java needs the
10443power of which one of the following machine models in a necessary and
10444sufficient sense?
10445A. Finite state automata
10446B. Deterministic pushdown automata
10447C. Non-deterministic pushdown automata
10448D. Turing machine
10449Answer: Finite state automata
10450Theory of Computation
104511386. Finite automata recognizes --------grammars
10452A. type-1
10453B. type-2
10454C. type-3
10455D. type-0
10456Answer: type-3
10457Theory of Computation
104581387. Consider the following two statements: S1: { 0^2n | n >= l} is a
10459regu1ar language} S2: { 0^m 0^n 0^(m+n) | m >= 1 and n >= 2} is a
10460regu1ar language Which of the following statements is correct?
10461A. Only S1 is correct
10462B. Only S2 is correct
10463C. Both S1 and S2 are correct
10464D. None of S1 and S2 is correct
10465Answer: Both S1 and S2 are correct
10466Theory of Computation
104671388. A minimum state DFA accepting the language L={w/w belongs
10468{0,1}*} number of 0s and 1s in w are divisible by 3 and 5, respectively}
10469has
10470A. 15 states
10471B. 7 states
10472C. 9 states
10473D. 8 states
10474Answer: 15 states
10475Theory of Computation
104761389. The number of states in DFA is --------than the number of states in
10477NFA for the same Language.
10478A. Greater
10479B. less
10480C. greater equal
10481D. equal
10482Answer: Greater
10483Theory of Computation
104841390. Which of the following statement is true?
10485A. NFA is more powerful than DFA
10486B. DFA is more powerful than NFA
10487C. NFA and DFA have equal power
10488D. All the are true
10489Answer: NFA and DFA have equal power
10490Theory of Computation
104911391. Let L = {Epsilon} (i.e., L consist the empty string only). Then L^+ =?
10492A. L^+ = { }
10493B. L^+ = {Epsilon }
10494C. can not be defined
10495D. none of them
10496Answer: L^+ = { }
10497Theory of Computation
104981392. Finite automata --------------- memory
10499A. No auxiliary memory
10500B. Finite
10501C. Infinite
10502D. none
10503Answer: No auxiliary memory
10504Theory of Computation
105051393. The recognizing capabilities of NDFSM and DFSM
10506A. may be different
10507B. must be different
10508C. must be same
10509D. none of the above
10510Answer: must be same
10511Theory of Computation
105121394. When a state in a FA has self loop its regular expression will have -
10513------------
10514A. dot
10515B. star
10516C. binary+
10517D. uniary +
10518Answer: star
10519Theory of Computation
105201395. When there are infinite distinguishable strings then there cannot
10521be a -------------
10522A. automata
10523B. finite automata
10524C. regular expression
10525D. both finite automata and regular expression
10526Answer: both finite automata and regular expression
10527Theory of Computation
105281396. A NFA converted to DFA has more than one final state.
10529A. TRUE
10530B. FALSE
10531C. may be true
10532D. always true
10533Answer: may be true
10534Theory of Computation
105351397. The basic limitation of FSM is that
10536A. it sometimes fails to recognize grammars that are regular
10537B. it sometimes recognized grammars that are not regular
10538C. it cannot remember arbitrary large amounts of information
10539D. all of the comments are true
10540Answer: it cannot remember arbitrary large amounts of information
10541Theory of Computation
105421398. If M1 machine recognizing L with n states, then M2 recognizing L*
10543constructed Using Thompson construction will have ------------- states.
10544A. n
10545B. n+1
10546C. n+2
10547D. n-1
10548Answer: n+2
10549Theory of Computation
105501399. Which of the following is a variation of Frequency Division
10551Multiplexing (FDM) ?
10552A. TDM
10553B. PCM
10554C. WDM
10555D. None of these
10556Answer: C
10557Computer Networks
105581400. Switch is a Device of _________ Layer of OSI Model.
10559A. Network Layer
10560B. Data Link Layer
10561C. Application Layer
10562D. Session Layer
10563Answer: B
10564Computer Networks
105651401. Star Topology is Based On a Central Device that can be
10566__________ ?
10567A. HUB
10568B. Switch
10569C. Only A
10570D. Both A and B
10571Answer: A
10572Computer Networks
105731402. TCP/IP is also well known as _______.
10574A. OSI Model
10575B. TCP Model
10576C. DOD Model
10577D. Network Model
10578Answer: C
10579Computer Networks
105801403. Which layer functions as liaison between user support layers and
10581network support layers ?
10582A. network layer
10583B. physical layer
10584C. transport layer
10585D. session layer
10586Answer: C
10587Computer Networks
105881404. Which protocol works at the Transport layer and provides virtual
10589circuits between hosts?
10590A. IP
10591B. ARP
10592C. TCP
10593D. UDP
10594Answer: C
10595Computer Networks
105961405. Radio communication frequencies ranges from?
10597A. 3 KHz to 300 KHz
10598B. 3 KHz to 300 GHz
10599C. 300 KHz to 3 GHz
10600D. 3 KHz to 3,000 GHz
10601Answer: B
10602Computer Networks
106031406. What is the main function of transport layer ?
10604A. node to node delivery
10605B. process to process message delivery
10606C. synchronization
10607D. updating and maintenance of routing tables
10608Answer: B
10609Computer Networks
106101407. To deliver a message to the correct application program running
10611on a host, the .... address must be consulted ?
10612A. port
10613B. physical
10614C. IP
10615D. None
10616Answer: A
10617Computer Networks
106181408. ATM (Asynchronous Transfer Mode) is fundamentally a.......
10619technology?
10620A. Circuit switching
10621B. Packet switching
10622C. Narrow band
10623D. None of these
10624Answer: B
10625Computer Networks
106261409. _________ have a single communication channel that is shared by
10627all the users on the network. ?
10628A. Point-to-Point
10629B. Broadcast Network
10630C. Protocol
10631D. PAN
10632Answer: B
10633Computer Networks
106341410. Which of the following is required to communicate between two
10635computers?
10636A. communications software
10637B. protocol
10638C. communication hardware
10639D. all of above including access to transmission medium
10640Answer: D
10641Computer Networks
106421411. Which of the following transmission systems provide the highest
10643data rate to in individual device?
10644A. computer bus
10645B. telephone lines
10646C. voice and mode
10647D. lease lines
10648Answer: A
10649Computer Networks
106501412. Communication circuits that transmit data in both directions but
10651not at the same time are operating in
10652A. simplex mode
10653B. half duplex mode
10654C. a full duplex mode
10655D. an asynchronous mode
10656Answer: B
10657Computer Networks
106581413. A protocol is a set of rules governing a time sequence of events
10659that must take place ?
10660A. between peers
10661B. between an interface
10662C. between modems
10663D. across an interface
10664Answer: A
10665Computer Networks
106661414. The variability of memory access time can be increased by
10667A. CPU
10668B. Main memory
10669C. Cache memory
10670D. none
10671Answer: C
10672Embedded Systems
106731415. Identify the true statement
10674A. SRAM is faster than DRAM
10675B. SRAM consumes less power than DRAMS
10676C. RAM values must be periodically refreshed
10677D. none
10678Answer: A
10679Embedded Systems
106801416. Pick out the traits of embedded system
10681A. power constrained
10682B. highly reliable
10683C. diversified processors and OS
10684D. cost insensitive
10685Answer: A,B,C
10686Embedded Systems
106871417. Which of the following below are examples of peripherals?
10688A. USB
10689B. Networks
10690C. Timers
10691D. All the above
10692Answer: C
10693Embedded Systems
106941418. Pick out an example for peripheral from the following?
10695A. Peripherals
10696B. Processors
10697C. OS
10698D. Microcontrollers
10699Answer: A
10700Embedded Systems
107011419. Which is/are the most commonly used debugging tool(s) for
10702application code?
10703A. Simulator
10704B. Emulator
10705C. Both a and b
10706D. JUnit
10707Answer: C
10708Embedded Systems
107091420. With ----------- interrupts, the address of the ISR is provided by the
10710peripheral to reduce the latency
10711A. Strobe
10712B. Vectored
10713C. handshake
10714D. fixed
10715Answer: B
10716Embedded Systems
107171421. Which of the following serial protocol is used in automotive
10718industry?
10719A. USB
10720B. SPI
10721C. I2C
10722D. CAN
10723Answer: D
10724Embedded Systems
107251422. Which are the add-on features of ARM over RISC?
10726A. Barrel Shifter
10727B. Auto inc and dec instructions
10728C. Load / Store Multiple data and instruction bytes
10729D. All the above
10730Answer: D
10731Embedded Systems
107321423. A context switch involves
10733A. Saving the address space of a process
10734B. Switching between two different processes
10735C. Saving the registers of a process
10736D. All of the above
10737Answer: D
10738Embedded Systems
107391424. Which of the following can cause a negative instruction-cache
10740effect?
10741A. Function in-lining
10742B. Aligned/packed data structures
10743C. Induction variables
10744D. Deadcode elimination
10745Answer: A
10746Embedded Systems
107471425. Real-Time systems
10748A. must be embedded
10749B. respond to external events in a timely fashion
10750C. can never tolerate missed deadlines
10751D. require a kernel
10752Answer: B
10753Embedded Systems
107541426. An automated teller machine would be classified as what type of
10755real-time system:
10756A. soft
10757B. hard
10758C. medium
10759D. none
10760Answer: A
10761Embedded Systems
107621427. Response time is the total time:
10763A. it takes to convert analog to digital in a digital display thermometer
10764B. it takes to resolve a number flight simulation game
10765C. between seeing a stimulus and finally acting according to that stimulus
10766D. a processor is utilized
10767Answer: C
10768Embedded Systems
107691428. In non-preemptive scheduling, release of the CPU is determined
10770by the kernel:
10771A. TRUE
10772B. FALSE
10773C.
10774D.
10775Answer: B
10776Embedded Systems
107771429. Which of the following is a correct comment?
10778A. */ Comments */
10779B. ** Comment **
10780C. /* Comment */
10781D. { Comment }
10782Answer: /* Comment */
10783Object Oriented Paradigm
107841430. What punctuation ends most lines of C++ code?
10785A. . (dot)
10786B. ; (semi-colon)
10787C. : (colon)
10788D. ' (single quote)
10789Answer: ; (semi-colon)
10790Object Oriented Paradigm
107911431. What punctuation is used to signal the beginning and end of code
10792blocks in C?
10793A. { }
10794B. -> and <-
10795C. BEGIN and END
10796D. ( and )
10797Answer: { }
10798Object Oriented Paradigm
107991432. Which of the following can not be used as identifiers?
10800A. Letters
10801B. Digits
10802C. Underscores
10803D. Spaces
10804Answer: Spaces
10805Object Oriented Paradigm
108061433. What is the only function all C++ programs must contain?
10807A. start()
10808B. system()
10809C. main()
10810D. program()
10811Answer: main()
10812Object Oriented Paradigm
108131434. Which of the following is not a correct variable type?
10814A. float
10815B. real
10816C. int
10817D. double
10818Answer: real
10819Object Oriented Paradigm
108201435. By default fields in a C++ class are
10821A. Public
10822B. Private
10823C. void
10824D. Protected
10825Answer: Private
10826Object Oriented Paradigm
108271436. The difference between x and ‘x’ is
10828A. The first one refers to a variable whose identifier is x and the second one refers to the
10829character constant x
10830B. The first one is a character constant x and second one is the string literal x
10831C. Both are same
10832D. None of these
10833Answer: The first one refers to a variable whose identifier is x and
10834the second one refers to the character constant x
10835Object Oriented Paradigm
108361437. The directives for the preprocessors begin with
10837A. Ampersand symbol (&)
10838B. Two Slashes (//)
10839C. Number Sign (#)
10840D. Less than symbol (<)
10841Answer: Number Sign (#)
10842Object Oriented Paradigm
108431438. The while loop is referred to as a _____ loop because the loop
10844condition is tested at the beginning of the loop
10845A. beginning
10846B. pretest
10847C. priming
10848D. initial
10849Answer: pretest
10850Object Oriented Paradigm
108511439. Which of the following calls a function named displayName,
10852passing it no actual arguments?
10853A. displayName();
10854B. displayName;
10855C. call displayName ();
10856D. call displayName;
10857Answer: displayName();
10858Object Oriented Paradigm
108591440. Two access specifiers in C++ are
10860A. int and double
10861B. public and private
10862C. void and free
10863D. formal and informal
10864Answer: public and private
10865Object Oriented Paradigm
108661441. The last statement in a function is often a _____
10867A. finish
10868B. return
10869C. goodbye
10870D. endfunction
10871Answer: return
10872Object Oriented Paradigm
108731442. Which of the following is an access specifier?
10874A. protected
10875B. safe
10876C. particular
10877D. shielded
10878Answer: protected
10879Object Oriented Paradigm
108801443. Which of the following is the correct order of evaluation for the
10881expression? z = x + y * z / 4 % 2 - 1
10882A. * % / - + =
10883B. / * % - + =
10884C. * / % + - =
10885D. = * / % + -
10886Answer: * / % + - =
10887Object Oriented Paradigm
108881444. The translator used by second generation language is?
10889A. compiler
10890B. interpreter
10891C. assembler
10892D. linker
10893Answer: C
10894Programming language translator
108951445. The first Indian analog computer was implemented by Indian
10896stastical Institute of Culcutta in
10897A. 1947
10898B. 1956
10899C. 1953
10900D. 1961
10901Answer: C
10902Programming language translator
109031446. Analysis which determines the meaning of a statement once its
10904grammatical structure becomes known is termed as
10905A. Semantic analysis
10906B. Syntax analysis
10907C. Lexical analysis
10908D. General analysis
10909Answer: A
10910Programming language translator
109111447. Symbolic names can be associated with
10912A. Information
10913B. data or instruction
10914C. operand
10915D. mnemonic operation
10916Answer: B
10917Programming language translator
109181448. Any given transition graph has equivalent
10919A. Regular Expression
10920B. DFSM
10921C. NFSM
10922D. All of the above
10923Answer: D
10924Programming language translator
109251449. Which sentence can be generated by S-->aS | bA ,A->d | ccA
10926A. bccddd
10927B. abbbd
10928C. aabccd
10929D. ababccd
10930Answer: C
10931Programming language translator
109321450. A shift reduce parser carries out the actions specified within
10933braces immediately after redicing with the corresponding rule of
10934grammar S-->xxW { print “1”} S-->y { print “2” } S-->Sz { print “3” } What
10935is the translation of xxxxyzz using the SDT scheme described by the
10936above rules
10937A. 23131
10938B. 11233
10939C. 11231
10940D. 33211
10941Answer: A
10942Programming language translator
109431451. Which of the following is the most powerful parsing method?
10944A. LL(1)
10945B. CLR
10946C. SLR
10947D. LALR
10948Answer: B
10949Programming language translator
109501452. Consider a program P that consists of two source modules M1
10951and M2 contained in two different files. If M1 contains a reference to a
10952function defined in M2 the reference will be resolved at
10953A. Edit time
10954B. Compile time
10955C. Link time
10956D. Load time
10957Answer: C
10958Programming language translator
109591453. A basic block can be analyzed by
10960A. Flow graph
10961B. A graph with cycles
10962C. DAG
10963D. All of the above
10964Answer: C
10965Programming language translator
109661454. Access time is minimum for accessing the symbol table which
10967uses
10968A. Search tree
10969B. Hash table
10970C. List
10971D. Stack
10972Answer: B
10973Programming language translator
109741455. Replacement of an expensive operation by a cheaper one is
10975termed as
10976A. reduction in strength
10977B. code motion
10978C. loop-in variant computation
10979D. None
10980Answer: C
10981Programming language translator
109821456. Consider the C code fragment prometheus( ) { int x, *p=&x; }
10983Above code has the problem that is called
10984A. Dead variable
10985B. Dead assignment
10986C. Pointer aliasing
10987D. Illegal use of pointer
10988Answer: C
10989Programming language translator
109901457. Consider the following statements S1:In dominator tree, in which
10991the initial node is the root ,and each node d Dominates only its
10992ancestors in the tree S2: In terms of the dom relations, the immediate m
10993has the property that if d! =n and d dom m Choose the correct option
10994A. S1 and S2 true
10995B. S1 true
10996C. S2 true
10997D. None
10998Answer: C
10999Programming language translator
110001458. Consider the following statement if(exp) statement 1 else
11001statement 2 Which one of the following describe the above statement
11002A. Redgular grammar
11003B. Context free grammar
11004C. Both A and B
11005D. Context sensitive grammar
11006Answer: B
11007Programming language translator
110081459. A __________ is anything that can cause harm
11009A. Vulnerability
11010B. phish
11011C. threat
11012D. spoof
11013Answer: C
11014Information Security
110151460. In the right setting a thief will steal your information by simply
11016watching what you type
11017A. snagging
11018B. spying
11019C. social engineering
11020D. shoulder surfing
11021Answer: D
11022Information Security
110231461. A __________ is a small program embedded inside of a GIF image.
11024A. web bug
11025B. cookie
11026C. spyware application
11027D. spam
11028Answer: A
11029Information Security
110301462. A hacker contacts you my phone or email and attempts to acquire
11031your password.
11032A. spoofing
11033B. phishing
11034C. spamming
11035D. bugging
11036Answer: B
11037Information Security
110381463. This power protection device includes a battery that provides a
11039few minutes of power.
11040A. surge suppressor
11041B. line conditioner
11042C. generator
11043D. UPS
11044Answer: D
11045Information Security
110461464. The phrase __________ describes viruses worms Trojan horse
11047attack applets and attack scripts.
11048A. malware
11049B. spam
11050C. phish
11051D. virus
11052Answer: A
11053Information Security
110541465. A hacker that changes or forges information in an electronic
11055resource is engaging in __________.
11056A. denial of service
11057B. sniffing
11058C. terrorism
11059D. data diddling
11060Answer: D
11061Information Security
110621466. Hackers often gain entry to a network be pretending to be at a
11063legitimate computer.
11064A. spoofing
11065B. forging
11066C. IP spoofing
11067D. ID theft
11068Answer: C
11069Information Security
110701467. The __________ of a threat measures its potential impact on a
11071system.
11072A. vulnerabilities
11073B. countermeasures
11074C. degree of harm
11075D. susceptibility
11076Answer: C
11077Information Security
110781468. The power level drops below 120V.
11079A. brownout
11080B. spike
11081C. blackout
11082D. surge
11083Answer: B
11084Information Security
110851469. __________cookies are also known as transient cookies.
11086A. Third-party
11087B. First-party
11088C. Session
11089D. Persistent
11090Answer: C
11091Information Security
110921470. Which of the following will not protect you from spam?
11093A. spam blockers
11094B. e-mail rules
11095C. popup blocker
11096D. filters
11097Answer: C
11098Information Security
110991471. A __________s main purpose is to prohibit unauthorized access to
11100your computer via the Internet.
11101A. popup blocker
11102B. firewall
11103C. spyware blocker
11104D. spam assassin
11105Answer: B
11106Information Security
111071472. To read the system messages and warnings access the
11108__________ in Windows.
11109A. system manager
11110B. control panel
11111C. event viewer
11112D. message screen
11113Answer: C
11114Information Security
111151473. Before discarding a financial document you should __________.
11116A. copy it
11117B. shred it
11118C. file it
11119D. post it
11120Answer: B
11121Information Security
11122Scripted with at  Sir C V Raman Block