Upload

Browse
Download
Standard view
Full view
1
OF 177
Technical Aptitude
Questions eBook
Ratings: (0)|Views: 52|Likes: 1
Published by nileshyadav888
TECHNICAL
See More

Face
Interviews
Confidently!



Technical
Aptitude
Questions
Table
of
Content
s

Data Structures
Aptitude.................
...............................
...............................
.....................3C
Aptitude
...............................
...............................
...............................
...........................12
C++ Aptitude and
OOPS....................
...............................
...............................
................76 Quan
titative
Aptitude.................
...............................
...............................
.......................105
UNI X
Concepts................
...............................
...............................
...............................
..123 RDBMS
Concepts................
...............................
...............................
.............................1
37 SQL.................
...............................
...............................
...............................
....................155Co
mputer
Networks...............
...............................
...............................
...........................16
3Operating
Systems..................
...............................
...............................
..........................17
1
Copyright: Vyom
Network
(http://www.vyomwo
rld.com) - All Rights
Reserved
2

Technical
Aptitude
Questions
Data
Structures
Aptitude

1.What is data
structure?
A data structure
is a way of
organizing data
that considers not
only the
itemsstored, but
also their relatio
nship to each oth
er. Advance kno
wledge about the
relationship betw
een data items all
ows designing of
efficient algorith
ms for themanipu
lation of data.
2.List out the
areas in which
data structures
are applied
extensively?

Compiler Design,

Operating System,

Database
Management
System,

Statistical analysis
package,

Numerical
Analysis,

Graphics,

Artificial
Intelligence,

Simulation
3.What are the
major data
structures used in
the following
areas : RDBMS,
Network data
model &
Hierarchical data
model.

RDBMS
Array (i.e. Array
of structures)

Network data
model Graph

Hierarchical data
model Trees
4.If you are using
C language to
implement the
heterogeneous
linked list, what
pointer type will
you use?
The
heterogeneous
linked list
contains different
data types in its
nodes and weneed
a link, pointer to
connect them. It is
not possible to use
ordinary pointers
for this. Sowe go
for void pointer.
Void pointer is
capable of storing
pointer to any
type as it is
ageneric pointer
type
.
5.Minimum
number
of queues needed t
o implement the
priority queue?
Two. One queue
is used for actual
storing of data a
nd another for st
oring priorities.
6.What is the data
structures used to
perform
recursion?
Copyright: Vyom
Network
(http://www.vyomwo
rld.com) - All Rights
Reserved
3
Data
Structure
s Aptitu
de




You're reading a free preview.

Pages 4 to 24 are not shown in this preview.

Read the full version


Technical
Aptitude
QuestionsStack.
Because of its
LIFO (Last In
First Out) property
it remembers its
caller soknows
whom to return
when the function
has to return.
Recursion makes
use of systemstack
for storing the
return addresses of
the function calls.
Every recursive fu
nction has its equi
valent iterative (no
n-
recursive) function
.
Even when such
equivalent
iterative
procedures are
written, explicit
stack is to be used.
7.What are the
notations used in
Evaluation of
Arithmetic
Expressions using
prefix and postfix
forms?
Polish and Reverse
Polish notations.
8.Convert the
expression ((A +
B) * C (D E)
^ (F + G)) to
equivalent Prefix
and Postfix
notations.
Prefix Notation:^ -
* +ABC - DE +
FGPostfix
Notation:AB + C *
DE - - FG + ^
9.Sorting is not
possible
by using which
of the following
methods?(a)
Insertion(b)
Selection(c)
Exchange(d)
Deletion
(d) Deletion.Using
insertion we can
perform insertion
sort, using
selection we can
performselection
sort, using
exchange we can
perform the bubble
sort (and other
similar
sortingmethods).
But no sorting
method can be
done just using
deletion.
10.A binary tree w
ith 20 nodes has n
ull branches?
21Let us take a
tree with 5 nodes
(n=5)It will have
only 6 (ie,5+1)
null branches. In
general,
A binary tree with
n
nodes has exactly
n+1
null
nodes.11.What are
the methods
available
in storing
sequential files ?

