COMPREHENSIVE
COMPREHENSIVE
COMPREHENSIVE
Build & Fix Model is suitable for programming exercises of ___________ LOC (Line of Code)
ANS:100/200 lines
2.Entity Set
An ________ is a set of entities of the same type that share the same properties, or attributes .
3.
#include
int main()
return 0;
//output :1
Ans- FIFO
Ans:- 1011
11. _____model is suitable for software development ,when the requirements are well defined
Ans:-WaterFall/Sequential/Stepbystep model
12. Which of the following will determine your choice of systems software for your computer?
ANS:-Both 1 and 3
ANS:-Attribute
#include
class A
protected:
int x;
public:
A() {x = 0;}
};
class B: public A
{
public:
B() : y (0) {}
private:
int y;
};
void show()
A a;
B b;
cout << "The default value of A::x = " << a.x << " ";
ANS:- 1 circuit
16 What is a shell ?
17. The function that an entity plays in a relationship is called that entity’s _____________.
ANS:-ROLE
ANS:-VERTICAL PROTOTYPE
ANS:-inheritance
23. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main
program is loaded into memory & is executed. This type of loading is called... ?
ANS:-Dynamic linking
24. The attribute name could be structured as a attribute consisting of first name, middle initial, and last name .
This type of attribute is called _______________
ANS:-composite
25. Is it possible to find two algebraic expressions that specify same function
ANS:-YES
29 _______________refers to the creation of a model that will eventually be discarded rather than becoming part
of the final delivered software.
30. The attribute AGE is calculated from DATE_OF_BIRTH . The attribute AGE is ________________
ANS_ DERIVED
ANS:-CACHE
ANS:-NULL
ANS:-10001
ANS:-Virtual function
35. ________ acknowledges that we do not understand all the requirements and builds only those that are well
understood
ANS:-Evolutionary prototyping
ANS:- -10001
ANS:-CREATE OBJECT
39. _________ provides a broad view of an entire system or subsystem, focusing on user interaction more than
low-level system functionality, such as database access.
ANS:-Phone number
ANS:-excitation table
42. In object orient programming classes are useful because they
ANS:-REG.NO
44. Run time mapping from virtual to physical address is done by:
ANS:-Vertical Prototype
46. Memory management technique in which system stores and retrieves data from secondary storage for use in
main memory is called:
ANS:-Paging
#include<iostream.h>
void main()
int n=1;
do
cout <<n<<"\t";
n++;
} while (n<=100);
cout <<endl;
48. _______________ can be suited to projects where requirements and scope are fixed, the product itself is firm
and stable, and the technology is clearly understood
ANS:-Waterfall
49. In a relation between the entities the type and condition of the relation should be specified . That is called
as______attribute
ANS:-Descriptive
51. In the __________ normal form, a composite attribute is converted to individual attributes.
ANS:- 1NF
ANS:-four minterms
ANS:-Stack Pointer
55. _______ acknowledge the programmatic need for milestones, for keeping a project on track, but encourage
iterations
56.#include <iostream>
int main ()
return 0;
ANS:- 0
ANS:-Literals
58. ______ describes the spiral model as a "process model generator", where choices based on a project's risks
generate an appropriate process model for the project.
59. A table on the many side of a one to many or many to many relationship must:
ANS:-LOGICAL ADDRESS
ANS:- 3 Variables
63. What will be the output of the this program?
#include <iostream>
int main ()
int n, result = 0;
result += billy[n];
return 0;
64. _____ is an agile software development technique in which two programmers work together at one
workstation
ANS:-Pair Programming
#include <iostream>
int main()
return 0;
ANS:- 5
67. Functional Dependencies are the types of constraints that are based on______
ANS:-KEY
ANS:-
69. ______ is often used for risk management when an exceptional risk that, though unlikely, would have
catastrophic consequences.
ANS:-Contingency plan
ANS:-Each Process
72The ______________ is a software development process intended to produce software with a certifiabe level of
reliability.
73. Which is a bottom-up approach to database design that design by examining the relationship between
attributes:
ANS:-Normalization
ANS:- DECODER
75. Which constructor will initialize the base class data member?
ANS:-BASE Class
76. The _______ is an iterative software development process framework created by the Rational Software
Corporation
ANS:-RUP
77. Which forms simplifies and ensures that there is minimal data aggregates and repetitive groups:
ANS:- 3NF
78. When overloading unary operators using Friend function, it requires_____ argument/s.
ANS:- ONE
ANS:-OR-GATE
81. What is difference between protected and private access specifiers in inheritance?
ANS:-Private methods are usually visible to class instances (internal implementations),protected methods are
visible to subclasses and classes in the same package
82. The primary objective of _____________ is to scope the system adequately as a basis for validating initial
costing and budgets.
ANS:-RUP
84. Decoder is a
ANS:-Combinational circuit
ANS:- 3NF
ANS:-
ANS:-DECoder
89. The RUP has determined a project life-cycle consisting of____ phases.
ANS:- 4Phases
For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode.
In normalization terms, empdt1 is a relation in
ANS:- UT
92. A relational database consists of a collection of
ANS:-TABLES
93. With relocation and limit registers, each logical address must be _______ the limit register.
ANS:-Less than
94. The primary objective of________ phase is to mitigate the key risk items identified by analysis up to the end
of this phase.
ANS:-Elaboration phase
ANS:- 1and 2
Thread()
Thread(int priority)
Thread(Runnable r, ThreadGroup g)
/* Missing code? */
Run;
t.start();
new Thread(new
MyRunnable()).start
()
ANS:-ROW
98. The operating system and the other processes are protected from being modified by an already running
process because :
ANS:-every address generated by the CPU is being checked against the relocation and limit registers
ANS:-
ANS:- 2NAND
101.
102.
Assume the following method is properly synchronized and called from a thread A on an object B:
wait(2000);
After calling this method, when will the thread A become a candidate to get another turn at the CPU?
103.
A:TUPLE
104.
______ uses same language to talk about analysis,design,programming and database design
105.
In fixed sized partition, the degree of multiprogramming is bounded by THE NUMBER OF POSITIONS
106.
UA/UML is an approach to software development that allows us to create objects that represent tangible
elements of the business independent of how they are represented to the user through an interface or physically
stored in a database.
108.
The first fit, best fit and worst fit are strategies to select a _partition selction policy
109.
Which class or interface defines the wait(), notify() and notifyAll() methods? OBJECT
110.
ans:COLUMN
111.
For each attribute of a relation, there is a set of permitted values, called the DOMAIN of that attribute.
112.
113.
114.
115.
newthread(new myrunnable()).start();
116.
117.
119.
120.
try
return;
finally
System.out.println( "Finally" );
FINALLY
121.
try
int x = 0;
int y = 5 / x;
catch (Exception e)
System.out.println("Exception");
System.out.println("finished");
COMPILATION FAILS
123.
124.
Database INSTANCE ,which is a snapshot of the data in the database at a given instant in time
125.
If relocation is static and is done at assembly or load time, compaction CANT BE DONE
126.
127.
public class X
try
badMethod();
System.out.print("A");
System.out.print("B");
finally
System.out.print("C");
System.out.print("D");
}
128.
The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one
large hole of available memory is :COST
129.
RAD approach to systems development rapidly develops software to quickly and incrementally implement the
design by using tools such as CASE.
131.
External fragmentation will not occur when : no matter which algorithm is used, it will always occur
132.
133.
134.
What is the result of compiling and running this program?
class Mammal{
c.eat(h);
135.
137.
Sometimes the overhead of keeping track of a hole might be :LARGER THAN THE HOLE
138.
class X, class Y and class Z are derived from class BASE. This is HIERARCHIAL inheritance
139.
Which one of the following is a set of one or more attributes taken collectively to uniquely identify a record?
SUPER KEY
140.
1. In design procedure input output values are assigned with LETTER SYMBOLS
141.
When the memory allocated to a process is slightly larger than the process, then : INTERNAL FRAGMENT
143.
144.
Output of AND gates in SOP is connected to OR GATE
145.
Consider attributes ID , CITY and NAME . Which one of this can be considered as a super key ? ID
146.
Mod-6 and mod-12 counters are most commonly used in DIGITAL CLOCK
147.
During a class inheritance in CPP, if the visibility mode or mode of derivation is not provided, then by default
visibility mode is PRIVATE
148.
149.
150.
151.
152.
Events are translated to ____ requests, which are sent either to the model or to the view
154.
A KEY is a property of the entire relation, rather than of the individual tuples in which each tuple is unique.
155.
DEMAND PAGING is the concept in which a process is copied into main memory from the secondary memory
according to the requirement.
156.
157.
A attribute in a relation is a foreign key if the PRIMARY key from one relation is used as an attribute in that
relation .
158.
The clock signals are used in sequential logic circuits to SYNCHRONIZE EVENTS
159.
protected members of the base class become private members of derived class
public members of the base class become private members of derived class
161.
162 All key stakeholders gathers together for a short but intensely focused period for WORKSHOP
163.
The relation with the attribute which is the primary key is referenced in another relation. The relation which
has the attribute as primary key is called REFERENCING RELATION
164.
165.
What is the difference between protected and private access specifiers in inheritance?
166.
In Multipath inheritance, in order to remove duplicate set of records in child class then
The REFERENTIAL RELATION is the one in which the primary key of one relation is used as a normal
attribute in another relation .
169.
170.When a program tries to access a page that is mapped in address space but not loaded in physical memory,
then?PAGE FAULT ERROR
171.
A REFERENTIAL integrity constraint requires that the values appearing in specified attributes of any tuple in
the referencing relation also appear in specified attributes of at least one tuple in the referenced relation.
172.
173.
Which of the following unit will choose to transform decimal number to binary code ? ENCODER
175.
PERT chart is a tool that depicts project as network diagram that is capable of graphically representing main
events of project in both parallel and consecutive way
176.
In FIFO page replacement algorithm, when a page must be replaced: OLD PAGE IS CHOSEN
177.
178
Relational Algebra is a PROCEDURAL query language that takes two relation as input and produces another
relation as output of the query.
179.
180.
Which one of the below mentioned is not a linear data structure TREE
181.
Which algorithm chooses the page that has not been used for the longest period of time whenever the page
required to be replaced? LRU
182.
The fundamental operations are select, project, union, set difference, Cartesian product, and
rename
183.
The conditions that must be present in order to start a use case is __pre-conditions__
184.
Quick sort algorithm is an example of DIVIDE AND CONQUER
185.
Assembly language
187.
188.
Binary search tree has best case run-time complexity of ?(log n). What could the worst case? O(N)
189.
Which of the following is used to denote the selection operation in relational algebra ?SIGMA
191.
Ans:component
192.
Working set model for page replacement is based on the assumption of:
Ans:locality
193.
For select operation the ________ appear in the subscript and the ___________ argument appears in the
paranthesis after the sigma.
Predicate,relation
(A) ?(n)
(B) ?(n2)
Ans:3b,2c,1a
195.
Ans:Secondary memory
196.
If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of
I/O blocks requests are 98, 37, 14, 124, 65, 67.
Ans:274+59
197.
______emphasize the use of events and states to determine the overall activity of the system.
ANS:State diagram
199.
200.
The SET DIFFERENCE operation, denoted by -, allows us to find tuples that are in one relation but are not in
another.
201.
202.
In a vectored interrupt
. the interrupting source supplies the branch information to the processor through an interrupt
vector
203.
Which of the following memory allocation scheme suffers from external fragmentation? SEGMENTATION
204.
Which of these is a mechanism for naming and visibility control of a class and its content? PACKAGES
205.
DEPLOYMENT diagrams show the configuration of run time processing elements and the software
components,processes and objects that live in them
206.
Which of the following is correct way of importing an entire package ‘pkg’? IMPORT PACKAGE *;
207.
208.
Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C
which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur ? 13/15
209.
210.
FINAL state in a state chart is shown as a circle surrounding a small dot,a bull’s- eye.
211.
package pkg;
class display {
int x;
void show() {
if (x > 1)
class packages {
for(int i=0;i<3;i++)
arr[i]=new display();
arr[0].x = 0;
arr[1].x = 1;
arr[2].x = 2;
arr[i].show();
ANS 2
212.
213.
214.
215.
Pre-emptive scheduling is the strategy of temporarily suspending a running process BEFORE CPU EXPIRES
216.
217.
Write Through technique is used in which memory for updating the data CACHE MEMORY
218.
Which of these interface declares core method that all collections will have? COLLECTION
219.
A _____ is a function or procedure that is defined for a class and typically can access the internal state of an
object of that class to perform some operation
ALL(METHOD)
220.
Which of the following is not outer join ?
221.
In round robin CPU scheduling as time quantum is increased the average turn around time VARIES
IRREGULARLY
222 Which of these interface is not a part of Java’s collection framework? MAPS
223.
Inheritance is the property of object-oriented systems that allows objects to be built from other
224.
Generally Dynamic RAM is used as main memory in a computer system as it HIGH SPEED
225.
227.
228.
229.
In signed-magnitude binary division, if the dividend is (11100) 2 and divisor is (10011) 2 then the result is 10100
230.A collection of data designed to be used by different people is called a/an DATABASE
231.
SERVER
232.
NETWORK
234.
ABSTRACT CLASS have no instances but define the common behaviors that can be inherited by more specific
classes
235.
In a program using subroutine call instruction, it is necessary CLEAR THE INSTRUCTION REGISTER
236.
Which of the following schemas does define a view or views of the database for particular users? EXTERNAL
SCHEMA
237.
238.
DEFAULT CONSTRUCTOR
class Student{
int id;
String name;
s1.display();
s2.display();
239.
PROTOTYPE is a version of software product developed in the early stages of product's life cycle for specific
and experimental purposes.
240.
241.
int x = 25;
242 If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative mapping.
Then each word of cache memory shall be 16 BITS
243.
Which of the following is an attribute that can uniquely identify a row in a table?
CANDIDATE KEY
244.
Which OS employs the techniques of fault tolerance and graceful degradation to ensure continuity of operation?
REAL TIME
245.
246.
When CPU is executing a Program that is part of the Operating System, it is said to SYSTEM MODE
247.
248.
249.
Which of the following is the process of selecting the data storage and data access characteristics of the
database? PHYSICAL DATABASE DESIGN
250.
251.
252.
253.
A DESIGN PATTERN INTEGRITY is instructive information that captures the essential structure and
insight of a successfully family of proven solutions to a recurring problem that arises within certain context and
system of forces
255
Which of the following terms does refer to the correctness and completeness of the data in a database?
INTEGRITY
256.
257.
258.
________can be viewed as a collection of procedures or behaviours that, taken together, reflect the behaviour of a
system over time.
ANS:Object Behaviour
259.
Page table level that says if page has been modified, is known as DIRTY
260.
The multiplicand register & multiplier register of a hardware circuit implementing booth's algorithm have
(11101) & (1100). The result shall be (812)10
261.
Static model
263.
264.
if (fork() == 0)
{ a = a + 5; printf("%d,%d\n", a, &a); }
Let u, v be the values printed by the parent process, and x, y be the values printed by the child process. Which
one of the following is TRUE?
(c) u + 10 = x and v = y
265.
The logical or mathematical model of a particular organization of data is called a DATA STRUCTURE
266.
If the state of the database no longer reflects a real state of the world that the database is supposed to capture,
then such a state is called inconsistent state
267.
268.
The __________ is used when you have one case that is similar to another use case but does a bit more specialized
EXTENDS ASSOCIATION
269.
270.
The atomic fetch-and-set x, y instruction unconditionally sets the memory location x to 1 and fetches the old
value of x in y without allowing any intervening access to the memory location x. consider the following
implementation of P and V functions on a binary semaphore .
S->value = 0;}
271.
272.
‘Aging registers’ are Counters which indicate how long ago their associated pages have been
referenced.
273.
Ensuring isolation property is the responsibility of the Concurrency-control component of the DBMS
274.
Which of the following page replacement algorithms suffers from Belady’s anomaly? FIFO
275.
Which of the following gives a logical structure of the database graphically? ER DIAGRAM
277.
What is the swap space in the disk used for? SAVING PROCESS DATA
278.
280.
COUPLING denotes the measure of strength of association established by a connection from one object to
another.
281.
Suppose n processes, P1, …. Pn share m identical resource units, which can be reserved and released one at a
time. The maximum resource requirement of process Pi is Si, where Si > 0. Which one of the following is a
sufficient condition for ensuring that deadlock does not occur?
OPTION C S<(M+N)
282.
283.
Which of the following data structures are indexed structures? LINEAR ARRAYS
284.
286.
Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively.
Each process spends the first 20% of execution time doing I/O, the next 70% of time doing computation, and the
last 10% of time doing I/O again. The operating system uses a shortest remaining compute time first scheduling
algorithm and schedules a new process either when the running process gets blocked on I/O or when the running
process finishes its compute burst. Assume that all I/O operations can be overlapped as much as possible. For
what percentage of time does the CPU remain idle? 10.6%
287.
288.
DESIGN PATTERN provides a scheme for refining the subsystems or components of a software system or the
relationship among them.
289.
A LINEAR ARRAY does not keep track of address of every element in the list.
290.
291.
Consider a directed line(->) from the relationship set advisor to both entity sets instructor and student. This
indicates one to one cardinality
292.
Which of the following is major part of time taken when accessing data on the disk? SEEK TIME
293.
294.
If the value V(x) of the target operand is contained in the address field itself, the addressing mode is DIRECT
295.
The concept of__________ is used to represent a system whose inside workings are not available for inspection.
BLACK BOX
296.
We indicate roles in E-R diagrams by labeling the lines that connect DIAMOND to RECTANGLE.
297.
can be represented in a signed magnitude format and in a 1’s complement format as LEFT BIT
298.
Which if the following is/are the levels of implementation of data structure ALL OF THESE
299.
A _______ strategy can detect the serious flaws early in the implementation.
300.
From amongst the following given scenarios determine the right one to justify interrupt mode of data-transfer
KEYBOARD I/P
301.
An entity set that does not have sufficient attributes to form a primary key is termed a WEAK ENTITY.
302.
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called AVL TREE
303.
WBOX is to test every statement in the objects method by executing it at least once.
304.
The instructions which copy information from one location to another either in the processor’s internal register
set or in the external main memory are called DATA TRANSFER INSTRUCTIONS
305.
Increasing the RAM of a computer typically improves performance because: Fewer page faults occur
Increasing main memory allows more code/pages to reside there and hence, less page faults.
306.
The performance of cache memory is frequently measured in terms of a quantity called HIT RATIO
307.
For a weak entity set to be meaningful, it must be associated with another entity set, called the IDENTIFYING
SET
308.
TESTING is the process of executing a program with the intent of finding errors.
309.
A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual
address space is of the same size as the physical address space, the operating system designers decide to get rid
of the virtual memory entirely. Which one of the following is true?
310.
311.
Three concurrent processes X, Y, and Z execute three different code segments that access and update certain
shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the
P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before
entering the respective code segments. After completing the execution of its code segment, each process invokes
the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one.
Which one of the following represents a deadlockfree order of invoking the P operations by the processes?
312.
313.
A GOOD TEST CASE is the one that has s high probability of detecting an as-yet undiscovered error
314.
Content of the program counter is added to the address part of the instruction in order to obtain the effective
address is called. RELATIVE ADDRESS
315.
316.
An interface that provides I/O transfer of data directly to and form the memory unit and peripheral is termed
as DMA
317.
Which of the following is true about the characteristics of abstract data types?
Top of Form
318.
319.
Protocols are?
320.
If you were collecting and storing information about your music collection, an album would be considered a(n)
INSTANCE
321.
What is the content of Stack Pointer (SP)? ADDRESS OF THE TOP OF THE STACK
322.
Which data communication method is used to transmit the data over a serial communication link?
FULL-DUPLEX
323.
Model Constraints and Comments Constraints are assumptions or relationships among model elements
specifying conditions and propositions that must be maintained as true.
324.NONE is not the component of data structure.
325.
What term is used to refer to a specific record in your music database; for instance; information stored about a
specific album? INSTANCE
326.
327.
The memory unit that communicates directly with the CPU is called the MAIN MEMORY
328.
ANS:Abstract
329.
330.Let us consider phone_number ,which can take single or several values . Treating phone_numberas an
ENTITY permits instructors to have several phone numbers (including zero) associated with them.
331.
332.
Error detection at the data link layer is achieved by? CYCLIC REDUNDANCY
334.
335.
Inserting an item into the stack when stack is not full is called PUSH Operation and deletion of item form the
stack, when stack is not empty is called POP.operation.
336.
Given the basic ER and relational models, which of the following is INCORRECT?
337.
QUEUE Is a pile in which items are added at one end and removed from the other.
338.
A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside
buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of
the TLB tag is: 15 BITS
339.
The most common addressing techiniques employed by a CPU is ALL THE ABOVE
340.
SRS is a structured document setting out detailed descriptions of the system services
341.
342.
Which of the following indicates the maximum number of entities that can be involved in a relationship?
MAXIMUM CARDINARLITY
343.
STACK is very useful in situation when data have to stored and then retrieved in reverse order.
344.
345.
346.
int i = 0;
i = i++ + i;
}
OUTPUT:1
347.
348.
When a subroutine is called, the address of the instruction following the CALL instructions stored in/on
the STACK
349.
350.
Requirements which change during development or when the system is in use are said to be AMBIGUOUS
351.
352.
1, 2, 3, 2, 4, 1, 3, 2, 4, 1
On a demand paged virtual memory system running on a computer system that main memory size of 3 pages
frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the
corresponding page replacements policy. Then
(A) OPTIMAL < LRU < FIFO (B) OPTIMAL < FIFO < LRU (C) OPTIMAL = LRU
OPTION B
353.
Which data structure allows deleting data elements from and inserting at rear? QUEUE
355.
356.
357.
Which of the following data structure can't store the non-homogeneous data elements? ARRAY
358.
359.
Virtual memory is
360.
ANS:STAKEHOLDERS
361.
362.
A primary key is combined with a foreign key creates PARENT CHILD RELATIONSHIP
363.
Cache memory-
364.
A QUEUE/LINKEDLIST is a data structure that organizes data similar to a line in the supermarket, where the
first one in line is the first one out.
365.
Let the page fault service time be 10ms in a computer with average memory access time being 20ns. If one page
fault is generated for every 10^6 memory accesses, what is the effective access time for the memory?
30 NS
366.
Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3,4, 2, 1, 5, 3,
2, 4, 6, the number of page faults using the optimal replacement policy is 7.
367.
369.
In order to maintain transactional integrity and database consistency, what technology does a DBMS deploy?
LOCK
370.
Why we need to have secondary storage ? STORE LARGE MEMORY THAT EXCEEDS MAIN MEMORY
372.
Which data structure is used in breadth first search of a graph to hold nodes? QUEUE
373.
A social scientists spends a considerable time observing and analysing how people actually work is said to be
ETHNOGRAPHY
374.
Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using
statically linked libraries ? FASTER PROGRAM STRATEGY
375.
A lock that allows concurrent transactions to access different rows of the same table is known as a ROW LEVEL
LOCK
376.
Identify the data structure which allows deletions at both ends of the list but insertion at only one end. INPUT
RESTRICTED
377.
A computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program
accesses the pages numbered 1, 2, …, 100 in that order, and repeats the access sequence THRICE. Which one of
the following page replacement policies experiences the same number of page faults as the optimal page
replacement policy for this program?MOST RECENTLY USED
378.
Which of the following are introduced to reduce the overheads caused by the log-based recovery?
CHECK POINTS
380.
The PROTOTYPE may be used for user training before a final system is delivered
381.
382.
Which of the following data structure is non linear type? NONE OF THE ABOVE
383.
The address mapping is done, when the program is initially loaded is called ? STATIC RELOCATION
384.
Which of the following protocols ensures conflict serializability and safety from deadlocks?
385.
Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6,
respectively. How many context switches are needed if the operating system implements a shortest remaining
time first scheduling algorithm? Do not count the context switches at time zero and at the end. 2
386.
Which of the following is the block that is not permitted to be written back to the disk? PINNED
387.
The unit which decodes and translates each instruction and generates the necessary enable signals for ALU and
other units is called CONTROL UNIT
388.
389.
390.
Which of the following process scheduling algorithm may lead to starvation SJF
391.
In THROW AWAY the prototype is developed from an initial specification, delivered for experiment then
discarded
392.
393.
If transaction Ti gets an explicit lock on the file Fc in exclusive mode, then it has an IMP IN EXCLUSIVE
MODE on all the records belonging to that file.
394.
If the quantum time of round robin algorithm is very large, then it is equivalent to: FIFO
395.
To represent hierarchical relationship between elements, Which data structure is suitable? TREE
396.
An__________, start with the best understood parts
397.
398.
Which refers to a property of computer to run several operation simultaneously and possible as computers await
response of each other CONCURRENCY
399.
FIFO form of access is used to add and remove nodes from a queue.
400.
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with
priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and
decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations
and all arrive at time zero? ROUND ROBIN
401.
402.
All lock information is managed by a LOCK MANAGER which is responsible for assigning and policing the
locks used by the transactions.
403.
Consider the following table of arrival time and burst time for three processes P0, P1 and P2.
P1 1 ms 4 ms
P2 2 ms 9 ms
The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or
completion of processes. What is the average waiting time for the three processes? 5
404.
405.
.406 LIFO form of access is used to add remove nodes from a stack.
407.
Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary
locks are acquired before any are released?
408.
OPTICAL DISK read the data by reflecting pulses of laser beams on the surface
409.
Requirements which specify that the delivered product must behave in a particular way is PRODUCT
REQUIREMENT
410.
A system is in a DEAD LOCK state if there exists a set of transactions such that every transaction in the set is
waiting for another transaction in the set.
412.
Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in
Group 1 to entries in Group 2.
Group I Group II
413.
Constraints on the services or functions offered by the system such as timing constraints, constraints on the
development process, standards, etc refers to NON FUNCTIONAL REQUIREMENT
414.
Which technique helps processor to run a program concurrently with input output operations ?
415.
In the linked representation of the stack START POINTER behaves as the top pointer variable of stack.
416.Which interrupt establishes a priority over the various sources to determine which request should be
entertained first ? PRIORITY INTERUPT
417.
Reliability, Response time and Storage requirements are examples of NON-FUNCTIONAL REQUIREMENT
418.
Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All
processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF
ties are broken by giving priority to the process with the lowest process id. The average turn around time
is:LRTF-13 UNITS
419. The deadlock state can be changed back to stable state by using ROLLBACK statement.
421. In linked representation of stack the null pointer of the last node in the list signals BACK OF THE
STACK
422.Mandating a particular IDE, programming language or development method are examples of NON
FUNCTIONAL
423.Which method is used to establish priority by serially connecting all devices that request an interrupt ?
DAISY CHAINING
424.The maximum number of processes that can be in Ready state for a computer system with n CPUs is
INDEPENDANT OF N
426. For the processes listed in the following table, which of the following scheduling schemes will give the
lowest average turnaround time?
A 0 3
B 1 6
C 4 4
D 6 2
427. What happens when you push a new node onto a stack? the new node is placed at the front of the
linked list.
428. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a
timestamp smaller than that of Tj (that is, Ti is older than Tj ). Otherwise, Ti is rolled back (dies). This is
WAIT DIE
429. Which is used for this and known as high speed buffer exist with almost each process ? CACHE
430. Requirements which are a consequence of organisational policies and procedures are termed as POLICIES
/PROCEDURE
435. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a
timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by
Ti ). This is
WOUND WAIT
436. Loss in signal power as light travels down the fiber is called? Attenuation
437. VALIDATION is the process of checking the requirements for validity, consistency, completeness, realism
and verifiability.
438. INTERUPT INITATED I/O processor has to check continuously till device becomes ready for transferring
the data ?
439. The situation where the lock waits only for a specified amount of time for another lock to be released is
LOST TIMEOUT
440. Which of the following name does not relate to stacks? FIFO
441.
442.
443.
__________is the process of formally documenting the user and system requirements and creating a software
requirements document.
444.
445.
Instruction that are used for reading from memory by an IOP called? COMMANDS
446.
A deadlock exists in the system if and only if the wait-for graph contains a CYCLE
448.
Tools to support the early process activities of requirements and design are UPPER CASE
449.
451.
Tools to support later activities such as programming,debugging and testing are LOWER CASE
452.
SESSION LAYER
453.
PARTIAL rollback requires the system to maintain additional information about the state of all the running
transactions.
454.
In division, two operands (dividend and divisor) and answer (quotient) of divide are accompanied by a second
answer called the REMAINDER
455.
456.
458.
459.
460.
Software should not make wasteful use of system resources is termed as EFFICIENCY
461.
Software must be usable by the users for which it was designed is termed as USABILITY
462.
463.
464.
465.
466.
467.
The elements are removal from a stack in REVERSE order.
468.
469.
Old, valuable systems must be maintained and updated are termed as MAINTAINENCE
470.
You have 10 users plugged into a hub running 10Mbps half-duplex. There is a server connected to the switch
running 10Mbps half-duplex as well. How much bandwidth does each host have to the server? 10MBPS
471.
Constraint checking can be disabled in existing CHECK and FOREIGN KEY constraints so that any data you
modify or add to the table is not checked against the constraint.
472.
SOFTWARE ENGINEERING is an engineering discipline which is concerned with all aspects of software
production.
473.
1-10001001-11111111110000000000000
474.
475.
477.
478
EXTREME PROGRAMMING relies on constant code improvement, user involvement in the development
team and pairwise programming .
479.
Which router command allows you to view the entire contents of all access lists?SHOW ACCESS LIST
480.
481.
Which of the following fixed database roles can add or remove user IDs? DB_ACCESSADMIN
482.
483.
484.
485.
Risks are explicitly assessed and resolved throughout the process in SPIRAL model
486.
SYSTEM TESTING involves executing the system with test cases that are derived from the specification of the
real data to be processed by the system
487.
488.
If a block can be placed at every location in cache, this cache is said to be FULLY ASSOCIATION
489.
490.
How many collision domains are created when you segment a network with a 12-port switch? 12
491.
492.
493.Which of the following statements is/are not true for SQL profiler?
494.
495.
Information when is written in cache, both to block in cache and block present in lower-level memory, refers to
WRITE THROUGH
496.
LCP
497.
498.
Testing with customer data to check that it is acceptable is termed as UAT testing
499.
A pointer variable which contains the location at the top element of the stack is called TOP
500. The load instruction is mostly used to designate a transfer from memory to a processor register known as
ACCUMULATOR
501.
502.
A stub network, or pocket network, is a somewhat casual term describing a computer network, or
part of an internetwork,
with no knowledge of other networks, that will typically send much or all of its non-local traffic out
via a single path, with
503.
A group of bits that tell the computer to perform a specific operation is known as _instruction code___.
504.
1.Expression evaluation
505.
506.
ans:(=).
507.
ans: bit-time
508.
ans: traversal
509.
[A] DHCP
[B] SMTP
[C] FTP
[D] TFTP
[E] HTTP
Answer: B
510.
511.
Consider money is transferred from (1) account-A to account-B and (2) account-B to account-A. Which of the
following form a
transaction ?
512.
513.
514.
A. 12.0.0.1
B. 168.172.19.39
C. 172.15.14.36
D. 192.168.24.43
Answer: Option D
515.
A. 3k registers B. 2k registers
C. K2 registers D. K3 registers
Ans: B
516.
517.
A transaction may not always complete its execution successfully. Such a transaction is termed
a) Aborted
b) Terminated
c) Closed
ans: a
518.
519.
Which class of IP address provides a maximum of only 254 host addresses per network ID?
A. Class A
B. Class B
C. Class C
D. Class D
Answer: Option C
520.
521.
In dial up remote access a client uses the ---- to create a physical connection to a part on a remote access server
of the private network.
1)Private network
Ans:(2)
522.
The average time required to reach a storage location in memory and obtain its contents is called_____.
Ans: B
523.
If an transaction is performed in a database and committed, the changes are taken to the previous state of
transaction by
a) Flashback
b) Rollback
c) Both a and b
d) Cannot be done
Ans:d
524.
525.
Graph 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.
A. Leterally connected
B. Widely Connected
C. Unliterally connected
D. Literally connected
Ans:C
526.
a.end nodes
b.final nodes
c.last nodes
d.terminal nodes
ans:d
527.
Which of the following devices is a PC component that connects the computer to the network?
528.
529.
(A) Counters which indicate how long ago their associated pages have been referenced.
(B) Registers which keep track of when the program was last accessed.
Ans: A
530.
Each modification done in database transaction are first recorded into the
a) Harddrive
b) Log
c) Disk
d) Datamart
Ans:b
531.
A connected graph T without any cycles is called ........
A. A tree graph
B. Free tree
C. A tree d
Ans:D
532.
Which of the following devices modulates digital signals into analog signals that can be sent over traditional
telephone
lines?
(1) Router
(2) Gateway
(3) Switch
(4) Modem
(5) NIC
Ans:4
533.
534.
When the transaction finishes the final statement the transaction enters into
a) Active state
b) Committed state
d) Abort state
Ans:c
535.
Ans: D
536.
The name of the transaction file shall be provided by the operator and the file that contains the edited
transactions ready
a) Batch. Exe
b) Trans. Exe
c) Opt. Exe
d) Edit.Exe
Ans:c
537.
n bits in operation code imply that there are ___________ possible distinct
A. 2n B. 2n
C. n/2 D. n2
Ans: B
538.
Which of the following devices takes data sent from one network device and forwards it to all devices on the
network
(2) Switch
(3) Hub
(4) Gateway
(5) All
Ans. (3)
539.
Trees are said .......... if they are similar and have same contents at corresponding nodes.
A. Duplicate
B. Carbon copy
C. Replica
D. Copies
Ans:D
540.
541.
a) Transaction
b) Concurrency
c) Relations
Ans:a
542.
Which of the following devices takes data sent from one network device and forwards it to the destination node
based on MAC
address?
(1) Hub
(2) Switch
(3) Gateway
(4) Modem
(5) All
Ans. (2)
543.
A three input NOR gate gives logic high output only when_____.
Ans: D
545.
Every node N in a binary tree T except the root has a unique parent called the ......... of N.
A. Antecedents
B. Predecessor
C. Forerunner
D. Precursor
Ans:B
546.
A. Encoder B. Multiplexer
Ans: D
547.
548.
Ans:negative conflict
549.
If the state of the database no longer reflects a real state of the world that the database is supposed to capture,
then
a) Consistent state
b) Parallel state
c) Atomic state
d) Inconsistent state
Ans:d
550.
Which of the following devices assigns IP address to devices connected to a network that uses TCP/IP?
[B] NIC
[C] Gateway
[D] Hub
Answer: A
551.
_______ means that data used during the execution of a transaction cannot be used by a second transaction until
the first
one is completed.
Ans:c
552.
553.
Although they've fallen out of favor, which of the following devices is used to connect different network segments
and manage the traffic between them?
[A] Bridge
[B] Hub
[C] Gateway
[D] Repeater
Answer: A
554.
Ans: A
555.
D. both b and c
Ans:D
556.
DBMS periodically suspends all processing and synchronizes its files and journals through the use of
Ans:a
557.
Ans:A
558.
The multiplicand register & multiplier register of a hardware circuit implementing booth's algorithm have
(11101) & (1100).
C. (12)10 D. (-812)10
Ans: A
559.
Which of the following devices direct network traffic based not by MAC addresses but by software-configured
network
addresses?
[A] Router
[B] Hub
[C] Bridge
[D] NIC
Answer: A
560.
561.
Ans:a
562.
Abstraction.
563.
A. X + Y + Z
B. XY + YZ
C. X + YZ
D. XZ + Y
Ans:C
564.
Which of the following network devices/systems translates data from one format to another?
A. Hub
B. DHCP Server
C. Gateway
D. NIC
Ans:C
565.
A. End points of e
B. Adjacent nodes
C. Neighbours
Ans:D
566.
a) Active
b) Terminated
c) Aborted
d) Partially committed
Ans:b
567.
568.Which of the following terms is used to describe a hardware- or software-based device that protects networks
from outside
threats?
Ans: Firewall
A. Overflow
B. Underflow
C. Empty
D. Full
Ans:C
570.
1. Which of the following boolean expressions is not logically equivalent to all of the rest ?
c. w + x + y' + z'
d. wx + wy' + wz'
Ans:c
571.
572.
573.
[D] Firewall
Answer: A
574.
575.
A binary tree whose every node has either zero or two children is called .......
D. data structure
Ans:C
576.
577.
a) Atomicity
b) Durability
c) Isolation
Ans:a
578.
a.network
c.application layer
d.session layer
ans:b
579.
A. 4
B. 2
C. 3
D. 5
Ans:C
580.
A.Mapping
B.Graphing
C.T-map
D.karnaugh-map
Ans:D
581.
The minimum number of NAND gates required to implement the Boolean function. A + AB' + AB'C is equal to
a.0
b.1
c.4
d.7
Ans:a
582.
The database system must take special actions to ensure that transactions operate properly without interference
from
a) Atomicity
b) Durability
c) Isolation
Ans:c
583.
a.Unicast, Multicast
b.Malticast, Unicast
c.Broadcast, Unicast
d.None of Above
Ans:c
584.
A. Exterior node
B. Outside node
C. Outer node
D. External node
Ans:D
585.
586.
(1) HUB
(2) Switch
(3) Router
(5) Gateway
Ans. (4)
587.
a.1 XOR 0 =1
d.1 XOR 1 =0
Ans:c
588.
A. Interior node
B. Domestic node
C. Internal node
D. Inner node
Ans:C
589.
a) Atomicity
b) Durability
c) Isolation
Ans:b
590.
591.
__________ states that only valid data will be written to the database.
a) Consistency
b) Atomicity
c) Durability
d) Isolation
Ans:a
592.
mcq
593.
A. Root
B. Leaf
C. Child
D. Branch
Ans:B
594.
Ans:A
595.
"Can the requirement be changed without a large impact on other requirements?",is related to ___mcq____
596.
SR latch consists of
a.1 input
b.2 inputs
c.3 inputs
d.4 inputs
Ans:b
597.
598.
How many digits of the DNIC (Data Network Identification Code) identify the country?
[A].first three
[B].first four
[C].first five
[D].first six
Ans:A
599.
600.
Ans:C
601.
602.
603.
1. Which of the following ways is a in-order traversal?
604.
A station in a network forwards incoming packets by placing them on its shortest output queue. What routing
algorithm is being used?
605.
Answ:6steps
606.
607.
608.
1. Which of the following ways is a post-order traversal?
609.
610.
The probability that a single bit will be in error on a typical public telephone line using 4800 bps modem is 10 to
the power -3. If no error detection mechanism is used, the residual error rate for a communication line using 9-
bit frames is approximately equal to
Answ: 0.009
611.
Answ:input
612.
The Oracle RDBMS uses the ____ statement to declare a new transaction start and its properties.
613.
Frames from one LAN can be transmitted to another LAN via the device
Answ:bridge
614.
a. nodes
b. data
c. both a and b
d. address
Answ: C
615.
ANsw:Requirements tracebility
616.
Which of the following condition is used to transmit two packets over a medium at the same time?
Answ: Collision
617.
____ means that the data used during the execution of a transaction cannot be used by a second transaction
until the first one is completed.
Answ: Isolation
618.
619.
____________ helps the analyst to understand the functionality of the system and models are used to
communicate with customers
Answ:System models
620.
ANsw:Secondary variables
621.
ANsw: : random
622.
You have a class A network address 10.0.0.0 with 40 subnets, but are required to add 60 new subnets very soon.
You would like to still allow for the largest possible number of host IDs per subnet. Which subnet mask should
you assign?
Answ: 255.254.0.0
623.
R has n tuples and S has m tuples, then the Cartesian product of R and S will produce ___________ tuples.
Answ: nR * nS
624.
USECASE
625.
Answ:Critical Race
626.
627.
Answ:Relational database
628.
1. A ___________ tree is a tree where for each parent node, there is only one associated child node
Answ: degenerate tree
629.
What are the most commonly used transmission speeds in BPS used in data communication?
Answ:9600
630.
631.
632.
In _____________tree, the heights of the two child subtrees of any node differ by at most one
Answ:AVL TREE
633.
Data sharing
Data concurrency
Data searching
Data integrity
Indexing
Transaction
ACID
635.
Answ: 255.255.255.0
636.
Answ: Generalization
637.
____________is the first schema to be designed when you are developing a DBMS
638.
Answ: modem
639.
640.
Which of the following linked list below have only last node of the list pointing to the first node?
641.
Answer:d
642.
643.
Database management systems can be classified based on several criteria, such as the data model, user
numbers and database distribution, all described below.(select from options)
644.
The time required in best case for search operation in binary tree is
Answ: O(1)
645.
646.
647.
Answ:5(d = gh + p formula)
648.
649.
1. Which of the following statements hold true for binary trees?
650.
The Internet Control Message Protocol (ICMP)
651.
______ show the a system and its relationship with other systems
652.
653.
654.
Your company has a LAN in its downtown office and has now set up a LAN in the manufacturing plant in the
suburbs. To enable everyone to share data and resources between the two LANs, what type of device(s) are
needed to connect them? Choose the most correct answer.
ANsw: Router
655.
Answ:1
656.
657.
The term 'duplex' refers to the ability of the data receiving stations to echo back a confirming message to the
sender. In full duplex data transmission, both the sender and the receiver
658.
__________ may be used to show the processes and the flow of information from one process to another
659.
660.
In SQL, which command is used to issue multiple CREATE TABLE, CREATE VIEW and GRANT statements in
a single transaction?
a) CREATE PACKAGE
b) CREATE SCHEMA
c) CREATE CLUSTER
d) All of the mentioned
661.
How many hosts are attached to each of the local area networks at your site?
Answ: 254
662.
Answ: Behavioural
663.
664.
Answ:JOIN
665.
Options
- In red-black trees, the root do not contain data.
- In red-black trees, the leaf nodes are not relevant and do not contain data.
- In red-black trees, the leaf nodes are relevant but do not contain data.
- Both a and c above
666.
Answ:
667.
___________ are used to describe the logical structure of data processed by the system
668.
669.
The attributes in foreign key and primary key have the same ____________
670.
Answ:Arrays
671. ____________ are lists of all of the names used in the system models.
672. Which of the following statements is false: question not available in vtop
Ans: allocate space in the Oracle database where schema objects are stored.
674. Contention is
A. 100 photons
B. 200 photons
C. 300 photons
D. 400 photons
Answer: Option B
677.___________ are rectangles with the name at the top, attributes in the middle section and operations in the
bottom section
Ans: A race condition is an undesirable situation that occurs when a device or system attempts to perform two or
more operations at the same time
681. __________ is referred to as generalisation and is shown ‘upwards’ rather than ‘downwards’ in a hierarchy
Ans: Inheritance
682. There are two functional dependencies with the same set of attributes on the left side of the arrow:
A->BC
A->B
This can be combined as
a) A->BC
b) A->B
c) B->C
d) None of the mentioned
Answer:a
A. the method of determining which device has access to the transmission medium at any time.
C. a form of TDMA in which circuit switching is used to dynamically change the channel
assignments
Answer: Option C
684. Asynchronous sequential logic circuits are used when primary need is
1. time
2. pressure
3. speed
4. accuracy
ans: speed
687.A system which supports _______ allows object classes to inherit from several super-classes
Ans: multiple inheritance
1. full state
2. total state
3. initial state
4. output state
A. On the network
B. Down through the layers of the IP architecture and then up the layers again
Ans: b
691.Which of the following TCP/IP protocol is used for transferring electronic mail messages from one machine to
another?
A. FTP
B. SNMP
C. SMTP
D. RPC
Ans: c
692.The ____________ identifies the language tokens in the text of the query.
693.When representing any algebraic expression E which uses only binary operations in a 2-tree:
a. the variable in E will appear as external nodes and operations in internal nodes
b. the operations in E will appear as external nodes and variables in internal nodes
c. the variables and operations in E will appear only in internal nodes
d. the variables and operations in E will appear only in external nodes
ans: a
ans: b
Ans: 3
698. Which of the following device is used to connect two systems, especially if the systems use different
protocols?
A. hub
B. bridge
C. gateway
D. repeater
Ans: c
700. The ______________ checks the query syntax to determine whether it is formulated according to the syntax
rules of the query language.
Ans: parser
1. AND-OR gates
2. AND gates
3. OR gates
4. XOR gates
Ans: 1
703.The synchronous modems are more costly than the asynchronous modems because
Ans: b
704.The inorder traversal of tree will yield a sorted listing of elements of tree:
A. Binary trees
B. Binary search trees
C. Merging
D. AVL Trees
Ans: b
705.___________ can be created quickly from a set of reusable components plus some mechanism to ‘glue’ these
component together
Ans: prototypes
A) One
B) Zero
C) -1
D) None of the above
Ans: b
709._______may be used to ‘draw’ the interface and simulate its functionality with components associated with
interface entities
710. A distributed network configuration in which all data/information pass through a central computer is
A. bus network
B. star network
C. ring network
D. Point-to-point network
E. None of the above
Answer: Option B
711.A ________ is a data-structure that organizes data similar to a line in the super-market, where the first one
in the line is the first to be out:
712.Which of the following TCP/IP protocol allows an application program on one machine to send a datagram to
an application program on another machine?
A. UDP
B. VMTP
C. X.25
D. SMTP
E. None of the above
Answer: Option A
713.The participation constraints and cardinality ratio together called as _______________ constraints.
1. intensive constraints
2. recursive constraints
3. composite constraints
4. structural constraints
ans:4
715.________ techniques include the use of very high-level languages, database programming and prototype
construction from reusable components
Ans: prototyping
716._______ are expressed in a mathematical notation with precisely defined vocabulary, syntax and semantics.
Ans: active
718. Which of the following statements are true? Question not there in vtop
720.Which of the following abstract data types is not used by integer abstract data type group?
A) Short
B) Int
C) float
D) long
Ans:c
721.A thread is usually defined as a ‘light weight process’ because an operating system (OS) maintains smaller
data structures for a thread than for a process. In relation to this, which of the followings is TRUE?
Answer (C)
723.Which character function can be used to return a specified portion of a character string?
a) INSTR
b) SUBSTRING
c) SUBSTR
d) POS
View Answer
Answer: c
Ans: Max Heap is a binary tree in which every parent node has greater value than its child nodes...
726.The variables which can be accessed by all modules in a program, are known as:
Ans: global variables
727.The design process for identifying the subsystems making up a system and the framework for sub-system
control and communication is ___________
Answer: b
1. combinational circuit
2. sequential circuit
3. combinational sequence
4. series
ans: 2
732. The post order traversal of a binary tree is :DEBFCA, find out the preorder traversal:
Ans: abdecf
Ans: output 0
734.Which of the following is the creation of a virtual rather than actual version of
an operating system?
Ans: virtualisation
735.Which one of the following models is not suitable for accommodating any change?
Answer: d
a) Horizontal Prototype
b) Vertical Prototype
c) Diagonal Prototype
d) Domain Prototype
View Answer
Answer: c
737.Which is a protocol that one program can use to request a service from a program of
738. Which is the subset of SQL commands used to manipulate Oracle Database Structures, including tables?
Answer: a
739.The post order traversal of a binary tree is :DEBFCA, find out the preorder traversal:
Ans:abdecf
A. c=xy+xz+yz
B. c=xy+xz
C. c=xy+yz
D. c=x+y+z
741.…… is mainly responsible for allocating the resources as per process requirement?
(A) RAM
(B) Compiler
(C) Operating Systems
(D) Software
742.Half Subtractor also have output to check if 1 has been
A. complemented
B. borrowed
C. carried
D. primed
A. 6789
B. 2345
C. 1234
D. 456789
A. Demultiplexer
B. Multiplexer
C. full subtract or
D. half subtract or
746.Which of the following SQL command can be used to modify existing data in a database table?
DML STATEMENTS
749.…… is mainly responsible for allocating the resources as per process requirement?
(A) RAM
(B) Compiler
(C) Operating Systems
(D) Software.
750.When SQL statements are embedded inside 3GL, we call such a program as
a) Nested query
b) Nested programming
c) Distinct query
d) Embedded SQL
751.The work associated with software engineering can be categorized into three generic phases, regardless of
application area, project size, or complexity namely the__________ phase which focuses on what, the_________
phase which focuses on how and the_________ phase which focuses on change
a) 1, 2, 3
b) 2, 1, 3
c) 3, 2, 1
d) 3, 1, 2
752.A set of several trees that are not linked to each other in any way
a: Forest b: Graphs
NOR
(A) Kernel
(B) Shell
(C) Fork
(D) None
755._______________ provides option for entering SQL queries as execution time, rather than at the development
stage
A) PL/SQL
B) SQL*Plus
C) SQL
D) Dynamic SQL
A. undefined
B. shifted
C. feedback
D. wire
758.All the non-leaf nodes except the root node in a multi-way search tree of order, n have atleast ...........
children
a: n-1 children b: n children
759.Which two models doesn’t allow defining requirements early in the cycle?
762._______________ is a procedural extension of Oracle – SQL that offers language constructs similar to those in
imperative programming languages.
a) SQL
b) PL/SQL
c) Advanced SQL
d) PQL
763.Which of the following life cycle model can be chosen if the development team has less experience on similar
projects?
a) Spiral
b) Waterfall
c) RAD
d) Iterative Enhancement Model
A. overflow
B. carry
C. output
D. zero bit
765.___________ combines the data manipulating power of SQL with the data processing power of Procedural
languages.
a) PL/SQL
b) SQL
c) Advanced SQL
d) PQL
a: greater than all its children b: smaller than all its children
subtree
767.….. occur commonly in multitasking when two or more threads waiting for each
other.
(A) Kernel
(B) Shell
(C) Fork
(D) Deadlock
769.A company is developing an advance version of their current software available in the market, what model
approach would they prefer?
a) RAD
b) Iterative Enhancement
c) Both a & b
d) Spiral
A. invert OR
B. AND invert
C. NAND invert
D. both a and b
771. _______________ has made PL/SQL code run faster without requiring any additional work on the part of the
programmer.
A) SQL Server
B) My SQL
C) Oracle
D) SQL Lite
different ways.
(A) Fork
(B) Scheduler
(C) Spawn
(D) None of the above
778.If you were to create client/server applications, which model would you go for?
a) Lexical Units
b) Literals
c) Textual Units
d) Identifiers
Purpose of process is to deliver software in a timely manner and with sufficient qualityto satisfy
those who have sponsored its creation and those who will use it
A) Lexical Units
B) Literals
C) Delimiters
D) Identifiers
787.
789.A ___________________ is an explicit numeric, character, string or Boolean value not represented by an
identifier.
A) Comments
B) Literals
C) Delimiters
D) Identifiers
NOT GATE
a: queue b: stack
a) 2, 4, 5, 1, 6, 3
b) 4, 2, 5, 1, 3, 6
c) 2, 4, 5, 1, 3, 6
d) 4, 2, 5, 1, 6, 3
793.….. commands are automatically loaded into main memory when the booting process
gets completed.
(A) External
(B) Internal
(C) Both (A) & (B)
(D) None
A) Strong
B) Weak
C) Empty
D) Anonymous
A. AND logic
B. OR logic
C. NOR logic
D. NAND logic
a) elicitation
b) design
c) analysis
d) documentation
string literal
leaf
(A) Lynx OS
(B) Mac OS
(C) UNIX
(D) None of the above
A. NAND-NOR
B. NAND-OR
C. OR only
D. AND only
801.A binary tree grows at ...............
a: root b: leaves
802.….. process checks to ensure the components of the computer are operating and
connected properly.
805.Which of the following is true for the algorithms for memory allocation?
806. Combinations that are not listed for input variables are
a.overflow
b.carry
c.borrow
d.don’t care
807.To reduce disk-accesses while searching for a record, the tree used is ............ tree.
808.Which according to you is the most important stakeholder from the following?
(A) spooling
(B) caching
(C) Paging
(D) All of the above
A. inverted or function
B. prime function
C. even function
D. odd function
814.Flipflops are
(A) Thread
(B) Kernel
(C) Paging
(D) All of the above
sum(a,n){
s=0;
for i= 1 to n
{
s=s+a[i];
return s;
ANS:5N+3-==>O(N)
A. reduction
B. state reduction
C. next state
D. both a and b
a) One
b) Two
c) Three
d) Four
A. clock
B. invert
C. hold
D. clear
time?
a) FCFS
b) SJF
c) Round – robin
d) Priority
822.Complexity of heap sort (n log(n))
A. present state
B. input state
C. next state
D. both a and b
826. If there are more than one paths between two nodes, it is a:
a: tree b: graph
use.
Ans:Interface analysis
Information flow analysis:Identifies the dependencies between input and output variables.
Path analysis:identifies the all possible paths through the program and set out the statements executed in that
path.
a: n-1 b: n+1
c: n d: n/2
832.The philosophy behind __________is defect avoidance rather than defect removal .
ANS:Cleanroom SE
833.Latches are
834.……. systems are required to complete a critical task within a guaranteed amount of time.
837.In _____________start with high-level system and integrate from the top-down replacing individual
components by stubs where appropriate
ANS:Top-Down Testing.
a: n log n b: n
c: n+1 d: log n
A. stable
B. unstable
C. complex
D. combinational
c: -1 d:2
ANS:Stress testing
843.________ are an alternative function-related measure to function points when 4Gls or similar languages are
used for development
ANS:ObjectPoints
A. clear time
B. pulse time
C. hold time
D. reset time
ANS:Sleep
ANS:Context Switching
A. 2^m-1 states
B. 2-1 states
C. 2^m+1 states
D. 2^m states
851.The measure of the average length of words and sentences in documents is termed as __________.
A) Lynx OS
(B) Mac OS
(C) UNIX
(D) None of the above
855.In mealy model outputs are functions of current state and current inputs
i) sort the edges of G in increasing order by length ii) keep a subgraph S of G initially empty iii)
builds a tree one vertex at a time
ANS:I and ii
858.
ANS:Legacy Systems
859.
The ___defines the types of documents to be managed and a document naming scheme
(A) Fragmentation
(B) Caching
(C) Segmentation
(D) None of the above.
861.A multi-dimensional array array[0:2, 10:20, 3:4, -10:2] contains _________ elements.
A. 0
B. 1
C. t
D. t+1
863.Rather than build a subgraph one edge at a time ............................... builds a tree one vertex at a time.
A) kruskal’s algorithm
B) prim’s algorithm
C) dijkstra algorithm
D) bellman ford algorithm.
A. state table
B. map
C. truth table
D. graph
866.
a) lower costs
b) faster software development
c) high effectiveness
d) lower risks
868.
.................. is known as a greedy algorithm, because it chooses at each step the cheapest edge to add to subgraph
S.
A)Kruskal’salgorithm
B)Prim’salgorithm
C)Dijkstraalgorithm
D) Bellman ford algorithm
869.
870.
…… is the smallest unit for processing that consists of a program counter, a stack &
a set of registers.
(A) Compiler
(B) Thread
(C) Heap
(D) None of the above
871.
A. feedback path
B. gates
C. signals
D. complex circuits
a) Patterns
b) documents
c) structures
d) method
874
A) O(logn)
B) O(m+n logn)
C) O(mn)
D) O(m logn)
875.
876.
(A) Preemption
(B) Mutual Exclusion
(C) Circular Wait
(D) None of the above
877.
The ..................... process updates the costs of all the vertices V, connected to a vertex U, if we could improve the
best estimate of the shortest path to V by including (U,V) in the path to V.
A)relaxation
B)improvement
C)shortening
D) Costing
878.Which state a flip-flop circuits can maintain as long as a power is delivered to circuit?
A. n states
B. tri state
C. binary state
D. octa state
A. clock
B. negative edge
C. positive edge
D. both a and b
880.If every requirement can be checked by a cost-effective process, then the SRS is
................. turns out that one can find the shortest paths from a given source to all points in a graph in the same
time.
Dijistras Algoriithm
A)the waterfall model b)prototyping model c)the evolutionary model d) the spiral model
A. feedback path
B. gates
C. clock pulses
D. both a and b
885.
................ keeps two sets of vertices; S, the set of vertices whose shortest paths from the source have already
been determined and V-S, the remaining vertices.
A)Kruskal’salgorithm
B)Prim’salgorithm
C)Dijkstraalgorithm
D) Bellman ford algorithm
Fork()
888.
889.
................. Is a more generalized single source shortest path algorithm which can find the shortest path in a
graph with negative weighted edges?
A)Kruskal’salgorithm
B)Prim’salgorithm
C)Dijkstraalgorithm
D) Bellman ford algorithm
890.
(A) Lynx OS
(B) Mac OS
(C) MS DOS
(D) None of the above
Ans:One
(A) quantum
(B) priority
(C) preemption
(D) None of the above
893.A sample application of ................. algorithm is to solve critical path problem, i.e. finding the longest path
through a DAG.
A)DAGapplicationpathalgorithm
B)DAGshortestpathalgorithm
C)DAGcriticalpathalgorithm
D) Bellman ford algorithm
a. Requirements elicitation
b. Requirements analysis
c. Requirements design
d. Requirements documentation
895.
…… occurs in a dynamic memory allocation system when most of the free blocks are
Ans:Fragmentation
896.Simplest registers only consists of
A. counter
B. EPROM
C. latch
D. flip-flop
897.The floyd-warshall all pairs shortest path algorithm computes the shortest paths between each pair of nodes
in ....................…
A)O(logn)
B)O(n^2)
C)O(mn)
D) O(n^3)
a) RTM
b) DOORS
c) Rational Suite
d) RDD 100
899.
According to a statistical report: “over 30% of all software projects are cancelled before completion and over 70%
of the remainder fail to deliver expected features”. What must be the reason for such a situation?
900.Which of the following holds the data currently being worked on?
901.
a) 5
b) 10
c) 15
d) 20
902.
Dijkstra algorithm is also called the ...................... shortest path problem.
A) multiple source
B) single source
C) single destination
D) multiple destination
A. ROM
B. EPROM
C. RAM
D. Registers
904.
a) Output
b) Throughput
c) Efficiency
d) Capacity
906.
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder
traversal. Respectively, of a complete binary tree. Which of the following is always true?
907.
908.
909.
Which of the following property does not correspond to a good Software Requirements Specification (SRS)?
a) Verifiable
b) Ambiguous
c) Complete
d) Traceable
X: Indirect addressing 1: Loops Y: Immediate addressing 2: Pointers Z: Auto decrement addressing 3: Cons
tants
Ans:x2,y3,z1
910.
Z: sorting 3: stack
911.
912.
Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right sub
stress, respectively, of node X. Note that Y and Z may be NULL, or further nested. Which of the following
represents a valid binary tree?
A) (1 2 (4 5 6 7))
(B) (1 (2 3 4) 5 6) 7)
(C) (1 (2 3 4)(5 6 7))
(D) (1 (2 3 NULL) (4 5))
A. SSI counters
B. asynchronous counters
C. synchronous counters
D. VLSI counters
a) its structure and style are such that any changes to the requirements can be made easily while retaining the
style and structure.
b) every requirement stated therein is one that the software shall meet
c) every requirement stated therein is verifiable
d) no subset of individual requirements described in it conflict with each other
915.Consider the following Statement: “The output of a program shall be given within 10secs of event X 10% of
the time”. What characteristic of SRS is being depicted here?
a) Consistent
b) Verifiable
c) Non-verifiable
d) Correct
917.Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to
determined if there are two elements with sum less than 1000 in s. which of the following statements is true?
a) t (n) is 0 (1)
b) n < t (n) < n log2n
c) n log2n < t (n) <nC2
d) t (n) =nC2
a) Up-down counter
b) LSI counters
c) Down counter
d) Up counter
919.Shift registers having four bits will enable shift control signal for
A. 2 clock pulses
B. 3 clock pulses
C. 4 clock pulses
D. 5 clock pulses
a) operations only
b) attributes only
c) both (a) and (b)
d) None of the mentioned
a) nonmaskable interrupts
b) blocked interrupts
c) maskable interrupts
d) none of the mentioned
924.
Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of
these pairs identify a tree uniquely?
a) (i) only
b) (ii), (iii)
c) (iii) only
d) (iv) only
925.Which of the following pattern is the basis of interaction management in many web-based systems?
a) architecture
b) repository pattern
c) model-view-controller
d) different operating system
A. counter
B. register
C. latch
D. flip-flop
a) SSI counters
b) LSI counters
c) MSI counters
d) VLSI counters
929.The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12,
16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the
root)?
a) 2
b) 3
c) 4
d) 6
A. 2binary cells
B. 4binary cells
C. 6binary cells
D. 8binary cells
a. Static view
b. Functional view
c. Dynamic view
d. All the above
ANS:Program Counter
934.A data structure is required for storing a set of integers such that each of the following operations can be
done in (log n) time, where n is the number of elements in the set.
Which of the following data structures can be used for this purpose?
(a) A heap can be used but not a balanced binary search tree
(b) A balanced binary search tree can be used but not a heap
(c) Both balanced binary search tree and heap can be used
(d) Neither balanced binary search tree nor heap can be used
935.Which of the following condition leads to deadlock?
a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned
936.Which of the property of software modularity is incorrect with respect to benefits software modularity?
937.The best data structure to check whether an arithmetic expression has balanced parentheses is a
A:queue
B:stack
C:tree
D:list
A. 1 cycle
B. 2 cycle
C. 3 cycle
D. 4 cycle.
a) Cohesion
b) Coupling
c) None of the mentioned
940.Level order traversal of a rooted tree can be done by starting from the root and performing
a) preorder traversal
b) in-order traversal
c) depth first search
d) breadth first search
A. Flow of Data
B. Flow of Cost
C. Flow of Traffic
D. Flow of Amount
943.Ripple counter can not be described by
A. Boolean equation
B. clock duration
C. graph
D.
E. flow chart
946.Postorder traversal of a given binary search tree, T produces the following sequence of keys
10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29
Which one of the following sequences of keys can be the result of an in-order traversal of the tree T?
a) 9, 10, 15, 22, 23, 25, 27, 29, 40, 50, 60, 95
b) 9, 10, 15, 22, 40, 50, 60, 95, 23, 25, 27, 29
c) 29, 15, 9, 10, 25, 22, 23, 27, 40, 60, 50, 95
d) 95, 50, 60, 40, 27, 23, 22, 25, 10, 9, 15, 29
a) Transform
b) Data Store
c) Function
d) None of the mentioned
948.In Quality of Service, Jitter is variation in delay for packets belonging to the
A. Same Flow
B. Parallel Flow
C. Protocol Flow
D. Both B & C
950.In the worst case, the number of comparisons needed to search a singly linked list of length n for a given
element is
a) log 2 n
b) n/2
c) log 2 n – 1
d) n
a) Circle
b) Arrow
c) Rectangle
d) Triangle
(A) Shell
(B) Kernel
(C) Fork
(D) None of the above
954.Which one of the following in place sorting algorithms needs the minimum number of swaps?
955.Interrupt latency should be…… for Real Time Operating Systems (RTOS)?
(A) minimal
(B) maximum
(C) zero
(D) None of the above
A. changed
B. reversed
C. unchanged
D. Stopped.
958.Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search
tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal
sequence of the resultant tree?
a) 7 5 1 0 3 2 4 6 8 9
b) 0 2 4 3 1 6 5 9 8 7
c) 0 1 2 3 4 5 6 7 8 9
d) 9 8 6 4 2 3 0 1 5 7
959.The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number
of nodes in a binary tree of height h is:
(A) 2^h -1
(B) 2^(h-1) – 1
(C) 2^(h+1) -1
(D) 2*(h+1)
A. 1
B. 2
C. 3
D. 4
961.Which design identifies the software as a system with many components interacting with each other?
a. Architectural design
b. High-level design
c. Detailed design
d. Both B & C.
A. Flow Control
B. Timer
C. Error Solution
D. Flow Specification
963.Which of the following sorting algorithms has the lowest worst-case complexity?
a) Insertion sort
b) Selection sort
c) Quick sort
d) Heap sort
965.What incorporates data, architectural, interface, and procedural representations of the software?
a) design model
b) user’s model
c) mental image
d) system image
a) running
b) parsing
c) ready
d) blocked
968.The Breadth First Search algorithm has been implemented using the queue data structure. One possible
order of visiting the nodes of the following graph is
(A) MNOPQR
(B) NQMPOR
(C) QMNPRO
(D) QMNPOR
970.What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single
node is 0.
(A) 2
(B) 3
(C) 4
(D) 5
971.A BCD counter is a
A. mod-5 counter
B. mod-10 counter
C. mod-15 counter
D. mod-20 counter
972.Four different attributes to control traffic have been devised in
A. Data Relay
B. Source Relay
C. Frame Relay
D. IP Relay
973.To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the
data structure to be used is:
A. Queue
B. Stack
C. Heap
D. B-Tree
A. T flip-flop
B. JK flip-flop
C. RS flip-flop
D. both a and b
A. a to b
B. a to f
C. a to g
D. a to z
977.Which one of the following is a key factor for preferring B-trees to binary search trees for indexing database
relations?
(a)Database relations have a large number of records
(b) Database relations are sorted on the primary key
(c) B-trees require less memory than binary search trees
(d) Data transfer form disks is in blocks
978.Frames from one LAN can be transmitted to another LAN via the device
A. Router
B. Bridge
C. Repeater
D. Modem
E. None of the above
979.In a complete binary tree, the number of leaves with n internal nodes is: (n+1)/2
980.The …… register is read by the host to get input
a) flow in
b) flow out
c) data in
d) data out.
981.In 14 pin gate pin no 7 is
A. Vcc
B. Vdd
C. ground
D. AC
982.The recurrence relation capturing the optimal time of the Tower of Hanoi problem with n discs is
(A) T(n) = 2T(n – 2) + 2
(B) T(n) = 2T(n – 1) + n
(C) T(n) = 2T(n/2) + 1
(D) T(n) = 2T(n – 1) + 1
983.What is a stub network?
A network that has one entry point and one exit point.
984.BCD to 7 segment is
A. decoder
B. encoder
C. Multiplexer
D. Demultiplexer
A. hub
B. bridge
C. gateway
D
repeater
.
A - Insertion Sort
B - Merge Sort
C - Shell Sort
D - Heap Sort
989.Match the following:
C. A--->3,B----->2, C---->1
A. 0V
B. 1V
C. 5V
D. 10V
A. Vcc
B. Vdd
C. ground
D. AC.
A. 1
B. 0
C. reset
D. defined
999.Which of the following command is used to print current working directory in Unix?
ANS:PWD
1000.Which of the below given sorting techniques has highest best-case runtime complexity -
(A) Quick sort
(B) Selection sort
(C) Insertion sort
(D) Bubble sort
1001.In OSI network architecture, the dialogue control and token management are responsibilities of ?
a. session layer
b. network layer
c. transport layer
e. none of above
A. toggle switch
B. push button
C. Multiplexer
D. Demultiplexer
A. SR Latch
B. RS flip-flop
C. D flip-flop
D. master slave flip-flop
1004.……. is a classic synchronization problem that involves the allocation of limited resources amongst a group
of processes in a deadlock free and starvation free manner.
Dining philosopher problem.
1005.Which of the following uses memoization?
a. Greedy approach
1006.Heap is an example of
1007.Mostly gates works on
A. 5V
B. 4V
C. 3V
D. 2V
1008.……. is a system call that returns the process ID of the parent of the current process.
ANS: getppid()
A. timing diagram
B. map
C. chart
D. Table.
1010.From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.
a. e-n+1
b. n-e+1
c. n+e-1
d. e-n-1
1011.
What is the main function of transport layer?
A) Node to node delivery
B) End to end delivery
C) Synchronization
D) Updating and maintaining routing tables
1012.
Which of the following is standard print command in Unix?
1013.
Full adder consists of
1014.
An adaptive sorting algorithm -
Bubble Sort,Insertion Sort,
1015.
The time required to search an element in a linked of length n is
ANS:O(n).
1016.
In Unix, “file” command is used to determine ……
File type of a file.
1017.
Strobe S in a mux acts as
A. enable
B. reset
C. clear
D. stop
1018.
The complexity of linear search algorithm is o(n)
1019.
Two sub layers of OSI Data Link layer are which of the following?
Logical link control and media access control
1020.
IC no of NOT gate
7404
1021.
Four gates in a package is called
A. biruple
B. octruple
C. dualruple
D. quadruple
1022.
The complexity of binary search algorithm is o(logn)
1023.
…… provides an Interface between the process and the Operating System
ANS:SYSTEM CALL
1024.
The resolution of externally defined symbols is performed by?
Linker
1025.A search begins the search with the element that is located in the middle of array
ANS:BINARY SEARCH.
1026.
7404 is a
Ans:7404 is a NOT gate IC.
1027.
…… is a system call that runs an executable file into an existing process.
ANS:EXEC.
1028.
The complexity of Bubble sort algorithm is o(n2)
1029.Decimal digit in BCD can be represented by
A. 1 input line
B. 2 input lines
C. 3 input lines
D. 4 input lines
A. 4 leds
B. 5 leds
C. 6 leds
D. 7 leds
1031.
The complexity of Insertion sort algorithm is
Best case o(n)
Average and Worst case o(n2)
1032.
One userlevel thread is mapped to many kernel level thread is known as….
a) Many to One model
b) One to Many model
c) Many to Many model
d) One to One model
1033.In Operating Systems, a single thread is termed as
ANS:Light weight process
1034.Counters that transfer invalid states to valid states are called
A. valid counters
B. self-starting counters
C. invalid counters
D. undefined counters
1035.
The complexity of Merge sort algorithm is o(nlogn)
1036.
Which of the following sorting algorithms does not have a worst case running time of O(n2)
Quick sort
Selection Sort
Insertion Sort
Bubble Sort
None of the above
1037.……. is a system call that returns the process ID of current process.
Getppid()
1038. In BCD no. 1010 has
A. meaning
B. no meaning
C. value
D. Vcc
B
Place them in a linked list and sort the linked list
.
D
Place them in an array and sort the array
.
1042.Which of the following command is used to create terminal connection to another
host in Unix?
ANS:telnet
1043.
Shift register whose input is connected to select output is called feedback shift register
1044.
Which of the following sorting procedure is the slowest?
A. Quick sort
B. Heap sort
C. Shell sort
D
Bubble
. sort
A. 4bit binary
B. 3bit binary
C. 2bit binary
D. 1bit binary
1046.file system with 300 GByte disk uses a file descriptor with 8 direct bloc addresses, I indirect block address
and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block
address is 8 Bytes. The maximum possible file size in this file system is
(A) 3 Kbytes
(B) 35 Kbytes
(C) 280 Bytes
(D) Dependent on the size of the disk
1047.
Which of the following algorithm design technique is used in the quick sort algorithm?
A)Dynamic programming
B)Backtracking
C)Divide and conquer
D)Greedy method
1048.
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
(a) 11 (b) 12
(c) 13 (d) 14
1049.
Which protocol working at the Transport layer provides a connectionless service between hosts?
A)IP
B)ARP
C)TCP
D)UDP
A. detection
B. testing
C. debugging
D. error
1054.Given two sorted lists of size m and n respectively. The number of comparisons needed in the worst case by
the merge sort algorithm will be?
A. m ×× n
B. max(m, n)
C. min(m, n)
D. m+n-1
A. top
B. left
C. bottom
D. right
1057. Which of the following TCP/IP protocol is used for transferring electronic mail messages from one machine
to another?
SMTP
1058.Rate of movement of light in lamp handball game is determined by clock's
A. input
B. frequency
C. voltage
D. current
A. 2,2,1,1,2
B. 2,2,1,2,2
C. 2,1,2,2,1
D. 2,1,2,2,2
1060. Let the time taken to switch between users the kernel modes of execution be t1 while the time taken to
switch between two processes be t2. Which of the following is TRUE?
(A) t1 > t2
(B) t1 = t2
(C) t1 < t2
(D) Nothing can be said about the relation between t1 and t2
1062.After 9 counts BCD counter goes back to
A. 0
B. 9
C. 1
D. 10
1063. A self-contained block of statements that perform a coherent task of some kind is called a?
A. Monitor
B. Function
C. Program
D. Structure
A. A-B
B. A+B
C. A/B
D. A*B
1072.Consider a disk system with 100 cylinders. The requests to access the cylinders
occur in following sequence :
4, 34, 10, 7, 19, 73, 2, 15, 6, 20
Assuming that the head is currently at cylinder 50, what is the time taken to
satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and
shortest seek time first policy is used ?
(A) 95ms
(B) 119ms
(C) 233ms
(D) 276ms
1073.
The expression X=4+2%-8 evaluates ?
ANS:6
1074.Logic probe is used for
A logic probe is a hand-held test probe used for analyzing and troubleshooting the logical states
(Boolean 0 or 1) of a digital circuit.
1075.Determine which of the following is valid character constant ?
(A) ‘\\’
B) ‘\0’
(C) ‘xyz’
(D) ‘\052’
1076.Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?
A)In deadlock prevention, the request for resources is always granted if the resulting state is
safe
B)In deadlock avoidance, the request for resources is always granted if the resulting state is safe
C)Deadlock avoidance is less restrictive than deadlock prevention
D)Deadlock avoidance requires knowledge of resource requirements apriori..
1077.Master slave flipflop can be constructed with
The master—slave flip-flop is constructed with two latches. The master latch is loaded with
the condition of the J-K inputs while the clock is high. When the clock goes low, the slave
takes on the state of the master and the master is latched.
1079.Consider the following statements about user level threads and kernel level threads. Which one of the
following statements is FALSE?
(A) Context switch time is longer for kernel level threads than for user level threads.
(B) User level threads do not need any hardware support.
(C) Related kernel level threads can be scheduled on different processors in a multi-processor system.
(D) Blocking one kernel level thread blocks all related threads.
1084.The ........ operator is a technique to forcefully convert one data type to the other ?
(A) Cast
(B) Conversion
(C) Type
(D) Uniary
1085.Each gate has a delay of
A. 1
B. 2
C. 3
D. 4
1086.If a host broadcasts a frame that includes a source and destination hardware address, and its purpose is to
assign IP addresses to itself, which protocol at the Network layer does the host use?
A.RARP
B. ARPA
C.ICMP
D.TCP
E. IPX
1087.Consider a set of n tasks with known runtimes , r1 r2...... rn to be run on a uniprocessor machine. Which of
the following processor scheduling algorithms will result in the maximum throughput ?
A. Round Robin
B. Shortest job first
C. Highest response ratio next
D. first come first served
1089.
To load data to shift register its SH/LD pin should be
A. 1
B. 0
C. reset
D. undefined
A. adds
B. subtracts
C. divides
D. multiplies
1095.
Which of the following statements is false ?
A. wall
B. fence
C. ball
D. indicator
1099.
Which are the correct array initialization statements?
1100.
Von Neumann architecture is ______.
A. SISD B. SIMD
C. MIMD D. MISD
You have 10 users plugged into a hub running 10Mbps half-duplex. There is a server connected to the switch
running 10Mbps half-duplex as well. How much bandwidth does each host have to the server?ANS: 10mbps
1102.
1103.
1104.
What is the default subnet mask for a class C network? ANS: 255.255.255.0
1105.
ANS: down through the layers of IP architecture and then up the layers again
1106.
1107.
In a vectored interrupt. ANS: the interrupting source supplies the branch info to the processor through
an interrupt vector.
1108.
1109.
Which among the following pairs of operations is supported by an array ADT? ANS: copy and delete
1110.
1111.
You have an IP of 156.233.42.56 with a subnet mask of 7 bits. How many hosts and subnets are possible
assuming that subnet 0 is not used?
ANS: 128 subnets and 512 hosts
1113.
1115.
1116.
What is the maximum number of IP addresses that can be assigned to hosts on a local subnet that uses the
255.255.255.224 subnet mask?ANS:30
1117.
If an Ethernet port on a router were assigned an IP address of 172.16.112.1/25, what would be the valid subnet
address of this host? ANS: 172.16.112.0
1119.
If memory access takes 20 ns with cache and 110 ns without it, then the ratio (cache uses a 10 ns memory) is
ANS: 90%
1120.
Identify the correct sequence in which the following packets are transmitted on the network by a host when a
browser requests a webpage from a remote server, assuming that the host has just been restarted.
ANS: DNS
query, TCP SYN, HTTP GET request
1121.
4bit parallel adder produces output of ANS: 40ns with a delay of 10ns
For the array A[1:u1, 1:u2] where α is the base address, A[i,1] has its address given by ANS:
1123.
1124.
What is split horizon? ANS: Split horizon is a method of preventing a routing loop in a network. The
basic principle is simple: Information about the routing for a particular packet is never sent back in
the direction from which it was received.
1125 8 input mux will have 3 select lines
1127.
What is route poisoning? ANS: Route poisoning is a method of preventing a network from sending
packets through a route that has become invalid.
1128.
A mathematical-model with a collection of operations defined on that model is called
ANS: ADT(abstract data
type)
1129.
_________ register keeps track of the instructions stored in program stored in memory ANS: PC(program
counter)
1131.
1132.
1133.
1135.
1136.
An algorithm must be generic enough to solve all problems of a particular class. This property is termed as ___
ANS:
1137.
In Congestion Control, a bit can be set in a packet moving in direction opposite to congestion in ANS: backward
signaling.
A packet which is sent by a node to source to inform it of congestion is called ANS: choke packet
1139.
The first step of development of an algorithm is ANS: Obtain a description of the problem.
1141.
1143.
Input instance for which algorithm take minimum possible time is called ANS: best case time complexity
1144.
In adder subtractor circuit when addition exceeds from 15 output carry becomes ANS: 1
1145.
Input instance for which algorithm take maximum possible time is called ANS: worst case time complexity
In Congestion Control, packet is put at end of input queue while waiting to be ANS: checked
1147.
1148.
Packets wait in a buffer (queue) until node is ready to process them in ANS:FIFO
1149.
Which case analysis appropriate when the response time of the algorithm is critical?
1151.
A leaky bucket algorithm shapes bursty traffic into fixed-rate traffic by averaging the ANS: data rate
1152.
The time complexity of the algorithm in a best case would be expressed as ANS: theta
1153.
The TTL field has value 10. How many routers (max) can process this datagram?
ANS: 10
1156.
Suppose that a bus has 16 data lines and requires 4 cycles of 250 nsecs each to transfer data. The bandwidth of
this bus would be 2 Megabytes/sec. If the cycle time of the bus was reduced to 125 nsecs and the number of cycles
required for transfer stayed the same what would the bandwidth of the bus? ANS: 2megabyte/sec
1157.
Which of the following name related to stacks? ANS: LIFO list, piles, pushdown lists
1159.
1160.
1161.
1163.
Stack works on the principles: ANS: last in first out (LIFO) or first in last out(FILO)
1164.
Which of the following field of the TCP header tells how many bytes may be sent starting at the byte
acknowledged? ANS: window size
1165.
To put the microprocessor in the wait state ANS: lower the READY input
1167.
If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the transmission
before division? ANS: 111111000
1168.
Which of the following is the condition of circular queue overflow?
ANS: rear>=size-1 and front=0
1169.
Electric digital systems use signals that have 2 distinct values and circuit elements having 2 stable states
As the data packet moves from the upper to the lower layers, headers are ANS: added
1171.
Number of machine cycles required for RET instruction in 8085 microprocessor is ANS: 3
1172.
A data structure where elements can be added or removed at either end but not in the middle ANS: dequeuer
(double ended queue)
1173.
What 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
1175.
A packet whose destination is outside the local TCP/IP network segment is sent to ..... ANS: default gateway
1176.
1177.
An instruction used to set the carry flag in a computer can be classified as ANS:logical
1179.
In link state routing algorithm after the construction of link state packets, new routes are computed using: ANS:
Dijkstra's algorithm
1180.
Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing
algorithm are updated...........
ANS: exchange info with neighbours nodes
1181.
Microprocessor 8085 is the enhanced version of ......... with essentially the same construction set ANS:8080
1183.
In IPv4 header, an HLEN value of decimal 10 means ANS:there are 40 bytes in the header
1184.
1185.
1187.
ANS: 2’s complement
1188.
In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24
packets are required to transmit the message, the packet size is ......... ANS: 5 bytes
1189.
A technique called ______ is used to create a subnetting effect ANS: proxy ARP
1191.
1192.
1193.
In _______ forwarding, the destination address is a network address in the routing table ANS: network
specific
1195.
1196.
1197.
The Open Shortest Path First (OSPF) protocol is an intradomain routing protocol based on _______ routing.
ANS: link state
1199.
The average time required to reach a storage location in memory and obtain its contents is called the ____ ANS:
access time
1200.
1201.
1203.
1204.
1205.
The circuit used to store one bit of data is known as_ ANS: flip flop
A system program that combines the separately compiled modules of a program into a form suitable for
execution ANS: linking loader
1207.
Which data structure will you use to evaluate prefix notation? ANS: stack
1208.
The strategy of allowing processes that are logically runnable to be temporarily suspended is called preemptive
scheduling
1209.
A.giving programming versatility to the user by providing facilities as pointers to memory counters for loop
control
1212.
Which of the following systems software does the job of merging the records from two files into one? Utility
program
1213.
1215.
Fork is System call fork() is used to create processes. It takes no arguments and returns a process ID. The
purpose of fork() is to create a new process, which becomes the child process of the caller. After a new child
process is created, both processes will execute the next instruction following the fork() system call. Therefore, we
have to distinguish the parent from the child. This can be done by testing the returned value of fork().
1216.
Thrashing is a process that is busy swapping pages in and out. Requires more memory than it wants.
1217.
Characters that can be specified in 6-bit code are ASCII or Burroughs BCL
1219.
What characteristic of RAM memory makes it not suitable for permanent storage? It is volatile
1220.
Supervisor state is called a privileged state, because the user has no access to it. There are some
instructions that are illegal in the user mode and are meant to be used only in the supervisor mode.
1221.
1224.
Interprocess communication Inter process communication (IPC) is a mechanism which allows processes to
communicate each other and synchronize their actions. Processes can communicate with each other using these
two ways:
1. Shared Memory
2. Message passing
1225.
Which of the following addressing modes, facilitates access to an operand whose location is defined relative to
the beginning of the data structure in which it appears? index
1227.
The amount of time required to read a block of data from a disk into memory is composed of seek time,
rotational latency, and transfer time. Rotational latency refers to the time its takes for the platter to make a
full rotation
1228.
1229.
In Single Linked List a node contain minimum how many fields(assuming one for data). ANS:2 fields,1 for
data and the other for pointer
A system program that sets up an executable program in main memory ready for execution is loader
1231.
Single link list performs which of the following methods 1) Insertion 2) Modification 3) Searching ANS:
insertion
1232.
If an odd parity is adopted, parity bit is chosen in such that total no of 1's is odd
1233.
Which of the following are loaded into main memory when the computer is booted? internal command
instructions
1234.
In linked lists there are no NULL links in: circular linked lists
1235.
The FIFO algorithm: first executes the job that came in first in the queue
1236.
1237.
1239.
What is the name given to the organized collection of software that controls the overall operation of a computer?
Operating system
1240.
1241.
(1010.011)2 = 1111110010.00000010110
1243.
1244.
1245.
1248.
In virtual memory systems, Dynamic address translation is hardware necessary to implement paging
1249.
In polynomial manipulation, nodes consists of three field representing coefficient, exponent, common
variable.
1251.
1252.
A linked list in which last node contain the link of the first node is called circular linked list
1253.
A non-relocatable program is one which cannot be made to execute in any area of storage other than the
one designated for it at the time of its coding or translation
1255.
1256.
1257.
1259.
A doubly linked list facilitates list traversal in forward and reverse directions
1260.
1261.
1263.
Memory management is: critical for even the simplest operating systems
1264.
In a linked list, the pointer of the last node contains null pointer
1265.
Which is the layer of a computer system between the hardware and the user program operating system
1266.
1267.
1268.
1269.
Which is the first program run on a computer when the computer boots up?
Operating system
1271.
1272.
Binary code that distinguishes ten elements must contain at least 4bits
1273.
Which of the following pair of data structures are both non-linear type? Tree and graph
The operating system creates _____ from the physical computer virtual computers
1275.
1276.
1277.
Gray code representation of 14 is 1001
1278. To represent hierarchical relationship between elements, which data structure is suitable? TREE
1279.
Which component performs the main or key tasks of operating system ? ANS:
1280.
A binary tree whose every node has either zero or two children is called extended binary tree
1281.
1282.
1283.
1284.
What kind of system is it that several users can use simultaneously? Diamond touch
1285.
Which of the following page replacement algorithm use the technique of replace that page which is not used in
the near future? Optimal
1287.
The post order traversal of a binary tree is DEBFCA. Find out the in order traversal BDEACF
1288.
The preorder traversal of a binary tree is ABDECF. Find out the post order traversal DEBFCA
1289.
The set of pages that a process is currently using is called as working set
1291.
1292.
The in order traversal of a binary tree is ABFCD. Find out the pre order traversal
FABCD
1293.
Which of the following memory management scheme loads all pages of a program from disk into main memory?
1295.
The process of storing and restoring from PCB is called context switch
1296.
Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
Children(3) = 7, Children(10) = 40. How many leaves does it have? ANS:
1297.
1299.
Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
Children(3) = 7, Children(10) = 40. How many of the nodes have at least one sibling? ANS:
1300.
Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
Children(3) = 7, Children(10) = 40. What is the value stored in the parent node of the node containing 30? ANS:
1301.
A remote batch-processing operation in which data is solely input to a central computer would require a:
simplex lines
1303.
ICMP (Internet Control Message Protocol) is a protocol that handles error and control messages
1304.
Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
Children(3) = 7, Children(10) = 40. How many descendents does the root have? ANS:
1305.
Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
Children(3) = 7, Children(10) = 40. How many children does the root have?ANS:
1307.
1308.
If you get both local and remote echoes, every character you type will appear on the screen twice
1309.
What part of 192.168.10.51 is the Network ID, assuming a default subnet mask? 192.68.10
Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
Children(3) = 7, Children(10) = 40. What is the depth of the tree? ANS:
1311.
1312.
A. (a+b+c)'= ANS: a'b'c'
1313.
1315.
x+x'y= x+y
1316.
A noiseless 3 KHz Channel transmits bits with binary level signals. What is the maximum data rate? 6kbps
1317.
1318.
Carrier is ANS: a continuous frequency capable of being modulated or impressed with a second signal
1319.
1320.
1321.
1323.
1324.
Traversing binary tree first root and then left and right subtrees called preorder traversal.
1325.
1327.
1328.
1329.
Which of the following statements is correct for the use of packet switching?
A. the subdivision of information into individually addressed packets in conjunction with alternative routing
arrangement enabled the transmission path to be altered in the event of congestion or individual link failure.
B.’the employment of additional intelligence within the network enabled more sophisticated error control and
link control procedures to be applied
C.by employing wide bandwidth circuits for the trunk networks substantial economies through extensive sharing
of capacity could be achieved.
D. All of above
A binary tree is generated by inserting in order of the following integers: 50, 15, 62, 5, 20, 58, 3, 8, 37, 60, 24 the
number of nodes in the left of the root respectively is
(7,4)
1331.
1332.
1333.
Which of the following traversal techniques lists the nodes of a binary search tree in ascending order? inorder
1335.
A front-end processor is
1336.
Consider the following tree with 9 nodes. Root = 14, Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30,
Children(3) = 7, Children(10) = 40. Which pair of nodes have equal number of descendants? ANS:
1337.
In Tunnel mode, the authentication header is inserted immediately after the IP header.
1339.
What kind of list is best to answer questions such as "What is the item at position n?" Singly linked list
1340.
1341.
1343.
1344.
a+(bc)= (a+b)(a+c)
1345.
1346.
In C programming, when we remove an item from bottom of the stack, then − stack will rearrange items
1347.
Usually, it takes 10-bits to represent one character. How many characters can be transmitted at a speed of 1200
BPS? 120
1348.
(x')' is x
1349.
To connect a computer with a device in the same room, you might be likely to use coaxial cable
1351.
An adaptive sorting algorithm − ANS: uses the existing inputs
insertion sort, adaptive heap sort,
adaptive merge sort, patience sort, shell sort.
1352.
How many bits internet address is assigned to each host on a TCP/IP internet which is used in all
communications with the host? 32bits
1353.
1356.
A network with Bandwidth of 10 Mbps can pass only an average of 12000 frames per minute with each frame
carrying an average of 10000 bits. What is the throughput of this network 2mbps
1357.
The number of swapping needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using insertion
sort is 10
1359.
1360.
1361.
What is the worst-case time for serial search finding a single item in an array? Linear time o(n)s
1363.
A demultiplexer has one data input and a number of selection inputs, and they have several outputs
1364.
Which of the following is not the required condition for binary search algorithm?
There must be mechanism
to delete and/or insert elements in list
1365.
What is the purpose of domain name system (DNS)? To translate domain names into IP addresses
1367.
How many subnets are created from a Class C addressing space that is using a /29 subnet mask? 8
1368.
What information does EIGRP share with neighboring routers? Only successors
1371.
1372.
1373.
Which of the following case does not exist in complexity theory ? Null Case
You have been assigned a network ID of 172.16.0.0/26. If you utilize the first network resulting from this ID,
what would be the last legitimate host address in this subnet?
172.16.0.00111111
1375.
The Worst case occur in linear search algorithm when Item is the last element in the array or is not there
at al
1376.
Which IPv6 address is the equivalent of the IPv4 interface loopback address 127.0.0.1? ANS: ::1
1377.
1379.
The average case occur in linear search algorithm When Item is somewhere in the middle of the array
1380.
Where does routing occur within the DoD TCP/IP reference model? Internet
1381.
The complexity of the average case of an algorithm is Much more complicated to analyze than that of
worst case
1383.
Anshe’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
computers are connected together using a crossover Ethernet cable. Why can' they ping each other?
1384.
1385.
The time complexity of linear search algorithm over an array of n element is O(n)
Determine the output frequency for a frequency division circuit that contains 12 flip-flops with an input clock
frequency of 20.48 MHz. 5 kHz
1387.
1388.
Which statement BEST describes the operation of a negative-edge-triggered D flip-flop? The logic level at the
D input is transferred to Q on NGT of CLK
1389.
1391.
In order traversal of binary search tree will produce sorted key values in an ascending order.
1392.
1393.
What data structure can be used to check if a syntax has balanced paranthesis ? Stack
1395.
CPU or Program counter contains the 8-bit opcode currently being executed.
1396.
1397.
Read the instruction from its memory location into the processor CPU
1399.
Which of the following has search effeciency of Ο(1) hash table
1400.
What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph G(V,E) is stored
in form of adjacency list and binary heap is used O(|E|+|V| log |V|)
1401.
1403.
If the array is already sorted, which of these algorithms will exhibit the best performance
a. Merge Sort
b. Insertion Sort
c. Quick Sort
d. Heap Sort
1404.
Assign the proper odd parity bit to the code 111001. 1111001
1405.
A.
Tower of Hanoi
b. Fibonacci Series
c. Tree Traversal
1407.
1408.
A binary number's value changes most drastically when the __MSB______ is changed.
1409.
A posterior analysis are more accurate than a priori analysis because –it contains prior data
The memory address of the first element of an array is called base address
1411.
1412.
The memory address of fifth element of an array can be calculated by the formula
- LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for
the array
- LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
- LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
- None of above
1413.
Which of the following data structures are indexed structures? Linear arrays
1415.
1416.
Which of the following is not the required condition for binary search algorithm?
binary search algorithm is not efficient when the data elements are more than 1000
1419.
1420.
_________ method is used to establish priority by serially connecting all devices that request an interrupt.
Daisy chaining
1421.
Two dimensional arrays are also called table arrays and matrix arrays
1423.
MBR ← PC
MAR ← X
PC ← Y
Memory ← MBR
1424.
Which of the following data structure can't store the non-homogeneous data elements? arrays
1425.
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line
needed to construct a 16K × 16 RAM from 1K × 8 RAM is 4 decoders are required
1427.
Which of the following data structure store the NON homogeneous data elements?
1428.
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable
are called
1429.
Consider a hypothetical processor with an instruction of type LW R1, 20(R2), which during execution reads a 32-
bit word from memory and stores it in a 32-bit register R1. The effective address of the memory location is
obtained by the addition of a constant 20 and the contents of register R2. Which of the following best reflects the
addressing mode implemented by this instruction for operand in memory. Base index addressing
How many 32K x 1 RAM chips are needed to provide a memory capacity of 256K-bytes? 64
1431.
-All of the above(- An array is suitable for homogeneous data but the data items in a record may
have different data type
- In a record, there may not be a natural ordering in opposed to linear array)
1432.
A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The
word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is
_____
2^20 blocks, so 20 bits.
1433.
1435.
1436.
class A
int x = 10;
x = x;
System.out.println(this.x);
new A().assign(100);
10.
1437.
Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O
band-width?
class B
count++;
B b1 = new B();
b1.increment();
B b2 = new B();
System.out.println(b2.count); // line 13
101.
1439.
1440.
class Test
z = x + y; // line 8
System.out.println(z);
1441.
What will happen if you try to compile and run the following code ?
class Test
{
int x;
Test(int n)
System.out.println(x=n); // line 6
1443.
1444.
1445.
class Animal
System.out.println(an.name+" "+an.makeNoise());
ANIMAL BARK
1447.
During transfer of data between the processor and memory we use ______ REGISTERS
1448.
class A
{ System.out.println("A"); }
void m1()
{ System.out.println("B"); }
A a = new B();
a.m1();
COMPILATION FAILS
1449.
Physical memory is divided into sets of finite size called as ______ . FRAMES
1451.
1452.
The technique where the controller is given complete access to main memory is BURST MODE
1453.
Multiple inheritance is not supported in Java because?
Predict Output, if the below code is run with given
command?
System.out.println(argv[1])
1455.
1456.
The techniques which move the program blocks to or from the physical memory is called as ______.
VIRTUAL
MEMORY ORGANISATION.
1457.
class average {
double result;
result = 0;
System.out.print(result/6);
16.466666666666667
The binary address issued to data or instructions are called as ____LOGICAL ADDRESS__.
1460.
class increment {
int g = 3;
System.out.print(++g * 8);
}
}
32
1461.
The virtual memory basically stores the next segment of data to be executed on the SECONDARY
STORAGE_________.
class array_output {
array_variable[i] = i;
i++;
02468
1463.
In associative mapping during LRU, the counter of the new block is set to ‘0’ and all the others are incremented
by one,when _____ occurs.
MISS
1464.
abstract class A
{
int a = 100;
objA.showA();
1465.
The two phases of executing an instruction are, Instruction fetch and instruction execution
The Instruction fetch phase ends with, Decoding the data in MDR and placing it in IR
1467.
Which of the following statement is true about an Interface? Interface cannot implement a class.
1468.
When using Branching, the usual sequencing of the PC is altered. A new instruction is loaded which is called as
_
BRANCH TARGET_____
1469.
// Class declarations :
interface A {}
class B {}
class C extends B implements A {}
class D implements A {}
// Declaration statements :
A a = d;
B b = new B();
C c = new C();
D d = new D();
1471.
1472.
1473.
You can import only static members of a class present in some other package using _ -import static keyword
(If this option exists)
1475.
It declares a Java class to use in the code below the import statement.
1476.
What is the stored in the object obj in following lines of code? NULL
box obj;
1477.
When we create String with new() Operator, where is it stored?
Which two methods you need to implement to
use an Object as key in HashMap?
-If you use new operator for creating strings in Java, it creates an object only in the heap memory
1479.
Which keyword is used by method to refer to the object that invoked it?
this
1480.
Which of the following is a method having same name as that of its class? constructor
1481.
Which function is used to perform some action when the object is to be destroyed? finalize
Which of these is used to access member of class before object of that class is created? static
1483.
1484.
1485.
A method within a class is only accessible by classes that are defined within the same package as the class of the
method.
1486. Two methods are said to be overloaded if they have, have same name but different parameters.
1487.
1488.
1489.
class B
count++; }
B b1 = new B();
b1.increment();
B b2 = new B();
System.out.println(b2.count); } }
101
The mechanism that binds code and data together to keep them secure from outside world is known as
encapsulation
1491.
The file iosteram.h consists of declaration of standard stream input and output facilities.
It also consists of procedure that predefine a set of operations for handling reading and writing of
built-in data types.
1492.
Which of the following is considered as a blue print that defines the variables and methods common to all of its
objects of a specific kind?
class
1493.
Assume that a File is an abstract class and has toFile() method. ImageFile and BinaryFile are concrete classes of
the abstract class File.
Also, assume that the method toFile() is implemented in both Binary File and Image
File. Which implementation method will be called when a File references an ImageFile object in memory and the
toFile method is called?
1495.
The data type void actually refers to an object that does not have a value of any type
1496.
The object of DataInputStream is used to
To covert binary stream into character stream
1497.
Assume that the value 3929.92 is of type ‘float’. How to assign this value after declaring the variable ‘interest’ of
type float?
interest = 3929.92f
1499.
Which of the methods should be implemented if any class implements the Runnable interface?
run()
1500.
-1
1501.
What is the value of ‘number’ after the following code fragment execution?
ANS:12
int number = 0;
number = number + 1;
1503.If result = 2 + 3 * 5, what is the value and type of ‘result’ variable? ANS:17,int
1504.
What is an aggregate object? ANS: An aggregate object is one which contains other objects. For example, an
Airplane class would contain Engine, Wing, Tail, Crew objects.
1505.
Which of the following is not a return type? Public
When a thread terminates its processing, into what state that thread enters?
Dead state
1507.
To execute the threads one after another the keyword synchronized is used
1508.
Consider the following code snippet. What will be assigned to the variable fourthChar, if the code is
executed?throws StringIndexOutofBoundsException
String str = new String(“Java”);
char fourthChar =
str.charAt(4);
1509.
class can have many methods with the same name as long as the number of parameters or type of parameters is
different. This OOP concept is known as
Method Overloading
Given the following code snippet;
int salaries[];
int index = 0;
salaries = new int[4];
while (index < 4)
{
salaries[index] = 10000;
index++;
}
What is the value of salaries [3]?10000
1511.
1512.
1513.
How many numeric data types are supported in Java?six of the eight primitive data types are numeric
types
1515.
All the wrapper classes (Integer, Boolean, Float, Short, Long, Double and Character) in java are final
1516.
You are putting in place an overloading when you change the original types for the arguments in the
signature of a method.
You are putting in place an overriding when you change the original definition of a method.
1517.
Destructor" functions are the inverse of constructor functions. They are called when objects are
destroyed (deallocated). Designate a function as a class's destructor by preceding the class name
with a tilde (~)
Which classes allow primitive types to be accessed as objects? ANS: Wrapper
1519.
1520.
Which of the following operators allow to define the member functions of a class outside the class? ANS: " :: "