Professional Documents
Culture Documents
A. int a3;
B. int Aa;
C. int A3;
D. int A 3;
ANSWER: D
Which data type is most suitable for storing a number 65000 in a 32-bit system?
A. int
B. long
C. short
D. doubles
ANSWER: C
C programs are convrted into the machine language with the help of ?
A. Loader
B. An operating system
C. Linker
D. Compiler
ANSWER: D
Algorithm and FLow chart helps to
A. Specify the problem completely and clearly
B. Know Memory capacity
C. Identify the base of a number system
D. Direct the output to printer
ANSWER: A
which of the files are created by the assembler and linker respectively:
A. Executable and Object
B. Object and Executable
C. Object and Object
D. Executable and Executable
ANSWER: B
Loader is part of
A. Hardware
B. Operating System
C. Memory
D. None
ANSWER: B
If a 3-input NAND gate has eight input possibilities, how many of those
possibilities will result in a HIGH output?
A. 1
B. 2
C. 7
D. 8
ANSWER: C
For the given boolean function, F(x,y,z) = x + yz, what would be the value of
(F.F)?
A. 0
B. 1
C. xy+xy+xy
D. xy+xy+y
ANSWER: A
For the SOM expression, ABC+ABC+ABC how many 1s are in the truth table's
output column?
A. 1
B. 7
C. 5
D. 3
ANSWER: D
Determine the binary code for the decimal number 9 using a weighted code with
weights 8,4,-2 and -1
A. 1001
B. 1011
C. 1111
D. 1101
ANSWER: C
How many gates are required for function F= AB+C(D+E) before simplification
and after simplification?
A. 3,4
B. 4,4
C. 3,3
D. 4,3
ANSWER: B
How many maxterms are present in the following boolean function? F(A,B,C,D) =
1
A. 0
B. 1
C. 16
D. None of these
ANSWER: A
For the given boolean function, F(w,x,y,z) = wx + yz, what would be the value of
(F+F')?
A. 0
B. 1
C. w(x+y') + w'y'z + wx'z'
D. x(wy+z) + y'(xz+w) + z'(y+x')
ANSWER: B
Reduce the boolean expression ABC + A'B'C + A'BC + ABC' + A'B'C' to five
literals.
A. A'B' + B(A+C)
B. AB + A'(C+C')
C. A'B' + A(B+C)
D. A'B + B'(A+C')
ANSWER: A
Which of these keywords is used to refer to member of base class from a sub
class?
A. upper
B. super
C. this
D. None of the mentioned
ANSWER: B
What is process of defining two or more methods within same class that have
same name but different parameters declaration?
A. method overloading
B. method overriding
C. method hiding
D. None of the mentioned
ANSWER: A
What is the output of this C code? #include <stdio.h> int main() { char str[10] =
"hello"; char *p = strrchr(str, 'l'); printf("%c\n", *(++p)); }
A. l
B. o
C. e
D. compilation error
ANSWER: B
Which of the following does not initialize ptr to null (assuming variable
declaration of a as int a=0;?
A. int *ptr = &a;
B. int *ptr = &a &a;
C. int *ptr = a a;
D. All of the mentioned
ANSWER: A
In the reflexive rule (IR1), the true dependencies generated are classified as
A. trivial
B. nontrivial
C. inferential
D. functional
ANSWER:A
__________ states that only valid data will be written to the database.
A. Consistency
B. Atomicity
C. Durability
D. Isolation
ANSWER:A
Which one of the following statements if FALSE?
A. Any relation with two attributes is in BCNF
B. A relation in which every key has only one attribute is in 2NF
C. A prime attribute can be transitively dependent on a key in a 3 NF relation.
D. A prime attribute can be transitively dependent on a key in a BCNF relation.
ANSWER:D
The means that data used during the execution of a transaction cannot be used
by a second transaction until the first one is completed is called
A. Serializability
B. Atomicity
C. Isolation
D. Time Stamping
ANSWER:C
A. Queue
B. Stack
C. Tree
D. Array
ANSWER:B
Which data structure is best suited for performing undo and redo operation?
A. Queue
B. Stack
C. Tree
D. Array
ANSWER:B
which tree traversing method will result into ascending order for Binary search
tree?
A. Inorder
B. Preorder
C. Postorder
D. DFS
ANSWER:A
Consider a full binary tree having 512 leaf nodes at level 9 then how many
maximum number of nodes can be there?
A. 1023
B. 511
C. 1024
D. 2048
ANSWER:A
what kind of the matrix will be for the graph representation, if the graph is
strongly connected?
A. Dense matrix
B. Weakly matrix
C. Sparse matrix
D. Null matrix
ANSWER:A
What can we said about the array representation of a circular queue when it
contain only one element?.
A. Front=Rear=NULL
B. Front=Rear-1
C. Front=Rear+1
D. Front=Rear
ANSWER:D