Ans .B

1. Explanation :

C=B log2 (1 + S/N) where C is the capacity in bits per second.
B is the bandwidth of the channel in Hertz and S/N is the signal to noise ratio.

Ans . D

1. Explanation :

A bipartite graph is a complete bipartite graph if every vertex in U is connected to every vertex in V.
If U has n elements and V has m, then the resulting complete bipartite graph can be denoted by K n,m and the number of edges is
given by n*m.
The number of edges = K 3,4 = 3 * 4 = 12

Ans .A

1. Explanation :

A bipartite graph is a complete bipartite graph if every vertex in U is connected to every vertex in V.
If U has n elements and V has m, then the resulting complete bipartite graph can be denoted by K n,m and the number of edges is
given by n*m.
The number of edges = K 3,4 = 3 * 4 = 12

Ans .B

1. Explanation :

Power-dissipation capacitance is heavily dependent on the dynamic supply current, which, in turn, is sensitive to input edge rates.
Dynamic supply current is dominant in CMOS circuits because most of the power is consumed in moving charges in the parasitic
capacitor in the CMOS gates. As a result, the simplified model of a CMOS circuit consisting of several gates can be viewed as
one large capacitor that is charged and discharged between the power-supply rails.

Ans .D

1. Explanation :

Universal gates are the ones which can be used for implementing any gate
like AND,OR and NOT or any combination of these basic gates.
Apart from the NOR gate, NAND gate is also considered as universal gate.

Ans .C

1. Explanation :

The network layer is responsible for routing data through the network, but with a broadcast network, routing is not needed.

Ans .B

1. Explanation :

An ATM cell always consists of a 5-byte header followed by a 48-byte payload.
So the size is 53 bytes long.

Ans . D

1. Explanation :

Arranging in increasing order of their runtime

Ans .B

1. Explanation :

access time = time for associative memory * hit ratio + time for main memory

Ans .C

1. Explanation :

Minimum transmission band-width of TDM channel is given by the following equation.
Bt=NW
Where N is the total number of channels, which are bandlimited to 'W' Hz.
In the above problem, the number of signals are N, each band limited to Fm Hz and so the minimum band-width is N fm.

Ans .C

1. Explanation :

To guarantee the detection of upto s errors in all cases, the minimum hamming distance in a block code must be
dmin=s+1
So, the minimum hamming distance for a 't' error detecting must be t+1

Ans .D

1. Explanation :

(4,3) not present-not symmetic, (2,3)&(3,4) present-not transitive, (4,4) present-not reflexive.

Ans .D

1. Explanation :

To find the dual, we switch AND with OR, OR with AND. But literals itself are not going to get complimented.
So dual of x + yz will be x(y+z)

Ans .D

1. Explanation :

Characteristic table of D-flip flop
D=0 Q=O
D=1 Q=1

Ans .A

1. Explanation :

Multiplexers are not limited to just switching a number of different input lines or channels to one common single output.
There are also types that can switch their inputs to multiple outputs and have arrangements or 4-to-2, 8-to-3 or even 16-to-4 etc

Ans .C

1. Explanation :

A station can send only at the beginning of a timeslot, and thus collisions are reduced.
In this case, only transmission-attempts within 1 frame-time and not 2 consecutive frame-times need to be considered,
since collisions can only occur during each timeslot. Thus, the probability of there being zero transmission-attempts in a single timeslot is e^-G.
the probability of k packets is: e^-G*(1-e^-G)^(k-1)
The throughput is: G*e^-G.The maximum throughput is 1/e frames per frame-time (reached when G = 1),
which is approximately 0.368 frames per frame-time, or 36.8%.

Ans . A

1. Explanation :

Addressing, internetworking, error handling, packet sequencing are its other jobs.

Ans . A

1. Explanation :

Page No .91 of Tanenbaum book, you will find the following statement.
"Due to their adequate performance and low cost, twister pairs are widely used and are likely to remain so for years to come".

Ans . A

1. Explanation :

Shortest path routing refers to the process of finding paths through a network that have a minimum of distance or other cost metric.
Routing of data packets on the Internet is an example involving millions of routers in a complex, worldwide, multilevel network. Optimum routing on the Internet has
a major impact on performance and cost. These algorithms do not base their routing decisions on measurements and estimates of the current traffic and topology. Instead the route to be
taken in going from one node to the other is computed in advance, off-line, and downloaded to the routers when the network is booted. This is also known as static routing.

Ans .B

1. Explanation :

Class B address range 128.1.0.1 to 191.255.255.254

Ans .B

1. Explanation :

According to the probabilistic model, if a process spends a fraction p of its time in I/O wait state,
and if there are N processes in memory, then the CPU utilization is given by 1-PN

Ans . C

1. Explanation :

We would think of memory as linear, not planar, because of the way it is addressed. Then you have as many holes as processes, so the fraction of holes is (1/2)/(1/2)+1=1/3

Ans .C

1. Explanation :

Shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the
smallest execution time to execute next.SJN is a non-preemptive algorithm.

Ans . A

1. Explanation :

Amoeba is a distributed operating system developed by Andrew S. Tanenbaum and others at the Vrije Universiteit Amsterdam.
The aim of the Amoeba project was to build a timesharing system that makes an entire network of computers appear to the user as a single machine.

Ans . C

1. Explanation :

In computer programming, a static variable is a variable that has been allocated "statically",
meaning that its lifetime (or "extent") is the entire run of the program.

Ans .C

1. Explanation :

