B.Tech Computer Science & Engineering
Question
Choice A
Choice B
Choice
C
Choice
D
Answ er Which is not the commonly used programming language for AI?PROLOG Java LISP Perl Choice D
What is state space? The whole problemRepresenting your problem with variable and parameterYour Definition to a problemA space where You know the solution. Choice B Which search method takes less memory? Depth-First Search Breadth-First SearchLinear SearchOptimal SearchChoice A A* algorithm is based on Depth-First Search Breadth-First SearchBest-First SearchHill ClimbingChoice C Which is the best way to go for Game playing problem?Linear Approach Heuristic ApproachRandom ApproachStratified ApproachChoice B
How do you represent “All dogs have tails”.۷x: dog(x)àhastail(x) ۷x: dog(x)àhastail(y)۷x: dog(y)àhastail(x)۷x: dog(x)àhasàtail(x) Choice A Which is not a property of representation of knowledge?Representational Verification AdequacyRepresentational AdequacyInferential AdequacyInferential AdequacyChoice A Which is not a type of First Order Logic (FOL) Sentence?Atomic Sentences Complex SentencesQuantified SentencesQuality SentencesChoice D A plan that describe how to take actions in levels of increasing refinement and specificity is
Problem-Solving Planning Hierarchical PlanInheritanceChoice C Partial order planning involves Searching over possible situationsSearching over the space of possible plansSearching the whole problem at onceSearching the best
Choice B Uncertainty arises in the wumpus world because the agent‟s sensors give onlyFull & Global information Partial &
Global
Partial &
local Full & local informationChoice C In an Unsupervised learning Specific output
values are not given
No specific Inputs are
Both
inputs Neither inputs nor outputs are given.Choice A Inductive learning involves finding a Consistent Inconsistent Regular Estimated Hypothesis.Choice A
If a hypothesis says it should be positive, but in fact it is negative, we call itConsistent Hypothesis
A false negative
A false
positive A specialized hypothesisChoice C Neural Networks are complex ---with many parameters.Linear Functions Non Linear Discrete Exponential FunctionsChoice B
SMALLTALK comes under __________________Object oriented programmingprocedural programmingLogical programmingImperative ProgrammingA LISP stands for ________________________ List Processing List procession List ProgrammingLinked programmingA Let g(x) ≡ x * x. h(x) ≡ 2 * x, i(x) ≡ x / 2. Then the construction is [g, h, i](10) = ?[100, 20, 5] [100, 10, 2] [100, 20, 1][100, 20, 2]A
Programming paradigm helps us in __________________ designfunctional object ProceduralProgramming languageD friend functions are called _________ With a reference of a objectWith a reference of a structure instanceNone of the optionsWith a reference of a classC calling a method from an object is often referred as____________OBJECT CREATION OBJECT INSTANTIATIONMESSAGE PASSINGMESSAGE RETRIVALC Interpretor is used to ___________________ Only compile Only for executionBoth for execution & compilationNone of the optionsC Static scoping is identified by _____________________Spatial Time ExecutionDebug A
Activation record of a program helps in___________________compilation execution identify errorNone of the optionsB
Local offset in activation record means___________________Used to identify a variable addressUsed to identify a function addressUsed to identify a object addressUsed to identify a pointer addressA Static depth of a function is identified by Calling sequence Compiling Nesting None of the optionsC
Valid strings for the Regular Expression (0 | 1)* 011 is
10101 100001
111011
111000 CEpsilon transitions are not permitted in NFA DFA NFA & None of the optionsB ________takes a string from a source code as
input and validates against _____ and answers
whether the input string is valid or not.
Token & Lexeme
Finite Automaton & Regular
Sentinel
& Token Input string & tokenB Platform independence is supported in java by Byte code Virtual A & B only A C
The screen must be refreshed at the rate of ____ frames per second.
40
50
60
70
60
2D scaling equation is
x‟ = x*sx, y‟ = y * syx‟ = x + sx, y‟ = y + sy
x‟ = x – sx, y‟ = y – sy
x‟ = x * sy, y‟ = y * sx
x‟ = x*sx, y‟ = y * sy
The basic 2D transformations are
Scaling, Reflection, Shearing
Scaling, Rotation, Reflection
Scaling, Rotation, Translation
Scaling, Translation, Shearing
Scaling, Rotation, Translation
In which transformation the shape and size of the object is changed
Translation
Rotation
Scaling ShearingShearing
VIT
U N I V E R S I T Y
(Estd. u/s 3 of UGC Act 1956)
Vellore - 632 014, Tamil Nadu, India
School of Computing Science & Engineering
Stereoscopic viewing is also a component in ___________ system
Display
Audio
Virtual-reality
None of the above
Virtual-Reality
Space ball provides _____ degree of freedom Two
Three
Four
Six
Six
In which transformation object is moved in circular path
Translation
Rotation
Shearing Scaling rotation
Z-buffer method is also known as
Back-Face Detection Scan -Line Method
Depth-Sorting Method
Depth-Buffer Method
Depth-Buffer method
Which method use linked list to represent surfaces?
Painter‟s algorithm A-Buffer Method
Z-Buffer Method
Depth-Sorting Method
A-Buffer Method
Which Method is called as hidden-line detection methods.
Ray casting method
Scan line method
BSP-tree Method
None of the above
None of the above
The two types of parallel Projections are
Axonometric and Isometric Projections
Orthographic and Oblique Projections
Cabinet and Cavalier Projections
Elevation and Plain view
Orthographic and Oblique Projections
_________ method for solving the hidden-surface problem is often referred to as Painter‟s Algorithm .
Back-Face Detection Scan -Line Method
Depth-Sorting Method
Depth-Buffer Method
Depth-Sorting Method
In the Area subdivision method given one square is divided into ______ equal squares
Four
Eight
Twelve
Sixteen Four
A fast and simple method for rendering an object with polygon surfaces is ______________
Constant-intensity shading
Gouraud Shading
Phong Shading
Fast Phong Shading
Constant-intensity shading
Reflection and refraction rays are referred to as __________ rays.
Reflected
Refracted
Secondary
Binary Secondary
If no surface are intersected by a pixel ray, the ray-tracing tree is _________
Empty
Full
binary tree
Complete binary tree
Empty
The artist adds a black pigment to produce different ________ of that color.
Shades
tints
Tones
model
Shades
Blue and green combined you will get _______ color.
Cyan
Magenta
Yellow White
Cyan
The combination of light reflections from various surfaces to produce a uniform illumination called the ________________
Diffuse reflection
Specular reflection
Ambient Light
Light sources
Ambient Light
In fast phong shading the Taylor-series expansion and retain terms upto ______ degree in x and y.
First
Second
Third
Fourth Second
The environment map is defined over the surface of an enclosing universe
environment array
enclosing universe
reflection mapping
environment mapping
enclosing universe
Blue and red combined you will get ________ color.
Cyan
Magenta
Yellow White
Magenta
1) Multi-core processors plays a central role in
driving important advancements in PC Security
Resource allocation Digital media Locator sychroni A 2) Multicore design offers enhancement in _________________System resources System tools System performanceSystem attributesC 3) A multi-core processor implements
_________________in a single physical multithreading
multiprocessin g multipro grammin multitas king B
4) __________________ is the term which is used generally to refer multi-core
microprocessors that are manufactured on the Embeded systems
Digital signal processors System- on-a-chip Multi-chip module D 5) When it is not feasible to construct a
System-on-a-Chip for a particular application Multi chip
System in Package Package on Micro chip B
6) Multi-core processor is finding increasing deployment in __________________
Artifical intelligent
devices Page mapping
Packet switchin
Mmemo
ry A
7) The abstraction provided by
________________ to each virtual machine
running over it is that of a 100% dedicated CPU Instruction set
Physical memory Virtualiza tion Indirecti on layer C 8) Embedded virtualization also makes possible
_______________ and the ability to enable
legacy software to run in a multicore operation Direct addressing Segmentation
Addressi ng mapping Secure partitioni ng D 9) In multiprocessor machines,
__________________ are an efficient way for
application developers to utilize the parallelism Paging
Multiple threads Virtual memory Job scheduli ng B
10) The kernel is aware of each
______________ as a scheduled entity and it Thread Data flow
Fuction extensio
Interfac
e A
11) ____________ should be optimized for
tightly coupled operation of multiple control flows Thread Management Harmonization
Mutual exclusio
Kernel threads C 12) When the program requests a block of
memory, ____________must allocate that block
out of the larger blocks it has received from the Process manager
Program manager Kernal manager Memory manage r D
13) The additional time taken by the memory
manager while the program is running is to be Memory Overhead
CPU overhead
Process
14) Many programs give up memory, but attempt to access it later and crash or behave
randomly. This condition is known External fragmentationMemory leak Premature freePoor locality of referenceC 15) ____________ has become the standard
means of reasoning about the correctness of Linearizability Flexibility
Reusabil
ity ScalabilityA
The data rate of a PCM-coded stereo-audio signal with a sampling rate of 44.1 KHz and sampling size of 8 bits.
176,400 bytes/sec
88, 200 bytes/sec
715600 bits/sec
70050 bits/ sec
BMPEG compression method is
Weakly regular data stream
Irregular data stream
Strongly regular data stream
None of the above
AIn a CDROM the sector address is stored in
PCA Lead in PMA Lead out CA data stream that can be found in cooperative application with shared windows
Strongly periodic data stream
Weakly periodic data stream
aperiodic data stream
None of the above
C--- marks the variants of a phone
Fundamental frequency
morph
vowels
allophones
DIn a CDROM the 8-bit data is converted to
12-bit modulations 14-bit modulations16-bit modulations24-bit modulationsBIn JPEG compression AC coefficients are encoded by
AC-AC-1
Quantization matrix
Entropy encoding
Zigzag ordering
DFor each subband in audio encoding the noise level is calculated using
FFT
zigzag orderingPsychoacoustic model
PCM
C--- compression is specifically designed for video telecommunication applications
MPEG
JPEG
DVI
H.261
DMPEG supports only interleaved video all kinds of videonon interlaced videonone of the aboveC
... aborts all task that cannot meet their deadline anymore
EDF
RM
Pre-emptive non pre-emptiveA
--- checks whether the request can be guaranteed or not
Requestor
Resource manager
Resource reservation
Resource scheduling
BTextural and Numerical content is which type of
datatype
Raw data type
Registered data type
Descripti
ve data none of the aboveC
---describes all operations allowed on the document
Manipulation modelRepresentatio n model
Presenta
tion none of the aboveA
The position of one object may influence the motion of another in
Full Explicit control
Procedural Control
Constraint based systems
Tracking live action
BAssembly language
uses alphabetic codes in place of binary numbers used in machine language
is the easiest language to write programs
need not be translated into machine language
A___register keeps track of the instructions stored in program stored in memory
AR (Address Register)
XR (Index Register)
PC (Program Counter)
AC (Accumulator)
CVon Neumann architecture is
SISD
SIMD
MIMD MISD
AIn Assembly language programming, minimum number of operands required for an instruction is/are
Zero.
One.
Two.
Both (B) & (C).
AIn which addressing mode the operand is given explicitly in the instruction
Absolute.
Immediate.
Indirect. Direct.
BA stack organized computer has
Three-address Instruction
Three-address Instruction
Three-address Instruction
Zero-address Instruction.
DA data movement instruction will
modify the status register
modify the stack pointer
. transfer data from one location to another
modify the program counter
DWhich register example hold the instruction itself?
. Program CounterInstruction Register
Control Unit ALU BWhat are important aspects of the von Neumann architecture?
Instruction are data
memory for programs and dataInventted in GermanyUses a program counterBWhich of the following would cause quickest acess
direct access from a magnetic tape
direct access from a hard disk
direct access from a floppy disk
direct access from a cassette tape
BThe Device which converts instructions into the binary form that is understood by the computer and supply to the computer is known as
---Input
output automati
c memory A
Laptop PCs are also known as __________Computers
Mainframe
Super Notebook personal C
daisy wheel is a type of --- ? printer storage pointing A
Data transfer to and from peripherals may be
handed in any one following three possible Programmed initiated
Interrupt-initiated I/O Direct memory All the above D
The DMA transfer takes place between
magnetic disk and memory is takes place in any burst transfer cycle stealing program initiated I/O Both A
and B D
1. Represent the decimal number 937.25 to BCD form
a. 100000110111.101b. 100100010111.011
c. 100100110110.00110101
d. 100100110111.00100101D2. Write the next four numbers in the hex counting sequence E9A,E9B,E9C,E9D, _ , _ , _,
a) E9E , E9F, EA0 , EA1b) E9E , E9F, E100, E101
c) E9E , E9F, E00, E01d) None of the above
A 3. Apply duality principle for the given equation ab‟+c+0.d‟(1+e)a) (a+b‟)c(1+d‟+0.e)b) (a+b)‟c(0+d‟+1.e)
c) (ab‟)c(1+d‟+1.e)d) (ab‟)c(1+d‟+0.e)A5. For the given message 111100 identify the Odd and even paritya) 1 & 0 b) 1 & 1 c) 0 & 0 d) 0 & 1 A
6. A Magnitude Comparator is designed to compare the magnitude of two 2-bit numbers, A (A1A0) and B (B1B0). The output of circuit is F
(A>B). What is the SOP form of F?
a. A1B1’ + A1A0B1B0’ + A1’A0B1’B0’
b. A1B1’ + A1A0B0’ + A0B1’B0’
c. A1B1’ + A1B1B0’ + A0B1’B0’
d. A1B1’ + A1A0B0’+ A1’A0B1’
A7. To design the full adder using multiplexer, determine the number of input
lines, size of Decoder and number of multiplexers used a.2, 2x4, 1 b. 4, 2x4, 2 c. 3, 3x8, 2d. 3, 2x4, 1B
8. The circuit of 3 bit odd parity generator has a combination of
a. 2 x-or gates b. X-or followed by x-norc. X-nor followed by x-ord. 2 x-nor gatesB/C9. PLA is used to implement the Boolean function in the form ofa. Standard form b. Canonical formc. Only sopd. Only sum of mintermsA 10.How many links will be broken at input of
AND gates to implement a half adder using PLA a. 2,2,2 b. 3,3,3 c. 1,2,3 d. 2,2,1 A 11 Given the function G(A,B,C) = Σ (1,3) +
d(4,5,6,7). What is the minimum number of gate
that can be used to implement this function? a.0 b.1 c.2 d. 3, 2x4, 1A 12. The content of the 4-bit shift register is
initially 1101. The register is shifted six times to
the right, with the serial input being 101101. A. 1011 B. 1101 C. 1110 D. 0111 A 13 . A comparison between ring and Johnson
counters indicates that:
a. A ring counter has fewer flip-flops but requires more b. A ring counter has an inverted c. A Johnson counter d. A Johnso n D
14. Circuit output functions and flip-flop input functions can be obtained from
a. Excitation and output tables
b. State and excitation
c. State
and d. State and output tablesA 15.5. On the fifth clock pulse, a 4-bit Johnson
sequence is Q0 = 0, Q1 = 1, Q2 = 1, and Q3 = 1. On the sixth clock pulse, the sequence is
a. Q0 = 1, Q1 = 0, Q2 = 0, Q3 = 0 b. Q0 = 1, Q1 = 1, Q2 = 1, Q3 = 0 c. Q0 = 0, Q1 = 0, Q2 = d. Q0 = 0, Q1 = 0, Q2 = 0, Q3 = 1C Interval between the time of submission and
completion of the job is called Waiting time
Turnaround time Through put Respon se time Turnar ound ___________ is a technique of improving the
priority of process waiting in Queue for CPU Starvation Revocation Ageing
Relocati on
Agein g A program in execution is called Procedure Instruction Process Functio Proce In which of the following page replacement
policies Balady‟s anomaly occurs? LRU NRU LFU FIFO FIFO
The total time to prepare a disk drive
mechanism for a block of data to be read from is latency
latency plus transmission latency plus latency plus latenc y plus A set of techniques that allow to execute a
program which is not entirely in memory is called demand paging
auxiliary memory virtual memory second ary virtual memo Jobs which are admitted to the system for long-term scheduling short-term medium- queuing long-Locality of reference implies that the page
reference being made by a process
will always be to one of the pages existing in memory.
is likely to be the one of the pages used in will always be to the will always lead to is likely to be ___________ is a technique of temporarily
removing inactive programs from the memory of Swapping Spooling
Semaph ore Schedul er Swap ping
A critical section is a program segment
which should run in a certain specified amount of time. which avoids deadlocks. where shared resource which must be enclose where share d Which scheduling policy is most suitable for a
time-shared operating system Elevator.
Shortest-job First. First- Come- Round-Robin. Round-Robin. Program „preemption‟ is forced de allocation of the CPU from a program which is executing on the release of CPU by the program after completing its forced allotment of CPU by a a program terminat ing itself forced de allocat ion of
The term „page traffic‟ describes
number of pages in memory at a given instant number of papers required to be the moveme nt of number of pages the move ment
The “turn-around” time of a user job is the
time since its submission to the time its results become available. total time taken to execute the job. time duration for which the CPU time taken for the job to total time taken to Memory utilization factor shall be computed as
follows memory in use/allocated memory in use/total memory allocated memory committ memo ry in
What would be the output of the following:
<script type="text/javascript">
x=3+'2';
y=4+"5";
document.write(x + y);
</script>
15
3245
77 None
3245
<script type="text/javascript"
language="javascript">
var a = "India";
var result = a.split("");
document.write(result);
</script>
India
I n d i a
I,n,d,i,a None
I,n,d,i,a
What happens to the following code:
<html>
<script language="javascript">
function f1()
{
document.write("In f1();");
function f2()
{
document.write("In f2();");
}
}
</script>
<input type="button" value= "click"
onClick="f1();">
</html>
no output
In f1();
In f1();Inf2();
None
In f1();
<html>
<script language="javascript">
function x()
{
var s= "Good 100%";
var pattern = /\D/g;
var output= s.match(pattern);
document.write(output);
}
</script>
<input type="button" value= "click"
onClick="x();">
<script Xlanguage="javascript">
var a="VIT Vellore";
alert(a.charAt(a.length()-1));
</script>
e
erroe
r
None
error
Syntax for creating a RegExp object:
(a). var txt=new RegExp(pattern,attributes);
(b). var txt=/pattern/attributes;
Which of the above mentioned syntax will
correct?
a) only
(b) only
Both (a) and (b)
None
Both (a) and (b)
<script language="javascript">
var arr= new Array();
arr[0] = "Javascript";
arr[1]="supports"
arr[2]="object oriented"
arr[3] = "paradigm";
document.write(arr[0,1,2,3]);
</script>
What is the output?
Error
Javascript
Javascript supports object oriented paradigm
paradigmparadigm
<script language="javascript">
function demo()
{
document.write(2+5+'8');
}
</script>
<input type="button" value= "click"
onClick="demo();">
What will be the result?
15
78
258 Error
78
How to assign a function to a variable with
the JavaScript Function constructor ?
a) var f=Function("x","y","return x+y");
b) var f=Function(x,y){ return x+y;}
c) var f= new Function("x", "y", "return x +
y");
a) only
(c) only
Both (a) and (c)
None
None
In JavaScript, Window.prompt() method
return true or false value ?
TRUE
FALSE
####
The following statement does not
declares dynamic array in VBscript.
Dim Names()
TRUE
FALSE
####
In Vbscript, one can invoke the function
with and without the______________
keyword
call
VBScript does not support early binding – True/FalseTRUE
FALSE
####
______________Statement forces explicit
What's the default setting for the expires
attribute of the document.cookie property?
The duration of the
browser session.
The duration
the current
document
stays loaded
Twenty-four
hours
from
the time There is no default setting
The
durat
ion of
the
brow
A language is represented by a regular expression (a)*(a + ba). Which of the following string does not belong to the regular set represented by the above expression.
aaa
aba
abab
aa
C
A language L is accepted by a FSA if it is
CFL
CSL
RecursiveRegular
D
To generate a Counter Automaton we need……
Need multi tape TM Need Multi head TM
Need Multi tape and multi head TM
Single Tape and Head TM
D
Which of the following statements is false? The halting problem for Turing machines is undecidable
Determining whether a context-free grammar is ambiguous is undecidable
Given two arbitrary context-free grammar, G1 and G2, it is undecidable with L(G1) = L(G2)
Given two regular grammars G1 and G2, it is undecidable whether L(G1) = L(G2)
B
Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following is TRUE?
P3 is decidable if P1 is reducible to P3
P3 is undecidable if P3 is reducible to P2
P3 is undecidable if P2 is reducible to P3
P3 is decidable if P3 is reducible to P2‟s complement
A
Consider three problems P1, P2 and P3. It is known that P1 has polynomial time solution and P2 is NP-complete and P3 is in NP. Which one of the following is true?
P3 has polynomial
time solution if P1
is polynomial time
reducible to P3
P3 is NP
complete if
P3 is
polynomial
P3 is
NP
complet
e if P2
P3 has
polyno
mial
time
C
Which of the following statement is false?
Divide and Conquer is independent
Dynamic programming is dependent
Dynamic programming is independent
None of the above
B
Aggregate analysis determines the……… T(n) on the total cost of a sequence of n operations.
Lower bound
upper bound Middle bound
None.
B
Dynamic programming divides problems into a number of conflicting objective functions
decision stages.
unrelated constraints.
policies. none of the above
A
The ________ cipher reorders the plaintext characters to create a ciphertext.
Substitution
Transposition either (a) or (b)
neither (a) nor (b)
B
Jarvi's March algorithm uses _________ approach
Rational Sweep
Divide and Conquer
Top downBottom UpA
The first step in developing a parallel algorithm is to decompose the problem into tasks that can be executed………
serially
ConsecutivelyConcurrently
None
C
Achieving mutual exclusion,
is only required in distributed systems, and also for single-processor systems;
enhance the performance;
is necessary for a process to read or write certain shared data;
none of the above.
C
In the analysis of Randomized Quick sort, what is Pr(Xij = 1)? Assume that i ≠ j
Pr(Xij = 1) = 1/(|j − i| + 1)
Pr(Xij = 1) = 1/(j + i)
Pr(Xij = 1) = 2/(|j − i| + 1)
Pr(Xij = 1) = 2/(j + i)
C
Minimum-path search is a(n) _____ problem Non optimization
optimization
behavior-of-program;
Interactive computation
B
Which of the following data type can be
used for storing a floating
int
long int
double
unsigned char
Cpoint constant?
What is the result of running the following
code snippet?float result; result = 5/2;
printf("%.1f",result);
2 2.5 0 BOutput of running the following code
snippet is int i;
for ( i = 0; i < 3; i++ )
{
if(i == 2)
{
printf("%d\t",i);
}
}
0 1
2 3
0 1 22
none CWhat is the result of running the following code snippet if(0)
printf("The Sun rises in the East"); else
printf("The Sun rises in the West");
The Sun rises in the East
The Sun rises in the West
Compilation Error
none B____________ is a symbolic language
Assembly language COBOL
FORTRAN
BASIC A__________ in machine language tells the
computer what function to perform
OpcodeOperationID
both none AThe conversion specifier for printing an
integer in hexadecimal number using printf
is
%x
%d %ld %hx AThe following C statement causes an infinite loop (true/false):while (1);
TRUE FALSE AOutput of following statement is:
#define NUM 5
int main()
{
NUM++;
printf("%d", NUM);
return 0;
Output of the following statement is
int i = 5;
if(i = 5)
{
puts("Structured programming language");
}
else
{
puts("Object oriented programming language");
}
What is the value of variable „i‟ after running the following statements?
int main( ){ i = 10;
i = i / 2;
i = i % 2; return 0}
int testarray[3][2][2] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
3 5 7 11 DWhat value does testarray[2][1][0] in the sample code above contain?
int a=10,b;
b=a++ + ++a;
printf(“%d,%d,%d,%d”,b,a++,a,++a);
what will be the output when following code is executed
. void Funct(int x)
1,2,3,4,5,5 4,3,2,1,0,0 0,0,1,2,3,4 5,4,3,2, 1,0 C void *ptr; mystruct myArray[10]; ptr=myArray;Which of the following is the correct way to increment the variable "ptr"?
ptr=ptr+sizeof(mystru ct) ptr+sizeo f(myArra y) Compilat ion error Compilat
ion error none C
5 6 D Structured programming language 0 22,10,11,13 12,10,11,13 Object Oriented Programming 1 2 ptr+(int)ptr none C 2.5 B ptr+sizeof(ptr)A 12,11,12 ,11 22,13,13,13,13
{if(x>0)
Funct(--x);
printf(“%d”,x);
}
int main()
{
Funct(5);
return 0;}
. How is a variable accessed from another file?
The global variable
is referenced via
the extern specifier
The global
variable is
referenced
via the auto
The
global
variable
is
The
global
variabl
e is
AWhich of the statement is false with respect to Virtual memory and Cache?
The Size of processor address determines the size of Virtual memory
Virtual memory replacement is controlled by OS
Virtual memory can be classified as pages and segmentsReplacement on cache miss controlled by OS
DThe capacity of a memory is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of 4K*16?
10 address,16 data lines
11 address,8 data lines
12 address ,16 data lines
12 address ,12 data lines
CWhich of the following is true?
Unless enabled, a CPU will not be able to process interrupts
Loop Instructions cannot be interrupted till they complete
A processor check for interrupts before they executing a new instruction
Only level triggered interrupts are possible on microprocessors
AWhich of the following is not a form of memory
Instruction cache
Instruction register
Instruction Opcode
Translation look aside buffer
C---Access method, Cylce time is same for all blocks of memory.
Random Access Sequential Access
Direct Access
Semi Random Access
AAssume Word 20 contains 40
Word 30 contains 50
Word 40 contains 60
Word 50 contains 70
Which of the following instructions does not, Load 60 into the Accumulator?
Load immediate 60 Load Direct 30
Load indirect 20
Both A) & C)
BThe common fields found in instruction formats are:
opcode field, address field, mode field
opcode field, operand field, address field, mode field,
opcode field, address field, next address field, mode field.
opcode field, address field1, address field1, mode field,
AWhat is the range of numbers for n-bits if negative numbers are represented in two's complement format?
(-2n – 1 to 2n – 1) (-2n-1 to 2n-1-1)(0 to 2n-1)(-2n to 2n-1-1)
BIf a number has k-bits(k is even), how many bits will its square-root have?
K-1
K/2
K
k-2
BFloating point numbers are typically packet in to a computer datum as the sign bit, the exponent field, and the significand (mantissa) , from left to right. Specify the the fields IEEE double formats.
1,8,23
1,11,52
1,5,10 1,5,112
BWhat is the access type of cache memories?
Associative
Direct
RandomSequential
ACycle Stealing is used in
Interrupt based data
transfer
DMA based data transfer
PolledData transfer rate for Random access Memory is
Access time + minimum time between two consequetive access operation
TN=TA+N/R
1/cycle time
access time + cycle time
B(11100110)2
(10011000)2
(100110
00)2
(01100110)2
AIf a register containing data (11001100)2 is subjected to arithmetic shift right operation, then the content of the register after one arithmetic shift right shall be
PAL circuit consists of
Fixed OR and programmable AND
logic
Programmable OR and Fixed AND logic
FixedOR and
fixed
Programmable OR and Programmable AND logic
A the main difference between the variuos 802.11 standards is thedata transfer rate maximum allowable cable lengthsimplicity of installationcollision detection rateAwhat is the default subnet mask for a class C network?127.0.0.0 255.0.0.0 255.255.0.0255.255.255.0D
when you ping the loopback address, a packet is sent wher?on the network down through the layers of the IP architecture and then up the layres againacross the wirethrough the loopback dongleB In CRC there is no error if the remainder at the receiver is ___equal to the remainder at the senderzero non zero the quotient at the senderB
what type of network device allows you to share your connection to the internet with other computer in your home?ethernet card NIC router Cat5 C Frequency of failure and network recovery time after a failure are measures of the ___ of a networkperformance reliability security feasibilityB
The Hamming distance between 100 and 001 is 0 1 2 3 C
In CSMA, the vulnerable period is equal to
1 frame transmission time
one way propagation
2 frame
transmis round trip timeB
How long is an IPv6 address? 32 bits 128 bytes 64 bits 128 bits D
which protocol does ping use? TCP ARP ICMP BootP C
What does router do in a network?
forwards a packet to all outgoing links
forwards a packet to the next free
determin es on
which frowards a packet to all outgoing links except the orginated linkC Linear topology is also called? Star topology Bus topology Ring Mesh topologyB
A logical network that consisits of two or more Networking Internetworkin LAN WAN B UDP has which of the following characteristics?
Three way handshake for
connection state at the
regulate
d send checksum for error detectionD which of the following is not provided by TCP? reliable, in order data flow control congesti minimum bandwidth guarnteesD
Every node has a point to point connection to every other node in the network
Bus
Star
Mesh
Ring
CWhich of the following is the functionality of Physical Layer
Type of Encoding
Encryption
Mail Services
Logical address
AWhich multiplexing method is common for multiplexing optical signals to allow the multiplex- ing of signals with a very high frequency
FDM TDM WDM FHSS CA need for end-to-end addressing during the setup and teardown phases to make the corresponding entry in the switching table
Datagram
Vitual Circuit Ciruit Switching
ATM
BIt is the number of differences between correspond bits between two words
CRC
LRC
Checksum value
Hamming distance
DCharacter-oriented protocols use a method to be able to carry an 8-bit pattern that is same as the flag
Byte-Stuffing
Bit - Stuffing Flow Control
Error Control
AA random access method, nwhere no station is superior to another station and none is assigned the control over another
Aloha
Reservation Token Passing
Channelization
AA device which can raise bandwidth and can seperate collision domain
Router
Gateway
Brouter Bridge
DIn UNI total length of VPI + VCI is
24 bits
22 bits
20 bits
26 bits
AWhat type of address is this 127.240.103.125 Class A
Class B
Class C Class D
AIPv6 normally provides a connectionless service, but it can provide a connection - oriented service if uses which of the following
Service Type
Checksum
Flow label
FragmentationOffset
CWhich of the following is a Intra Domain Protocol
OSPF
IGMP
RIP
TCP
CThose port numbers are only used for the duration of a single communication between client and server, so they are indeed short-lived
Ephernal Port Numbers
Fixed Port Numbers
Well Known Port Numbers
Dynamic Port Numbers
AWhich con-gestion control policies try to alleviate the effects of congestion
Open Loop Congestion Control
Closed Loop Congestion Control
Forward Explicit Congestion Control
Backward Explicit Congestion Control
BWhich technology allows an organization to use the global Internet yet safely maintain private internal communication
Firewall
Kerbros
Vitual Private Network
Frame Relay
CA complete microcomputer system consists of microprocessor memory Peripheral equipmentAll of the aboveAll of the above Pipelining strategy is called implement instruction execution instruction prefetchinstruction decodinginstruction manipulationinstruction prefetch Interrupts which are initiated by an instruction are internal external hardware software software
A timing sharing system imply more than one processor in the systemmore than one processor in the systemmore than one memory in the systemNone of the abovemore than one processor in the system The performance of a processor can be measured usingClocks period Cycles per InstructionThroughputAll of the aboveAll of the above
Which of the following is not a state of the instruction cycleOperand address calculationData write backInstruction fetchInstruction fetchData write back Which of the following is a bus arbitration scheme?Round-robin First come first servePriority All of the aboveAll of the above When is a cache block is written into the main memoryEvery cycle Dirty bit is set Valid bit is not setNone of the aboveDirty bit is set Which of the following is a example for a communication I/O?Monitor Mouse Modem USB Modem Memory access in RISC architecture is limited to instructionsCALL and RET PUSH and POPSTA and LDAMOV and JMPSTA and LDA Redundancy is a built-in feature here Serial I/O tapes RAID Optical Magneti RAID
Microprocessor 8085 can address location upto 32K 128K 64K 1M 64K
A microporgram is sequencer perform the execute read and read and execute read RAID level 0 is primarily used in applications Cost is a priority Area is a Reliabilit All of Cost How often/how is data written into the ROM
Anytime/when required Before use – by During manufac All of the During manuf
int main()
{
int i;
int a[3]={1,2,3};
int *b[3]={&a[0],&a[1],&a[2]};
printf("%d",*b[1]);
}
a)address of a[1]
b)2
c)3
d)Compiler Error
b)2
#include<stdio.h>
#include<conio.h>
int main()
{
int sum = 0;
int i=1;
while(i <= 20)
{
if((i%2) == 1)
{
++i;
continue;
}
sum = sum + i;
++i;
}
printf("%d",sum);
getch();
return 0;
}
Sum of even numbers from 1 to 20
Sum of odd numbers from 1 to 20
Sum of first 20 natural numbers
Error
Sum of even numbers from 1 to 20
Initialization of the array int a[4]={2,1} will
assign
a) a[0]=2,a[1]=0,a[2]=2,a[3]=0
b) a[0]=2,a[1]=1,a[2]=0,a[3]=0,
c) a[0]=2,a[1]=1,a[2]=garbage,a[3]=garbage value
d) a[0]=2,a[1]=2,a[2]=2,a[3]=garbage value
b) a[0]=2,a[1]=1,a[2]=0,a[3]=0,
If S has got an ascii value 83 and s has an ascii
value 115. The strcmp function on these
two strings strcmp(“Sam”,”sam”) returns
There are two arrays int a[3]={1,2,3} and
b[3]={2,4,6}
What will be the output of the following
statement?
a) the values of array a get assigned to b
b) the values of array b get assigned to a
c) there is a compilation error
d) the values of a and b are swapped.
c) there is a compilation error
Which array technique the following program
represents if n is the size of the array
for(i=0;i<=n/2;i++)
{
t=a[i];
a[i]=a[n-i];
a[n-i]=t;
}
a) Array counting
b) Array order reversal
c) Finding the maximum number in a array
d) Array sorting
a) Array order reversal
What will be output of this program (the input
is - Computer Programming)?
#include<stdio.h>
#include<conio.h>
#include<string.h>
int main()
{
char name[20];
printf("Enter your name");
scanf("%s",name);
printf("%s",name);
getch();
}
a) compilation error b) computer programming
c) Computer
d) Programming
c) Computer
int main()
{
float a[]={1,2,3};
printf("%d",sizeof(a));
}
a)Compiler Error
b)12 Bytes
c)4
Bytes
d)Run Time Error
b)12
Bytes
int a=10;
printf("%d &i",a,10);
a)error
b)10
c)10 10
d)None
c)10
10
int a = 4, b = 7,c;
c = a = = b;
a)0
b)error
c)1
d)Garbage Value
a)0
void main()
{
printf("hello");
main();
}
What will be the output of the above code?
a)1
b)2
c)Infinite
number
of times
d)none of these
c)Infin
ite
numb
er of
times
int main()
{
int a = 2;
switch(a)
{
case 1:
printf("goodbye"); break;
case 2:
continue;
case 3:
printf("bye");
}
}
a)error
b)goodbye
c)bye
d)byegoodbye
a)erro
r
int i=1,k=i-- +2;
printf("%d",k);
a)Error
b)3
c)2
d)1
b)3
What will be the output of following
statements ?
a)88
b)18
c)29
d)19
d)19
int a=11,b=6,c=9,d,x;
d= (a >(x=(c>b?c:b))?a:x);
printf("%d",d);
what is the output of the above code?
a)11
b)6
c)9
d)error a)11
The _______ is the physical path over which a message travels.
Protocol
Medium
Signal
All the above
Medium
The information to be communicated in a data communications system is the _______.
Medium
Protocol
Message Transmission
Message
Frequency of failure and network recovery time after a failure are measures of the _______ of a network
Performance
Reliability
Security Feasibility
Reliability
An unauthorized user is a network _______ issue
Performance
Reliability
Security All the above
Security
Which topology requires a central controller or hub?
Mesh
Star
Bus
Ring
Star
Which topology requires a multipoint connection?
Mesh
Star
Bus
Ring
Bus
Communication between a computer and a keyboard involves ______________ transmission
simplex
half-duplex
full-duplex
automatic
Simplex
A television broadcast is an example of _______ transmission
simplex
half-duplex
full-duplex
automatic
Simplex
A _______ connection provides a dedicated link between two devices.
point-to-point
multipoint
primary secondary
point-to-point
In a _______ connection, more than two devices can share a single link
point-to-point
multipoint
primary secondary
Multipoint
In _______ transmission, the channel capacity is shared by both communicating devices at all times
simplex
half-duplex
full-duplex
half-simplex
full-duplex
In the original ARPANET, _______ were directly connected together
IMPs
host computersnetworksrouters IMPs
This was the first networ
CSNET
NSFNET
ANSNETARPA
NET
ARP
ANE
Which organization has authority over interstate and international commerce in the communications field?
ITU-T
IEEE
FCC
ISOC
FCC
_______ are special-interest groups that quickly test, evaluate, and standardize new technologies.
Forums
Regulatory agencies
Standards organizations
All of the above
Forums
The number of leaf nodes in a complete binary tree of depth d is
2d
2d–1+1
2d+1+1
2d +1
a
The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is
6
5
7
8
b
If there are 17 elements in an array, how many
maximum comparisons are required to search an
element using binary search?
5
4
3
2
a
A hash function f defined as f(key) = key mod
7, with linear probing, is used to insert the keys
37,38,72,48,98,11,56,into a table indexed from
0 to 6. 11 will be stored in the location
5
4
3
2
a
The result of evaluating the postfix expression
If h is any hashing function and is used to hash
n keys in to a table of size m, where n<=m, the
expected number of collisions involving a
particular key x is :
<1
<m
<n
<n/2
a
A graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are
>n
>n+1
>(n+1)/2 >n(n-1)/2
d
An algorithm is made up of two independent
time complexities f (n) and g (n). Then the
complexities of the algorithm is in the order of
f(n) x g(n)
Max (f(n),g(n))
Min (f(n),g(n))
f(n) + g(n)
b
A machine took 200 sec to sort 200 names,
using bubble sort. In 800secs, it can
approximately sort how many names. [Hint: No.
of comparisons bubble sort makes for n items]
800 aprox
600 aprox
500
aprox 400 aprox
d
The average number of comparisons performed by the merge sort algorithm,in merging two sorted lists of length 2 is
8/3
8/7
11/7
11/6
a
There are four different algorithms A1,A2,A3
and A4 to solve a given problem with the order
log(n), loglog(n), nlog(n) ,n/log(n) respectively.
Which is the best algorithm?
A1
A2
A3
A4
b
Which of the following are not a valid queue
application
Printing jobs in
printer
Line at Ticket
counter
Evaluati
ng Math
Expressi
Telephone call d
What is the minimum number of queues needed
to implement a priority queue
1
2
3
4
b
If node having 2 children is deleted from a
binary tree, it is replaced by its
Inorder predecessor
preorder
predecessor
post
predeces
sor
Inorder
success
or
d
If a node in BST has two children, then Inorder
predecessor has
no left child
no right child
two
children no child
b
The time required to delete a node x from
doubly liked list having n node is
O(n)
O(log n)
O(1)
O(n log
n)
c
In the relational modes, cardinality is termed as:
Number of tuples.
Number of attributes.
Number of tables.
Number of constraints.
A
Relational calculus is a
Procedural language.Non- Procedural language.
Data definition language.
High level language.
B
In the architecture of a database system external level is the
physical level.
logical level. conceptual level
view level.D
An entity set that does not have sufficient attributes to form a primary key is a
strong entity set.
weak entity set.
simple entity set.
primary entity set.
B
In tuple relational calculus P1 ®P2 is equivalent to
¬P1 Ú P2
P1 Ú P2
P1 Ù P2 P1 Ù¬P2 A
The database environment has all of the following components except:
users.
separate files. database.database administrator.
A
A subschema expresses
the logical view.
the physical view.
the external view.
all of the above.
C
SET concept is used in :
Network Model
Hierarchical Model
Relational Model
None of these
A
Relational Algebra is
Data Definition Language
Meta Language
Procedural query Language
None of the above
C
_______ produces the relation that has attributes of R1 and R2
Cartesian product
Difference
Intersection
Product
A
DBMS helps achieve
Data independence
Centralized
control of
Neither
(A) nor both (A) and (B)
D
In a relation
Ordering of rows is
immaterial
No two rows
are identical
(A) and
(B) both
are true None of these.
C
Which of the following operations need the
participating relations to be union
compatible?
UNION
INTERSEC
TION
DIFFE
RENCE All of the above
D
Which of the following is an advantage of
view?
Data security
Derived
columns
Hiding
of
comple All of the above
D
The users who use easy-to-use menu are
called
Sophisticated end
users.
Naïve users.
Stand-alone
Casual end users.
B
ODBC stands for
Object Database Connectivity
Oral Database Connectivity
Oracle Database Connectivity
Open Database Connectivity
DAn entity set that does not have sufficient attributes to form a primary key is a
strong entity set
weak entity setsimple entity set
primary entity set
BIn an E-R diagram attributes are represented by
rectangle
square
ellipse
triangle
CIn case of entity integrity, the primary key may be
not Null
Null
both Null & not Null
any value
AIn tuple relational calculus P 1 P2 is equivalent to
P1 v P 2
P1 v P 2
P1^ P 2
P1 ^ P 2 AA logical schema
is the entire databaseis a standard way of organizing information into accessible parts
describes how data is actually stored on disk
both (A) and (C)
AThe method in which records are physically stored in a specified order according to a key field in each record is
hash
direct
sequentialall of the above
AThe statement in SQL which allows to change the definition of a table is
Alter
Update
Create
select
AWhich are the two ways in which entities can participate in a relationship?
Passive and active
Total and partial
Simple and Complex
All of the above
BUsing Relational Algebra the query that finds customers, who have a balance of over 1000 is
P Customer_name( s balance >1000(Deposit))
s Customer_name( P balance >1000(Deposit))
P Customer_name( s balance >1000(Borrow))
s Customer_name( P balance >1000(Borrow))
A_________ data type can store unstructured data
RAW
CHAR
NUMERIC
VARCHARAA table joined with itself is called
Join
Self Join
Outer Join
Equi Join
B_________ is a virtual table that draws its data from the result of an SQL SELECT statement
View
Synonym
SequenceTransaction
AA B-tree of order m has maximum of _____________ children
m
m+1
m-1
m/2
ATo delete a particular column in a relation the command used is:
UPDATE
DROP
ALTER DELETE
CThe highest level in the hierarchy of data
organization is called
data bank
data base
data file data record
data file
An audit trail
is used to make backup copies
can be used to restore lost information
is the recorded history of operations performed on a file
None
can be used to restore lost information
Which of the following is not a relational
database
Dbase IV
4th DimensionFoxPro Reflex Reflex
A top-to-bottom relationship among the items in a database is established by a
hierarchical schema network schema
relational schema
All the above
hierarchical schema
Data security threats include
hardware failure
privacy invasion
fraudulent manipulation of data
All of the above
privacy invasion
A command that lets you change one or more fields in a record is
insert
modify
lookup
none of above
modify
This is an open standard application programming interface (API) for accessing a database
Universal Data Access
Open Database Connectivity
Topic Map Query Language
Open Data-Link Interface
Open Database Connectivity
This is a standard interactive and programming language for getting information from and updating a database
dynamic data exchange
Structured Query Language
ASCII
Erlang programming language
Structured Query Language
Report generators are used to
store data input by a user
retrieve information from files
answer queries
both b and c
answer queries
Batch processing is appropriate if
large computer system is available
only a small computer system is available
only a few transactions are involved
none of the above
none of the above
Which is the make given to the database management system which is able to handle full text data, image data, audio and video?
full media
graphics mediamultimedia
hypertext
multimedia
A file produced by a spreadsheet
is generally stored on disk in an ASCII text fromat
can be used as is by the DBMS
both a and b
none of the above
is generally stored on disk in an ASCII text fromat
Primitive operations common to all record management system include
sort
look-up all of above
look-up
What process does the technical term normalization describe?
Creating tables from an ER diagram
Creating larger tables from smaller tables
Expressing a database's design in terms of set theory
Breaking larger tables into smaller tables
Breaking larger tables into smaller tables
To what does the term normal form refer?
A stage in a process that breaks up large tables into smaller, more efficient tables
A standard database included with most RDBMSs
A standard table included with most RDBMSs
A methodology for representing tables in an ER diagram
A stage in a process that breaks up large tables into smaller, more efficient tables
Given an unknown base Y, and given that
for a particular number X, (X)Y = (Z)10,
what is (100000 * X)Y in base 10? ( “*” is
the multiply operation)
Z * Y5
100000Z
log-Y10
0000 *
Z
Not
enough
inform
ation to
AIn a 4-variable Boolean function, what are
the minterms that differ from m10 by one
literal?
m0, m5, m7, m15
m4, m8, m6,
m14
m0, m2,
m8,
m11
m2,
m8,
m11,
DA certain 5-bit self-complementary code is
used to represent the 10 decimal digits 0
through 9. Given that (246)10 is
represented as 00010 00100 00110 in this
code, what is the representation for
00110 00100
00010
00011 00111
00101
11101
11011
11001
11001
11101
11011
DIf one input to the circuit consisting of a
cascade of 20 EX-OR is X and the other is 1
, then what is the final EX-OR gate Output.
0 1 X CA certain four-variable Boolean function
contains 9 minterms. At least how many
product terms and at most how many
product terms are there in the minimal
sum-of-products expression for this function?
At least zero and at
most 9.
At least 1
and at most
9.
At least
2 and at
most 8.
At least
2 and
at most
9.
CWrite the next four numbers in the hex
counting sequence E9A,E9B,E9C,E9D, _ , _
, _,
E9E , E9F, EA0 ,
EA1
E9E , E9F,
E100, E101
E9E ,
E9F,
E00,
None
of the
above
AFor Boolean algebra Associativity is a:
Theorem
Postulate
Express
ion
Identity
AIn the expression A(A+B) , by writing the
first term A as A+0, the expression is best
simplified as
A+AB AB A A+B CWhich statement is true:
All canonical form
are standard form
All standard
form are
canonical
forms
Standar
d form
must
consists
Canoni
cal
form
can
AWhat is x if (1A5)16 = (1141)x?
5 7 8 9 B=
A (x-or) B (x-nor) C
A (x-nor) B (x- A (x-nor) All the
BTo implement a 4 bit binary to 5 bit BCD
converter using ROM, the size of ROM, decoder
inside ROM and number of OR gates will be
16x5, 1x5, 4
16x5, 4x16, 5
32x4,
5x32, 4
32x4,
1x4, 5
BHow many 4-bit parallel adders would be
required to add two binary numbers each
1 2 3 4 CHow many possible state assignments would be
there for 5 states?
38C3
8P3 8P5 DIn the sequential circuit, the output is
Independent on the
clock pulse
Depend
ent of
the +ve
Depend
ent of
the –ve
AThe image formation process can be summarized as image=noise*object function+psf image=psf*im age Image=p sf*object None of the C
The key problem in which 99% of cases where image processing techniques either fail or
further image processing is required to achieve noise sampling
quantizat
ion metrics A
An alternative edge enhancement filter to the
Laplacian-based approaches is the median filter
smoothening filter unsharp mask band pass C Fourier transform operates on the frequency space real space fourier time A The process of breaking down a periodic signal
as a sum of sine and cosine function is called fourier breakage
fourier partition fourier division fourier decomp D PSNR refers to Progressive signal to noise ratio Peak signal to noise ratio Perceptu al signal None of the B
A key assumption in deriving the least-squares
estimators given by equation g(x,y)-f(x,y)**h(x,y)=0
g(x,y)+f(x,y)** h(x,y)=0 g(x,y)+f( x,y)*h(x, g(x,y)-f(x,y)*h( A A rectangular array of pixels containing the
values either 1 or 0 is called as pixel structures
structuring element neighbo urhood none of the B
The positions where a certain pattern occurs in
the input image is indicated by the laplace transform
wavlet transform fourier transfor hit-or-miss D The representation of a 2-D boundary as a 1-D signature transformation sampling quantiza A measures the attempt to capture characteristics
of the intensity fluctuations between groups of
neighbouring pixels, sometimes to which the feature roughness texture
none of the above C
An approach to segmentation in which pixels are
grouped into larger regions based on their region segmentation region splitting
region transfor
region growing D A process in which an expert human user
assigns examples to specific classes based on class labelling
supervised labelling unsuper vised object labelling A An instance of something serving as a typical
example or standard for other things of the classifier pixel
prototyp
e object C
A conceptually simple structure for representing
imagesat more tha one resolution is the image cube
image pyramid image cone none of the C
Data by itself is not useful unless It is massive It is processed to obtain informationIt is collected from diverse sourcesIt is properly statedB
In a hospital information system the following type of information is tacticalOpening a new children‟s‟ wardData on births and deathsPreparing patients‟ billBuying an expensive diagnostic system such as CAT scanA The quality of information which does not hide any unpleasant information is known asComplete Trustworthy Relevant None of the aboveB
Every record stored in a Master file has a key field becauseit is the most important fieldit acts as a unique identification of recordit is the key to the databaseit is a very concise fieldB
A management information system is one which is required by all managers of an organizationprocesses data to yield information of value in tactical managementprovides operational informationallows better management of organizationsB Data mining is used to aid in operational managementanalyzing past decision made by managersdetecting patterns in operational dataretrieving archival dataC
Data mining requires large quantities of operational data stored over a period of timelots of tactical dataseveral tape drives to store archival datalarge mainframe computersA
Data mining can not be done if operational data has not been archivedearlier management decisions are not availablethe organization is largeall processing had been only batch processingA Decision support systems are used for Management decision makingProviding tactical information to managementProviding strategic information to managementBetter operation of an organizationC
Which is the right approach of Data Mining? Infrastructure, exploration, analysis, interpretation, exploitation
Infrastructure, exploration, analysis, exploitation, interpretation
Infrastructure, analysis, exploration, interpretation, exploitation
Infrastructure, analysis, exploration, exploitation, interpretation
AWhich of the following issue is considered before investing in Data Mining?
Functionality
Vendor consideration
Compatibility
All of the above
DThe automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical
of decision support systems. Introspective Intuitive
Reminis
cent RetrospectiveD During business hours, most ______ systems
should probably not use parallel execution. OLAP DSS
Data
Mining OLTP D
Data mining evolve as a mechanism to cater the limitations of ________ systems to deal massive data sets with high dimensionality, new data
types, multiple heterogeneous data resources OLTP OLAP DSS DWH A
The term DSS refer to __________. Data Supply System
Decision Support
Deducte
d None of the aboveB The time required to insert an element in a
stack with linked
implementation is O(1) O(log2 n) O(n) O(nlog2 n)A
A list of integers is read in , one at a time and a binary search tree is
constructed.Next the tree is traversed and the
integers are printed. Which traversal result in a preorder postorder inorder None of the aboveD which of the following is a tabular listing of
contents of certain registers
and memory locations at different times during
the execution of a program loop program program trace sub routine programbyte sorting programB which of the following types of expressions
doenot require precedence rule for evaluaed? Full parenthesised infix expressionprefix expressionpartially parenthesized infix expressionmore than one of theseD which of the following is not correct? f(n)=O(f(n)) c*f(n)=O(f(n)) for constant 'c'O(f(n)+g(n))=(f(n))+O(g(n))O[f(n)2]=O(f(n))2C
consider the following tree.If the post order
The running time of an algorithm T(n) , where n is the input size given by
T(n)= 8T(n/2) +q n if n>1 = p if n=1
where p,q,are constants.The order of the n2 nn n3 n C
The number of edges in a regular graph of degree 'd' and 'n' vertices ismaximum of n,d n+d nd nd/2 D If hashing function is the remiander on division,
then clustering is more likely to occur if the
storage space is divided in to 40 sections than More likely to be false more likely to be truealways truealways falseB consider an undirected graph 'G' with 'n' vertices
and 'e' edges. What is the time taken by 'DFS' if
the graph is represented by adjacency matrix O(n2),O(n) O(n2),O(e) O(e),O(n2)O(e+n),O(e)B A strictly binary tree with 10 leaves
cannot have more than 19 nodes
has exactly 19 nodes
has
exactly cannot have more than 17 nodesB In evaluating the arthimetic expression
2*3-(4+5), using stacks to
evaluate its equivalent postfix form , which of the 6,4 6,4,5 6,9 2,3,9 D
Number of possible binary trees with 3 nodes is 12 13 14 15 D
The expression which access the (i,j)th entry of
a mxn matrix stored in column major form is nx(i-1)+j mx(j-1)+i mx(n-j)+j nx(m-i)+j B A complete binary tree with the property that the
value each node is atleast as large as the values Binary search tree AVL tree
complete
ly Heap D
A characteristic of the data that binary search uses but the linear search ignores is
(A) Order of the elements of the list.(B) Length of the list.
(C) Maximum value in list.
(D) Type of elements of the list. (A)the___________.
How many nodes in a tree have no ancestors. (A) 0
(B) 1
(C) 2
(D) n
(B)
Which of the following sorting algorithm is stable
(A) Insertion sort. (B) Bubble sort.
(C) Quick sort
(D) Heap sort
(D)
The time required to delete a node x from a doubly linked list having n nodes is
(A) O (n)
(B) O (log n) (C) O (1)(D) O (n log n)
( C )
Ackerman‟s function is defined on the non-negative integers as follows
(A) 4.
(B) 5.
(C) 6.
(D) 7. (B)
a (m,n) = n+1 if m=0
= a (m-1, 1) if m≠ 0, n=0
= a (m-1, a(m, n-1)) if m≠ 0, n ≠ 0
The value of a (1, 3) is
Let the following circular queue can accommodate maximum six elements with the
(A) front = 2 rear = 5(B) front = 3 rear = 5
(C) front = 3 rear = 4
(D) front = 2 rear = 4
(A)
following data
queue = ______; L, M, N, O, ___
queue = L, M, N, O, ___
queue = ______; L, M, N, O, ___
queue = L, M, N, O, ___