What is XML?
A.
Super
set of SGML, Extendable Markup Language
B.
Subset
of SGML, Extensible Markup Language
C.
Like
SGML, Extended Markup Language
D.
None
Of these
Ans:
In TCP a unique sequence number is assigned to
each
A.
Byte
B.
Message
C.
Word
D.
Segment
A firewall is to be configured to allow hosts in a private
network to freely open TCP connections
and send packets on open connections. However, it
will only allow external host to send packets on existing open TCP connections or connections that are being
opened by internal hosts but not allow them to open TCP connections to host in
the private network. To achieve this minimum capability of the firewall should
be that of
A.
A combinauonal circuit
B.
Push down automaton with
two stacks
C.
A finite automaton
D.
A pushdown automaton with one stacks
HELO and PORT, respectively are commands
from the protocol:
A.
FT'P and
HTI'P
B.
TELNet and POP3
C.
HTTP and TELNET
D.
SMTP and
FTP
Answer OPtion D
Which of the
following statements ie TRUE about CSMA/CD?
A.
IEE802.ll wireless LAN runs
CSMA/CD protocol
B.
Ethernet is
not based on CSMA/CDprotocol
C.
CSMA/CD is not
suitable for a high propagation delay network like satellite network
D.
There is no
contention in a CSMA/CD network
Count to infinity is a problem
associated with:
A.
Link state routing protocol
B.
DNS while resolving hostname
C.
Distance vector
routing protocol
D.
TCP for congestion control
In a TCP/IP protocol
suite, which one of the following is NOT a part
of IP header?
A. Fragment Offset B. Destination IP Address |
|
|
C. Source IP Address D. Destination port number |
Connected
to a department network which is part of a university network. The university network in
turn, is part of the internet. The largest network in which the
Ethernet address of the host is unique is:
A.
The
subnet to which the host belongs
B.
The
department network
C.
The
internet
D.
The university network
A sender is employing
public key cryptography to send
a secret message to a receiver. Which one of the
following statements is TRUE?
A. Sender encrypts using receivers public key
B. Sender encrypts
using his own public key
C. Receiver decrypts using
senders public key
D. Receiver decrypts using his own
public key
A linker:
|
A.
Is not necessary with variable partitions B.
Must be run after
the loader C.
Creates a load
module D. Is not needed with a good compiler |
|
|
In real-time OS,
which of the following is the most suitable scheduling
scheme?
A.
Round Robin
B.
Preemptive
C.
First come first
serve
D.
Random Scheduling
Dijkstra's
banking algorithm in an OS, solves
the problem of:
A.
Deadlock avoidance
B.
Mutual exclusion
C.
Deadlock
recovery
D.
Context switching
Consider a fully associative cache with 8 cache blocks
(numbered 0-7) and the following sequence of memory block requests:
4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7
If LRU replacement policy is used, which cache block will
have memory block 7?
(A) 4
(B) 5
(C) 6
(D) 7
Answer: (B)
Explanation: Block size is =8
Given
4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7
So
from 0 to 7 ,we have
·
4
3 25 8 19 6 16 35 //25,8 LRU so next 16,35 come in the block.
·
45 3 25 8 19 6 16 35
·
45 22 25 8 19 6 16 35
·
45
22 25 8 19 6 16 35
·
45
22 25 8 3 6 16 35
//16 and 25 already there
·
45
22 25 8 3 7 16 35 //7 in
5th block
Therefore ,
answer is B
Two shared resources R1 and R2 are used by
processes P1 and P2. Each process has a
certain priority for accessing each resource. Let Tij denote the
priority of Pi for accessing Rj. A process Pi can snatch a resource Rh from process Pj if Tik is greater than
Tjk.
Given the following :
1.
T11 > T21
2.
T12 > T22
3.
T11 < T21
4.
T12 < T22
Which of the following
conditions ensures that P1 and P2 can never
deadlock?
(A) (I) and (IV)
(B) (II) and (III)
(C) (I) and (II)
(D) None of the above
Answer: (C)
Explanation:
If all the resources are allocated to one process then deadlock will never
occur.
So, if we allocate both R1 and R2 to process P1 or both R1 and R2 to process P2
then deadlock can be prevented.
When one process completes its execution then both the resources are allocated
to the other process.
So, either condition (I) and (II) or condition (III) and (IV) ensures that
deadlock never occurs.
Afirewall:
A. Is a computer or router that sits between the trusted and untrusted
B. It limit network access between the two security domains, maintains and logs all connections
C. A firewall may need to allow http to pass
D. All of these
A problem in NP is NP complete if
A.
Some
problem in NP can be reduced to it in
polynomial time
B.
The 3..SAT problem can be reduced to it in polynomial
time
C.
It can be reduced to any other
problem in NP in polynomial time
D.
It can be reduced to be 3 SAT problem in polynomial time
The
maximum number of edges in an acyclic
undirected graph with n
vertices is:
A.
n-1
B.
n+1
C.
n
D.
2n-I
In
a binary tree, the number of internal nodes of degree1is 5 and the
number of internal nodes of degree 2is10.The number of leaf nodes in the binary tree is:
A.
15
B.
11
C.
12
D.
10
Which of the following a sequence of array elements form a heap?
A.
(23,17,14,6,13,10,l,12,7,5)
B.
(23,17,14,6,13,10,l,5,7,12)
C.
(23,17,14,7,13,10,l,5,6,12)
D.
(23,17,14,7,13,10,l,12,15,7)
|
The binary relation={{l,1),(2,1),(2,2),(2,8),(2.
4),(3,1),(3,2),(3,3),(3,4)}on
the set
A (1,2,3,4,}is:
A.
Reflexive .symmetric
and transitive
B.
Neither
reflexive, nor ir reflexive but transitive
C.
Irr eflexive and anti symmetric
D.
lr reflexive, symmetric and transitive
In a room containing
28people,there are 18 people who speak Engli•h,15 people who speak Hindi and 22 people who speak Kannada, 9persons speak both Engli•h and Hindi,11 person speak both Hindi and
Kannada whereas 13 persons
speak both Kannada and English.How many people
speak all the three language?
A. 6
B. 7
C. 8
D. 9
Which one of
the fo1lowing regular exprssion
is NOT equivalent to
Other regular expression ((ab)*+c*)*?
A. (a*+b*+c*)*
B. (a+b+c)*
C. (a*b*c*)
D. (a*b*+c*)*
Which of the following statements TRUE
about other regular expression 01*0?
A. It represents
finite set of finite strings
B. It represents
an infinite set of finite strings
C. It represents
an infinite set of infinite strings
D. It represents
an finite set of infinite strings
Let L be a context free
language and M are regular language. Then the language LnM:
A. Always regular
B.
Always
a deterministic context free language
C.
Never
regular
D.
Always
a context free language
A major advantage of
inheritance
A. Reducing
the time it take to create new objects
B. Not
having to think about how object will be used
C. Reducing
the amount of memory required to execute the program
D. Enabling
people to create useful application programs
ANSWER : OPTION A
Which
of the following is a realization of polymorphism?
A. Operator overloading
B. Function
Overloading
C. Dynamic
Binding
D. All
of these
The technique used to
summarize the financial, statistical, mathematical, scientific and economic
data is?
A. Presentation Graphics
B. Image processing
C. Computer Art
D. None of above
Ans: Option A
Let P be a singly linked list.
Let Q be the pointer to an intermediate node x in the list. What
is the worst-case time complexity of the best-known algorithm to delete the
node x from the list?
A.
O(n)
B.
O(log2n)
C.
O(logn)
D.
O(1)
Ans: Option A
In a binary tree, for every node the
difference between the number of nodes in the left and right subtrees is at
most 2. If the height of the tree is h > 0, then the minimum number of nodes
in the tree is:
(A) 2h – 1
(B) 2h – 1 + 1
(C) 2h – 1
(D) 2h
Answer: (B)
Explanation:
Let
there be n(h) nodes at height h.
In
a perfect tree where every node has exactly
two
children, except leaves, following recurrence holds.
n(h)
= 2*n(h-1) + 1
In
given case, the numbers of nodes are two less, therefore
n(h)
= 2*n(h-1) + 1 - 2
= 2*n(h-1) - 1
Now
if try all options, only option (b) satisfies above recurrence.
Let
us see option (B)
n(h)
= 2h - 1 + 1
So
if we substitute
n(h-1)
= 2h-2 + 1, we should get n(h) = 2h-1 + 1
n(h)
= 2*n(h-1) - 1
=
2*(2h-2 + 1) -1
= 2h-1 + 1.
A binary search tree contains the
numbers 1,2,3,4,5,6,7,8.1,2,3,4,5,6,7,8. When the tree is traversed
in pre-order and the values in each node printed out, the sequence of values
obtained is 5,3,1,2,4,6,8,7.5,3,1,2,4,6,8,7. If the tree is traversed
in post-order, the sequence obtained would be
A.
8,7,6,5,4,3,2,1
B.
1,2,3,4,8,7,6,5
C.
2,1,4,3,6,7,8,5
D.
2,1,4,3,7,8,6,5
Consider a relation R with
five attributes V, W, X, Y, and Z. The following functional dependencies hold:
VY→ W, WX → Z, and ZY → V.
Which of the following is a candidate key for R?
(A) VXZ
(B) VXY
(C) VWXY
(D) VWXYZ
Answer: (B)
Explanation: Using VY, W can be explored. With WX, Z can be explored
Amongst the ACID properties of a
transaction, the ‘Durability’ property requires that the changes made to the
database by a successful transaction persist
(A) Except in
case of an Operating System crash
(B) Except in
case of a Disk crash
(C) Except in
case of a power failure
(D) Always,
even if there is a failure of any kind
Answer: (D)
Explanation: ACID properties:
Atomicity: By this, we
mean that either the entire transaction takes place at once or doesn’t happen
at all.
Consistency: This
means that integrity constraints must be maintained so that the database is
consistent before and after the transaction.
Isolation: This
property ensures that multiple transactions can occur concurrently without
leading to inconsistency of database state.
Durability: This
property ensures that once the transaction has completed execution, the updates
and modifications to the database are stored in and written to disk and they
persist even if system failure
occurs no matter which type of failure.
Therefore option D
(A) 5
(B) 4
(C) 3
(D) 2
Answer: (A)
Explanation: Number of children of a node is equal
to the number of keys in it plus 1.
Given tree has 4 levels, the tree will be
increased with one more level if a new key is inserted.
(A) 1 NF
(B) 2 NF
(C) 3 NF
(D) none
Answer: (A)
Explanation:
First Normal Form
A relation is in first normal form if every attribute in that relation is
singled valued attribute.
Second Normal Form
A
relation is in 2NF iff it has No Partial Dependency, i.e., no
non-prime attribute (attributes which are not part of any candidate key) is
dependent on any proper subset of any candidate key of the table.
A relational database contains two tables employee and department in which employee table has columns emp-no and dept-id and department table has columns dept-id and dept-name. The following insert statements were executed successfully to populate the empty tables:
Insert into department values(2,'information technology')
insert into employee values(1,'Navin',1)
insert into employee values(2,'Mukesh',2)
insert into employee values(3,'Suresh',2)
How many rows
and columns will be retrieved by the following SQL statement
Select * from employee, department
A) 0 row and 4
columns
B) 3 rows and 4
columns
C) 3 rows and 5
columns
D)
6 rows and 5 columns
Since, there is no specific joining condition
specified, it will retrieve Cartesian product of the table
Number of rows = product of number of rows in each
relation
Number of columns = sum of number of columns
Answer: D.
A software configuration management tool helps
in
A.
keeping track of the
schedule based on the milestones reached
B.
maintaining different
versions of the configurable items
C.
managing manpower
distribution by changing the project structure
D.
all of the above
Answer: B
A relation Employee is defined with attributes
empcode (unique), name, street, city, state and pincode. For any pincode, there
is only one city and state. Also, for any given street, city and state, there
is just one pincode. In normalization terms, Employee is a relation in
(A) 1NF only
(B) 2NF and hence also in 1NF
(C) 3NF and hence also in 2NF and 1NF
(D) BCNF and hence also in 3NF, 2NF an 1NF
Answer: (B)
Explanation:
Given:
Empdtl: empcode , name,
street, city, state and pincode
·
There
is transitive dependency in Table ( pincode, there is only one city and
state),so not in 3NF
·
All
attributes are fully dependant on key,so in 2NF
So answer is B
In a
software project, COCOMO (Constructive Cost Model) is used to estimate
(A) effort and
duration based on the size of the software
(B) size and
duration based on the effort of the software
(C) effort and
cost based on the duration of the software
(D) size,
effort and duration based on the cost of the software
Answer: (A)
Explanation: The
basic COCOMO equations take the form
Effort Applied (E) = ab(KLOC)bb [ person-months ]
Development Time (D) = cb(Effort Applied)db [months]
People required (P) = Effort Applied / Development Time [count]
//Source:Wikipedia
As it can
be observed from above equations,Effort and Duration are on L.H.S whereas
KLOC(Line of code) ,used to measure program size is on R.H.S. Hence, Answer is A
In
the absolute addressing mode
(A) the operand
is inside the instruction
(B) the address
of the operand is inside the instruction
(C) the
register containing address of the operand is specified inside the instruction
(D) the
location of the operand is implicit
Answer: (B)
Explanation: (b)
is the answer. Absolute addressing mode means address of operand is given in
the instruction.
(a) operand is inside the instruction -> immediate addressing
(c) -> register addressing
(d) -> implicit addressing
The register used as a working area in CPU is
A.
Program counter
B.
Instruction register
C.
Instruction decoder
D. accumulator
Ans: Option D
The register which keeps track of
the execution of a program and which contains the memory address of the
instruction currently being executed is known as
A. Index Register
B. Memory Address Register
C. Program Counter
D. Instruction Register
Ans: Program Counter
The
address bus 8086 CPU is
Which of the following objects can be used in expressions and scriplets in JSP (Java Server Pages) without explicitly declaring them?
(A) session and
request only
(B) request and
response only
(C) response
and session only
(D) session,
request and response
Answer: (D)
Explanation:
JSP provides certain implicit objects which are accessed using standard
variables and are automatically available for use in our JSP without writing
any extra code. We can directly use them within Scriptlet without initializing
and declaring them.
Request :
It encapsulates the request coming from the Client and being processed by the
JSP. It is passed to the JSP by the container as a parameter of the jspService(
) method.
Session :
Session are created automatically, and a new session is available even when
there is no incoming session unless we have used a session = ”false” attribute
in the page directive.
Response :
It is used to reply to the client(browser) with either some data or redirect to
some other page
Thus, option (D) is correct.
The TRAP interrupts mechanism of the 80858085 microprocessor:
A.
executes
an instruction supplied by an external device through the INTAINTA signal
B.
executes
an instruction from memory location 20H20H
C.
executes
a NOP
D.
none
of the above
Answer
D
Which of the following statements about
relative addressing mode is FALSE?
A.
It enables reduced
instruction size
B.
It allows indexing of
array element with same instruction
C.
It enables easy
relocation of data
D. It enables faster address calculation than absolute addressing
Answer: It enables faster address calculation than absolute addressing
Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width?
A. Transparent DMA and
Polling interrupts
B. Cycle-stealing
and Vectored interrupts
C. Block transfer and
Vectored interrupts
D. Block transfer and
Polling interrupts
Answer: (C)
The
number (A72E)16 is equivalent
to A.
(123456)8 and (22130232)4 B.
(132456)8 and (22130232)4 C.
(123456)8 and (22131122)4 D.
(123546)8 and (22120232)4 |
|||
Convert AE27 to
Binary= 1010 0111 0010 1110 What is the minimum number
of NAND gates required to implement a 2-input EXCLUSIVE-OR function without
using any other logic gate? A. 3 B. 4 C. 5 D. 6
The
output of this C code is? #include <stdio.h> int
main() { do
printf(“Inside while loop “); while
(0); printf(“After
while loop\n”); }
A. Infinite loop B. Compilation error C. After While loop
D. Inside while loop After while loop Answer: Option D: Inside While loop After While loop The default parameter
passing mechanism of function is A. call by value B. call by reference C. call by result D. None of the above ANSWER: Option A What will be the output of
following C program segment? Int n=1 Switch (n) { Class1: printf (“One”) Class 2:printf(“ Two”) Class 3: Class 4: Class 5: default: Printf(“Wrong Choice”); } A. One B. One Two Wrong Choice C. Two
D. One Two Answer: Option B |
Comments
Post a Comment