FAvD6KV0

11.
2Build & Fix Model is suitable for programming exercises of ___________ LOC (Line of Code)
3ANS:100/200 lines
4
52.Entity Set
6An ________ is a set of entities of the same type that share the same properties, or attributes .
7
83.
9Predict the output of following C++ program
10#include
11using namespace std;
12
13class Empty {};
14
15int main()
16{
17 cout << sizeof(Empty);
18 return 0;
19}
20//output :1
21Sizeof(empty)+non zero value
224. One operation that is not given by magnitude comparator.
23Ans-magnitude doesn’t add
245. Round robin scheduling is essentially the preemptive version of ________ ?
25Ans- FIFO
266. A page fault occurs ?
27ANS:-when page is not found in the memory.
287. RAD stands for _______
29Ans:-Rapid Application Development
308. Which of the following is true?
319. Adding 1001 and 0010 gives output of
32Ans:- 1011
3310. Entity is a ___________________
34 Ans:- Thing in real world
3511. _____model is suitable for software development ,when the requirements are well defined
36Ans:-WaterFall/Sequential/Stepbystep model
3712. Which of the following will determine your choice of systems software for your computer?
381Is the applications software you want to use compatible with it ?
392 Is it expensive ?
403 Is it compatible with your hardware ?
414 Both 1 and 3
42ANS:-Both 1 and 3
4313. The descriptive property possessed by each entity set is _________ .
44ANS:-Attribute
4514.predict the output of following program.
46#include
47using namespace std;
48class A
49{
50protected:
51 int x;
52public:
53 A() {x = 0;}
54 friend void show();
55};
56class B: public A
57{
58public:
59 B() : y (0) {}
60private:
61 int y;
62};
63void show()
64{
65 A a;
66 B b;
67 cout << "The default value of A::x = " << a.x << " ";
68 cout << "The default value of B::y = " << b.y;
69}
70Compiler Error in show() because y is private in class b
7115. Magnitude comparator compares using operation of
72ANS:- 1 circuit
7316 What is a shell ?
74ANS:- command interpreter
7517. The function that an entity plays in a relationship is called that entity’s _____________.
76ANS:-ROLE
7718. A Boolean function may be transformed into
78ANS:- logical diagram
7919. Operator overloading is
8020. _______________ refers to user interface prototype
8121. A ____________is a more complete elaboration of a single subsystem or function
82ANS:-VERTICAL PROTOTYPE
8322. Inheritance is a way to
84ANS:-inheritance
8523. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main
86program is loaded into memory & is executed. This type of loading is called... ?
87ANS:-Dynamic linking
8824. The attribute name could be structured as a attribute consisting of first name, middle initial, and last name .
89This type of attribute is called _______________
90ANS:-composite
9125. Is it possible to find two algebraic expressions that specify same function
92ANS:-YES
9329 _______________refers to the creation of a model that will eventually be discarded rather than becoming part
94of the final delivered software.
95ANS:-Throwaway or rapid prototype
9630. The attribute AGE is calculated from DATE_OF_BIRTH . The attribute AGE is ________________
97ANS_ DERIVED
9831. A memory buffer used to accommodate a speed differential is called
99ANS:-CACHE
10032. Not applicable condition can be represented in relation entry as
101ANS:-NULL
10233. X=1010100 and Y=1000011 using 2's complement X-Y is
103ANS:-10001
10434. Runtime polymorphism can be achieved by
105ANS:-Virtual function
10635. ________ acknowledges that we do not understand all the requirements and builds only those that are well
107understood
108ANS:-Evolutionary prototyping
10936. X=1010100 and Y=1000011 using 1's complement Y-X is
110ANS:- -10001
11137. The use of constructor is
112ANS:-CREATE OBJECT
11338. Which one of the following is the address generated by CPU?
114ANS:- LOGICAL ADDRESS
11539. _________ provides a broad view of an entire system or subsystem, focusing on user interaction more than
116low-level system functionality, such as database access.
117ANS:- Horizontal prototype
11840. Which of the following can be a multivalued attribute ?
119ANS:-Phone number
12041. Table that is not a part of asynchronous analysis procedure
121ANS:-excitation table
12242. In object orient programming classes are useful because they
12343. Which of the following is a single valued attribute
124ANS:-REG.NO
12544. Run time mapping from virtual to physical address is done by:
126ANS:- Memory management
12745. _______________clarifies complex requirements by drilling down to actual system functionality.
128ANS:-Vertical Prototype
12946. Memory management technique in which system stores and retrieves data from secondary storage for use in
130main memory is called:
131ANS:-Paging
13247. What is the output of the program
133#include<iostream.h>
134void main()
135{
136 int n=1;
137 cout<<endl<<"The numbers are;"<<endl;
138 do
139 {
140cout <<n<<"\t";
141n++;
142 } while (n<=100);
143 cout <<endl;
144}
145ANS:-Natural numbers 1 to 100.
14648. _______________ can be suited to projects where requirements and scope are fixed, the product itself is firm
147and stable, and the technology is clearly understood
148ANS:-Waterfall
14949. In a relation between the entities the type and condition of the relation should be specified . That is called
150as______attribute
151ANS:-Descriptive
15250.. Shift registers are used for
153ANS:- Shifting and rotating
15451. In the __________ normal form, a composite attribute is converted to individual attributes.
155ANS:- 1NF
15652. Two variables will be represented by
157ANS:-four minterms
15853. cout stands for
159ANS:-Console Output/Character output
16054. The address of a page table in memory is pointed by:
161ANS:-Stack Pointer
16255. _______ acknowledge the programmatic need for milestones, for keeping a project on track, but encourage
163iterations
164ANS:-RATIONAL UNIFIED PROCESS(RUP)
16556.#include <iostream>
166using namespace std;
167int main ()
168{
169cout << (3 > 4 && 3 > 1) << endl;
170return 0;
171}
172ANS:- 0
17357. Adjacent squares represents a
174ANS:-Literals
17558. ______ describes the spiral model as a "process model generator", where choices based on a project's risks
176generate an appropriate process model for the project.
177ANS:-unique risk patterns
17859. A table on the many side of a one to many or many to many relationship must:
179ANS:-have a composite key
18060. Program always deals with:
181ANS:-LOGICAL ADDRESS
18261. Tables in second normal form (2NF):
183ANS:-Eliminate hidden dependencies
18462. Eight minterms will be used for
185ANS:- 3 Variables
18663. What will be the output of the this program?
187#include <iostream>
188using namespace std;
189int main ()
190{
191 int array[] = {0, 2, 4, 6, 7, 5, 3};
192int n, result = 0;
193for (n = 0 ;n < 5 ;n++)
194{
195result += billy[n];
196}
197cout << result;
198return 0;
199}
200ANS:- NONE of the above
20164. _____ is an agile software development technique in which two programmers work together at one
202workstation
203ANS:-Pair Programming
20465The page table contains:
205ANS:-Base address of each page in memory
20666. What is the output of this program?
207#include <iostream>
208using namespace std;
209int main()
210{
211 int arr[] = {4, 5, 6, 7};
212int *p = (arr + 1);
213cout << *p;
214return 0;
215}
216ANS:- 5
21767. Functional Dependencies are the types of constraints that are based on______
218ANS:-KEY
21968. What is compaction?
220ANS:-
22169. ______ is often used for risk management when an exceptional risk that, though unlikely, would have
222catastrophic consequences.
223ANS:-Contingency plan
22470. Minterms are arranged in map in a sequence of gray code
225ANS:- Gray code
22671. Operating System maintains the page table for:
227ANS:-Each Process
22872The ______________ is a software development process intended to produce software with a certifiabe level of
229reliability.
230ANS:-Cleanroom software engineering
23173. Which is a bottom-up approach to database design that design by examining the relationship between
232attributes:
233ANS:-Normalization
23474. A circuit that converts n inputs to 2^n outputs is called
235ANS:- DECODER
23675. Which constructor will initialize the base class data member?
237ANS:-BASE Class
23876. The _______ is an iterative software development process framework created by the Rational Software
239Corporation
240ANS:-RUP
24177. Which forms simplifies and ensures that there is minimal data aggregates and repetitive groups:
242ANS:- 3NF
24378. When overloading unary operators using Friend function, it requires_____ argument/s.
244ANS:- ONE
24579. The operating system is :
246ANS: Interface between user program and hardware
24780. Encoders are made by three
248ANS:-OR-GATE
24981. What is difference between protected and private access specifiers in inheritance?
250ANS:-Private methods are usually visible to class instances (internal implementations),protected methods are
251visible to subclasses and classes in the same package
25282. The primary objective of _____________ is to scope the system adequately as a basis for validating initial
253costing and budgets.
254ANS:-RUP
25583. In contiguous memory allocation :
256ANS:-each process is contained in a single contiguous section of memory
25784. Decoder is a
258ANS:-Combinational circuit
25985. Which forms are based on the concept of functional dependency
260ANS:- 3NF
26186. The relocation register helps in :
262ANS:-Protect address space
26387. Which of the following is incorrect statement about packages?
264ANS:-
26588. BCD to seven segment is a
266ANS:-DECoder
26789. The RUP has determined a project life-cycle consisting of____ phases.
268ANS:- 4Phases
26990. Empdt1(empcode, name, street, city, state,pincode).
270For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode.
271In normalization terms, empdt1 is a relation in
272ANS:-2NF and 1NF
27391. One that is not type of flip-flop is
274ANS:- UT
27592. A relational database consists of a collection of
276ANS:-TABLES
27793. With relocation and limit registers, each logical address must be _______ the limit register.
278ANS:-Less than
27994. The primary objective of________ phase is to mitigate the key risk items identified by analysis up to the end
280of this phase.
281ANS:-Elaboration phase
28295. Which two are valid constructors for Thread?
283ANS:- 1and 2
284Thread(Runnable r, String name)
285Thread()
286Thread(int priority)
287Thread(Runnable r, ThreadGroup g)
288Thread(Runnable r, int priority)
28996. class X implements Runnable
290{
291 public static void main(String args[])
292 {
293 /* Missing code? */
294 }
295 public void run() {}
296}
297Which of the following line of code is suitable to start a thread ?
298ANS:- x run-new x();
299Run;
300t.start();
301new Thread(new
302MyRunnable()).start
303()
30497. A ________ in a table represents a relationship among a set of values.
305ANS:-ROW
30698. The operating system and the other processes are protected from being modified by an already running
307process because :
308ANS:-every address generated by the CPU is being checked against the relocation and limit registers
30999. Traditional software development approach is based on___
310ANS:-
311100. Flip-flops can be constructed with two
312ANS:- 2NAND
313101.
3141. RS flip-flops are also called GATED SR FLIP-FLOP
315102.
316Assume the following method is properly synchronized and called from a thread A on an object B:
317wait(2000);
318After calling this method, when will the thread A become a candidate to get another turn at the CPU?
319AFTER A IS NOTIFIED OR AFTER 2 SEC
320103.
321The term _______ is used to refer to a row.
322A:TUPLE
323104.
324______ uses same language to talk about analysis,design,programming and database design
325ANS:Object oriented approach
326105.
327In fixed sized partition, the degree of multiprogramming is bounded by THE NUMBER OF POSITIONS
328106.
329UA/UML is an approach to software development that allows us to create objects that represent tangible
330elements of the business independent of how they are represented to the user through an interface or physically
331stored in a database.
332107. Decimal digit in BCD can be represented by 4 INPUT LINE
333108.
334The first fit, best fit and worst fit are strategies to select a _partition selction policy
335FREE HOLE FROM A SET OF AVAILABLE HOLES
336109.
337Which class or interface defines the wait(), notify() and notifyAll() methods? OBJECT
338110.
339The term attribute refers to a ___________ of a table.
340ans:COLUMN
341111.
342For each attribute of a relation, there is a set of permitted values, called the DOMAIN of that attribute.
343112.
344ANALYSIS prototype is an aid for exploring the problem domain
345113.
346. In BCD no. 1010 has NO MEANING
347114.
348A solution to the problem of external fragmentation is :COMPACTION
349115.
350public class MyRunnable implements Runnable
351{
352 public void run()
353 {
354 // some code here
355 }
356}
357which of these will create and start this thread?
358newthread(new myrunnable()).start();
359116.
360Database SCHEMA,INSTANCE, which is the logical design of the database
361117.
362Another solution to the problem of external fragmentation problem is to :
363PERMIT THE LOGICAL ADDRESS SPACE TO BE NC
364118.
365VALIDATION is the task of predicting correspondence
366119.
367OR TERMS To perform product of maxterms Boolean function must be brought into
368120.
369What will be the output of the sample code?
370public class Foo
371{
372 public static void main(String[] args)
373 {
374 try
375 {
376 return;
377 }
378 finally
379 {
380 System.out.println( "Finally" );
381 }
382 }
383}
384FINALLY
385121.
386What will be the output of the sample program?
387try
388{
389 int x = 0;
390 int y = 5 / x;
391}
392catch (Exception e)
393{
394 System.out.println("Exception");
395}
396catch (ArithmeticException ae)
397{
398 System.out.println(" Arithmetic Exception");
399}
400System.out.println("finished");
401COMPILATION FAILS
402122. In excitation table of D flipflop next state is equal to D STATE
403123.
404VERIFICATION is the process of determining correctness.
405124.
406Database INSTANCE ,which is a snapshot of the data in the database at a given instant in time
407125.
408If relocation is static and is done at assembly or load time, compaction CANT BE DONE
409126.
410A domain is atomic if elements of the domain are considered to be INDIVISIBLE units.
411127.
412What will be the output of the sample program?
413public class X
414{
415 public static void main(String [] args)
416 {
417 try
418 {
419 badMethod();
420 System.out.print("A");
421 }
422 catch (Exception ex)
423 {
424 System.out.print("B");
425 }
426 finally
427 {
428 System.out.print("C");
429 }
430 System.out.print("D"); 
431 }
432 public static void badMethod()
433 {
434 throw new Error();
435 }
436}
437C IS PRINTED BEFORE EXIT WITH ERROR MESSAGE
438128.
439The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one
440large hole of available memory is :COST
441129.
442RAD approach to systems development rapidly develops software to quickly and incrementally implement the
443design by using tools such as CASE.
444130. x+y=z represents operation that is OR GATE
445131.
446External fragmentation will not occur when : no matter which algorithm is used, it will always occur
447132.
448Objects are grouped into CLASS
449133.
450The tuples of the relations can be of ANY order.
451134.
452What is the result of compiling and running this program?
453class Mammal{
454 void eat(Mammal m){
455 System.out.println("Mammal eats food");
456 }
457}
458class Cattle extends Mammal{
459 void eat(Cattle c){
460 System.out.println("Cattle eats hay");
461 }
462}
463class Horse extends Cattle{
464 void eat(Horse h){
465 System.out.println("Horse eats hay");
466 }
467}
468public class Test{
469 public static void main(String[] args){
470 Mammal h = new Horse();
471 Cattle c = new Horse();
472 c.eat(h);
473 }
474} MAMMAL EATS FOOD
475135.
4761. Design procedure of combinational circuit involves 6 STEPS
477136.
478HORIZONTAL prototype is a simulation of the user interface
479137.
480Sometimes the overhead of keeping track of a hole might be :LARGER THAN THE HOLE
481138.
482class X, class Y and class Z are derived from class BASE. This is HIERARCHIAL inheritance
483139.
484Which one of the following is a set of one or more attributes taken collectively to uniquely identify a record?
485SUPER KEY
486140.
4871. In design procedure input output values are assigned with LETTER SYMBOLS
488141.
489When the memory allocated to a process is slightly larger than the process, then : INTERNAL FRAGMENT
490142 Component based development is an industrialized approach to software development
491143.
492The derivation of Child class from Base class is indicated by : symbol.
493144.
494 Output of AND gates in SOP is connected to OR GATE
495145.
496Consider attributes ID , CITY and NAME . Which one of this can be considered as a super key ? ID
497146.
498Mod-6 and mod-12 counters are most commonly used in DIGITAL CLOCK
499147.
500During a class inheritance in CPP, if the visibility mode or mode of derivation is not provided, then by default
501visibility mode is PRIVATE
502148.
503Because of virtual memory, the memory can be shared among: PROCESSES
504149.
505The subset of super key is a candidate key under what condition ?
506NO SUBSET IS A SUPER KEY
507150.
508MVC stands for MODEL VIEW CONTROLLER
509151.
510How many illegitimate states has synchronous mod-6 counter ? 3
511152.
512If the derived class is struct, then default visibility mode is PUBLIC
513153.
514Events are translated to ____ requests, which are sent either to the model or to the view
515154.
516A KEY is a property of the entire relation, rather than of the individual tuples in which each tuple is unique.
517155.
518DEMAND PAGING is the concept in which a process is copied into main memory from the secondary memory
519according to the requirement.
520156.
521The pager concerns with the: INDIVIDUAL PAGE OF PROCESS
522157.
523A attribute in a relation is a foreign key if the PRIMARY key from one relation is used as an attribute in that
524relation .
525158.
526The clock signals are used in sequential logic circuits to SYNCHRONIZE EVENTS
527159.
528OBJECT encapsulates core data and functionality.
529160.
530When a base class is privately inherited by the derived class, then_______________
531protected members of the base class become private members of derived class
532public members of the base class become private members of derived class
533161.
534Swap space exists in: SECONDARY MEMORY
535162 All key stakeholders gathers together for a short but intensely focused period for WORKSHOP
536163.
537The relation with the attribute which is the primary key is referenced in another relation. The relation which
538has the attribute as primary key is called REFERENCING RELATION
539164.
540To build a mod-19 counter the number of flip-flops required is 5
541165.
542What is the difference between protected and private access specifiers in inheritance?
543protected member is inheritable and also accessible in derived class.
544166.
545In Multipath inheritance, in order to remove duplicate set of records in child class then
546Make base class as virtual base class
547167. The main difference between JK and RS flip-flop is that
548JK flip-flop accepts both inputs 1
549168.
550The REFERENTIAL RELATION is the one in which the primary key of one relation is used as a normal
551attribute in another relation .
552169.
553Class diagram is a STRUCTURAL aspect of collaboration
554170.When a program tries to access a page that is mapped in address space but not loaded in physical memory,
555then?PAGE FAULT ERROR
556171.
557A REFERENTIAL integrity constraint requires that the values appearing in specified attributes of any tuple in
558the referencing relation also appear in specified attributes of at least one tuple in the referenced relation.
559172.
560Effective access time is directly proportional to:PAGE FAULT RATE
561173.
562Which of the following unit will choose to transform decimal number to binary code ? ENCODER
563174 In a MIN-Heap PARENT<CHILD/MAX HEAP:P>CHILD
564175.
565PERT chart is a tool that depicts project as network diagram that is capable of graphically representing main
566events of project in both parallel and consecutive way
567176.
568In FIFO page replacement algorithm, when a page must be replaced: OLD PAGE IS CHOSEN
569177.
570QUALITY is usually expressed in terms of bugs/LOC.
571178
572Relational Algebra is a PROCEDURAL query language that takes two relation as input and produces another
573relation as output of the query.
574
575179.
576Floating point representation is used to store REAL INT
577180.
578Which one of the below mentioned is not a linear data structure TREE
579181.
580Which algorithm chooses the page that has not been used for the longest period of time whenever the page
581required to be replaced? LRU
582182.
583Which of the following is a fundamental operation in relational algebra ? NONE
584The fundamental operations are select, project, union, set difference, Cartesian product, and
585rename
586183.
587The conditions that must be present in order to start a use case is __pre-conditions__
588184.
589Quick sort algorithm is an example of DIVIDE AND CONQUER
590185.
591Assembly language
592186 The idea of cache memory is based LOCALITY OF REFERENCE
593187.
594FAST stands for FACILITATED APPLE SPECIFIC TECHNIQUE
595188.
596Binary search tree has best case run-time complexity of ?(log n). What could the worst case? O(N)
597189.
598Which of the following is used to denote the selection operation in relational algebra ?SIGMA
599190 A process is thrashing if:
600IT SPENDS LOT OF TIME PAGING
601191.
602_______ diagrams are called as Implementation diagram.
603Ans:component
604192.
605Working set model for page replacement is based on the assumption of:
606Ans:locality
607193.
608For select operation the ________ appear in the subscript and the ___________ argument appears in the
609paranthesis after the sigma.
610Predicate,relation
611194.Match the following -
612(1) Bubble Sort
613(A) ?(n)
614(2) Shell Sort
615(B) ?(n2)
616(3) Selection Sort
617(C) ?(n log n)
618Ans:3b,2c,1a
619195.
620Which of the following is lowest in memory hierarchy?
621Ans:Secondary memory
622196.
623If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of
624I/O blocks requests are 98, 37, 14, 124, 65, 67.
625Ans:274+59
626197.
627______emphasize the use of events and states to determine the overall activity of the system.
628ANS:State diagram
629198.Apriory algorithm analysis does not include STATE DIAGRAM
630199.
631The addressing mode used in an instruction of the form ADD X Y, is INDEX
632200.
633The SET DIFFERENCE operation, denoted by -, allows us to find tuples that are in one relation but are not in
634another.
635201.
636Which is a unary operation: GENERALIZED SOLUTION
637202.
638In a vectored interrupt
639. the interrupting source supplies the branch information to the processor through an interrupt
640vector
641203.
642Which of the following memory allocation scheme suffers from external fragmentation? SEGMENTATION
643204.
644Which of these is a mechanism for naming and visibility control of a class and its content? PACKAGES
645205.
646DEPLOYMENT diagrams show the configuration of run time processing elements and the software
647components,processes and objects that live in them
648206.
649Which of the following is correct way of importing an entire package ‘pkg’? IMPORT PACKAGE *;
650207.
651Von Neumann architecture is SISD
652208.
653Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C
654which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur ? 13/15
655209.
656Which is a join condition contains an equality operator: EQUI JOIN
657210.
658FINAL state in a state chart is shown as a circle surrounding a small dot,a bull’s- eye.
659211.
660What is the output of this code?
661 package pkg;
662 class display {
663 int x;
664 void show() {
665 if (x > 1)
666 System.out.print(x + " ");
667 }
668 }
669 class packages {
670 public static void main(String args[]) {
671 display[] arr=new display[3];
672 for(int i=0;i<3;i++)
673 arr[i]=new display();
674 arr[0].x = 0;
675 arr[1].x = 1;
676 arr[2].x = 2;
677 for (int i = 0; i < 3; ++i)
678 arr[i].show();
679 }
680 }
681ANS 2
682212.
683in the textual description are considered to be methods of classes
684ANS:NOUNS as classes and verbs as the method of classes
685213.
686Cache memory acts between CPU AND RAM
687214.
688In precedence of set operators the expression is evaluated from LEFT TO RIGHT
689215.
690Pre-emptive scheduling is the strategy of temporarily suspending a running process BEFORE CPU EXPIRES
691216.
692Resources are allocated to the process on non-sharable basis is MUTUAL EXCLUSION
693217.
694Write Through technique is used in which memory for updating the data CACHE MEMORY
695218.
696Which of these interface declares core method that all collections will have? COLLECTION
697219.
698A _____ is a function or procedure that is defined for a class and typically can access the internal state of an
699object of that class to perform some operation
700ALL(METHOD)
701220.
702Which of the following is not outer join ?
703221.
704In round robin CPU scheduling as time quantum is increased the average turn around time VARIES
705IRREGULARLY
706222 Which of these interface is not a part of Java’s collection framework? MAPS
707223.
708Inheritance is the property of object-oriented systems that allows objects to be built from other
709224.
710Generally Dynamic RAM is used as main memory in a computer system as it HIGH SPEED
711225.
712n precedence of set operators the expression is evaluated from LEFT TO RIGHT
713226 A message is much more general than a ______.
714227.
715Which of these is an example of a virtual resource?
716Print server, Virtual machine, Virtual memory
717228.
718Which of these methods can randomize all elements in a list? SHUFFLE
719229.
720In signed-magnitude binary division, if the dividend is (11100) 2 and divisor is (10011) 2 then the result is 10100
721230.A collection of data designed to be used by different people is called a/an DATABASE
722 
723231.
724Which of these is not a term describing the collection of Operating Programs
725SERVER
726232.
727Which of the following is the oldest database model?
728NETWORK
729233.Thread class is available in JAVA.LANG
730234.
731ABSTRACT CLASS have no instances but define the common behaviors that can be inherited by more specific
732classes
733235.
734In a program using subroutine call instruction, it is necessary CLEAR THE INSTRUCTION REGISTER
735236.
736Which of the following schemas does define a view or views of the database for particular users? EXTERNAL
737SCHEMA
738237.
739A Stack-organised Computer uses instruction of ZERO ADDRESSING
740238.
741DEFAULT CONSTRUCTOR
742The following program is an example for?
743class Student{
744int id;
745String name;
746void display(){System.out.println(id+" "+name);}
747public static void main(String args[]){ 
748Student s1=new Student();
749Student s2=new Student();
750s1.display();
751s2.display();
752}
753}
754239.
755PROTOTYPE is a version of software product developed in the early stages of product's life cycle for specific
756and experimental purposes.
757240.
758Applications like Banking and reservations require which type of OS?
759SOFT REAL TIME
760241.
761The following two statements illustrate the difference between a
762int x = 25;
763Integer y = new Integer(33); PRIMITIVE AND WRAPPER
764242 If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative mapping.
765Then each word of cache memory shall be 16 BITS
766243.
767Which of the following is an attribute that can uniquely identify a row in a table?
768CANDIDATE KEY
769244.
770Which OS employs the techniques of fault tolerance and graceful degradation to ensure continuity of operation?
771REAL TIME
772245.
773A FUNCTION is an implementation of an object's behavior
774246.
775When CPU is executing a Program that is part of the Operating System, it is said to SYSTEM MODE
776247.
777In an absolute loading scheme, which loader function(s) is (are) accomplished by programmer
778REALLOCATION
779248.
780Trees are examples of which type of data structure NON-LINEAR
781249.
782Which of the following is the process of selecting the data storage and data access characteristics of the
783database? PHYSICAL DATABASE DESIGN
784250.
785Use-case is a scenario depicting a user system interaction
786251.
787Graphs are examples of which type of data structure NON-LINEAR
788252.
789In virtual memory systems, Dynamic address translation H/W FOR PAGING
790253.
791PSW is saved in stack when there is a INTERUPPT REQ
792254.
793A DESIGN PATTERN INTEGRITY is instructive information that captures the essential structure and
794insight of a successfully family of proven solutions to a recurring problem that arises within certain context and
795system of forces
796255
797Which of the following terms does refer to the correctness and completeness of the data in a database?
798INTEGRITY
799256.
800The relationship between DEPARTMENT and EMPLOYEE is a 1 TO MANY
801257.
802Which of the following sorts does not use an array structure ?
803258.
804________can be viewed as a collection of procedures or behaviours that, taken together, reflect the behaviour of a
805system over time.
806ANS:Object Behaviour
807259.
808Page table level that says if page has been modified, is known as DIRTY
809260.
810The multiplicand register & multiplier register of a hardware circuit implementing booth's algorithm have
811(11101) & (1100). The result shall be (812)10
812261.
813A table can be logically connected to another table by defining a COMMON ATTRIBUTE
814262.
815A _______can be viewed as a snapshot of a system's parameters at rest or at a specific point in time.
816Static model
817263.
818PC register keeps tracks of the instructions stored in program stored in memory.
819264.
820Consider the following code fragment:
821if (fork() == 0)
822{ a = a + 5; printf("%d,%d\n", a, &a); }
823else { a = a –5; printf("%d, %d\n", a, &a); }
824Let u, v be the values printed by the parent process, and x, y be the values printed by the child process. Which
825one of the following is TRUE?
826(c) u + 10 = x and v = y
827265.
828The logical or mathematical model of a particular organization of data is called a DATA STRUCTURE
829266.
830If the state of the database no longer reflects a real state of the world that the database is supposed to capture,
831then such a state is called inconsistent state
832267.
833Memory unit accessed by content is called ASSOCIATIVE MEMORY
834268.
835The __________ is used when you have one case that is similar to another use case but does a bit more specialized
836EXTENDS ASSOCIATION
837269.
838Which of the following is the least simple data structure?
839270.
840The atomic fetch-and-set x, y instruction unconditionally sets the memory location x to 1 and fetches the old
841value of x in y without allowing any intervening access to the memory location x. consider the following
842implementation of P and V functions on a binary semaphore .
843void P (binary_semaphore *s) {
844unsigned y; unsigned *x = &(s->value);
845do { fetch-and-set x, y; } while (y);}
846void V (binary_semaphore *s) {
847S->value = 0;}
848Which one of the following is true? DOES NOT WORKIF DISABLED IN P
849271.
850Superclass -subclass relationships, also known AS INHERITANCE
851272.
852‘Aging registers’ are Counters which indicate how long ago their associated pages have been
853referenced.
854273.
855Ensuring isolation property is the responsibility of the Concurrency-control component of the DBMS
856274.
857Which of the following page replacement algorithms suffers from Belady’s anomaly? FIFO
858275.
859Linear arrays are also called 1D ARRAY
860276.
861Which of the following gives a logical structure of the database graphically? ER DIAGRAM
862277.
863What is the swap space in the disk used for? SAVING PROCESS DATA
864278.
865Arrays are best data structures RELATIVELY PERMANENT DATA
866279 A binary digit is called a BIT
867280.
868COUPLING denotes the measure of strength of association established by a connection from one object to
869another.
870281.
871Suppose n processes, P1, …. Pn share m identical resource units, which can be reserved and released one at a
872time. The maximum resource requirement of process Pi is Si, where Si > 0. Which one of the following is a
873sufficient condition for ensuring that deadlock does not occur?
874OPTION C S<(M+N)
875282.
876REQUIREMENT DIAGRAM is the interaction between software components or objects.
877283.
878Which of the following data structures are indexed structures? LINEAR ARRAYS
879284.
880Status bit is also called FLAG BIT
881285.
882The entity relationship set is represented in E-R diagram as DIAMOND
883286.
884Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively.
885Each process spends the first 20% of execution time doing I/O, the next 70% of time doing computation, and the
886last 10% of time doing I/O again. The operating system uses a shortest remaining compute time first scheduling
887algorithm and schedules a new process either when the running process gets blocked on I/O or when the running
888process finishes its compute burst. Assume that all I/O operations can be overlapped as much as possible. For
889what percentage of time does the CPU remain idle? 10.6%
890287.
891An address in main memory is called PHYSICAL ADDRESS
892288.
893DESIGN PATTERN provides a scheme for refining the subsystems or components of a software system or the
894relationship among them.
895289.
896A LINEAR ARRAY does not keep track of address of every element in the list.
897290.
898The Rectangles divided into two parts represents ENTITY SET
899291.
900Consider a directed line(->) from the relationship set advisor to both entity sets instructor and student. This
901indicates one to one cardinality
902292.
903Which of the following is major part of time taken when accessing data on the disk? SEEK TIME
904293.
905When does top value of the stack changes? AFTER DELETION
906294.
907If the value V(x) of the target operand is contained in the address field itself, the addressing mode is DIRECT
908295.
909The concept of__________ is used to represent a system whose inside workings are not available for inspection.
910BLACK BOX
911296.
912We indicate roles in E-R diagrams by labeling the lines that connect DIAMOND to RECTANGLE.
913297.
914can be represented in a signed magnitude format and in a 1’s complement format as LEFT BIT
915298.
916Which if the following is/are the levels of implementation of data structure ALL OF THESE
917299.
918A _______ strategy can detect the serious flaws early in the implementation.
919TOP DOWN STRATEGY
920300.
921From amongst the following given scenarios determine the right one to justify interrupt mode of data-transfer
922KEYBOARD I/P
923301.
924An entity set that does not have sufficient attributes to form a primary key is termed a WEAK ENTITY.
925302.
926A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called AVL TREE
927303.
928WBOX is to test every statement in the objects method by executing it at least once.
929304.
930The instructions which copy information from one location to another either in the processor’s internal register
931set or in the external main memory are called DATA TRANSFER INSTRUCTIONS
932305.
933Increasing the RAM of a computer typically improves performance because: Fewer page faults occur
934Increasing main memory allows more code/pages to reside there and hence, less page faults.
935306.
936The performance of cache memory is frequently measured in terms of a quantity called HIT RATIO
937307.
938For a weak entity set to be meaningful, it must be associated with another entity set, called the IDENTIFYING
939SET
940308.
941TESTING is the process of executing a program with the intent of finding errors.
942309.
943A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual
944address space is of the same size as the physical address space, the operating system designers decide to get rid
945of the virtual memory entirely. Which one of the following is true?
946Hardware support for memory management is no longer needed
947310.
948IMPLEMENTATION level is where the model becomes compatible executable code
949311.
950Three concurrent processes X, Y, and Z execute three different code segments that access and update certain
951shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the
952P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before
953entering the respective code segments. After completing the execution of its code segment, each process invokes
954the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one.
955Which one of the following represents a deadlockfree order of invoking the P operations by the processes?
956X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
957312.
958STACK IS ALSO CALLED LIFO
959313.
960A GOOD TEST CASE is the one that has s high probability of detecting an as-yet undiscovered error
961314.
962Content of the program counter is added to the address part of the instruction in order to obtain the effective
963address is called. RELATIVE ADDRESS
964315.
965Weak entity set is represented as DOUBLE DIAMOND
966316.
967An interface that provides I/O transfer of data directly to and form the memory unit and peripheral is termed
968as DMA
969317.
970Which of the following is true about the characteristics of abstract data types?
971A. It exports a set of operations TRUE
972B. It exports a type. TRUE
973Top of Form
974318.
975Nouns in the textual description are considered to be _______.
976319.
977Protocols are?
978320.
979If you were collecting and storing information about your music collection, an album would be considered a(n)
980INSTANCE
981321.
982What is the content of Stack Pointer (SP)? ADDRESS OF THE TOP OF THE STACK
983322.
984Which data communication method is used to transmit the data over a serial communication link?
985FULL-DUPLEX
986323.
987Model Constraints and Comments Constraints are assumptions or relationships among model elements
988specifying conditions and propositions that must be maintained as true.
989324.NONE is not the component of data structure.
990325.
991What term is used to refer to a specific record in your music database; for instance; information stored about a
992specific album? INSTANCE
993326.
994Which of the following is not the part of ADT description? NONE
995327.
996The memory unit that communicates directly with the CPU is called the MAIN MEMORY
997328.
998____ usecase is not complete and has no initiation actors.
999ANS:Abstract
1000329.
1001In communication satellite, multiple repeaters are known as? TRANSPONDERS
1002330.Let us consider phone_number ,which can take single or several values . Treating phone_numberas an
1003ENTITY permits instructors to have several phone numbers (including zero) associated with them.
1004331.
1005A page fault NOT IN MEMORY
1006332.
1007SRS describe system services or functions
1008333.
1009Error detection at the data link layer is achieved by? CYCLIC REDUNDANCY
1010334.
1011The total participation by entities is represented in E-R diagram as DOUBLE LINE
1012335.
1013Inserting an item into the stack when stack is not full is called PUSH Operation and deletion of item form the
1014stack, when stack is not empty is called POP.operation.
1015336.
1016Given the basic ER and relational models, which of the following is INCORRECT?
1017OPTION C (MORE THAN ONE)
1018337.
1019QUEUE Is a pile in which items are added at one end and removed from the other.
1020338.
1021A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside
1022buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of
1023the TLB tag is: 15 BITS
1024339.
1025The most common addressing techiniques employed by a CPU is ALL THE ABOVE
1026340.
1027SRS is a structured document setting out detailed descriptions of the system services
1028341.
1029Pipeline implement ALL OFTHE ABOVE
1030342.
1031Which of the following indicates the maximum number of entities that can be involved in a relationship?
1032MAXIMUM CARDINARLITY
1033343.
1034STACK is very useful in situation when data have to stored and then retrieved in reverse order.
1035344.
1036Prototyping is an important technique of ____________
1037345.
1038Virtual memory is SECONDARY MEMORY
1039346.
1040What will be printed as the output of the following program?
1041public class testincr
1042{
1043public static void main(String args[])
1044{
1045int i = 0;
1046i = i++ + i;
1047System.out.println("I = " +i);
1048}
1049}
1050OUTPUT:1
1051347.
1052What is a relationship called when it is maintained between two entities? BINARY
1053348.
1054When a subroutine is called, the address of the instruction following the CALL instructions stored in/on
1055the STACK
1056349.
1057Page fault occurs when DATA NOT IN MEMORY
1058350.
1059Requirements which change during development or when the system is in use are said to be AMBIGUOUS
1060351.
1061__________don’t know what they really want
1062352.
1063Consider the virtual page reference string
10641, 2, 3, 2, 4, 1, 3, 2, 4, 1
1065On a demand paged virtual memory system running on a computer system that main memory size of 3 pages
1066frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the
1067corresponding page replacements policy. Then
1068(A) OPTIMAL < LRU < FIFO (B) OPTIMAL < FIFO < LRU (C) OPTIMAL = LRU
1069(D) OPTIMAL = FIFO
1070OPTION B
1071353.
1072Key to represent relationship between tables is called PRIMARY KEY
1073354.
1074Which data structure allows deleting data elements from and inserting at rear? QUEUE
1075355.
1076PC Program Counter is also called IP INT POINTER
1077356.
1078Thrashing occurs when EXCESSIVE SWAPPING
1079357.
1080Which of the following data structure can't store the non-homogeneous data elements? ARRAY
1081358.
1082A window into a portion of a database is VIEW
1083359.
1084Virtual memory is
1085360.
1086Different ___________ may have conflicting requirements
1087ANS:STAKEHOLDERS
1088361.
1089_________ are responsible for producing or consuming data
1090362.
1091A primary key is combined with a foreign key creates PARENT CHILD RELATIONSHIP
1092363.
1093Cache memory364.
1094A QUEUE/LINKEDLIST is a data structure that organizes data similar to a line in the supermarket, where the
1095first one in line is the first one out.
1096365.
1097Let the page fault service time be 10ms in a computer with average memory access time being 20ns. If one page
1098fault is generated for every 10^6 memory accesses, what is the effective access time for the memory?
109930 NS
1100366.
1101Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3,4, 2, 1, 5, 3,
11022, 4, 6, the number of page faults using the optimal replacement policy is 7.
1103367.
1104A memory buffer used to accommodate a speed differential is called CACHE
1105368. Herder node is used as sentinel in …..binary tree
1106369.
1107In order to maintain transactional integrity and database consistency, what technology does a DBMS deploy?
1108LOCK
1109370.
1110_______ are a natural way to structure requirements elicitation
1111371.
1112Why we need to have secondary storage ? STORE LARGE MEMORY THAT EXCEEDS MAIN MEMORY
1113372.
1114Which data structure is used in breadth first search of a graph to hold nodes? QUEUE
1115373.
1116A social scientists spends a considerable time observing and analysing how people actually work is said to be
1117ETHNOGRAPHY
1118374.
1119Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using
1120statically linked libraries ? FASTER PROGRAM STRATEGY
1121375.
1122A lock that allows concurrent transactions to access different rows of the same table is known as a ROW LEVEL
1123LOCK
1124376.
1125Identify the data structure which allows deletions at both ends of the list but insertion at only one end. INPUT
1126RESTRICTED
1127377.
1128A computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program
1129accesses the pages numbered 1, 2, …, 100 in that order, and repeats the access sequence THRICE. Which one of
1130the following page replacement policies experiences the same number of page faults as the optimal page
1131replacement policy for this program?MOST RECENTLY USED
1132378.
1133Whenever CPU detects an interrupt, what it do with current state ? SAVE IT 
1134379.
1135Which of the following are introduced to reduce the overheads caused by the log-based recovery?
1136CHECK POINTS
1137380.
1138The PROTOTYPE may be used for user training before a final system is delivered
1139381.
1140Misunderstandings between software users and developers are exposed by PROTOTYPE
1141382.
1142Which of the following data structure is non linear type? NONE OF THE ABOVE
1143383.
1144The address mapping is done, when the program is initially loaded is called ? STATIC RELOCATION
1145384.
1146Which of the following protocols ensures conflict serializability and safety from deadlocks?
1147TIME STAMP ORDERING
1148385.
1149Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6,
1150respectively. How many context switches are needed if the operating system implements a shortest remaining
1151time first scheduling algorithm? Do not count the context switches at time zero and at the end. 2
1152386.
1153Which of the following is the block that is not permitted to be written back to the disk? PINNED
1154387.
1155The unit which decodes and translates each instruction and generates the necessary enable signals for ALU and
1156other units is called CONTROL UNIT
1157388.
1158The objective of ANALYST is to deliver a working system to end-users
1159389.
1160Which of the following data structure has cycles? GRAPHS
1161390.
1162Which of the following process scheduling algorithm may lead to starvation SJF
1163391.
1164In THROW AWAY the prototype is developed from an initial specification, delivered for experiment then
1165discarded
1166392.
1167A microprogram is sequencer perform the operation ? READ AND WRITE
1168393.
1169If transaction Ti gets an explicit lock on the file Fc in exclusive mode, then it has an IMP IN EXCLUSIVE
1170MODE on all the records belonging to that file.
1171394.
1172If the quantum time of round robin algorithm is very large, then it is equivalent to: FIFO
1173395.
1174To represent hierarchical relationship between elements, Which data structure is suitable? TREE
1175396.
1176An__________, start with the best understood parts
1177397.
1178The performance of the cache memory is measured in terms of ? HIT RATIO
1179398.
1180Which refers to a property of computer to run several operation simultaneously and possible as computers await
1181response of each other CONCURRENCY
1182399.
1183FIFO form of access is used to add and remove nodes from a queue.
1184400.
1185A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with
1186priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and
1187decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations
1188and all arrive at time zero? ROUND ROBIN
1189401.
1190A set of physical addresses is also known as MEMORY ADDRESS
1191402.
1192All lock information is managed by a LOCK MANAGER which is responsible for assigning and policing the
1193locks used by the transactions.
1194403.
1195Consider the following table of arrival time and burst time for three processes P0, P1 and P2.
1196Process Arrival time Burst Time
1197P0 0 ms 9 ms
1198P1 1 ms 4 ms
1199P2 2 ms 9 ms
1200The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or
1201completion of processes. What is the average waiting time for the three processes? 5
1202404.
1203In a ________start with the least well-understood parts
1204405.
1205In liked representation of stack INFO holds the elements of the stack.
1206.406 LIFO form of access is used to add remove nodes from a stack.
1207407.
1208Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary
1209locks are acquired before any are released?
1210TWO PHASE LOCK
1211408.
1212OPTICAL DISK read the data by reflecting pulses of laser beams on the surface
1213409.
1214Requirements which specify that the delivered product must behave in a particular way is PRODUCT
1215REQUIREMENT
1216410.
1217Which of the following statements are true?
1218I. Shortest remaining time first scheduling may cause starvation
1219II. Preemptive scheduling may cause starvation
1220III. Round robin is better than FCFS in terms of response time
1221ALL OF THE ABOVE
1222411.
1223A system is in a DEAD LOCK state if there exists a set of transactions such that every transaction in the set is
1224waiting for another transaction in the set.
1225412.
1226Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in
1227Group 1 to entries in Group 2.
1228Group I Group II
1229(P) Gang Scheduling (1) Guaranteed Scheduling
1230(Q) Rate Monotonic Scheduling (2) Real-time Scheduling
1231(R) Fair Share Scheduling (3) Thread Scheduling
1232P-3 Q-2 R-1
1233413.
1234Constraints on the services or functions offered by the system such as timing constraints, constraints on the
1235development process, standards, etc refers to NON FUNCTIONAL REQUIREMENT
1236414.
1237Which technique helps processor to run a program concurrently with input output operations ?
1238INTERUPT DRIVEN I/O
1239415.
1240In the linked representation of the stack START POINTER behaves as the top pointer variable of stack.
1241416.Which interrupt establishes a priority over the various sources to determine which request should be
1242entertained first ? PRIORITY INTERUPT
1243417.
1244Reliability, Response time and Storage requirements are examples of NON-FUNCTIONAL REQUIREMENT
1245418.
1246Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All
1247processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF
1248ties are broken by giving priority to the process with the lowest process id. The average turn around time
1249is:LRTF-13 UNITS
1250419. The deadlock state can be changed back to stable state by using ROLLBACK statement.
1251420. New nodes are added to the BACK of the queue.
1252421. In linked representation of stack the null pointer of the last node in the list signals BACK OF THE
1253STACK
1254422.Mandating a particular IDE, programming language or development method are examples of NON
1255FUNCTIONAL
1256423.Which method is used to establish priority by serially connecting all devices that request an interrupt ?
1257DAISY CHAINING
1258424.The maximum number of processes that can be in Ready state for a computer system with n CPUs is
1259INDEPENDANT OF N
1260425.What are the ways of dealing with deadlock ?
1261426. For the processes listed in the following table, which of the following scheduling schemes will give the
1262lowest average turnaround time?
1263Process Arrival Time Processing Time
1264 A 0 3
1265 B 1 6
1266 C 4 4
1267 D 6 2
1268SHORTEST REMAINING TIME
1269427. What happens when you push a new node onto a stack? the new node is placed at the front of the
1270linked list.
1271428. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a
1272timestamp smaller than that of Tj (that is, Ti is older than Tj ). Otherwise, Ti is rolled back (dies). This is
1273WAIT DIE
1274429. Which is used for this and known as high speed buffer exist with almost each process ? CACHE
1275430. Requirements which are a consequence of organisational policies and procedures are termed as POLICIES
1276/PROCEDURE
1277431. Main function of shared memory is: INTERPROCESS
1278432. Interoperability requirements, legislative requirements are examples of EXTERNAL REQUIREMENT
1279433. In stack organization the insertion operation is known as ?PUSH
1280434. A queue is a .........
1281435. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a
1282timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by
1283Ti ). This is
1284WOUND WAIT
1285436. Loss in signal power as light travels down the fiber is called? Attenuation
1286437. VALIDATION is the process of checking the requirements for validity, consistency, completeness, realism
1287and verifiability.
1288438. INTERUPT INITATED I/O processor has to check continuously till device becomes ready for transferring
1289the data ?
1290439. The situation where the lock waits only for a specified amount of time for another lock to be released is
1291LOST TIMEOUT
1292440. Which of the following name does not relate to stacks? FIFO
1293441.
1294The deadlock in a set of transaction can be determined by READ ONLY GRAPH
1295442.
1296The retrieval of items in a stack is POP operation.
1297443.
1298__________is the process of formally documenting the user and system requirements and creating a software
1299requirements document.
1300444.
1301The topology with highest reliability is ? MESH
1302445.
1303Instruction that are used for reading from memory by an IOP called? COMMANDS
1304446.
1305The term push and pop is related to STACK
1306447.
1307A deadlock exists in the system if and only if the wait-for graph contains a CYCLE
1308448.
1309Tools to support the early process activities of requirements and design are UPPER CASE
1310449.
1311Baud means? SIGNAL CHANGE RATE
1312450 For operation of multiplication hardware needs minimum ALU of 32 bits
1313451.
1314Tools to support later activities such as programming,debugging and testing are LOWER CASE
1315452.
1316In OSI model dialogue control and token management are responsibilities of ?
1317SESSION LAYER
1318453.
1319PARTIAL rollback requires the system to maintain additional information about the state of all the running
1320transactions.
1321454.
1322In division, two operands (dividend and divisor) and answer (quotient) of divide are accompanied by a second
1323answer called the REMAINDER
1324455.
1325The term enqueue and dequeue is related to QUEUE
1326456.
1327The term ParentTree and Child is related to
1328457.
1329Which of the following is not a property of transactions? CONCURRENCY CONTROL
1330458.
1331Multiplying (1000)10 by (1001t)en will produce product of 1001001
1332459.
1333Under mark parity,each parity bit is? 1
1334460.
1335Software should not make wasteful use of system resources is termed as EFFICIENCY
1336461.
1337Software must be usable by the users for which it was designed is termed as USABILITY
1338462.
1339A number in scientific notation, that has no leading 0s is called a normalised number
1340463.
1341Which is the pointer associated with the stack? TOP
1342464.
1343How long is an IPv6 address? 128 BITS
1344465.
1345SNAPSHOT is used for (DBA) DYNAMIC DATA REPLICATION
1346466.
1347Isolation of the transactions is ensured by CONCURENCY CONTROL
1348467.
1349The elements are removal from a stack in REVERSE order.
1350468.
1351Human readable base representation of numbers is DECIMAL
1352469.
1353Old, valuable systems must be maintained and updated are termed as MAINTAINENCE
1354470.
1355You have 10 users plugged into a hub running 10Mbps half-duplex. There is a server connected to the switch
1356running 10Mbps half-duplex as well. How much bandwidth does each host have to the server? 10MBPS
1357471.
1358Constraint checking can be disabled in existing CHECK and FOREIGN KEY constraints so that any data you
1359modify or add to the table is not checked against the constraint.
1360472.
1361SOFTWARE ENGINEERING is an engineering discipline which is concerned with all aspects of software
1362production.
1363473.
1364Converting (-2047)10 into a 32-bit 2
13651-10001001-11111111110000000000000
1366474.
1367How often are BPDUs sent from a layer 2 device? 2 SECS
1368475.
1369The insertion operation in the stack is called PUSH
1370476.
1371Decimal value of this 32-bit two
1372477.
1373PUSH is the term used to insert an element into stack.
1374478
1375EXTREME PROGRAMMING relies on constant code improvement, user involvement in the development
1376team and pairwise programming .
1377479.
1378Which router command allows you to view the entire contents of all access lists?SHOW ACCESS LIST
1379480.
1380Problems occurs if we don’t implement proper locking strategy UNREPEATABLE READ
1381481.
1382Which of the following fixed database roles can add or remove user IDs? DB_ACCESSADMIN
1383482.
1384Dividing (1,001,010)10 by (1000)10 will produce reminder of (10)10
1385483.
1386What protocols are used to configure trunking on a switch? 3 AND 4
1387484.
1388Stack follows the strategy of LIFO.
1389485.
1390Risks are explicitly assessed and resolved throughout the process in SPIRAL model 
1391486.
1392SYSTEM TESTING involves executing the system with test cases that are derived from the specification of the
1393real data to be processed by the system
1394487.
1395By default sql server has READ COMMITTED LEVEL isolation level
1396488.
1397If a block can be placed at every location in cache, this cache is said to be FULLY ASSOCIATION
1398489.
1399POP is the term used to delete an element from the stack.
1400 490.
1401How many collision domains are created when you segment a network with a 12-port switch? 12
1402491.
1403Individual components are tested is termed as UNIT TESTING
1404492.
1405Which protocol does Ping use? ICMP
1406493.Which of the following statements is/are not true for SQL profiler?
1407CHECK P OF STORED PROCEDURE
1408494.
1409Deletion operation is done using FRONT in a queue.
1410495.
1411Information when is written in cache, both to block in cache and block present in lower-level memory, refers to
1412WRITE THROUGH
1413496.
1414What PPP protocol provides dynamic addressing, authentication, and multilink?
1415LCP
1416497.
1417Which of the following is the original purpose of SQL? ALL OF THESE
1418498.
1419Testing with customer data to check that it is acceptable is termed as UAT testing
1420499.
1421A pointer variable which contains the location at the top element of the stack is called TOP
1422500. The load instruction is mostly used to designate a transfer from memory to a processor register known as
1423ACCUMULATOR
1424501.
1425_____genetic modification________ is concerned with modifying the system after it is in use
1426502.
1427What is a stub network?
1428A stub network, or pocket network, is a somewhat casual term describing a computer network, or
1429part of an internetwork,
1430with no knowledge of other networks, that will typically send much or all of its non-local traffic out
1431via a single path, with
1432the network aware only of a default route to non-local destinations.
1433503.
1434A group of bits that tell the computer to perform a specific operation is known as _instruction code___. 
1435504.
1436Which of the following is an application of stack?
1437ans:applications of stack are:
14381.Expression evaluation
14392.Backtracking (game playing, finding paths, exhaustive searching)
14403.Memory management, run-time environment for nested language features.
1441505.
1442SQL can be used to:
1443ans:communicate with a database
1444506.
1445The assignment operator is denoted by
1446ans:(=).
1447507.
1448The time interval between adjacent bits is called the_____.
1449ans: bit-time
1450508.
1451The operation of processing each element in the list is known as ......
1452ans: traversal
1453509.
1454Which of the following services use TCP?
1455[A] DHCP
1456[B] SMTP
1457[C] FTP
1458[D] TFTP
1459[E] HTTP
1460Answer: B
1461510.
1462_____milestones_______ are the end-point of a process activity
1463511.
1464Consider money is transferred from (1) account-A to account-B and (2) account-B to account-A. Which of the
1465following form a
1466transaction ?
1467ans: both 1 & 2.
1468512.
1469_mcq____ are project results delivered to customers
1470513.
1471Other name for directed graph is .....digraph.....
1472514.
1473Which of the following is private IP address?
1474A. 12.0.0.1
1475B. 168.172.19.39
1476C. 172.15.14.36
1477D. 192.168.24.43
1478Answer: Option D
1479515.
1480A k-bit field can specify any one of_____.
1481A. 3k registers B. 2k registers
1482C. K2 registers D. K3 registers
1483Ans: B
1484516.
1485______ show task dependencies and the the critical path
1486517.
1487A transaction may not always complete its execution successfully. Such a transaction is termed
1488a) Aborted
1489b) Terminated
1490c) Closed
1491d) All of the mentioned
1492ans: a
1493518.
1494MIMD stands for _____.
1495ans: multiple instruction, multiple data.
1496519.
1497Which class of IP address provides a maximum of only 254 host addresses per network ID?
1498A. Class A
1499B. Class B
1500C. Class C
1501D. Class D
1502Answer: Option C
1503520.
1504Binary trees with threads are called as .......
1505ans: threaded binary tree.
1506521.
1507In dial up remote access a client uses the ---- to create a physical connection to a part on a remote access server
1508of the private network.
15091)Private network
15102)Public telephone network
15113)Bank’s branch network
15124)Public local network
1513Ans:(2)
1514522.
1515The average time required to reach a storage location in memory and obtain its contents is called_____.
1516A. Latency time. B. Access time.
1517C. Turnaround time. D. Response time.
1518Ans: B
1519523.
1520If an transaction is performed in a database and committed, the changes are taken to the previous state of
1521transaction by
1522a) Flashback
1523b) Rollback
1524c) Both a and b
1525d) Cannot be done
1526Ans:d
1527524.
1528___mcq_______ show schedule against calendar time
1529525.
1530Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.
1531A. Leterally connected
1532B. Widely Connected
1533C. Unliterally connected
1534D. Literally connected
1535Ans:C
1536526.
1537In Binary trees nodes with no successor are called ......
1538a.end nodes
1539b.final nodes
1540c.last nodes
1541d.terminal nodes
1542ans:d
1543527.
1544Which of the following devices is a PC component that connects the computer to the network?
1545528.
1546A ___risk____ is a probability that some adverse circumstance will occur.
1547529.
1548‘Aging registers’ are _______.
1549(A) Counters which indicate how long ago their associated pages have been referenced.
1550(B) Registers which keep track of when the program was last accessed.
1551(C) Counters to keep track of last accessed instruction.
1552(D) Counters to keep track of the latest data structures referred.
1553Ans: A
1554530.
1555Each modification done in database transaction are first recorded into the
1556a) Harddrive
1557b) Log
1558c) Disk
1559d) Datamart
1560Ans:b
1561531.
1562A connected graph T without any cycles is called ........
1563A. A tree graph
1564B. Free tree
1565C. A tree d
1566D. All of the above
1567Ans:D
1568532.
1569Which of the following devices modulates digital signals into analog signals that can be sent over traditional
1570telephone
1571lines?
1572(1) Router
1573(2) Gateway
1574(3) Switch
1575(4) Modem
1576(5) NIC
1577Ans:4
1578533.
1579___Project Risks_______affect schedule or resources
1580534.
1581When the transaction finishes the final statement the transaction enters into
1582a) Active state
1583b) Committed state
1584c) Partially committed state
1585d) Abort state
1586Ans:c
1587535.
1588Memory unit accessed by content is called______.
1589A. Read only memory B. Programmable Memory
1590C. Virtual Memory D. Associative Memory
1591Ans: D
1592536.
1593The name of the transaction file shall be provided by the operator and the file that contains the edited
1594transactions ready
1595for execution shall be called
1596a) Batch. Exe
1597b) Trans. Exe
1598c) Opt. Exe
1599d) Edit.Exe
1600Ans:c
1601537.
1602n bits in operation code imply that there are ___________ possible distinct
1603A. 2n B. 2n
1604C. n/2 D. n2
1605Ans: B
1606538.
1607Which of the following devices takes data sent from one network device and forwards it to all devices on the
1608network
1609regardless of the intended recipient?
1610(1) DNS Server
1611(2) Switch
1612(3) Hub
1613(4) Gateway
1614(5) All
1615Ans. (3)
1616539.
1617Trees are said .......... if they are similar and have same contents at corresponding nodes.
1618A. Duplicate
1619B. Carbon copy
1620C. Replica
1621D. Copies
1622Ans:D
1623540.
1624___mcq______ affect the organisation developing or procuring the software
1625541.
1626Which of the following is an atomic sequence of database actions?
1627a) Transaction
1628b) Concurrency
1629c) Relations
1630d) All of the mentioned
1631Ans:a
1632542.
1633Which of the following devices takes data sent from one network device and forwards it to the destination node
1634based on MAC
1635address?
1636(1) Hub
1637(2) Switch
1638(3) Gateway
1639(4) Modem
1640(5) All
1641Ans. (2)
1642543.
1643Late delivery of hardware or support software is an example for ___mcq_______
1644544.
1645A three input NOR gate gives logic high output only when_____.
1646A. one input is high B. one input is low
1647C. two input are low D. all input are high
1648Ans: D
1649545.
1650Every node N in a binary tree T except the root has a unique parent called the ......... of N.
1651A. Antecedents
1652B. Predecessor
1653C. Forerunner
1654D. Precursor
1655Ans:B
1656546.
1657The circuit converting binary data in to decimal is_____.
1658A. Encoder B. Multiplexer
1659C. Decoder D.Code converter
1660Ans: D
1661547.
1662In a tree, between any two nodes, there is _edge or path______-
1663548.
1664poor relationships amongst team member is ________risk
1665Ans:negative conflict
1666549.
1667If the state of the database no longer reflects a real state of the world that the database is supposed to capture,
1668then
1669such a state is called
1670a) Consistent state
1671b) Parallel state
1672c) Atomic state
1673d) Inconsistent state
1674Ans:d
1675550.
1676Which of the following devices assigns IP address to devices connected to a network that uses TCP/IP?
1677[A] DHCP Server
1678[B] NIC
1679[C] Gateway
1680[D] Hub
1681Answer: A
1682551.
1683_______ means that data used during the execution of a transaction cannot be used by a second transaction until
1684the first
1685one is completed.
1686(a) Serializability (b) Atomicity (c) Isolation
1687(d) Time stamping (e) Durability.
1688Ans:c
1689552.
1690A ____feasibilty study_________decides whether or not the proposed system is worthwhile
1691553.
1692Although they've fallen out of favor, which of the following devices is used to connect different network segments
1693and manage the traffic between them?
1694[A] Bridge
1695[B] Hub
1696[C] Gateway
1697[D] Repeater
1698Answer: A
1699554.
1700PSW is saved in stack when there is a _____.
1701A. interrupt recognized B. execution of RST instruction
1702C. Execution of CALL instruction D. All of these
1703Ans: A
1704555.
1705In a graph if E=(u,v) means ......
1706A. u is adjacent to v but v is not adjacent to u
1707B. e begins at u and ends at v
1708C. u is processor and v is successor
1709D. both b and c
1710Ans:D
1711556.
1712DBMS periodically suspends all processing and synchronizes its files and journals through the use of
1713(a) Checkpoint facility (b) Backup facility (c) Recovery manager
1714(d) Database change log (e) Shadow Paging.
1715Ans:a
1716557.
1717Sequential representation of binary tree uses ........
1718A. Array with pointers
1719B. Single linear array
1720C. Two dimentional arrays
1721D. Three dimentional arrays
1722Ans:A
1723558.
1724The multiplicand register & multiplier register of a hardware circuit implementing booth's algorithm have
1725(11101) & (1100).
1726The result shall be ______.
1727A. (812)10 B. (-12)10
1728C. (12)10 D. (-812)10
1729Ans: A
1730559.
1731Which of the following devices direct network traffic based not by MAC addresses but by software-configured
1732network
1733addresses?
1734[A] Router
1735[B] Hub
1736[C] Bridge
1737[D] NIC
1738Answer: A
1739560.
1740mcq_association identifies the structural (part-of) relationships between entities
1741561.
1742A transaction is delimited by statements (or function calls) of the form __________.
1743a) Begin transaction and end transaction
1744b) Start transaction and stop transaction
1745c) Get transaction and post transaction
1746d) Read transaction and write transaction
1747Ans:a
1748562.
1749_mcq____identifies generalities among entities
1750Abstraction.
1751563.
17521. Simplified form of the boolean expression (X + Y + XY) (X + Z) is
1753A. X + Y + Z
1754B. XY + YZ
1755C. X + YZ
1756D. XZ + Y
1757E. None of the above
1758Ans:C
1759564.
1760Which of the following network devices/systems translates data from one format to another?
1761A. Hub
1762B. DHCP Server
1763C. Gateway
1764D. NIC
1765Ans:C
1766565.
1767In a graph if e=[u,v], Then u and v are called ........
1768A. End points of e
1769B. Adjacent nodes
1770C. Neighbours
1771D. All of the above
1772Ans:D
1773566.
1774Which of the following is not a state in transaction ?
1775a) Active
1776b) Terminated
1777c) Aborted
1778d) Partially committed
1779Ans:b
1780567.
1781___System Requirements_________are a natural way to structure requirements elicitation
1782568.Which of the following terms is used to describe a hardware- or software-based device that protects networks
1783from outside 
1784threats?
1785Ans: Firewall
1786569. TREE[1]=NULL indicates tree is ........
1787A. Overflow
1788B. Underflow
1789C. Empty
1790D. Full
1791Ans:C
1792570.
17931. Which of the following boolean expressions is not logically equivalent to all of the rest ?
1794a. wxy' + wz' + wxyz + wy'z
1795b. w(x + y' + z')
1796c. w + x + y' + z'
1797d. wx + wy' + wz'
1798Ans:c
1799571.
18001. Which of the following statements is true ?
1801572.
1802Identify the characteristics of transactions
1803Ans: Rapid Response, Relaibilty
1804573.
1805Which of the following devices translates hostnames into IP addresses?
1806[A] DNS Server
1807[B] Hub
1808[C] DHCP Server
1809[D] Firewall
1810Answer: A
1811574.
1812Systematic manual analysis of the requirements are termed as___mcq___
1813575.
1814A binary tree whose every node has either zero or two children is called .......
1815A. complete binary tree
1816B. binary search tree
1817C. extended binary tree
1818D. data structure
1819Ans:C
1820576.
1821Using an executable model of the system to check requirements is termed as _mcq_______.
1822577.
1823Which of the following has “all-or-none” property ?
1824a) Atomicity
1825b) Durability
1826c) Isolation
1827d) All of the mentioned
1828Ans:a
1829578.
1830Switch is a Device of _________ Layer of OSI Model.
1831a.network
1832b.data link later
1833c.application layer
1834d.session layer
1835ans:b
1836579.
1837Linked representation of binary tree needs ......... parallel arrays.
1838A. 4
1839B. 2
1840C. 3
1841D. 5
1842Ans:C
1843580.
1844A graphical display of the fundamental products in a truth-table is known as
1845A.Mapping
1846B.Graphing
1847C.T-map
1848D.karnaugh-map
1849Ans:D
1850581.
1851The minimum number of NAND gates required to implement the Boolean function. A + AB' + AB'C is equal to
1852a.0
1853b.1
1854c.4
1855d.7
1856Ans:a
1857582.
1858The database system must take special actions to ensure that transactions operate properly without interference
1859from
1860concurrently executing database statements. This property is referred to as
1861a) Atomicity
1862b) Durability
1863c) Isolation
1864d) All of the mentioned
1865Ans:c
1866583.
1867HUB is a _________ Device and Switch is a ________ Device.
1868a.Unicast, Multicast
1869b.Malticast, Unicast
1870c.Broadcast, Unicast
1871d.None of Above
1872Ans:c
1873584.
1874In a 2-tree, nodes with 0 children are called ............
1875A. Exterior node
1876B. Outside node
1877C. Outer node
1878D. External node
1879Ans:D
1880585.
1881"Is the origin of the requirement clearly stated?" relates to __tracebilty_______
1882586.
1883Star Topology is Based On a Central Device that can be __________ ?
1884(1) HUB
1885(2) Switch
1886(3) Router
1887(4) Both 1 and 2
1888(5) Gateway
1889Ans. (4) 
1890587.
1891Which of the following logic expression is incorrect?
1892a.1 XOR 0 =1
1893b.1 XOR 1 XOR 1=1
1894c.1 XOR 1 XOR 0=1
1895d.1 XOR 1 =0
1896Ans:c
1897588.
1898 In a extended-binary tree nodes with 2 children are called ........
1899A. Interior node
1900B. Domestic node
1901C. Internal node
1902D. Inner node
1903Ans:C
1904589.
1905The property of transaction that persists all the crashes is__________
1906a) Atomicity
1907b) Durability
1908c) Isolation
1909d) All of the mentioned
1910Ans:b
1911590.
1912" Is the requirement properly understood? ",relates to _________
1913591.
1914__________ states that only valid data will be written to the database.
1915a) Consistency
1916b) Atomicity
1917c) Durability
1918d) Isolation
1919Ans:a
1920592.
1921Stable condition in transition table is given by expression
1922mcq
1923593.
1924A terminal node in a binary tree is called ............
1925A. Root
1926B. Leaf
1927C. Child
1928D. Branch
1929Ans:B
1930594.
1931The data on a DVD is held in the form of ....... on the disc.
1932[A] small pits and bumps
1933[B] small bits
1934[C] small bytes
1935[D] None of These
1936Ans:A
1937595.
1938"Can the requirement be changed without a large impact on other requirements?",is related to ___mcq____
1939596.
1940SR latch consists of
1941a.1 input
1942b.2 inputs
1943c.3 inputs
1944d.4 inputs
1945Ans:b
1946597.
1947Requirements that change due to the system’s environment is said to be __mcq_____
1948598.
1949How many digits of the DNIC (Data Network Identification Code) identify the country?
1950[A].first three
1951[B].first four
1952[C].first five
1953[D].first six
1954[E].None of the above
1955Ans:A
1956599.
1957_naive and parametric end user____ users work on canned transactions
1958600.
1959Which of the following ways is a pre-order traversal?
1960A. Left sub-tree, Right sub-tree and root
1961B. Right sub-tree, Left sub-tree and root
1962C. Root, Left sub-tree, Right sub-tree
1963D. Right sub-tree, root, Left sub-tree
1964Ans:C
1965Which of the following ways is a pre-order traversal?
1966601.
1967Requirements that emerge as understanding of the system develops is termed as_________
1968602.
1969The set of all attributes of a relation is called default _____________.
1970603.
19711. Which of the following ways is a in-order traversal?
1972604. 
1973A station in a network forwards incoming packets by placing them on its shortest output queue. What routing
1974algorithm is being used?
1975Answ:Hot potato routing
1976605.
1977Making of transition table consists of
1978Answ:6steps
1979606.
1980Links between dependent requirements refers to _____
1981607.
1982Transaction processing is associated with everything below except
1983Answ: Conforming a action or triggering a response
1984608.
19851. Which of the following ways is a post-order traversal?
1986609.
1987Outputs of SR latch are Q and Q’
1988610.
1989The probability that a single bit will be in error on a typical public telephone line using 4800 bps modem is 10 to
1990the power -3. If no error detection mechanism is used, the residual error rate for a communication line using 9-
1991bit frames is approximately equal to
1992Answ: 0.009
1993611.
1994In asynchronous circuits changes occur with change
1995Answ:input
1996612.
1997The Oracle RDBMS uses the ____ statement to declare a new transaction start and its properties.
1998Answ: SET TRANSACTION
1999613.
2000Frames from one LAN can be transmitted to another LAN via the device
2001Answ:bridge
2002614.
2003An empty list is one which has no
2004a. nodes
2005b. data
2006c. both a and b
2007d. address
2008Answ: C
2009615.
2010Links from the requirements to the design refers to ______traceability
2011ANsw:Requirements tracebility
2012616.
2013Which of the following condition is used to transmit two packets over a medium at the same time?
2014Answ: Collision
2015617.
2016____ means that the data used during the execution of a transaction cannot be used by a second transaction
2017until the first one is completed.
2018Answ: Isolation
2019618.
2020On which principle does queue work?
2021Answ: FIFO(First in first out)
2022619.
2023____________ helps the analyst to understand the functionality of the system and models are used to
2024communicate with customers
2025Answ:System models
2026620.
2027Present states of asynchronous circuits are also called
2028ANsw:Secondary variables
2029621.
2030Items in a priority queue are entered in a _____________ order
2031ANsw: : random
2032622.
2033You have a class A network address 10.0.0.0 with 40 subnets, but are required to add 60 new subnets very soon.
2034You would like to still allow for the largest possible number of host IDs per subnet. Which subnet mask should
2035you assign?
2036Answ: 255.254.0.0
2037623. 
2038R has n tuples and S has m tuples, then the Cartesian product of R and S will produce ___________ tuples.
2039Answ: nR * nS
2040624.
2041________shows the system’s context or environment
2042USECASE
2043625.
2044Race in which stable state depends on order is called
2045Answ:Critical Race
2046626.
2047Wire introduces delay of
2048627.
2049__________is the description of the database
2050Answ:Relational database
2051628.
20521. A ___________ tree is a tree where for each parent node, there is only one associated child node
2053Answ: degenerate tree
2054629.
2055What are the most commonly used transmission speeds in BPS used in data communication?
2056Answ:9600
2057630.
2058_____perspective shows the system or data architecture
2059Answ: Structural perspective
2060631.
2061Instability condition can be determined from
2062632.
2063In _____________tree, the heights of the two child subtrees of any node differ by at most one
2064Answ:AVL TREE
2065633.
2066____ model shows how entities are composed of other entities
2067ANsw:Entity relation ship
2068634.
2069The advantage of DBMS over file systems is
2070Answ: Data redundancy and inconsistency
2071Data sharing
2072Data concurrency
2073Data searching
2074Data integrity
2075Indexing
2076Transaction
2077ACID
2078635.
2079What is the default subnet mask for a class C network?
2080Answ: 255.255.255.0
2081636.
2082_________shows how entities have common characteristics
2083Answ: Generalization
2084637.
2085____________is the first schema to be designed when you are developing a DBMS
2086Answ: conceptual schema
2087638.
2088Which of the following is used for modulation and demodulation?
2089Answ: modem
2090639.
2091Transition table that terminates in total stable state gives
2092640.
2093Which of the following linked list below have only last node of the list pointing to the first node?
2094Answ: circular singly linked list
2095641.
2096Which of the following is not a disadvantage of wireless LAN?
2097A. Slower data transmission
2098B. higher error rate
2099C. interference of transmissions from different computers
2100D. All of the above
2101Answer:d
2102642.
2103________shows the system’s reaction to events
2104643.
2105DBMS cannot be classified on
2106Database management systems can be classified based on several criteria, such as the data model, user
2107numbers and database distribution, all described below.(select from options)
2108644.
2109The time required in best case for search operation in binary tree is
2110Answ: O(1)
2111645.
2112Time delay device is memory element of
2113Answ: asynchronous circuits
2114646.
2115Which of this is not a implementation data model
2116Answ: Conceptual Data Model
2117647.
2118Each logic gate gives delay of
2119Answ:5(d = gh + p formula)
2120648.
2121______ are used to illustrate the boundaries of a system
2122ANsw: Context models
2123649.
21241. Which of the following statements hold true for binary trees?
2125650. 
2126The Internet Control Message Protocol (ICMP)
2127Answ: to provide an error control
2128651.
2129______ show the a system and its relationship with other systems
2130652.
2131Key value pair is usually seen in
2132Answ: Hash Tables
2133653.
2134Minimal super key of a relation is called _______________.
2135Answ: candidate key
2136654.
2137Your company has a LAN in its downtown office and has now set up a LAN in the manufacturing plant in the
2138suburbs. To enable everyone to share data and resources between the two LANs, what type of device(s) are
2139needed to connect them? Choose the most correct answer.
2140ANsw: Router
2141655.
2142NAND latch works when both inputs are
2143Answ:1
2144656.
2145Breadth First search is used in
2146Answ:traversing or searching tree or graph data structures
2147657.
2148The term 'duplex' refers to the ability of the data receiving stations to echo back a confirming message to the
2149sender. In full duplex data transmission, both the sender and the receiver
2150Answ: can receive and send data simultaneously
2151658.
2152__________ may be used to show the processes and the flow of information from one process to another
2153659.
2154Effect of change of input to more than one state is called
2155660. 
2156In SQL, which command is used to issue multiple CREATE TABLE, CREATE VIEW and GRANT statements in
2157a single transaction?
2158a) CREATE PACKAGE
2159b) CREATE SCHEMA
2160c) CREATE CLUSTER
2161d) All of the mentioned
2162661.
2163How many hosts are attached to each of the local area networks at your site?
2164Answ: 254
2165662.
2166_____________models that show the systems response to events
2167Answ: Behavioural
2168663.
2169Change is state occurs during
2170Answ:Evaporation, or vaporization, is the conversion of a substance from a liquid to a gas.
2171664.
2172The combination of selection and Cartesian product operators is ____________ operator
2173Answ:JOIN
2174665.
2175What is the peculiarity of red black trees?
2176Options
2177- In red-black trees, the root do not contain data.
2178- In red-black trees, the leaf nodes are not relevant and do not contain data.
2179- In red-black trees, the leaf nodes are relevant but do not contain data.
2180- Both a and c above
2181666.
2182Naming states is done in
2183Answ:
2184667.
2185___________ are used to describe the logical structure of data processed by the system
2186Answ:Semantic data models
2187668.
2188Which of the following technique is used for fragment?
2189A. a technique used in best-effort delivery systems to avoid endlessly looping packets
2190B. a technique used by protocols in which a lower level protocol accepts a message from a higher level protocol
2191and places it in the data portion of the low level frame
2192C. one of the pieces that results when an IP gateway divides an IP datagram into smaller pieces for
2193transmission across a network that cannot handle the original datagram size
2194D. All of the above
2195E. None of the above
2196669.
2197The attributes in foreign key and primary key have the same ____________
2198Answ:unique combinations of attributes
2199670.
2200Which of the following data structures can’t store non-homogeneous data-elements:
2201Answ:Arrays
2202671. ____________ are lists of all of the names used in the system models.
2203Ans: data dictionaries
2204672. Which of the following statements is false: question not available in vtop
2205673.In SQL, the CREATE TABLESPACE is used
2206Ans: allocate space in the Oracle database where schema objects are stored.
2207674. Contention is
2208Ans: competition for resources
2209675.Delay elements provide
2210Ans: well-defined delays across both temperature and VCC ranges.
2211676.avalanche photodiode receivers can detect hits of transmitted data by receiving
2212A. 100 photons
2213B. 200 photons
2214C. 300 photons
2215D. 400 photons
2216E. None of the above
2217Answer: Option B
2218677.___________ are rectangles with the name at the top, attributes in the middle section and operations in the
2219bottom section
2220Ans: class diagram
2221678. ______________ join requires that the two join attributes have the same name in both relations.
2222Ans: natural join
2223679. Which of the following is a two-way list:
2224a. grounded header list
2225b. circular header list
2226c. linked list with header and trailer nodes
2227d. none of above
2228ans: d (List traversed in two directions)
2229680. Race condition is
2230Ans: A race condition is an undesirable situation that occurs when a device or system attempts to perform two or
2231more operations at the same time
2232681. __________ is referred to as generalisation and is shown ‘upwards’ rather than ‘downwards’ in a hierarchy
2233Ans: Inheritance
2234682. There are two functional dependencies with the same set of attributes on the left side of the arrow:
2235A->BC
2236A->B
2237This can be combined as
2238a) A->BC
2239b) A->B
2240c) B->C
2241d) None of the mentioned
2242Answer:a
2243683. Satellite-Switched Time-Division Multiple Access (SS/TDMA) is
2244A. the method of determining which device has access to the transmission medium at any time.
2245B. a medium access control technique for multiple access transmission media
2246C. a form of TDMA in which circuit switching is used to dynamically change the channel
2247assignments
2248D. All of the above
2249E. None of the above
2250Answer: Option C
2251684. Asynchronous sequential logic circuits are used when primary need is
22521. time
22532. pressure
22543. speed
22554. accuracy
2256ans: speed
2257685. The terms Tail and Head are related to
2258Ans: linked list
2259686. In ______________ Schedule only one transaction at a time is active.
2260Ans: serial schedules
2261687.A system which supports _______ allows object classes to inherit from several super-classes
2262Ans: multiple inheritance
2263688.Internal state and input values altogether are called
22641. full state
22652. total state
22663. initial state
22674. output state
2268ans: total state
2269689.When you ping the loopback address, a packet is sent where?
2270A. On the network
2271B. Down through the layers of the IP architecture and then up the layers again
2272C. Across the wire
2273D. through the loopback dongle
2274E. None of the above
2275Ans: b
2276690.The depth of a complete binary tree is given by:
2277a. Dn = n log2n
2278b. Dn = n log2n+1
2279c. Dn = log2n
2280d. Dn = log2n+1
2281ans: d
2282691.Which of the following TCP/IP protocol is used for transferring electronic mail messages from one machine to
2283another?
2284A. FTP
2285B. SNMP
2286C. SMTP
2287D. RPC
2288E. None of the above
2289Ans: c
2290692.The ____________ identifies the language tokens in the text of the query.
2291Ans: localized tokenization rules
2292693.When representing any algebraic expression E which uses only binary operations in a 2-tree:
2293a. the variable in E will appear as external nodes and operations in internal nodes
2294b. the operations in E will appear as external nodes and variables in internal nodes
2295c. the variables and operations in E will appear only in internal nodes
2296d. the variables and operations in E will appear only in external nodes
2297ans: a
2298694.___________in the UML are used to model interaction between objects
2299Ans: sequential (Behavioural)
2300695.change in state from 00 to 11 will cause change in
2301696. An algorithm that calls itself directly or indirectly is known as:
2302a. Sub algorithm
2303b. Recursion
2304c. Polish notation
2305d. Traversal algorithm
2306ans: b
2307697. Third step of making transition table is
23081. determining feedback loop
23092. designating output of loops
23103. deriving functions of Y
23114. plotting Y
2312Ans: 3
2313698. Which of the following device is used to connect two systems, especially if the systems use different
2314protocols?
2315A. hub
2316B. bridge
2317C. gateway
2318D. repeater
2319Ans: c
2320699. _______ is an inherent part of most prototype development systems
2321Ans: visual programming
2322700. The ______________ checks the query syntax to determine whether it is formulated according to the syntax
2323rules of the query language.
2324Ans: parser
2325701.Code conversion circuits mostly uses
23261. AND-OR gates
23272. AND gates
23283. OR gates
23294. XOR gates
2330Ans: 1
2331702._______________________ is the deadlock free lock
2332703.The synchronous modems are more costly than the asynchronous modems because
2333A. they produce large volume of data
2334B. they contain clock recovery circuits
2335C. they transmit the data with stop and start bits.
2336D. they operate with a larger bandwidth
2337Ans: b
2338704.The inorder traversal of tree will yield a sorted listing of elements of tree:
2339A. Binary trees
2340B. Binary search trees
2341C. Merging
2342D. AVL Trees
2343Ans: b
2344705.___________ can be created quickly from a set of reusable components plus some mechanism to ‘glue’ these
2345component together
2346Ans: prototypes
2347706. In _serializable_ Schedule transactions are executing with interleaved process.
2348707.Value of first linked list index is:
2349A) One
2350B) Zero
2351C) -1
2352D) None of the above
2353Ans: b
2354708. bits full adder contains
2355Ans: Full adder contains 3bits
2356709._______may be used to ‘draw’ the interface and simulate its functionality with components associated with
2357interface entities
2358ans: interface generators
2359710. A distributed network configuration in which all data/information pass through a central computer is
2360A. bus network
2361B. star network
2362C. ring network
2363D. Point-to-point network
2364E. None of the above
2365Answer: Option B
2366711.A ________ is a data-structure that organizes data similar to a line in the super-market, where the first one
2367in the line is the first to be out:
2368A)queue linked list
2369B) stacks linked list
2370C) both of them
2371D) neither of them
2372ans: a
2373712.Which of the following TCP/IP protocol allows an application program on one machine to send a datagram to
2374an application program on another machine?
2375A. UDP
2376B. VMTP
2377C. X.25
2378D. SMTP
2379E. None of the above
2380Answer: Option A
2381713.The participation constraints and cardinality ratio together called as _______________ constraints.
23821. intensive constraints
23832. recursive constraints
23843. composite constraints
23854. structural constraints
2386ans:4
2387714.Nor function is dual of nand gate
2388715.________ techniques include the use of very high-level languages, database programming and prototype
2389construction from reusable components
2390Ans: prototyping
2391716._______ are expressed in a mathematical notation with precisely defined vocabulary, syntax and semantics.
2392Ans: formal specifications
2393717.During _____________ state, transaction issues read and write operations.
2394Ans: active
2395718. Which of the following statements are true? Question not there in vtop
2396719.Simplified expression of half adder carry is
2397720.Which of the following abstract data types is not used by integer abstract data type group?
2398A) Short
2399B) Int
2400C) float
2401D) long
2402Ans:c
2403721.A thread is usually defined as a ‘light weight process’ because an operating system (OS) maintains smaller
2404data structures for a thread than for a process. In relation to this, which of the followings is TRUE?
2405(A) On per-thread basis, the OS maintains only CPU register state
2406(B) The OS does not maintain a separate stack for each thread
2407(C) On per-thread basis, the OS does not maintain virtual memory state
2408(D) On per thread basis, the OS maintains only scheduling and accounting information.
2409Answer (C)
2410722.Subtraction of two binary numbers is done by taking complementing
2411Ans: 1’s complement of the subtrahend.
2412723.Which character function can be used to return a specified portion of a character string?
2413a) INSTR
2414b) SUBSTRING
2415c) SUBSTR
2416d) POS
2417View Answer
2418Answer: c
2419724.The___notation is a mature technique for model-based specification.
2420Ans: z- notation
2421725.In a MAX heap tree .....
2422Ans: Max Heap is a binary tree in which every parent node has greater value than its child nodes...
2423726.The variables which can be accessed by all modules in a program, are known as:
2424Ans: global variables
2425727.The design process for identifying the subsystems making up a system and the framework for sub-system
2426control and communication is ___________
2427Ans: architectural design
2428728.Which of the following is TRUE for the System Variable $date$?
2429a) Can be assigned to a global variable.
2430b) Can be assigned to any field only during design time.
2431c) Can be assigned to any variable or field during run time.
2432d) Can be assigned to a local variable.
2433View Answer
2434Answer: b
2435729.Where can the Belady’s anomaly occur?
2436a. LRU Page Replacement Policy
2437b. MRU Page Replacement Policy
2438c. Optimal Page Replacement Policy
2439d. FIFO Page Replacement Policy
2440ans: d
2441730. Circuits that employs memory elements in addition to gates is called
24421. combinational circuit
24432. sequential circuit
24443. combinational sequence
24454. series
2446ans: 2
2447731. What are the different events in Triggers?
2448Ans: insert, update and delete
2449732. The post order traversal of a binary tree is :DEBFCA, find out the preorder traversal:
2450Ans: abdecf
2451733. When both inputs are 1 output of xor is
2452Ans: output 0
2453734.Which of the following is the creation of a virtual rather than actual version of
2454an operating system?
2455Ans: virtualisation
2456735.Which one of the following models is not suitable for accommodating any change?
2457a) Build & Fix Model
2458b) Prototyping Model
2459c) RAD Model
2460d) Waterfall Model
2461View Answer
2462Answer: d
2463736.Which is not one of the types of prototype of Prototyping Model?
2464a) Horizontal Prototype
2465b) Vertical Prototype
2466c) Diagonal Prototype
2467d) Domain Prototype
2468View Answer
2469Answer: c
2470737.Which is a protocol that one program can use to request a service from a program of
2471another computer on a network?
2472Ans: remote procedure calls
2473738. Which is the subset of SQL commands used to manipulate Oracle Database Structures, including tables?
2474a) Data Definition Language(DDL)
2475b) Data Manipulation Language(DML)
2476c) DML and DDL
2477d) None of the Mentioned
2478View Answer
2479Answer: a
2480739.The post order traversal of a binary tree is :DEBFCA, find out the preorder traversal:
2481Ans:abdecf
2482740.Simplified expression of full adder carry is
2483A. c=xy+xz+yz
2484B. c=xy+xz
2485C. c=xy+yz
2486D. c=x+y+z
2487741.…… is mainly responsible for allocating the resources as per process requirement?
2488(A) RAM
2489(B) Compiler
2490(C) Operating Systems
2491(D) Software
2492742.Half Subtractor also have output to check if 1 has been
2493A. complemented
2494B. borrowed
2495C. carried
2496D. primed
2497743.One of the applications of a linked list:
2498a: Polynomial evaluation b: Postfix expression evaluation
2499c: determining the distance traveled d: none of these
2500744.The SQL statement SELECT SUBSTR(‘123456789’, INSTR(‘abcabcabc’,’b’), 4) FROM EMP; prints
2501A. 6789
2502B. 2345
2503C. 1234
2504D. 456789
2505745.Two bit subtraction is done by
2506A. Demultiplexer
2507B. Multiplexer
2508C. full subtract or
2509D. half subtract or
2510746.Which of the following SQL command can be used to modify existing data in a database table?
2511DML STATEMENTS
2512747.A tree having any number of nodes:
2513a: binary tree b: general tree
2514c: B-tree d: AVL tree
2515748.What is the major drawback of using RAD Model?
2516a) Highly specialized & skilled developers/designers are required.
2517b) Increases re-usability of components.
2518c) Encourages customer/client feedback.
2519d) Both a & c.
2520749.…… is mainly responsible for allocating the resources as per process requirement?
2521(A) RAM
2522(B) Compiler
2523(C) Operating Systems
2524(D) Software.
2525750.When SQL statements are embedded inside 3GL, we call such a program as
2526a) Nested query
2527b) Nested programming
2528c) Distinct query
2529d) Embedded SQL
2530751.The work associated with software engineering can be categorized into three generic phases, regardless of
2531application area, project size, or complexity namely the__________ phase which focuses on what, the_________
2532phase which focuses on how and the_________ phase which focuses on change
25331. Support, 2. Development, 3. Definition
2534a) 1, 2, 3
2535b) 2, 1, 3
2536c) 3, 2, 1
2537d) 3, 1, 2
2538752.A set of several trees that are not linked to each other in any way
2539a: Forest b: Graphs
2540c: B-trees d: none of these
2541753.Besides nand gate universal gate is
2542NOR
2543754.Which of the following plays an important role in modern Operating Systems(OS)?
2544(A) Kernel
2545(B) Shell
2546(C) Fork
2547(D) None
2548755._______________ provides option for entering SQL queries as execution time, rather than at the development
2549stage
2550A) PL/SQL
2551B) SQL*Plus
2552C) SQL
2553D) Dynamic SQL
2554756.Connection from output to one of input gate is
2555A. undefined
2556B. shifted
2557C. feedback
2558D. wire
2559757.FAT stands for
2560a. File Accomodation Table
2561b. File Access Tape
2562c. File Allocation Table
2563d. File Activity Table
2564758.All the non-leaf nodes except the root node in a multi-way search tree of order, n have atleast ...........
2565children
2566a: n-1 children b: n children
2567c: n/2 children d: n*2 children
2568759.Which two models doesn’t allow defining requirements early in the cycle?
2569a) Waterfall & RAD
2570b) Prototyping & Spiral
2571c) Prototyping & RAD
2572d) Waterfall & Spiral
2573760. BAT refers to…
2574A. Compressed Archiv A. Compressed Archive file
2575B. System file
2576C. Audio file
2577D. Backup file
2578D. Backup file
2579761.Heaps are of two types:
2580a: high and low b: max and min
2581c: B and B+ d: none of the above
2582762._______________ is a procedural extension of Oracle – SQL that offers language constructs similar to those in
2583imperative programming languages.
2584a) SQL
2585b) PL/SQL
2586c) Advanced SQL
2587d) PQL
2588763.Which of the following life cycle model can be chosen if the development team has less experience on similar
2589projects?
2590a) Spiral
2591b) Waterfall
2592c) RAD
2593d) Iterative Enhancement Model
2594764.Most significant bit of arithmetic addition is called
2595A. overflow
2596B. carry
2597C. output
2598D. zero bit
2599765.___________ combines the data manipulating power of SQL with the data processing power of Procedural
2600languages.
2601a) PL/SQL
2602b) SQL
2603c) Advanced SQL
2604d) PQL
2605766.Incase of min-heap, the value present in any node is:
2606a: greater than all its children b: smaller than all its children
2607c: equal to all its children d: greater than values in left subtree
2608 and smaller than values in right
2609 subtree
2610767.….. occur commonly in multitasking when two or more threads waiting for each
2611other.
2612(A) Kernel
2613(B) Shell
2614(C) Fork
2615(D) Deadlock
2616768.Two bit addition is done by
2617A. ripple carry adder
2618B. carry sum adder
2619C. full adder
2620D. half adder
2621769.A company is developing an advance version of their current software available in the market, what model
2622approach would they prefer?
2623a) RAD
2624b) Iterative Enhancement
2625c) Both a & b
2626d) Spiral
2627770.AND gates are converted to NAND gates using
2628A. invert OR
2629B. AND invert
2630C. NAND invert
2631D. both a and b
2632771. _______________ has made PL/SQL code run faster without requiring any additional work on the part of the
2633programmer.
2634A) SQL Server
2635B) My SQL
2636C) Oracle
2637D) SQL Lite
2638772.A min-heap is also known as:
2639a: decreasing heap b: descending heap
2640c: low heap d: none of these
2641773.Identify the disadvantage of Spiral Model.
2642a) Doesn’t work well for smaller projects
2643b) High amount of risk analysis
2644c) Strong approval and documentation control
2645d) Additional Functionality can be added at a later date
2646774.Round Robin(RR) scheduling algorithm is suitable for……
2647(A) Real Time Operating Systems
2648(B) Embedded Operating Systems
2649(C) Distributed Operating Systems
2650(D) Time Sharing Operating Systems
2651775.…… is a special system software that is used to handle process scheduling in
2652different ways.
2653(A) Fork
2654(B) Scheduler
2655(C) Spawn
2656(D) None of the above
2657776.A max-heap is also known as:
2658a: increasing heap b: ascending heap
2659c: high heap d: none of these
2660777.Not operation is obtained by using one input
2661778.If you were to create client/server applications, which model would you go for?
2662a) WINWIN Spiral Model
2663b) Spiral Model
2664c) Concurrent Model
2665d) Incremental Model
2666779.A line of PL/SQL text contains groups of characters known as
2667a) Lexical Units
2668b) Literals
2669c) Textual Units
2670d) Identifiers
2671780.Borrow in two bit (x,y) subtraction is 0, as long as
2672781.Purpose of process is to deliver software
2673Purpose of process is to deliver software in a timely manner and with sufficient qualityto satisfy
2674those who have sponsored its creation and those who will use it
2675782.Which one of the following scheduler controls the degree of multiprogramming?
2676Long term scheduler
2677783.A tree in which the value in every node is more than node-values in its left subtree and less than nodevalues in its right subtree:
2678Binary Search Tree
2679784.We use ______________ name PL/SQL program objects and units.
2680A) Lexical Units
2681B) Literals
2682C) Delimiters
2683D) Identifiers
2684785.Code not included in code conversion standard is
2685786.Which of the following is a scheduling algorithm that allows a process to move up
2686and down between queues?
2687(A) Round Robin(RR) scheduling
2688(B) First Come First Served (FCFS) scheduling
2689(C) Multilevel feedback queue scheduling
2690(D) Shortest Job First (SJF) scheduling
2691787.
2692A matrix which has most of its values equal to 0:
2693788.The longer a fault exists in software
2694a) the more tedious its removal becomes
2695b) the more costly it is to detect and correct
2696c) the less likely it is to be properly corrected
2697d) All of the mentioned
2698789.A ___________________ is an explicit numeric, character, string or Boolean value not represented by an
2699identifier.
2700A) Comments
2701B) Literals
2702C) Delimiters
2703D) Identifiers
2704790.OR gates are converted to NAND gates using
2705NOT GATE
2706791.A sparse matrix can also be represented using:
2707a: queue b: stack
2708c: tree d: linked list
2709792.Arrange the following steps to form a basic/general Engineering Process Model
27101. Test, 2. Design, 3. Install, 4. Specification,
27115. Manufacture, 6. Maintain
2712a) 2, 4, 5, 1, 6, 3
2713b) 4, 2, 5, 1, 3, 6
2714c) 2, 4, 5, 1, 3, 6
2715d) 4, 2, 5, 1, 6, 3
2716793.….. commands are automatically loaded into main memory when the booting process
2717gets completed.
2718(A) External
2719(B) Internal
2720(C) Both (A) & (B)
2721(D) None
2722794.If no header is specified, the block is said to be an _______________ PL/SQL block
2723A) Strong
2724B) Weak
2725C) Empty
2726D) Anonymous
2727795.To implement Boolean function with NAND gates we convert function to
2728A. AND logic
2729B. OR logic
2730C. NOR logic
2731D. NAND logic
2732796.Which one of the following is not a step of requirement engineering?
2733a) elicitation
2734b) design
2735c) analysis
2736d) documentation
2737797._________________ is a sequence of zero or more characters enclosed by single quotes.
2738string literal
2739798.A B-tree grows at .............
2740leaf
2741799.Which of the following is an example of Batch Processing Operating Systems?
2742(A) Lynx OS
2743(B) Mac OS
2744(C) UNIX
2745(D) None of the above
2746800.Rather than AND-OR gates combinational circuits are made by
2747A. NAND-NOR
2748B. NAND-OR
2749C. OR only
2750D. AND only
2751801.A binary tree grows at ...............
2752a: root b: leaves
2753c: braches d: any of the above
2754802.….. process checks to ensure the components of the computer are operating and
2755connected properly.
2756a.Booting b.Processing c.saving d.editing
2757803.Shell sort is an improvisation over ........... sort.
2758a: quick- sort b: merge-sort
2759c: insertion-sort d: none of these
2760804.QFD stands for
2761Quality function deployment
2762805.Which of the following is true for the algorithms for memory allocation?
2763(A) First Fit
2764(B) Best Fit
2765(C) Worst Fit
2766(D) All of the above
2767806. Combinations that are not listed for input variables are
2768a.overflow
2769 b.carry
2770c.borrow
2771d.don’t care
2772807.To reduce disk-accesses while searching for a record, the tree used is ............ tree.
2773a: binary sorted tree b: B-tree
2774c: general tree d: AVL tree
2775808.Which according to you is the most important stakeholder from the following?
2776a) Entry level personnel
2777b) Middle level stakeholder
2778c) Managers
2779d) Users of the software
2780809.…… is a way of processing data serially.
2781(A) spooling
2782(B) caching
2783(C) Paging
2784(D) All of the above
2785810.Multiple variable xor is defined as
2786A. inverted or function
2787B. prime function
2788C. even function
2789D. odd function
2790811. What are the four dimensions of Dependability
2791a) Usability, Reliability, Security, Flexibility
2792b) Availability, Reliability, Maintainability, Security
2793c) Availability, Reliability, Security, Safety
2794d) Security, Safety, Testability, Usability
2795812.While calculating time-complexity, the program-time which is considered is:
2796a: compile time b: execution time
2797c: both compile and run-time d: none of the above
2798813.Which type oaf scheduler typically uses a FIFO or Priority queue?
2799(A) Short Term Scheduler
2800(B) Medium Term Scheduler
2801(C) Long Term Scheduler
2802(D) All of the above
2803814.Flipflops are
2804815.Which of the following is a solution to fragmentation problem?
2805(A) Thread
2806(B) Kernel
2807(C) Paging
2808(D) All of the above
2809816.The time complexity of the following algorithm is:
2810sum(a,n){
2811s=0;
2812for i= 1 to n
2813{
2814 s=s+a[i];
2815}
2816return s;
2817}
2818ANS:5N+3-==>O(N)
2819817.Reduction of flip-flops in a sequential circuit is referred to as
2820A. reduction
2821B. state reduction
2822C. next state
2823D. both a and b
2824818.What are the types of requirement in Quality Function Deployment(QFD)
2825a) Known, Unknown, Undreamed
2826b) User, Developer
2827c) Functional, Non-Functional
2828d) Normal, Expected, Exciting
2829819.How many Scenarios are there in elicitation activities?
2830a) One
2831b) Two
2832c) Three
2833d) Four
2834As-is Scenario, Visionary Scenario, Evaluation Scenario and Training Scenario
2835820.Switch which clears flipflop to its initial state is called
2836A. clock
2837B. invert
2838C. hold
2839D. clear
2840821.Which of the following scheduling algorithms provide minimum average waiting
2841time?
2842a) FCFS
2843b) SJF
2844c) Round – robin
2845d) Priority
2846822.Complexity of heap sort (n log(n))
2847823.In moore model outputs are functions of
2848A. present state
2849B. input state
2850C. next state
2851D. both a and b
2852824.Medium term scheduler is based on
2853(A) Scroll in, Scroll out
2854(B) Fetch in, Fetch out
2855(C) Swap in, Swap out
2856(D) None of the above
2857825.Static analysers are software tools for ________________
2858Source code analysis.
2859826. If there are more than one paths between two nodes, it is a:
2860a: tree b: graph
2861c: circular linked list d: none of the above
2862827.State of flipflop can be switched by changing its----signals
2863a)input b)output c)triggering d)clearing
2864828.________checks the consistency of routine and procedure declarations and their
2865use.
2866Ans:Interface analysis
2867Information flow analysis:Identifies the dependencies between input and output variables.
2868Path analysis:identifies the all possible paths through the program and set out the statements executed in that
2869path.
2870829.Which of the following is a type of Semaphores?
2871a) mutex & counting
2872b) binary & counting
2873c) counting & decimal
2874d) decimal & binary
2875830.The leaf nodes of a tree have height equal to:
2876a: height of the tree b: zero
2877c: one d: none of these
2878831.A binary tree with n internal nodes has a max. of external nodes equal to:
2879a: n-1 b: n+1
2880c: n d: n/2
2881832.The philosophy behind __________is defect avoidance rather than defect removal .
2882ANS:Cleanroom SE
2883833.Latches are
2884834.……. systems are required to complete a critical task within a guaranteed amount of time.
2885A. Virtual B. Soft real time C. Hard Real time D. None of these
2886835.Long Term Scheduler is a……
2887(A) CPU scheduler
2888(B) process swapping scheduler
2889(C) job scheduler
2890(D) None of the above
2891836.Momentary change in state of flipflop is called
2892A)tri-state B)unstable state C)inverter d) trigger
2893837.In _____________start with high-level system and integrate from the top-down replacing individual
2894components by stubs where appropriate
2895ANS:Top-Down Testing.
2896838.Height of a full binary tree with n internal nodes is:
2897a: n log n b: n
2898c: n+1 d: log n
2899839.First Come First Serve(FCFS) is
2900(A) Preemptive scheduling
2901(B) Non-preemptive scheduling
2902(C) deadline scheduling
2903(D) None of the above
2904840.Feedback among logic gates make asynchronous system
2905A. stable
2906B. unstable
2907C. complex
2908D. combinational
2909841.The degree of a leaf node is:
2910a: 1 b: 0
2911c: -1 d:2
2912842.______testing exercises the system beyond its maximum design load .
2913ANS:Stress testing
2914843.________ are an alternative function-related measure to function points when 4Gls or similar languages are
2915used for development
2916ANS:ObjectPoints
2917844.Definite time in a flipflop is called
2918A. clear time
2919B. pulse time
2920C. hold time
2921D. reset time
2922845.….. is a system call that causes the caller to block.
2923ANS:Sleep
2924846.A right in-threaded binary tree contains:
2925847.…… is the process of switching of CPU from one thread to another.
2926ANS:Context Switching
2927848.___ is the number of functions which are called by function X
2928849.. A two-dimensional array array[1:3, 1:3] contains _________ elements.
2929850.M flip-flops produces
2930A. 2^m-1 states
2931B. 2-1 states
2932C. 2^m+1 states
2933D. 2^m states
2934851.The measure of the average length of words and sentences in documents is termed as __________.
2935852.The algorithm used in dynamic memory allocation with minimum time:
2936a: First fit b: Best fit
2937c: Worst fit d: Next fit
2938853.Which of the following is an example of Real Time Operating Systems?
2939A) Lynx OS
2940(B) Mac OS
2941(C) UNIX
2942(D) None of the above
2943854.Next state of B(t) will be
2944855.In mealy model outputs are functions of current state and current inputs
2945856.Which of the following is a function of an OS?
2946(A) Process Management
2947(B) I/O Management
2948(C) Memory Management
2949(D) All of the above
2950857.Which of the following is/are the operations performed by kruskal's algorithm.
2951i) sort the edges of G in increasing order by length ii) keep a subgraph S of G initially empty iii)
2952builds a tree one vertex at a time
2953ANS:I and ii
2954858.
2955A __________ is an old system that still provides essential business services
2956ANS:Legacy Systems
2957859.
2958The ___defines the types of documents to be managed and a document naming scheme
2959860.…… is a technique used to speed up communication with slow devices
2960(A) Fragmentation
2961(B) Caching
2962(C) Segmentation
2963(D) None of the above.
2964861.A multi-dimensional array array[0:2, 10:20, 3:4, -10:2] contains _________ elements.
2965862.In T flipflop when state of T flipflop has to be complemented T must be
2966A. 0
2967B. 1
2968C. t
2969D. t+1
2970863.Rather than build a subgraph one edge at a time ............................... builds a tree one vertex at a time.
2971A) kruskal’s algorithm
2972B) prim’s algorithm
2973C) dijkstra algorithm
2974D) bellman ford algorithm.
2975864.Time sequence for flip-flop can be enumerated by
2976A. state table
2977B. map
2978C. truth table
2979D. graph
2980865.Dijkstra’s banking algorithm for resource allocation is used for
2981(A) Deadlock detection
2982(B) Deadlock prevention
2983(C) Deadlock avoidance
2984(D) Deadlock recovery
2985866.
2986Which of the following is not an advantage of software reuse?
2987a) lower costs
2988b) faster software development
2989c) high effectiveness
2990d) lower risks
2991867.Table that lists inputs for required change of states is called
2992Flip flop excitation table
2993868.
2994.................. is known as a greedy algorithm, because it chooses at each step the cheapest edge to add to subgraph
2995S.
2996A)Kruskal’salgorithm
2997B)Prim’salgorithm
2998C)Dijkstraalgorithm
2999D) Bellman ford algorithm
3000869.
3001Which of the following is/are commonly used architectural pattern(s)?
3002a) Model-View-Controller
3003b) Layered Architecture
3004c) Client–server
3005d) All of the mentioned
3006870.
3007…… is the smallest unit for processing that consists of a program counter, a stack &
3008a set of registers.
3009(A) Compiler
3010(B) Thread
3011(C) Heap
3012(D) None of the above
3013871.
3014Which of the following services is not supported by the OS?
3015(A) I/O Operation
3016(B) Protection
3017(C) Compilation
3018(D) None of the above
3019872. Classification of sequential circuit depends on timings of their
3020A. feedback path
3021B. gates
3022C. signals
3023D. complex circuits
3024873. The recurring aspects of designs are called design…………….
3025a) Patterns
3026b) documents
3027c) structures
3028d) method
3029874
3030The result of prim's algorithm is a total time bound of ...............…
3031A) O(logn)
3032B) O(m+n logn)
3033C) O(mn)
3034D) O(m logn)
3035875.
3036SRD stands for:
3037a. Software Requirements Definition
3038b. Structured Requirements Definition
3039c. Software Requirements Diagram
3040d. Structured Requirements Diagram
3041876.
3042Which of the following is used to remove deadlock?
3043(A) Preemption
3044(B) Mutual Exclusion
3045(C) Circular Wait
3046(D) None of the above
3047877.
3048The ..................... process updates the costs of all the vertices V, connected to a vertex U, if we could improve the
3049best estimate of the shortest path to V by including (U,V) in the path to V.
3050A)relaxation
3051B)improvement
3052C)shortening
3053D) Costing
3054878.Which state a flip-flop circuits can maintain as long as a power is delivered to circuit?
3055A. n states
3056B. tri state
3057C. binary state
3058D. octa state
3059879.Negative transition in flip-flops are referred to as
3060A. clock
3061B. negative edge
3062C. positive edge
3063D. both a and b
3064880.If every requirement can be checked by a cost-effective process, then the SRS is
3065A)verifiable b)traceable c)modifiable d)complete
3066881.
3067................. turns out that one can find the shortest paths from a given source to all points in a graph in the same
3068time.
3069Dijistras Algoriithm
3070882.First Come First Serve (FCFS) Scheduling is…….
3071(A) Preemptive scheduling
3072(B) Non-preemptive scheduling
3073(C) deadline scheduling
3074(D) None of the above
3075883.Requirements can be refined using:
3076A)the waterfall model b)prototyping model c)the evolutionary model d) the spiral model
3077884.Clock generator, generates periodic train of
3078A. feedback path
3079B. gates
3080C. clock pulses
3081D. both a and b
3082885.
3083................ keeps two sets of vertices; S, the set of vertices whose shortest paths from the source have already
3084been determined and V-S, the remaining vertices.
3085A)Kruskal’salgorithm
3086B)Prim’salgorithm
3087C)Dijkstraalgorithm
3088D) Bellman ford algorithm
3089886.……… is a system call of OS that is used to create a new process?
3090Fork()
3091887.In flipflop if set input is returned to 0, output
30920
3093888.
3094Structured charts are a product of
3095A)Requirements gathering b)Requirements Analysis c)Design D)Coding
3096889.
3097................. Is a more generalized single source shortest path algorithm which can find the shortest path in a
3098graph with negative weighted edges?
3099A)Kruskal’salgorithm
3100B)Prim’salgorithm
3101C)Dijkstraalgorithm
3102D) Bellman ford algorithm
3103890.
3104Which of the following is an example of Cooperative MultiTasking OS?
3105(A) Lynx OS
3106(B) Mac OS
3107(C) MS DOS
3108(D) None of the above
3109891.By default counters are incremented by
3110Ans:One
3111892.The performance of Round Robin(RR) scheduling depends on……
3112(A) quantum
3113(B) priority
3114(C) preemption
3115(D) None of the above
3116893.A sample application of ................. algorithm is to solve critical path problem, i.e. finding the longest path
3117through a DAG.
3118A)DAGapplicationpathalgorithm
3119B)DAGshortestpathalgorithm
3120C)DAGcriticalpathalgorithm
3121D) Bellman ford algorithm
3122894.Which is not a step of requirement engineering?
3123a. Requirements elicitation
3124b. Requirements analysis
3125c. Requirements design
3126d. Requirements documentation
3127895.
3128…… occurs in a dynamic memory allocation system when most of the free blocks are
3129too small to satisfy any request?
3130Ans:Fragmentation
3131896.Simplest registers only consists of
3132A. counter
3133B. EPROM
3134C. latch
3135D. flip-flop
3136897.The floyd-warshall all pairs shortest path algorithm computes the shortest paths between each pair of nodes
3137in ....................…
3138A)O(logn)
3139B)O(n^2)
3140C)O(mn)
3141D) O(n^3)
3142898.Which of the following is not a Requirement Management workbench tool?
3143a) RTM
3144b) DOORS
3145c) Rational Suite
3146d) RDD 100
3147899.
3148According to a statistical report: “over 30% of all software projects are cancelled before completion and over 70%
3149of the remainder fail to deliver expected features”. What must be the reason for such a situation?
3150a) Poor change management
3151b) Poor requirements management
3152c) Poor quality control
3153d) All of the mentioned
3154900.Which of the following holds the data currently being worked on?
3155(A) Stack pointer
3156(B) Program Counter
3157(C) Accumulator
3158(D) None of the above
3159901.
3160A decimal counter has _______ states
3161a) 5
3162b) 10
3163c) 15
3164d) 20
3165902.
3166Dijkstra algorithm is also called the ...................... shortest path problem.
3167A) multiple source
3168B) single source
3169C) single destination
3170D) multiple destination
3171903. Memory that is called a read write memory is
3172A. ROM
3173B. EPROM
3174C. RAM
3175D. Registers
3176904.
3177The total number of processes completed per unit time is termed as
3178a) Output
3179b) Throughput
3180c) Efficiency
3181d) Capacity
3182905.COTS stands for_____
3183a) Commercial Off-The-Shelf systems
3184b) Commercial Off-The-Shelf states
3185c) Commercial Off-The-System state
3186d) None of the mentioned
3187906.
3188Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder
3189traversal. Respectively, of a complete binary tree. Which of the following is always true?
3190(a) LASTIN = LASTPOST
3191(b) LASTIN = LASTPRE
3192(c) LASTPRE = LASTPOST
3193(d) None of the above
3194907.
31952 left shifts are referred to as multiplication with 2^2
3196908.
3197.….. is generic and that can run on any OS.
3198Ans:User level thread
3199909.
3200Which of the following property does not correspond to a good Software Requirements Specification (SRS)?
3201a) Verifiable
3202b) Ambiguous
3203c) Complete
3204d) Traceable
3205910.The most appropriate matching for the following pairs
3206 X: Indirect addressing 1: Loops Y: Immediate addressing 2: Pointers Z: Auto decrement addressing 3: Cons
3207tants
3208Ans:x2,y3,z1
3209910.
3210The most appropriate matching for the following pairs
3211X: depth first search 1: heap
3212Y: breadth-first search 2: queue
3213Z: sorting 3: stack
3214ANSWER:X—3 Y—2 Z-1
3215911.
3216Which of the following is multi threading model?
3217912.
3218Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right sub
3219stress, respectively, of node X. Note that Y and Z may be NULL, or further nested. Which of the following
3220represents a valid binary tree?
3221A) (1 2 (4 5 6 7))
3222(B) (1 (2 3 4) 5 6) 7)
3223(C) (1 (2 3 4)(5 6 7))
3224(D) (1 (2 3 NULL) (4 5))
3225913.Ripple counters are also called
3226A. SSI counters
3227B. asynchronous counters
3228C. synchronous counters
3229D. VLSI counters
3230914.The SRS is said to be consistent if and only if:
3231a) its structure and style are such that any changes to the requirements can be made easily while retaining the
3232style and structure.
3233b) every requirement stated therein is one that the software shall meet
3234c) every requirement stated therein is verifiable
3235d) no subset of individual requirements described in it conflict with each other
3236915.Consider the following Statement: “The output of a program shall be given within 10secs of event X 10% of
3237the time”. What characteristic of SRS is being depicted here?
3238a) Consistent
3239b) Verifiable
3240c) Non-verifiable
3241d) Correct
3242916.…….files represent physical devices like printers, terminals etc.,
3243(A) Ordinary files
3244(B) Directory files
3245(C) Special files
3246(D) None of the above
3247917.Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to
3248determined if there are two elements with sum less than 1000 in s. which of the following statements is true?
3249a) t (n) is 0 (1)
3250b) n < t (n) < n log2n
3251c) n log2n < t (n) <nC2
3252d) t (n) =nC2
3253918.Binary counter that count incrementally and decremently is called
3254a) Up-down counter
3255b) LSI counters
3256c) Down counter
3257d) Up counter
3258919.Shift registers having four bits will enable shift control signal for
3259A. 2 clock pulses
3260B. 3 clock pulses
3261C. 4 clock pulses
3262D. 5 clock pulses
3263920.B+ trees are preferred to binary trees in databases because
3264(A) Disk capacities are greater than memory capacities
3265(B) Disk access is much slower than memory access
3266(C) Disk data transfer rates are much less than memory data transfer rates
3267(D) Disks are more reliable than memory
3268921.At Conceptual level Class diagrams should include:
3269a) operations only
3270b) attributes only
3271c) both (a) and (b)
3272d) None of the mentioned
3273922.An interrupt that is reserved for unrecoverable memory errors is called……
3274a) nonmaskable interrupts
3275b) blocked interrupts
3276c) maskable interrupts
3277d) none of the mentioned
3278923.Process Control Block (PCB) is also called……
3279A. Task Controlling Block
3280B. Control block
3281C. Memory Block
3282D. Data Block
3283924.
3284Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of
3285these pairs identify a tree uniquely?
3286i) preorder and postorder
3287ii) inorder and postorder
3288iii) preorder and inorder
3289iv) level order and postorder
3290a) (i) only
3291b) (ii), (iii)
3292c) (iii) only
3293d) (iv) only
3294925.Which of the following pattern is the basis of interaction management in many web-based systems?
3295a) architecture
3296b) repository pattern
3297c) model-view-controller
3298d) different operating system
3299926.A group of binary cells is called
3300A. counter
3301B. register
3302C. latch
3303D. flip-flop
3304927.The process that is currently being executed is called
3305ANS:Running
3306928.Synchronous counter is a type of
3307a) SSI counters
3308b) LSI counters
3309c) MSI counters
3310d) VLSI counters
3311929.The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12,
331216. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the
3313root)?
3314a) 2
3315b) 3
3316c) 4
3317d) 6
3318930.The context diagram is also known as:____
3319Context-Level Data-Flow Diagram or a Level-0 Data Flow Diagram
3320931.A 8bit flip-flop will have
3321A. 2binary cells
3322B. 4binary cells
3323C. 6binary cells
3324D. 8binary cells
3325932.ER model shows the _______
3326a. Static view
3327b. Functional view
3328c. Dynamic view
3329d. All the above
3330933.…… holds the address of the next instruction to be executed?
3331ANS:Program Counter
3332934.A data structure is required for storing a set of integers such that each of the following operations can be
3333done in (log n) time, where n is the number of elements in the set.
3334 o Delection of the smallest element
3335 o Insertion of an element if it is not already present in the set
3336Which of the following data structures can be used for this purpose?
3337(a) A heap can be used but not a balanced binary search tree
3338(b) A balanced binary search tree can be used but not a heap
3339(c) Both balanced binary search tree and heap can be used
3340(d) Neither balanced binary search tree nor heap can be used
3341935.Which of the following condition leads to deadlock?
3342a) mutual exclusion
3343b) a process may hold allocated resources while awaiting assignment of other resources
3344c) no resource can be forcibly removed from a process holding it
3345d) all of the mentioned
3346936.Which of the property of software modularity is incorrect with respect to benefits software modularity?
3347a) Modules are robust.
3348b) Module can use other modules
3349c) Modules Can be separately compiled and stored in a library.
3350d) Modules are mostly dependent.
3351937.The best data structure to check whether an arithmetic expression has balanced parentheses is a
3352A:queue
3353B:stack
3354C:tree
3355D:list
3356938.Parallel load transfer is done in
3357A. 1 cycle
3358B. 2 cycle
3359C. 3 cycle
3360D. 4 cycle.
3361939._______________ is a measure of the degree of interdependence between modules
3362a) Cohesion
3363b) Coupling
3364c) None of the mentioned
3365940.Level order traversal of a rooted tree can be done by starting from the root and performing
3366a) preorder traversal
3367b) in-order traversal
3368c) depth first search
3369d) breadth first search
3370941.To start counting enable input should be
3371942.Effective bandwidth is bandwidth that network needs to allocate for the
3372A. Flow of Data
3373B. Flow of Cost
3374C. Flow of Traffic
3375D. Flow of Amount
3376943.Ripple counter can not be described by
3377A. Boolean equation
3378B. clock duration
3379C. graph
3380D.
3381E. flow chart
3382944.Which of the following is not a use of a CASE tool?
3383a. Support structured analysis and design (SA/SD)
3384b. Maintains the data dictionary
3385c. Checks whether DFDs are balanced or not
3386d. It complies with the available system.
3387945.Which type of scheduler is used in batch systems?
3388(A) Medium Term Scheduler
3389(B) Short Term Scheduler
3390(C) Long Term Scheduler
3391(D) None of the above
3392946.Postorder traversal of a given binary search tree, T produces the following sequence of keys
339310, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29
3394Which one of the following sequences of keys can be the result of an in-order traversal of the tree T?
3395a) 9, 10, 15, 22, 23, 25, 27, 29, 40, 50, 60, 95
3396b) 9, 10, 15, 22, 40, 50, 60, 95, 23, 25, 27, 29
3397c) 29, 15, 9, 10, 25, 22, 23, 27, 40, 60, 50, 95
3398d) 95, 50, 60, 40, 27, 23, 22, 25, 10, 9, 15, 29
3399947.What DFD notation is represented by the Rectangle?
3400a) Transform
3401b) Data Store
3402c) Function
3403d) None of the mentioned
3404948.In Quality of Service, Jitter is variation in delay for packets belonging to the
3405A. Same Flow
3406B. Parallel Flow
3407C. Protocol Flow
3408D. Both B & C
3409949.Time between clock pulses are called
3410A. bit duration
3411B. clock duration
3412C. duration
3413D. bit time
3414950.In the worst case, the number of comparisons needed to search a singly linked list of length n for a given
3415element is
3416a) log 2 n
3417b) n/2
3418c) log 2 n – 1
3419d) n
3420951.In DFDs, user interactions with the system is denoted by:
3421a) Circle
3422b) Arrow
3423c) Rectangle
3424d) Triangle
3425952.Message queuing is managed by?
3426(A) Shell
3427(B) Kernel
3428(C) Fork
3429(D) None of the above
3430953.Control unit in serial computer generates a
3431954.Which one of the following in place sorting algorithms needs the minimum number of swaps?
3432(A) Quick sort
3433(B) Insertion sort
3434(C) Selection sort
3435(D) Heap sort
3436955.Interrupt latency should be…… for Real Time Operating Systems (RTOS)?
3437(A) minimal
3438(B) maximum
3439(C) zero
3440(D) None of the above
3441956.Which of the following is not a user interface design process?
3442a) User, task, and environment analysis and modeling
3443b) Interface design
3444c) Knowledgeable, frequent users
3445d) Interface validation
3446957.J=K=0 will make flip-flops
3447A. changed
3448B. reversed
3449C. unchanged
3450D. Stopped.
3451958.Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search
3452tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal
3453sequence of the resultant tree?
3454a) 7 5 1 0 3 2 4 6 8 9
3455b) 0 2 4 3 1 6 5 9 8 7
3456c) 0 1 2 3 4 5 6 7 8 9
3457d) 9 8 6 4 2 3 0 1 5 7
3458959.The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number
3459of nodes in a binary tree of height h is:
3460(A) 2^h -1
3461(B) 2^(h-1) – 1
3462(C) 2^(h+1) -1
3463(D) 2*(h+1)
3464960.Down counter decrement value by
3465A. 1
3466B. 2
3467C. 3
3468D. 4
3469961.Which design identifies the software as a system with many components interacting with each other?
3470a. Architectural design
3471b. High-level design
3472c. Detailed design
3473d. Both B & C.
3474962.In Integrated Services, when a source makes a reservation, it needs to define a
3475A. Flow Control
3476B. Timer
3477C. Error Solution
3478D. Flow Specification
3479963.Which of the following sorting algorithms has the lowest worst-case complexity?
3480a) Insertion sort
3481b) Selection sort
3482c) Quick sort
3483d) Heap sort
3484964.The high paging activity is called………
3485a)Inter process communication
3486b)Thrashing
3487c) Context Switch
3488d)None of the above
3489965.What incorporates data, architectural, interface, and procedural representations of the software?
3490a) design model
3491b) user’s model
3492c) mental image
3493d) system image
3494966.BCD stands for
3495a. Binary Coded Decimal
3496b. Bit Coded Decimal
3497c. Binary Coded Digit
3498d. Bit Coded Digit
3499967.Which is not a valid state of a thread?
3500a) running
3501b) parsing
3502c) ready
3503d) blocked
3504968.The Breadth First Search algorithm has been implemented using the queue data structure. One possible
3505order of visiting the nodes of the following graph is
3506(A) MNOPQR
3507(B) NQMPOR
3508(C) QMNPRO
3509(D) QMNPOR
3510969.PLA stands for
3511A. programmable lead array
3512B. programmable logic agency
3513C. predicted logic array
3514D. programmable logic array
3515970.What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single
3516node is 0.
3517(A) 2
3518(B) 3
3519(C) 4
3520(D) 5
3521971.A BCD counter is a
3522A. mod-5 counter
3523B. mod-10 counter
3524C. mod-15 counter
3525D. mod-20 counter
3526972.Four different attributes to control traffic have been devised in
3527A. Data Relay
3528B. Source Relay
3529C. Frame Relay
3530D. IP Relay
3531973.To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the
3532data structure to be used is:
3533A. Queue
3534B. Stack
3535C. Heap
3536D. B-Tree
3537974.The …… register is read by the host to get input
3538a) flow in
3539b) flow out
3540c) data in
3541d) data out.
3542975.Binary ripple counter is made up of
3543A. T flip-flop
3544B. JK flip-flop
3545C. RS flip-flop
3546D. both a and b
3547976.7 segment generates output
3548A. a to b
3549B. a to f
3550C. a to g
3551D. a to z
3552977.Which one of the following is a key factor for preferring B-trees to binary search trees for indexing database
3553relations?
3554(a)Database relations have a large number of records
3555(b) Database relations are sorted on the primary key
3556(c) B-trees require less memory than binary search trees
3557(d) Data transfer form disks is in blocks
3558978.Frames from one LAN can be transmitted to another LAN via the device
3559A. Router
3560B. Bridge
3561C. Repeater
3562D. Modem
3563E. None of the above
3564979.In a complete binary tree, the number of leaves with n internal nodes is: (n+1)/2
3565980.The …… register is read by the host to get input
3566a) flow in
3567b) flow out
3568c) data in
3569d) data out.
3570981.In 14 pin gate pin no 7 is
3571A. Vcc
3572B. Vdd
3573C. ground
3574D. AC
3575982.The recurrence relation capturing the optimal time of the Tower of Hanoi problem with n discs is
3576(A) T(n) = 2T(n – 2) + 2
3577(B) T(n) = 2T(n – 1) + n
3578(C) T(n) = 2T(n/2) + 1
3579(D) T(n) = 2T(n – 1) + 1
3580983.What is a stub network?
3581A network that has one entry point and one exit point.
3582984.BCD to 7 segment is
3583A. decoder
3584B. encoder
3585C. Multiplexer
3586D. Demultiplexer
3587985.3x8 decoder will have
35883 inputs and 8 outputs
3589986.The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the
3590following is the postorder traversal sequence of the same tree?
3591(A) 10, 20, 15, 23, 25, 35, 42, 39, 30
3592(B) 15, 10, 25, 23, 20, 42, 35, 39, 30
3593(C) 15, 20, 10, 23, 25, 42, 35, 39, 30
3594(D) 15, 10, 23, 25, 20, 35, 42, 39, 30
3595987.Which of the following device is used to connect two systems, especially if the systems use different
3596protocols?
3597A. hub
3598B. bridge
3599C. gateway
3600D
3601.
3602repeater
3603E. None of the above
3604988.Which one of the below is divide and conquer approach?
3605A - Insertion Sort
3606B - Merge Sort
3607C - Shell Sort
3608D - Heap Sort
3609989.Match the following:
3610A. Repeaters 1. Data Link Layer
3611B. Bridges 2. Network Layer
3612C. Routers 3. Physical Layer
3613A. A --->2, B--->3, C--->1
3614B. A--->3, B---->1, C---->2
3615C. A--->3,B----->2, C---->1
3616D. A---->1, B---->2, C---->3
3617990.Control of shift register labeled as SH/LD =0 will be in parallel load mode
3618991.In most of logic gates 1 means
3619A. 0V
3620B. 1V
3621C. 5V
3622D. 10V
3623992.Stack is used for
3624993.Producer – Consumer problem, one of the classical problems of synchronization is
3625also called……
3626Bounded Buffer Problem.
3627994.Match the following:
36281. Segments A. Associated with Data Link Layer
36292. Packets B. Associated with Network Layer
36303. Frames C. Associated with Transport Layer
36313-A,2-C,1-B
3632995.In 14 pin gate pin no 14 is
3633A. Vcc
3634B. Vdd
3635C. ground
3636D. AC.
3637996.Minimum number of queues required for priority queue implementation?
3638A)One
3639B)Two
3640C)Three
3641D)Four
3642997.Which of the following algorithm is not stable?
3643a) Insertion sort
3644b) Selection sort
3645c) Bubble sort
3646d) Merge sort
3647998.When J and complement of K are 1, flipflop QA after shift is equal to
3648A. 1
3649B. 0
3650C. reset
3651D. defined
3652999.Which of the following command is used to print current working directory in Unix?
3653ANS:PWD
36541000.Which of the below given sorting techniques has highest best-case runtime complexity -
3655(A) Quick sort
3656(B) Selection sort
3657(C) Insertion sort
3658(D) Bubble sort
36591001.In OSI network architecture, the dialogue control and token management are responsibilities of ?
3660a. session layer
3661b. network layer
3662c. transport layer
3663d. data link layer
3664e. none of above
36651002.To clear flip-flops we use
3666A. toggle switch
3667B. push button
3668C. Multiplexer
3669D. Demultiplexer
36701003.Two cross coupled NAND gates make
3671A. SR Latch
3672B. RS flip-flop
3673C. D flip-flop
3674D. master slave flip-flop
36751004.……. is a classic synchronization problem that involves the allocation of limited resources amongst a group
3676of processes in a deadlock free and starvation free manner.
3677Dining philosopher problem.
36781005.Which of the following uses memoization?
3679a. Greedy approach
3680b. Divide and conquer approach
3681c. Dynamic programming approach
3682d. None of the above
36831006.Heap is an example of
36841007.Mostly gates works on
3685A. 5V
3686B. 4V
3687C. 3V
3688D. 2V
36891008.……. is a system call that returns the process ID of the parent of the current process.
3690ANS: getppid()
36911009.Relationship between clock output and master slave output gives
3692A. timing diagram
3693B. map
3694C. chart
3695D. Table.
36961010.From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.
3697a. e-n+1
3698b. n-e+1
3699c. n+e-1
3700d. e-n-1
37011011.
3702What is the main function of transport layer? 
3703A) Node to node delivery
3704B) End to end delivery
3705C) Synchronization
3706D) Updating and maintaining routing tables
37071012.
3708Which of the following is standard print command in Unix?
37091013.
3710Full adder consists of
37111014.
3712An adaptive sorting algorithm -
3713Bubble Sort,Insertion Sort,
37141015.
3715The time required to search an element in a linked of length n is
3716ANS:O(n).
37171016.
3718In Unix, “file” command is used to determine ……
3719File type of a file.
37201017.
3721Strobe S in a mux acts as
3722A. enable
3723B. reset
3724C. clear
3725D. stop
37261018.
3727The complexity of linear search algorithm is o(n)
37281019.
3729Two sub layers of OSI Data Link layer are which of the following?
3730Logical link control and media access control
37311020.
3732IC no of NOT gate
37337404
37341021.
3735Four gates in a package is called
3736A. biruple
3737B. octruple
3738C. dualruple
3739D. quadruple
37401022.
3741The complexity of binary search algorithm is o(logn)
37421023.
3743…… provides an Interface between the process and the Operating System
3744ANS:SYSTEM CALL
37451024.
3746The resolution of externally defined symbols is performed by?
3747Linker
37481025.A search begins the search with the element that is located in the middle of array
3749ANS:BINARY SEARCH.
37501026.
37517404 is a
3752Ans:7404 is a NOT gate IC.
37531027.
3754…… is a system call that runs an executable file into an existing process.
3755ANS:EXEC.
37561028.
3757The complexity of Bubble sort algorithm is o(n2)
37581029.Decimal digit in BCD can be represented by
3759A. 1 input line
3760B. 2 input lines
3761C. 3 input lines
3762D. 4 input lines
37631030.IC of 7 segment display contains
3764A. 4 leds
3765B. 5 leds
3766C. 6 leds
3767D. 7 leds
37681031.
3769The complexity of Insertion sort algorithm is
3770Best case o(n)
3771Average and Worst case o(n2)
37721032.
3773One userlevel thread is mapped to many kernel level thread is known as….
3774a) Many to One model
3775b) One to Many model
3776c) Many to Many model
3777d) One to One model
37781033.In Operating Systems, a single thread is termed as
3779ANS:Light weight process
37801034.Counters that transfer invalid states to valid states are called
3781A. valid counters
3782B. self-starting counters
3783C. invalid counters
3784D. undefined counters
37851035.
3786The complexity of Merge sort algorithm is o(nlogn)
37871036.
3788Which of the following sorting algorithms does not have a worst case running time of O(n2)
3789Quick sort
3790Selection Sort
3791Insertion Sort
3792Bubble Sort
3793None of the above
37941037.……. is a system call that returns the process ID of current process.
3795Getppid()
37961038. In BCD no. 1010 has
3797A. meaning
3798B. no meaning
3799C. value
3800D. Vcc
38011039.In Unix, “cat” command is used to display ……
3802ANS:concatenate
38031040.Control of shift register labeled as SH/LD =1 will shift
38041041.To sort many large objects or structures, it would be most efficient to
3805A.Place reference to them in and array an sort the array
3806B
3807.
3808Place them in a linked list and sort the linked list
3809C.Place pointers to them in an array and sort the array
3810D
3811.
3812Place them in an array and sort the array
38131042.Which of the following command is used to create terminal connection to another
3814host in Unix?
3815ANS:telnet
38161043.
3817Shift register whose input is connected to select output is called feedback shift register
38181044.
3819Which of the following sorting procedure is the slowest?
3820A.Quick sort
3821B.Heap sort
3822C.Shell sort
3823D
3824.
3825Bubble
3826sort
38271045.4 bit gray code can be converted into
3828A. 4bit binary
3829B. 3bit binary
3830C. 2bit binary
3831D. 1bit binary
38321046.file system with 300 GByte disk uses a file descriptor with 8 direct bloc addresses, I indirect block address
3833and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block
3834address is 8 Bytes. The maximum possible file size in this file system is
3835(A) 3 Kbytes
3836(B) 35 Kbytes
3837(C) 280 Bytes
3838(D) Dependent on the size of the disk
38391047.
3840Which of the following algorithm design technique is used in the quick sort algorithm?
3841A)Dynamic programming
3842B)Backtracking
3843C)Divide and conquer
3844D)Greedy method
38451048.
3846The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
3847(a) 11 (b) 12
3848(c) 13 (d) 14
38491049.
3850Which protocol working at the Transport layer provides a connectionless service between hosts?
3851A)IP
3852B)ARP
3853C)TCP
3854D)UDP
38551050.Lamp handball game uses application of
3856A. unidirectional shift register
3857B. bidirectional shift register
3858C. serial shift register
3859D. parallel shift register
38601051.A process executes the code
3861fork();
3862fork();
3863fork();
3864The total number of child processes created is
3865Ans:2^3-1.
38661052.
3867Which of the following statement is true ?
38681053.Parity checker is used for
3869A. detection
3870B. testing
3871C. debugging
3872D. error
38731054.Given two sorted lists of size m and n respectively. The number of comparisons needed in the worst case by
3874the merge sort algorithm will be?
3875A. m ×× n
3876B. max(m, n)
3877C. min(m, n)
3878D. m+n-1
38791055. ICMP [Internet Control Message Protocol] is primarily used for
3880a) error and diagnostic functions
3881b) addressing
3882c) forwarding
3883d) none of the mentioned
38841056. At start of lamp handball game ball (indicator lamp) is placed at
3885A. top
3886B. left
3887C. bottom
3888D. right
38891057. Which of the following TCP/IP protocol is used for transferring electronic mail messages from one machine
3890to another?
3891SMTP
38921058.Rate of movement of light in lamp handball game is determined by clock's
3893A. input
3894B. frequency
3895C. voltage
3896D. current
38971059.Merge sort uses ?
3898Divide and conquer algorithm
38991060.The following sequence of operation is performed on stack :
3900push(1),push(2),pop,push(1),push(2),pop,pop,pop,push(2),pop.
3901The sequence of popped out values are ?
3902A. 2,2,1,1,2
3903B. 2,2,1,2,2
3904C. 2,1,2,2,1
3905D. 2,1,2,2,2
39061060. Let the time taken to switch between users the kernel modes of execution be t1 while the time taken to
3907switch between two processes be t2. Which of the following is TRUE?
3908(A) t1 > t2
3909(B) t1 = t2
3910(C) t1 < t2
3911(D) Nothing can be said about the relation between t1 and t2
39121062.After 9 counts BCD counter goes back to
3913A. 0
3914B. 9
3915C. 1
3916D. 10
39171063. A self-contained block of statements that perform a coherent task of some kind is called a?
3918A. Monitor
3919B. Function
3920C. Program
3921D. Structure
39221064.Which of the following statements are true ?
3923I Shortest remaining time first scheduling may cause starvation
3924II Preemptive scheduling may cause starvation
3925II Round robin in better than FCFS in terms of response time
3926ANS:All the three
39271065.When mode of adder subtract or is 0 it will give
3928A. A-B
3929B. A+B
3930C. A/B
3931D. A*B
39321066.Decimal digits are displayed on
39331067.Recursion is sometimes called ?
3934(A) Circular definition
3935(B) Complex definition
3936(C) Procedure
3937(D) Union
39381068.A system uses FIFO policy for page replacement. It has 4 page frames with no
3939pages loaded to begin with . The system first accesses 100 distinct pages in some
3940order and then accesses the same 100 pages but now in the reverse order .How
3941many page faults will occur ?
3942(A) 196
3943(B) 192
3944(C) 197
3945(D) 195
39461069.No of NAND gate is 7400
39471070.Two dimensional arrays are also called ?
3948ANS:Tables arrays and matrix arrays.
39491071.A multilevel page table is preferred in comparison to a single level page table for
3950translating virtual address to physical address because
3951(A) It reduces the memory access time to read or write a memory location.
3952(B) It helps to reduce the size of page table needed to implement the virtual address space of a
3953process.
3954(C) It is required by the translation lookaside buffer.
3955(D) It helps to reduce the number of page faults in page replacement algorithms.
39561072.Consider a disk system with 100 cylinders. The requests to access the cylinders
3957occur in following sequence :
39584, 34, 10, 7, 19, 73, 2, 15, 6, 20
3959Assuming that the head is currently at cylinder 50, what is the time taken to
3960satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and
3961shortest seek time first policy is used ?
3962(A) 95ms
3963(B) 119ms
3964(C) 233ms
3965(D) 276ms
39661073.
3967The expression X=4+2%-8 evaluates ?
3968ANS:6
39691074.Logic probe is used for
3970A logic probe is a hand-held test probe used for analyzing and troubleshooting the logical states
3971(Boolean 0 or 1) of a digital circuit.
39721075.Determine which of the following is valid character constant ?
3973(A) ‘\\’
3974B) ‘\0’
3975(C) ‘xyz’
3976(D) ‘\052’
39771076.Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?
3978A)In deadlock prevention, the request for resources is always granted if the resulting state is
3979safe
3980B)In deadlock avoidance, the request for resources is always granted if the resulting state is safe
3981C)Deadlock avoidance is less restrictive than deadlock prevention
3982D)Deadlock avoidance requires knowledge of resource requirements apriori..
39831077.Master slave flipflop can be constructed with
3984 The master—slave flip-flop is constructed with two latches. The master latch is loaded with
3985the condition of the J-K inputs while the clock is high. When the clock goes low, the slave
3986takes on the state of the master and the master is latched.
39871078.Given the statement , maruti.engine.bolts=25 . Which of the following is true?
39881. structure bolts is nested within structure engine
39892. structure engine is nested within structure maruti
39903. structure maruti is nested within structure engine
39914. structure maruti is nested within structure bolts
39921079.Consider the following statements about user level threads and kernel level threads. Which one of the
3993following statements is FALSE?
3994(A) Context switch time is longer for kernel level threads than for user level threads.
3995(B) User level threads do not need any hardware support.
3996(C) Related kernel level threads can be scheduled on different processors in a multi-processor system.
3997(D) Blocking one kernel level thread blocks all related threads.
39981080.9 in binary code is represented by
3999ANS:1001
40001081.Where does the swap space reside ?
4001(a) RAM
4002(b) Disk
4003(c) ROM
4004(d) On-chip cache
40051082.To access a structure element using a pointer, ......... operator is used?
4006ANS:Arrow Operator.
40071083.Serial adder can be converted to serial adder subtract or using
40081084.The ........ operator is a technique to forcefully convert one data type to the other ?
4009(A) Cast
4010(B) Conversion
4011(C) Type
4012(D) Uniary
40131085.Each gate has a delay of
4014A. 1
4015B. 2
4016C. 3
4017D. 4
40181086.If a host broadcasts a frame that includes a source and destination hardware address, and its purpose is to
4019assign IP addresses to itself, which protocol at the Network layer does the host use?
4020A.RARP
4021B. ARPA
4022C.ICMP
4023D.TCP
4024E. IPX
40251087.Consider a set of n tasks with known runtimes , r1 r2...... rn to be run on a uniprocessor machine. Which of
4026the following processor scheduling algorithms will result in the maximum throughput ?
4027A. Round Robin
4028B. Shortest job first
4029C. Highest response ratio next
4030D. first come first served
40311088.Which of the following numerical value is invalid constant ?
4032A. 0.7
4033B. 9.3el2
4034C. 27,512
4035D. 12345678
4036E. None of the above
40371089.
4038To load data to shift register its SH/LD pin should be
4039A. 1
4040B. 0
4041C. reset
4042D. undefined
40431090.int a[10] will occupy ________ number of bits in the memory
4044Solution:Int-4bytes
4045A[10]=10*4=40 bytes.
40461 byte=8 bits.
4047ANS:320bits
40481091.Which one of the following protocols is NOT used to resolve one form of address to another one?
4049(A) DNS
4050(B) ARP
4051(C) DHCP
4052(D) RARP
40531092.When mode of adder subtractor is 1 it
4054A. adds
4055B. subtracts
4056C. divides
4057D. multiplies
40581093.Cache memory works on the principle of_____.
4059ANS:Locality Of Reference.
40601094.
4061A two-dimensional array array[1:3, 1:3] contains _________ elements.
40621095.
4063Which of the following statements is false ?
40641096.Left most position in lamp handball game is the
4065A. wall
4066B. fence
4067C. ball
4068D. indicator
40691097.Which of the following is/are example(s) of stateful application layer protocols?
4070(i) HTTP (ii) FTP (iii) TCP (iv) POP3
40711098.
4072A multi-dimensional array array[0:2, 10:20, 3:4, -10:2] contains _________ elements.
40731099.
4074Which are the correct array initialization statements? 
40751100.
4076Von Neumann architecture is ______.
4077A. SISD B. SIMD
4078C. MIMD D. MISD
4079You have 10 users plugged into a hub running 10Mbps half-duplex. There is a server connected to the switch
4080running 10Mbps half-duplex as well. How much bandwidth does each host have to the server?ANS: 10mbps
40811102.
4082Which of the following statements are wrong statements?
40831103.
408416x4 RAM indicates that memory location are ANS: 4 bits
40851104.
4086What is the default subnet mask for a class C network? ANS: 255.255.255.0
40871105.
4088When you ping the loopback address, a packet is sent where?
4089ANS: down through the layers of IP architecture and then up the layers again
40901106.
4091Which is not an application of array? ANS:
40921107.
4093In a vectored interrupt. ANS: the interrupting source supplies the branch info to the processor through
4094an interrupt vector.