Straight merging,
Copyright: Vyom
Network
(http://www.vyomwo
rld.com) - All Rights
Reserved
4
Null Branches

You're Reading a Free Preview
Page 4 is not shown in this preview.
Download

Technical
Aptitude
Questions

Natural merging,

Polyphase sort,

Distribution of
Initial runs.
12.How many
different trees are
possible with
10 nodes ?
1014For example,
consider a tree
with 3
nodes(n=3), it
will have the
maximumcombina
tion of 5 different
(ie, 2
3
- 3 = 5)
trees.i
i i
i i
i
i v
v In
general:
If there are
n
nodes, there exist
2
n
-n
different
trees.13.List out
few of the
Application of
tree data-
structure?

The manipulation
of Arithmetic
expression,

Symbol Table
construction,

Syntax analysis.
14.List out few of
the applications
that make use
of Multilinked
Structures?

Sparse matrix,

Index generation.
15.In tree
construction which
is the suitable
efficient data
structure?(a) Arra
y (b) Linked list (c)
Stack (d) Queue (
e) none
(b) Linked list
16.What is the type
of the algorithm
used in solving the
8 Queens
problem?
Backtracking
17.In an AVL tree,
at what condition
the balancing is to
be done?
If the pivotal
value (or the
Height factor) is
greater than 1 or
less than 1.
18.What is the
bucket size, when
the overlapping
and collision
occur at same
time?
Copyright: Vyom
Network
(http://www.vyomwo
rld.com) - All Rights
Reserved
5

You're Reading a Free Preview
Page 5 is not shown in this preview.
Download
You're Reading a Free Preview
Page 6 is not shown in this preview.
Download
You're Reading a Free Preview
Page 7 is not shown in this preview.
Download
You're reading a free preview.

Pages 28 to 39 are not shown in this preview.

Read the full version

You're reading a free preview.

Pages 43 to 52 are not shown in this preview.

Read the full version

You're reading a free preview.

Pages 56 to 84 are not shown in this preview.

Read the full version

You're reading a free preview.

Pages 88 to 177 are not shown in this preview.

Read the full version

Activity (0)
Filters
Add to collectionReview Add NoteLikeEmbed
No activity yet
More From This User

UPSC 2014 Exams

NILESHYADAV888

India Transportation
NILESHYADAV888

01 Sentence Structure DVD

NILESHYADAV888

Grammar Book
NILESHYADAV888

Periodic Table of the Elements

NILESHYADAV888

Raiway budjet 2013 - Gr8AmbitionZ

NILESHYADAV888

Current Affair Quiz

NILESHYADAV888

PSU Bank Exam Solved Paper

NILESHYADAV888

Download and print this document

Read and print without ads

Download to keep your version

Edit, email or read offline
Choose a format:
.PDF .DOC
Download
Recommended


Wild Heart: A Life
HarperCollins
Born in 1876, Natalie Barney-beautiful, charismatic, brilliant and wealthy-w...


China to Me
E-Reads, Ltd.
A revolutionary woman for her time, Emily Hahn takes us on an adventure throu...


Talking to the Dead: A Novel
David C Cook
Twentysomething Kate Davis can't seem to get this grieving-widow thing right....


Paris Without End: The True Story of ...
HarperCollins
Hadley Richardson and Ernest Hemingway were the golden couple of Paris in th...
Previous|NextPage 1 of 3
Download and print this document

Read and print without ads

Download to keep your version

Edit, email or read offline
Choose a format:
.PDF .DOC
Download

About

Browse Books

About Scribd

Team

Blog

Join our team!

Contact Us
Subscriptions

Subscribe today

Your subscription

Gift cards
Advertise with us

AdChoices
Support

Help

FAQ

Press

Purchase Help
Partners

Publishers

Developers / API
Legal

Terms

Privacy

Copyright
Get Scribd Mobile

Mobile Site
Copyright 2014 Scribd Inc.
Language:
English