Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Download
Standard view
Full view
of .
Look up keyword
Like this
2Activity
0 of .
Results for:
No results containing your search query
P. 1
Technical Aptitude Questions eBook-172 Pages

Technical Aptitude Questions eBook-172 Pages

Ratings: (0)|Views: 33|Likes:
Published by api-26189934

More info:

Published by: api-26189934 on Oct 15, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

05/09/2014

pdf

text

original

Face Interviews Confidently!
Table of Contents

Data Structures Aptitude....................................................................................................3 C Aptitude............................................................................................................... . . . . . . . . . .11 C++ Aptitude and OOPS..................................................................................................68 Quantitative Aptitude........................................................................................................94 UNIX Concepts...............................................................................................................110 RDBMS Concepts...........................................................................................................123 SQL..................................................................................................................................139 Computer Networks........................................................................................................146 Operating Systems..........................................................................................................154

2
Data Structures
Data Structures Aptitude
1. What is data structure?

A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.

2. List out the areas in which data structures are applied extensively?

\ue000Compiler Design,
\ue000Operating System,
\ue000Database Management System,
\ue000Statistical analysis package,
\ue000Numerical Analysis,
\ue000Graphics,
\ue000Artificial Intelligence,
\ue000Simulation

3. What are the major data structures used in the following areas : RDBMS, Network
data model & Hierarchical data model.
\ue000RDBMS
\u2013 Array (i.e. Array of structures)
\ue000Network data model
\u2013 Graph
\ue000Hierarchical data model \u2013 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 we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is capable of storing pointer to any type as it is a generic pointer type.

5. Minimum number of queues needed to implement the priority queue?
Two. One queue is used for actual storing of data and another for storing
priorities.
6. What is the data structures used to perform recursion?

Stack. Because of its LIFO (Last In First Out) property it remembers its \u2018caller\u2019 so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls.

Every recursive function has its equivalent iterative (non-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.
3

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->