40951108.
4096When mode of adder subtractor is 0 it gives ANS: A+B
40971109.
4098Which among the following pairs of operations is supported by an array ADT? ANS: copy and delete
40991110.
4100Which one of the following is a Class C IP address? ANS: 204.67.118.54
41011111.
4102In a memory-mapped I/O system, which of the following will not be there?
4103ANS: LDA(loading into accumulator)
41041112.
4105You have an IP of 156.233.42.56 with a subnet mask of 7 bits. How many hosts and subnets are possible
4106assuming that subnet 0 is not used? ANS: 128 subnets and 512 hosts
41071113.
4108The number of elements in array Array[1:u] is given by ANS:
4109LED stands for ANS: light emitting diode
41101115.
4111The number of elements in array Array[l1:u1, l2:u2] is given by ANS:
41121116.
4113What is the maximum number of IP addresses that can be assigned to hosts on a local subnet that uses the
4114255.255.255.224 subnet mask?ANS:30
41151117.
4116The number of elements in array Array[l1:u1, l2:u2, l3:u3] is given by ANS:
4117If an Ethernet port on a router were assigned an IP address of 172.16.112.1/25, what would be the valid subnet
4118address of this host? ANS: 172.16.112.0
41191119.
4120If memory access takes 20 ns with cache and 110 ns without it, then the ratio (cache uses a 10 ns memory) is
4121ANS: 90%
41221120.
4123Identify the correct sequence in which the following packets are transmitted on the network by a host when a
4124browser requests a webpage from a remote server, assuming that the host has just been restarted. ANS: DNS
4125query, TCP SYN, HTTP GET request
41261121.
41274bit parallel adder produces output of ANS: 40ns with a delay of 10ns
4128For the array A[1:u1, 1:u2] where α is the base address, A[i,1] has its address given by ANS:
41291123.
4130____is a step-by-step procedure for calculation
41311124.
4132What is split horizon? ANS: Split horizon is a method of preventing a routing loop in a network. The
4133basic principle is simple: Information about the routing for a particular packet is never sent back in
4134the direction from which it was received.

