Pgcet 2013 Queans Full

1
PGCET Entrance Exam solution for C.E. 2013

Sr.
1
2
3
4
5
Question
Phase defination is covered in
Which is a black box testing method?
A Metrics used to measure the charestric of documentation and code
is called
A Non Functional Testing is called
1) Testing fault 2) Software fault 3) Design fault 4) Documentation
Fault
Which of the following statements about component testing is not

true?
Function/Test matrix is a type of
A reliable system will be one that:
9
10
11
12
13
14
15
Answer A
CMM 1
Equvivance partitioning
Answer B
CMM 2
Fault injection
Answer C
CMM 0
Code Coverage
Answer D
All of Above
None of above
Correct Answer
B
A
LOC
Test Metric
Product Metric
Process Metric
Perfomance Testing
2 is a valid reason; 1,3,4 &
are not
Component testing should
be performed by
development
Management report
Is unlikely to be completed
on schedule
White Box Testing

1,2 are valid reasons;3 & 4
& are not
Component testing is also
know as isolation or
module testing
Interim Test report
Black Box Testing

1,2,3 are valid reasons; 4 is
not
Component testing should
have completion criteria
planned
Project status report
Is unlikely to cause a
failure
Alpha Testing
All of them are valid
reasons for failure
Component testing does
not involve regression
testing
Final test report
Is likely to be liked by the
users
Equal to 0.9
Greater than 0.9
At least 1/0.81
60%
30%
70%
A black box testing

A black box testing
technique than can only be technique appropriate to
used during system
all levels of testing
A black box testing

technique used only by
developers
Driver
Stub
None of the above
5000
4333
4667
933.45
142.50.
230.25
Capture requirements
Capture design
specification
all of the above.
In unit testing of a module, it is found that for a set of test data, at

the maximum 90% of the code alone were tested with the probability At most 0.81
of success 0.9. The
A program P calls two subprograms P1 and P2. P1 can fail 50% times
50%
and P2 can fail 40% times. The program P can fail ?
A white box testing
Equivalence partitioning is:
technique appropriate for
component testin
To test a function, the programmer has to write a ______, which calls
Proxy
the function and passes it test data.
A company needs to develop a strategy for software product
development for which it has a choice of two programming languages
L1 and L2. The number of lines of code (LOC) developed using L2 is
estimated to be twice the LOC developed with L1. the product will
have to be maintained for five years. Various parameters for the
company are given in the table below. Parameter Language L1
4000
Language L2 Man years needed for development LOC / 10000 LOC /
10000 Development Cost per year Rs. 10,00,000 Rs. 7,50,000
Maintenance time 5 years 5 years Cost of maintenance per year Rs.
1,00,000 Rs. 50,000 Total cost of the project includes cost of
development and maintenance. What is the LOC for L1 for which the
cost of the project using L1 is equal to the cost of the project using
A company needs to develop digital signal processing software for
one of its newest inventions. The software is expected to have 40000 234.25
lines of code. The
Use Case is used for
Capture test cases
Is likely to be fault-free
D
D
C
C
Sr.
16
Question
Code review is for
Answer B
State Transition Testing
ability of system to
support users
Test Methedology
perfoming LCSAJ testing
Yes
Answer C
Dynamic Testing
The poit at which system
break down
Test Metric
Defect calculation
May be yes
Answer D
none of the above.
QTP is
Metric based technique is for
Is it possible to have a software product with "Zero defect"?
Answer A
Static testing
ability of system to run
without failure
Testing tool
estimating testing effort
No
17
Stress testing measures
18
19
20
21
A Testing which detect the defects in fully functional software is
Unit Testing
Integration Testing
22
Pesting Paradox in testing testcase is
23
24
25
26
27
28
29
Correct Answer
C
all of the above.
all of the above.

None of above
None of the above.
A
D
A
System Testing
None of the above.
correct errors
update errors
None of the above.
Face to face Communication is in

W - model is updation of
Test Planning includes
Example of Testing Tool
Non functional testing tool
To Detect cracks and Holes in the networks by
Data independence means
By repetating test case,

remove errors
Prototype Method
SpiralModel
Test Strategies
QTP
Load Runner
alpha testing
Integration testing
Agile Method
Waterfall model
Test methods
Silktest
BugZilla
Hardening testing
Alpha Testing
Waterfall Method
V- Model
Test Bed Creation
Selenium
Qtp
System Testing
stress testing
all of the above.

all of the above.
all of the above.
all of the above.
all of the above.
all of the above.
Unit testing
B
C
D
D
A
B
B
30
COTS is
Common Testing System
Commercial off the shelf
Code and Test system
None of above
31
COTS example is
all of the above.
33
34
35
36
37
38
39
40
COTS is for
Which testing devides input domain into class for testcase?
Types of review
Group Activity can be seen in
The person who records the procedding of review meeting is
SRS is an artifact of
Nonfunctional requirement is
Evaluting Software during various phases of SDLC is called
all of the above.

Boundry Value Analysis
all of the above.
all of the above.
Reviewer
Testing Phase
All of above
all of the above.
D
C
C
B
A
A
D
B
41
Disadvtage of prototype model is
Less iteration
42
Risk Analysis phase is in
43
advtage of prototype model is
Low cost
44
45
46
47
Important aspect of coding is

Data structure of application is in
RAD model was proposed by
Which of the following is in design stage
Waterfall model
User Get Idea about
system
productivity
Architectural design
IBM
Abstraction
Mcafee
Expertise team
lcontromonitoring an
Portability
Equvivance Testing
Technical
Technical
Moderator
Code Phase
maintainability
Validation
Not applied to real time
system
Prototype Model
Required Skill of Test Manager
Flash
understanding of
functional domain
Reusablility
White Box Testing
WalkThrough
WalkThrough
Author
Design Phase
usability
Testing
Error detection at later
stage
Spiral Model
all of the above.
32
Autocad
Understanding of testing
tools
Reliablility
Black Box Testing
Inspection
Inspection
Recorder
Analysis phase
Reliability
Varification
48
If n number of programmers are in team , then number of paths is
All of above
all of the above.
Fast Development
All of above
efficiency
data design
Microsoft
Information Hiding
reliability
Interface design
Motorola
refinement
all of the above.

All of above
Intel
90-120 days
D
D
A
D
n*(n-1)/2
nlog(n)nlog(n)
n*(n+1)/2n*(n+1)/2
Sr.
Answer B
Answer C
Answer D
49
Question
Answer A
if 99% code is written in C and 1% code is written in assembly
lenguage then increse in execution time compare to 1% code written 10%
in assembly language is
20%
5%
50
Which of these is not element in object oriented analysis model
Data Element
Behaviour element
Class based element
Scenario based element
51
52
Relationship shown in data model is for

UML diagram is useful in representing
cardinality
Flow base element
modality
Class base element
directionality
Scenario base element
A
C
53
Behaviour modeling is for
Well defined process
Data element Hiarchy
Specification design
Both (A) and (B)

Scenario base element
Obeservable mode of
behaviou
54
State diagram is for
transorm data element
Show relationship
between data
Reaction to external event all of the above.
55
In unit testing of a module, the maximum 90% of the code alone

were tested with the probability of success 0.5. The reliability of
module is ?
45%
100%
90%
50%
56
A program P has p1 and p2 sub programs. Probability of p1 fails is

50% and p2 fails is 40%. What about the probability os P fails
30%
70%
10%
20%
57
Which of this is not software engineering layers
Method
Tools
Manufacturing
Process
58
Five generic software frame work activities are
analysis , Design, Code,

maintenance,test
Analysis,planning,design,co
de,test
59
Evolutionary model is
iterative in nature
all of above
60
Incremental model approach in software development is useful in
complex project
61
62
63
64
65
66
67
68
69
The approach/document used to make sure all the requirements are

Test bed
covered when writing test cases
Executing the same test case by giving the number of inputs on same
Retesting
build called as
Assertions are conditions which are true at the point of execution
Top down approach is used for
The first item defined for a new system is its
The feature of the object oriented paradigm which helps code reuse
is
To test competing product in to the market comparision testing is
done
A key concept of quality control is that all work products
Sometimes
communication,risk
communication,planning,m management, design,
odelling,construction,depl code, test
oyment
accommodate changes
not produce throw away
easily
Correct Answer
small project
develop core module
all of above
Traceablity Matrix
Test Metric
All of above
Regresssion testing
Adhoc Testing
perfomance testing
Many Times
Always
None
Identification of faults
Storage
Development
Processing
D
B
Testing and validation

Input
Reverse engineering
Output
Inheritance
Aggregation
Object
Class
Input
Output
Storage
Processing
TRUE
FALSE
Are delivered on time and Have complete

under budget
documentation
A
Are thoroughly tested
before delivery to the
customer
Have measurable
specification for process
outputs
Sr.
Question
70
What are the three generic phases of software engineering?
71
Coupling and cohesion can be represented using a
72
Software feasibility is based on which of the following
73

The feature of the object oriented paradigm which helps code reuse
is
The process is at least documented in CMM
74
75
Answer A
Answer B
Definition, development,
Analysis, design, testing
support
Dependence matrix
SRS
Business and marketing
Scope, constraints, market
concerns
Input
Output
Answer C
Inheritance
Aggregation
Object
Class
Level 1
Level 2
Level 3
Level 4
Q and R
P and S
Q and S
it is on a set of fields that

form a candidate key
it is on a set of fields that

include the primary key
all of above
76
Which of the following statements are TRUE about an SQL query? P :

An SQL query can contain a HAVING clause even if it does not have a
GROUP BY clause Q: An SQL query can contain a HAVING clause only P and R
if it has a GROUP BY clause R : All attributes used in the GROUP BY
clause must appear in the SELECT clause S : Not all
77
An index is clustered, if
78
Function point metric of a software also depends on the
79
81
82
83
The worst type of coupling is

FP-based estimation techniques require problem decomposition
based on
Cohesion is closely bound to
Which coupling is high ?
Which is not a size metric?
84
IEEE 830-1993 is a IEEE recommended standard for
80
85
86
87
88
89
90
91
92
The ISO quality assurance standard that applies to software

engineering is
Many causes of the software crisis can be traced to mythology based
on
What is an incremental software process model that emphasize an
extremely short development cycle?
Data structure coupling is also know as
For a data entry project for office staff who have never used
computers before (user interface and user-friendliness are extremely
important), one will use
Top-down design does not require
Which of the following graph theoretic concept will be useful in
software testing?
One of the fault base testing techniques is
the data records of the file

are organized not in the
same order
Number of function
needed
Stamp coupling
the data records of the file

are organized in the same
order as
Number of final users of
the software
Content coupling
Software functions
Process activities
Inheritance
Control coupling
Cyclomatic complexity
abstraction
Content coupling
Function count
Software design
Testing
ISO 9000
ISO 9003
Customer Myths
Management Myths
RAD
content coupling
Answer D
Programming, debugging,
What, how, where
maintenance
Cause-effect graph
Chart
Technology, finance, time, Technical prowess of the
resources
developers
Storage
Processing
Number of external inputs

