Any
error whose cause cannot be identified anywhere within the software system is
called ________
A. Internal
error
B. External error
C. Inherent error
D. Logic error
What
would be the output of the following program, if run from the command line as
“myprog 1 2 3” ?
main (int argc, char * argv[ ])
{ int i ;
i = argv[1] + argv[2] + argv[3] ;
printf (“% d”, i) ;
}
main (int argc, char * argv[ ])
{ int i ;
i = argv[1] + argv[2] + argv[3] ;
printf (“% d”, i) ;
}
A. 123
B. 6
C. Error
D. “123”
A
page fault
A. is an error specific page.
B. is an access to
the page not currently in memory.
C. occur when a page program occur in a page
memory.
D. page used in the previous page
reference.
P
: “Program is a step by step execution of the instructions”. Given P, which of
the following is true ?
A. Program is a subset of an instruction set.
B. Program is a
sequence of a subset of an instruction set.
C. Program is a partially ordered set of an
instruction set.
D. All of the above
The
Unix command used to find out the number of characters in a file is
A. nc
B. wc
C. chcnt
D. c
In
case of Bus/Tree topology signal balancing issue is overcome by
A. Modulation
B. Polling
C. Segmentation
D. Strong transmitter
The
name of the transaction file shall be provided by the operator and the file
that contains the edited transactions ready for execution shall be called
A. Batch. Exe
B. Trans. Exe
C. Opt. Exe
D. Edit.Exe
Match
the following :
(i) Ethernet (a) Deterministic
(ii) Token Ring (b) Utilize the full wire speed
(iii) Cut-through switch (c) Prevent looping
(iv) Spanning tree (d) Checking valid address
(i) Ethernet (a) Deterministic
(ii) Token Ring (b) Utilize the full wire speed
(iii) Cut-through switch (c) Prevent looping
(iv) Spanning tree (d) Checking valid address
A. i – d, ii – a,
iii – b, iv – c
B. i – d, ii – a, iii – b, iv – c
C. i – d, ii – d, iii – c, iv – b
D. i – d, ii – c, iii – b, iv – a
The
highest noise margin is offered by
A. BICMOS
B. TTL
C. ECL
D. CMOS
Black
Box testing is done
A. to show that s/w
is operational at its interfaces i.e. input and output.
B. to examine internal details of code.
C. to examine internal details of code.
D. none of above.
With
regard to linked list, which of the following statement is false ?
A. An algorithm to search for an element in a
singly linked list requires 0(n) operations in the worst case.
B. An algorithm for
deleting the first element in a singly linked list requires 0(n) operations in
the worst case.
C. An algorithm for finding the maximum value in
a circular linked list requires 0(n) operations.
D. An algorithm for deleting the middle node of a
circular linked list requires 0(n) operations.
Recorded
software attributes can be used in the following endeavours :
(i) Cost and schedule estimates.
(ii) Software product reliability predictions.
(iii) Managing the development process.
(iv) No where
(i) Cost and schedule estimates.
(ii) Software product reliability predictions.
(iii) Managing the development process.
(iv) No where
A. (i) (ii) (iv)
B. (ii) (iii) (iv)
C. (i) (ii) (iii)
D. (i) (ii) (iii) (iv)
Analysis
of large database to retrieve information is called
A. OLTP
B. OLAP
C. OLDP
D. OLPP
Circle
has ____________
A. No vertices
B. Only 1 vertex
C. 8 vertices
D. None of these
The
simplified form of the Boolean expression (X+Y+XY)(X+Z) is
A. X + Y + ZX + Y
B. XY – YZ
C. X + YZ
D. XZ + Y
The
unlicensed National Information Infrastructure band operates at the _________
frequency
A. 2.4
GHz
B. 5 GHz
C. 33
MHz
D. 5 MHz
In
an absolute loading scheme which loader function is accomplished by assembler ?
A. re-allocation
B. allocation
C. linking
D. loading
Synthesized
attribute can be easily simulated by a
A. LL grammar
B. Ambiguous grammar
C. LR grammar
D. None of the above
Which
of the following statement is wrong ?
I. 2-phase locking protocol suffer from dead lock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.
I. 2-phase locking protocol suffer from dead lock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.
A. I, II, II
B. II, III,
IV
C. III, IV, V
D. II, IV, V
The
single stage network is also called
A. one sided network
B. two sided network
C. recirculating
network
D. pipeline network
Which
of the statements are true ?
I. Function overloading is done at compile time.
II. Protected members are accessible to the member of derived class.
III. A derived class inherits constructors and destructors.
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.
I. Function overloading is done at compile time.
II. Protected members are accessible to the member of derived class.
III. A derived class inherits constructors and destructors.
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.
A. I, II, III
B. II, III, V
C. III, IV, V
D. I, II, IV
If
the number of leaves in a strictly binary tree is an odd number, then what can
you say with full conviction about total number of nodes in the tree ?
A. It is an odd
number.
B. It is an even number
C. It cannot be equal to the number of leaves.
D. It is always greater than twice the number of
leaves.
The of the operation (10111)2*(1110)2 in hex
equivalence is
A. 150
B. 241
C. 142
D. 101011110
Recursive
functions are executed in a
A. First in first out-order
B. Last in first
out-order
C. Parallel fashion
D. Load balancing
Another
name of IEEE 802.11 a is ____________
A. Wi-Max
B. Fast
Ethernet
C. Wi-Fi
D. 802.11 g
The
number of edges in a complete graph of n vertices is
A. n
B. n(n – 1)/2
C. n(n + 1)/2
D. n2/2
Which
of the following are Data Link Layer standard ?
1. Ethernet 2. HSSI 3. Frame Relay
4. 10 – Base T 5. Token Ring
1. Ethernet 2. HSSI 3. Frame Relay
4. 10 – Base T 5. Token Ring
A. 1, 2, 3
B. 1, 3, 5
C. 1, 3, 4, 5
D. 1, 2, 3, 4, 5
Specialization
is __________ process.
A. top-down
B. bottom up
C. both (A) and (B)
D. none of these
Device
on one network can communicate with devices on another network via a
A. Hub/Switch
B. Utility server
C. File server
D. Gateway
A
hash function f defined as f(key) = key mod 7, with linear probing used to
resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table
indexed from 0 to 6. What will be the location of 11 ?
A. 3
B. 4
C. 5
D. 6
How
many 1’s are present in the binary representation of
3 × 512 + 7 × 64 + 5 × 8 + 3
3 × 512 + 7 × 64 + 5 × 8 + 3
A. 8
B. 9
C. 10
D. 11
A
semaphore count of negative n means (s=–n) that the queue contains ________
waiting processes.
A. n
+ 1
B. n
C. n - 1
D. 0
Software
Engineering is a discipline that integrates _________ for the development of
computer software.
A. Process
B. Methods
C. Tools
D. All
The
E-R model is expressed in term of
I. Entities
II. The relationship among entities.
III. The attributes of the entities.
IV. Functional relationship.
I. Entities
II. The relationship among entities.
III. The attributes of the entities.
IV. Functional relationship.
A. I, II
B. I, II, IV
C. II, II, IV
D. I, II, III
What
is the maximum window size in sliding window protocol used in a computer
network ?
A. 4
B. 8
C. 15
D. 16
Contex-free
Grammar (CFG) can be recognized by
A. Finite state automata
B. 2-way linear bounded automata
C. push down automata
D. both (B) and (C)
A
program is located in the smallest available hole in the memory is _________
A. best – fit
B. first – bit
C. worst – fit
D. buddy
Which
technology is sometime referred to as wireless cable ?
A. MMDS
B. ATM
C. LMDS
D. CDMA
A
__________ is a special method used to initialize the instance variable of a
class.
A. Member function
B. Destructor
C. Constructor
D. Structure
A
function that has no partial functional dependencies is in __________ form.
A. 3
NF
B. 2 NF
C. 4
NF
D. BCNF
In
the process management Round-robin method is essentially the pre-emptive
version of _________
A. FILO
B. FIFO
C. SSF
D. Longest time first
Encapsulation
is
A. Dynamic binding
B. A mechanism to
associate the code and data.
C. Data abstraction
D. Creating new class
Match
the following :
(1) Determinants (a) No attribute can be added
(2) Candidate key (b) Uniquely identified a row
(3) Non-redundancy (c) A constraint between two attribute
(4) Functional dependency (d) Group of attributes on the left
hand side of arrow of function dependency.
(1) Determinants (a) No attribute can be added
(2) Candidate key (b) Uniquely identified a row
(3) Non-redundancy (c) A constraint between two attribute
(4) Functional dependency (d) Group of attributes on the left
hand side of arrow of function dependency.
A. 1 – d, 2 – b, 3 – a, 4 – c
B. 2 – d, 3 – a, 1 – b, 4 – c
C. 4 – a, 3 – b, 2 – c, 1 – d
D. 3 – a, 4 – b, 1 – c, 2 – d
No comments:
Post a Comment