41351125 8 input mux will have 3 select lines
4136The addressing mode used in an instruction of the form ADD X Y, is ANS:index
41371127.
4138What is route poisoning? ANS: Route poisoning is a method of preventing a network from sending
4139packets through a route that has become invalid.
41401128.
4141A mathematical-model with a collection of operations defined on that model is called ANS: ADT(abstract data
4142type)
41431129.
4144_________ register keeps track of the instructions stored in program stored in memory ANS: PC(program
4145counter)
4146In Congestion Control, DVL stands for ANS: delay vs load
41471131.
4148Representation of data structure in memory is known as: ANS: ADT
41491132.
4150At start of addition carry flag is ANS:
CLEARED
41511133.
4152Which of the following is considered an Abstract Data Type? ANS: vector
4153In Congestion, CBR stands for ANS: constant bit rate
41541135.
41552x1 mux has ANS: 1 select line,2 inputs,1output
41561136.
4157An algorithm must be generic enough to solve all problems of a particular class. This property is termed as ___
4158ANS:
41591137.
4160In Congestion Control, a bit can be set in a packet moving in direction opposite to congestion in ANS: backward
4161signaling.
4162A packet which is sent by a node to source to inform it of congestion is called ANS: choke packet

41631139.
4164(2FAOC)16 is equivalent to ANS: (001011111010 0000 1100)2