and outputs
Control coupling
Information domain
values
coupling
message coupling
LOC
Software requirement
specification
Correct Answer
B
A
C
B
Data coupling
Project schedule
None of above
None of above
Program length
B
B
A
Both (A) and (B
ISO9002
ISO 9001
Practitioner Myths
all of above
Prototype
SpiralModel
None of above
stamp coupling
messsage coupling
control coupling
Spiral Model
Prototype Model
Water Fall Model
all of above
step-wise refinement
modularity
flow charting
loop invariants
Cyclomatic number
Hamiltonian circuit
Eulerian cycle
None of the above
Stress testing
Unit testing
Beta testing
Mutation testing
Sr.
Question
Answer A
93
Reliability of software is directly dependent on
user requirement
number of errors present
quality of the design
Error correction
Adaptive maintenance
Establishing scope
Perfective maintenance
Adaptation
Corrective maintenance
Answer D
software engineers
experience
Enhancement
None of above
Adaptive maintenance
Corrective maintenance
Perfective maintenance
Preventative maintenance
Size measurement
Design recovery
Cost measurement
All of the above
Analysis Modelling
Requirement Gathering
Formulation
User Interface Prototyping
Highly Coheshive
Comprehenshive
Loosly coupled
All of above
Content
maintainability
links
Nevigation
94
95
Which one of these are not software maintenance activity

Emergency fixes known as patches are result of
Changes made to an information system to add the desired but not
96
necessarily the required features is called
97
Reverse engineering is the process which deals with
Which of the following is not one of the WebApp requirements
98
analysis tasks?
As use-cases are organised to functional packages.Each functional
99
Package must be
Which of the following is not one of the dimensions of quality used
100
to assess a WebApp
Answer B
Answer C
Correct Answer
B
B
C
101
Which of the following is not the WebApp Interface Mechanism?
Forms
cookies
browser
links
102
Which of these terms is a level name in the Capability Maturity

Model?
Reusable
Organized
Repeatable
Ad hoc
103
Reliability of software is directly dependent on
user requirement
number of errors present
quality of the design
104
105
Graph based testing is only applied to object oriented system?

Use case provide useful input for design of black-box test for
____ a measure of some property of a piece of software or its
specifications
Methods for estimation in software engineering include:
if a software engineer has built a small web-based calculator
application, we can say that the project effort is
if a software engineer has built a small web-based calculator
application, we can say that the software size is
Yes
OO software
No
Application Software
Can't Say
System Software
software engineers
experience
May be yes
None of above
SRS
input
output
Software Metric
Analysis Effort method
Function Point Analysis
COCOMO
All of Above
200 man-hours
300 LOC
30 FP
None of above
200 man-hours
300 LOC
40 person-month
None of above
version control
naming convention
(programming)
software archival
agreements
all of above
the project's progress
Project's scheudle
Project's planning
None of above
ISO 9000
Riskevent/Probability of
occurance
ISO 9001
Risk event x Probability of
Occurrence
ISO 31000
None of above
Constant (3.0)
None of above
114
Risk mitigation
Risk monitoring
Risk reduction
None of above
Risk reduction
the problem of designing
test data to execute the
controlled
Risk retention
116
Risk mitigation
Risk monitoring
we can always design test the problem of designing
data to execute the
test data to execute the
controlled statement
controlled
none of the above
106
107
108
109
110
Software Configuration Management include
The purpose of project monitoring and control is to keep the team

and management up to date on
112 Risk management is associated with
111
113 Composite Risk Index value =

sprinklers are designed to put out a fire to reduce the risk of loss by
fire is called
115 Self Insurance falls under
In an if statement
B
B
A
Sr.
Question
Jacob has written a program to complete the roots of the quadratic

117 equation ax2+bx+c=0. Assuming a 16 bit computer to exhaustively
test his program for all integer values for a, b and c he requires
Consider the code below
begin
118 If (y<=0) then y = 0-y;
abs = y
End;
Ashok rewrites part of the code in some production code making it
119
more efficient. This maintenance activity is called
An error is detected in some production code. The maintenance
120
effort to fix the error is called
Answer A
Answer B
Answer C
Answer D
Correct Answer
an infinite number of test

cases
2^ 48 test cases
2^164 test cases
None of above
error in code as negative

values remain negative
The code finds absolute

value of y
error in code as positive

values remain negative
None of above
perfective
adaptive
corrective
none of above
perfective
adaptive
corrective
none of above
121
Choose the correct statement
Testing can show the

Testing can always find
presence of bug but never
the bug
absence
If we test enough we can

find all bugs
None of above
122
Testing is best done
By Analyst
By programmer
By Software Engineer
By independent test team
The tests he generates

may give nonrepeatable
results
The tests will always given He will find the bug for all
repeatable results
runs of the program
None of the above.
Clinton wants to test his module where he had forgotten to initialize

x
If x = 0 then
123 Write ("abnormal")
Else
Write ("normal");
End if;
Ramesh wants to test the folowing program by generating random
test values for x and y. The error in the program is z = 22 should be
there
read (x);
read ( y);
124
If (x== y) then
z = 2;
else
z = 0;
end If;
Random testing is
Random testing always
Random testing will always
insufficient as the bug may
generates equal value of x None of above
find the bug
never detected
and y
125
Suresh and Ramesh design test cases for a fragment of code. Suresh Ramesh's testing is much
runs 100 test cases but Ramesh runs 200 test cases
better
Suresh's testing may be

better than Ramesh
126
Mohit writes test data which will exercise each edge of the flow
graph for his program
His test data has to be

His testing is exhaustive as
carefuly designed and will None of above
he will find all the bugs
work for all flow graphs
His method of edge

coverage is not enough
200 test cases would have

None of the above
been enough
Sr.
Question
Consider the above modules Ca and Cb where a and b are the sizes.
127
Then
128 Variation in debugging : coding ability has been reported to be
129
Answer A
Answer B
Answer C
Answer D
E (a + b) > Ea + Eb
E (a + b) < Ea +Eb
E (a + b) > =Ea + Eb
None of the above
01:10
01:02
01:05
01:20
`1:10:100
01:03:10
01:02:05
Form the detailed design speciication. If the coding is done in C++ : C

01:03:05
: assembler the resulting code sizes will be on the average.
Correct Answer
Consider two modules A and B, both utility programs in the same

organization developed by the same team of programmers, where a
130
and b are the sizes, respetively. The cost to develop each module is
Ca and Cb. The efforts are Ea and Eb. if Ca > Cb then
Ea < Eb
Ea > Eb
Ea = Eb
both (A) and (C)
131
Data abstraction
modularity
concurrency
data hiding
Informational cohesion is a realization of
The rating of coupling of modules for strongest (least desirable) to

132
weakest (most desirable) are
133
The largest %cost of software life cycle is in
content,common,control,st common,content,control,st stamp,control,content,com None of above

amp
amp
mon
feasibility
Testing
Design
Maintenance
134
Which is not a component of Object Oriented s/w Engineering?
Process
Cyclomatic complexity metric provide information regarding number

error in the program
of
Cyclomatic complexity metric provide information regarding number
136
error in the program
of
Software does not wear
137 Which of the following is not the characteristic of software ?
out
138 Which of the following is not a product matrix ?
139 Which of the following is not a process metric ?
Functionality
140 Efforts is measured in terms of ?
Rupee
141 Match the following
1-A , 2-C , 3-D, 4-B
To completely write the program in FORTRAN and rewrite the 1%
142 code in assembly language, if the project needs 13 days, the team
consists of ?
If 99% of the program is written in FORTRAN and the remaining 1% in
assembly language, the percentage increase in the programming time
10
143
compared to writing the entire program in FORTRAN and rewriting
the 1% in assembly language is ?
135
Architectue
None of above
cycle in the program
independent logical path
statement in the program
cycle in the program
independent logical path
statement in the program
Software is always correct
Size
Efficiency
Month
1-C , 2-A , 3-D, 4-B
B
A
C
D
Software is flexible
Productivity
Productivity
Person
1-B , 2-C , 3-D, 4-A
Software is not
manufactured
Reliability
quality
Person - Months
1-C , 2-A , 3-B, 4-D
13
145
Recovery from error
Robustness
Method
If the entire program is written in FORTRAN, the percentage increase

144 in the execution time, compared to writing the entire program in
9
FORTRAN and rewriting the 1% in assembly language is ?
Stress testing measures
Security
0.9
None of above
Sr.
Question
Answer B
Answer C
Answer D
146
Given a source code with 10 operators includes 6 unique operators,

100
and 6 operand including 2 unique operands. The program volume is ?
48
40
36
147
Project indicator enables a software project manager to ?
track potential risks
assess the status of an

ongoing project
All of above
148
Once object oriented programming has been accomplished, unit

testing is applied for each class. Class tests includes ?
Random testing
Fault based testing
All of above
149
In risk analysis of spiral model, which of the following risk includes ?
Technical
Management
Both A and B
None of above
150
To avoid errors in transcription and transposition, during data entry

the system analyst should ?
Provide batch totals
Provide for a check digit
Provide hash totals
all of above
What is the grammar for generating strings like a=b=c?
rightleer=rightleer
leTerab..z
rightleer=leer
leTerab..z
rightleer=leerleer
leTerab..z
rightright=leerleer
leTerab..z
Out of the following grammars, which one is right associative

grammar?
stmtif (expr) stmt else

stringstring+string012 stmt
3
rightleer=rightleer
leTerab..z
listlist+digitdigit
digit0123
synthesized
inherited
syntax
parsed
scanning
parsing
stack
analysis
left-to-right
top-down
right-to-left
Bottom-up
3
4
5
An attribute is said to be ____ if its value at a parse tree node is

determined from attribute values at the children of the node.
__________is the process of determining if a string of tokens can be
generated by a grammar.
__________ can handle large class of grammars and translation
schemes.
In compiler, analysis consists of which three phases?
7
8
Answer A
uncover problem araes

before they " go critical "
Correct Answer
Hierarchical analysis is also called ___________

__________ is the compressed representation of the parse tree.
Linear,Hierarchical,Semant linear,portable,bottom-up Linear,nonlinear,synthesis linear,nonlinear,top-down

ic
lexical analysis
semantic analysis
syntax analysis
synthesis
syntax tree
semantic tree
directed acyclic graph
graph
Who allows a user to define shorthands for longer constructs?
macro preprocessor
rational preprocessors
language extensions
File inclusion
10
The output of the second pass of assembler is called what?
hypothetical machine
code
relocatable machine code
pass code
register transfer code
backtracking
forwarding
backpatching
looping
parsing rule
syntax directed definition
operator precedence
semantic actions
token
context free grammar
lexeme
regular expression
semantic analyzer
lexical analyzer
code generator
parser
11
12
13
14
The technique of merging intermediate and target code generation

into one pass is called __________.
In a translation scheme, ______ are embedded within the right sides
of the production.
___________ is used to describe patterns
Which part of the compiler strip out comments from the source
programme?
C
A
15
Lexical analyzers are divided into cascade of which two phases?
parsing,semantic analysis
regular expression,context
scanning,lexical analysis
free grammar
code generator,code
optimization
16
The advantage of separating analysis phase into lexical analysis and

parsing is ______________
enhanced writability
enhanced portability
enhanced security
enhanced readability
Sr.
17
18
19
20
21
22
Question
const pi=3.1416, pi in lexical analysis is called _______
Which error will not be identified by lexical analyzer?
Which is the prefix of the string ahmedabad?
Which is the substring of string gujarat?
Which is the subsequence of the string gujarat?
What can not be described by regular expressions?
Answer A
lexeme
fi (a==f(x))
ahmedabad
gjrt
gjrt
balanced constructs
Answer B
identifier
a=(b
med
jar
rjg
nested constructs
Answer C
pattern
a=b c
bad
gja
jug
repeating strings
23
Out of the following , which one is the syntactic error?
misspelling an identifier
operator applied to
incompatible operand
arithmetic expression with

infinitely recursive calls
unbalanced parantheses
24
25
26
synchronizing token is used in which type of error recovery?

Rightmost derivations are sometimes called _________
E-(E+E)-(id+E)(-id+id) , this is the example of
A grammar that produces more than one parse tree for some
sentence is said to be
A left recursive grammar can cause a recursive descent parser with
backtracking to go into ____________
phrase level
canonical derivation
rightmost derivation
panic mode
left derivation
leftmost derivation
error production
derived derivation
top down derivation
global correction
constant derivation
bottom-up derivation
B
A
B
context free
context sensitive
ambiguous
regular
infinite loop
panic mode
recovery mode
execution mode
27
28
Answer D
symbol
all of the above
abad
rag
rgu
all of the above
Correct Answer
A
A
A
B
A
B
29
Which four components are there in table driven predictive parser?
input buffer,stack,parsing input string, stack,

input buffer,stack,regular input buffer,stack, error
transition diagram, output definition,output stream recovery, output stream
table,output stream
stream
30
FOLLOW function can be used as what during panic mode recovery?
nonterminal
terminal
casesensitive character
both B and C
hard to read
none of the above
handle
right sentential form
difficult to use for

translation process
left sentential form
handle pruning
handle
viable suffixes
viable prefixes
suffixes
number of sets
left factoring
right recursion
31
32
33
Left recursion elimination and left factoring make the resulting

grammar ______________
A rightmost derivation in reverse can be obtained by what?
The set of prefixes of right sentential forms that can apper on stack
of a shift reduce parser are called ______________
34
In LR(k) - k refers to ___________
35
In LR(k) parsing, "L" refers to _________
number of symbols of
lookahead
left most derivative
36
In LR(k) parsing, "R" refers to
right-to-left scanning
37
38
Which attribute value at a node in a parse tree is defined in terms of

synthesized
attributes at the parent and/or siblings of that node?
The directed graph that depicts interdependencies among the
inherited and synthesized attributes at the nodes in the parse tree is dependency graph
called ____
synchronizing token
left-to-right scanning
right side of the
production
number of symbols on
stack
left recursion
right most derivation in
reverse
Nonterminal
terminal
inherited
directed graph
parse tree
syntax tree
number of iterations
39
Which storage allocation strategy manages the run time storage?
run time allocation
static allocation
heap allocation
stack allocation
40
When there is a reference to storage that has been deallocated, the

reference is called ___________________
pointer reference
dangling reference
null reference
deallocated reference
41
Shift reduce parsers are
top down parser
bottom up parser
predictive parser
recursive descent parser
10
Sr.
Question
Answer A
42
YACC builds up
SLR parsing table
43
Inherited attribute is a natural choice in
44
An intermediate code form is

Instructions involving register operands are usually _______ and
______ than those involving operands in memory.
A ____ is a rule that describes that set and a _____ is a sequence of
characters matching the patterns
45
46
Answer B
Answer C
Canonical LR parsing table LALR parsing table
Answer D
Correct Answer
None of the above
None of these
syntax tree
Checking for the correct

use of L values and R
values
post fix notation
three address code
all of these
shorter and slower
shorter and faster
longer and slower
longer and faster
lexeme,pattern
pattern,lexeme
pattern,token
token,lexeme
Keeping track of variable

declaration
both A and B
47
Non backtracking top-down parsers are also called ___________
predictive parser
recursive descent parser
Both a and b
Canonical LR parsing
48
All SLR(1) grammars are also ________________.
LR(1)
LALR(1)
LL(1)
operator precedence
49
S-attributeddefinition can be implemented using ________ parsers.
LL
LR
both a and b
neither a nor b
Expansion,control stacks
copying, control stacks
Activation,control stacks
None of these
Run time,compile time
link time,compile time
compile time,run time
link time,link time
memory leaks,dangling
references
starvation,memory leaks
starvation,heap allocation
B
B
50
51
The execution of a procedure body is called ___ of the procedure

maintained on _____.
Static binding is performed at ____ while dynamic binding is
performed at _____
52
_____ and _____ are disadvantages of manual deallocation.
starvation,dangling
references
53
Eliminating redundant load is an example of ____ optimization.
Runtime
Peephole
Algorithmic
logical
54
Instructions that compute a value that is never used is called ____.
Dead code
Hibernating code
static code
dynamic code
55
56
What will be the precedence relation id __ + __id

IniVal item S'.S is considered _________
The term l-value refers to the _________ of an expression and rvalue refers to the ____ of an expression.
In call-by-reference mechanism of parameter passing, the _____ of
actual parameter is passed to the function.
The stack holds all the ____ variables defined within a function
during its activation.
What type of language is "C"?
What is the regular expression for matching quoted strings?
What is the prurpose of -d option when following command is
executed? yacc -d ch3-01.y
>,<
kernel item
<,>
nonkernel item
>,=
itemset
<,=
initial item
A
D
nonterminal,value
value,storage location
storage location,value
terminal,storage location
value
address of the memory

location
name
none of the above
global
environment
control
local
weakly typed
\"[a-zA-Z0-9]\"
static type
\"[a-zA-Z]\"
none of the above

\"[a-zA-Z0-9]\"\n
C
A
make y.tab.c
make y.tab.c and y.tab.h
strongly typed
\"[^"\n]*["\n]
make y.tab.c and link to
lex library
make y.tab.c and lex.yy.c
"+" has a higher

precedence than "-"
"+" and "-" are left

associative
match one to three

occurences of letter A
match if the string

contains A,1 and 3.
57
58
59
60
61
62
63
What is the interpretation of following YACC declaration? '
"+" and "-" appears on the

"+" appears to the left of
left side of production
64
What is the meaning of regular expression A{1,3}
match one,two or three

occurences of letter A
match if the string

contains A,1,2 and 3.
11
Sr.
65
66
Question
Answer A
What will be the output of the code optimizer, if the following input
is given?
id1:=id2+id3*60
temp1:=inttoreal(60),temp2:=id3*temp1,temp3:=id2*temp2,id1:=te
mp3
What will be the output if we remove the left recursion?
exprtermexpr'
exprexpr+termterm
expr'+termexpr'
Answer B
Answer C
Answer D
Correct Answer
temp1:=id3*60
id1:=id2+id3*60.0
temp1:=id3*60
id1:=id2+temp1
exprexpr'
expr'term+expr
exprtermexpr'
expr'+termexpr'
exprtermexpr' expr'
67
What is the regular definition of unsigned numbers?
numdigit(.digit+)?(E(+)?digit+)?
numdigit+(.digit+)?(E(+numdigit+(.digit+)?(E(+numdigit+(.digit+)?(E(+)?d )?digit+)?
)?digit+)
igit+)?
68
In call-by-reference mechanism of parameter passing, the _____ of

actual parameter is passed to the function.
value
position
sata
69
In case of procedure calls in C, what is saved on the stack?
value
program counter machine

address
register
function definition
70
The storage layout for data object is strongly influenced by

the_______of the target machine
data constraints
heap constraints
stack constraints
addressing constraints
71
what is true in case of static allocation
recursive procedure are

unrestricted
data structure can be

created dynamically
all of these
72
what is placed in the middle in case of activation records ?
73
Use of dangling references, is what type of error?

consider the grammer S (L) S L L, S S which string we can
generate out of above grammer ?
fields whose sizes are

defined at run time
syntactical
fields whose sizes are not fields whose sizes are

proper
fixed early
lexical
semantic
(a,((a,a),(a,a)))
(a,(a,a),(a,a)))
(a,((a,a,(a,a)))
(a,((a,a,a,a)))
74
the size of the data object

must be known at compile
time
fields whose sizes are not
fixed early
logical error
address
D
B
75
consider the grammer bexpr bexpr or bterm bterm bterm

bterm and bfactor bfactor rootbfactor (bexpr) true false
grammer generates all

relational expression

logical expression

mathematical expression

boolean expression
76
This grammar is R R' 'R RR R* (R) ab ______________
not ambiguous
not a valid grammar
ambiguous
none of the above
77
What type of grammer is this ? S Aa bAc dc bda A d

consider the grammer S aSbS bSaS which string can be
generated by the above grammer ?
LALR(1)
operator precedence
SLR(1)
undefined
ab
aabb
abab
all of these
{a}
{}
{b}
{a,b}
{$,a,b}
{}
{a,b}
{}
6 a's
3 a's
4 a's
8 a's
78
79
80
S -> AaAb BbBa

FIRST(S) ?
S -> AaAb| BbBa
A ->
B ->
A ->
B -> what is in the
Which string is not generated by the following grammer ? S aSa
81
aa
82
how lexical analyzer can be implemented ?
produce a lexical analyzer use context free

from a regular-expression grammar
use directed acyclic graph use heap storage
12
Sr.
83
84
Question
out of following what is the most concerned part for compiler
design ?
what does the lexical analyzer do in case of following input ? =
1.25
Answer A
Answer B
Answer C
Answer D
Correct Answer
logical operations
speed of lexical analysis
stack implementation
ease of operations
DO is a keyword
DO is not a keyword
lexical error
recovery
85
to push scanned
what is the purposr of function ungetc if used with lexical analyzer
characters back in the
?
input stream
To stop taking the input
to push lookahead
characters back in the
input stream
To read next character
86
how can we specify pattern of zero or more a's in lexical analysis ? a-a
[a-a]
a+
a*
87
what does the following rule specify if we write (rs)t = r(st) where
r and s are regular expressions.
concatenation is
associative
regular expression r,s,t

are equal
88
what is the alternate representation for r*
(r0)*
r+0
89
for what purpose yylval is in LEX tool ?
to hold the lexical value

returned
undefine the value
90
for what purpose yyleng is in LEX tool ?
91
in the input buffering in lexical analysis where the sentinel

character is kept ?
92
what regular expression lexical analyzer will use to strip out white
newline ws
spaces ?
bracket is not important

r+
To check whether the
entered text is tring or
integer
integer telling how long
the lexeme is
each buffer half holds a
sentinel character at the
beginning
94
95
96
97
what regular expression lexical analyzer will we to find optional

fractional part of decimal number ?
I={EE'.+T} then goto(I,+) consists of ____________
number of alphabets in
lexeme
each buffer half holds a
sentinel character at the
end
-> delim
delim -> blank | tab |

newline ws
-> delim*

newline ws
-> delim+
ws -> blank | tab |

newline
opVonal_fracVon
(.digits)
I={EE'+.T}
opVonal_fracVon
(.digits) +
I={EE'+T}
opVonal_fracVon
(.digits) *
I={EE'.+T}
opVonal_fracVon
(.digits) ?
I={EE'+T.}
SLR(1)
ambiguous
right recursive
decorating
analyzing
traversing
directed graph
syntax tree
parse tree
What type of grammar is this? S-> L=R S-> R L-> *R L ->id R->
not SLR(1)
L
The process of compuVng the aTribute values at the nodes is
called ______ the
evaluating
parse tree.
What identifies the common subexpression in the expression?
To convert the value to

integer
string telling the value of number of digits in

the lexeme
lexeme
both buffer half holds a
each buffer half does not
sentinel character at the hold a sentinel character
end and beginning
at the end
93
order of regular
expression is not
important
(r)*
directed acyclic graph
13
Sr.
98
99
Question
The flow control in a program corresponds to _____ traversal of
the activation tree
Match the static notation and its dynamic counterpart in context

of compiler.
100 How symbol table is stored in compiler?
Answer A
Answer B
Answer C
Answer D
active
breadth first
top down
depth first
scope of a declaration lifetime of binding
all of these
as a pattern index
as an array of values
bat
ball
bracket
egrep -n -e '[ps]'
egrep -n -e '[^p-s]'
egrep -n -e '[p-s]'
nondeterminism in
transition diagram
recursive procedure call
determinism in transition
diagram
parse tree method
rule based method
all of these
state symbol on the top

of the stack and current current input symbol
input symbol
FOLLOW set
shift-reduce conflict
reduce-shift conflict
definition of a procedure declaration of a nameactivation of the

binding of the name
procedure
as a hash indexed on the as a pointer to the
lexeme
lexeme
Which pattern will match if following command is executed? egrep

labs
-n -e '[^b]a'
What regular expression will be written if we want to match any
102
egrep -n -e '[$p-s]'
input line where letter p or q or s exist?
101
103 In which case we cannot build predictive parser?

104
nonrecursive call
Which methods can be used to compute the attributes of different translation interleaved
symbols in syntax directed definition?
with parsing
105 Who determines the shift reduce parsing decision?
state
in upon constructing LR(1) sets of items following grammer

106 generates which type of conict ? S' S aAd bBd aBe bAe A reduce - reduce conflict
cBc
what is the syntex directed definition for the following ?
1. D > TL
2. T -> int
107
3. T -> real
4. L -> L1, id
5. L -> id
what is the iniVal set of items in case of LR(1) items for the
following augmented grammer ?
S' -> S
108
S->CC
C->Cc | d
109 Which type of three address code requires lesser space?
1. L.in := T.type
1. L.in := T.type
2. T.type := integer
3. T.type := real
3. T.type := real
4. L1.in := L.in
4. L1.in := L.in
addtype(id.entry, L.in)
5. addtype(id.entry, L.in)
5. addtype(id.entry, L.in)
shift - shift conflict
1. T.type := L.in
2. T.type := real
3. T.type := real
3. L.in:=T.type
4. L1.in := L.in
4. L1.in := L.in
5. addtype(id.entry, L.in) 5. addtype(id.entry, L.in)
Correct Answer
I0:S' S,$ S CC, $ C I0:S' S,$ S CC, $ C I0:S' S,$ S CC, $ C I0:S' S,$ S CC, $ C
cC, c C d, d
cC, cd C d, cd
cC, C C d, d
cC, C C d, C
Quadruples
Indirect triples
Triples
none of these
14
Sr.
Question
Answer A
Answer B
Answer C
Answer D
Correct Answer
Out of the following, which translation scheme maps infix

110
expression to corresponding postfix expression?
ETR
ETR
Raddop
T{print(addop.lexeme)}R1 Raddop T R1

ETR
Raddop
{print(addop.lexeme)} T
R1
ETR
Raddop T R1
{print(addop.lexeme)}
For the semantic rule A.a:=f(X.x,Y.y,Z.z) is associated with the

111 producVon AXYZ. Before XYZ is reduced to A,which aribute will
be on the top of the stack?
X.x
Z.z
Y.y
A.a
112 In which case stack allocation strategy cannot be used?
value of local names

must be retained when
activation ends
A called activation
outlives the caller
both of these
none of these
What is the result if left factoring is done on the grammar?

113 iEtS iEtSeS a
Eb
S -> iEtSS'
S'-> eS
E-> b
S-> iEtS'
S'-> eS |
E-> b
S -> iEtSS'
S' ->S |
E ->b
S -> iEtSS'
S'-> eS |
E-> b
S-> Aab
A->cA'adA'
S-> Aab
A->bdA'A'
A'->cA'adA'
cannot remove left

recursion
superset of predictive
parsers
all of these
No drawback
No tool available to
generate parser
lbl x y LT
LT x y lbl
none of these
118 f:=g is related to which issue of the code optimization in compiler? common subexpression
dead code elimination
copy propagation
Loop optimization
119 Which method decreses the amount of code in a loop?
common subexpression
code motion
copy propagation
Loop optimization
What is the code motion equivalent of the statement while

120
(i<=limit-2)
while(limit-2>=i)
while (i>limit-2)
t=limit-2 while(i<=t)
for(i=0;i<=limit-2;i++)
process is an executing program, including the current values of

the ____, _________ and ___________.
counter,registers and
variables
local and global variables
In UNIX process is created by which system call?

Which data structure contains the address of interrupt service
procedure?
create
functions,stack,program
counter,interrupt,function
counter
s
fork
system
process
interrupt array
interrupt routine
interrupt vector
What is the result if left recursion is removed from the grammar?

grammar is not left
114 S-> Aab
recursive
A->AcSd
115 Why LR parser is attractive?
recognize all
programming language
construct
116 What is the drawback of LR parser?
difficult to understand
117
1
2
3
What is the three address code for the statement if
x<y goto lbl
lbl LT x y
most general
nonbacktracking shift
reduce parsing
too much work to
construct LR parser by
hand
interrupt address
15
Sr.
4
5
6
7
8
9
10
11
12
13
Question
Answer A
What term is used to indicate that if one process is using shared
deadlock
variable or file , the other processes will be excluded from doing
the same thing.
The part of the program, where the shared memory is accessed is
shared heap
called _____________
Which criteria constitutes a good scheduling policy?
Turnaround
Allowing processes that are logically runnable to be temporarily

suspended that type of scheduling is called _____________
In round robin scheduling , what is the effect of setting the two
short quantum?
A ___________ can be thought of as a program in execution.
A batch system executes _____, wheareas a time-shared system
has ____________.
A process includes the ________, which contains temporary
data(such as function parameters,return addresses and local
variables)
What does a process include that is memory that is dynamically
allocated during processes run time?
Only one process can be ______ on any processor at any instant.
Many processes may be ______ and ___________.
Answer B
Answer C
Answer D
mutual exclusion
mutual awareness
mutual denial
shared region
crtitical section
not accessible data
response time
throughput
all of these
process starvation
premature leaving
process observation
too few process switches increases CPU efficiency
too many sleeps
thread
executable program
processs
tasks,threads
processes,threads
jobs,user programs
jobs,tasks
stack
program counter
data section
heap
array
heap
vector
stack
running,ready,waiting
running,terminated,waitin waiting,running,ready
g
ready,waiting,running
accumulators
index registers
stack pointers
all of these
memory management
information
cPU registers
process state
accounting information
CPU and real time used
process priority
page tables
list of I/O devices
vector
pointer to first process
control block
linked list
pointer to final process
control block
tree
pointer to first and final
process control block
array
do not contain any thing
CPU
thread
long term scheduler
long term scheduler
preemptive scheduling
too many process
switches
assembly program
17
The CPU registers in a process control block include which of the

following?
Page tables and segment tables are part of which piece of
information in process control block?
What is included as part of accounting information in case of
process control block?
What data structure is used to store all processes?
18
What does a ready queue header contain?
19
The list of processes in a device queue is waiting for a _______
process
particular I/O device
20
What type of scheduler is needed for batch system?
process scheduler
short term scheduler
21
What type of scheduler is needed for processes that are ready to

execute?
process scheduler
short term scheduler
14
15
16
CPU and real time

scheduler
CPU and real time
scheduler
Correct Answer
16
Sr.
22
Question
short time scheduler is _________
Answer A
slow
Answer B
inefficient
Answer C
fast
Answer D
improper
23
_________ uses more of its time doing computations.
interrupt processes
I/O bound processes
CPU bound processes
memory bound processes
24
In which case short term scheduler has little work to do?
all processses are

interrupt processes
all processses are I/O

bound processes
all processses are CPU

bound processes
all processses are

memory bound processes
25
Which type of systems do not have long term scheduler?

The task of performing the state save of currrent process and
state restore of a different process is called __________
context switch time is overhead for the operating system because
_____
On UNIX, listing of processing can be obtained using which
command?
Which process in UNIX, serves as a root parent process for all
processes?
each process in UNIX is identified by __________
A process is _____ if it can affect or be affected by the other
processes executing in the system.
real time system
batch system
time sharing system
single process system
context switch
process switch
memory switch
task switch
system goes in wait mode system does useful work
system creates many

new processes
system does no useful

work
ps
execute
process
ls
root
parent
init
login
process pointer
process tag
process identifier
process table
cooperating
CPU sharing
memory sharing
I/O sharing
26
27
28
29
30
31
Correct Answer
C
32
Which two models can be used for interprocess communication?
shared memory,vactor
passing
shared memory,message segmented

page memory,message
passing
memory,message passing passing
33
Which concept is easier to implement for intercomputer

communication?
page memory
shared memory
segmented memory
smaller amounts of data
37
intermediate amount of
data
sending process is
In which case send() call of message passing is considered blocking blocked until the message
send?
is received by receiving
process
shared memory segment can be removed with the help of which
shmget()
system call?
A system has one network address and it has ____ port
undefined
38
Communication in client server system may use
sockets
39
Java provides an interface java.io.serializable. What is the use of

object serialization?
allows a state of an
object to be written to an object to be written to a
array
vector
34
35
36
message passing is useful for _______
message passing
larger amounts of data

sending process is
blocked until the message
is not received by
receiving process
sending process is
blocked until the
communication is
established
sending process is
blocked until the shared
memory is defined
shmat()
shmctl()
shmcreate()
many
one
Java's remote method
invocation
object to be written to a
byte stream
none
all of these
object to be written to a
file
remote procedure calls
17
Sr.
Question
40
Which two problems are faced by process creation method?
41
Which types of threads are managed directly by the operating

system?
42
43
44
45
46
47
48
49
50
51
52
53
Answer A
time consuming and
resource intensive
Answer B
time consuming and
resource starvation
Answer C
time sharing and
deadlock
Answer D
time consuming and
memory starvation
kernel threads
user threads
message threads
memory threads
entire process will block if

What is the problem if relationship between user level and kernel
a thread makes a
level threads is many to one?
computation
What is the problem if relationship between user level and kernel
overhead of data
level threads is one to one?
increased responsiveness
The benefits of multithreading include
to user
The interval from the time of submission of a process to the time of
tunaround time
completion is the ____ time.
time during which a
The criteria of waiting time in CPU scheduling includes
process executes
In which type of system turnaround time may not be best criteria for
real time system
CPU scheduling?
Process execution consists of ___________
cycles of CPU execution
To guarantee that all users get good service, _____ the maximum
minimize
response time.
When a process enters the ready queue, what is linked onto the tail
process control block
of queue?
What type of scheduling is first come first served?

a thread makes a blocking
system call
overhead of creating user
threads
resource sharing within
the process
Correct Answer
B
A

no problem
a thread makes an exit
overhead of starting
Operating system
overhead of creating
kernel threads
economy
all of these
throughput time
average time
wait time
time during which a

process does I/O
spends waiting in the

ready queue
all of these
interactive
time sharing
batch system
cycle of I/O wait
both A and B
none of these
maximize
average
none of these
process table
process identifier
free memory block
minimum wait scheduling
time sharing
batch system
both of these
none of these
nonpreemptive scheduling both of these
none of these
starvation
maximum output
nonpreemptive scheduling
sceduling
first come first served scheduling algorithm is troublesome for ____

real time system
interactive
systems
shortest job first scheduling algorithm cannot be implemented at the
short term CPU scheduling long term CPU scheduling
level of ______
54
shortest job first scheduling algorithm is
55
What is a major problem with priority scheduling?
unavailable I/O
unavailable memory
56
What criteria can be used to define priority in priority scheduling?
time limits,memory
requirements,the number
of open files, the average
of I/O burst to average CPU
burst
time limits,memory
time limits,memory
time limits,memory
requirements,the number
requirements, the average requirements,the previous
of processes in ready
of I/O burst to average CPU priority, the average of I/O
queue, the average of I/O
burst
burst to average CPU burst
burst to average CPU burst
57
What is the time quantum in case of round robin scheduling?

In round robin scheduling , if there are n processes in the ready
queue and time quantum is q What is the maximum waiting time for
a process until its next time quantum?
Which type of kernel is free from race conditions?
10 to 20 milliseconds
n-1
(n-1)xq
nxq
nonpreemptive
preemptive
both of these
none of these
58
59
unavailable CPU
18
Sr.
60
61
Question
preemptive kernel is suitable for which kind of process?
Which type of semaphores are known as mutex locks?
62
Deadlock avoidance require which information in advance?
63
64
65
Answer A
multiuser
counting
resources a process will
request and use during
lifetime
Answer B
interactive
infinite
Answer C
batch
binary
Answer D
real time
none of these
memory usage pattern
resources a process will

request
cannot avoid deadlock
printer
both of these
none of these
2,3
1,2,3,4
1,2,4
300000 120940
300041 110999
300940 120000
compile
run
execution
all of these
run time maaping from

virtual to physical
adddresses
resident operating
sytem,user processes
load time maaping from

virtual to physical
adddresses
resident operating
sytem,kernel processes
compile time maaping

from virtual to physical
adddresses
resident operating
sytem,loader
all of these
resident operating
sytem,compiler
Which of the following resource cannot be simultaneously shared by

read only files
several processes?
A deadlock can occur if which of the following conditions hold
1,2
simultaneously? 1. mutual exclusion 2. hold and wait 3.
nopreemption 4. circular wait
If program can logically access all addresses from 300040 through
300040 120900
420940(inclusive) then what value is hold by base register and limit
register?
Correct Answer
D
C
66
If the processs can be moved during its execution from one memory
segment to another , binding must be delayed until ____ time.
67
What is the role of memory management unit?
68
The memory is divided into which two partitions?
69
What is worst fit strategy to select a free hole from the set of
available holes in case of dynamic storage allocation problem?
allocate the first hole big

enough
allocate smallest hole
allocate contiguous blocks allocate largest hole
70
first fit and best fit strategies of memory allocation suffer from ____
external fragmentation
internal fragmentation
both of these
none of these
71
There is a memory allocation scheme with a hole of 18464 bytes. If a

processes requests 18462 bytes. Then 2 bytes are left with a hole if
exact requested block is allocated. This is called ___________
both of these
none of these
72
_____________ is a memory management scheme that permits the

physiacl address of a process to be noncontiguous.
paging
none of these
73
If a process needs npages plus 1 byte. It would be allocated n+1

frames, resulting in an _____ fragmentation of _____ frame.
internal,entire
external, last
internal,0
external,0
74
In memory allocation, segment 2 is 400 bytes long and begins at

location 4300. Reference to byte 53 of segment 2 is mapped onto
location ____
4300
4353
4302
4355
75
In which situation Direct access files are of great use?
For indirect access to small For immediate access to

amount of information
indirect information
For immediate access to

large amounts of
information
76
For what purpose access control list is used in operating system?
implement identity
dependent access
implement file list
For immediate access to

small amounts of
information
implement role dependent
implement group identity
access
19
Sr.
77
78
79
Question
Answer A
Answer B
Which command can be used in Linux to set priority in priority based
grep
egrep
scheduling?
indefinite blockage of low nonpreemptive scheduling
aging is the solution to which problem?
priority process in priority in First come first served
scheduling
scheduling
When a process creates a new process which two possibilities exist
in terms of execution? 1. parent continues to execute concurrently
1 and 3
1 and 2
with children 2. The parent waits until some or all of its children have
terminated. 3. The parent exits so children gets memory for execution
80
When a new process is created, which are the two possibilities in

terms of the address space? 1. The child process is a duplicate of the
1 and 3
parent process 2. The child process has a new program loaded into it.
3. The parent,child process are shifted to new memory area.
81
What is deferred cancellation in case of cancellation of a target

thread?
82
83
84
The target thread allows

itself an opportunity to
terminate init process
When fork() is used to create a child process, what is the pid for the random number greater
child process?
than 0
Which resources are deallocated by operating system when a
physical and virtual
process terminates?
memory
In which case parerent may terminate the execution of one of its
children? 1. The child has exceeded its usage of some of the
resources that it has been allocated. 2. The task assigned to the child 1,2,3
is no longer required. 3. The parent is exiting and the operating
system does not allow a child to continue if its parent terminates.
Answer C
Answer D
nice
cal
preemptive scheduling in
shortest job first
nonpreemptive scheduling
in shortest job first
2 and 3
1,2 and 3
1 and 3
1 and 2
1,2 and 3

terminate itself in an
orderly fashion
1

terminate memory
operations
1356

terminate I/O operations
open files
I/O buffers
all of these
1,2
2,3
1,3
loader
object module
none of these
a new shared memory

segment is created with
read permission.
user selects the location
where the shared memory
will be attached
a new shared memory

segment is created with
write permission
operating system selects
the location where the
shared memory will be
attached
a new shared memory

segment is created in
private memory are.
process selects the
location where the shared
memory will be attached
A and B
none of these
85
The assembler generates object modules for loader who is a

consumer in this?
assembler
86
What does IPC_PRIVATE in case of system call

shmget(IPC_PRIVATE,size,S_IRUSR|S_IWUSR)
a new shared memory

segment is created.
87
What is the meaning of NULL in the system call shmat(id,NULL,0)?
shared memory is
detached
Thread pools offer which benefit?
servicing a request with an A thread pool limits the

existing thread is usually
number of threads that
faster than writing to
exist at any one point.
create thread.
88
Correct Answer
20
Sr.
Question
89
What is the reason for CPU scheduling decisions?
90
91
92
93
94
95
96
In First come First serve scheduling policy, the burst time for
processes A,B,C is 24,3,3. burst time in milliseconds. If the processes
arrive in orser B,C,A - the average waiting time
The four processes A,B,C,D has burst time 6,8,7,3. burst time in
milliseconds. The average waiting time in case of simple shortest job
first scheduling algorithm is ____
The four processes A,B,C,D has burst time 8,4,9,5 and arrival time
0,1,2,3. burst time and arrival time in milliseconds. The average
waiting time in case of preemptive shortest job first scheduling
algorithm is ____
The four processes A,B,C,D has burst time 8,4,9,5 and arrival time
0,1,2,3. burst time and arrival time in milliseconds. The average
waiting time in case of nopreemptive shortest job first scheduling
algorithm is ____
The five processes A,B,C,D,E has burst time 10,1,2,1,5 and priority
3,1,4,5,2 respectively. burst time in milliseconds. The average waiting
time in case of priority scheduling algorithm is ____
If three processes A,B,C arrive at time 0 and length of the CPU burst
in milliseconds is 24,3,3 respectively and if the time quantum is of 4
milliseconds then average waiting time in round robin scheduling is
_____.
If time quantum is too large, round robin scheduling degenerates to
which scheduling policy?
Answer A
When a process switches
from running to waiting
state
Answer B
from running to ready
state
Answer C

all of these
from waiting to ready state
24 milliseconds
27 milliseconds
10 milliseconds
17 milliseconds
6 milliseconds
7 milliseconds
5 milliseconds
4 milliseconds
6.5 milliseconds
7 milliseconds
6 milliseconds
4 milliseconds
6.5 milliseconds
7 milliseconds
7.75 milliseconds
6 milliseconds
6.9 milliseconds
8.2 milliseconds
7.75 milliseconds
6.3 milliseconds
10 milliseconds
7.4 milliseconds
6.2 milliseconds
5.66 milliseconds
First come first served
shortest job first
priority
none of the above
design a protocol that the design a protocol that the design a protocol that the design a protocol that the
process can use to
process can use to access process can use to access process can use to access
cooperate
kernel thread
shared memory
CPU
97
What is a critical section problem?
98
In priority scheduling, if priorities range from 127(low) to 0(high) anf

if priority of waiting process is increased by 1 every 15 minutes, then 30 hours
how many hours will be taken for a priority 127 to reach to priority 0.
If short term scheduler takes 10 milliseconds to decide to execute a

process for 100 milliseconds then _____ percent of the CPU is being
used for scheduling the work.
The shared buffer is implemented in a circular array with two logical
100 pointer in and out. The variable in points to the next free position in
the buffer; out points to the first full position in the buffer. In which
situation buffer is full?
1
A Relation R is called Equivalence Relation if R is
99
Answer D
Correct Answer
32 hours
28 hours
24 hours
10%
9%
0.10%
0%
in = out
((in+1)%BUFFER_SIZE)=out buffer cannot be full
in + 1 =out
Reflexive
Symmetric
All of these
Transitive
21
Sr.
Question
Answer A
If domain and co-domain
are same
L+ = L*L
Answer B
If the range and codomain are same
L+ = L L*
Answer C
If the range and domain
are same
L+ = L*L*
Answer D
NFA
NFA
A function is called onto or surjective
For Language L following is not true
In which machine all of the moves for an alphabet must be specified? Finite Automata
Turing Machine is more powerful than Finite Automata because
Push Down Automata uses
Tape
Regular Grammar is subset of
Context Free Grammar
(00 + 01 + 10)(0+1)* represents
Strings of even length
Strings of Odd length
9
10
(00 + 01 + 10 + 11)* represents

The regular expression 0*1(0*10*1)* represents strings with

Even no. of 1s
Strings of Odd length

Odd no. of 1s
Strings not starting with

11
Strings starting with 00
Odd no. of zeroes
11
Finite Automata can not have
Accepting State
Starting State
12
A BC Rule is not allowed in
13
14
Terminal Symbols
L1 L2
(1 + 01)* (0 + )
16
Starting Symbol of a Grammar is subset of

Following is not a primitive operation of a Regular Language
The Regular expression for strings of 0's and 1's which have no pairs
of consecutive 0's is
The set of strings over {a, b}* that contain the substring aa is.
Context Sensitive
Grammar
Non Terminal Symbols
L1 L2
a(a*ba*b)*a*
17
The regular expression (a + b)* abb denotes:
all possible combinations set of all strings ending

of as and bs
with abb
18
Given two DFAs M1 and M2 They are equivalent if:
M1 and M2 has the same

number of states
15
19
20
Given a nite automata M =(Q, , , qo F), If maps Q x to 2Q

then:
Which of the following phase of compilation process is an optional
phase :
It has no finite state

control
It has the capabilities to

Tape movement is
remember arbitrary long confined to one direction
sequence of input symbols only
Correct Answer
None of these
All are true
All of these
None of these
Stack
Tree
Unrestricted Grammar
All of these
None of these
None of these
None of these
A
B
Transition Function
More than one transitions

for same input from a state
Regular Grammar
CNF
Alphabet
L1.L2
Language
L1*
B
D
(0 +10) *
(0 +11) *
None of these
(a)*(b+a)(b)
(aa + bb)*
(a + b)*aa (a + b)*
set of all strings starting

with and ending with abb
None of these
M1 and M2 has the same

number of final states.
M1 and M2 accepts the

same language i.e. L(M1)= None of these
L(M2)
M is NFA
M is DFA
M is NFA with -moves
None of these
Queue
Context Sensitive
Grammar
Lexical analysis phase
Syntax analysis phase
Code generation phase.
Code optimization phase
2 is odd or -3 is not
negative
2 is odd and -3 is not

negative
2 is even or -3 is not
negative
21
Which of the following statement is negation of the statement?
2 is even and -3 is not

negative
22
Which of the following are the aspects of the high level languages?
Ease of understanding
Naturalness
portability
All of Above
23
In a Finite State Machine, M = (Q,,,q0, A) transiVon funcVon is a

function which maps
QXQ
QXQ
QA
Q X q0
22
Sr.
32
Question
Answer A
In an NFA, M = (Q,,,q0, A) transiVon funcVon is a funcVon which
QXQ
maps
In an NFA, M = (Q,,,q0, A) transiVon funcVon is a funcVon which
QXQ
maps
Any language is accepted
By Kleens theorem we prove that
by FA
For two FAs M1 = (Q1,,1,q1, A1) M = M2 = (Q2,,2,q2, A2)
Only A1 is accepting State
accepting languages L1 and L2 If we find L1 L2 then
accepting languages L1 and L2 If we find L1. L2 then
q1 is starting State
accepting languages L1 and L2 If we find L1.L2 then
If f(x) = cos(x) and g(x) = x3 , then (f O g)(x) is
(cos(x))3
P q is logically equivalent to (here ~ is Negation Sign)
~q p
Let the classes of Languages accepted by finite state machines be L1
and the class of Languages represented by regular expressions be L2 L1 is subset of L2
then,
Tautology is
Always True
33
* of Finite Automata is
Transition Function
34
35
SS+S|S*S|a
Compile Free Grammar
PUSH
PEEP
39
Following is an Ambiguous Grammar

CFG stands for
In a Push Down Automata, Which of the following Stack operations
can not be performed on a particular move?
Recursive Languages are recognizable by
Minimum length of the string formed by Regular Expression (a+b)*
abac*(a+b)+
(a+b)* represents
Always False
Extended Transition
Function
S aSa |
Content Free Grammar
40
If the language L is Recursive language then L is finite or infinite is
24
24
25
26
27
28
29
30
31
36
37
38
Answer B
Answer C
Answer D
Q X Q2
Q X 2Q
Q X * Q
Q X Q2
Q X 2Q
Q X * Q
Any Regular Language is

accepted by FA
Any CFG is accepted by FA None of these
We must add new

Both A1 and A2 are
accepting States
accepting State
We must add new
Both A1 and A2 are
accepting States
accepting State
We must add new starting
q2 is starting State
None of these
State
cos (3x)
x3(cosx)
Cos(x3)
~p q
~p q
~p q
Correct Answer
B
D
B
A
D
D
L2 is subset of L1
L1 = L2
L1 L2 =
Partially True
None of these
Non Recursive Function
None of these
S aS |
None of these
None of these
A
C
POP
None of these
FA
NFA
NFA -
Turing Machine
Null String
All Strings of as and bs
String starting with a
None of these
Decidable
Un-decidable
Still an open question
None of these
41
Turing Machine cant solve Halting Problem is
True
False
Still an open question
None of these
42
If P = NP then
P and NPC are different
NP and NPC are different
P,NP and NPC are same
None of these
43
The Coloring Problem is
NP Hard Problem
NP Complete Problem
P Problem
None of these
44
Conversion from NFA to DFA is done by
Subset construction
Kleens Theorem
Minimization Algorithm
Cooks Theorem
45
46
Pumping Lemma is used to decide whether Language L is

Which of the following is true?
Context Free
(a+b)* = a*b*
Recursive
(a+b)* = (a*b*)*
Not a Regular
None of these
D
C
47
(1+0)*0 represents
String starting with 1
None of these
48
49
50
CFG : S SS+ | SS* | a , generates

CFG: S aSb | , generates language
The Regular Sets are closed under
Context Sensitive
(a+b)* = (a+b)(a+b)*
Binary number that are
multiples of 2(two).
Prefix Expression
(ab)n
Union
Postfix Expression
ab(a+b)*
Concatenation
Infix Expression
(a+b)*(ab)n
Kleens Closure
None of these
a nbn
All of Above
B
D
A
23
Sr.
51
52
53
54
55
56
57
58
59
60
61
Question
Answer A
Depend on present state
The output of a moore machine is
and present input
In a Context Sensitive Grammar, no. of Grammar symbols on the left Grammar Symbols on right
side of a Production cant be greater than the no. of
side
2 or more productions
A given grammar is called ambiguous if
have same non terminal
on the left hand side
Let L be a language recognizable by a Finite Automata, then reverse
Regular Language
of the language is a
The logic of Pumping Lemma is a good example of
The no. of Auxiliary memory required for a Push Down Automata to
behave as a Finite Automata is
A Push Down Automata behaves like a Turing Machine when no. of
Auxiliary memory it has is
Context Free Grammar is not closed under
For two regular languages L1 = (a+b)*b and L2 = b(a+b)*, then L1
L2 is given by
If L is a language recognizable by a Finite Automata then subset of
the Language is
Which of the following is not accepted by any deterministic Push
Down Automata?
Answer C
Depend only on present
input
Non Terminals on right
Terminals on the right side
side
A derivation tree has more Brackets are not present
than on associated
in the grammar
sentence
Context Sensitive
Context Free Language
Language
Divide & Conquer
Recursion
Technique
Answer D
Pigeon Hole principle
Answer B
Depend only on the
present state
Correct Answer
All of these
All of these
There is a sentence with

more than one derivation
tree.
Recursively Enumerable
Language
Iteration
Concatenation
Union
Complementation
Kleens
(a+b)*ab
ab(a+b)*
a(a+b)*b
b(a+b)*a
Regular Language
Context Sensitive
Language
Language
None of these
String ending in particular Strings in which a given

Even palindromes
symbol is present atleast
alphabet
twice
Atleast one of the set Si is Atleast one of the sets Si is Not more than on of the
a finite set
an infinite set
set Si can be finite
62
If S be an infinite set and S1 2 = S, then
63
A Grammar that produces more than one Parse tree for same
sentence is
Ambiguous
Unambiguous
Regular
None of these
64
Which of the following Regular Expressions denotes a language

comprising all possible strings over the alphabet (a,b)
a*b*
(a+b)*
(ab)+
(a+b*)
65
An Finite Automata can be considered to be a Turing Machine of

finite length
Rewinding capability and

unidirectional tape
movement
Rewinding capability and

bidirectional tape
movement
Without rewinding
capability and bidirectional
tape movement
66
Palindromes cant be recognized by any Finite Automata because
FA cant deterministically
fix the mid-point
Without rewinding
capability and
unidirectional tape
movement
FA cant remember
arbitrary large amount of
information
Both A and B
None of these
360
240
720
xyx
xyxyx
Undecidable
Interpretive
Non-determinstic
67
68
69
If = (a,b,c,d,e,f), then no. of string in of length 4 such that no

60
symbol is used more than once in a string is
If L = x*(x + yx), then which of the following is not a legal string within
yx
L?
If every string of a language can be determined, whether it is legal or
Decidable
illegal in finite time, the language is called
None of these
24
Sr.
70
71
72
Question
Can a DFA simulate NFA?
Regular Expression (a+b) denotes the set
Regular Expression (a+b)(a+b) denotes the set
Which of the following regular expression denotes zero or more
instances of a or b?
Answer A
No
{a}
{a,b,ab,aa}
Answer B
Yes
{, a,b}
{a,b,ba,bb}
Answer C
Sometimes
{a,b}
{a,b}
Answer D
Depends on NFA
{ab}
{aa,ab,ba,bb}
a+b
(ab)*
(a+b)*
a* +b
74
The automata is a ____ device and a grammar is a _____ device
generative,cognitive
generative,acceptor
acceptor,cognitive
cognitive, generative
75
The Regular sets are closed under

To accept strings with N characters the Finite Automata contains
minimum
Number of Articulation Points in a Rectangle is
For a simple connected graph G with n vertices and n edges(n>2),
which of the following statement are true?
73
76
77
78
Correct Answer
A
C
D
Union
Concatenation
Kleens Closure
All of these
N states
N + 1 States
N + 2 States
N -1 States
G has no cycles
G is a Spanning Tree
G has atleast one cycle
None of these
79
Finite State Machine can recognize
Any Grammar
Only Context Free

Grammar
Any Unambiguous
Grammar
Only Regular Grammar
80
S aSa | bSb | recognizes
Even Palindrome in (a,b)*
Odd Palindrome (a,b)*
Any Palindrome in (a,b)*
None of these
81
Match all items in Group 1 with correct options from those given in
Group 2. Group 1 :: P. Regular expression Q. Pushdown automata R.
Dataflow analysis S. Register allocation Group 2 :: 1. Syntax analysis
2. Code generation 3. Lexical analysis 4. Code optimization
P-3, Q-1, R-4, S-2
P-3, Q-4, R-1, S-2
P-2, Q-1, R-4, S-3
(1 + 01)* (0 + )
(0 +10) *
(11 +010) *
None of these
Lexical
(ab)*a
Regular Grammar
Multi-Tape TM
Type 0
Regular Grammar
Equivalent States
FA
Syntax
(a + b)*aa (a + b)*
CNF
Multi-Head TM
Type 1
Unambiguous Grammar
Unreachable State
NFA
Semantic
a*(a+b)*
Not a Regular Grammar
Universal TM
Type 2
Ambiguous Grammar
Finite States
NFA -
Code Generator
None of these
None of these
All of these
Type 3
None of these
None of these
None of these
None of these
None of These
82
83
84
85
86
87
88
89
90
Find a regular expression for strings of 0's and 1's which have no
pairs of consecutive 0's.
Which phase detects and ignores the comments?
The set of strings over {a, b} that contain the substring aa.
The Left Linear Grammar is
Modification of Simple Turing Machine(TM) can be done by
Regular Grammar is
Dangling else is a phenomenon related to
For minimization of Finite Automata we find
Any Regular Expression is easily converted to
91
-closure (Null Closure) of a state in NFA - contains
The state itself
All states obtained from Both A and B

transitions from the state
92
(11+101)(1+0)* represents

and 101
String starting either with Strings always starting

11 or 101
with 11
93
f:R+ R, f(x) = x2 function is
Both onto and one-toone Not onto but one-to-one
onto but not one-to-one
94
f:R+ R+, f(x) = x2 function is
Both onto and one-toone
Not onto but one-to-one
onto but not one-to-one
95
If NFA contains n states then by subset construction the equivalent

DFA contains maximum of
n 2 states
2n states
n 3 states
Neither onto nor one-toone

Neither onto nor one-toone
2n states
A
B
A
D
D
C
C
B
A
B
25
Sr.
96
Question
Recursively Enumerable Grammar falls in
97
For simplification of CFG following can be done
98
In case of Turing Machine(TM) by reading input x, TM
99
Recursively Enumerable Languages are
100
Any language generated by a Unrestricted Grammar is
Answer A
Type 0
Answer B
Type 1
Eliminate not reachable
Eliminate Null Production
Variables
May go to halt-non final
May go to infinite loop
state
Always recognizable by
A proper subset of CFLs
PDA.
Regular Language
Language
Which of the following properties of Recursively Enumerable sets are

Emptiness
decidable?
Only Context Free
102 Finite State Machine can recognize
Grammar
Travelling Salesman
103 Which of the following problem is not NP-Hard?
Problem
In a Grammar : S aSa | bSb | For recognizingstring abba the
104
2
number of productions used are
101
Answer C
Type 2
Answer D
Type 3
Eliminate Unit Production All of these
Correct Answer
A
D
May go to halt-final state
All of these
Also called type-0

languages
All of these
None of these
Finiteness
Regularity
None of these
Only Regular Grammar
Any unambiguous
Grammar
Any Grammar
0/1 Knapsack Problem
Graph Coloring
None of these
None of these
Depends on DFA
Checking string ending

with some alphabets
Depends on NFA
105
Finite Automata do not find application in
Syntax Checking
Recognition of Tokens
106
NFA can be simulated by a DFA. The statement is
True
107
Universal Turing Machine influenced the concept of
Stored program
computers
False
Interpretive
implementation of
programming language
108
Following is not a proof method
Contradiction
Contra-positive
Recurrence
109
Finite Automata is a particular case of NFA. The statement is
False
True
Partially true
110
In NFA, a particular state can have
Zero Transition on an
alphabet
One Transition on an
alphabet
More than One Transition

All of above
on an alphabet
111
112
(00+11+01+10)* represents
For the language (00)*(11)* drawing/designing ____ is easier.
Strings of odd length

FA

NFA
Strings starting with 00

NFA -
Strings ending in 10
Universal TM
113
Which of the following is not true with respect to regular expression? (a+b)* = (b+a)*
(ab)* = a*b*
(ab+ba)* = (ba+ab)*
(a+b)+ = (a+b)(a+b)*
114
Shift operation
Reduce Operation
Both A and B
None of these
Variables
Start Symbol
Non Terminal Symbol
Terminal Symbol
Strings with Balanced

Brackets
NFA -
Bottom Up Parsing have

With respect to Grammar, Following is the part of actual string of a
115
Language
116
Grammar: S [S] | {S} | SS | represents
Strings with symbols
117
L={xcxr / x (a,b)* } can be recognized by
FA
Strings with Unbalanced

Brackets
NFA
118
A function f is called bijection if f is
onto
surjective
119
0(1+0)*0 represents all strings
Starting with 0
Ending in 0
Computability
All of these
Principle of Mathematical
Induction
Depends upon NFA
C
Strings like {SSSS}
Push Down Automata
Both onto and surjective
None of these
Contains substring 00
Starting with and ending in

0
26
Sr.
Question
Total no. of substrings of the letter TOC (without considering NULL)
120
equal to
1
The depth of a complete binary tree is given by
Which of the following sorting algorithm is of divide-and-conquer
2
type?
The time factor when determining the efficiency of algorithm is
3
measured by
Answer A
Answer B
Answer C
Answer D
Dn = n log2n
Dn = n log2n+1
Dn = log2n
Dn = log2n+1
Bubble sort
Insertion sort
Quick sort
All of above
Counting microseconds
Counting the number of

key operations
Counting the number of

statements
Item is not in the array at

all
Item is the first element
O(n)
O(log n)
O(n2)
Counting the kilobytes of

algorithm
Item is the last element in
the array or is not there at
all
When Item is the last
element in the array or is
not there at all
O(n log n)
max (f (n) ,g (n))
min (f (n) ,g (n) )
f (n) + g (n)
f (n) x g (n )
A1
A2
A3
A4
log n
n2
nn
log n
nn
n2
Dijkstra's algorithm
Floyd's algorithm
Prim's algorithm
Warshall's algorithm
O(m)
O(n)
O(m + n)
O(log(m) + log(n))
Dynamic programming
Backtracking
Divide and conquer
Greedy method
A-2 , B-4 , C-1, D-3
A-3 , B-4 , C-l , D-2
A-3 , B-4 , C-2 , D-1
A-4 , B-1 , C-2 , D-3
log(n)
n/2
log(n/2)-1
best case: O(n) worst

case: O(n*n)
best case: O(n) worst case: best case: O(1) worst

O(n*log(n))
case: O( n )
best case: O(n*log(n))

worst case: O(n*n)
The Worst case occur in linear search algorithm when
Item is somewhere in the

middle of the array
The Average case occur in linear search algorithm
When Item is somewhere When Item is not in the

in the middle of the array array at all
The complexity of Bubble sort algorithm is

An algorithm is made up of 2 modules Ml and M2. If order of M1 is
f(n) and M2 is g(n) then the order of the algorithm is
There are 4 different algorithms AI, A2, A3, A4 to solve a given
problem with the order Iog(n), log(log(n)), nIog(n) ,n / log(n)
respectively. Which is the best algorithm?
The time complexity of an algorithm T(n), where n is the input size, is
given by T( n) = T( n -1) + (1/n) if n > 1 The order of this algorith
7
8
9
10
11
12
13
14
15
16
The running time of an algorithm is given by T(n) = T(n -1) + T(n -2) T(n -3), if n > 3 n, otherwise.
Which of the following algorithms solves the all-pair shortest path
problem?
For merging two sorted lists of sizes m and n into a sorted list of size
m + n, we require comparisons of
Which of the following algorithm design technique is used in the
quick sort algorithm?
The correct matching for the following pairs is (A) 0/1 Knapsack (B)
Quick sort (C) Minimum weight (D) Connected Components (1)
Greedy (2) Depth-first search (3) Dynamic programming (4)
Divide and conquer
In the worst case, the number of comparisons needed to search a
single linked list of length n for a given element is
For the bubble sort algorithm, what is the time complexity of the
best/worst case? (assume that the computation stops as soon as no
more swaps in one pass)
Correct Answer
When Item is the last

element in the array
B
D
A
C
17
When we say the order of a tree is M, we mean
Every non-leaf node must Every non-leaf node must Every non-leaf node can
have M subtrees
have M keys
have at most M subtrees
The Height of the tree is

M.
18
Worst case Time Complexity of Merge Sort is
O(n2)
O(n2 log(n) )
O(n log(n) )
O(2 log(n) )
27
Sr.
Answer C
Answer D
n*(n-1)/2
n -1
3n
n3
3
Halting Problem
best case: O(n log(n) )
worst case: O(n2)
Parallel Edges
24
N-Queens Problem can be solved easily by
Dynamic Programming
Backtracking Method
Greedy Method
25
26
Max Heap Tree has following Property.

Heap Tree is
Right Child > Parent

Complete Binary Tree
Both Children > Parent

Cyclic Graph
Both Children < Parent

3-way Search Tree
27
Dynamic Programming Method is not suitable to solve
0/1 Knapsack Problem
Making Change Problem
Binomial Co-efficient
2
All of Above
best case: O(n2) worst
case: O(n2log(n) )
Cut Vertex
Divide and Conquer
Method.
None of above
Forest
Fractional Knapsack
Problem
A
A
23
Question
Answer A
Answer B
The number of edges in a Minimum Spanning Tree of a connected
n log(n)
n!
Graph G with n vertices is
Time Complexity of Tower of Hanoi Problem (Recursive) with n disks
n2
2n
is
Total Degree of a Triangle is
6
4
Travelling Salesman Problem is
NP Problem
P Problem
For the Quick sort algorithm, what is the time complexity of the
best case: O(log(n)) worst best case: O(n2) worst
best/worst case?
case: O(n2)
case: O(n log(n))
A Bi-connected Graph Certainly does not contain any
Cycle
Path
28
Krushkals Algorithm uses
Greedy Method
NP Problem is
Polynomial Problem
19
20
21
22
22
29
30
31
32
33
34
35
36
For a same problem If Time Complexity of Recursive algorithm is x

and Time Complexity of Iterative algorithm is y, then
for(i=1 ; i<=n ; i++) printf(**) ; The above C code has Time
Complexity of
Binary Search Method has Worst Case Time Complexity of
The number of ways to multiply 4 Matrices in a Chained Matrix
Multiplication
Worst case Time Complexity of Linear Search is
Breadth First Search method uses
Minimum no. of states to Search/Recognize string nano with Finite
Automata is
Divide and Conquer

Method.
Non Deterministic
Polynomial Problem
C
D
B
C
A
D
Dynamic Programming
Branch & Bound Method
Easy to Solve problem
All of Above
x <y
x >y
x=y
can not be said
log(n)
n log(n)
2n
nlog(n)
log(n)
n*n
O(n)
Stack
O(log(n))
Queue
O(1)
Hash Table
O(nlog(n))
None of these
A
B
37
Following is a NP Problem related to Graph
To find Longest Path
To find Shortest Path
38
The Principle of Optimality is used in
Greedy Method
Backtracking
To find Minimum
Spanning Tree
Dynamic Programming
39
Worst case Time Complexity of Multiplication of two n X n Matrix is
n2
n 2log(n)
40
n2
42
Worst case Time Complexity of Addition of two n X n Matrix is

The running time of the following sorting algorithm depends on
whether the partitioning is balanced or unbalanced
The average case complexity of Insertion Sort is
43
44
45
41
Correct Answer
To find a Cycle
Branch & Bound
n log(n)
n3
n 2log(n)
n log(n)
n3
Insertion sort
Selection Sort
Quick Sort
Merge Sort
O(2n)
O(n2)
O(n3)
O(2n)
The spanning tree of connected graph with 10 vertices contains
9 edges
10 edges
11 edges
11 vertices
Worst case Time Complexity of Heap Sort Algorithm is

In a heap tree bottom level should be filled
O(log(n))2
From left to right.
O(n)
From right to left.
O(n2)
Completely.
O(nlog(n))
None of these
D
A
28
Sr.
46
47
48
49
50
51
52
53
Question
The height of heap tree of N data is
A sorted array in ascending order is
Which of the following algorithm do not have a time complexity of
O(n2)
Consider the Array: 26, 35, 11, 49, 54, 30, 80. How array will look like
after 2 (two) iterations of Bubble Sort?
In a Selection Sort of n elements, how many times is the swap
function called in the complete execution of the algorithm?
Which of the following sorts have a O(n log(n)) Worst case
performance?
An hash table with chaining as a collision resolution technique
degenerates to a
Consider the following statements. I. An algorithm is a no. of steps to
be performed to solve a problem. II. To a given problem there may be
more than one algoritm.
Answer A
O(N)
MAX Heap
Answer B
O(N log(N))
MAX Heap
Answer C
O(log(N) )
Not a Heap Tree
Answer D
O(2N)
None of these
Bubble Sort
Shell Sort
Radix Sort
Quick Sort
26, 11, 35, 49, 54, 30, 80
26, 11, 35, 49, 30, 54, 80
11, 26, 35, 30, 49, 54, 80
None of these
n-1
n log(n)
n2
Insertion Sort
Quick Sort
Heap Sort
None of these
Stack
Queue
Linked List
Tree
Only I is correct
Only II is correct
Both I and II are false
Both I and II are correct
Both Validating the

algorithm and Evaluating
the Complexity
None of these
None of these
None of these
None of these
None of these
None of these
O(n2 )
O(Cn), where C is a
constant
54
Analyzing of an algorithm involves
Evaluating the complexity Validating the algorithm

only
Only
55
The running time of an algorithm means
No. of Primitive
56
f(n) = (g(n) ) is
57
f(n) = (g(n) ) is
58
f(n) = O (g(n) ) is
59
f(n) = (g(n) ) implies
60
T(n) = 2 T(n/2) + k.n , where k is constant, then T(n) is equal to
O(n log(n))
O( log(n) )
Time taken by the

algorithm on a particular
input size.
g(n) is asymptotic lower
bound for f(n)
bound for f(n)
bound for f(n)
f(n) = O (g(n) ) and f(n) =
(g(n) )
O(n )
61
Time Complexity of Recursive Fibonacci algorithm is
O(n2)
O(n3)
O(n2 log(n) )
62
63
64
65
66
67
Assume the input array is nearly sorted. Then performance of Quick

sort is
At least how many comparisons are required for merging two sorted
lists of n elements each?
Which of the following data structure may be used to aid
implementation of radix sort?
What is the preferred form of representation of Dense graph?
What is the running time of an efficient algorithm to find an Euler
Tour in a graph if one exists?
Following Problem(s) is NP Complete
g(n) is asymptotic upper

bound for f(n)
bound for f(n)
bound for f(n)
Time taken on a Standard

Computer to execute the
program
g(n) is asymptotic tight
bound for f(n)
bound for f(n)
bound for f(n)
f(n) = O (g(n) ) only
f(n) = (g(n) ) only
Correct Answer
B
Better than Average case Worst than Average case
Same as in Average case
None of these
2n -1
n-1
2n+1
Stack
Heap
Binary Search Tree
Queue
Adjacency Matrix
Adjacency List
Incidence Matrix
None of these
O( |V| )
O( |E| )
O( |V| |E| )
O( |V|2 )
Vertex Cover
SAT(Satisfiable)
K-Colouring
All of these
29
Sr.
68
Question
Graphs are represented using
69
Infinite recursion leads to
70
The running time for creating a heap of size n is
71
72
73
74
75
76
77
78
79
80
Answer B
Adjacency linked list
Underflow of registers
usage
O (log n)
Answer C
Adjacency Graph
O (n log n)
Answer D
Adjacency Queue
Underflow of run-time
stack
O (n2)
Recursive procedures are implemented by using ____ data structure. Queues
Stacks
Linked Lists
Strings
A technique for direct search is

For an undirected graph with n vertices and e edges, the sum of the
degree of each vertex is equal to
Which of the following sorting methods would be most suitable for
sorting a list which is almost sorted
A BST is traversed in the following order recursively: Right, root, left.
The output sequence will be in
Quick sort is also known as
Binary Search
Linear Search
Tree Search
Hashing
2n
(2n-1)/2
2e
e 2 /2
Bubble Sort
Selection Sort
Quick Sort
Merge Sort
Ascending order
Descending order
Bitomic sequence
No specific order
merge sort
heap sort
None of these
bubble sort
f(n) x g(n)
Max ( f(n),g(n))
Min (f(n),g(n))
f(n) + g(n)
O(n2) time
O( log n ) time
O(n log n ) time
O(n)
O(e2)
O(n2)
Linear lists of Records
Binary Search Tables
Binary Search Trees
O(n)
O(m+n)
O(log(m) + log(n ))
n3
nn
O(n3) < O(n2log(n) )
O(log(n) ) < O(n)
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
Answer A
Adjacency tree
Overflow of run-time
stack
O (n)
The goal of hashing is to produce a search that takes

O(1) time
The time required to find shortest path in a graph with n vertices and
O(e)
e edges is
Search tables used by compilers for efficient searching generally use
Hash Tables
Overflow of I/O cycles
83
For merging two sorted lists of size m and n into a sorted size of m+n,
O(m)
we require comparisons of
The running time T(n) is given as T(n) = c + T(n-1) , if n >1 = d , if n<=1
n2
The order of the algorithm is
Which of the following shows the correct relationship?
O(nlog(n) ) < O(n)
84
Breadth First Traversal (BFS) is a method to traverse
Graph using shortest

path
85
The way a card game player arranges his cards as he picks them up
one by one , is an example of
Bubble Sort
O(2n) < O(n2 )

All successors of a visited
node before any
successors of any of those
successors
Selection Sort
86
The concept of Order (Big O) is important because
It can be used to decide

the best algorithm that
solves a given problem
It determine the Maximum It is the lower bound of

space occupied by the
the growth rate of the
algorithm
algorithm
87
88
The common implementation of a heap is

The depth-first search
Array
Uses a queue
89
For NP-Complete problem
Several Polynomial time

algorithms are available.
Linked List
Uses a stack
Polynomial Time
algorithms are not exist,
hence can not be
discovered
81
82
Correct Answer
B
A
A
A single path of the graph

None of these
as far as it can go
Insertion Sort
Merge Sort
None of these
Multilinked Structure
Searches a tree
Doubly Linked List

Searches a linked list
A
B
No Polynomial Time
algorithm is discovered
yet
None of Above
30
Sr.
90
Question
If P(n) = n2 then what is correct?
Answer A
P(n) = n3
91
An algorithm
Is a finite set of
instructions
92
Which of the following is type of amortized analysis?

Divide and Conquer is a general design paradigm does not consist
the following part
93
94
f(n) =n2 , g(n) = n3 ,then which of the following is not correct?
Answer B
P(n) = n4
Answer D
All of the above
Correct Answer
All are correct
Aggregate Method
Answer C
P(n) = n2
Zero or more quantities
Any well defined
are externally supplied
computational procedure and at least one quantity
is produced.
Accounting Method
Potential Method
All of these
Divide
Recursion
Iteration
Conquer
g(n) = (n)
g(n) = O(n2)
g(n) = O(n3)
g(n) = (f(n))
Objective function
Selection function
All of these
Exponentiation
Binary Search
Branch & Bound

Backtracking
Backtracking
None of these
A
B
96
In the division method for creating hash function, which of the

following hash table size is appropriate?
Greedy Algorithms have following characteristic.
97
Divide and Conquer method is not suitable to solve Problem like
Merge Sort
98
99
Chained Matrix Multiplication can be solved by

Longest Common Subsequence Problem can be solved by
What is the minimum number of Stacks of size n required to
implement a Queue of size n?
Maximum number of edges in a n node graph is
Level Ordered Traversal of a Rooted Tree can be done by starting
from the root and performing
Which of the following Pairs of traversals define Binary Tree
uniquely?
The Time Complexity of finding Transitive Closure of a Binary
Relation on a set of n elemtns is known to be
In a binary max heap containing n elements, the smallest element
can be found in
Which of the following sorting algorithm has minimum worst case
time complexity?
Which of the following is not a Graph Traversal technique?
Greedy algorithms have following characteristics
Divide & Conquer cant solve Problems like
Chained Matrix Multiplication problem can be solved by
Longest Common Subsequence Problem can be solved by
If there is an NP-Complete Language L whose Complement is in NP,
Then the Complement of any Language in NP is in
Both P and NP are closed under the operation of
Binary Search method uses as input
Which of the method is used to solve Recurrences?
Applying Krushkals algorithm to find Minimum Spanning Tree is
more suitable for
Dynamic Programming
Greedy Method
Feasible solution
Finding Minimum
Spanning
Greedy Method
Dynamic Progamming
n(n-1)/2
n2
n 2 log(n)
n+1
In-order traversal
Preorder traversal
Breadth First Search
Depth First Search
Pre-order and Post- order In-order and Pre-order
Level order and Postorder
None of these
O (n3)
O (n)
O (n2 log n)
O (n2)
(1 )
(n )
(log(n) )
(nlog(n) )
Selection Sort
Bubble Sort
Quick Sort
Merge Sort
In-order Traversal
Objective function
Merge Sort
Greedy Method
Greedy Method
BFS
Feasible solution
Exponentiation
Dynamic Programming
Divide & Conquer
DFS
Selection Function
Minimum Spanning Tree
Backtracking
Dynamic Programming
None of These
All of these
Binary Search
None of these
None of these
A
D
B
B
C
NP
Both A and B
None of these
Union
Unsorted Array
Substitution Method
Intersection
Linear Linked List
Recursive Tree Method
Concatenation
Sorted Array
Master Method
Kleenes
Hash Table
All of these
A
C
C
Sparse Matrix
Dense Graph
Sparse Graph
None of these
95
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
31
Sr.
Question
Applying Prims algorithm to find Minimum Spanning Tree is more
117
suitable for
118 Algorithm analysis is useful for finding
Answer A
Answer B
Answer C
Answer D
Sparse Matrix
Dense Graph
Sparse Graph
None of these
Space Complexity
Time Complexity
Correctness
All of these
None of these
None of these
119
There must be
there should be the direct
Which of the following is not the required condition for binary search
mechanism to delete or
access to the middle
The list must be sorted
algorithm?
insert elements in the list element in any sublist
120
In Hamiltonian Cycle for n vertices, we
121
Preconditioning term is used with
Can visit to same vertex

two times
Linked List
122
Min-max Principle is used for
Gaming
123
The approach used by linear search is

Greedy
One NP-Complete Problem can be reduced to another problem of NP
124
Polynomial Time
in What time?
Which of the following functions are often referred as exponential
125
2n, log(n)
growth function?
126
Branch & Bound Technique uses
127
Simple Merge merges

In Dynamic Programming after table is created of m rows and n
128
columns, finding a particular solution takes order of
129 Feasible Solution in Greedy Method is
130 Which of the following is not a property of algorithm?
Cant visit same vertex

more
Dequeue
Finding Minimum
Spanning Tree
Divide & Conquer
Can omit one vertex
Correct Answer
Graph
Priority Queue
Finding Non Leaf Node
Divide and Conquer
Probabilistic
Brute-Force
Exponential Time
Linear Time
Logarithmic Time
2n, n!
n!, nlog(n)
n!, log(n)
Lower Bound
Upper Bound
Two sorted array
Two unsorted array
Both Lower Bound &

Upper Bound
Two Trees
log(m)
m*n
Satisfying constraints
Finiteness
Always optimal
Effectiveness
None of these
None of these
m+n
n2
Not a solution
Unambiguousness
C supports bit-wise
operators
None of these
None of these
A
D
All of the above
C is middle level language
C has no I/O statements
Which of the C operator finds the remainder of integer division?
None of the above
Which of the following symbol is permitted in C variable name?
- (hyphen)
_ (underscore)
& (ampersand)
| (pipe)
What is true for the following C statement? extern int x;
It is definition
It is function declaration
it is declaration
It is error
None of the above

128 bits
All are correct
None of the above
double words
||
bitwise &
None of the above
char
None of the above
32
A
A
B
C
B
A
A
A
A
B
A
5
6
7
8
9
10
11
12
13
14
15
Which of the following is character constant in C?

The size of long double in ANSI C is
Which of the following is not valid?
Which is correct format specifier for long integer?
The sizeof operator gives the size of data in
Which of the following is not a logical operator in C?
Which of the following is not an unary operator in C?
Trigraph character in C starts with
Which is the best data type for 8-bit integer?
The range of 'unsigned char' in C is
What is the value of C expression 16 >> 2?
'1'
32 bits
long int
%ld
bits
!=
sizeof
??
short int
0 to 128
4
"1"
64 bits
long float
%li
bytes
!
!
$$
unsigned short int
0 to 255
8
1
128 bits
long double
Both A and B
words
&&
~
##
unsigned char
-128 to +127
16
32
Sr.
16
17
18
Question
Which of the following is not a valid floating point constant?
Which of the following character constant is used for bell?
Which of the following is not a valid variable name in C?
Answer A
-4.5
'\f'
max1
19
Value of which type of C variable can be changed by external source? auto
Answer B
78
'\r'
max$
Answer C
3.15
'\a'
max_1
Answer D
All are valid
None of the above
max_high
Correct Answer
B
C
B
extern
static
volatile
10
None of the above
error
do-while
do-while
bit-fields
, (comma)
Object based
0 or 1
0
()
getche()
break
Both A and B
#
assigning pointer to same
type
*int a;
void
None of the above

All
All
bitwise operators
All are operators
None of the above
User defined
Can't say
None of the above
All
newline
None of the above
?
B
C
C
D
A
A
A
C
B
A
C
C
B
All are possible
int a*;
auto
B
C
21
22
23
24
25
26
27
28
29
30
31
32
33
What is the value of x after executing following statement? x = (a=5,

15
b=10, a+b);
What is the output of printf("%d",'A'); ?
Character A
Which loop executes at least once?
for
Which of the following loop is an exit control loop?
for
Which of the C feature indicates it is middle level language?
structure
Which of the following is not C operator?
sizeof
C is ................ Langauge.
Procedural
The array index in C starts from
0
For C array, int a[5] = {23,45}, the value of a[3] is
23
............. Operator is used to access the structure member in C.
=
Which C function is appropriate for inputting a string?
gets()
C uses ................ Statement to separate the cases in switch?
; (semicolon)
Which of the following is an example of infinite loop?
for( ; ; ) { }
A string always ends with .............
$
34
Which of the following operation can not be performed on pointer?
adding two pointers
35
36
Which of the following is correct pointer declaration in C?

if function does not return value, its return type is
Which of the following variable type is used to retain value even
after function is over?
int pointer a;
int
ASCII value of A
while
while
union
. (dot)
Object oriented
1
45
. (dot)
getch()
continue
while(1) { }
Null ('\0') character
adding an integer to
pointer
int *a;
none
local
auto
static
All of the above
20
37
38
Which of the variable type is accessible to all the functions in a file?
local
register
static
global
39
40
The logical end of C program is

Which of the following C data type allocates memory in bits?
None of the above

array
A
A
Dynamic memory allocation in C means
End of last function

union
Allocating memory at
compile time
group of variables of
different types
depends on input
bit-fields
41
End of main()
structure
Allocating memory at run
time
group of variables of same
types
Both A and B
None of the above
group of integer types
None of the above
ampersand (&)
dot (.)
arrow (->)
Any of the above
Logical
Character array
declaring a function
return type
a group of variables
*x
Relational
Ends with NULL
defining a function
name of function
a variable
%x
Bit-wise
Stored as ASCII values
calling a function
parameters
same as structure
&x
Arithmetic
All of the above
All of the above
All of the above
None of the above
!x
A
D
B
D
A
C
42
43
44
45
46
47
48
49
A structure in C is
Which of the following operator is used to access structure member
if pointer to structure is used?
The && is ................ Operator.
What is true regarding C string?
Writing a prototype of a function is same as
The function header includes
An union in C is
Which of the following represents the address of variable x?
33
Sr.
Question
Answer A
If x is declared as an integer pointer, which of the following
x = &a;
incorrect?
Assume that p1 and p2 are structure variables of same type, which of
p1 = p2
the following is valid operation?
Answer B
Answer C
Answer D
Correct Answer
x = NULL;
x = 0;
x = 3456;
p1 = = p2
p1 != p2
All are valid
52
Which of the following variable type is not accessible to other files?
global
static global
Both A and B
None of the above
53
Which of the following variable has life same as local variable?
global
static
register
None of the above
Both A and B
None of the above
str + "Hello";
All are valid
50
51
54
Which is true for a function in C?
It must return a value
It must have at least one

parameter
55
Assume that a string is defined in C with name str, which of the

following is valid operation?
str = "Hello";
strcpy(str, "Hello");
56
A pointer variable stores
value like simple variable
57
What is true regarding following declaration? int **p;
It is pointer to pointer
58
Which of the following specifier is used in C to read number in Hex?
%u
59
60
By default, the number is ................ in given field width.

Which of the following is not a C keyword?
left-justified
main
61
What is true regarding switch statement?
62
Which one of the following C statement differs from others in effect? x++
x += 1
63
Which of the following operation is not valid for float data type?
%=
64
Why type casting is used?
to convert data type
65
66
67
address of another
variable
It can store address of an
integer variable
Both A and B
None of the above
It can store address of a

pointer to an integer
Both A and C
%o
%x
%h
centre-justified
int
default case must be
present
User defined
register
A
A
None of the above
x = +1
x=x+1
&&
<=
*=
to create new data type
to convert data to desired

All of the above
form for use in expression
/*-+=
+-*/=
*/+-=
false
always evaluated
None of the above
false
always evaluated
None of the above
right-justified
auto
use any variable with
All cases must have break
switch
In which order, following C expression is evaluated? z = x - y + c / 2 *

-+/*=
e;
Right side expression of || operator is not evaluated, if the left side
true
expression is
Right side expression of && operator is not evaluated, if the left side
true
expression is
68
What is similarity between structure and enum in C?
Both defines new values
both define new pointers
Both defines new data

types
None of the above
69
Which of the following statement is correct?
bit-fields are allowed

inside structure only
bit-fields are allowed

inside union only
Both A and B
None of the above
70
if a structure inside structure is used, it is called
nested structure
recursive structure
self-referential structure
Any of the above
71
If a structure contains variable of itself as member, then it is called
nested structure
recursive structure
self-referential structure
Any of the above
34
Sr.
72
Question
Which function is used to deallocate the memory?
Consider following C statements int *p; p = (???) malloc(100); The
??? Is replaced with which of the following?
malloc() allocates memory in terms of .
How many bytes are used by near pointer in DOS?
How many bytes are used by far pointer in DOS?
If p is an pointer to integer, which of the following increments the
value of variable pointed by p?
Consider the following C statements. int y=50; const int x=y++;
printf("%d\n", x); What is output?
Consider the following C statements. int y=50; const int x=++y;
printf("%d\n", x); What is output?
Answer A
delete()
Answer B
remove()
Answer C
deallocate()
Answer D
free()
int
int *
int **
int &
words
2
2
bits
4
4
bytes
8
8
double words
16
16
C
A
B
(++*ptr)
(*ptr++)
Both A and B
None of the above
50
51
error
None of the above
50
51
error
None of the above
80
If str1 and str2 are same, what is return value of strcmp(str1,str2);
-1
Error
81
If str1 lexically comes before str2, what is return value of

strcmp(str1,str2);
-1
Error
82
What will be output of following? for(i=0;i<10;i++); printf("%d ",i);
0123456789
10
Error
None of the above
83
What will be output of following? for(i=0;i<10;); printf("%d ",i);
0123456789
10
0000000000
No output as printf never

execute
Hello
Fine
Compile error
HelloFine
max(x, max(y,z));
max(max(x,y),z);
max(max(x,y),max(y,z));
All of the above
exch(x,y);
exch(&x,&y);
exch();
exch(5,y);
ptr is a function returning ptr is a pointer to function ptr is a function returning

an integer
returning an integer
a pointer to integer
None of the above
Hello
Hello World
Hello World
Hello World
printf("\n");
printf("\\n");
printf("\n\");
printf("/n");
reserve word
library function
user defined function
All of the above
18
None of the above
None of the above
None of the above
All of the above
73
74
75
76
77
78
79
84
85
86
87
88
89
90
91
92
What would be output of following? int x = 5; If (x = 5)

printf("Hello"); else printf("Fine");
if function max() finds the maximum of two numbers, which of the
following determines maximum of three numbers?
For the following function prototype, which of the call is correct?
void exch(int *, int *);
What is the meaning of following statement? int *ptr(a,b);
What would be the output of following statements? char str[] =
"Hello\0World"; printf("%s",str);
Which of the following prints '\n'?
What would be the output of following statements? char str[] =
"\0World"; printf("%s",strlen(str));
The main() in C is
In C expression (5/10)*(f - 32), if f = 50, what would be value of
expression?
93
Which of the following is true regarding break statement?
used to break block
used to break the loop
94
The life of local variable declared in main() is same as
95
Which of the following is true for C array?
local variable
All the elements are of
same type
static variable
Array name is an address
of first element
used to return from

function
global variable
Array index starts from 0
Correct Answer
D
35
Sr.
Question
Which of the following declaration is true for "array of 5 pointers to
96
char"
When an array is passed as argument to function, what is actually
97
passed?
How many bytes are occupied in memory by following string? char
98
str[]="Computer";
99
if for a scanf("%s",str); input is "Hello World", the str stores
100 How can we declare generic pointer in C?
Answer A
Answer B
Answer C
Answer D
char **ptr[5];
char *ptr[5];
char (*ptr)[5];
None of the above
All the elements
only first element
address of first element
None of the above
10
11
Hello
Not possible
Hello World
generic *ptr;
World
NULL *ptr;
NULL
void *ptr;
A
D
101
dangling pointer
dealign pointer
null pointer
nomemory pointer
#define
const
enum
Any of the above
If a pointer points to memory location which deallocated, it is called
Consider the following C statements. enum COLOR {RED, BLACK,

GREEN, BLUE}; What would be the value of GREEN?
Which of the following is best to define multiple named constants in
103
C?
102
104
Which of the following results into an error in C?
105
Defining a local variable

Defining a local and a
inside a function with same Defining a global variable
global variables with same
name as function
as static
name
argument
All are correct
All are incorrect
None of the above
occupies memory equal to

It is a group of variable
size of its largest member
None of the above
1234
24
135
12345
1234
135
13
12345
64
128
256
argument control
argument count
argument counter
Operating system
dependent
None of the above
x = *p + 1;
*p = *p + 1;
(*p)++;
All of the above
counts from 0 to 9
counts even values in

counts odd values in array
array
counts zero values in array
file
if x is 6, (y = = 4) is not
evaluated
evaluated
program
if x is 4, (y = = 4) is
evaluated
evaluated
function
Both (x > 5) and (y = = 4 )
are evaluated always
Both parts of && are
always evaluated
108
For C expression x = y = 10; which of the following order is true?
x = y, y = 10
y = 10, x = y
x = 10, y = x
109
Which of the following is not valid for C union?
It is a variable
111
112
113
114
115
int a[] = {1,2,3,4,5}; for(i=0;i<4;i++) printf("%d ",a[++i]); What would

be output of above?
int a[] = {1,2,3,4,5}; for(i=0;i<4;i++) printf("%d ",a[i++]); What would
be output of above?
What is the total size of all the command line arguments including
spaces?
The command line argument 'argc' means
Consider the following C statements. int x = 10; int *p = &x; Which of
the following increments x by 1?
What the following code performs? int count = 0; for(i=0;i<10;i++)
if(a[i]%2) count++;
Defining a function
argument as register
block
If a variable is declared inside a loop, its scope is

For following C expression, what is incorrect statement? (x > 5) || (y
106
= = 4)
For following C expression, what is correct statement? (x > 5) && (y =
107
= 4)
110
Correct Answer
D
C
36
Sr.
116
117
118
119
120
121
122
Question
What the following code performs?
int count = 0;
for(i=0;i<10;i++)
if(!(a[i]%2)) count++;
Assume that p and q are pointers to integers, what will the value of p
-q?
Consider the following C statements. int a[10], *p; p = a; The
expression p+3 points to ....... Element.
Consider the following C statements.
int a[10];
int *p;
p = a;
The last statement p = a; is same as
Consider the following C structure.
struct {
int r_no;
char name[20];
} s;
Consider the following C structure.
struct std {
int r_no;
char name[20];
} s;
What is output of sizeof(struct std) if integer is of 32-bits?
Answer A
Answer B
Answer C
Answer D
counts from 0 to 9
counts odd values in array
counts even values in

array
counts zero values in array
Another pointer
An integer
Not valid operation
Can't say
a[0]
a[3]
a[6]
a[9]
p = a[0];
p = &a;
p = &a[0];
None of the above
It does not use tag
It is not possible to define

more variable of this
It defines one structure
structure at other place in variable
program
All of the above
20
22
24
26
12
16
p = p + 2*2;
p = p + 2*4;
p = p + 2 * sizeof(int);
All of the above
length of a string
number of character in
string
number of bytes occupied All of the above
17
49
25
Invalid
17
49
25
Invalid
run time
during compilation
before compilation
None of the above
If a structure needs 4 bytes and ptr is a pointer to that structure,

4
the expression ptr = ptr + 4; internally incremented by ............ Bytes.
123
If p is a pointer to an integer, p = p + 2; is same as

If p points to start of a string and q points to '\0' at the end of the
124 string,
p - q gives
Consider the following macro deniVon.
125 #define SQR(x) (x*x)
The z = SQR(5+2) results into
126 Consider the following macro definition.
126 #define SQR(x) ((x)*(x))
The z = SQR(5+2) results into
127 The C statements starting with # are processed at
Correct Answer
37
Sr.
128
129
130
131
132
133
Question
for(i=0;i<3;i++) {
printf("%d",i);
break;
printf("%d",i);
}
What would be the output of above?
for(i=0;i<5;i++) {
if(i = = 3)
continue;
printf("%d",i);
}
How many bytes are allocated to variable of following union?
union data {
int x;
float y;
double z;
};
for(i=0;i<5;i++) {
if(i = 3)
continue;
printf("%d",i);
}
Consider the following C statements. int a[5], sum = 0;
for(i=0;i<5;i++) {
if(!(a[i]%2))
continue;
sum += a[i];
}
Which of the following causes "unreachable statements" error in C?
if integers sum = 25 and n = 10, What would be the results of

avg = sum/n; and avg = (float)sum/n; if avg is float?
Consider the following C statements. int a[5], sum=0;
135 for(i=0;i<5;i++) { if((a[i]%2)) continue; sum += a[i]; } What would
be output of above code?
134
136
For the following C statement, what will be the value of x in hex?

x = -2<< 2;
Answer A
Answer B
Answer C
Answer D
Correct Answer
012
001122
Error
None of the above
012
0124
01234
None of the above
None of the above
0124
01234
No output
Error
sum of odd numbers of a[]
sum of even numbers of

a[]
sum of all the numbers of

a[]
None of the above
unconditional break
unconditional continue
unconditional return in
middle of function body
All of the above
2.0 and 2.5
2 and 2
2 and 2.5
2.5 and 2.5
sum of odd numbers of a[]
sum of even numbers of

a[]
sum of all the numbers of

a[]
None of the above
0xFFF8
0xFFFF
0x0000
Error
38
Sr.
Question
Consider the following C code?
union data {
int x;
char s[2];
137 } u;
u.s[0] = 5; u.s[1] = 3;
printf("%d %d %d",u.x);
What would be the output?
Answer A
Answer B
Answer C
Answer D
53
35
573
Error
Consider the following C code?

union data {
int x;
int y;
138 } u;
u.x = 10; u.y = 20;
printf("%d %d %d",u.x);
10
20
30
Error

struct value
{
int b1:1;
139 int b2:4;
int b3:4;
} bit;
printf("%d\n", sizeof(bit));

int x = 10;
140 printf("%d %d %d",x++,x,++x);
10,11,12
10,11,11
11,11,12
11,11,11
689
081
089
None of the above
FFFF
FFFB
FFFE
Error
-1
Error

141 enum month {JAN=5,FEB,MAR=8,APR,MAY};
printf("%d %d %d",FEB,MAR,APR);
Consider the following C statements. int y=-5; printf("%x",y); What
142
would be the output?
143
Consider the following C statements. struct data { int d:1; }; struct

data x = {1}; printf("%d\n", x.d); What would be the output?
Correct Answer
39
Sr.
Question
Consider the following C statements. enum month
144 {JAN=5,FEB,MAR=8,APR,MAY}; printf("%d %d %d",++FEB,MAR,APR);
enum
COLOR {RED, BLACK, GREEN, BLUE};
145
enum COLOR c;
Which of the following is incorrect?
void fun(int n) {
printf("%d", n);
n = - 1;
146 if(n > 0)
fun(n);
}
What would be output of above function when called as fun(5)?
What would be output of following C code?
int x = 10;
void main()
{
int x = 20;
147
{
int x = 30;
printf("%d ",x);
}
printf("%d ",x);
} hat would be output of following C code?
W
int x = 10;
void main()
{
int x = 20;
{
int x = 30;
148
printf("%d ",x);
}
f();
printf("%d ",x);
}
void f() {
printf("%d", x);
Answer A
Answer B
Answer C
Answer D
Correct Answer
689
081
089
Error
c = BLACK;
c = 2;
c = (enum COLOR)2;
All of the above
54321
12345
543210
None of the above
10 20
20 30
30 20
Error
10 20 30
30 10 20
30 20 10
Error
40
Sr.
Question
What would be output of following C program?
void main()
{
int i;
for(i=0;i<5;i++) fun();
149 }
void fun() {
static int x = 10;
printf("%d ",x);
x += 2;
}
What would be output of following C program?
int y = 3;
void main()
{
int i;
for(i=0;i<5;i++) fun();
150 }
void fun() {
int y = 5;
static int x = 10;
printf("%d ",x);
x += y;
}
Answer A
Answer B
Answer C
Answer D
10 10 10 10 10
10 12 14 16 18
10 11 12 13 14
Error
10 10 10 10 10
10 13 16 19 22
10 15 20 25 30
Error
how data are stored in

memory
a structure variable in C
sign-magnitude form
Both A and B
None of the above
an array
Both A and B
All of the above

None of the above
A
B
non-linear data structure
uses sequential allocation
All of the above
Data structure means
2
3
Which of the following is a primitive data structure?

How an integer is stored in computer memory?
logical relation among

data items
an integer
mantissa form
Which of the following is true for an array?
primitive data structure
5
6
7
8
9
10
11
12
13
Which of the following is linear data structure?

Windows explorer is an example of ............ data structure?
Which of the following defines preorder sequence?
Which search method compares data elements one-by-one in
sequence?
Which of the following tree traversal starts from root node?
Which of the following tree traversal visits root node last?
Which of the following is non-linear data structure?
Which of the following follows LIFO manner?
Which of the following data structure allows operations at only one
end?
Correct Answer
Array
Linked list
left-root-right
Stack
Tree
left-right-root
Linked list
Graph
root-left-right
All of the above

Stack
None of the above
D
B
C
Linear
Binary
Hashing
All of the above
inorder
inorder
Tree
Stack
preorder
preorder
Linked list
Queue
postorder
postorder
Stack
Both A and B
None of the above

None of the above
Array
None of the above
B
C
A
A
Stack
Queue
Both A and B
None of the above
41
Sr.
15
16
17
Question
Which of the following data structure allows operations at both the
ends?
A simple queue uses ............. order.
Insertion operation occurs at .............. end in a queue.
Deletion operation occurs at ............ end in a queue.
18
Which of the following points to element to be deleted next in stack? front pointer
rear pointer
top pointer
None of the above
19
Which of the following condition relates to push operation in stack?
overflow
underflow
Both A and B
None of the above
20
Which of the following condition relates to pop operation in stack?
overflow
underflow
Both A and B
None of the above
21
Which of the following search method needs data in sorted order?
Linear
Binary
Hashing
All of the above
22
Which of the following is true for tree?
Root node have indegree 0 Should not contain cycle
All of the above
23
Which of the following node in binary tree has indegree 0.
Root
All of the above
24
What is true for non-primitive data structures?
More complex
All of the above
25
26
Array uses .................. Method to access the elements.

Linked list uses .................. Method to access the elements.
Leaf
Not processed directly by user dened data types in
C are examples are nonmachine instructions
primitive
Computed address
Linked address
Computed address
Linked address
Sequential address
Sequential address
None of the above

None of the above
C
B
27
Array is an example of .............. and ............. memory allocation.
Run, dynamic
Compile, dynamic
Compile, sequential
28
An integer is an primitive data type as
it is basic data type
Both A and B
None of the above
29
30
31
32
33
Which of the following does not have subtree in tree?

......... type of node is only one in given tree?
Stack can be implemented using
A node structure for binary tree has
The expressions used in programming languages are
Root node
Root node
Array
only one pointer
infix expressions
processed by machine
directly
Leaf node
Leaf node
Linked list
two pointers
prefix expressions
Intermediate node
Intermediate node
Both A and B
no pointers
postfix expressions
None of the above

None of the above
None of the above
None of the above
depends on language
B
A
C
B
D
34
Which of the expression is most suitable for evaluation using stack?
infix
prefix
postfix
All of the above
35
The address field in the node of singly linked list
stores address of next

node
can be NULL
Both A and B
None of the above
36
Which of the following allows insertion and deletion at either end?
queue
dqueue
stack
None of the above
37
38
39
End of the list is denoted in the singly linked list as

If last node in linked list points to first list it is called
If a linked list has no nodes, it is called
If the root node of a binary tree has both left and right pointers
NULL, then it contains ........... nodes.
Which of the following inserts value at first position, if rear end is
pointing to last position?
marked by special node

circular linked list
zero list
by storing length of list

round list
empty list
using NULL pointer

loop
null list
All of the above

None of the above
no node list
C
A
B
simple queue
dqueue
circular queue
All of the above
14
40
41
Answer A
Answer B
Answer C
Answer D
Stack
Queue
Both A and B
None of the above
FIFO
front
front
LIFO
rear
rear
LILO
top
top
None of the above

bottom
bottom
A
B
A
Run, compile
Outdegree of leaf node is

0
Intermediate
Correct Answer
42
Sr.
42
43
Question
If singly linked list allows insertion at the end and deletion at the
start, it implements .................... data structure.
If singly linked list allows insertion and deletion only at start, it
implements .................... data structure.
Answer A
Answer B
Answer C
Answer D
queue
stack
dqueue
circular queue
queue
stack
dqueue
circular queue
right most node in left

subtree
right most node of the
tree
root of the left subtree
root of the right subtree
left most node of the tree
None of the above
All of the above
None of the above

change
B
B
44
What is true for inorder successor in binary search tree?
left most node in right

subtree
45
Inorder traversal of a binary starts from
root node
Correct Answer
46
Which is true for tree?
acyclic graph
directed graph
47
48
linear search
push
Binary search
pop
Array
Tree
Graph
All of the above
50
Performing search operation in binary search tree is .........

Which of the operation returns top most value in stack?
Which of the following stores elements in sequential manner in
memory?
Which of the following search needs data in sorted order?
has a root node with

indegree 0
hash search
peep
linear search
Binary search
hash search
None of the above
51
Which of the following list points to previous and next node both?
Singly linked list
Circular list
Doubly linked list
All of the above
Search
Insertion
Deletion
None of the above
stack
List
Tree
49
53
Which of the following binary tree operation does not change the
tree?
Which of the following data structure is hierarchical?
54
Which of the following is true for AVL tree?
55
The value of root node in max-heap is
56
Which is true for 2-3 tree?
57
58
59
60
The value of root node in min-heap is

Binary heap is used to implement ............. data structure.
Binary heap can be represented using
Binary heap is similar to
Which of the following is useful for checking the balanced
parantheses for the expression?
52
61
62
Which of the following array operation is time consuming?
Queue
Difference
of heights of
Difference of heights of
Difference of heights of
left
and
right
subtrees is <=
left and right subtrees is 0 left and right subtrees is 1
1
Largest of all
smallest of all
Any value
Non leaf nodes have 2-3
Length of path from root
It is height balanced tree
offsprings
to each leaf is same
Largest of all
smallest of all
Any value
dqueue
circular queue
priority queue
Array
Binary tree
Both A and B
Simple binary tree
Complete binary tree
AVL tree
stack
Changing value of an
element
Changing value of an
element
row-major
Array
stack
Infix expression
63
Which of the following is fastest operation on array?
64
65
66
67
C language uses .................. method for array storage?

Which of the following is not a linear data structure?
A line at the cinema hall represents
Which of the following also called Reverse Polish notation?
68
In a priority queue, two elements with same priority are processed in Random manner
None of the above

Can't say
All of the above
Can't say
None of the above
None of the above
2-3 tree
B
C
A
B
queue
list
tree
Reading an element
Inserting a new element
All of the above
Deleting an element
Inserting a new element
None of the above
column-major
stack
queue
Postfix expression
Both A and B
tree
linked list
Prefix expression
Implementation
dependent
Any of A and B
queue
None of the above
All of the above
A
C
B
B
None of the above
FCFS manner
43
Sr.
Question
Answer A
Answer B
69
Stack is used for which of the following?
Recursion
Parameter passing
70
Which of the following search is faster for large data size?

Which of the following traversal on binary search tree gives sorted
data?
Linear
71
Answer D
Binary
Answer C
Evaluating postfix
expression
Hash
Inorder
Preorder
Correct Answer
All of the above
All of the above
postorder
None of the above
72
What is drawback of doubly linked list compared to singly linked list?
Allows traversal in both

directions
Deletion operation is
faster
Needs more memory
All of the above
73
Which of the following allows traversal in both the directions?
Singly linked list
Doubly linked list
Circular list
All of the above
queue
list
tree
queue
dqueue
None of the above
74
75
76
If first is a pointer to singly linked list and if first->next = NULL, How

0
many nodes does list contain?
Conversion from infix to reverse polish expression uses .............. Data
stack
structure.
Which of the following allows insertion and deletion to be performed
stack
at either end?
77
If dqueue allows insertion at only one end it is called
input restricted dqueue
insertion restricted
dqueue
output restricted dqueue
None of the above
78
If dqueue allows deletion at only one end it is called
input restricted dqueue
deletion restricted dqueue output restricted dqueue
None of the above
None of the above
79
Indegree of a node in a directed graph means
80
Outdegree of a node in a directed graph means
81
82
83
84
Which of the following denotes the application of the graphs?

A tree is ............... and ................. graph.
An edge starting and ending in same node is called
The nodes having same parents in tree are called
All the nodes in a left subtree of a binary search tree contains keys
.........
All the nodes in a right subtree of a binary search tree contains keys
.........
Which of the following node in a tree has no child?
Which of the node in a tree has no parent node?
Which of the following does not store NULL in pointer field of any of
its nodes?
Linked list can be sorted by
If following is preorder sequence of the tree, what is the value of
root? 15 5 7 9 23 17 35
85
86
87
88
89
90
91
92
What is true for binary search tree?
93
Which of the tree operation visits node exactly once?
sum of incoming and

number of incoming edges number of outgoing edges
outgoing edges
sum of incoming and
number of incoming edges number of outgoing edges
outgoing edges
circuit networks
transport networks
maps
directed, cyclic
undirected, cyclic
directed, acyclic
loop
swing
Both A and B
peers
siblings
brothers
None of the above
All of the above

undirected, acyclic
None of the above
All of the above
D
C
A
B
less than root
greater than root
Random
None of the above
less than root
greater than root
Random
None of the above
Root node
Root node
Middle node
Middle node
Leaf node
Leaf node
All of the above

All of the above
C
A
Singly linked list
Doubly linked list
Circular linked list
All of the above
swapping data only
swapping links only
Both A and B
None of the above
15
23
35
Both A and B
None of the above
Traversal
All of the above
All the keys in left subtree All the keys in right

subtree are greater than
are less than root key
root key
Search
Deletion
44
Sr.
94
95
96
97
98
99
Question
Answer A
Answer B
Which of the following property is used by binary search but ignored
Maximum value of the list Median of the list
by linear search?
Which is most suitable data structure to maintain the ready-queue in
Array
Linked list
process management?
result in infinite loop if not
Which of the following is true for recursion?
Uses stack
handled properly
Printing Fibonacci
Which of the following is not suitable for recursion?
Reversing a given string
numbers
If function calls itself, it is an example of ............... recursion.
direct
indirect
Empty left link to point to Empty right link to point to
Inorder threaded binary tree uses
inorder predecessor
inorder successor
100
To delete a node from a binary search tree having both the subtrees find inorder successor of
non-empty needs to
the node to be deleted
101
Inorder threading of a binary tree makes ........... operation faster.
find inorder predecessor

of the node to be deleted
Answer C
Answer D
Correct Answer
Length of the list
Order of the list
Tree
Graph
Reduces the code size
All of the above
tail
All are suitable for

recursion
None of the above
Both A and B
None of the above
Both A and B
None of the above
Both A and B
None of the above
zero matrix
None of the above
Tree traversals
D
A
A large matrix with most of the elements are 0 is called

The signed integers are usually stored by programming languages
103
using
104 Which of the following is not a graph traversal method?
near-zero matrix
finding inorder
predecessor
sparse matrix
1's complement
2's complement
No-complement
10's complement
Postorder
BFS
DFS
None of the above
105
k/2
h(k)
log k
Stack
Linear queue
Circular queue
All of the above
< 2N -1
= 2N -1
> 2N-1
None of the above
102
106
107
108
109
110
111
112
113
114
115
The data with key k is stored at .............. Location using hashing.

Which of the following data structure does not allow reuse of the
space, until its get empty?
If a binary tree has N levels than possible number of nodes in the
tree are
13. How many values can be stored by an array A(-1..m,1..m)?
For an array A(1..m), if base address is 2000 and a size of element is 4
bytes, What is the address of A(5)?
For array A(-m..m) with element size 2, how much storage is
required?
For array A(3..7), if base address = 4000 and size of element is 4
bytes, what is the address of third element?
The address of ith element of C array is determined using .........
function.
For an array A(1..3,1..4), give the base address of A(2,3) element if
base address is 2000 and size of element is 2 bytes for column major
representation.
For an array A(1..3,1..4), give the base address of A(2,3) element if
base address is 2000 and size of element is 2 bytes for row major
representation.
finding inorder successor
m(m+1)
m(m+2)
m2
2004
2008
2016
2020
2m bytes
2m+1 bytes
2(2m+1) bytes
2m2 bytes
4004
4008
4012
4016
a+i
a+i*2
a+i*4
a + i * sizeof(data type)
2010
2012
2014
2016
2010
2012
2014
2016
top = N - 1
top = 0
None of the above
If a stack is implemented using array A[1..N], the stackful condition is top = N
45
Sr.
116
117
118
119
Question
If a stack is implemented using array A[0..N-1], the initial value of top
of the stack pointer is
If a linear queue is implemented using array A[1..N], the initial values
of front and rear pointers are
If a linear queue is implemented using array A[1..N], which of the
condition represents queue is full?
If a linear queue is implemented using array A[1..N] and if front and
rear pointers are pointing at same location within queue, how many
elements queue can have?
Answer A
Answer B
Answer C
Answer D
Correct Answer
top = 0
top = 1
top = -1
None of the above
front = rear = -1
front = rear = 0
front = rear = 1
None of the above
rear = N
front = rear = N
front = N
None of the above
120
In a linear queue implemented with array A[1..N] and if rear pointer

is pointing to N, which position the next element is inserted?
N+1
results in overflow
121
In a circular queue implemented with array A[1..N] and if rear

pointer is pointing to N, which position the next element is inserted?
N+1
None of the above
What is the queue full condition for circular queue implemented

using array A[1..N]?
123 What is the height of the full binary tree if it has 15 nodes?
rear = N and front = 1
rear + 1 = front
Both A and B together
None of the above
124
No. of nodes at level = 3 in a full binary tree (level of root is 0) are
125
126
Total number of nodes in a full binary tree with height 5 is

In which of the following tree, all the levels are full?
15
Binary tree
31
Strict binary tree
63
Complete binary tree
127
All of the above
B
C
127
In which of the following tree, every node has exactly two childs?
Binary tree
Strict binary tree
Both A and B
None of the above
128
Preorder traversal is same as
depth first search
breadth first search
level order traversal
None of the above
RPTR = NULL
LPTR = RPTR = NULL
None of the above
None of the above
122
If in a binary tree LPTR and RPTR denotes pointers to left and pointer
129 to right subtrees respectively, which of the following condition for
LPTR = NULL
given node determines whether it is leaf node or not?
130
Which of the following determines that the binary tree has only one LPRT and RPTR of root
node?
node are NULL
Either of the LPRT and

Pointer to root node is
RPTR of root node is NULL NULL
131
Which of the following is suitable storage structure for binary trees?
Linked representation
Array representation
Both A and B
None of the above
132
Which of the following nodes a completer binary can contain?

If a complete binary tree is stored in array A[1..N], How do you find
parent of ith node?
left child of ith node?
right child of ith node?
What is maximum height of any AVL tree with 7 nodes if height of
tree with single node is 0.
30
31
32
Any of the above
i/2 with truncation
2i
2i+1
None of the above
i/2 with truncation
2i
2i+1
None of the above
i/2 with truncation
2i
2i+1
None of the above
133
134
135
136
46
Sr.
Question
If a binary tree is stored in array,the right child of node at position 5
is at
Which of the following is valid sequence in an array representing 3ary max-heap?
A binary search tree is build by inserting numbers in following
sequence. 10 1 3 5 15 12 16 What is the maximum height of a leaf
from root node?
A binary search tree is build by inserting numbers in following
sequence. 7 5 1 8 3 6 0 9 4 2 What would be the inorder traversal of
resulting tree?
Assume that array A[1..N] is used to implement double stack. Two
stacks grow from opposite side and top1 and top2 are the top
pointers for them. Which of the following is "stack full condition"?
Answer A
Answer B
Answer C
Answer D
10
11
None of the above
135689
963185
936851
956831
0246813579
9753102468
0123456789
None of the above
top1+top2 = N
top1 = N/2 and top2 = N
top1 = top2 -1
None of the above
What is the postfix expression for infix expression : a + b / c - d * e ?
bc/a+de*-
ab+cd-/e*
ab+de*c/
None of the above
Assume that the following are the sequence resulted using the
143 inorder and preorder traversal of a binary tree. Inorder: 5 7 10 13 15
17 Preorder: 10 5 7 15 13 17 What is correct postorder sequence?
7 5 13 17 15 10
7 5 13 10 15 17
5 7 13 17 15 10
None of the above
144
145
The preorder traversal of a*(b+c)/d-g is

Which of the following array represents a binary max-heap?
*+ab/c-dg
{25,12,16,13,10,8,14}
*a+bc/-dg
{25,14,13,16,10,8,12}
-*a/+bcdg
{25,14,16,13,10,8,12}
None of the above

None of the above
D
C
146
Assume that first is a pointer to singly linked list having more than 2
2 nodes, what is the effect of following operation? first = first->next;
Inserts a node
deletes first node
No effect
None of the above
Inorder
preorder
postorder
level order
Node is found
A leaf node is reached
Either of A or B
None of the above
None of the above
None of the above
Mesh
Ring
Star
Bus
137
138
139
140
141
142
A binary tree is created by inserting following sequence. 6 10 25 12 4

147 7 15 8 33 Which traversal does following sequence shows? 6 4 10 7 25
8 12 33 15
148 The search ends in binary search tree, when
inorder
and preorder traversal of a binary tree. Inorder: 5 7 10 13 15
149
17 Preorder: 10 5 7 15 13 17 How many nodes are there in left
subtree?
inorder
and preorder traversal of a binary tree. Inorder: 5 7 10 13 15
150
17 Preorder: 10 5 7 15 13 17 How many nodes are there in right
subtree?
Which of the following topologies follows the primary-secondary
1
relationships between the devices?
2
Frequency range of the coaxial cable is
When the angle of refraction is 90 degrees and the angle of
3
incidence is 68 degrees, then the critical angle would be
4
End-to-End connectivity is provided from host-to-host in
Correct Answer
C
100 Hz to 5MHz
100 Hz to 500MHz
100 KHz to 500MHz
None of these
45
90
68
180
Network Layer
Data link Layer
Transport Layer
Physical Layer
47
Sr.
Question
Answer A
Port number is
Process Number
Answer B
Computer's Physical
Address
MTU Stands for
Minimum Transfer Unit
Maximum Transfer Unit
Which is the devices belongs to the OSI physical layer?
Switch
Virtual Terminal (TELNET)
Maps host name onto

their network addresses
9
10
11
Segmentation is done at
Congestion Control is done at
Manchester Code is
Transport Layer
Physical layer
Non-return to zero code
12
Which is the main difference between synchronous and

asynchronous transmission?
The bandwidth
requirement is different
13
The purpose of preamble in the ethernet is
Error checking
Repeater
Allow user to login one
machine from distant
machine
Network Layer
Data link Layer
polar code
clocking is derived from
data in synchronous
transmission
collision avoidance
14
Which Protocol Data Unit (PDU) is employed at the transport layer
Bits
Segments
15
Baud rate means
16
Which of the following is a example of bounded mediaum?
No of signal units per

No of bits tramsmitted per
second
to represent the
unit time
bits
Coaxial Cable
Waveguide
17
Wavelength Division Multiplexing is used in
Coaxial Cable
18
Answer C
Answer D
Equivalent to IP Address
None of these
Minimum Transmission
Unit
Router
Maximum Transmission
Unit
Bridge
Correct Answer
A
D
B
Move news article around Fetch pages from www
Physical layer
Transport Layer
bipolar code
A
D
D
clock synchronization
Data link Layer

Network Layer
both A and B
Clocking is mixed with
data in asynchronous
transmission
Broadcast
Frames
Packets
No of pulse transmitted
per unit time
No of bits received per

unit time
Pusle height is different
Fiber optics cable
All of these
Twisted pair cable
Fiber optics channel
Microwave transmission
The transfer of data from CPU to peripheral devices of the computer

Compuetr ports
system is achieved
Buffer memory
Interfaces
Modems
19
If switches are used to replace the hubs on a network, which of the

following statement is true?
The number of broadcast

domains will increase
The number of collision

domains will increase
The number of collision

domains will decrease
The number of broadcast

domains will decrease
20
Which error detection method uses ones compliment arithmetic?
checksum
CRC
simple parity ckeck
two-dimetional parity
check
21
In CRC, there is no error if remainder at the receiver is _____.
nonzero
zero
the quotient at the sender
22
23
24
Hamming code is used for

HDLC does not support
FDDI is a
25
ALOHA
26
Pure ALOHA
27
28
Which of the following is a type of coax cabling transmission

method?
The LLC (Logical Link Control) standard format is based on
equal to reminder of the

sender
Error detection
Half Duplex
Hybrid Network
Is used for channel
allocation problem
Does not requires global
time synch
Error correction
Balanced Multipoint
Ring Network
Error generation
Full Duplex
Star Network
both A and B
Multipoint Link
Mesh Network
D
B
B
Is used for Buffering
Is used for data transfer
None of these
both A and B
Does requires global time

synch
None of these
Baseband
CSMA/CD
Broadband
both A and C
BLAST
SDLC
ZMODEM
HDLC
48
Sr.
Question
29
what is a MAC?
Answer A
It is Network layer address
of the NIC that cannot be
modified
Answer B
It is Network layer address
of the NIC that can be
modified
Answer C
It is Data-Link layer
address of the NIC that
cannot be modified
Answer D
It is Data-Link layer
address of the NIC that can
be modified
Correct Answer
A
In the sliding window protocol, if the window size is 63, what is the
range of sequence number?
The Hamming distance between 001111 and 010011 is
What addressing information is shipped with every network
interface card?
0 to 64
0 to 63
1 to 64
1 to 63
IP Address
MAC Address
ARP Address
All of these
33
IGRP Stands for
Interior Gateway Routing

Protocol
Internal Gateway Routing Internet Gateway Routing Interior Gigabit Routing

Protocol
Protocol
Protocol
34
Which of these true? (I) Transmission is a physical movement of the

Information (II) Communication means meaningful exchange of
information between two communication entities.
II
35
Which of the following statement is true about router and bridge?
36
30
31
32
I and II
None of these
Bridges connect two

Routers are improved
networks at transport layer Bridges
Bridges are type of

inexpensive routers
Routers connect two

networks at network layer
In the virtual circuit switching approach, a route is established

_____________ are sent
After packets
After Data
Before packets
Before Data
37
What is the difference between DTE and DCE devices?
DTE does not clocking

while DCE goes according
to clocking
DTE are capable for

routing while DCE are not
DCE are capable for

routing while DTE are not
38
Which is the most dominant LAN Technology?
Ethernet
DCE does not clocking

while DTE goes according
to clocking
Asynchronous Transfer
Mode
Token Ring
Token Bus
39
X.25 standard Specifies a
40
RIP is based on
Techniques for Start/Stop

data
Link State routing
41
A Routing table contains
the destination network ID next hop router ID
42
43
OSPF is based on
BGP is based on
Link State routing

Link State routing
44
Dijkstra's algorithm is used to
Create LSA's
45
Transport Layer is responsible for
Hop-to-Hope delivery
The file transfer protocol FTP requires a realiable transport service,

which protocol of the TCP/IP suite does it use?
If your routing table reaches to large size then how could you
decrease the size of table?
Which of the following is the most resistant to electrical and noise
interference?
Which of the following is most expensive to install and terminate?
46
47
48
49
DTE/DCE Interface
Techniques for dial access Data Bit rate
Distance vector routing
Path vector routing
The Hop count
All of these
Path vector routing

Path vector routing
create a link state
databases
A
D
Station-to-Station delivery
Tansmission Control
Protocol (TCP)
Add more memory to
router

Calculate the routing
Flood an internet with
information
tables
Network-to-Network
End-to-End delivery
delivery
User Datagram Packet
Telnet
(UDP)
Replace router with most switch to different routing
powerful one
protocol
All of these
Fiber
UDP
Coaxial Cable
STP
Coaxial Cable
CAT4 UTP
Fiber cable
CAT5 UTP
Implement summarization
49
Sr.
Question
Answer A
Answer B
inserting 0 in user data
stream to differentiate it
with a flag
Answer C
50
Bit stuffing means
inserting 0 in flag stream

to avoid ambiguity
51
For subnet addresses, (i) 128.252.4.0 (ii) 128.252.8.0 (iii) 128.252.12.0

255.255.255.0
and (iv) 128.252.16.0 which will be a subnet mask?
Appending a nibble to flag Appending a nibble to user

sequence
data stream
255.255.240.0
255.255.192.0
255.255.252.0
class A
class C
class D
class B
1-2-3-4-5-6
1-2-4-5-3-6
1-3-4-5-6-2
1-2-5-4-3-6
In NVRAM
In RAM
On TFTP Server
54
Whci of the following network address classes id reserved for

multicast addressed only?
Put the encapsulation steps in order: 1:User Input, 2:data, 3:Frame,
4:Segment, 5:Datagram, 6:bits
Where router will store the active configuartion file?
55
Why origional SNMP causes greater network overhead?
Because it uses UDP

Protocol
56
Which of following is not a function of Transport Layer
Provide a ability to send

ACK packet
57
Let in IPv4 datagram, total length is 461 bytes and length of data is
433 bytes, so determine the header size in bytes
28
27
58
IP has
Flow control mechanism
52
53
59
60
61
How many IP addresses are available to company with class B

addresses?
TCP sending data at 1 meghabyte/s, if sequence number starts with
0, how long does it take before sequence goes 7002?
Which of the following is the functinality of TCP timers?
In ROM
Because it can not
Beacause it allows remote automatically provide
configuration
Information to
management info base
Segments can be placed
Can issue the NOT READY
back into their correct
indicator
sequence at destination
32
224
Congection control
mechanism
Both A and B
None of these
8192
65536
32768
16384
5 msec
7 msec
1.056 sec
None of these
Retransmission
Persistence
As if IP datagram travels from its source to its destination
63
The primary functions of the ARP that resides in Internet hosts and
routers is
To provide LAN router

functions
64
Subnetting and Supernetting techniques are used to help avoid
Congestion at Routers
66
67
68
All of these
62
65
Correct Answer
Providing routing services
Source IP address is
The router uses
changed at each router to destination IP address to
identify the sending router consult its routing table
Given the address 172.16.2.120 and the subnet mask of

255.255.255.0. How many hosts are available?
For system using TCP, the sender window size is determined by
_______ window size. (1) Receiver (2) Sender (3) Congestion
Encryption/Decryption provide the network with
Digital signature can provide the network with
Answer D
To traslate LAN addresses

to Physical interface
addresses
The running out of address
space problem
Keep alive
All of these
the router does not use

the IP addresses in the
datagram
Destination IP address is
changed at each router to
reflect the next hop
To translate IP addresses
to LAN addresses
To calcuate shortest path

between two nodes on a
LAN
Overflow of buffer at
receiver
Duplication of Datagrams
B
A
254
126
510
16372
1 and 2 Only
2 and 3 Only
1 and 3 Only
1, 2 and 3
Authentication
Authentication
Integrity
Integrity
Non-repudiation
Non-repudiation
Privacy
All of these
D
D
50
Sr.
Question
Answer A
Which of the following is one of the most important tasks to perform
FTP Server
when hardening a DNS Server?
Simplify the storage of
What is the primary purpose of the FTP server?
files
Answer B
DNS Server
NNTP Server
File and Print server
Allow for backup storage

of files
Report security violation

of files
Facilitate the transfer of

files
71
SNMP uses which Transport layer port number to communicate?
UDP port 21
TCP port 21
UDP port 69
UDP port 161
72
which of the following is included in a packet header to ensure that

data split over several packets is reassembled in the correct order?
Checksum
sequence number
packet number
source address
73
What is the maximum size of the data that application layer can pass
Any Size
on to the TCP layer below?
216 byte
216 byte size of the TCP

header
1500 byte
74
Which of the following statement is FALSE regarding to the Bridge
Bridge is Layer2 device
Bridge used to connect

Bridge reduces collision
two or more LAN segment domain
Bridge reduces broadcast

domain
75
76
In a broad sense, Railway track is a example of

TFTP uses which transport protocol?
What is the remainder obtained by dividing X7 + X5 +1 by the
generator polynomial X3 + 1
Simplex
SPX
Half-Duplex
UDP
Full Duplex
ICMP
All of these
TCP
B
B
X3 + X +1
X2 + X +1
X4 + X +1
X4 + X +1
Slowing down the

communication
69
70
77
Answer C
Answer D
Correct Answer
78
Start and Stop bits are used in the serial communication for
Error detection
Error correction
Synchronization
79
Piggybacking is a method of
Backtracking
Forwarding
Method to combine a data

None of these
frame and ACK
80
A computer is using the following sequence numbers 0, 1, 2, 3, 4, 5,

6, 7, 8, 9,10, 11, 12, 13, 14, 15, 0, 1, . Then what is the size of
window using selective repeat protocol?
16
81
Stop and wait protocol equal to
SR protocol with SWS = 1
82
83
84
85
86
89
Which of the following will descriminate LAN or a WAN?

The Data-Link layer is devided into
In Ethernet, MAC sub-layer uses access method
GIGABIT Ethernet uses
which of the following is true for infra-red transmission?
In Stop and Wait ARQ if ACK1 is sent by receiver then the sender
sends
in which ARQ, if a NAK is received, only specific damaged or lost
frame is retransmitted?
What is TTL?
90
A subnet mask is the portion of an IP address that identifies
91
Which of the following will create a Push Button?

Choose the correct HTML tag for left align the content inside a table
cell
87
88
92
Distance and size

MAC and LLC
ALOHA
NRZ encoding
suitable for a WAN
GBN protocol with RWS = SR protocol with SWS =

1
RWS
Distance and Time
Size and shape
L2CAP and MAC
LCAP and MAC
CSMA/CD
Slotted ALOHA
Manchester Encoding
Both A and B
Blocked by solid objects
Uses expensive cables
GBN protocol with SWS =

RWS
Topology and Time
None of these
None of these
None of these
Use copper shielding
Frame-1
Frame-2
Frame-0
None of these
Stop and Wait
Go-back-N
Selective repeat
Both A and B
Time To Live
Time To Learn
Time To Leave
a perticular network
A perticular computer
A perticular person
Input
Reset
Radio
Time To Link
The perticular location of a
computer
CheckBox
<td left align>
<td align="left">
<td ralign="left">
<tdleft>
D
B
A
B
D
B
A
A
A
51
Sr.
93
94
Question
In HTML, Which of the following attributes of text control allow to
limit the maximum character?
Answer A
Answer B
Answer C
Answer D
Maxlength
Size
Length
None of these
In HTML, Which of the following will be considered a container?
<BODY>
<INPUT>
<VALUE>
<SELECT>
<h1>
SUBMIT
Unformatted tag
<CAPTION>
<heading>
ON SUBMIT
Empty tag
<DATA>
<h6>
ACTION
Format tag
<GROUP>
<head>
METHOD
None of these
<TABLE>
A
A
B
D
REV
URL
REL
None of these
HTML Extension
One
HMT Extension
Three
TMH Extension
Two
None of these
Four
A
B
95
96
97
98
The correct HTML Tag for largest heading is

Which of the following is a not attribute of <FORM> tag
The <INPUT> is
The main container of the <TR>, <TD> and <TH> is
The attribute that defines the releationship between current
99
document and HREF's URL is
100 The MIME text file is saved with
101 How many basic types of bullets supported by the HTML4.
Correct Answer
102
Which of the following will display the line with more thickness?
cannot be determine
<HR size = 10 noshade>
<Hr Size = 10>
both B and C
103
POP stands for
Past Office Protocol
Post Office Protocol
Previous Office Protocol
Present Office Protocol
104
Which one of the following is not a client-server application ?
Internet chat
Web browsing
E-mail
Ping
105
One of the header fields in an IP datagram is the (TTL) field. Which of It can be used to prioritize It can be used to reduce
the following statements best explains the need for this field ?
packets
delays
It can be used to optimize It can be used to prevent

throughput
packet looping
106
In the slow start phase of TCP congesting control algorithm, the size
of the congestion window
Does not increase
Increases linearly
Increases quadratically
107
Which of the following statements is not true about XML Schemas?
They are used to define

the content and structure
of data
108
To eliminate definition duplication, XML Schemas define
an intersection table.
They define a set of

symbols and the
relationships of those
symbols.
global elements
109
XML Schemas consist of
properties and methods
What standard, protocol or language was generalized to become a

110 standard protocol for sending messages of any type, using any
protocol?
111 How long is an IPv6 address?
They are themselves XML They have their own

documents.
syntax.
a normalized definition
table.
None of the above is

correct.
elements and attributes
structure and data
tables and relationships
SOAP
SGML
SQL
ADO
32 bits
128 bytes
64 bits
128 bits
Static
Dynamic
PAT
100 kbps
1 Mbps
2 Mbps
10 Mbps
TCP
ARP
ICMP
BootP
What flavor of Network Address Translation can be used to have one

112
NAT
IP address allow many users to connect to the global Internet?
You have 10 users plugged into a hub running 10Mbps half-duplex.
113 There is a server connected to the switch running 10Mbps halfduplex as well. How much bandwidth does each host have to the
server?
Which protocol is used to send a destination network unknown
114
message back to originating hosts?
Increases exponentially
52
Sr.
Question
Which class of IP address has the most host addresses available by
115
default?
Answer A
Answer B
Answer C
Answer D
Correct Answer
Both A and B
A network that has only

one entry and exit point.
116
What is a stub network?
A network with more than A network with more than A network with only one
one exit point
one exit and entry point
entry and no exit point.
117
What does a VLAN do?
Provides multiple collision Breaks up broadcast

Provides multiple
Acts as the fastest port to
domains on one switch
domains in a layer 2 switch broadcast domains within
all servers.
port
internetwork
a single collision domain.
118
What is the main reason the OSI model was created?
So application developers
To create a layered model
So different networks
can change only one layer's
larger than the DoD model
could communicate.
protocols at a time.
So Cisco could use the

model.
119
Which protocol does Ping use?

Which statement(s) about IPv6 addresses are true? (1) Leading zeros
are required. (2) Two colons (::) are used to represent successive
hexadecimal fields of zeros. (3) Two colons (::) are used to separate
fields. (4) A single interface will have multiple IPv6 addresses of
different types.
In the network with 50 computers, Mesh topology will requires how
many numbers of cables?
Maximum data rate of a channel of 3000 Hz bandwidth and S/N ratio
of 30 dB is
A terminal multiplexer has six 1200 bps termnals and nline what will
be the value of n?
For the fiber optics cable if the propagation speed is
2x108propogation time would be
TCP
ICMP
ARP
BootP
1 and 3
2 and 4
1, 3 and 4
All of the above
1225
1280
50
99
30000 bps
60000 bps
75000 bps
3000 bps
12
16
10 microsecond
0.1 microsecond
1 microsecond
0.001 micosecond
240
250
300
TTF
FFT
FTT
120
121
122
123
124
125
characters per second (7bit + 1 parity) which can be transmitted over

275
a 2400 bps line if the transfer is synchronous (1 start + 1 stop bit)
State True (T) and false (F) of the following (respectively). 1. Hub is
126 multi-port repeater 2. Bridge has filtering capability 3. The bridge
changes the MAC address
TTT
127
No of cross points needed for 10 lines in a cross point switch which is

45
full duplex in nature and there are no self connection is,
43
50
90
128
What layer of the OSI model would be connected with network

applications such as Telnet and FTP?
The Data Link Layer
The session layer
The presentation layer
129
Consider the signal is measured at two different points. The

P2 is zero
power P1 is one point and P2 is at second point. If dB is zero then,
P2 equals to P1
P2 is larger than P1
P2 is smaller than P1
The application Layer
53
Sr.
Question
Answer A
Answer B
Answer C
Answer D
0.06521
0.3
None of these
3%
10%
5%
15
16
7.1sec
12.5sec
None of these
SR Protocol
Stop-n-wait protocol
None of these
67%
50%
None of these
1000
5000
100000
10000
329.14 second
329.14 ms
330 second
330 ms
Fradment offset
Source IP address
Destination IP address
Destination port address
ping
Tracert
A Only
A and B Both
10 subnet-10 hosts
1 subnet-254 hosts
1 subnet-1 hosts
254 subnet-254 hosts
None of these
143 Which of the following statement is FALSE?
HTTP runs over TCP
HTTP describe the

structure of web pages
144 In TCP, Unique sequence number is assigned to each
Byte
word
To correct the single bit error the number of redundancy bit

130
6
required for 64 bit data
What is the probability of exactly 5 collision followed by a success
131 when ALOHA users generate 50 request/second, if time is slooted 0.12
in units of 40 msec?
In a Stop and Wait ARQ bandwidth 1Mbps and 1bit takes 20ms to
132 make a round trip if system data frame are 1000 bit's in length
2%
then what is the % of utilization of the link
Consider the sliding window algorithm where sender window size
133 is 9 and receiver window size is 7 and no out of order arrivals.
7
What is the smallest value for maximum sequence number?
What will be result for the protocol G-Back-N with window size of
50sec
7?
if we run N simultaneous stop-n-wait ARQ processors parallelly
135
Go-back N protocol
over the transmission channel, then it is equal to
if RTT is 40ms and transmission delay is 200ms then what is the
136
55%
throughput of the ethernet?
134
CSMA/CD LAN is designed over a 1km cable without repeater.

137 The minimum frame size that DLL should consider if cable
support signal speed of 200000 km/sec is
An image is of 1024x768 pixels with 3 bytes/pixel. Assume image
138 is uncompressed the how long will it takes to transmit it over 56
kbps modem channel?
In the TCP/IP Protocol suite, which on of the following is a NOT
139
part of the IP header?
Which of the following command/s is/are supported by ICMP
140
protocol?
If you have a network 192.168.10.0/24. How many subnets and
141
hosts are available?
If you have a IP 156.233.42.56 with subnet mask of 7 bits. How
142
many hosts and subnets are available?
HTTP can be used to test

HTTP allows information
the validity of the
to be stored in a URL
hyperlink
Segment
Message
Correct Answer
54
Sr.
145
146
147
148
Question
ARP request is ________________ while ARP reply will

__________________
A datagram size consists of minimum _________ bytes and
maximum _________ bytes
Packets of the same session may be routed through different
paths in
An organization has a class B network and wishes to form subnets
for 64 departments. The subnet mask would be
Answer A
Answer B
Answer C
Answer D
Broadcast, Unicast
Unicast, broadcast
Broadcast, broadcast
Unicast, unicast
22,64
20,60
28,56
30,60
TCP but not UDP
TCP and UDP
UDP but not TCP
Neither TCP, nor UDP
255.255.0.0
255.255.64.0
255.255.128.0
255.255.252.0
94
416
464
512
Half the baud rate
Twice the baud rate
Same as the baud rate
None of these
500m of cable
200 m of cable
20m of cable
50m of cable
2n
2n-1
2n-1
2n-2
12.0.0.1
168.172.19.39
172.15.14.36
192.168.24.43
Gateway DP
Reverse ARP (RARP)
Proxy ARP
Inverse ARP (IARP)
Application
Host-to-Host
Internet
Network Access
NAT Fast
NAT Static
NAT Overload
Overloading Static
socket
bind
listen
connect
40
27
None of these
100 MHz to 10 GHz
100 MHz to 1 GHz
100 KHz to 100 MHz
1 GHz to 10 GHz
spreading
dispersion
traversal
None of these
In a packet switching network, packets are routed from source to

destination along a single path having two intermediate node. If
149
4
the message size is 24 bytes and each packet contains a header of
3 bytes, then the optimum packet size is
Suppose the round trip propagation delay for a 10 Mbps Ethernet
150 having 48-bit jamming signal is 46.4 s . The minimum frame size
is
151 In Ehernet when manchester encoding is used, the bit rate is
In a token ring network the transmission speed is 10 bps and the
152 propagation speed is 200 metres/s. The 1-bit delay in this
network is equivalent to
The maximum window size for data transmission using the
153
selective reject protocol with n bit frame sequence number is
154 Which of the following is private IP address?
Which of the following allows a router to respond to an ARP
155
request that is intended for a remote host?
The DoD model (also called the TCP/IP stack) has four layers.
156 Which layer of the DoD model is equivalent to the Network layer
of the OSI model?
157 Pat Address Translation is also termed what?
which of the following system calls results in the sending of SYN
158
packets?
In RSA Algorithm, value of p is 5 and q is 11, find the value of
159
decryption key if the value of encryption key is 27
160 Frequency range of the microwaves is
Spreading of light rays in all directions perpendicular to direction
161
of travelling is known as a
Correct Answer
55
Sr.
Question
Answer A
Answer B
Answer C
Answer D
802.11
802.16
802.3
802.5
infrastructure mode
Mix mode
adhoc mode
None of these
microwave range
One-way handshaking
visible light
Two-way handshaking
A and B Both
Three-way handshaking
None of these
None of these
5000 bytes
4000 bytes
1000 bytes
6000 bytes
keepalive Timer
Time-wait Timer
Stowatch timer
None of these
Stream Control
Transmission Protocol
Special Control
Safety Control
bit-oriented protocol
byte-oriented protocol
None of these
None of these
None of these
172 Routing inside an autonomous system is reffered to as
Super Control
message-oriented
protocol
message-oriented
protocol
message-oriented
protocol
intradomain routing
autonomous routing
interdomain routing
None of these
173 Routing between an autonomous system is reffered to as
intradomain routing
autonomous routing
interdomain routing
None of these
174 Which of the following is intradomain routing protocol

175 Which of the following is interdomain routing protocol
On the network, multicast routers are connected to each other
176
logically by
177 DHCP is backward compitible with
TCP
BGP
creating multicast
backbone
TCP
techniques to handle
dynamic documents
image compression
techniques
Delay
time limit
encapsulation
RIP
RIP
OSPF
OSPF
Both B and C
None of these
D
A
adding multicast routers
adding unicast routing
None of these
IP
multimedia documents
image handling
image editing techniques
techniques
Jitter
gap
left field
timer field
tunneling
tunning
None of these
None of these
None of these
None of these
hop limit
mixing
A
D
A
50
2000
162 Standard to implement the wireless LAN based on ethernet is

The wireless communication between the devices take place
without using access point is
164 Fiber optics cable operates in the frequency range of
165 The connection establishment in TCP is called
163
In sliding window protocol, what is the value of the receiver

166 window for host A if the receiver host B has a buffer size of 5000
bytes and 1000 bytes of received and unprocessed data?
167
Which timer is used to prevent a long idle connection between

teo TCPs?
168 SCTP stands for

169 UDP is
170 TCP is
171 SCTP is
178 Common Gateway Interface (CGI) is

179 JPEG is a
180 The delay between two real time packet is called
181 The TTL field of IPv4 is replaced by which filed of IPv6?
182 IP within IP is called
How many cross points are needed in a single stage switch with
183
40 inputs and 50 outputs?
40
BOOTP
static documents
90
Correct Answer
56
Sr.
Question
Answer A
Answer B
Answer C
Answer D
1 kbps
4 kBps
4 kbps
7 kbps
8kbps
16 kBps
32 kBps
448 kbps
HELO
MAIL FROM
RCPT TO
None of these
187 What is the port number for Domain Name System service DNS?
53
54
61
60
188
What is the port number for (Remote login service) Telnet?
20
25
23
24
189
What is the port number for (File Transfer Protocol - Data) FTP?
20
21
22
35
20
25
23
24
161
149
144
143
10
datagram switching
7
circuit switching
9
frame switching
8
none of the above
B
A
source
destination
local
none of these
process-to-process
communication
host-to-host
communication
connection-oriented
delivery
end-to-end reliable data None of the choices are

delivery
correct
None of the choices are
congestion control
correct
socket address
correct
none of the choices are
transmission mode
correct
port defining commands
correct
ERROR
correct
the receiver discards the none of the choices are
duplicate
correct
host
correct
Java applets.
correct
for 64 kbps satellite channel, 512B data frames and RTT=64ms,

184
what is max throughput for the window size of 1?
for 64 kbps satellite channel, 512B data frames and RTT=64ms,
185
what is max throughput for the window size of 8?
186 This command identifies the recipient of the mail.
190
191
192
193
194
What is the port number for (Simple Mail Transfer Protocol)

SMTP?
What is the port number for Internet Message Access Protocol
(IMAP)?
What is the port number for ECHO?
In _________, resources are allocated on demand
which address in the header of a packet in a datagram network
normally remains the same during the entire journey of the
packet?
195 Which of the following functions does UDP perform?

196 Which of the following does UDP guarantee?
flow control
197 The combination of an IP address and a port number is called a
transport address
network address
198 In FTP, ASCII, EBCDIC, and image define an attribute called
file type
data structure
199
In FTP, which category of commands defines the port number for

file transfer commands
the data connection on the client site?
access commands
200 In TFTP, a connection is terminated with.
DATA
ACK
201 In TFTP, if a duplicate DATA message is received
the sender sends an

error message
the connection is
terminated
path
protocol
CGI
Java stand-alone
programs
202
In a URL, the _______ is the client-server program used to

retrieve the document.
203 One way to create an active document is to use
Correct Answer
C
D
C
D
C
A
C
B
C
57
Sr.
Question
204 HTTP uses the services of _________ on well-known port 80.

205
206
207
208
209
In a ___________connection, the server leaves the connection

open for more requests after sending a response.
Which of the following is present in both an HTTP request line
and a status line?
The HTTP request line contains a _______ method to request a
document from the server.
The HTTP request line contains a _______ method to get
information about a document without retrieving the document
itself.
An applet is _______ document application program.
210 _______ is more powerful and complex than _______.

211
212
213
214
215
216
217
Suppose the BSNL telephone line has a bandwidth of 6100Hz the

S/N ratio is 40 dB then capacity of the channel would be
when the signal travels through the transmission medium, its
power becomes 100 times Then gain/loss would be
If channel capacity is 250Kbps, find the white noise present in the
channel if the signal strength is 15microW and bandwidth is 8000
Hz, SNR=20000.
The wavelength of the red light whose frequency is 4x414 Hz in
the air is
When the signal travels through the transmission medium, its
power becomes one fifth Then power
How many 8-bit characters can be transmitted per second over a
9600 baud serial communication link using asynchronous mode of
transmission with one start bit, eight data bits, and one parity bit
?
A and B are the only two stations on an Ethernet. Each has a
steady queue of frames to send. Both A and B attempt to transmit
a frame, collide, and A wins the first backoff race, At the end of
this successful transmission by A, both A and B attempt to
transmit and collide. The probability that A wins the second
backoff race is
Answer A
Answer B
Answer C
UDP
IP
TCP
persistent
nonpersistent
persistent and
nonpersistent
HTTP version number
URL
status code
GET
POST
COPY
HEAD
POST
COPY
a static
an active
a passive
POP3; IMAP4
IMAP4; POP3
SMTP; POP3
80176 bps
38821 bps
Gain of 80 dB
Answer D

correct
correct
correct
correct
correct
Correct Answer
C
A
A
a dynamic
correct
32681 bps
81056 bps
Loss of 80 dB
Gain of 20 dB
Loss of 20 dB
9.375 x 10-12 watts/Hz
9.370 x 10-11 watts/Hz
9.388 x 1011 watts/Hz
9.368 x 1012 watts/Hz
0.75 micrometer
7500 pm
400 m
Data insufficient
Loss of 7 dB
Gain of 7 dB
Loss of 5 dB
Gain of 5 dB
600
800
876
1200
0.5
0.625
0.75
58
Sr.
218
219
220
221
222
223
224
225
Question
Two computers C1 and C2 are configured as follows. C1 has IP

address 203. 197.2.53 and netmask 255.255. 128.0. C2 has IP
address 203.197.75.201 and netmask 255.255.192.0. Which one
of the following statements is true?
Suppose computers A and B have IP addresses 10.105.1.113 and
10.105.1.91 respectively and they both use the same netmask N.
Which of the values of N given below should not be used if A and
B should belong to the same network ?
Which ATM layer has a 53-byte cell as an end product?
The IP protocol uses the which sublayer.
Which one out of following is suitable for businesses that require
comparable upstream and downstream data rates.
SONET is a standard for which kind of networks.
In which service, there is a relation between all packets belonging
to a message.
which control means including a mechanism for detecting
corrupted, lost, or duplicate packets.
Answer A
Answer B
Answer C
Answer D
C1 and C2 both assume

they are on the same
network
C2 assumes C1 is on
same network, but C1
assumes C2 is on a
different network
C1 assumes C2 is on
same network, but C2
assumes C1 is on a
different network
C1 and C2 both assume

they are on different
networks
225.255.255.0
255.255.255.128
255.255.255.192
255.255.255.224
physical
AAL1
ATM
AAL2
Application adaptation
AAL5
None of these
None of these
B
C
VDSL
ADSL
SDSL
None of these
twisted-pair cable
coaxial cable
fiber-optic cable
None of these
connectionless
virtual
connection-oriented
None of these
Flow
Error
Congestion
None of these
data
control
None of these

correct

correct
226
which packet is a special packet that can be sent from a router to

ckoke
the sender when the router encounters a congestion.
227
The number of addresses assigned to an organization in classless

addressing
can be any number
228
The first address assigned to an organization in classless

addressing
must be a power of 4
Which address could be the beginning address of a block of 32

2.4.6.5
classless addresses?
What is the first address of a block of classless addresses if one of
230
12.2.2.0
the addresses is 12.2.2.76/27?
229
must be a multiple of
must be a power of 2
256
must be evenly divisible
must belong to one of
by the number of
the A, B, or C classes
addresses
2.4.6.16
2.4.6.64
12.2.2.32
12.2.2.64
231 In fixed-length subnetting, the number of subnets must
be a power of 2
be a multiple of 128
be divisible by 128
232 What is the default mask for class A in CIDR notation?
/9
/8
/16
classless
classless
both classless and

classful
/20
/19
/20
In which addressing, when an address is given, we can find the

beginning address and the range of addresses.
In a block, the mask is 255.255.255.224; what is the prefix
234
length?
233

correct
correct
correct
correct
correct
correct
Correct Answer
C
C
A
B
B
D
59
Sr.
Answer A
Answer B
Answer C
Answer D
Correct Answer
next-hop
network-specific
host-specific
default
classful addressing
classless addressin
classful addressing and

classless addressing
reduce
increase
reduce and increase
input and output ports
routing processor
switching fabrics

correct
correct
correct
239 A best-effort delivery service such as IP includes
error checking
error correction
240 If the fragment offset has a value of 100, it means that
the datagram has not

been fragmented
the datagram is 100

bytes in size
offset number
total length
is 20 to 60 bytes long
is 20 bytes long
last two cells; last three
cells
235
236
237
238
241
242
243
244
245
Question
In which forwarding, the mask and destination addresses are

both 0.0.0.0 in the routing table?
The idea of address aggregation was designed to alleviate the
increase in routing table entries when using
By using of hierarchy in routing tables,the routing tables size will
be
The task of moving the packet from the input queue to the
output queue in a router is done by
What is needed to determine the number of the last byte of a

fragment?
The IP header size
When we use IP over ATM, padding can be added only to the
_____ or the _______.
ATM network to be divided into several logical subnets with the
help of
If the sender is a host and wants to send a packet to another host
on the same network, the logical address that must be mapped to
a physical address is
246 he target hardware address on an Ethernet in an ARP request is.
first cell; last cell
datagram
None of these
acknowledgmen
the first byte of the
datagram is byte 800
correct
both offset number and None of the choices are
the total length
correct
is 60 bytes long
is 80 bytes long
last cell; last two cells
correct
LIS
correct
C
D
C
C
A
C
LAN
the destination IP
address in the datagram
header
the IP address of the

router found in the
routing table
the source IP address

correct
0x000000000000
0.0.0.0
variable
class dependent
If a host needs to synchronize its clock with another host, it sends timestamp-request
a
message
249 Multicast link state routing uses the which kind of tree approach. source-based
group-shared
250 MOSPF is a
data-driven protocol
command-driven
protocol
In the stop-and-wait protocol, the send window size is ______

251 and the receive window size is _______ where n is related to the
number of bits in the sequence.
1, 1
1, n
n, 1
248 Who can send ICMP error-reporting messages?
LAS

correct
correct
destination-based
correct
both data- and command- None of the choices are
driven
correct
247
routers
source-quench message
destination hosts
router-advertisement
message
routers or destination
hosts
n, n
C
B
A
A
60
Sr.
Question
In the go-back-N protocol, the send window size is ______ and

252 the receive window size is _______, where n is related to the
number of bits in the sequence. number.
In the selective-repeat protocol, the send window size is ______
253 and the receive window size is _______, where n is related to the
number of bits in the sequence.
254 The checksum in SCTP is
The association identifier in SCTP cannot be a combination of logical
255
and port addresses because of
Network programming needs information to be in __________ byte
256
order.
Answer A
Answer B
Answer C
Answer D
Correct Answer
1, 1
1, n
n, 1
n, n
1, 1
1, n
n, 1
n, n
16 bits
32 bits
64 bits
128 bits
multistream services
multihoming service
multistream and
multihoming services
host
network
client

correct
correct
correct
correct
correct
correct
B
B
257
SOCK_STREAM sockets are used by
UDP process
TCP Process
SCTP process
258
SOCK_DGRAM sockets are used by ______ processes.
UDP process
TCP Process
SCTP process
259
SOCK_RAW sockets are used by ______ processes.
UDP process
TCP Process
SCTP process
260
IPv6 allows _________ security provisions than IPv4.
more
less
same
Internet Explorer
HTML
Web Browser
None of thse
<UL>
12 characters
<OT>
18 characters
<OL>
22 characters
None of these
24 characters
C
D
The web standerd allows programmers on many different computer

261 platforms to dispersed format and display the information server
These programs are called
262 Which of following tag will create a number/order list?
263 <DIR> tag can have only
B
A
D
A
264
The optical amplifier will
Converts optical signal to

Re-amplifies the origional
electrical signal, reshape
signal
and convert back to Optical
Both A and B
None of these
265
Optical Regenerator will
Converts optical signal to

Re-amplifies the origional
electrical signal, reshape
signal
and convert back to Optical
Both A and B
None of these
1.544
1.544
44.736
44.736
2.048
2.048
155.52
155.52
A
B
HELO
STOP
QUIT
NOOP
Service Area Network
Storage Area Network
Standard Area Network
Super Area Network
Network Analysis Storage
Network Attached Storage Nework attached service
None of these
266
267
Interface type T1 can support data rate in Mbps

Interface type T3 can support data rate in Mbps
Which of the following command of SMTP responsible for terminate
268
SMTP connection
269 SAN stands for
270
NAS stands for
61
Sr.
Question
Answer A
Answer B
Answer C
Answer D
only S1
Only S2
Both S1 and S2
None of these
Router
Repeater
Switch
Gateway
Which of the following statements is/are true? S1: MAC addresses

273 are used to address individual devices on the same LAN S2: MAC
addresses are assigned by the manufecturer and are globally unique
S1 true, S2 false
S1 false, S2 true
Both S1 and S2 are true
Both are false
274
Guarantees wire speed
Connects multiple
segments
Segments by MAC
addresses
Runs BGP transport

protocol
Which of the following statements is/are true? S1: Network layer

275 dividing the transmitted bit stream into frames S2: Network layer
determining which route through the subnet to use
S1 true, S2 false
S1 false, S2 true
Both S1 and S2 are true
Both are false
276
If the divisor is binary equivalent of X8 + X3 + X + 1 then CRC will be
2 bit
3 bit
8 bit
9 bit
277
A virtual connection for the ATM network is defined by a pair of
VPI and VCI
VCI and VPP
VCP and VPP
None of these
278
The channel capacity is 125 MBPS, maximum packet size is 1000

bytes, round trip time is 100microsecond, then transmission time is
1 microsecond
8 microsecond
1 milisecond
8 milisecond
2.50%
7.40%
8.70%
2000 KM
3000 KM
4000 KM
150 kbps
200 kbps
250 kbps
4 km
2.7 km
4.8 km
Which of the following statements is/are true? S1: The transport

layer is responsible for delivery messages between hosts that may or
271
may not be on different networks S2: The network layer is
responsible for delivery messages between processes
272
Which of the following devices translates dissimilar network

protocols?
An advantages of a switch over a hub would be
The channel capacity is 125 MBPS, maximum packet size is 1000

279 bytes, round trip time is 100microsecond, then ulilization of the
5%
sender is
The distance between A and B is 4000km, propagation delay is
5microsecond/km for the both the links. The data rate between A to
280 B is 100kbps and full duplex kind. Data frames are size of 1000 bits
1000 KM
long and ACK frames are negligible.Window size is 4. If RTT between A
and C is 50ms then what is the distance between B and C?
The distance between A and B is 4000km, propagation delay is
5microsecond/km for the both the links. The data rate between A to
281 B is 100kbps and full duplex kind. Data frames are size of 1000 bits
100 kbps
long and ACK frames are negligible.Window size is 4. What is the
required transmission rate between B and C so the buffer of the node
B are not flooded?
Consider 100baseT cable Ethernet with an efficiency of 50%. Assume
282 frame length of 1kB and propagation speed in the cable is 2x108
4 km
m/sec. Calculate the distance between a node and the hub
Correct Answer
62
Sr.
Question
Answer A
Answer B
Answer C
Answer D
10 microsecond
11 microsecond
None of these
40000
5000
None of these
0.4 second
1 second
None of these
116 ms
21 ms
29 ms
10 RTT
8 RTT
14 RTT
TTF
TFF
TTT
FTF
15
30
105
225
Consider a token ring consisting of 20 stations with 10 mt distance

283 between each. If propagation speed is 2x108 m/sec. and per station 5 7 microsecond
bit delay, then what will be ring latency if ring bandwidth is 10Mbps?
284
A 4 Mbps token ring has token holding time value of 10msec. What is
40000
the longest frame (in bytes) that can be sent on this ring?
Let TCP operates over a 10Gbps link. If TCP uses the full bandwidth
285 continuously, how long would it take the sequence numbers to
4 ms
wraparound completely?
if TCP RTT is currently 20 ms and ACK comes in after 30 ms then what
286 is the timeout period for the next transmission? Use alpha=0.9 and
84 ms
Beta=2.
Assume a TCP implementation over a 10Gbps link with one way delay
of 80ms. If TCP receiver window is 2MB and TCP send 1kB packet then
11 RTT
287
how many RTTS does it take until slow start opens the congestion
window to 2MB? Assume no congestion and no packet lost.
State true (T) and false (F) of the following Persistent connection is
288 default in HTTP 1.1 HTTP supports proxy servers HTTP uses well
known port 23
There are 15 users communicationg to each other. How many pairs
289 of the keys are required to authenticate the communication is
symmetric key is used?
290
In which way does a Firewall increase the security of a VPN?
The initial 8 bits of the IP packets are 01000010, Then what will be
the version of IP version
An IP pcaket has arrived with the first few hexadecimal digits as
292 below, then how many hops this packet can travels?
45000028000100000102
293 Kerberos is a
If transmitted bit sequence is 111000111000 the which of the
294
following is a example of burst error
291
Correct Answer
Configured to allow
Restrict the use of specific Limits the speed in which
Physically protects the
certain ports to access the
transmission of data is
network from catching fire application software on
VPN
the network
carried out
IP version 4
IP version 6
Both
None of these
Only 1 Hop
Only 2 Hop
Only 3 Hop
None of these
Authentication protocol
Security protocol
Integrity protocol
None of these
111100111000
111000111100
111010111000
111111111000
Xreference
295
Xpointer specification essentially extends you which specification
XHTML
XL Link
Xpath
296
DOM is a
Coding style
Document model , a
specification
Document Object Model, a

None of these
parser
SAX
Either A or B
If we have to process huge XML document to read it and to insert the

297 records in to the database, and there are limited memory resources, DOM
which parsing API would you use?
None of these
63
Sr.
Question
Answer A
298
XML Schema divides data types into two main categories they are
Simplex, Complex
Which is the documents that describes how the data will be

299 exchanged, and acts as a kind of contract between the sender and
the receiver?
What is one of the better known early implementation of XML based
300
communication protocol?
1
Which one of the following is universal gate?
Advantage of synchronous sequential circuit over asynchronous ones
2
is
3
Which of the following is the first integrated logic family
4
The functional capacity for VLSI devices is
5
A shift register can be used for
Parallel adders are
Answer B
Machine dependent,
machine Independent
Answer C
Answer D
Standard, custom
String, Number
Schema
DTD
XSLT stylesheet
Both A and B
SOAP
RemoteXML
XML-RPC
None of these
AND
NOR
ease of avoiding problems
due to hazards
DTL
12 to 99 gates
Serial to parallel
conversion
NOT
lower hardware
requirement
TTL
100 to 10000 gates
XOR
better noise immunity
MOS
More than 10000 gates
A
D
Digital delay line
All of these.
Sequential logic circuit.
Both (a) & (b)
None of above.
Very logical switch

interface
Very large switch

integration
None of these
faster operation
RTL
1 to 11 gates
Parallel to serial
conversion
Combinational logic
circuit.
Very large scale
integration
Correct Answer
D
VLSI stands for
2's complement of any binary number can be calculated by
adding 1's complement

twice
adding 1 to 1's
complement
subtracting 1 from 1's

complement.
calculating 1's
complement and inverting
Most significant bit
Which of the number is not a representative of hexadecimal system
1234
ABCD
1001
DEFH
Overflow
Carry
Parity
Sign value
8-bits
16-bits
23-bits
64-bits
3 inputs and 7 outputs

11
all inputs are LOW
OR Gate and then NOT
Gate
Addition
multiplication
All of the inputs are one
all inputs are HIGH
a sumterm
a sum term
Product of sum form

1100
all inputs are HIGH
NOT Gate and then OR
Gate
Subtraction
subtraction
Any of the input is one
any input is HIGH
a product term
a literal term
Sum of product form

1000
any input is LOW
AND Gate and then OR
Gate
Multiplication
division
Any of the input is zero
any input is LOW
a literal term
a product term
Demorgans law

1010
any input is HIGH
OR Gate and then AND
Gate
Division
addition
All the inputs are zero
all inputs are LOW
always 1
a complemented term
Associative law
B
B
B
12
13
14
The values that exceed the specified range can not be correctly
represented and are considered
In ANSI/IEEE Standard 754 ' Mantissa ' is represented by _________
bits
BCD to 7-Segment decoder has
The decimal 8 is represented as _________ using Gray Code.
A NAND gate's output is LOW if
15
NOR gate is formed by connecting _________
16
17
18
19
20
21
22
The AND Gate performs a logical __________function

The OR gate performs Boolean ___________.
The output of an AND gate is one when _______
A NOR's gate output is HIGH if
the boolean expression AB'CD' is
the boolean expression A + B' + C is
A (bar)B +A(bar)BC(bar)+AC is an example of ________
10
11
A
C
D
A
D
B
A
B
64
Sr.
23
24
25
Question
An example of SOP expression is
Half-Adder Logic circuit contains _____ XOR Gates
Using multiplexer as parallel to serial converter requires
___________ connected to the
26
A demultiplexer has
27
The main use of the Multiplexer is to
Answer A
A + B(C + D)
1
A parallel to serial
converter circuit
one input and several
outputs
Answer B
A'B + AC' + AB'C
2
Answer C
(A' + B + C)(A + B' + C)
4
Answer D
both (a) nad (b)
6
A counter circuit
A BCD to Decimal decoder A 2-to-8 bit decoder
several inputs and several several inputs and one

one input and one output
outputs
output
Correct Answer
B
A
A
A
Select data from multiple Select data from Single

Select data from Single
sources and to route it to a source and to route it to a source and to route to
single Destination
multiple Destinations
single destination
Select data from multiple

sources and to route to
multiple destinations
AND
OR
NOT
XOR
29
30
31
32
The PROM consists of a fixed non-programmable ____________ Gate

array configured as a
Tri-State Buffer is basically a/an _________ gate.
GAL is an acronym for ________.
ASCII code is a bit code.
8421 codes is also called as.
AND
NOT
1
Gray code
NOT
Generic Array Logic
7
excess 3-code
XOR
Generic Analysis Logic
8
BCD code
C
A
C
D
33
ECL stands for
a) Emitter control logic
OR
General Array Logic
2
ASCII code
Emitter complementary
logic
Emitter coupled logic
Emitter coded logic
JK Flip flop
D Flip flop
T Flip flop
Master Slave JK Flip flop
A+BC
571
B+A
572
AB+BC
-571
B+AC
-572
D
B
Offset value
to encode data
to decode data
to convert from serial to

parralel data
28
35
36
When an inverter is placed between both inputs of SR flip flop the

resulting flip flop is
The boolean function AB+A(B+C) +B(B+C) is equivalent to
10s complement of 428 is
37
when PUSH is executed , the stack pointer register is decremented by 1
34
to convert from one

number system to other
38
Sum-of-Weights method is used
39
which of the following rules states that if one input of an AND gate is
A +1 =1
always 1, the output is
A +A =A
A.A = A
A.1= A
40
Which one of the following is NOT a valid rule of Boolean algebra?
A = A'
AA = A
A+1=1
A+0=A
41
42
The binary value ' 1010110 ' is equivalent to decimal

2's complement of 5 is
The Extended ASCII Code (American Standard Code for Information
Interchange) is a _____ code
86
1101
87
1011
88
0101
89
1100
A
C
2-bit
7-bit
16-bit
16-bit
One advantage TTL has over CMOS is that TTL is
less expensive
not sensitive to
electrostatic discharge
faster
more widely available
4-to-2
4-to-4
8-to-1
8-to-4
two ORs ANDed together
a 4-input AND gate
two ANDs ORed together
an exclusive-Or
AB+C = A+BC
A(B+C) = B(A+C)
AB=BA
A+B=B+A
43
44
45
46
47
8-bit parallel data can be converted into serial data by using

________ multiplexer
The boolean expression X = AB + CD represents
The expression _________ is an example of Commutative Law for
Multiplication.
65
Sr.
48
49
50
51
52
Question
(A+B).(A+C) = ___________
A.(B + C) = A.B + A.C is the expression of _________________
A.(B.C) = (A.B).C is an expression of __________
A non-standard POS is converted into a standard POS by using the
rule _____
Answer A
B+C
Demorgan's Law
Demorgan's Law
Answer B
A+BC
Commutative Law
Distributive Law
Answer C
AB+C
Distributive Law
Commutative Law
Answer D
AC+B
Associative Law
Associative Law
Correct Answer
A+A(bar) = 1
AA(bar) =0
1+A=1
A+B = B+A
In a 4-variable K-map, a 2-variable product term is produced by
a 2-cell group of 1s
12
16
B
C
D
12
16
55
56
57
The 3-variable Karnaugh Map (K-Map) has _______ cells for min or
max terms
The 4-variable Karnaugh Map (K-Map) has _______ cells for min or
max terms
On a Karnaugh map, grouping the 0s produces
Which gate is best used as a basic comparator?
A particular Full Adder has
a POS expression
NOR
exclusive-OR
a SOP expression
OR
3 inputs and 3 output
a "don't care" condition

exclusive-OR
AND-OR logic
AND
A
C
A
58
For a 3-to-8 decoder how many 2-to-4 decoders will be required?
59
+7 to -8
+8 to -7
+9 to -8
-9 to +8
E^2CMOS
TTL
CMOS+
None of the given options
61
62
63
64
65
The range of Excess-8 code is from ______ to ______

GAL can be reprogrammed because instead of fuses _______ logic is
used in it
A latch has _____ stable states
An S-R latch can be implemented by using _________ gates
The Quad Multiplexer has _____ outputs
Half adder consist of. &..Gates
In half adder EX-OR gate O/P is
One
AND, OR
4
EX-OR&AND
Carry
Two
NAND, NOR
8
EX-OR&OR
Remainder
Three
NAND, XOR
16
EX-OR&NOT
Sum
Four
NOT, XOR
12
None of this
None of this
B
B
A
A
C
66
For getting an output from an XNOR gate, its both inputs must be
high
low
at the same logic level
at the opposite logic level
67
68
69
Which of the following expressions is not equivalent to x'?

The complement of a variable is always
The difference of 111 - 001 equals
In the binary number ' 10011 ' the weight of the most significant digit
is
2's complement of hexadecimal number B70A is
The 4-bit 2's complement representation of ' -7 ' is
The output of the expression F=A+B+C will be Logic ________ when
A=0, B=1, C=1. the symbol ' +
Fan-out is specified in terms of
x NAND X
1
100
x NOR x
0
111
x NAND 1
x NOR 1
001
110
D
C
D
2^4(2 raise to power 4)
2^3 (2 raise to power 3)
B70B
111
B709
1111
48F6
1001
48F5
110
C
C
Undefined
One
Zero
10 (binary)
voltage
current
watt
TTL
CMOS 3.5 series
CMOS 5 Series
unit loads
Power dissipation of all
circuits increases with
time.
53
54
60
70
71
72
73
74
75
Generally, the Power dissipation of _______ devices remains

constant throughout their operation
66
Sr.
Question
A logic circuit with an output X = A(Bar)BC+AB(Bar) consists of
________.
To implement the expression AB(bar)CD+ ABC(bar)D+ ABCD (bar), it
takes one OR gate and
Determine the values of A, B, C, and D that make the sum term
A(bar) + B+C(bar)+D equal to zero.
Answer A
two AND gates, two OR
gates, two inverters
three AND gates and three
inverters
Answer B
Answer C
three AND gates, two OR two AND gates, one OR
gates, one inverter
gate, two inverters
three AND gates and four
three AND gates
inverters
Answer D
two AND gates, one OR
gate
one AND gate
A = 1, B = 0, C = 0, D = 0
A = 1, B = 0, C = 1, D = 0
A = 0, B = 1, C = 0, D = 0
A = 1, B = 0, C = 1, D = 1
79
According to Demorgan's theorem: (A+B+C)bar = ______________
A.B.C
A+(B.C )Bar
A(Bar).B(Bar).C(Bar)
A.B(Bar)+C
80
A SOP expression is equal to 1
At least one variable in

All the variables in domain
domain of expression is
of expression are present
present.
When one or more

product terms in the
expression are equal to 0.
When one or more

product terms in the
expression are equal to 1.
81
Adjacent 1s detector circuit will have active low output for the input
1101
1010
0110
1011
2nd
3rd
4th
2-to-8 encoder
(1100)2
4-to-16 encoder
(0011)2
451
76
77
78
82
83
84
85
86
87
If ' 1110 ' is applied at the input of BCD-to-Decimal decoder which

output pin will be activated:
The _______ Encoder is used as a keypad encoder.
Subtract ( 1010)2 from ( 1101 )2 using 1s complement
Conversion of hexadecimal number (69)16 to octal equivalent will
give
The difference between two decimal numbers 87 and 63 in binary
format will be
Which of the following functions implements the Karnaugh map
shown below?
BCD-to-Decimal
(1001)2
C
B
351
251
151
10100
11000
10010
None
a) AB+CD
D(C+A) (C+D)(C+D)+(A+B)
4 half-adders, 12 fulladders
16 half-adders, 0 fulladders
8 half-adders, 8 full-adders 1 half-adder, 15 full-adders
DTL
TTL
HTL
(A+B)+C=A(B+C)
A.(B+C)=(A.B)+(A.C)
A+B=B+A
A+A=A
X+Y
X.Y
(X.Y)
XY+XY
24.582
2.4582
24582
0.24582
The number of full and half-adders required to add 16-bit numbers is
89
Which of the following logic families has the highest noise immunity? RTL
91
92
Which of the following Boolean algebra statements represents

commutative law?
Let X and Y be the inputs and Z be the output of XOR gate. The value
of Z is given by
If we multiply ' 723 ' and ' 34 ' by representing them in floating point
notation i.e. by first,
No output will be
activated
Decimal-to-BCD Priority
(0101)2
88
90
Correct Answer
AD+AB
93
Which one is true:
Power consumption of TTL Power consumption of

Both TTL and CMOS have depends on no. of gates in
is higher than of CMOS
CMOS is higher than of TTL same power consumption the circuit.
94
3.3 v CMOS series is characterized by __________ and _________as

compared to the 5 v CMOS
Low switching speeds,

high power dissipation
Fast switching speeds,

high power dissipation
Fast switching speeds,

Low switching speeds,
very low power dissipation very low power dissipation
95
The minterm expansion for F(A,B,C) = (A + B + C)(A + B' + C')(A' + B +

C')(A' + B' + C) is
F (A,B,C) = Pi M(0,3,5,6)
F(A,B,C) = Summation
m(0,3,5,6)
m(0,3,5,6)
m(1,2,4,7)
67
Sr.
Answer A
Answer B
Answer C
Answer D
A > B = 1, A < B = 0, A < B = A > B = 0, A < B = 1, A = B = A > B = 0, A < B = 1, A = B = A > B = 1, A < B = 0, A = B =
1
0
1
0
98
Question
The binary numbers A = 1100 and B = 1001 are applied to the inputs
of a comparator. What are
Two 2-input, 4-bit multiplexers 74X157 can be connected to
implement a ____multiplexer.
What will be the decimal equivalent of 111011.10
48.625
59.487
99
What will be the hexadecimal equivalent of decimal number 54977
D6C1
DC61
100
1
The sum of octal numbers (25)8 + (52)8 +(33)8 is :

(90)10
Transfer between registers takes place when
There is an interrupt
Which technique allows DMA controller to transfer one data word at
Bus transfer
a time.
Content addressable
An associative memory is also called
memory
(132)8
There is a control signal
Advantage of CMOS technology over a MOS is
lower power dissipation
Program counter contains
The address of the current Data which is to be

instruction
processed
The address of the next

Counter value that is used
instruction to be executed in the program
6
7
8
9
CD-ROM is a
Actual execution of instructions in a computer takes place in
Which of the following is used as a primary storage device
Information retrieval is faster from
The communication line between the CPU, memory and peripherals
is called a
The main three component of a digital computer system are
Which register is responsible for computation in any computer
system ?
Semiconductor memory
ALU
Magnetic tape
Floppy disk
Memory register
Storage unit
PROM
Magnetic tape
None of the above

None of the above
Floppy disk
Hard disk
None of the above

None of the above
None of the above
None of the above
D
A
B
C
Bus
line
media
none of these
A
C
13
ALP stands for
All Language Programming
14
RTL stands for
Resgister Transfer
Language
15
Which of the following statement is true ?
ROM is read / write

memory
16
Which of the following are registers ?
17
The main difference(s) between a ClSC and a RISC processor is/are

that a RISC processor typically
Accumulator
is easier to implement
using hard-wired control
logic
18
The total size of address space in a virtual memory system is limited

by
19
Which of the following requires value of data with the instruction
96
97
2
3
10
11
12
4-input, 8-bit
Correct Answer
2-input, 4-bit
48.487
59.625
D6C5
none
(5A)16
There is an execution
All above
There is a fetch
cycle stealing
Bus grant
bit stealing
Virtual memory
Main memory
Secondary memory
greater speed
smaller chip size
fewer masks for

fabrication
4-input, 16-bit
2-input, 8-bit
memory, IO, DAM
ALU CPU Memory
Memory CPU IO
CU ALU Registers
Special Register
C Register
B Register
Accumulator
Assembly Language
Programming
Register Transistor
Language
PC points to the last
instruction that was
executed
Stack Pointer
B
Register Translation
Language
Register Transformation
Language
All instructions affect the

flag
All instructions affect the

flag
Program Counter
All of the above
has fewer instructions
has more registers
has fewer addressing

modes
the length of MAR
the available secondary

storage
the available main

memory
all of above
Direct
indirect
base index
Immediate
68
Sr.
20
21
22
Question
The access method used for magnetic tape is_________
Which is an important data transfer technique ?
Which disk read the data by reflecting pulses of laser beams on the
surface ?
Answer A
Direct
CPU
Answer B
Random
DMA
Answer C
Sequential
CAD
Answer D
None of the above
None of these
Correct Answer
C
B
Magnetic disk
Soft disk
Floppy disk
Optical disk
Universal asynchronous
receiver/transmitter
United asynchronous
Universal automatic
23
UART stands for
Universal
asynchronization
24
______operations are the results of I/O operations that are written

in the computer program
Programmed I/O
DMA
Handshaking
Strobe
25
DMAC stands for
Direct memory
accumulator controller
Direct memory access

controller
Direct memory access

content
Direct main access

controller
DCP
IOP
Both a & b
None
Primary
RAM
Cache
None of these
Pop
CALL
MOV
PUSH
Uni-directional
is Not Important.
immediate
0-address
Memory register
instruction
Execution cycle
Reduced Instruction Set
Computer
Bi-directional
is Important
direct
Binary
Memory regular
instruction
Register cycle
Register Instruction Set
Computer
Non-directional
is bidirectional
register
1-address
Memory reference
instruction
Fetch cycle
Register Interrupt Set
Computer
None of the given

is unidirectional
micro
2-address
Interrupt cycle
Reduced Interrupt Set
Computer
ALP
Machine language
OPCODE
Higher language
29
30
31
32
Which may be classified as a processor with the direct memory

access capability that communicates
Which is used for this and known as high speed buffer exist with
almost each process?
___ decrements SP (the stack pointer) by two and then transfers a
word from the source operand to
Data bus is
Control bus________
Which of the following is an invalid addressing mode ?
Which is the invalid instruction type ?
33
MRI stands for
34
When an interrupt occurs, following will take place
35
RISC stands for
26
27
28
B
D
Most register instruction
37
The language which is understandable by the computer system is

known as
Which of the following is not a valid expression notation ?
Postfix notation
Outfix notation
Infix notation
38
Expressions can be evaluated with the help of which data structure ? Stack
Queue
Register
Accumulator
39
Which is considered as the most basic operation in a computer

system ?
Instruction
Microoperation
Pseudoinstruction
Minioperation
40
Stack is nothing but a set of
reserved ROM address

space
reserved RAM address

space
reserved IO address space none of the above
-128 to +128
-128 to +127
-127 to +128
-127 to +127
2 processors
2 operands
3 processors
1 operands
4 processors
3 operands
none of the above

none of the above
Overflow
Zero result
none of the above
Negative result
Array processor
Von Neumann
All of the above
36
Prefix notation
42
43
If negative numbers are stored in 2's complement system, the range

of numbers that can be stored
To achieve parallelism one needs a minimum of
Any instruction should have at least
44
Which of the following is not typically found in the status register ?
45
Which of the following architecture is not suitable for realizing SIMD

Vector Processor
?
41
69
Sr.
46
Question
Which of the following units can be used to measure the speed of a
computer ?
Answer A
Answer B
Answer C
Answer D
SYPS
BIPS
BAUD
FLOPS
the cost to store a bit is

consume less power
less
Indirect mode instruction Based index addressing
Immediate mode
mode instruction
instruction
47
Bubble memory is preffered over floppy disks because
of their higher transfer

rate
48
All register reference instruction that use accumulator are
Implied mode instruction
49
A certain processor supports only the immediate and the direct

addressing modes. Which of the
Pointers Records
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
Correct Answer
the cost to store a bit is

high
Arrays
Records
Recursive procedures with

local variable
when PUSH is executed , the stack pointer register is decremented by 1 0
Offset value
The operating mode of I/O devices is_______ for different device
Same Optimum
Different
Optimum
Medium
Isolated I/O
Memory-mapped I/O
Both a & b
None of these
Synchronous
Asynchronous
Clock dependent
Decoder independent
Interrupt-initiated I/O
DMA
IOP
DCP
An IRQ Conflict
An IRQ Crash
An IRQ Collision
An IRQ Blockage
Counter register
AL or AX
1 argument
Flag register
The concatenation of DX
and AX
AL or AX
1 argument
Base register
The concatenation of ES
and AX
CL or CX
3 arguments
Desination register
The concatenation of DS
and BX
DL or DX
No arguments
source
pointer
index
counter
AX
BX
CX
DX
4 GB
8 GB
8 GB
CALL instruction
POP instruction
Jump instruction
RET instruction
Literal
Immediate
Variable
Indirect
Label
Direct
Starting point
Register
C
A
There are 2 ways in which addressing can be done in memory and

I/O device
If CPU and I/O interface share a common bus than transfer of data
b/w 2 units is said to be
______processor has to check continuously till device becomes
ready for transferring the data
When two devices in the system want to use the same IRQ line then
what will happen?
CX register mostly use a
When the operand of DIV instruction is of 16-bits then implied
dividend will be stored in______
The source register in OUT is
To transfer control back the RET instruction take
In assembly the CX register is used normally as a
______________register
When a 16 bit number is divided by an 8 bit number, the dividend
will be in
AX register
A 32bit address register can access upto ............................of memory 2 GB

When the subprogram finishes, the ____________________
retrieves the return address from the
In total: dw 0 Opcode total is a ___________
In mov ax, 5 is _____________ Addressing Mode
66
In mov [SI], AX is _____________ Addressing Mode
Base Register Indirect
Indirect
Indexed Register Indirect
Immediate
67
In mov ax, [bx - Si] is ___________ Addressing Mode

A computer with 32 bit data bus uses 4 K X 8 static RAM memory
chips. The smallest memory this
PSW does not have following flag
Instructions which are not meant for execution are known as
Base Register Indirect
Indirect
Direct
Illegal
32 K
16 K
8K
24 K
Zero
Fakeinstructions
Sign
Extrainstruction
Overflow
Noninstruction
Positive
Pseudoinstructions
68
69
70
70
Sr.
71
72
73
74
75
76
77
78
79
80
81
82
Question
Increment operation is incorporated with which instruction ?
Following cannot be part of an instruction
The fastest memory available on earth is
The instruction used to shift right the accumulator content by one bit
through the carry flag bit is
The only interrupt that is edge triggered is
Which is the non-maskale interrupt ?
A typical application of MIMD is
SIMD can be used for
The advantage of single bus over multibus is the
The addressing mode used in the instruction PUSH B is
The addressing mode used in the instruction ADD X, Y is
When a very large number is divided by very small number so that
the quotient is larger than the
Answer A
IZS
Lable
RAM
Answer B
ISZ
Opcode
Cache
Answer C
ICR
Comment
ROM
Answer D
CIR
Data
Register
Correct Answer
RLC
RAL
RRC
RAR
INTR
TRAP
railway reservation
railway reservation
Low cost
Direct
Absolute
TRAP
RST 7.5
weather forecasting
parallel processing
Parallel operation
Register
Immediate
RST 7.5
INTR
matrix multiplication
matrix multiplication
High operating speed
Register Indirect
Indirect
RST 5.5
RST 6.5
all of above
all of above
All of the above
Immediate
Indexed
A
C
Divide logical error
Divide overflow error
Divide syntax error
An illegal instruction
data bus,accumulator
accumulator, Address Bus
accumulator,memory
C
B
B
A
A
C
83
There is a central register in every processor called the _______ and

The word size of a processor is
accumulator,accumulator
84
___________does not hold data but holds the address of data
Pointer, Segment, or Base Pointer, Index, or Base

Register
Register
General Registers
Instruction Pointer
85
Memory references are processed in which pass of the assembler ?
1 pass
2 pass
3 pass
4 pass
86
Address symbol table is built in which pass of the assembleer ?
1 pass
2 pass
3 pass
4 pass
Vector Processing
Parallel Execution
Pipelining
Parallel Processing
CIL
ICL
ISZ
SIZ
Prefix notation
Infix notation
Postfix notation
Outfix notation
Memory Compaction
Memory interleaving
Reducing the size of

memory
Inreasing the size of

memory
87
88
89
90
FetchDecode.Execute phases are overlapped to spped up the

overall execution
Content of a register is shifted in circular manner for following
instruction
Which notation is considered to be the best for execution of an
instruction ?
The speed imbalance between memory access and CPU operation
can be reduced by
interrupting source
branch address is assigned supplies the branch
to a fixed location in
information to the
memory
processor through
interrrupt vector
CLR A
ORA A
91
In a vector interrupt the
92
Which of the following instruction may be used to clear the content

of accumulator ?
93
Instructions taking
Which of the following is the typical characteristic of RISC machine ?
multiple cycles
94
A microprogramed control unit
Highly pipelined
is faster than a hard wired facilitated easy

implementation of new
control unit
instructions
branch address is obtained

from register in the
none of the above
processor
SUB A
MOV A, 00h
Instructions interpreted by
None of above
microprogramme
is useful when very small useally referes to the
control unit of a
programs to be run
microprocessor
D
A
71
Sr.
Question
Which of the following instruction may be used to save the
95
accumulator value onto the stack ?
96
Von Neumann architecture is
A computer uses 8 digit mantissaand 2 digit exponent. If a=0.052 and
97
b=28E + 11 then b+a-b will
The most relevant addressing mode to write position independent
98
code is
The seek time of a disk is 30 ms. It rotates at the rate of 30 rotations
99
per second. Each track has a
The number of instructions needed to add 'n' numbers and store the
100
result in memory using only
Answer A
Answer B
Answer C
Answer D
Correct Answer
PUSH PSW
PUSH A
PUSH SP
POP PSW
SISD
SIMD
MIMD
MISD
overflow error
underflow errror
5.28E + 11
Direct mode
Indirect mode
Relative mode
Indexed mode
47 ms
50 ms
60 ms
62 ms
n-1
n+1
independent of 'n'

Pgcet 2013 Queans Full

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Pgcet 2013 Queans Full

Uploaded by

Copyright:

Available Formats

1

PGCET Entrance Exam solution for C.E. 2013

Which of the following statements about component testing is not

Function/Test matrix is a type of

A reliable system will be one that:

White Box Testing

Black Box Testing

Greater than 0.9

A black box testing

A black box testing

None of the above

all of the above.

In unit testing of a module, it is found that for a set of test data, at

Capture test cases

Stress testing measures

A Testing which detect the defects in fully functional software is

Pesting Paradox in testing testcase is

all of the above.

all of the above.

None of the above.

None of the above.

Face to face Communication is in

By repetating test case,

all of the above.

Common Testing System

Commercial off the shelf

Code and Test system

all of the above.

all of the above.

Disadvtage of prototype model is

Risk Analysis phase is in

advtage of prototype model is

Important aspect of coding is

Required Skill of Test Manager

all of the above.

If n number of programmers are in team , then number of paths is

all of the above.

all of the above.

Which of these is not element in object oriented analysis model

Class based element

Scenario based element

Relationship shown in data model is for

Behaviour modeling is for

Well defined process

Data element Hiarchy

Both (A) and (B)

State diagram is for

transorm data element

Reaction to external event all of the above.

In unit testing of a module, the maximum 90% of the code alone

A program P has p1 and p2 sub programs. Probability of p1 fails is

Which of this is not software engineering layers

Five generic software frame work activities are

analysis , Design, Code,

Incremental model approach in software development is useful in

The approach/document used to make sure all the requirements are

develop core module

Testing and validation

Are delivered on time and Have complete

What are the three generic phases of software engineering?

Coupling and cohesion can be represented using a

Software feasibility is based on which of the following

The first item defined for a new system is its

it is on a set of fields that