For the while statement there is a for loop inside. For the for loop, there is one if condition, based on which there is a break statement. Since the value of x initially is 0,
the while condition would be true and the for loop would start executing. The if statement condition would be checked, since ++x would become 1 and 1%10 is not equal to 0,
break will not be executed. Since for is infinite x value will go on increasing. Once the value of x reaches 9, ++x would become 10 and 10%10==0 and so break would be executed.
So control will come out of the innermost loop and would go to the outer loop.
Sinc the value of x is 10, and since it is equal to 10, once again the for loop would start its execution.
Once the value of x reaches 20, 20%10 will be equal to 0 and again break will be executed and control would go to the outer for loop.
When the condition is checked for x<=10,it is false as the value of x is 20 and so it comes out of the while loop and the printf statement gets executed, printing the value of 20.

Ans .B

1. Explanation :

There are three general cases where the copy constructor is called: When instantiating one object and initializing it with values from another object (of same type).
When passing an object by value. When an object is returned from a function by value.

Ans . A

1. Explanation :

Extensible is used to add new features to C++.

Ans . D

1. Explanation :

A class can have multiple constructors, as long as their signature (the parameters they take) are not the same. You can define as many constructors as you need.

Ans . D

1. Explanation :

An entity is an object in the real world. Each entity has properties, called attributes. A particular entity has values for the attributes.
Attributes may be:
simple (atomic) (ZIP)
single-valued (AGE)
multivalued (DEGREES)
Derived attribute:
AGE from BIRTHDATE
Attributes may have NULL values unknown not applicable.

Ans . B

1. Explanation :

It is a specialized form of Association where all object have their own lifecycle but there is ownership.

Ans . D

1. Explanation :

A decomposition {R1, R2} is a lossless-join decomposition if
R1 n R2 -> R1 or R1 n R2 -> R2. Let R1 = (A, B, C), R2 =(A, D, E), and R1 n R2 = A. Since A is a candidate key
Therefore R1 n R2 -> R1.

Ans . A

1. Explanation :

Ambiguous Answer, Both Option A and B valid.
If it is MAX Heap the every element is MAX of all elements in its subtree.
If it is MIN Heap the every element is MIN of all elements in its subtree.

Ans .A

1. Explanation :

Algorithm For Insertion in Circular Queue
Step 1: If REAR = SIZE-1 then
REAR = 0
Else
REAR=REAR + 1
Step 2: If FRONT = REAR then
Write ("Circular Queue Overflow")
Step 3: CQ[REAR]=X
Step 4: If FRONT = -1 then
FRONT=0

Ans .A

1. Explanation :

Asynchronous transfer mode (ATM) is a high-performance, cell-oriented switching and multiplexing technology that utilizes
fixed-length packets to carry different types of traffic. ATM is a technology that will enable carriers to capitalize on a number of revenue opportunities through
multiple ATM classes of services; voice, video, and future multimedia applications.

Ans . A

1. Explanation :

Bridges operate at the Data-Link Layer of the OSI Model. They can distinguish between local and remote data,
so data traveling from one workstation to another in the same segment doesn't have to cross the bridge. Bridges operate on MAC-Layer addresses.

Ans . C

1. Explanation :

Assembly program consists of three types of statements.
1. Imperative
2. Declarative
3. Assembler directives

Ans .D

1. Explanation :

The address could be the start of an array or vector, and the index could select the particular array element required.
The processor may scale the index register to allow for the size of each array element.

Ans . D

1. Explanation :

EQU Equate
ORG Origin
START Define the start of the first control section in a program.
END End of assembly language program and "starting address" for execution

Ans . A

1. Explanation :

Devices in UNIX are represented by files. These are special files located in the )dev directory. Hence in UNIX,
every piece of hardware is a file. This device file allows us to access the hardware.UNIX represents all devices as files. These files are located in the
directory /dev. That is why the devices and other files are accessed in a similar way.Devices file which is specified as 'block special file' with some similar
characters of a disk file. A device which is specified as a 'character special file' with some characteristics that is similar to a keyboard.For instance the following command; Less -f /dev/hda is not a file in the 'real' sense. When read, it is actually reading directly from the first physical hard disk of your machine.

Ans .D

1. Explanation :

RAM (random access memory) is the place in a computing device where the operating system (OS), application programs and data in current use are kept so they can be quickly reached by the device's processor.

Ans .B

1. Explanation :

Virtual Memory is designed to extend the limited physical memory.

Ans .D

1. Explanation :

Software Quality Assurance encompasses the entire software development life cycle and the goal is to ensure that the development
and/or maintenance processes are continuously improved to produce products that meet specifications/requirements.

Ans . B

1. Explanation :

Level 3: At the defined level, an organization has developed its own standard software process through greater attention to documentation, standardization, and integration.

Ans .C

1. Explanation :

The model parameters are derived from fitting a regression formula using data from historical projects (61 projects for COCOMO 81 and 163 projects for COCOMO II).
COCOMO is used to estimate size, effort and duration based on the cost of the software.

Ans .B

1. Explanation :

One point is 1/72 of an inch and so we will get the answer 0.0138 inch.

Ans .A

1. Explanation :

Wimax Operator'S Manual: Building 802.16 Wireless Networks, 2Nd Ed. Chapter 5

Ans .D

1. Explanation :

E-commerce involves paperless transactions and usage of EDI(Electronic Data Interchange),
electronic mail, bulletin boards, fax transmission and electronic fund transfers.

Ans . B

1. Explanation :

Back propagation algorithm uses squared error score function. CART algorithm uses cross-validated loss function.

Ans .C

1. Explanation :

The schema is the Active Directory component that defines all the objects and attributes that the directory service uses to store data.
The physical structure of the schema consists of the object definitions. The schema itself is stored in the directory.