41651140.
4166The first step of development of an algorithm is ANS: Obtain a description of the problem.
41671141.
4168Adder subtractor operating on mode 1 at (X xor 1) gives ANS: x’
4169Token bucket allows bursty traffic to be regulated at ANS: maximum rate
41701143.
4171Input instance for which algorithm take minimum possible time is called ANS: best case time complexity
41721144.
4173In adder subtractor circuit when addition exceeds from 15 output carry becomes ANS: 1
41741145.
4175Input instance for which algorithm take maximum possible time is called ANS: worst case time complexity
4176In Congestion Control, packet is put at end of input queue while waiting to be ANS: checked
41771147.
4178Assembly language ________.ANS:
41791148.
4180Packets wait in a buffer (queue) until node is ready to process them in ANS:FIFO
41811149.
4182Which case analysis appropriate when the response time of the algorithm is critical?
4183ANS: worst case analysis
4184RS flipflop works on ANS: NAND and NOR gates
41851151.
4186A leaky bucket algorithm shapes bursty traffic into fixed-rate traffic by averaging the ANS: data rate

41871152.
4188The time complexity of the algorithm in a best case would be expressed as ANS: theta
41891153.
4190The TTL field has value 10. How many routers (max) can process this datagram?
4191ANS: 10
4192The condition Top= -1 indicates that stack is empty
41931155.
4194Serial addition can be done with ANS: shift register

41951156.
4196Suppose that a bus has 16 data lines and requires 4 cycles of 250 nsecs each to transfer data. The bandwidth of
4197this bus would be 2 Megabytes/sec. If the cycle time of the bus was reduced to 125 nsecs and the number of cycles
4198required for transfer stayed the same what would the bandwidth of the bus? ANS: 2megabyte/sec
41991157.
4200Which field helps to check rearrangement of the fragments? ANS: offset
4201Which of the following name related to stacks? ANS: LIFO list, piles, pushdown lists
4202Not related-FIFO lists
42031159.
4204A method to provide secure transmission of email is called ANS:PGP(pretty good privacy)

42051160.
4206In Reverse Polish notation, expression A*B+C*D is written as ANS: AB* CD* +
42071161.
4208Example of primitive recursion is ANS: Ackermann function
4209X+y=z represents operation that is ANS: Terenary relation
42101163.
4211Stack works on the principles: ANS: last in first out (LIFO) or first in last out(FILO)
42121164.
4213Which of the following field of the TCP header tells how many bytes may be sent starting at the byte
4214acknowledged? ANS: window size
42151165.
4216To put the microprocessor in the wait state ANS: lower the READY input
4217The term MAX and MIN is related to the ANS:
42181167.
4219If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the transmission
4220before division? ANS: 111111000
42211168.
4222Which of the following is the condition of circular queue overflow? ANS: rear>=size-1 and front=0
42231169.
4224Electric digital systems use signals that have 2 distinct values and circuit elements having 2 stable states
4225As the data packet moves from the upper to the lower layers, headers are ANS: added
42261171.
4227Number of machine cycles required for RET instruction in 8085 microprocessor is ANS: 3

42281172.
4229A data structure where elements can be added or removed at either end but not in the middle ANS: dequeuer
4230(double ended queue)

42311173.
4232What is the first address of a block of classless addresses if one of the addresses is 12.2.2.76/27? ANS:12.2.2.64
4233In which notation operator comes between operand? ANS: INFIX
42341175.
4235A packet whose destination is outside the local TCP/IP network segment is sent to ..... ANS: default gateway

42361176.
4237Transference of information from one register to another is ANS: register transfer

42381177.
4239An instruction used to set the carry flag in a computer can be classified as ANS:logical
4240In which notation operator is comes after operand? ANS: POSTFIX

42411179.
4242In link state routing algorithm after the construction of link state packets, new routes are computed using: ANS:
4243Dijkstra's algorithm
42441180.
4245Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing
4246algorithm are updated........... ANS: exchange info with neighbours nodes
42471181.
4248Microprocessor 8085 is the enhanced version of ......... with essentially the same construction set ANS:8080
4249In which notation operator is comes before operand? ANS: PREFIX

42501183.
4251In IPv4 header, an HLEN value of decimal 10 means ANS:there are 40 bytes in the header
42521184.
4253Which of the following is not a application of Stack? ANS:
42541185.
4255In a microprocessor system, the RST instruction will cause an interrupt ANS:
4256Only if interrupts are enabled by EI instruction
4257Queue works on the principles: ANS: FIFO(first in first out)

42581187.
4259Subtraction of two signed numbers is performed with
4260ANS: 2’s complement
42611188.
4262In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24
4263packets are required to transmit the message, the packet size is ......... ANS: 5 bytes
42641189.
4265Decimal number 5 in 2421 coding ANS: 1011

4266A technique called ______ is used to create a subnetting effect ANS: proxy ARP

42671191.
4268Which of the following is related to Queue? ANS:
42691192.
4270Which of the following is not a weighted code? ANS: excess 3-cod

42711193.
4272The infix expression for the postfix expression : 5,6,2+*12,4/- ANS: 37
4273In _______ forwarding, the destination address is a network address in the routing table ANS: network
4274specific
42751195.
4276Representation of 8620 in binary is ANS: 10000110101100

42771196.
4278Answer of following postfix expression: 2,3,10+*8,2/-
42791197.
4280The Open Shortest Path First (OSPF) protocol is an intradomain routing protocol based on _______ routing.
4281ANS: link state
4282UDP packets are encapsulated in ____ ANS: IP datagram
42831199.
4284The average time required to reach a storage location in memory and obtain its contents is called the ____ ANS:
4285access time
42861200.
4287The postfix expression for the infix expression : a+b*c/d ANS: postfix:dc/b*a+
42881201.
4289To avoid the race condition, the number of processes that
4290may be simultaneously inside their critical section is ANS: 1
4291The prefix expression for the infix expression : a+b*c/d ANS:prefix:+a*b/cd
42921203.
4293-9 with signed 2's complement representation is ANS: 1111110111
42941204.
4295Which of the following is not a type of Dequeue? ANS:
42961205.
4297The circuit used to store one bit of data is known as_ ANS: flip flop
4298A system program that combines the separately compiled modules of a program into a form suitable for
4299execution ANS: linking loader

43001207.
4301Which data structure will you use to evaluate prefix notation? ANS: stack
43021208.
4303The strategy of allowing processes that are logically runnable to be temporarily suspended is called preemptive
4304scheduling
43051209.
4306Decimal number 4 in excess-3 coding is 0111
4307Which of the following is not the operation on stack?
4308OPERATIONS: push, pop,isempty,isfull,peek,size
43091211.
4310Computers use addressing mode techniques for
4311A.giving programming versatility to the user by providing facilities as pointers to memory counters for loop
4312control
4313B. to reduce no. of bits in the field of instruction
4314C. specifying rules for modifying or interpreting address field of the instruction
4315D. All the above
43161212.
4317Which of the following systems software does the job of merging the records from two files into one? Utility
4318program
43191213.
4320A node carries information regarding data and link
4321Digital no system is said to be of base or radix of 10
43221215.
4323Fork is System call fork() is used to create processes. It takes no arguments and returns a process ID. The
4324purpose of fork() is to create a new process, which becomes the child process of the caller. After a new child
4325process is created, both processes will execute the next instruction following the fork() system call. Therefore, we
4326have to distinguish the parent from the child. This can be done by testing the returned value of fork().
43271216.
4328Thrashing is a process that is busy swapping pages in and out. Requires more memory than it wants.
43291217.
4330A linked list is which type of data structure. Linear and dynamic
4331Characters that can be specified in 6-bit code are ASCII or Burroughs BCL

43321219.
4333What characteristic of RAM memory makes it not suitable for permanent storage? It is volatile
43341220.
4335Supervisor state is called a privileged state, because the user has no access to it. There are some
4336instructions that are illegal in the user mode and are meant to be used only in the supervisor mode.
43371221.
4338Type of storage is used to represent Lists ANS:
4339Linear order linked list is provided through pointer

43401223.
4341Voltage operated circuits represent ANS: Binary Variables
43421224.
4343Interprocess communication Inter process communication (IPC) is a mechanism which allows processes to
4344communicate each other and synchronize their actions. Processes can communicate with each other using these
4345two ways:
43461. Shared Memory
43472. Message passing
4348ANS: allows processes to synchronize activity
43491225.
4350Which of the following addressing modes, facilitates access to an operand whose location is defined relative to
4351the beginning of the data structure in which it appears? index
4352In a Single Link List_________ node contains no links. Pointer node

43531227.
4354The amount of time required to read a block of data from a disk into memory is composed of seek time,
4355rotational latency, and transfer time. Rotational latency refers to the time its takes for the platter to make a
4356full rotation
43571228.
4358X=1010100 and Y=1000011 using 2's complement X-Y is 10001
43591229.
4360In Single Linked List a node contain minimum how many fields(assuming one for data). ANS:2 fields,1 for
4361data and the other for pointer
4362A system program that sets up an executable program in main memory ready for execution is loader
43631231.
4364Single link list performs which of the following methods 1) Insertion 2) Modification 3) Searching ANS:
4365insertion
43661232.
4367If an odd parity is adopted, parity bit is chosen in such that total no of 1's is odd

43681233.
4369Which of the following are loaded into main memory when the computer is booted? internal command
4370instructions

43711234.
4372In linked lists there are no NULL links in: circular linked lists
43731235.
4374The FIFO algorithm: first executes the job that came in first in the queue
43751236.
4376Translation from symbolic program into Binary is done in 2 passes
43771237.
4378The list with no node is called as empty list
4379842 + 537 = 0001 0011 0111 0101
43801239.
4381What is the name given to the organized collection of software that controls the overall operation of a computer?
4382Operating system
43831240.
4384Resolution of externally defined symbols is performed by linker
43851241.
4386(1010.011)2 = 1111110010.00000010110
4387MAX heap can be used to sort the data in an ascending sorting
43881243.
4389System generation: varies in difficulty with systems

43901244.
4391-9 with signed magnitude representation is ANS:
43921245.
4393Which of the following is the application of the singly linked list?
4394a) To implement file systems
4395b) For separate chaining in hash-tables
4396c) To implement non-binary trees
4397d) All of the mentioned
43988723 in BCD 1000_0111_0010_0011

43991247.
4400Which of the following will contain more memory space? ANS:
44011248.
4402In virtual memory systems, Dynamic address translation is hardware necessary to implement paging
44031249.
4404In polynomial manipulation, nodes consists of three field representing coefficient, exponent, common
4405variable.
4406Using 10's complement 3250-72532 is - 69282
44071251.
4408Fragmentation of the file system can be temporarily removed by compaction
44091252.
4410A linked list in which last node contain the link of the first node is called circular linked list

44111253.
4412Product of 1011 and 101 :110111
4413A non-relocatable program is one which cannot be made to execute in any area of storage other than the
4414one designated for it at the time of its coding or translation
44151255.
4416The memory allocation scheme subject to "external" fragmentation is segmentation
44171256.
44182's complement of 1101100 is 0010100
44191257.
4420A singly linked list facilitates list traversal in single direction (forward)
4421Page stealing : is taking page frames from other working sets
44221259.
4423A doubly linked list facilitates list traversal in forward and reverse directions

44241260.
4425Binary logic consists of binary values and logical operations

44261261.
4427ASCII stands for American Standard Code for Information Interchange.
4428Linked list START=NULL is underflow

44291263.
4430Memory management is: critical for even the simplest operating systems
44311264.
4432In a linked list, the pointer of the last node contains null pointer

44331265.
4434Which is the layer of a computer system between the hardware and the user program operating system
44351266.
4436(10110001101011.11110010)2 in hexadecimal is 2C6B.F2

44371267.
44389's complement of 546700 is 999999-546700 = 453299

44391268.
4440In which linked list, nodes in form of ring? Circular linked list

44411269.
4442Which is the first program run on a computer when the computer boots up?
4443Operating system
4444Balancing symbol is an application of stack

44451271.
4446Multiprogramming systems: execute more jobs in same time period
44471272.
4448Binary code that distinguishes ten elements must contain at least 4bits

44491273.
4450Which of the following pair of data structures are both non-linear type? Tree and graph
4451The operating system creates _____ from the physical computer virtual computers

44521275.
44539's complement of 012395 is 987601 

44541276.
4455How is the capacity of running several program simultaneously known ? ANS:
44561277.
4457Gray code representation of 14 is 1001
44581278. To represent hierarchical relationship between elements, which data structure is suitable? TREE
44591279.
4460Which component performs the main or key tasks of operating system ? ANS:
44611280.
4462A binary tree whose every node has either zero or two children is called extended binary tree
44631281.
446410's complement of 246700 is 753300
44651282.
4466The depth of a complete binary tree is given by Dn = log2n+1
44671283.
446810's complement of 012398 is 987601
44691284.
4470What kind of system is it that several users can use simultaneously? Diamond touch
44711285.
4472Which of the following page replacement algorithm use the technique of replace that page which is not used in
4473the near future? Optimal
4474X=1010100 and Y=1000011 using 1's complement Y-X is -0010001
44751287.
4476The post order traversal of a binary tree is DEBFCA. Find out the in order traversal BDEACF

44771288.
4478The preorder traversal of a binary tree is ABDECF. Find out the post order traversal DEBFCA
44791289.
4480The set of pages that a process is currently using is called as working set
4481(41)10 in binary is 101001

44821291.
4483Convert (0.6875)10 to binary 0.1011(2)

44841292.
4485The in order traversal of a binary tree is ABFCD. Find out the pre order traversal FABCD
44861293.
4487Which of the following memory management scheme loads all pages of a program from disk into main memory?
44881294. Addition of -6 and -13
44891295.
4490The process of storing and restoring from PCB is called context switch
44911296.
4492Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
4493Children(3) = 7, Children(10) = 40. How many leaves does it have? ANS:
44941297.
4495e*x=x*e=x is the ANS:
4496Star topology is used in for LAN(homes, offices)
44971299.
4498Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
4499Children(3) = 7, Children(10) = 40. How many of the nodes have at least one sibling? ANS:
45001300.
4501Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
4502Children(3) = 7, Children(10) = 40. What is the value stored in the parent node of the node containing 30? ANS:
45031301.
4504Minterms are also called standard product
4505MaxTerms are also known as standard sum
4506A remote batch-processing operation in which data is solely input to a central computer would require a:
4507simplex lines
45081303.
4509ICMP (Internet Control Message Protocol) is a protocol that handles error and control messages
45101304.
4511Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
4512Children(3) = 7, Children(10) = 40. How many descendents does the root have? ANS:
45131305.
4514Maxterms are also called standard sums(sop)
4515Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
4516Children(3) = 7, Children(10) = 40. How many children does the root have?ANS:
45171307.
4518x+xy=x is known as redundancy law
45191308.
4520If you get both local and remote echoes, every character you type will appear on the screen twice
45211309.
4522What part of 192.168.10.51 is the Network ID, assuming a default subnet mask? 192.68.10
4523Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
4524Children(3) = 7, Children(10) = 40. What is the depth of the tree? ANS:
45251311.
4526Most preceded operator is ANS:
45271312.
4528A. (a+b+c)'= ANS: a'b'c'
45291313.
4530The slowest transmission speeds are those of twisted pair wire
4531Which of the following statement is false?
45321315.
4533x+x'y= x+y
45341316.
4535A noiseless 3 KHz Channel transmits bits with binary level signals. What is the maximum data rate? 6kbps
45361317.
4537A full binary tree with n leaves contains 2n-1 nodes
45381318.
4539Carrier is ANS: a continuous frequency capable of being modulated or impressed with a second signal
4540

45411319.
4542A full binary tree with n non-leaf nodes contains 2n+1 nodes

45431320.
4544Primed or unprimed variable is ANS: variable in boolean expression
45451321.
4546A binary variable can take values of 0 and 1
4547A complete binary tree of level 5 has how many nodes? 63
45481323.
4549What can greatly reduce TCP/IP configuration problems? DHCP Server

45501324.
4551Traversing binary tree first root and then left and right subtrees called preorder traversal.
45521325.
4553According to Boolean algebra x.x is equal to x(idempotent law)

4554In CRC there is no error if the remainder at the receiver is 0

45551327.
4556One that is not postulate of Boolean algebra
4557Postulates: identity, commutative, complement, distributive, associative

45581328.
4559The maximum number of nodes on level i of a binary tree is 2^I-1
45601329.
4561Which of the following statements is correct for the use of packet switching?
4562A. the subdivision of information into individually addressed packets in conjunction with alternative routing
4563arrangement enabled the transmission path to be altered in the event of congestion or individual link failure.
4564B.’the employment of additional intelligence within the network enabled more sophisticated error control and
4565link control procedures to be applied
4566C.by employing wide bandwidth circuits for the trunk networks substantial economies through extensive sharing
4567of capacity could be achieved.
4568D. All of above
4569A binary tree is generated by inserting in order of the following integers: 50, 15, 62, 5, 20, 58, 3, 8, 37, 60, 24 the
4570number of nodes in the left of the root respectively is
4571(7,4)

45721331.
4573FTP server listens to connections on port 21

45741332.
45752^3 would have ANS: 8 states
45761333.
4577An identity element w.r.t addition 0
4578Which of the following traversal techniques lists the nodes of a binary search tree in ascending order? inorder
45791335.
4580A front-end processor is
4581a minicomputer that relieves main-frame computers at a computer centre of communications
4582control functions
45831336.
4584Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
4585Children(3) = 7, Children(10) = 40. Which pair of nodes have equal number of descendants? ANS:
45861337.
4587Exclusive-OR is an exclusive disjunction
4588In Tunnel mode, the authentication header is inserted immediately after the IP header.
45891339.
4590What kind of list is best to answer questions such as "What is the item at position n?" Singly linked list

45911340.
4592What is the port number for NNTP? 119
45931341.
4594As per Boolean algebra theorem (x')' is equal to x
4595Eight stations are competing for the use of a shared channel using the 'Adaptive tree Walk Protocol'. If the
4596stations 7 and 8 are suddenly become ready at once, how many bit slots are needed to resolve the contention? 7
4597slots

45981343.
4599Which of the following is not the operation on Queue?
4600Operations: enqueue, dequeue, initialize

46011344.
4602One that shows distributive law of addition over multiplication
4603a+(bc)= (a+b)(a+c)

46041345.
4605Demorgan law over addition is (a+b)’= a’.b’
46061346.
4607In C programming, when we remove an item from bottom of the stack, then − stack will rearrange items
46081347.
4609Usually, it takes 10-bits to represent one character. How many characters can be transmitted at a speed of 1200
4610BPS? 120
46111348.
4612(x')' is x
46131349.
4614To connect a computer with a device in the same room, you might be likely to use coaxial cable
4615Re-balancing of AVL tree costs ANS: o(logn)

46161351.
4617An adaptive sorting algorithm − ANS: uses the existing inputs
insertion sort, adaptive heap sort,
4618adaptive merge sort, patience sort, shell sort.
46191352.
4620How many bits internet address is assigned to each host on a TCP/IP internet which is used in all
4621communications with the host? 32bits

46221353.
4623Any number with an exponent of zero is equal to: 1
4624A full subtractor circuit requires ANS: 3 inputs 2 outputs
46251355.
4626Which of the following sorting method is unstable? Quick sort

46271356.
4628A network with Bandwidth of 10 Mbps can pass only an average of 12000 frames per minute with each frame
4629carrying an average of 10000 bits. What is the throughput of this network 2mbps

46301357.
4631The number of swapping needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using insertion
4632sort is 10

4633Layer-2 Switch is also called MAC address table or CAM table

46341359.
4635Give the decimal value of binary 10010. 18

46361360.
4637Which dynamic routing protocol uses cost as its metric? OSPF

46381361.
4639A decoder converts coded info into non -coded form.
4640What is the worst-case time for serial search finding a single item in an array? Linear time o(n)s
46411363.
4642A demultiplexer has one data input and a number of selection inputs, and they have several outputs
46431364.
4644Which of the following is not the required condition for binary search algorithm?
There must be mechanism
4645to delete and/or insert elements in list
46461365.
4647What is the purpose of domain name system (DNS)? To translate domain names into IP addresses
4648Which of the following is not a limitation of binary search algorithm?
4649Binary search algorithm is not efficient.

46501367.
4651How many subnets are created from a Class C addressing space that is using a /29 subnet mask? 8

46521368.
4653In positive logic, ________. a HIGH = 1, a LOW = 0
46541369.
4655Convert the fractional binary number 0000.1010 to decimal. 0.625
4656What information does EIGRP share with neighboring routers? Only successors

46571371.
4658Binary search algorithm cannot be applied to pointer array

46591372.
4660Convert the fractional decimal number 6.75 to binary. 0110.1100
46611373.
4662Which of the following case does not exist in complexity theory ? Null Case
4663You have been assigned a network ID of 172.16.0.0/26. If you utilize the first network resulting from this ID,
4664what would be the last legitimate host address in this subnet? 172.16.0.00111111
46651375.
4666The Worst case occur in linear search algorithm when Item is the last element in the array or is not there
4667at al
46681376.
4669Which IPv6 address is the equivalent of the IPv4 interface loopback address 127.0.0.1? ANS: ::1
46701377.
4671Give the decimal value of binary 10000110. 13410
4672An encoder converts non coded info to coded form
46731379.
4674The average case occur in linear search algorithm When Item is somewhere in the middle of the array
46751380.
4676Where does routing occur within the DoD TCP/IP reference model? Internet
46771381.
4678The complexity of the average case of an algorithm is Much more complicated to analyze than that of
4679worst case
4680What kind of logic device or circuit is used to store information? Register

46811383.
4682Anshe’s IP address is 192.168.1.21 and uses mask of 255.255.255.240. Jenny's IP is 192.168.1.14/28. Their
4683computers are connected together using a crossover Ethernet cable. Why can' they ping each other?
46841384.
4685Convert the fractional binary number 0001.0010 to decimal. 1.125

46861385.
4687The time complexity of linear search algorithm over an array of n element is O(n)
4688Determine the output frequency for a frequency division circuit that contains 12 flip-flops with an input clock
4689frequency of 20.48 MHz. 5 kHz
46901387.
4691Prim's algorithm follows ___________ search
46921388.
4693Which statement BEST describes the operation of a negative-edge-triggered D flip-flop? The logic level at the
4694D input is transferred to Q on NGT of CLK

46951389.
4696Kruskal algorithm follows _________greedy__ approach.
4697How is a J-K flip-flop made to toggle? J = 1, K = 1

46981391.
4699In order traversal of binary search tree will produce sorted key values in an ascending order.
47001392.
4701contains the word to be stored in memory or just received from memory
47021393.
4703What data structure can be used to check if a syntax has balanced paranthesis ? Stack
4704A linked-list is a linear data structurre
47051395.
4706CPU or Program counter contains the 8-bit opcode currently being executed.
47071396.
4708The size of the Multiplier Quotient in IAS machine is 40bits

47091397.
4710Minimum number of spanning tree in a connected graph is
4711Read the instruction from its memory location into the processor CPU
47121399.
4713Which of the following has search effeciency of Ο(1) hash table
47141400.
4715What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph G(V,E) is stored
4716in form of adjacency list and binary heap is used O(|E|+|V| log |V|)
47171401.
4718Convert binary 111111110010 to hexadecimal. FF216
4719One hex digit is sometimes referred to as a(n): nibble
47201403.
4721If the array is already sorted, which of these algorithms will exhibit the best performance
4722a. Merge Sort
4723b. Insertion Sort
4724c. Quick Sort
4725d. Heap Sort
47261404.
4727Assign the proper odd parity bit to the code 111001. 1111001
47281405.
4729Which of the following algorithm cannot be desiged without recursion −
4730A.
4731Tower of Hanoi
4732b. Fibonacci Series
4733c. Tree Traversal
4734d. None of the above
4735Shell sort uses
47361407.
4737The sum of 11101 + 10111 equals __110100______.
47381408.
4739A binary number's value changes most drastically when the __MSB______ is changed.
47401409.
4741A posterior analysis are more accurate than a priori analysis because –it contains prior data
4742The memory address of the first element of an array is called base address
47431411.
4744Which is not a word size?
47451412.
4746The memory address of fifth element of an array can be calculated by the formula
4747- LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for
4748the array
4749- LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
4750- LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
4751- None of above
47521413.
4753What is the difference between binary coding and binary-coded decimal?
4754Binary coding is pure binary.
4755Which of the following data structures are indexed structures? Linear arrays
47561415.
4757The interrupt-request line is a part of the control line
47581416.
4759Which of the following is not the required condition for binary search algorithm?
4760There must be a mechanism to delete or insert elements in the list.
47611417.
4762Interrupts form an important part of __real time processing___ systems
4763Which of the following is not a limitation of binary search algorithm?
4764binary search algorithm is not efficient when the data elements are more than 1000
47651419.
4766An interrupt that can be temporarily ignored is maskable interrupt
47671420.
4768_________ method is used to establish priority by serially connecting all devices that request an interrupt.
4769Daisy chaining
47701421.
4771Two dimensional arrays are also called table arrays and matrix arrays
4772A variable P is called pointer if p contains the address of an element
47731423.
4774Consider the following sequence of micro-operations.
4775 MBR ← PC
4776 MAR ← X
4777 PC ← Y
4778 Memory ← MBR
4779Which one of the following is a possible operation performed by this sequence?
4780Initiation of interrupt service
47811424.
4782Which of the following data structure can't store the non-homogeneous data elements? arrays
47831425.
4784A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line
4785needed to construct a 16K × 16 RAM from 1K × 8 RAM is 4 decoders are required
4786Register renaming is done in pipelined processors to handle certain kinds of hazards.
47871427.
4788Which of the following data structure store the NON homogeneous data elements?
47891428.
4790Each data item in a record may be a group item composed of sub-items; those items which are indecomposable
4791are called
4792(a. elementary items b. atoms c. scalars)
47931429.
4794Consider a hypothetical processor with an instruction of type LW R1, 20(R2), which during execution reads a 32-
4795bit word from memory and stores it in a 32-bit register R1. The effective address of the memory location is
4796obtained by the addition of a constant 20 and the contents of register R2. Which of the following best reflects the
4797addressing mode implemented by this instruction for operand in memory. Base index addressing
4798How many 32K x 1 RAM chips are needed to provide a memory capacity of 256K-bytes? 64
47991431.
4800The difference between linear array and a record is
4801-All of the above(- An array is suitable for homogeneous data but the data items in a record may
4802have different data type
4803- In a record, there may not be a natural ordering in opposed to linear array)
48041432.
4805A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The
4806word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is
4807_____ 2^20 blocks, so 20 bits.
48081433.
4809Who is considered as the creator of JAVA ? james gosling
4810Where does the swap space reside? disk
48111435.
4812Java source codes are compiled and converted to bytecode
48131436.
4814What will be the output of the program ?
4815class A
4816{
4817int x = 10;
4818public void assign(int x)
4819{
4820 x = x;
4821 System.out.println(this.x);
4822}
4823public static void main(String[] args)
4824{
4825 new A().assign(100);
4826}
4827}
482810.
48291437.
4830Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O
4831band-width?
4832Block transfer and vectored interrupt.
4833What will be the output of the following program?
4834class B
4835{
4836 static int count = 100;
4837 public void increment()
4838 {
4839 count++;
4840 }
4841 public static void main(String []args)
4842 {
4843 B b1 = new B();
4844 b1.increment();
4845 B b2 = new B();
4846 System.out.println(b2.count); // line 13
4847 }
4848}
4849101.
48501439.
4851Addressing mode used in instruction
4852add r1,r2,r3 is register mode
48531440.
4854Given the following code, which line will generate an error ?
4855class Test
4856{
4857 static int x = 100; // line 3
4858 int y = 200; // line 4
4859 public static void main(String []args)
4860 {
4861 final int z; // line 7
4862 z = x + y; // line 8
4863 System.out.println(z);
4864 }
4865}
4866Line 8 will generate an error.
48671441.
4868The decoded instruction is stored in ir
4869What will happen if you try to compile and run the following code ?
4870class Test
4871{
4872 int x;
4873 Test(int n)
4874 {
4875 System.out.println(x=n); // line 6
4876 }
4877
4878 public static void main(String []args)
4879 {
4880 Test n = new Test(); // line 10
4881 }
4882}
4883LINE 10 WILL GENERATE AN ERROR.
48841443.
4885Which register can interact with the secondary storage MAR
48861444.
4887During the execution of a program which gets initialized first? PC
48881445.
4889What will be the Output?
4890class Animal
4891{
4892 String name = "animal";
4893 String makeNoise() { return "generic noise"; }
4894}
4895class Dog extends Animal
4896{
4897 String name = "dog";
4898 String makeNoise() { return "bark"; }
4899}
4900public class Test
4901{
4902 public static void main(String[] args)
4903 {
4904 Animal an = new Dog();
4905 System.out.println(an.name+" "+an.makeNoise());
4906 }
4907}
4908ANIMAL BARK
4909super keyword in Java is used for?
49101447.
4911During transfer of data between the processor and memory we use ______ REGISTERS
49121448.
4913What will be the Output?
4914class A
4915{
4916 public void m1()
4917 { System.out.println("A"); }
4918}
4919public class B extends A
4920{
4921 void m1()
4922 { System.out.println("B"); }
4923public static void main(String []args)
4924{
4925 A a = new B();
4926 a.m1();
4927}
4928}
4929COMPILATION FAILS
49301449.
4931Physical memory is divided into sets of finite size called as ______ . FRAMES
4932The DMA controller has _______ registers 3
49331451.
4934Which operator is used to check object-type at runtime? INSTANCEOF OPERATOR
49351452.
4936The technique where the controller is given complete access to main memory is BURST MODE
49371453.
4938Multiple inheritance is not supported in Java because? Predict Output, if the below code is run with given
4939command?
4940BECAUSE IT LEADS TO DIAMOND PROBLEM.
4941Command Line : java myprog good morning everyone
4942public class myprog
4943{
4944 public static void main(String argv[])
4945 {
4946 System.out.println(argv[1])
4947 }
4948}
49491455.
4950The DMA transfer is initiated by _____ I/O DEVICES
49511456.
4952The techniques which move the program blocks to or from the physical memory is called as ______. VIRTUAL
4953MEMORY ORGANISATION.
49541457.
4955What is the output of this program?
4956class average {
4957 public static void main(String args[])
4958 {
4959 double num[] = {5.5, 10.1, 11, 12.8, 56.9, 2.5};
4960 double result;
4961 result = 0;
4962 for (int i = 0; i < 6; ++i)
4963 result = result + num[i];
4964 System.out.print(result/6);
4965 }
4966 }
496716.466666666666667
4968The binary address issued to data or instructions are called as ____LOGICAL ADDRESS__.
49691460.
4970What is the output of this program?
4971class increment {
4972 public static void main(String args[])
4973 {
4974 int g = 3;
4975 System.out.print(++g * 8);
4976 } 
4977 }
497832
49791461.
4980The virtual memory basically stores the next segment of data to be executed on the SECONDARY
4981STORAGE_________.
4982What is the output of this program?
4983class array_output {
4984 public static void main(String args[])
4985 {
4986 int array_variable [] = new int[10];
4987 for (int i = 0; i < 10; ++i) {
4988 array_variable[i] = i;
4989 System.out.print(array_variable[i] + " ");
4990 i++;
4991 }
4992 }
4993 }
49940 2 4 6 8
49951463.
4996In associative mapping during LRU, the counter of the new block is set to ‘0’ and all the others are incremented
4997by one,when _____ occurs. MISS
49981464.
4999Fill in the blank to compile the code successfully?
5000 public abstract void showA();
5001abstract class A
5002{
5003 int a = 100;
5004}
5005public class B extends A
5006{
5007 _ _ _ _ _ _ _ _ _ // Fill the blank
5008 public static void main(String []args)
5009 {
5010 A objA = new B();
5011 objA.showA();
5012 }
5013}
50141465.
5015The two phases of executing an instruction are, Instruction fetch and instruction execution
5016The Instruction fetch phase ends with, Decoding the data in MDR and placing it in IR
50171467.
5018Which of the following statement is true about an Interface? Interface cannot implement a class.
50191468.
5020When using Branching, the usual sequencing of the PC is altered. A new instruction is loaded which is called as
5021_
5022BRANCH TARGET_____
50231469.
5024Which of following is a valid class using the given code?
5025public interface A { public void showA(); }
50261470 Given the following declarations, which assignment is legal?
5027// Class declarations :
5028interface A {}
5029class B {}
5030class C extends B implements A {}
5031class D implements A {}
5032// Declaration statements :
5033A a = d;
5034B b = new B();
5035C c = new C();
5036D d = new D();
50371471.
5038The condition flag Z is set to 1 to indicate, result is zero.
50391472.
5040Which is a valid declaration within an Interface?
5041public static short stop = 23;(If this option exists)
50421473.
5043Which of the statement is false about an abstract class?
5044An abstract class cannot have normal method.(If this option exists)
5045You can import only static members of a class present in some other package using _ -import static keyword
5046(If this option exists)
50471475.
5048import keyword is used to?
5049It declares a Java class to use in the code below the import statement.
50501476.
5051What is the stored in the object obj in following lines of code? NULL
5052box obj;
50531477.
5054When we create String with new() Operator, where is it stored? Which two methods you need to implement to
5055use an Object as key in HashMap?
5056-If you use new operator for creating strings in Java, it creates an object only in the heap memory
50571479.
5058Which keyword is used by method to refer to the object that invoked it?
5059this
50601480.
5061Which of the following is a method having same name as that of its class? constructor
50621481.
5063Which function is used to perform some action when the object is to be destroyed? finalize
5064Which of these is used to access member of class before object of that class is created? static
50651483.
5066Which of these cannot be declared static? method
50671484.
5068Which of the following is not a valid declaration of a Top level class ?
5069Static class Test()
50701485.
5071How can such a restriction be enforced ?
5072Without any accessibility specifiers.
5073A method within a class is only accessible by classes that are defined within the same package as the class of the
5074method.
50751486. Two methods are said to be overloaded if they have, have same name but different parameters.
50761487.
5077What is the prototype of the default constructor for given class?
5078public class Test { }
50791488.
5080Garbage Collection in java is done by who? JVM
50811489.
5082What will be the output of the following program?
5083class B
5084{
5085 static int count = 100;
5086 public void increment()
5087 {
5088 count++; }
5089 public static void main(String []args)
5090 {
5091 B b1 = new B();
5092 b1.increment();
5093 B b2 = new B();
5094 System.out.println(b2.count); } }
5095101
5096The mechanism that binds code and data together to keep them secure from outside world is known as
5097encapsulation
50981491.
5099What does the file iostream contain?
5100The file iosteram.h consists of declaration of standard stream input and output facilities.
5101It also consists of procedure that predefine a set of operations for handling reading and writing of
5102built-in data types.
51031492.
5104Which of the following is considered as a blue print that defines the variables and methods common to all of its
5105objects of a specific kind? class
51061493.
5107Which of the following is synchronized? Image file
5108Assume that a File is an abstract class and has toFile() method. ImageFile and BinaryFile are concrete classes of
5109the abstract class File. 

Also, assume that the method toFile() is implemented in both Binary File and Image
5110File. Which implementation method will be called when a File references an ImageFile object in memory and the
5111toFile method is called?
51121495.
5113What is the meaning of the return data type void?
5114The data type void actually refers to an object that does not have a value of any type
51151496.
5116The object of DataInputStream is used to To covert binary stream into character stream
51171497.
5118The code snippet

if( "Welcome".trim() == "Welcome".trim() ) System.out.println("Equal"); else
5119System.out.println("Not Equal");

will
5120Assume that the value 3929.92 is of type ‘float’. How to assign this value after declaring the variable ‘interest’ of
5121type float?
5122interest = 3929.92f
51231499.
5124Which of the methods should be implemented if any class implements the Runnable interface?
5125
run()
51261500.
5127After the following code fragment,
5128what is the value in fname?

String str; int fname; str = "Foolish boy."; fname = str.indexOf("fool");
5129-1
51301501.
5131What is the value of ‘number’ after the following code fragment execution?
5132ANS:12
5133int number = 0;
5134int number2 = 12;
5135while (number < number2)
5136{
5137number = number + 1;
5138}
51391502.DataInputStream is an example of filtered stream
51401503.If result = 2 + 3 * 5, what is the value and type of ‘result’ variable? ANS:17,int
51411504.
5142What is an aggregate object? ANS: An aggregate object is one which contains other objects. For example, an
5143Airplane class would contain Engine, Wing, Tail, Crew objects.
51441505.
5145Which of the following is not a return type? Public
5146When a thread terminates its processing, into what state that thread enters?
5147Dead state
51481507.
5149To execute the threads one after another the keyword synchronized is used
51501508.
5151Consider the following code snippet. What will be assigned to the variable fourthChar, if the code is
5152executed?throws StringIndexOutofBoundsException

String str = new String(“Java”); char fourthChar =
5153str.charAt(4);
51541509.
5155class can have many methods with the same name as long as the number of parameters or type of parameters is
5156different. This OOP concept is known as Method Overloading
5157Given the following code snippet;

int salaries[]; int index = 0; salaries = new int[4]; while (index < 4) {
5158salaries[index] = 10000; index++; } What is the value of salaries [3]?10000
51591511.
5160Select all the true statements from the following.
51611512.
5162Which of the following is not a method of the Thread class.
51631513.
5164How many numeric data types are supported in Java?six of the eight primitive data types are numeric
5165types
5166The class java.lang.Exception is extends Throwable
51671515.
5168All the wrapper classes (Integer, Boolean, Float, Short, Long, Double and Character) in java are final
51691516.
5170What is the difference between overloaded functions and overridden functions?
5171You are putting in place an overloading when you change the original types for the arguments in the
5172signature of a method.
5173You are putting in place an overriding when you change the original definition of a method.
51741517.
5175How do we define a destructor?
5176Destructor" functions are the inverse of constructor functions. They are called when objects are
5177destroyed (deallocated). Designate a function as a class's destructor by preceding the class name
5178with a tilde (~)
Which classes allow primitive types to be accessed as objects? ANS: Wrapper
51791519.
5180Inline functions are invoked at the time of compile time.
51811520.
5182Which of the following operators allow to define the member functions of a class outside the class? ANS: " :: "