Campus Booklet
Campus Booklet
- A Comprehensive Guide to
Placements
Preface
This book also serves as a question bank for Computer Science. However this book
has a three main differences from other question banks available in the market. This book
covers only the most important of the subjects; within the concerned subject it covers only
essential questions and most in cases, it gives detailed answers. So, this book stands with
an advantage over the question banks.
This book can also serve for students appearing for various competitive exams
related to computer science. For instance the first part of book is suitable for the entrance
exam preparation for MCA for various universities and colleges throughout the country.
Similarly this book can be handy for the students appearing for NCSTs CST (Competency
This book is very handy for students and teachers looking for a book that cover the essence
of important subjects in form of question and answers.
Part II Concepts of this book can serve also as a FAQ on important topics in Computer
Science.
Anyone interested in increasing the aptitude in computer related areas, can use this book.
Even though this book is not written having beginners in mind, with little struggle, they can
make-up to read the book, because this book addresses main concepts from the basics
moving towards more tough areas.
Sometimes it can also serve as a general reference; when in doubt about important topic,
they can always look for information about that topic.
This book neither has full-fledged/in-depth coverage of subjects, nor can be used as
teaching material/textbook. If that is your intention, there are other books available; few of
them listed under suggested reading. This book is meant to be far from them. It is rather a
refresher of core concepts in important subjects.
Each chapter is organized such that the reader can start from any chapter and know more
about that topic and is mostly independent of other chapters. General readers may be
selective in reading the chapters according to their need.
The book starts with a short introduction to placements. The whole book is divided into
two parts:
Part I - Aptitude and
Part II - Concepts.
Part I - Aptitude covers the aptitude part essential for appearing for the written tests for
the various companies and exams. This part mostly follows a question-answer-explanation
format, because for aptitude preparation, the objective type is not sufficient. If the reader is
able to prepare and answers in this manner, answering objective questions is direct and
easy.
Part II Concepts is for information on areas of specialization that will be useful for
attending technical interviews (and sometimes asked in the written tests too). It is more
likely that the interviewers ask questions on most important of the topics in Computer
Science to judge the technical capability of the candidate. This part serves to be a refresher
of concepts on important topics and covers most of the important underlying facts/concepts
that a computer science student should be familiar with.
The Part I Aptitude has a problem solving approach and consists of four chapters. We
encourage the readers to try to solve the problems provided than to just read them. Problem
solving is an area where there are more possibilities for making silly errors; only practice
can help in avoiding them. This will also enable them to access their strong-points and
weaknesses and help improving them. Since explanations are provided, it will help
understanding the concept behind the question asked and reason it out why the answer is.
The next chapter is on C++ and Java aptitude. C++ is such a complex language that it is
almost impossible to cover all the areas, so we have given our best to address most
important of the concepts. Java is a relatively new language and it will take some more
time for the companies to concentrate more on Java. So there are comparatively few
questions on Java and that too are intended to be sampling questions on most of the mustknow topics in Java.
The third chapter is on UNIX and SQL. This part is useful both for written tests and
interviews; so it doesn't follow the question-answer-explanation format. UNIX covers the
most important of the usage of various commands in the common subset of UNIX systems.
The shell programming is not covered because there exits many popular UNIX shells and
providing a common subset of questions for all shells is not possible. SQL questions are
targeted at improving the ability to solve commonly asked SQL queries given a schema.
PL/SQL is not covered for the same reason as with shell programming.
The final chapter of the first part of this book is on general aptitude. Quantitative aptitude
takes major part in placement selection papers. It is almost impossible to cover the general
aptitude section in a full-fledged manner. So important formulae are listed in the beginning
of the chapter. This chapter is just gives a taste of how the general aptitude questions will
look like in actual written tests.
The Part II Concepts is made-up of 7 chapters.
The chapter on Data Structures and Algorithms is of primary importance of all the chapters
in this part. Since this subject is a base subject for computer science, a clear understanding
of the concepts is necessary and this chapter serves the purpose of covering the important
of the concepts to be understood.
The next chapter is on Database Management Systems. This chapter covers most of the
important rules and concepts that an interviewer may expect that the candidate be aware of.
The next chapter is on Object Oriented Programming and Object Oriented Analysis and
Design. OOPs concepts are covered based on C++ since it is the widely used language.
OOAD addresses the analysis and design concepts in general and UML in particular.
The next two chapters, Operating Systems and UNIX are interrelated. The general
concepts on OS are covered in the chapter on OS and the application of those concepts of
how they take shape in the UNIX operating system is discussed in the chapter on UNIX.
The chapter on UNIX has three sub-sections: process management, memory management
and file management. Some questions that are specific to UNIX System V are there in
section of memory management and such contexts are specified explicitly.
Computer Networks is a hot topic in todays context and many of the definitions are
covered in this chapter. The final chapter is on client/server computing and there is more
possibility that the interviewers will ask questions on this since this is the age of Internet
As a whole the chapters are organized such that they provide an overall coverage of most
of the concepts required to be known by a student attending for placements.
.
Appendix-I of the book lists the subjects covered for the written tests conduced by
important IT companies. Appendix-II lists the books suggested for further reading on
selected topics.
Notes on Formatting
The questions are italicized to distinguish them from the answers. The words that
are italicized inside the normal text indicate special meaning or their importance.
TABLE OF CONTENTS
Preface
An Introduction to Placements
PART I
APTITUDE
C Aptitude
C++ and Java Aptitude
UNIX Commands and SQL Statements
General Aptitude
PART II
CONCEPTS
Data Structures and Algorithms
RDBMS concepts
OOPs and OOAD Concepts
Operating System Concepts
UNIX Concepts
Computer Networks
Client/Server Computing
APPENDIX I
List of Subjects Covered in Written Tests by Various Companies
APPENDIX II
Suggested Reading
An Introduction to
Placements
Introduction
This chapter gives an overview on campus placements (particularly on-campus, still the
most of the ideas will apply for off-campus selections too) and preparations for the
placements. You might already know most of the information given here, but we think
there is no harm in giving it.
getting placed. Identify your strong points and weaknesses and plan accordingly.
Preparation should start well ahead of the placement dates, and 6 months time will be more
than enough.
There are many facets that are to be considered for preparing for placements. The
preparation should constitute: improving technical capabilities, increasing the general
aptitude, developing good communication skills and mental preparation.
Technical Capabilities:
Long before placements start, you should have clearly identified your areas of
interest and specialization.
subjects.
Non-computer science students need to be strong in their areas of graduation. Still
knowledge of computers and C language is very much desirable.
If you don't know C language basics, start learning C immediately. Knowledge of C
language is a must and almost all the companies test C aptitude. C++, Java and UNIX
aptitude will be an added advantage. It is worthwhile investing lot of time improving your
aptitude in these areas; they are here to stay in IT field for a long time.
General Aptitude:
Good skills in general aptitude is a must to pass the written test, and sometimes in
interview also general aptitude skills are tested. You can perform better if you prepare well
for improving this aptitude. Both short and long term preparation shall be useful. Know the
shortcuts for answering these questions since time is an important factor in answering these
questions. Memorize important formulae and many of them are listed in the chapter
dedicated for general aptitude in this book.
Now lets look at few tips on solving the general aptitude questions.
- Each one of you will have your own positive and negative aspects in problem
solving. First identify your gray areas first and work on them assiduously.
- The two most important attributes when we go for any aptitude test is speed and
accuracy. One without the other is meaningless.
- Remember that it is almost humanly impossible to solve all the problems in the
stipulated time because it will then reflect poorly on the standard of the question paper
being set and no company will ever allow that. So don't be in too much of a hurry to answer
all the questions and in the process make some stupid errors.
- Reasoning ability is more important and not our mathematical skills. Almost 95%
of our problems do not require too much of a mathematical intellect on our part.
- When you sit in for a test try to identify those problems that take more time to
solve. Remember that all the questions carry equal marks and it doesn't make sense for us
to solve one problem in say 30 seconds and another in, say 3 minutes. Skip such questions
in the beginning and come back to them later if and when you have time.
Communication Skills:
Having good oral communication skills is a must for success in the personal
interview. Its enough that you are able to communicate your ideas effectively without any
inhibitions in English.
English is a language in which you can achieve a considerable fluency in a short
time span. This requires a conscious effort on your part, and thus, a good command over
the English language can be achieved. Make it a point that you speak in English with your
friends and ask them to point out the mistakes you commit while you speak.
Mental Preparation
Mental preparation plays a vital role in the placements. We should have the
confidence that we can get placed. This is the basic and most important point to be noted.
Build a positive self-image and project the best in you.
Conclusion
The problem India faces is not the problem of unemployment; it is rather the
problem of 'unemployability'. We should make ourselves capable and improve ourselves to
make suitable for being employed. For that preparations will help a lot.
Part I : Aptitude
C Aptitude
Note: All the programs are tested under Turbo C/C++ compilers.
It is assumed that,
Programs run under DOS environment,
The underlying machine is an x86 system,
Program is compiled using Turbo C/C++ compiler.
Proper and required header files are included,
The program output may depend on the information based on this assumptions (for
example sizeof(int) == 2 may be assumed).
1.
void main(){
int const * p=5;
printf("%d",++(*p));
}
Answer:
Compiler error: Cannot modify a constant value.
Explanation:
p is a pointer to a "constant integer". But we tried to change the value of the
"constant integer".
2.
main(){
char s[ ]="man";
int i;
for(i=0;s[ i ];i++)
printf("\n%c%c%c%c",s[ i ],*(s+i),*(i+s),i[s]);
}
Answer:
mmmm
aaaa
nnnn
Explanation:
s[i], *(i+s), *(s+i), i[s] are all different ways of expressing the same idea.
Generally array name is the base address for that array. Here s is the base address. i
is the index number/displacement from the base address. So, indirecting it with * is
same as s[i]. i[s] may be surprising. But in the case of C it is same as s[i].
3.
main(){
float me = 1.1;
double you = 1.1;
if(me==you)
printf("I love U");
else
printf("I hate U");
}
Answer:
I hate U
Explanation:
For floating point numbers (float, double, long double) the values cannot be
predicted exactly. Depending on the number of bytes, the precision with of the
value represented varies. Float takes 4 bytes and long double takes 10 bytes. So
float stores 0.9 with less precision than long double.
Rule of Thumb:
Never compare or at-least be cautious when using floating point numbers
with relational operators (== , >, <, <=, >=,!= ) .
4.
main() {
static int var = 5;
printf("%d ",var--);
if(var)
main();
}
Answer:
54321
Explanation:
When static storage class is given, it is initialized once. The change in the
value of a static variable is retained even between the function calls. Main is also
treated like any other ordinary function, which can be called recursively.
5.
main(){
int c[ ]={2.8,3.4,4,6.7,5};
int j,*p=c,*q=c;
for(j=0;j<5;j++) {
printf(" %d ",*c);
++q;
for(j=0;j<5;j++){
printf(" %d ",*p);
++p;
}
Answer:
2222223465
Explanation:
Initially pointer c is assigned to both p and q. In the first loop, since only q
is incremented and not c , the value 2 will be printed 5 times. In second loop p itself
is incremented. So the values 2 3 4 6 5 will be printed.
6.
main(){
extern int i;
i=20;
printf("%d",i);
}
Answer:
Linker Error : Undefined symbol '_i'
Explanation:
extern storage class in the following declaration,
extern int i;
specifies to the compiler that the memory for i is allocated in some other program
and that address will be given to the current program at the time of linking. But
linker finds that no other variable of name i is available in any other program with
memory space allocated for it. Hence a linker error has occurred .
7.
main(){
int i=-1,j=-1,k=0,l=2,m;
m=i++&&j++&&k++||l++;
printf("%d %d %d %d %d",i,j,k,l,m);
}
Answer:
00131
Explanation :
Logical operations always give a result of 1 or 0 . And also the logical AND
(&&) operator has higher priority over the logical OR (||) operator. So the
expression i++ && j++ && k++ is executed first. The result of this expression
is 0
8.
main(){
char *p;
printf("%d %d ",sizeof(*p),sizeof(p));
}
Answer:
12
Explanation:
The sizeof() operator gives the number of bytes taken by its operand. P is a
character pointer, which needs one byte for storing its value (a character). Hence
sizeof(*p) gives a value of 1. Since it needs two bytes to store the address of the
character pointer sizeof(p) gives 2.
9.
main(){
int i=3;
switch(i) {
default:printf("zero");
case 1: printf("one");
break;
case 2:printf("two");
break;
case 3: printf("three");
break;
}
}
Answer :
three
Explanation :
The default case can be placed anywhere inside the loop. It is executed only
when all other cases doesn't match.
10.
main(){
printf("%x",-1<<4);
}
Answer:
fff0
Explanation :
-1 is internally represented as all 1's. When left shifted four times the least
significant 4 bits are filled with 0's.The %x format specifier specifies that the
integer value be printed as a hexadecimal value.
11.
main(){
char string[]="Hello World";
display(string);
}
void display(char *string){
printf("%s",string);
}
Answer:
Compiler Error : Type mismatch in redeclaration of function display
Explanation :
In third line, when the function display is encountered, the compiler doesn't
know anything about the function display. It assumes the arguments and return
types to be integers, (which is the default type). When it sees the actual function
display, the arguments and type contradicts with what it has assumed previously.
Hence a compile time error occurs.
12.
main(){
13.
14.
main(){
int i=10;
i=!i>14;
printf("i=%d",i);
}
Answer:
i=0
Explanation:
In the expression !i>14, NOT (!) operator has more precedence than >
symbol. ! is a unary logical operator. !i (!10) is 0 (not of true is false). 0>14 is false
(zero).
15.
main(){
char s[]={'a','b','c','\n','c','\0'};
char *p,*str,*str1;
p=&s[3];
str=p;
str1=s;
printf("%d",++*p + ++*str1-32);
}
Answer:
77
Explanation:
16.
main(){
int a[2][2][2] = { {10,2,3,4}, {5,6,7,8} };
int *p,*q;
p=&a[2][2][2];
*q=***a;
printf("%d----%d",*p,*q);
}
Answer:
SomeGarbageValue---1
Explanation:
p=&a[2][2][2] you declare only two 2D arrays, but you are trying to access
the third 2D(which you are not declared) it will print garbage values. *q=***a
starting address of a is assigned integer pointer. Now q is pointing to starting
address of a. If you print *q, it will print first element of 3D array.
17.
main(){
struct xx{
char name[]="hello";
};
struct xx *s;
printf("%s",s->name);
}
Answer:
Compiler Error
Explanation:
You should not initialize variables in structure declaration.
18.
main(){
struct xx{
int x;
struct yy{
char s;
struct xx *p;
};
struct yy *q;
};
}
Answer:
No output.
Explanation:
Pointer to the same type of structures are known as self referential
structures. They are particularly used in implementing datastructures like trees.
Structures within structures are known as nested structures.
19.
main()
{
printf("\nab");
printf("\bsi");
printf("\rha");
}
Answer:
hai
Explanation:
\n - newline
\b - backspace
\r - linefeed
20.
main()
{
int i=5;
printf("%d%d%d%d%d%d",i++,i--,++i,--i,i);
}
Answer:
45545
Explanation:
The arguments in a function call are pushed into the stack from left to right.
The evaluation is by popping out from the stack. and the evaluation is from right to
left, hence the result.
21.
22.
main()
{
23.
#define a 10
main()
{
#define a 50
printf("%d",;
}
Answer:
50
Explanation:
The preprocessor directives can be redefined anywhere in the program. So
the most recently assigned value will be taken.
24.
}
Note:
100; is an executable statement but with no action. So it doesn't give any
problem.
25.
main(){
printf("%p",main);
}
Answer:
Some address will be printed.
Explanation:
Function names are just addresses (just like array names are
addresses).main() is also a function. So the address of function main will be printed.
%p in printf specifies that the argument is an address. They are printed as
hexadecimal numbers.
26.
main(){
clrscr();
}
clrscr();
Answer:
No output/error
Explanation:
The first clrscr() occurs inside a function. So it becomes a function call. In
the second clrscr(); is a function declaration (because it is not inside any function).
27.
28.
void main(){
char far *farther,*farthest;
printf("%d..%d",sizeof(farther),sizeof(farthest));
}
Answer:
4..2
Explanation:
The second pointer is of char type and not a far pointer
29.
main(){
int i=400,j=300;
printf("%d..%d");
}
Answer:
400..300
Explanation:
printf takes the values of the first two assignments of the program. Any
number of printf's may be given. All of them take only the first two values. If more
number of assignments given in the program,then printf will take garbage values.
30.
main(){
char *p;
p="Hello";
printf("%c\n",*&*p);
}
Answer:
H
Explanation:
* is a dereference operator & is a reference operator. They can be
applied
any number of times provided it is meaningful. Here p points to the first character
in the string "Hello". *p dereferences it and so its value is H. Again & references it
to an address and * dereferences it to the value H.
31.
main(){
int i=1;
while (i<=5){
printf("%d",i);
if (i>2)
goto here;
i++;
}
}
fun(){
here:
printf("PP");
}
Answer:
Compiler error: Undefined label 'here' in function main
Explanation:
Labels have functions scope, in other words The scope of the labels is
limited to functions . The label 'here' is available in function fun() Hence it is not
visible in function main.
32.
main(){
static char names[5][20]={"pascal","ada","cobol","fortran","perl"};
int i;
char *t;
t=names[3];
names[3]=names[4];
names[4]=t;
for (i=0;i<=4;i++)
printf("%s",names[i]);
}
Answer:
Compiler error: Lvalue required in function main
Explanation:
Array names are pointer constants. So it cannot be modified.
33.
void main(){
int i=5;
printf("%d",i++ + ++i);
}
Answer:
Output Cannot be predicted exactly.
Explanation:
Side effects are involved in the evaluation of i.
34.
void main(){
int i=5;
printf("%d",i+++++i);
}
Answer:
Compiler Error
Explanation:
The expression i+++++i is parsed as i ++ ++ + i which is an illegal
combination of operators.
35.
main(){
int i=1,j=2;
switch(i){
case 1: printf("GOOD");
break;
case j: printf("BAD");
break;
}
}
Answer:
Compiler Error: Constant expression required in function main.
Explanation:
The case statement can have only constant expressions (this implies that we
cannot use variable names directly so an error).
Note:
Enumerated types can be used in case statements.
36.
main(){
int i;
printf("%d",scanf("%d",&i)); // value 10 is given as input here
}
Answer:
1
Explanation:
Scanf returns number of items successfully read.Here 10 is given as input
which should have been scanned successfully. So number of items read is 1.
37.
38.
main(){
int i=0;
for(;i++;printf("%d",i)) ;
printf("%d",i);
}
Answer:
1
Explanation:
Before entering into the for loop the checking condition is "evaluated". Here
it evaluates to 0 (false) and comes out of the loop, and i is incremented (note the
semicolon after the for loop).
39.
main(){
extern int i;
i=20;
printf("%d",sizeof(i));
}
Answer:
Linker error: undefined symbol '_i'.
Explanation:
extern declaration specifies that the variable i is defined somewhere else.
The compiler passes the external variable to be resolved by the linker. So compiler
doesn't find an error. During linking the linker searches for the definition of i. Since
it is not found the linker flags an error.
40.
main(){
printf("%d", out);
}
int out=100;
Answer:
Compiler error: undefined symbol out in function main.
Explanation:
The rule is that a variable is available for use from the point of declaration.
Even though a is a global variable, it is not available for main. Hence an error.
41.
main(){
extern out;
printf("%d", out);
}
int out=100;
Answer:
100
Explanation:
This is the correct way of writing the previous program.
42.
main(){
show();
}
void show(){
printf("I'm the greatest");
}
Answer:
Compier error: Type mismatch in redeclaration of show.
Explanation:
When the compiler sees the function show it doesn't know anything about it.
So the default return type (ie, int) is assumed. But when compiler sees the actual
definition of show mismatch occurs since it is declared as void. Hence the error.
The solutions are as follows:
1. declare void show() in main() .
2. define show() before main().
3. declare extern void show() before the use of show().
43. main( ){
int a[2][3][2] = {{{2,4},{7,8},{3,4}},{{2,2},{2,3},{3,4}}};
printf(%u %u %u %d \n,a,*a,**a,***;
printf(%u %u %u %d \n,a+1,*a+1,**a+1,***a+1);
}
Answer:
100, 100, 100, 2
114, 104, 102, 3
Explanation:
The given array is a 3-D one. It can also be viewed as a 1-D array.
2 4
7 8 3
4 2
2 2
3
3
4
100 102 104 106 108 110 112 114 116 118 120 122
Thus, for the first printf statement a, *a, **a give address of first element.
Since the indirection ***a gives the value. Hence, the first line of the output. For
the second printf a+1 increases in the third dimension thus points to value at 114,
*a+1 increments in second dimension thus points to 104, **a +1 increments the
first dimension thus points to 102 and ***a+1 first gets the value at first location
and then increments it by 1. Hence, the output.
44.
main( ){
int a[ ] = {10,20,30,40,50},j,*p;
for(j=0; j<5; j++){
printf(%d ,*;
a++;
}
p = a;
for(j=0; j<5; j++){
printf(%d ,*p);
p++;
}
}
Answer:
Compiler error: lvalue required.
Explanation:
Error is in line with statement a++. The operand must be an lvalue and may
be of any of scalar type for the any operator, array name only when subscripted is
an lvalue. Simply array name is a non-modifiable lvalue.
45.
main( ){
static int a[ ] = {0,1,2,3,4};
int *p[ ] = {a,a+1,a+2,a+3,a+4};
int **ptr = p;
ptr++;
printf(\n %d %d %d, ptr-p, *ptr-a, **ptr);
*ptr++;
printf(\n %d %d %d, ptr-p, *ptr-a, **ptr);
*++ptr;
printf(\n %d %d %d, ptr-p, *ptr-a, **ptr);
++*ptr;
printf(\n %d %d %d, ptr-p, *ptr-a, **ptr);
}
Answer:
111
222
333
344
Explanation:
Let us consider the array and the two pointers with some address
a
0
100
1
102
2
104
3
106
4
108
p
100
102
104
106
108
1000 1002 1004 1006 1008
ptr
1000
2000
After execution of the instruction ptr++ value in ptr becomes 1002, if
scaling factor for integer is 2 bytes. Now ptr p is value in ptr starting location of
array p, (1002 1000) / (scaling factor) = 1, *ptr a = value at address pointed by
ptr starting value of array a, 1002 has a value 102 so the value is (102 100)/
(scaling factor) = 1, **ptr is the value stored in the location pointed by the pointer
of ptr = value pointed by value pointed by 1002 = value pointed by 102 = 1. Hence
the output of the firs printf is 1, 1, 1.
After execution of *ptr++ increments value of the value in ptr by scaling
factor, so it becomes1004. Hence, the outputs for the second printf are ptr p = 2,
*ptr a = 2, **ptr = 2.
46.
main( ){
char *q;
int j;
for (j=0; j<3; j++) scanf(%s ,(q+j));
for (j=0; j<3; j++) printf(%c ,*(q+j));
for (j=0; j<3; j++) printf(%s ,(q+j));
}
Explanation:
Here we have only one pointer to type char and since we take input in the
same pointer thus we keep writing over in the same location, each time shifting the
pointer value by 1. Suppose the inputs are MOUSE, TRACK and VIRTUAL. Then
for the first input suppose the pointer starts at location 100 then the input one is
stored as
M
\0
M
T
R
A
C
K
\0
The third input starts filling from the location 102
M
T
V
I
R
This is the final value stored .
\0
The first printf prints the values at the position q, q+1 and q+2 = M T V
The second printf prints three strings starting from locations q, q+1, q+2
i.e MTVIRTUAL, TVIRTUAL and VIRTUAL.
47.
main( ){
void *vp;
char ch = g, *cp = goofy;
int j = 20;
vp = &ch;
printf(%c, *(char *)vp);
vp = &j;
printf(%d,*(int *)vp);
vp = cp;
printf(%s,(char *)vp + 3);
}
Answer:
g20fy
Explanation:
Since a void pointer is used it can be type casted to any other type pointer.
vp = &ch stores address of char ch and the next statement prints the value stored in
vp after type casting it to the proper data type pointer. the output is g. Similarly
the output from second printf is 20. The third printf statement type casts it to print
the string from the 4th value hence the output is fy.
48.
main ( ){
static char *s[ ] = {black, white, yellow, violet};
char **ptr[ ] = {s+3, s+2, s+1, s}, ***p;
p = ptr;
**++p;
printf(%s,*--*++p + 3);
}
Answer:
ck
Explanation:
In this problem we have an array of char pointers pointing to start of 4
strings. Then we have ptr which is a pointer to a pointer of type char and a variable
p which is a pointer to a pointer to a pointer of type char. p hold the initial value of
ptr, i.e. p = s+3. The next statement increment value in p by 1 , thus now value of p
= s+2. In the printf statement the expression is evaluated *++p causes gets value s
+1 then the pre decrement is executed and we get s+1 1 = s . the indirection
operator now gets the value from the array of s and adds 3 to the starting address.
The string is printed starting from this position. Thus, the output is ck.
49. main(){
int i, n;
char *x = girl;
n = strlen(x);
*x = x[n];
for(i=0; i<n; ++i){
printf(%s\n,x);
x++;
}
}
Answer:
(blank space)
irl
rl
l
Explanation:
Here a string (a pointer to char) is initialized with a value girl. The strlen
function returns the length of the string, thus n has a value 4. The next statement
assigns value at the nth location (\0) to the first location. Now the string becomes
\0irl . Now the printf statement prints the string after each iteration it increments
it starting position. Loop starts from 0 to 4. The first time x[0] = \0 hence it prints
nothing and pointer value is incremented. The second time it prints from x[1] i.e
irl and the third time it prints rl and the last time it prints l and the loop
terminates.
50.
int i,j;
for(i=0;i<=10;i++){
j+=5;
assert(i<5);
}
Answer:
Runtime error: Abnormal program termination.
assert failed (i<5), <file name>,<line number>
Explanation:
asserts are used during debugging to make sure that certain conditions are
satisfied. If assertion fails, the program will terminate reporting the same. After
debugging use,
#undef NDEBUG
and this will disable all the assertions from the source code. Assertion is a
good debugging tool to make use of.
51.
main(){
int i=-1;
+i;
printf("i = %d, +i = %d \n",i,+i);
}
Answer:
i = -1, +i = -1
Explanation:
Unary + is the only dummy operator in C. Where-ever it comes you can just
ignore it just because it has no effect in the expressions (hence the name dummy
operator).
52.
What are the files which are automatically opened when a C file is executed?
Answer:
stdin, stdout, stderr (standard input,standard output,standard error).
53.
54.
main(){
char name[10],s[12];
scanf(" \"%[^\"]\"",s);
}
How scanf will execute?
Answer:
First it checks for the leading white space and discards it.Then it matches
with a quotation mark and then it reads all character upto another quotation mark.
55.
56.
main(){
main();
}
Answer:
Runtime error : Stack overflow.
Explanation:
main function calls itself again and again. Each time the function is called
its return address is stored in the call stack. Since there is no condition to terminate
the function call, the call stack overflows at runtime. So it terminates the program
and results in an error.
57.
main(){
char *cptr,c;
void *vptr,v;
c=10; v=0;
cptr=&c; vptr=&v;
printf("%c%v",c,v);
}
Answer:
Compiler error (at line number 4): size of v is Unknown.
Explanation:
You can create a variable of type void * but not of type void, since void is
an empty type. In the second line you are creating variable vptr of type void * and v
of type void hence an error.
58.
main() {
char *str1="abcd";
char str2[]="abcd";
printf("%d %d %d",sizeof(str1),sizeof(str2),sizeof("abcd"));
}
Answer:
255
Explanation:
In first sizeof, str1 is a character pointer so it gives you the size of the
pointer variable. In second sizeof the name str2 indicates the name of the array
whose size is 5 (including the '\0' termination character). The third sizeof is similar
to the second one.
59.
main(){
char not;
not=!2;
printf("%d",not);
}
Answer:
0
Explanation:
! is a logical operator. In C the value 0 is considered to be the boolean value
FALSE, and any non-zero value is considered to be the boolean value TRUE. Here
2 is a non-zero value so TRUE. !TRUE is FALSE (0) so it prints 0.
60.
#define FALSE -1
#define TRUE 1
#define NULL 0
main(){
if(NULL)
puts("NULL");
else if(FALSE)
puts("TRUE");
else
puts("FALSE");
}
Answer:
TRUE
Explanation:
The input program to the compiler after processing by the preprocessor is,
main(){
if(0)
puts("NULL");
else if(-1)
puts("TRUE");
else
puts("FALSE");
}
Preprocessor doesn't replace the values given inside the double quotes. The
check by if condition is boolean value false so it goes to else. In second if -1 is
boolean value true hence "TRUE" is printed.
61.
main(){
int k=1;
printf("%d==1 is ""%s",k,k==1?"TRUE":"FALSE");
}
Answer:
1==1 is TRUE
Explanation:
When two strings are placed together (or separated by white-space) they are
concatenated (this is called as "stringization" operation). So the string is as if it is
given as "%d==1 is %s". The conditional operator( ?: ) evaluates to "TRUE".
62.
main(){
int y;
scanf("%d",&y); // input given is 2000
if( (y%4==0 && y%100 != 0) || y%100 == 0 )
printf("%d is a leap year");
else
printf("%d is not a leap year");
}
Answer:
2000 is a leap year
Explanation:
An ordinary program to check if leap year or not.
63.
#define max 5
64.
int i=10;
main() {
extern int i; {
int i=20;{
const volatile unsigned i=30;
printf("%d",i);
}
printf("%d",i);
}
printf("%d",i);
}
Answer:
30,20,10
Explanation:
'{' introduces new block and thus new scope. In the innermost block i is
declared as, const volatile unsigned which is a valid declaration. i is assumed of
type int. So printf prints 30. In the next block, i has value 20 and so printf prints 20.
In the outermost block, i is declared as extern, so no storage space is allocated for
it. After compilation is over the linker resolves it to global variable i (since it is the
only variable visible there). So it prints i's value as 10.
65.
main(){
int *j;{
int i=10;
j=&i;
}
printf("%d",*j);
}
Answer:
10
Explanation:
The variable i is a block level variable and the visibility is inside that block
only. But the lifetime of i is lifetime of the function so it lives upto the exit of main
function. Since the i is still allocated space, *j prints the value stored in i since j
points i.
66.
main(){
int i=-1;
-i;
printf("i = %d, -i = %d \n",i,-i);
}
Answer:
i = -1, -i = 1
Explanation:
-i is executed and this execution doesn't affect the value of i. In printf first
you just print the value of i. After that the value of the expression -i = -(-1) is
printed.
67.
main() {
const int i=4;
float j;
j = ++i;
68.
main(){
int a[2][2][2] = { {10,2,3,4}, {5,6,7,8} };
int *p,*q;
p=&a[2][2][2];
*q=***a;
printf("%d..%d",*p,*q);
}
Answer:
garbagevalue..1
Explanation:
p=&a[2][2][2] you declare only two 2D arrays. but you are trying to access
the third 2D(which you are not declared) it will print garbage values. *q=***a
starting address of a is assigned integer pointer. now q is pointing to starting
address of a.if you print *q meAnswer:it will print first element of 3D array.
69.
main() {
register i=5;
char j[]= "hello";
printf("%s %d",j,i);
}
Answer:
hello 5
Explanation:
if you declare i as register compiler will treat it as ordinary integer and it
will take integer value. i value may be stored either in register or in memory.
70.
main(){
int i=5,j=6,z;
printf("%d",i+++j);
}
Answer:
11
Explanation:
The expression i+++j is treated as (i++ + j).
71.
struct aaa{
struct aaa *prev;
int i;
struct aaa *next;
};
main(){
struct aaa abc,def,ghi,jkl;
int x=100;
abc.i=0;abc.prev=&jkl;
abc.next=&def;
def.i=1;def.prev=&abc;def.next=&ghi;
ghi.i=2;ghi.prev=&def;
ghi.next=&jkl;
jkl.i=3;jkl.prev=&ghi;jkl.next=&abc;
x=abc.next->next->prev->next->i;
printf("%d",x);
}
Answer:
2
Explanation:
above all statements form a double circular linked list;
abc.next->next->prev->next->i
this one points to "ghi" node the value of at particular node is 2.
72.
struct point{
int x;
int y;
};
struct point origin,*pp;
main(){
pp=&origin;
printf("origin is(%d%d)\n",(*pp).x,(*pp).y);
printf("origin is (%d%d)\n",pp->x,pp->y);
}
Answer:
origin is(0,0)
origin is(0,0)
Explanation:
pp is a pointer to structure. we can access the elements of the structure
either with arrow mark or with indirection operator.
Note:
Since structure point is globally declared x & y are initialized as zeroes
73.
main(){
int i=_l_abc(10);
printf("%d\n",--i);
}
int _l_abc(int i){
return(i++);
}
Answer:
9
Explanation:
return(i++) it will first return i and then increments. i.e. 10 will be returned.
74.
main(){
char *p;
int *q;
long *r;
p=q=r=0;
p++;
q++;
r++;
printf("%p...%p...%p",p,q,r);
}
Answer:
0001...0002...0004
Explanation:
++ operator when applied to pointers increments address according to their
corresponding data-types.
75.
main(){
char c=' ',x,convert(z);
getc(c);
if((c>='a') && (c<='z'))
x=convert(c);
printf("%c",x);
}
convert(z){
return z-32;
}
Answer:
Compiler error
Explanation:
Declaration of convert and format of getc() are wrong.
76.
Explanation:
argv[1] & argv[2] are strings. They are passed to the function sum without
converting it to integer values.
77.
int one_d[]={1,2,3};
main(){
int *ptr;
ptr=one_d;
ptr+=3;
printf("%d",*ptr);
}
Answer:
garbage value
Explanation:
ptr pointer is pointing to out of the array range of one_d.
78.
aaa() {
printf("hi");
}
bbb(){
printf("hello");
}
ccc(){
printf("bye");
}
main(){
int (*ptr[3])();
ptr[0]=aaa;
ptr[1]=bbb;
ptr[2]=ccc;
ptr[2]();
}
Answer:
bye
Explanation:
ptr is array of pointers to functions of return type int.ptr[0] is assigned to
address of the function aaa. Similarly ptr[1] and ptr[2] for bbb and ccc respectively.
ptr[2]() is in effect of writing ccc(), since ptr[2] points to ccc.
79.
main(){
FILE *ptr;
char i;
ptr=fopen("zzz.c","r");
while((i=fgetch(ptr))!=EOF)
printf("%c",i);
}
Answer:
contents of zzz.c followed by an infinite loop
Explanation:
The condition is checked against EOF, it should be checked against NULL.
80.
main(){
int i =0;j=0;
if(i && j++)
printf("%d..%d",i++,j);
printf("%d..%d,i,j);
}
Answer:
0..0
Explanation:
The value of i is 0. Since this information is enough to determine the truth
value of the boolean expression. So the statement following the if statement is not
executed. The values of i and j remain unchanged and get printed.
81.
main(){
int i;
i = abc();
printf("%d",i);
}
abc(){
_AX = 1000;
}
Answer:
1000
Explanation:
Normally the return value from the function is through the information from
the accumulator. Here _AH is the pseudo global variable denoting the accumulator.
Hence, the value of the accumulator is set 1000 so the function returns value 1000.
82.
int i;
main(){
int t;
for ( t=4;scanf("%d",&i)-t;printf("%d\n",i))
printf("%d--",t--);
}
// If the inputs are 0,1,2,3 find the o/p
Answer:
4--0
3--1
2--2
Explanation:
83.
-4
-2
main(){
int a= 0;int b = 20;char x =1;char y =10;
if(a,b,x,y)
printf("hello");
}
Answer:
hello
Explanation:
The comma operator has associativity from left to right. Only the rightmost
value is returned and the other values are evaluated and ignored. Thus the value of
last variable y is returned to check in if. Since it is a non zero value if becomes true
so, "hello" will be printed.
84.
main(){
unsigned int i;
for(i=1;i>-2;i--)
printf("c aptitude");
}
Explanation:
i is an unsigned integer. It is compared with a signed value. Since the both
types doesn't match, signed is promoted to unsigned value. The unsigned equivalent
of -2 is a huge value so condition becomes false and control comes out of the loop.
85.
In the following pgm add a stmt in the function fun such that the address of 'a'
gets stored in 'j'.
main(){
int * j;
void fun(int **);
fun(&j);
}
void fun(int **k) {
int a =0;
/* add a stmt here*/
}
Answer:
*k = &a
Explanation:
The argument of the function is a pointer to a pointer.
86.
87.
main(){
char *p;
p="%d\n";
p++;
p++;
printf(p-2,300);
}
Answer:
300
Explanation:
88.
main(){
char a[100];
a[0]='a';a[1]]='b';a[2]='c';a[4]='d';
abc(;
}
abc(char a[]){
a++;
printf("%c",*;
a++;
printf("%c",*;
}
Explanation:
The base address is modified only in function and as a result a points to 'b'
then after incrementing to 'c' so bc will be printed.
89.
func(a,b)
int a,b;{
return( a= (a==b) );
}
main(){
int process(),func();
printf("The value of process is %d !\n ",process(func,3,6));
}
process(pf,val1,val2)
int (*pf) ();
int val1,val2;{
return((*pf) (val1,val2));
}
Answer:
The value if process is 0 !
Explanation:
The function 'process' has 3 parameters - 1, a pointer to another function 2
and 3, integers. When this function is invoked from main, the following
substitutions for formal parameters take place: func for pf, 3 for val1 and 6 for val2.
This function returns the result of the operation performed by the function 'func'.
The function func has two integer parameters. The formal parameters are
substituted as 3 for a and 6 for b. since 3 is not equal to 6, a==b returns 0. therefore
the function returns 0 which in turn is returned by the function 'process'.
printf("%d ",i);
}
}
Answer:
0000
Explanation:
The variable "I" is declared as static, hence memory for I will be allocated
for only once, as it encounters the statement. The function main() will be called
recursively unless I becomes equal to 0, and since main() is recursively called, so
the value of static I ie., 0 will be printed every time the control is returned.
The int ret(int ret), ie., the function name and the argument name can be the
same.
Firstly, the function ret() is called in which the sizeof(float) ie., 4 is passed,
after the first expression the value in ret will be 6, as ret is integer hence the value
stored in ret will have implicit type conversion from float to int. The ret is returned
in main() it is printed after and preincrement.
printf("%u \n",gotit=--giveit);
}
Answer:
0 65535
v=i;
printf("%d",(int*)*v);
}
Answer:
Compiler Error. We cannot apply indirection on type void*.
Explanation:
Void pointer is a generic pointer type. No pointer arithmetic can be done on
it. Void pointers are normally used for,
1. Passing generic pointers to functions and returning such pointers.
2. As a intermediate pointer type.
3. Used when the exact pointer type will be known at a later point of
time.
Explanation:
The inner printf executes first to print some garbage value. The printf
returns no of characters printed and this value also cannot be predicted. Still the
outer printf prints something and so returns a non-zero value. So it encounters the
break statement and comes out of the while statement.
99. main(){
unsigned int i=10;
while(i-->=0)
printf("%u ",i);
}
Answer:
10 9 8 7 6 5 4 3 2 1 0 65535 65534..
Explanation:
Since i is an unsigned integer it can never become negative. So the
expression i-- >=0 will always be true, leading to an infinite loop.
100.main(){
int x,y=2,z,a;
if(x=y%2) z=2;
a=2;
printf("%d %d ",z,x);
}
Answer:
Garbage-value 0
Explanation:
The value of y%2 is 0. This value is assigned to x. The condition reduces to
if (x) or in other words if(0) and so z goes uninitialized.
Thumb Rule: Check all control paths to write bug free code.
101.main(){
int a[10];
printf("%d",*a+1-*a+3);
}
Answer:
4
Explanation:
*a and -*a cancels out. The result is as simple as 1 + 3 = 4 !
102.main(){
unsigned int i=65000;
while(i++!=0);
printf("%d",i);
}
Answer:
1
Explanation:
Note the semicolon after the while statement. When the value of i becomes
0 it comes out of while loop. Due to post-increment on i the value of i while
printing is 1.
103.main(){
int i=0;
while(+(+i--)!=0)
i-=i++;
printf("%d",i);
}
Answer:
-1
Explanation:
Unary + is the only dummy operator in C. So it has no effect on the
expression and now the while loop is,
breaks out of while loop. The value 1 is printed due to the post-decrement
operator.
104.main(){
float f=5,g=10;
enum{i=10,j=20,k=50};
printf("%d\n",++k);
printf("%f\n",f<<2);
printf("%lf\n",f%g);
printf("%lf\n",fmod(f,g));
}
Answer:
Line no 5: Error: Lvalue required
Line no 6: Cannot apply leftshift to float
Line no 7: Cannot apply mod to float
Explanation:
Enumeration constants cannot be modified, so you cannot apply ++.Bitwise operators and % operators cannot be applied on float values.fmod() is to find
the modulus values for floats as % operator is for ints.
105.main(){
int i=10;
void pascal f(int,int,int);
f(i++,i++,i++);
printf(" %d",i);
}
void pascal f(integer :i,integer:j,integer :k){
write(i,j,k);
}
Answer:
Explanation:
Pascal argument passing mechanism forces the arguments to be called from
left to right. cdecl is the normal C argument passing mechanism where the
arguments are passed from right to left.
108.main(){
unsigned char i=0;
for(;i>=0;i++) ;
printf("%d\n",i);
}
Answer:
infinite loop
Explanation:
The difference between the previous question and this one is that the char is
declared to be unsigned. So the i++ can never yield negative value and i>=0 never
becomes false so that it can come out of the for loop.
109.main(){
char i=0;
for(;i>=0;i++) ;
printf("%d\n",i);
}
Answer:
Behavior is implementation dependent.
Explanation:
The detail if the char is signed/unsigned by default is implementation
dependent. If the implementation treats the char to be signed by default the program
will print 128 and terminate. On the other hand if it considers char to be unsigned
by default, it goes to infinite loop.
Rule:
You can write programs that have implementation dependent behavior. But
dont write programs that depend on such behavior.
error g1;
g1=error;
// which error it refers in each case?
When the compiler can distinguish between usages then it will not issue
error (in pure technical terms, names can only be overloaded in different
namespaces).
Note:
The extra comma in the declaration,enum errorType{warning, error,
exception,}
programmers convenience.
This error can be used only by preceding the error by struct kayword as in:
struct error someError;
typedef struct error{int warning, error, exception;}error;
This can be used only after . (dot) or -> (arrow) operator preceded by the
variable name as in :
g1.error =1;
printf("%d",g1.error);
typedef struct error{int warning, error, exception;}error;
This can be used to define variables without using the preceding struct
keyword as in:
error g1;
Since the compiler can perfectly distinguish between these three usages, it is
perfectly legal and valid.
Note:
This code is given here to just explain the concept behind. In real
programming dont use such overloading of names. It reduces the readability of the
code. Possible doesnt mean that we should use it!
113.#ifdef something
int some=0;
#endif
main(){
int thing = 0;
printf("%d %d\n", some ,thing);
}
Answer:
Compiler error : undefined symbol some
Explanation:
This is a very simple example for conditional compilation. The name
something is not already known to the compiler making the declaration
int some = 0;
effectively removed from the source code.
114.#if something == 0
int some=0;
#endif
main(){
int thing = 0;
printf("%d %d\n", some ,thing);
}
Answer:
00
Explanation:
This code is to show that preprocessor expressions are not the same as the
ordinary expressions. If a name is not known the preprocessor treats it to be equal
to zero.
arr2D[2]
arr2D[3]
The name arr2D refers to the beginning of all the 3 arrays. *arr2D refers to
the start of the first 1D array (of 3 integers) that is the same address as arr2D. So
the expression (arr2D == *arr2D) is true (1).
Similarly, *arr2D is nothing but *(arr2D + 0), adding a zero doesnt change
the value/meaning. Again arr2D[0] is the another way of telling *(arr2D + 0). So
the expression (*(arr2D + 0) == arr2D[0]) is true (1).
Since both parts of the expression evaluates to true the result is true(1) and
the same is printed.
}
main() {
int x=10,y=20;
swap(&x,&y);
printf("x= %d y = %d\n",x,y);
}
Answer:
x = 20 y = 10
Explanation:
This is one way of swapping two values. Simple checking will help
understand this.
118.main(){
char *p = ayqm;
printf(%c,++*(p++));
}
Answer:
b
119.main()
{
int i=5;
printf("%d",++i++);
}
Answer:
Compiler error: Lvalue required in function main
Explanation:
++i yields an rvalue. For postfix ++ to operate an lvalue is required.
120.main(){
char *p = ayqm;
char c;
c = ++*p++;
printf(%c,c);
}
Answer:
b
Explanation:
There is no difference between the expression ++*(p++) and ++*p++.
Parenthesis just works as a visual clue for the reader to see which expression is first
evaluated.
121.
int aaa() {printf(Hi);}
int bbb(){printf(hello);}
iny ccc(){printf(bye);}
main(){
int ( * ptr[3]) ();
ptr[0] = aaa;
ptr[1] = bbb;
ptr[2] =ccc;
ptr[2]();
}
Answer:
bye
Explanation:
int (* ptr[3])() says that ptr is an array of pointers to functions that takes no
arguments and returns the type int. By the assignment ptr[0] = aaa; it means that the
first function pointer in the array is initialized with the address of the function aaa.
Similarly, the other two array elements also get initialized with the addresses of the
functions bbb and ccc. Since ptr[2] contains the address of the function ccc, the call
to the function ptr[2]() is same as calling ccc(). So it results in printing "bye".
122.main(){
int i=5;
printf(%d,i=++i ==6);
}
Answer:
1
Explanation:
123.main(){
char p[ ]="%d\n";
p[1] = 'c';
printf(p,65);
}
Answer:
A
Explanation:
Due to the assignment p[1] = c the string becomes, %c\n. Since this
string becomes the format string for printf and ASCII value of 65 is A, the same
gets printed.
a ptrto a funtion which returns void. the return type of the function is void.
Explanation:
Apply the clock-wise rule to find the result.
125.main(){
while (strcmp(some,some\0))
printf(Strings are not equal\n);
}
Answer:
No output
Explanation:
Ending the string constant with \0 explicitly makes no difference. So
some and some\0 are equivalent. So, strcmp returns 0 (false) hence breaking
out of the while loop.
126.main(){
char str1[] = {s,o,m,e};
char str2[] = {s,o,m,e,\0};
while (strcmp(str1,str2))
printf(Strings are not equal\n);
}
Answer:
Strings are not equal
Strings are not equal
.
Explanation:
127.main(){
int i = 3;
for (;i++=0;) printf(%d,i);
}
Answer:
Compiler Error: Lvalue required.
Explanation:
As we know that increment operators return rvalues and hence it cannot
appear on the left hand side of an assignment operation.
128.void main(){
int *mptr, *cptr;
mptr = (int*)malloc(sizeof(int));
printf(%d,*mptr);
int *cptr = (int*)calloc(sizeof(int),1);
printf(%d,*cptr);
}
Answer:
garbage-value 0
Explanation:
The memory space allocated by malloc is uninitialized, whereas calloc
returns the allocated memory space initialized to zeros.
129.void main(){
static int i;
while(i<=10)
(i>2)?i++:i--;
printf(%d, i);
}
Answer:
32767
Explanation:
Since i is static it is initialized to 0. Inside the while loop the conditional
operator evaluates to false, executing i--. This continues till the integer value rotates
to positive value (32767). The while condition becomes false and hence, comes out
of the while loop, printing the i value.
130.main(){
int i=10,j=20;
j = i, j?(i,j)?i:j:j;
printf("%d %d",i,j);
}
Answer:
10 10
Explanation:
The Ternary operator ( ? : ) is equivalent for if-then-else statement. So the
question can be written as:
if(i,j){
if(i,j)
j = i;
else
j = j;
}
else
j = j;
Answer:
1. 'const' applies to char * rather than 'a' ( pointer to a constant char )
*a='F'
: illegal
a="Hi"
: legal
: legal
: illegal
3. Same as 1.
132.
main(){
int i=5,j=10;
i=i&=j&&10;
printf("%d %d",i,j);
}
Answer:
1 10
Explanation:
The expression can be written as i=(i&=(j&&10)); The inner expression
(j&&10) evaluates to 1 because j==10. i is 5. i = 5&1 is 1. Hence the result.
133.main(){
int i=4,j=7;
j = j || i++ && printf("YOU CAN");
134.main(){
register int a=2;
printf("Address of a = %d",&;
printf("Value of a = %d",;
}
Answer:
Compier Error: '&' on register variable
Rule to Remember:
135.main(){
float i=1.5;
switch(i){
case 1: printf("1");
case 2: printf("2");
default : printf("0");
}
}
Answer:
Compiler Error: switch expression not integral
Explanation:
Switch statements can be applied only to integral types.
136.main(){
extern i;
printf("%d\n",i);{
int i=20;
printf("%d\n",i);
}
}
Answer:
137.main(){
int a=2,*f1,*f2;
f1=f2=&a;
*f2+=*f2+=a+=2.5;
printf("\n%d %d %d",a,*f1,*f2);
}
Answer:
16 16 16
Explanation:
f1 and f2 both refer to the same memory location a. So changes through f1
and f2 ultimately affects only the value of a.
138.main(){
char *p="GOOD";
char a[ ]="GOOD";
printf("\n sizeof(p) = %d, sizeof(*p) = %d, strlen(p) = %d", sizeof(p),
sizeof(*p), strlen(p));
printf("\n sizeof( = %d, strlen( = %d", sizeof(, strlen();
}
Answer:
sizeof(p) = 2, sizeof(*p) = 1, strlen(p) = 4
sizeof( = 5, strlen( = 4
Explanation:
sizeof(p) => sizeof(char*) => 2
sizeof(*p) => sizeof(char) => 1
Similarly,
sizeof( => size of the character array => 5
When sizeof operator is applied to an array it returns the sizeof the array
and it is not the same as the sizeof the pointer variable. Here the sizeof( where a is
the character array and the size of the array is 5 because the space necessary for the
terminating NULL character should also be taken into account.
141.main(){
static int a[3][3]={1,2,3,4,5,6,7,8,9};
int i,j;
static *p[]={a,a+1,a+2};
for(i=0;i<3;i++){
for(j=0;j<3;j++)
printf("%d\t%d\t%d\t%d\n",*(*(p+i)+j),
*(*(j+p)+i),*(*(i+p)+j),*(*(p+j)+i));
}
}
Answer:
1
Explanation:
*(*(p+i)+j) is equivalent to p[i][j].
142.main(){
void swap();
int x=10,y=8;
swap(&x,&y);
printf("x=%d y=%d",x,y);
}
void swap(int *a, int *b){
*a ^= *b, *b ^= *a, *a ^= *b;
}
Answer:
x=10 y=8
Explanation:
Using ^ like this is a way to swap two variables without using a temporary
variable and that too in a single statement.
Inside main(), void swap(); means that swap is a function that may take any
number of arguments (not no arguments) and returns nothing. So this doesnt issue
a compiler error by the call swap(&x,&y); that has two arguments.
This convention is historically due to pre-ANSI style (referred to as
Kernighan and Ritchie style) style of function declaration. In that style, the swap
function will be defined as follows,
void swap()
int *a, int *b{
*a ^= *b, *b ^= *a, *a ^= *b;
}
where the arguments follow the (). So naturally the declaration for swap
will look like, void swap() which means the swap can take any number of
arguments.
143.main(){
int i = 257;
int *iPtr = &i;
printf("%d %d", *((char*)iPtr), *((char*)iPtr+1) );
}
Answer:
11
Explanation:
The integer value 257 is stored in the memory as, 00000001 00000001, so
the individual bytes are taken by casting it to char * and get printed.
144.main(){
int i = 258;
int *iPtr = &i;
printf("%d %d", *((char*)iPtr), *((char*)iPtr+1) );
}
Answer:
21
Explanation:
The integer value 257 can be represented in binary as, 00000001 00000001.
Remember that the INTEL machines are small-endian machines. Small-endian
means that the lower order bytes are stored in the higher memory addresses and
the higher order bytes are stored in lower addresses. The integer value 258 is
stored in memory as: 00000001 00000010.
145.main(){
int i=300;
char *ptr = &i;
*++ptr=2;
printf("%d",i);
}
Answer:
556
Explanation:
The integer value 300 in binary notation is: 00000001 00101100. It is
stored in memory (small-endian) as: 00101100 00000001. Result of the expression
*++ptr = 2 makes the memory representation as: 00101100 00000010. So the
integer corresponding to it is 00000010 00101100 => 556.
146.main()
{
char * str = "hello";
char * ptr = str;
char least = 127;
while (*ptr++)
147.
Declare an array of N pointers to functions returning pointers to functions
returning pointers to characters?
Answer:
(char*(*)( )) (*ptr[N])( );
148.main(){
struct student {
char name[30];
struct date dob;
}stud;
struct date{
int day,month,year;
};
149.main(){
struct date;
struct student{
char name[30];
struct date dob;
}stud;
struct date{
int day,month,year;
};
scanf("%s%d%d%d", stud.rollno, &student.dob.day, &student.dob.month,
&student.dob.year);
}
Answer:
150.
There were 10 records stored in somefile.dat but the following program printed
11 names. What went wrong?
void main(){
struct student{
char name[30], rollno[6];
}stud;
FILE *fp = fopen(somefile.dat,r);
while(!feof(fp)) {
fread(&stud, sizeof(stud), 1 , fp);
puts(stud.name);
}
}
Explanation:
fread reads 10 records and prints the names successfully. It will return EOF
only when fread tries to read another record and fails reading EOF (and returning
EOF). So it prints the last record again. After this only the condition feof(fp)
becomes false, hence comes out of the while loop.
int *foo(){
int *s = malloc(sizeof(int)100);
assert(s != NULL);
return s;
}
Answer & Explanation:
assert macro should be used for debugging and finding out bugs. The check
s != NULL is for error/exception handling and for that assert shouldnt be used. A
plain if and the corresponding remedy statement has to be given.
155.void main(){
int *i = 0x400; // i points to the address 400
*i = 0;
}
Answer:
Undefined behavior
Explanation:
The second statement results in undefined behavior because it points to
some location whose value may not be available for modification. This type of
pointer in which the non-availability of the implementation of the referenced
location is known as 'incomplete type'.
void main(){
int i = 10;
if(i==0)
assert(i < 100);
else
}
Answer:
No
Explanation:
Is it not legal for a structure to contain a member that is of the same type as
in this case. Because this will cause the structure declaration to be recursive without
end.
int x;
aType *b;
}aType;
Answer:
No
Explanation:
The typename aType is not known at the point of declaring the structure
(forward references are not made for typedefs).
162.void main(){
printf(sizeof (void *) = %d \n, sizeof( void *));
printf(sizeof (int *) = %d \n, sizeof(int *));
printf(sizeof (double *) = %d \n, sizeof(double *));
printf(sizeof(struct unknown *) = %d \n, sizeof(struct unknown *));
}
Answer:
sizeof (void *) = 2
sizeof (int *) = 2
sizeof (double *) = 2
sizeof(struct unknown *) = 2
Explanation:
The pointer to any type is of same size.
2) printf(str);
Answer & Explanation:
Prefer the first one. If the str contains any format characters like %d then it
will result in a subtle bug.
165.void main(){
int i=10, j=2;
166.void main(){
char ch;
for(ch=0;ch<=127;ch++)
printf(%c %d \n, ch, ch);
}
Answer:
Implementaion dependent
Explanation:
The char type may be signed or unsigned by default. If it is signed then ch+
+ is executed after ch reaches 127 and rotates back to -128. Thus ch is always
smaller than 127.
169.main(){
char a[4]="HELL";
printf("%s",;
}
Answer:
HELL%@!~@!@???@~~!
Explanation:
The character array has the memory just enough to hold the string HELL
and doesnt have enough space to store the terminating null character. So it prints
the HELL correctly and continues to print garbage values till it accidentally comes
across a NULL character.
170.main(){
int a=10,*j;
void *k;
j=k=&a;
j++;
k++;
printf("\n %u %u ",j,k);
}
Answer:
Compiler error: Cannot increment a void pointer
Explanation:
Void pointers are generic pointers and they can be used only when the type
is not known and as an intermediate address storage type. No pointer arithmetic can
be done on it and you cannot apply indirection operator (*) on void pointers.
173.char *someFun1(){
Internal linkage means that all declarations of the identifier within one
source file refer to a single entity but declarations of the same identifier in other
source files refer to different entities.
176.What is an lvalue?
Something that can appear on the left side of the "=" sign, it identifies a
place where the result can be stored. For example, in the equation a=b+25, a is an
lvalue.
In the equation b+25=a, b+25 cannot be used as an lvalue, because it does
not identify a specific place. Hence the above assignment is illegal.
Section I C++
Note: All the programs are tested under Turbo C++ 3.0/4.5 and Microsoft VC++ 6.0
compilers.
It is assumed that,
Programs run under DOS/Windows environment,
Proper and required header files are inlcuded,
The underlying machine is an x86 based system,
The program output may depend on the information based on this assumptions.
1.
2.
void main(){
int a, *pa, &ra;
pa = &a;
ra = a;
cout <<"a="<<a <<"*pa="<<*pa <<"ra"<<ra ;
}
Answer :
Compiler Error: 'ra', reference must be initialized
Explanation :
Pointers are different from references. One of the main differences is that
the pointers can be both initialized and assigned, whereas references can only be
initialized. So this code issues an error.
3.
ANSI C++ introduces new style of casts (const_cast, dynamic_cast, static_cast and
reinterpret_cast). For the following C style cast which of the new cast syntax should be
applied?
pDerived = (Cderived *) pBase;
Answer:
dynamic_cast.
Explanation:
dynamic_cast is used for traversing up and down in inheritance hierarchy.
So it can be applied here to cast pointer type from the base class to derived class.
The cast in the new syntax will look like this:
pDerived = dynamic_cast <Cderived*> (pBase);
4.
print(b);
}
Answer:
Compiler Error : function 'void print(int *)' already has a body
Explanation:
Arrays cannot be passed to functions, only pointers (for arrays, base
addresses) can be passed. So the arguments int *ptr and int prt[size] have no
difference as function arguments. In other words, both the functoins have the same
signature and so cannot be overloaded.
5.
In which of the following cases will the copy constructor of the class X be called?
A)X x1,Y Y!:
foo(&x1,&y2);
6.
class Sample{
public:
int *ptr;
Sample(int i){
ptr = new int(i);
}
~Sample(){
delete ptr;
}
void PrintVal(){
cout << "The value is " << *ptr;
}
};
void SomeFunc(Sample x){
cout << "Say i am in someFunc " << endl;
}
int main(){
Sample s1= 10;
SomeFunc(s1);
s1.PrintVal();
}
Answer:
Say i am in someFunc.
Null pointer assignment(Run-time error)
Explanation:
As the object is passed by value to SomeFunc the destructor of the object
is called when the control returns from the function. So when PrintVal is called, it
meets up with ptr that has been freed.The solution is to pass the Sample object by
reference to SomeFunc:
void SomeFunc(Sample &x){
cout << "Say i am in someFunc " << endl;
}
because when we pass objects by refernece that object is not destroyed. while
returning from the function.
7.
8.
class base{
public:
int bval;
base(){ bval=0;}
};
class deri:public base{
public:
int dval;
deri(){ dval=1;}
};
void SomeFunc(base *arr,int size){
for(int i=0; i<size; i++,arr++)
cout<<arr->bval;
cout<<endl;
}
int main(){
base BaseArr[5];
SomeFunc(BaseArr,5);
deri DeriArr[5];
SomeFunc(DeriArr,5);
}
Answer:
00000
01010
Explanation:
The function SomeFunc expects two arguments.The first one is a pointer to
an array of base class objects and the second one is the sizeof the array.The first
call of someFunc calls it with an array of base objects, so it works correctly and
prints the bval of all the objects. When SomeFunc is called the second time the
argument passed is a pointer to an array of derived class objects and not the array of
base class objects. But that is what the function expects to be sent. So the derived
class pointer is promoted to base class pointer and the address is sent to the
function. SomeFunc() knows nothing about this and just treats the pointer as an
array of base class objects. So when arr++ is met, the size of base class object is
taken into consideration and is incremented by sizeof(int) bytes for bval (the deri
class objects have bval and dval as members and so is of size >= sizeof(int)
+sizeof(int) ).
9.
class some{
public:
~some(){
cout<<"some's destructor"<<endl;
}
};
void main(){
some s;
s.~some();
}
Answer:
some's destructor
some's destructor
Explanation:
Destructors can be called explicitly (constructors can not be). Here
's.~some()' explicitly calls the destructor of 's'. When main() returns, destructor of s
is called again, hence the result.
10.
class base{
public:
void baseFun(){ cout<<"from base"<<endl;}
};
class deri:public base{
public:
void baseFun(){ cout<< "from derived"<<endl;}
};
void SomeFunc(base *baseObj){
baseObj->baseFun();
}
int main(){
base baseObject;
SomeFunc(&baseObject);
deri deriObject;
SomeFunc(&deriObject);
}
Answer:
from base
from base
Explanation:
As we have seen in the previous case, SomeFunc expects a pointer to a base
class. Since a pointer to a derived class object is passed, it treats the argument only
as a base class pointer and the corresponding base function is called.
11.
class base{
public:
virtual void baseFun(){ cout<<"from base"<<endl;}
};
class deri:public base{
public:
void baseFun(){ cout<< "from derived"<<endl;}
};
void SomeFunc(base *baseObj){
baseObj->baseFun();
}
int main(){
base baseObject;
SomeFunc(&baseObject);
deri deriObject;
SomeFunc(&deriObject);
}
Answer:
from base
from derived
Explanation:
Remember that baseFunc is a virtual function. That means that it supports
run-time polymorphism. So the function corresponding to the derived class object is
called.
12.
public:
int n;
virtual void foo(){n=1;}
void print(){cout <<n<<endl;}
};
class derived: base
{
public:
void foo(){n=2;}
void print(){cout <<n<<endl;}
};
void main()
{
derived y;
base *bp =dynamic_cast<base *>(&y);
bp->foo();
bp->print();
}
Answer:
Undefined behavior : dynamic_cast used to convert to inaccessible or
ambiguous base;
Explanation:
13.
class fig2d{
int dim1, dim2;
public:
fig2d() { dim1=5; dim2=6;}
virtual void operator<<(ostream & rhs);
};
void fig2d::operator<<(ostream &rhs){
rhs <<this->dim1<<" "<<this->dim2<<" ";
}
class fig3d : public fig2d{
int dim3;
public:
fig3d() { dim3=7;}
virtual void operator<<(ostream &rhs);
};
void fig3d::operator<<(ostream &rhs){
fig2d::operator <<(rhs);
rhs<<this->dim3;
}
void main(){
fig2d obj1;
fig3d obj2;
obj1 << cout;
obj2 << cout;
}
Answer :
56
Explanation:
In this program, the << operator is overloaded with ostream as argument.
This enables the 'cout' to be present at the right-hand-side. Normally, operator << is
implemented as global function, but it doesn't mean that it is not possible to be
overloaded as member function. Overloading << as virtual member function
becomes handy when the class in which it is overloaded is inherited, and this
becomes available to be overrided. This is as opposed to global friend functions,
where friend's are not inherited.
14.
class opOverload{
public:
bool operator==(opOverload temp);
};
bool opOverload::operator==(opOverload temp){
if(*this == temp ){
cout<<"The both are same objects\n";
return true;
}
cout<<"The both are different\n";
return false;
}
void main(){
opOverload a1, a2;
a1== a2;
}
Answer :
Runtime Error: Stack Overflow
Explanation :
Just like normal functions, operator functions can be called recursively. This
program just illustrates that point, by calling the operator == function recursively,
leading to an infinite loop.
15.
class complex{
double re;
double im;
public:
complex() : re(1),im(0.5) {}
operator int(){}
};
int main(){
complex c1;
cout<< c1;
}
Answer :
Garbage value
Explanation:
The programmer wishes to print the complex object using output redirection operator,which he has not defined for his class.But the compiler instead of
giving an error sees the conversion function and converts the user defined object to
standard object and prints some garbage value.
16.
class complex{
double re;
double im;
public:
complex() : re(0),im(0) {}
complex(double n) { re=n,im=n;};
complex(int m,int n) { re=m,im=n;}
void print() { cout<<re; cout<<im;}
};
void main(){
complex c3;
double i=5;
c3 = i;
c3.print();
}
Answer:
5,5
Explanation:
There is no operator= function taking double as an argument is defined. So
the compiler creates a complex object using the single argument constructor that
takes double as an argument. This temporary object is assigned to c3.
17.
class String {
public:
String(char *);
String & operator=(String &);
String operator+(String);
friend operator+(String,String);
};
Answer:
No, this code will not compile.
Explanation:
Because there is an ambiguity between the overloading of the + operator as
a member function and friend function. Given the statement:
String s2 = s1+ how are You;
the compiler doesnt know to which function should it resolve to and call.
18.
try
{
throw derived();
}
catch (base b)
{
cout<<"Received exception, but can't handle\n";
throw;
}
};
void main()
{
try
{
foo();
}
catch (derived d)
{
cout<<"In derived handler";
}
catch (base b)
{
cout << "In Base handler";
}
}
Answer:
Received exception, but can't handle
In derived handler
Explanation:
When the function foo is called, the exception object of type derived is
thrown. Now the catch block for that derived exception object is searched but it is
found that there is a catch block for base is available. Since exception objects of
type base can handle all such exceptions in its hierarchy, this exception is caught.
A plain throw inside a catch indicates a re-throw of the exception caught.
So the derived exception object is again thrown and is caught by the catch block
in main(). Although both the catch blocks are eligible to handle the exception, this
time the derived which is defined first will catch the exception.
19.
number of elements, the two containers are equal; otherwise, they are unequal. A
comparison of the first unequal element determines the less-than or greater-than
relationship of the 2 containers.
20.
21.
#include <list>
#include <algorithm>
#include <iostream>
using namespace std;
void main()
{
list<int> ilist;
list<int>::iterator iiter;
for (int i=0;i<10;i++) ilist.push_back(i);
iiter = find(ilist.begin(),ilist.end(),3);
Exercise:
1) Determine the output of the following 'C++' Codelet.
class base{
public :
out() {
cout<<"base ";
}
};
class deri : public base{
public : out(){
cout<<"deri ";
}
};
void main(){
deri dp[3];
base *bp = (base*)dp;
for (int i=0; i<3;i++)
(bp++)->out();
}
public:
void fun(int val) const{
((temp*) this)->value1 = 10;
value2 = 10;
}
};
22.
23.
24.
// Assignment
Initialization can also occur without the '=' token, as well. For example,
int a(12);
For classes, you can define your own initialization procedure by providing
constructors and your own assignment operation by providing constructors and
your own assignment operation by providing an operator '=' will not be called for
initialization is expressed using the '=' symbol.
25.
Find five different C++ constructs for which the meaning is undefined an for which
the meaning is implementation defined.
Undefined behavior in C++
// Invalid
int main()
{
f();return 0;
}
26.
27.
char name[30];
mutable int noOfAccesses;
..........
};
.........
const data d1{"some string ",0,.......};
strcpy(d1.name,"another string"); // not allowed
d1.noOfAccesses++;
// allowed
28.
In c++ by default, all functions have external storage class, they can be shared
across files. What are the functions to which the above statement proves false.
Inline functions and functions qualified with the keyword static have
internal linkage and are confined to the defining file.
29.
30.
31.
32.
Define namespace.
It is a feature in c++ to minimize name collisions in the global name space.
This namespace keyword assigns a distinct name to a library that allows other
libraries to use the same identifier names without creating any name collisions.
Furthermore, the compiler uses the namespace signature for differentiating the
definitions.
32.
33.
34.
35.
36.
scope, and any scopes in which the current scope is nested, to find the declaration
for the name.
37.
ANSI C++ introduces four version of casts, for four different conversions. What
are they and give their purpose.
The new casting syntax introduced are const_cast, static_cast, dynamic_cast
and reinterpret_cast.
The general syntax for ANSI C++ style casting is :
toTypeVar = xxx_cast < toType > ( fromTypeVar );
This casting syntax helps programmer to identify the casting that are done
in program, and its purpose easily than in C, where it can be easily missed.
const_cast is to be used to remove the const or volatileness involved with
that object.
char *str = "something";
strlen( const_cast< const char * > str );
// strlen requires const char * as its argument.
It can also be used to remove the volatileness of the object, but that
requirement arises very rarely.
static_cast shall be used in all the cases where C casts are normally used.
char *a;
int * b = static_cast < int * > (a);
This converts from char * to int * and this reqires static_cast.
dynamic_cast is used for traversing up and down in inheritance hierarchy.
38.
39.
40.
information but the target object will have its own buffers and resources. the
destruction of either object will not affect the remaining object. The overloaded
assignment operator would create a deep copy of objects.
Shallow copy involves copying the contents of one object into another
instance of the same class thus creating a mirror image. Owing to straight copying
of references and pointers, the two objects will share the same externally contained
contents of the other object to be unpredictable.
Using a copy constructor we simply copy the data values member by
member. This method of copying is called shallow copy. If the object is a simple
class, comprised of built in types and no pointers this would be acceptable. This
function would use the values and the objects and its behavior would not be altered
with a shallow copy, only the addresses of pointers that are members are copied and
not the value the address is pointing to. The data values of the object would then be
inadvertently altered by the function. When the function goes out of scope, the copy
of the object with all its data is popped off the stack.
If the object has any pointers a deep copy needs to be executed. With the
deep copy of an object, memory is allocated for the object in free store and the
elements pointed to are copied. A deep copy is used for objects that are returned
from a function.
41.
Which is the parameter that is added implicitly to every non-static member function
in a class?
this pointer
42.
43.
44.
45.
null pointer is checked. No delete is ever necessary. Objects are automatically freed
when the last pointer to them has gone away. One significant problem with these
smart pointers is that unlike regular pointers, they don't respect inheritance. Smart
pointers are unattractive for polymorphic code. Given below is an example for the
implementation of smart pointers.
Example:
smart_pointer(const X& x)
X& operator *( );
const X& operator*( ) const;
X* operator->() const;
smart_pointer(const smart_pointer <X> &);
const smart_pointer <X> & operator =(const smart_pointer<X>&);
~smart_pointer();
private:
//...
};
This class implement a smart pointer to an object of type X. The object
itself is located on the heap. Here is how to use it:
smart_pointer <employee> p= employee("Harris",1333);
Like other overloaded operators, p will behave like a regular pointer,
cout<<*p;
p->raise_salary(0.5);
46.
How will you decide whether to use pass by reference, by pointer and by value?
The selection of the argument passing depends on the situation.
If a function uses passed data without modifying it,
If the data object is small, such as a built-in data type or a small structure then
pass it by value.
If the data object is an array, use a pointer because that is the only choice. Make
the pointer a pointer to const.
If the data object is a good-sized structure, use a const pointer or a const
reference to increase program efficiency. You save the time and space needed
to copy a structure or a class design, make the pointer or reference const.
If the data object is a class object, use a const reference. The semantics of class
design often require using a reference. The standard way to pass class object
arguments is by reference.
47.
48.
Will the inline function be compiled as the inline function always? Justify.
An inline function is a request and not a command. Hence it won't be
compiled as an inline function always.
Inline-expansion could fail if the inline function contains loops, the address
of an inline function is used, or an inline function is called in a complex expression.
The rules for inlining are compiler dependent.
49.
Define a way other than using the keyword inline to make a function inline.
The function must be defined inside the class.
50.
int ival__3Foo;
...
};
Unambiguous access of either ival members is achieved through name
mangling. Member functions, because they can be overloaded, require an extensive
mangling to provide each with a unique name. Here the compiler generates the
same name for the two overloaded instances(Their argument lists make their
instances unique).
51.
52.
.*
.->
::
?:
List out the rules for selecting a particular function under function overloading.
An exact match is better than a trivial adjustment.
A trivial adjustment (e.g. adding const qualification and/or decaying an
array to a pointer to its first element) is preferred over an integral
promotion.
Integral promotion - such as conversion from char to int - beat other
standard conversions.
Standard conversions are better than user defined conversions.
Matching ellipsis arguments is the worst kind of match.
53.
The dominance rule states that if two classes contain the function searched
for, and if one class is derived from the another, the derived class dominates.
54.
55.
56.
List out the argument matching rules for overloaded function selection within the
same type.
57.
List out the functions that are not (and can't be) inherited in C++.
Constructors,
Destructors,
User defined new operators,
User defined assignment operators,
Friend relationships.
58.
Declaring a static member function with the const keyword doesn't make sense.
Why?
The purpose of the const keyword is to prevent the modification of the values
59.
60.
61.
62.
63.
64.
65.
}
In this example the functions f() ,f(int) and f(double) are the candidate
functions .
66.
67.
68.
69.
70.
71.
endl
ends
flush
hex
oct
ws
72.
can be recursive.
73.
74.
//auto_ptr to string
75.
76.
77.
iterator, but an iterator is not necessarily a C++ pointer. Iterators, like pointers can
be dereferenced, incremented and decremented. At any point in time, an iterator is
positioned at exactly one place in one collection, and remains positioned there until
explicitly moved.
Container Classes
Generic Algorithms
Vector
Sort
Iterator
78.
79.
s(x);
...
x:=cont_iter.next();
end;
In this example, cont_iter is the name of the iterator. It is created on the first
line by instantiation of cont_iterator class, an iterator class defined to iterate over
some container class, cont. Succesive elements from the container are carried to x.
The loop terminates when x is bound to some empty value. (Here, none)In the
middle of the loop, there is s(x) an operation on x, the current element from the
container. The next element of the container is obtained at the bottom of the loop.
80.
In this example, the exception is thrown in the function sum and there is
neither a try block, nor a catch bolock in the function. The control is shifted to
search in the calling function, looking for an exception handler. If one such handler
is found, program continues execution. If no such handler is found, the program
terminates. This process of searching for exception handler in the calling functions
resulting in the discarding of stack frames and subsequent calling of destructors for
the local objects is known as stack unwindling.
Exercise
1. Justify the use of virtual constructors and destructors in C++.
2. Each C++ object possesses the 4 member fns,(which can be declared by the
programmer explicitly or by the implementation if they are not available). What
are those 4 functions?
3. Inheritance is also known as -------- relationship. Containership as ________
relationship.
4. When is it necessary to use member-wise initialization list (also known as
header initialization list) in C++?
5. Which is the only operator in C++ which can be overloaded but NOT inherited.
Section-II Java
Note: All the programs are tested under JDK 1.3 Java compiler.
1. class ArrayCopy{
public static void main(String[] args){
int ia1[] = { 1, 2 };
int ia2[] = (int[])ia1.clone();
System.out.print((ia1 == ia2) + " ");
ia1[1]++;
System.out.println(ia2[1]);
}
}
Answer:
false 2
Explanation:
The clone function creates a new object with a copy of the original object.
The == operator compares for checking if the both refer to the same object and
returns false (a boolean value) because they are different objects. When
concatenated with a string it prints false instead of 0.
Since ia1 and ia2 are two different array objects the change in the values
stored in ia1 array object doesnt affect the object ia2.
2.
import javautil.StringTokenizer;
class STTest {
public static void main(String args[]) {
String s = "9 23 45.4 56.7";
StringTokenizer st = new StringTokenizer(s);
while (st.hasMoreTokens())
System.out.println(st.nextToken());
}
}
Answer:
9
23
45.4
56.7
Explanation:
The StringTokenizer parses the given string to return the individual tokens.
Here the String s has four white-spaces that act as a separators, resulting in the
printing of those individual tokens.
3.
class ConvertTest {
public static void main (String args[]){
String str;
str = "25";
int i = Integer.valueOf(str).intValue();
System.out.println(i);
str = "25.6";
double d = Double.valueOf(str).doubleValue();
System.out.println(d);
}
}
Answer:
25 25.6
Explanation:
This program just explains how the static member funntions of the classes
Integer and Double can be used to convert the string values that have numbers to
the get primitive data-type values.
4.
class StaticTest {
public static void main(String[] args) {
int i = getX();
}
public int getX() {
return 3;
}
}
Answer:
5.
class Test {
public static void main(String[] args) {
String s1 = new String("Hello World");
String s2 = new String("Hello World");
if (s1 == s2)
System.out.println("The strings are the same.");
else
System.out.println("The strings are different.");
}
}
Answer:
The strings are different.
Explanation:
When used on objects, == tests whether the two objects are the same
object, not whether they have the same value.
To compare two objects for equality, rather than identity, you should
use the equals() method.
6.
class Test {
public static void main(String[] args) {
String s1 = "Hello World";
String s2 = "Hello World";
if (s1 == s2)
System.out.println("The strings are the same");
else
System.out.println("The strings are different");
}
}
Answer:
The strings are the same.
Explanation:
Note that these two are string literals and not Strings. The compiler
recognizes that the two string literals have the same value and it performs a simple
optimization of only creating one String object. Thus s1 and s2 both refer to the
same object and are therefore equal. The Java Language Specification requires this
behavior. However, not all compilers get this right so in practice this behavior here
is implementation dependent.
7.
some = 100
Inside main
Explanation:
Static blocks are executed before the invocation of main(). So at first the
Inside static is printed. After that the main function is called. It creates the object
of the same type. So it leads to the printing of some = 100. Finally the println
inside the main() is executed to print Inside main.
8.
Explanation:
Java doesnt allow function declared within a function declaration (nested
functions). Hence the error.
9.
10.
class Test {
public static void main(String[] args) {
Button b;
b.setText("Hello");
}
}
Answer:
Runtime Error : NullPointerException
Explanation:
11.
class Test {
void Test() {
System.out.println("Testing") ;
}
public static void main(String argv[]) {
Test ex = new Test() ;
}
}
Answer:
Compiler Error : void before Test()
Explanation:
Constructor doesnt have any return type; so even void shouldn't be
specified as return type.
12.
class Test {
int some=10 ;
void Test() {
this(some++) ;
}
void Test(int i) {
System.out.println(some);
}
public static void main( String argv[] ) {
new Test();
}
}
Answer:
Compiler Error : Cannot use this inside the constructor
Explanation:
this is a special one that it refers to the same object. But this can be used
only after creation of the object. It cant be used within a constructor. This leads to
the issue of the error.
16.
class Test {
public int some;
public static void main(String argv[]) {
int i = new Test().some;
System.out.println(i) ;
}
}
Answer:
0
Explanation:
All member variables are initialised during creation of the object. In the
statement:
int i = new Test().some;
a new object of type Test is created and the value of member j in that
object is referenced (the object created is not assigned to any reference) unig the
. (dot) operator.
13.
14.
All programs can be written in terms of three types of control structures: What are
those three?
Sequence,selection and repetition.
15.
16.
and
porting
17.
18.
19.
Java's finally block provides a mechanism that allows your method to clean up
after itself regardless of what happens within the try block. True or False?
True.
20.
Explain why you should place exception handlers furthermost from the root of the
exception hierarchy tree first in the list of exception handlers.
An exception hander designed to handle a specialized "leaf" object may be
preempted by another handler whose exception object type is closer to the root of
the exception hierarchy tree if the second exception handler appears earlier in the
list of exception handlers.
21.
What method of which class would you use to extract the message from an
exception object?
The getMessage() method of the Throwable class.
22.
1.
2.
kill() returns 0. This implies that a process exists with the given PID,
and the system would allow you to send signals to it. It is systemdependent whether the process could be a zombie.
kill() returns -1, errno == ESRCH either no process exists with the
given PID, or security enhancements are causing the system to deny its
existence. (On
kill() returns -1, errno == EPERM the system would not allow you to
kill the specified process. This means that either the process exists
(again, it could be a zombie) or draconian security enhancements are
present (e.g. your process is not allowed to send signals to *anybody*).
kill() returns -1, with some other value of errno you are in trouble!
The most-used technique is to assume that success or failure with
EPERM implies that the process exists, and any other error implies
that it doesn't.
An alternative exists, if you are writing specifically for a system (or all
those systems) that provide a /proc filesystem: checking for the existence of
/proc/PID may work.
3.
4.
How to terminate a process which is running and the specialty on command kill 0?
With the help of kill command we can terminate the process.
Syntax: kill pid
Kill 0 - kills all processes in your system except the login shell.
5.
What is redirection?
Directing the flow of data to the file or from the file for input or output.
Example : ls > wc
6.
7.
8.
How does the kernel differentiate device files and ordinary files?
Kernel checks 'type' field in the file's inode structure.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
NICE
TOUCH
20.
21.
22.
Which command is used to delete all files in the current directory and all its subdirectories?
rm -r *
23.
24.
25.
Syntax :
Example :
26.
27.
PATH evaluation: It finally looks for the PATH variable to determine the
sequence of directories it has to search in order to hunt for the command.
28.
29.
How is the command $cat <file1 >file2 different from $cat >file2 <file1 ?
Both the commands mean the same , the file file1 is read and its contents
are copied to file2
30.
31.
32.
What does the command $who | sort logfile > newfile do?
The input from a pipe can be combined with the input from a file . The trick
is to use the special symbol - (a hyphen) for those commands that recognize the
hyphen as std input.
In the above command the output from who becomes the std input to sort ,
meanwhile sort opens the file logfile, the contents of this file is sorted together with
the output of who (rep by the hyphen) and the sorted output is redirected to the file
newfile.
33.
34.
Explain the command $who | tee file1 file2 /dev/tty3a | sort > file3
Store the output of who in file1, file2 ,display the same output on the screen
store the sorted output int file3. /dev/tty3a is the file associated with the terminal.
Exercise :35.
36.
Section II SQL
1.
2.
3.
4.
5.
What is the parameter substitution symbol used with INSERT INTO command?
&
6.
Which command displays the SQL command in the SQL buffer, and then executes
it?
RUN
7.
8.
9.
State true or false. !=, <>, ^= all denote the same operation.
True
10.
What are the privileges that can be granted on a table by a user to others?
Insert, update, delete, select, references, index, execute, alter, all
11.
What command is used to get back the privileges offered by the GRANT command?
REVOKE
12.
obtained?
USER_TAB_PRIVS_MADE, USER_TAB_PRIVS_RECD
13.
Which system table contains information on constraints on all the tables created?
USER_CONSTRAINTS
14.
Both will result in deleting all the rows in the table EMP.
15.
16.
What command is used to create a table by copying the structure of another table?
Answer :
CREATE TABLE .. AS SELECT command
Explanation :
To copy only the structure, the WHERE clause of the SELECT command
should contain a FALSE statement as in the following.
CREATE TABLE NEWTABLE AS SELECT * FROM EXISTINGTABLE
WHERE 1=2;
If the WHERE condition is true, then all the rows or rows satisfying the
condition will be copied to the new table.
17.
SELECT
REPLACE(TRANSLATE(LTRIM(RTRIM('!!
18.
19.
20.
Which date function is used to find the difference between two dates?
MONTHS_BETWEEN
21.
22.
command?
The privilege receiver can further grant the privileges he/she has obtained
from the owner to any other user.
23.
What is the use of the DROP option in the ALTER TABLE command?
It is used to drop constraints specified on the table.
24.
What is the value of comm and sal after executing the following query if the
25.
26.
27.
Which function is used to find the largest integer less than or equal to a specific
value?
FLOOR
28.
SQL QUERIES
I. SCHEMAS
Table 1 : STUDIES
PNAME (VARCHAR), SPLACE (VARCHAR), COURSE (VARCHAR), CCOST
(NUMBER)
Table 2 : SOFTWARE
PNAME
(VARCHAR),
TITLE
(VARCHAR),
DEVIN
(VARCHAR),
SCOST
Table 3 : PROGRAMMER
PNAME (VARCHAR), DOB (DATE), DOJ (DATE), SEX (CHAR), PROF1
(VARCHAR), PROF2 (VARCHAR), SAL (NUMBER)
LEGEND :
PNAME Programmer Name, SPLACE Study Place, CCOST Course Cost, DEVIN
Developed in, SCOST Software Cost, DCOST Development Cost, PROF1
Proficiency 1
QUERIES :
1. Find out the selling cost average for packages developed in Oracle.
2. Display the names, ages and experience of all programmers.
3. Display the names of those who have done the PGDCA course.
4. What is the highest number of copies sold by a package?
5. Display the names and date of birth of all programmers born in April.
6. Display the lowest course fee.
7. How many programmers have done the DCA course.
8. How much revenue has been earned through the sale of packages developed in C.
9. Display the details of software developed by Rakesh.
10. How many programmers studied at Pentafour.
11. Display the details of packages whose sales crossed the 5000 mark.
12. Find out the number of copies which should be sold in order to recover the
development cost of each package.
13. Display the details of packages for which the development cost has been recovered.
14. What is the price of costliest software developed in VB?
KEYS:
32.SELECT
'Mr.'
||
PNAME
||
'
has
'
||
II . SCHEMA :
Table 1 : DEPT
DEPTNO (NOT NULL , NUMBER(2)), DNAME (VARCHAR2(14)),
LOC (VARCHAR2(13)
Table 2 : EMP
EMPNO (NOT NULL , NUMBER(4)), ENAME (VARCHAR2(10)),
JOB (VARCHAR2(9)), MGR (NUMBER(4)), HIREDATE (DATE),
SAL (NUMBER(7,2)), COMM (NUMBER(7,2)), DEPTNO (NUMBER(2))
MGR is the empno of the employee whom the employee reports to. DEPTNO is a foreign
key.
QUERIES
1.List all the employees who have at least one person reporting to them.
2.List the employee details if and only if more than 10 employees are present in department
no 10.
3.List the name of the employees with their immediate higher authority.
4.List all the employees who do not manage any one.
5.List the employee details whose salary is greater than the lowest salary of an employee
belonging to deptno 20.
6.List the details of the employee earning more than the highest paid manager.
7.List the highest salary paid for each job.
8.Find the most recently hired employee in each department.
9.In which year did most people join the company? Display the year and the number of
employees.
10.Which department has the highest annual remuneration bill?
11.Write a query to display a * against the row of the most recently hired employee.
12.Write a correlated sub-query to list out the employees who earn more than the average
salary of their department.
13.Find the nth maximum salary.
14.Select the duplicate records (Records, which are inserted, that already exist) in the
EMP table.
15.Write a query to list the length of service of the employees (of the form n years and m
months).
KEYS:
Quantitative Aptitude
FORMULA LIST:
ALGEBRA :
1. Sum of first n natural numbers = n(n+1)/2
2. Sum of the squares of first n natural numbers = n(n+1)(2n+1)/6
3. Sum of the cubes of first n natural numbers = [n(n+1)/2]2
4. Sum of first n natural odd numbers = n2
5. Average = (Sum of items)/Number of items
Tests of Divisibility :
PERCENTAGES :
1. If A is R% more than B, then B is less than A by R / (100+R) * 100
2. If A is R% less than B, then B is more than A by R / (100-R) * 100
3. If the price of a commodity increases by R%, then reduction in consumption, not to
increase the expenditure is : R/(100+R)*100
4. If the price of a commodity decreases by R%, then the increase in consumption, not to
decrease the expenditure is : R/(100-R)*100
2. A man sold two articles for Rs. X each. On one he gains y% while on the other he
loses y%. How much does he gain or lose in the whole transaction?
In such a question, there is always a lose. The selling price is immaterial.
Formula: Loss % =
10
3. A discount dealer professes to sell his goods at cost price but uses a weight of 960
gms. For a kg weight. Find his gain percent.
Error
Formula: Gain % =
*100
PROBLEMS ON TRAINS :
1. Time taken by a train x metres long in passing a signal post or a pole or a standing man is
equal to the time taken by the train to cover x metres.
2. Time taken by a train x metres long in passing a stationary object of length y metres is
equal to the time taken by the train to cover x+y metres.
3. Suppose two trains are moving in the same direction at u kmph and v kmph such that u>v,
then their relative speed = u-v kmph.
4. If two trains of length x km and y km are moving in the same direction at u kmph and v
kmph, where u>v, then time taken by the faster train to cross the slower train = (x+y)/(u-v)
hours.
5. Suppose two trains are moving in opposite directions at u kmph and v kmph. Then, their
relative speed = (u+v) kmph.
6. If two trains of length x km and y km are moving in the opposite directions at u kmph and
v kmph, then time taken by the trains to cross each other = (x+y)/(u+v)hours.
7. If two trains start at the same time from two points A and B towards each other and after
crossing they take a and b hours in reaching B and A respectively, then A's speed : B's
speed = (b :
LOGARITHMS :
If am = x , then m = logax.
Properties :
1. log xx = 1
2. log x1 = 0
3. log a(xy) = log ax + log ay
4. log a(x/y) = log ax - log ay
5. log ax = 1/log xa
6. log a(xp) = p(log ax)
7. log ax = log bx/log ba
Note : Logarithms for base 1 does not exist.
Area
Perimeter
Circle
(Radius)2
2(Radius)
Square
(side)2
4(side)
Rectangle
length*breadth
2(length+breadth)
Cone :
Let r be the radius of base, h be the height, and l be the slant height of the cone.
Then,
1. l2 = h2 + r2
2. Volume = 1/3(r2h) cu units
3. Curved Surface Area = rl sq units
4. Total Surface Area = rl + r2 sq units
Sphere :
Let r be the radius of the sphere. Then,
1. Volume = (4/3)r3 cu units
2. Surface Area = 4r2 sq units
Hemi-sphere :
Let r be the radius of the hemi-sphere. Then,
1. Volume = (2/3)r3 cu units
2. Curved Surface Area = 2r2 sq units
3. Total Surface Area = 3r2 sq units
Prism :
Volume = (Area of base)(Height)
Exercise 1
Solve the following and check with the answers given at the end.
1.
It was calculated that 75 men could complete a piece of work in 20 days. When
work was scheduled to commence, it was found necessary to send 25 men to
another project. How much longer will it take to complete the work?
2.
3.
A dishonest shopkeeper professes to sell pulses at the cost price, but he uses a false
weight of 950gm. for a kg. His gain is %.
4.
A software engineer has the capability of thinking 100 lines of code in five minutes
and can type 100 lines of code in 10 minutes. He takes a break for five minutes
after every ten minutes. How many lines of codes will he complete typing after an
hour?
5.
A man was engaged on a job for 30 days on the condition that he would get a wage
of Rs. 10 for the day he works, but he have to pay a fine of Rs. 2 for each day of his
absence. If he gets Rs. 216 at the end, he was absent for work for ... days.
6.
A contractor agreeing to finish a work in 150 days, employed 75 men each working
8 hours daily. After 90 days, only 2/7 of the work was completed. Increasing the
number of men by ________ each working now for 10 hours daily, the work can be
completed in time.
7.
8.
(b)
(c)
(d)
10
(d)
100
A man bought a horse and a cart. If he sold the horse at 10 % loss and the cart at 20
% gain, he would not lose anything; but if he sold the horse at 5% loss and the cart
at 5% gain, he would lose Rs. 10 in the bargain. The amount paid by him was Rs._______ for the horse and Rs.________ for the cart.
9.
A tennis marker is trying to put together a team of four players for a tennis
tournament out of seven available. males - a, b and c; females m, n, o and p. All
players are of equal ability and there must be at least two males in the team. For a
team of four, all players must be able to play with each other under the following
restrictions:
b should not play with m,
c should not play with p, and
a should not play with o.
Which of the following statements must be false?
1. b and p cannot be selected together
2. c and o cannot be selected together
3. c and n cannot be selected together.
10-12. The following figure depicts three views of a cube. Based on this, answer
questions 10-12.
2
1
4
3
22
10.
11.
The number on the faces adjacent to the face marked 5 are _______ .
12.
Which of the following pairs does not correctly give the numbers on the opposite
faces.
(1)
13.
6,5
(2)
4,1
(3)
1,3
(4)
4,2
Five farmers have 7, 9, 11, 13 & 14 apple trees, respectively in their orchards. Last
year, each of them discovered that every tree in their own orchard bore exactly the
same number of apples. Further, if the third farmer gives one apple to the first, and
the fifth gives three to each of the second and the fourth, they would all have
exactly the same number of apples. What were the yields per tree in the orchards of
the third and fourth farmers?
14.
Five boys were climbing a hill. J was following H. R was just ahead of G. K was
between G & H. They were climbing up in a column. Who was the second?
15-18 John is undecided which of the four novels to buy. He is considering a spy
thriller, a Murder mystery, a Gothic romance and a science fiction novel. The books
are written by Rothko, Gorky, Burchfield and Hopper, not necessary in that order,
and published by Heron, Piegon, Blueja and sparrow, not necessary in that order.
1
4
15.
16.
17.
John purchases books by the authors whose names come first and third in
alphabetical order. He does not buy the books ______.
18.
On the basis of the first paragraph and statement (2), (3) and (4) only, it is possible
to deduce that
1. Rothko wrote the murder mystery or the spy thriller
19.
If a light flashes every 6 seconds, how many times will it flash in of an hour?
20.
If point P is on line segment AB, then which of the following is always true?
(1) AP = PB (2) AP > PB (3) PB > AP (4) AB > AP (5) AB > AP + PB
21.
All men are vertebrates. Some mammals are vertebrates. Which of the following
conclusions drawn from the above statement is correct.
All men are mammals
All mammals are men
Some vertebrates are mammals.
None
22.
Which of the following statements drawn from the given statements are correct?
Given:
All watches sold in that shop are of high standard. Some of the HMT watches are
sold in that shop.
a) All watches of high standard were manufactured by HMT.
b) Some of the HMT watches are of high standard.
c) None of the HMT watches is of high standard.
d) Some of the HMT watches of high standard are sold in that shop.
23-27.
1. Ashland is north of East Liverpool and west of Coshocton.
2. Bowling green is north of Ashland and west of Fredericktown.
3. Dover is south and east of Ashland.
4. East Liverpool is north of Fredericktown and east of Dover.
5. Fredericktown is north of Dover and west of Ashland.
6. Coshocton is south of Fredericktown and west of Dover.
23.
24.
(e) Fredericktown
25.
(c) Coshocton
(b) Coshocton
II b only
III c only
Va&c
Which of the following towns must be situated both south and west of at least one
other town?
A. Ashland only
B. Ashland and Fredericktown
C. Dover and Fredericktown
D. Dover, Coshocton and Fredericktown
26.
Which of the following statements, if true, would make the information in the
numbered statements more specific?
(a) Coshocton is north of Dover.
(b) East Liverpool is north of Dover
(c) Ashland is east of Bowling green.
(d) Coshocton is east of Fredericktown
(e) Bowling green is north of Fredericktown
27.
Which of the numbered statements gives information that can be deduced from one
or more of the other statements?
(1
28.
(B) 2
(C) 3
(D) 4
(E) 6
Eight friends Harsha, Fakis, Balaji, Eswar, Dhinesh, Chandra, Geetha, and Ahmed
are sitting in a circle facing the center. Balaji is sitting between Geetha and
Dhinesh. Harsha is third to the left of Balaji and second to the right of Ahmed.
Chandra is sitting between Ahmed and Geetha and Balaji and Eshwar are not sitting
opposite to each other. Who is third to the left of Dhinesh?
29.
If every alternative letter starting from B of the English alphabet is written in small
letter, rest all are written in capital letters, how the month September be written.
(1)
SeptEMbEr
(2)
SEpTeMBEr (3)
SeptembeR
(4)
30.
SepteMber
(5)
The length of the side of a square is represented by x+2. The length of the side of
an equilateral triangle is 2x. If the square and the equilateral triangle have equal
perimeter, then the value of x is _______.
31.
It takes Mr. Karthik y hours to complete typing a manuscript. After 2 hours, he was
called away. What fractional part of the assignment was left incomplete?
32.
(2)
39/50 (3)
7/25
(4)
3/10
(5)
59/100
33.
34.
There are 3 persons Sudhir, Arvind, and Gauri. Sudhir lent cars to Arvind and
Gauri as many as they had already. After some time Arvind gave as many cars to
Sudhir and Gauri as many as they have. After sometime Gauri did the same thing.
At the end of this transaction each one of them had 24. Find the cars each originally
had.
35.
A man bought a horse and a cart. If he sold the horse at 10 % loss and the cart at 20
% gain, he would not lose anything; but if he sold the horse at 5% loss and the cart
at 5% gain, he would lose Rs. 10 in the bargain. The amount paid by him was Rs._______ for the horse and Rs.________ for the cart.
Answers:
1.
Answer:
30 days.
Explanation:
Before:
One day work
1 / 20
1 / ( 20 * 75)
No. Of workers
50
50 * 1 / ( 20 * 75)
Now:
The total no. of days required to complete the work = (75 * 20) / 50 = 30
2.
Answer:
0%
Explanation:
Since 3x / 2 = x / (2 / 3)
3.
Answer:
5.3 %
Explanation:
He sells 950 grams of pulses and gains 50 grams.
If he sells 100 grams of pulses then he will gain (50 / 950) *100 = 5.26
4.
Answer:
250 lines of codes
5.
Answer:
7 days
Explanation:
The equation portraying the given problem is:
10 * x 2 * (30 x) = 216 where x is the number of working days.
Solving this we get x = 23
Number of days he was absent was 7 (30-23) days.
6.
Answer:
150 men.
Explanation:
One days work
2 / (7 * 90)
2 / (7 * 90 * 8)
2 / (7 * 90 * 8 * 75)
The remaining work (5/7) has to be completed within 60 days, because the
total number of days allotted for the project is 150 days.
We get x = 225
Since we have 75 men already, it is enough to add only 150 men.
7.
Answer:
(c) 1
Explanation:
a percent of b : (a/100) * b
b percent of a : (b/100) * a
a percent of b divided by b percent of a : ((a / 100 )*b) / (b/100) * a )) = 1
8.
Answer:
Cost price of horse = Rs. 400 & the cost price of cart = 200.
Explanation:Let x be the cost price of the horse and y be the cost price of the cart.
In the first sale there is no loss or profit. (i.e.) The loss obtained is equal to the gain.
Therefore
(10/100) * x
= (20/100) * y
= 2*y
-----------------(1)
In the second sale, he lost Rs. 10. (i.e.) The loss is greater than the profit by Rs. 10.
Therefore
(5 / 100) * x
= (5 / 100) * y + 10 -------(2)
= 10
y = 200
From (1) 2 * 200 = x = 400
9.
Answer:
3.
Explanation:
Since inclusion of any male player will reject a female from the team. Since
there should be four member in the team and only three males are available, the
girl, n should included in the team always irrespective of others selection.
10.
Answer:
5
11.
Answer:
1,2,3 & 4
12.
Answer:
B
13.
Answer:
11 & 9 apples per tree.
Explanation:
Let a, b, c, d & e be the total number of apples bored per year in A, B, C, D
& E s orchard. Given that
a+1=b+3=c1=d+3=e6
But the question is to find the number of apples bored per tree in C and D s
orchard. If is enough to consider c 1 = d + 3.
Since the number of trees in Cs orchard is 11 and that of Ds orchard is 13.
Let x and y be the number of apples bored per tree in C & d s orchard respectively.
Therefore 11 x 1 = 13 y + 3
By trial and error method, we get the value for x and y as 11 and 9
14.
Answer:
G.
Explanation:
The order in which they are climbing is R G K H J
15 18
Answer:
Novel Name
Author
Publisher
Spy thriller
Rathko
Heron
Murder mystery
Gorky
Piegon
Gothic romance
Burchfield
Blueja
Science fiction
Hopper
Sparrow
Novel Name
Author
Publisher
Spy thriller
Rathko
Heron
Murder mystery
Gorky
Piegon
Gothic romance
Burchfield
Blueja
Science fiction
Hopper
Sparrow
Explanation:
Given
Since Blueja doesnt publish the novel by Burchfield and Heron publishes
the novel spy thriller, Piegon publishes the novel by Burchfield.
Since Hopper writes Gothic romance and Heron publishes the novel spy
thriller, Blueja publishes the novel by Hopper.
Since Heron publishes the novel spy thriller and Heron publishes the novel
by Gorky, Gorky writes Spy thriller and Rathko writes Murder mystery.
19.
Answer:
451 times.
Explanation:
There are 60 minutes in an hour.
In of an hour there are (60 * ) minutes = 45 minutes.
In of an hour there are (60 * 45) seconds = 2700 seconds.
Light flashed for every 6 seconds.
In 2700 seconds 2700/6 = 450 times.
The count start after the first flash, the light will flashes 451 times in of
an hour.
20.
Answer:
(4)
Explanation:
P
A
21.
Answer: (c)
22.
Ahmed
23 - 27.Answer:
Fakis
28.
Chandra
Answer: Fakis
Explanation:
Harsha
Geetha
Eswar
Balaji
Dhinesh
29.
Answer:
(5).
Explanation:
Since every alternative letter starting from B of the English alphabet is
written in small letter, the letters written in small letter are b, d, f...
In the first two answers the letter E is written in both small & capital letters,
so they are not the correct answers. But in third and fourth answers the letter is
written in small letter instead capital letter, so they are not the answers.
30.
Answer:
x=4
Explanation:
Since the side of the square is x + 2, its perimeter = 4 (x + 2) = 4x + 8
Since the side of the equilateral triangle is 2x, its perimeter = 3 * 2x = 6x
Also, the perimeters of both are equal.
31.
(i.e.)
4x + 8 = 6x
(i.e.)
2x = 8 x = 4.
Answer:
5
(y 2) / y.
Explanation:
To type a manuscript karthik took y hours.
Therefore his speed in typing = 1/y.
He was called away after 2 hours of typing.
Therefore the work completed = 1/y * 2.
Therefore the remaining work to be completed = 1 2/y.
(i.e.) work to be completed = (y-2)/y
32.
Answer:
(2)
33.
Answer:
1
Explanation:
One is the only number exists without reciprocal because the reciprocal of
one is one itself.
34.
Answer:
Sudhir had 39 cars, Arvind had 21 cars and Gauri had 12 cars.
Explanation:
Sudhir
Finally
24
Gauri
24
24
12
12
48
42
24
21
12
35.
Arvind
Answer:
Cost price of horse:
Rs. 200
Explanation:
Let x be the cost of horse & y be the cost of the cart.
10 % of loss in selling horse = 20 % of gain in selling the cart
Therefore
x = 2y -----------(1)
5 % of loss in selling the horse is 10 more than the 5 % gain in selling the
cart.
Therefore
(5 / 100) * x - 10 = (5 / 100) * y
5x - 1000
5y
Substituting (1)
10y - 1000 = 5y
5y = 1000
y = 200
x = 400
from (1)
Exercise 2.1
For the following, find the next term in the series
1.
b) 366
Answer:
c) 330
d) 660
336
Explanation:
The series is 1.2.3, 2.3.4, 3.4.5, 4.5.6, 5.6.7, .....
2.
1, 5, 13, 25
Answer:
Explanation:
41
3.
0, 5, 8, 17
Answer:
24
Explanation:
1^2-1, 2^2+1, 3^2-1, 4^2+1, 5^2-1
4.
216
Explanation:
1^2, 2^3, 3^2, 4^3, 5^2, 6^3
5.
8,24,12,36,18,54
Answer:
71,76,69,74,67,72
Answer:
7.
27
67
5,9,16,29,54
Answer:
103
Explanation:
5*2-1=9; 9*2-2=16; 16*2-3=29; 29*2-4=54; 54*2-5=103
8.
200
Explanation:
The series is powers of 2 (2^0,2^1,..).
All digits are less than 8. Every second number is in octal number system.
128 should follow 64. 128 base 10 = 200 base 8.
Exercise 2.2
Find the odd man out.
1.
3,5,7,12,13,17,19
Answer:
12
Explanation:
All but 12 are odd numbers
2.
2,5,10,17,26,37,50,64
Answer:
64
Explanation:
2+3=5; 5+5=10; 10+7=17; 17+9=26; 26+11=37; 37+13=50; 50+15=65;
3.
105,85,60,30,0,-45,-90
Answer:
Explanation:
Exercise 3
Solve the following.
1.
What is the number of 0 at the end of the product of the numbers from 1 to 100?
Answer:
2.
127
A fast typist can type some matter in 2 hours and a slow typist can type the same in
3 hours. If both type combinely, in how much time will they finish?
Answer:
1 hr 12 min
Explanation:
The fast typist's work done in 1 hr = 1/2
The slow typist's work done in 1 hr = 1/3
If they work combinely, work done in 1 hr = 1/2+1/3 = 5/6
So, the work will be completed in 6/5 hours. i.e., 1+1/5 hours = 1hr 12 min
3.
Gavaskar's average in his first 50 innings was 50. After the 51st innings, his
average was 51. How many runs did he score in his 51st innings. (supposing that he
lost his wicket in his 51st innings)
Answer:
101
Explanation:
Total score after 50 innings = 50*50 = 2500
Total score after 51 innings = 51*51 = 2601
4.
5.
What can you conclude from the statement : All green are blue, all blue are red. ?
i. some blue are green
ii. some red are green
iii. some green are not red
iv. all red are blue
6.
(2)
A rectangular plate with length 8 inches, breadth 11 inches and thickness 2 inches
is available. What is the length of the circular rod with diameter 8 inches and equal
to the volume of the rectangular plate?
Answer:
3.5 inches
Explanation :
Volume of the circular rod (cylinder) = Volume of the rectangular plate
(22/7)*4*4*h = 8*11*2
h = 7/2 = 3.5
7.
What is the sum of all numbers between 100 and 1000 which are divisible by 14 ?
Answer:
35392
Explanation:
The number closest to 100 which is greater than 100 and divisible by 14 is
112, which is the first term of the series which has to be summed.
The number closest to 1000 which is less than 1000 and divisible by 14 is
994, which is the last term of the series.
112 + 126 + .... + 994 = 14(8+9+ ... + 71) = 35392
8.
If s( denotes square root of a, find the value of s(12+s(12+s(12+ ...... upto infinity.
Answer:
Explanation :
Let x = s(12+s(12+s(12+.....
We can write x = s(12+x). i.e., x^2 = 12 + x. Solving this quadratic
equation, we get x = -3 or x=4. Sum cannot be -ve and hence sum = 4.
9.
A cylindrical container has a radius of eight inches with a height of three inches.
Compute how many inches should be added to either the radius or height to give
the same increase in volume?
Answer:
16/3 inches
Explanation:
Let x be the amount of increase. The volume will increase by the same
amount if the radius increased or the height is increased. So, the effect on
increasing height is equal to the effect on increasing the radius.
i.e., (22/7)*8*8*(3+x) = (22/7)*(8+x)*(8+x)*3
Solving the quadratic equation we get the x = 0 or 16/3. The possible
increase would be by 16/3 inches.
10.
With just six weights and a balance scale, you can weigh any unit number of kgs
from 1 to 364. What could be the six weights?
Answer:
11.
Diophantus passed one sixth of his life in childhood, one twelfth in youth, and one
seventh more as a bachelor; five years after his marriage a son was born who died
four years before his father at half his final age. How old is Diophantus?
Answer:
84 years
Explanation:
x/6 + x/12 + x/7 + 5 + x/2 + 4 = x
12.
If time at this moment is 9 P.M., what will be the time 23999999992 hours later?
Answer:
1 P.M.
Explanation:
24 billion hours later, it would be 9 P.M. and 8 hours before that it would be
1 P.M.
13.
How big will an angle of one and a half degree look through a glass that magnifies
things three times?
Answer:
1 1/2 degrees
Explanation:
The magnifying glass cannot increase the magnitude of an angle.
14.
Divide 45 into four parts such that when 2 is added to the first part, 2 is subtracted
from the second part, 2 is multiplied by the third part and the fourth part is divided
by two, all result in the same number.
Answer:
8, 12, 5, 20
Explanation:
a + b + c + d =45;
15.
37 1/2
Explanation:
Time reqd for the first 60 km = 120 min.; Time reqd for the second 60 km =
72 min.; Total time reqd = 192 min
Avg speed = (60*120)/192 = 37 1/2
16.
Which of the following can act as interpreter if Mr. C & Mr. D wish to converse
only Mr. A
Answer:
Explanation:
From the data given, we can infer the following.
A knows Spanish, Italian
B knows Spanish, English
C knows Italian, English
D knows Spanish, French
E knows Italian, French
Mr.
17.
Explanation:
Number of executives who know
i) English is 2
ii) Spanish is 3
iii) Italian is 3
iv) French is 2
Italian & Spanish are spoken by the maximum no of executives. So, if the
6th executive is fluent in Italian & Spanish, he can communicate with all the
original five because everybody knows either Spanish or Italian.
18.
625
Explanation:
The sum of the first n natural odd nos is square(n).
1+3 = 4 = square(2) 1+3+5 = 9 = square(3)
19.
b) 7
c) 3
d) 11
Answer:
(b) 7
Explanation:
Let x be any number. The next six consecutive numbers are x+1, x+2, x+3,
x+4, x+5 and x+6. The sum of these seven numbers are 7x + 21. This is equal to
7(x+3). This number will always divisible by 7. Hence the result.
Exercise 3
Try the following.
1. There are seventy clerks working in a company, of which 30 are females. Also, 30
clerks are married; 24 clerks are above 25 years of age; 19 married clerks are above
25 years, of which 7 are males; 12 males are above 25 years of age; and 15 males are
married. How many bachelor girls are there and how many of these are above 25?
2.
A man sailed off from the North Pole. After covering 2,000 miles in one
direction he turned West, sailed 2,000 miles, turned North and sailed ahead another
2,000 miles till he met his friend. How far was he from the North Pole and in what
direction?
3.
4.
In a group of five people, what is the probability of finding two persons with the
same month of birth?
5.
A father and his son go out for a 'walk-and-run' every morning around a track
formed by an equilateral triangle. The father's walking speed is 2 mph and his running
speed is 5 mph. The son's walking and running speeds are twice that of his father. Both
start together from one apex of the triangle, the son going clockwise and the father
anti-clockwise. Initially the father runs and the son walks for a certain period of time.
Thereafter, as soon as the father starts walking, the son starts running. Both complete
the course in 45 minutes. For how long does the father run? Where do the two cross
each other?
6.
The Director of Medical Services was on his annual visit to the ENT Hospital.
While going through the out patients' records he came across the following data for a
particular day : " Ear consultations 45; Nose 50; Throat 70; Ear and Nose 30; Nose
and Throat 20; Ear and Throat 30; Ear, Nose and Throat 10; Total patients 100."
Then he came to the conclusion that the records were bogus. Was he right?
7.
Amongst Ram, Sham and Gobind are a doctor, a lawyer and a police officer.
They are married to Radha, Gita and Sita (not in order). Each of the wives have a
profession. Gobind's wife is an artist. Ram is not married to Gita. The lawyer's wife is
a teacher. Radha is married to the police officer. Sita is an expert cook. Who's who?
8.
An adult
9.
10.
(b) Lupe
(c) Roberto
(d) Sarah
(e) Vicky
11.
If Freddy sits immediately beside Vicky, which of the following cannot be true ?
a. Jonathan sits immediately beside Sarah
b. Lupe sits immediately beside Vicky
c. Hillary sits in the front passenger seat
d. Freddy sits on the same bench as Hillary
e. Hillary sits on the same bench as Roberto
12.
If Sarah sits on a bench that is behind where Jonathan is sitting, which of the
following must be true ?
a. Hillary sits in a seat or on a bench that is in front of where Marta is sitting
13.
Make six squares of the same size using twelve match-sticks. (Hint : You will
need an adhesive to arrange the required figure)
14.
A farmer has two rectangular fields. The larger field has twice the length and 4
times the width of the smaller field. If the smaller field has area K, then the are of the
larger field is greater than the area of the smaller field by what amount?
( 6K
15.
(b) 8K
(c) 12K(d) 7K
Nine equal circles are enclosed in a square whose area is 36sq units. Find the
area of each circle.
16.
There are 9 cards. Arrange them in a 3*3 matrix. Cards are of 4 colors. They
are red, yellow, blue, green. Conditions for arrangement: one red card must be in first
row or second row. 2 green cards should be in 3rd column. Yellow cards must be in the
3 corners only. Two blue cards must be in the 2nd row. At least one green card in each
row.
17.
(I) z2 = 25
(II) w = 9
To answer the question,
Either I or II is sufficient
b) Both I and II are sufficient but neither of them is alone sufficient
c) I & II are sufficient
d) Both are not sufficient
18.
A speaks truth 70% of the time; B speaks truth 80% of the time. What is the
probability that both are contradicting each other?
19.
In a family 7 children don't eat spinach, 6 don't eat carrot, 5 don't eat beans, 4
don't eat spinach & carrots, 3 don't eat carrot & beans, 2 don't eat beans & spinach.
One doesn't eat all 3. Find the no. of children.
20.
Anna, Bena, Catherina and Diana are at their monthly business meeting. Their
occupations are author, biologist, chemist and doctor, but not necessarily in that order.
Diana just told the neighbour, who is a biologist that Catherina was on her way with
doughnuts. Anna is sitting across from the doctor and next to the chemist. The doctor
was thinking that Bena was a good name for parent's to choose, but didn't say
anything. What is each person's occupation?
Exercise 4.
1.
Krishna, Hari and Prakash went for a race. Krishna gives Hari a start of 20% of
his distance, similarly gives Krishna a start of 20% of his distance. Prakash reached
the designation within 80 sec. whose speed is half that of Krishna. But Hari is twice as
fast as Prakash. By what time after Hari, Krishan reaches the designation.
2.
3.
In a 200m race between Karthik & Arasu, Arasu can give Karthik a start of 20m in
the first 100m. When Karthik crosses the 80m mark both of them changes their speeds
such that Karthik can give Arasu a start of 20m in the next 100m. They complete the
race with that speed. Who is the winner of the race and by how many seconds?
4.
In a race between Vimal, Shree Hari and Varadha, Shree Hari can give Vimal 20%
and Varadha 10% of their distance. then Varadha can give Vimal a start of _______%
of his distance.
5.
In a cricket match Madan chases the ball, which is away from him by 20% of the
distance between him and boundary. If the speed of Madan is 25% more than that of
the ball then they will reach the boundary at the same time. If the speed of the ball is
20m/s then what is the distance between the ball and boundary?
6.
Ganesh & Thiagarajan and Suresh & Sakthivel were the two teams for a 2*100 m
relay. In a hundred-meter race, Ganesh beats Suresh by 20m and Sakthivel beats
Thiagarajan by 20m. The ratio of speeds of Suresh & Thiagarajan is 2:3. Suresh and
Ganesh started the race. The winning team is _____. They win the race beating the
losing team by _____.
7.
The two contestants of a car rally were Arvind and Abilash. Arvind starts 5sec later
and beats Abilash by 5sec. The quickest person goes with a speed twice that of the
other. If Abilash was 100m behind when Arvind finishes the race then what is the
distance that Abilash has to cover to finish the game when Arvind begins the race?
8.
In a circular athletic ground Carl & Gauri started their race standing half a way
from each other. The minimum distance between them is 28m. They have to complete
the race at the same winning point, the Carls starting point. When the race was over
Carl completed three full rounds & Gauri two. If both of them reached the goal at the
same time what is the ratio between the speed of Carl & Gauri
.
9.
In a 1500-meter race, in a 100m circular track, between Guru and Selvam due to
wrong judgement Guru beats Selva by 10sec. The mistake made by the judges was that
they counted one round extra to Guru. The sum of time taken by them is 90sec. If the
mistake was not made, then who is going to win the race & by how many seconds?
10.
In a game of 80 points, Sudhir can give Santhosh 5 points and Shree Ram 15
points. Then how many points Santhosh can give Shree Ram in a game of 60 points?
Part II : Concepts
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
Graph
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.
6.
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.
8.
9.
10.
null branches.
Answer:
21
Explanation:
Let us take a tree with 5 nodes (n=5)
Null Branches
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.
Straight merging,
Natural merging,
Polyphase sort,
Distribution of Initial runs.
12.
ii
iii
iv
In general:
If there are n nodes, there exist 2n-n different trees.
13.
14.
List out a few of the applications that make use of Multilinked Structures.
Sparse matrix,
Index generation.
15.
16.
17.
18.
What is the bucket size, when overlapping and collision occur at the same time?
One. If there is only one entry possible in the bucket, when the collision
occurs, there is no way to accommodate the colliding value. This results in the
overlapping of values.
19.
Traverse the given tree using Inorder, Preorder and Postorder traversals.
Given tree:
A
Inorder :
DHBEAFCIGJ
Preorder: A B D H E C F G I J
Postorder: H D E B F I J G C A
20.
There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could
have formed a full binary tree?
15.
In general:
There are 2n-1 nodes in a full binary tree.
By the method of elimination:
Full binary trees contain odd number of nodes. So there cannot be full
binary trees with 8 or 14 nodes, so rejected. With 13 nodes you can form a
complete binary tree but not a full binary tree. So the correct answer is 15.
Note:
Full and Complete binary trees are different. All full binary trees are
complete binary trees but not vice versa.
21.
In the given binary tree, using array, at which location can can you store the node
4?
1
4
5
Answer:
At location 6
Explanation:
1
2
3
4
5
Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4
where LCn means Left Child of node n and RCn means Right Child of
node n
22.
65
70
75
80
85
60
55
50
45
Sorting takes place from the pivot value, which is the first value of the
given elements, this is marked bold. The values at the left pointer and right pointer
are indicated using L and R respectively.
65
70L
75
80
85
60
55
50
45R
Since pivot is not yet changed the same process is continued after
interchanging the values at L and R positions
65
45
75 L
80
85
60
55
50 R
70
L
R
65
45
50
80
85
60
55
75
70
L
R
65
45
50
55
85
60
80
75
70
65
45
50
55
60 R
85 L
80
75
70
When the L and R pointers cross each other the pivot value is interchanged
with the value at right pointer. If the pivot is changed it means that the pivot has
occupied its original position in the sorted order (shown in bold italics) and hence
two different arrays are formed, one from start of the original array to the pivot
position-1 and the other from pivot position+1 to end.
60 L
55 L
50 L
45
45
45 R
50
50 R
55
55 R
60
60
65
65
65
85 L
70 R
70
80
80 L
80 L
75
75
75 R
70 R
85
85
80
85
45
23.
50
55
60
65
70
75
24.
BFS:
AXGHPEMYJ
DFS:
AXHPEYMJG
Classify the Hashing Functions based on the various methods by which the key
value is found.
Direct method,
Subtraction method,
Modulo-Division method,
Digit-Extraction method,
Mid-Square method,
Folding method,
Pseudo-random method.
25.
What are the types of Collision Resolution Techniques and the methods used in
each of the type?
Open addressing (closed hashing).
The methods used include:
Overflow block.
Closed addressing (open hashing)
The methods used include:
Linked list, Binary tree
26.
In RDBMS, what is the efficient data structure used in the internal storage
representation?
B+ tree. Because in B+ tree, all the data are stored only in leaf nodes, that
makes searching easier. This corresponds to the records that shall be stored in leaf
nodes.
27.
Draw the B-tree of order 3 created by inserting the following data arriving in
sequence 92 24 6 7 11 8 22 4 5 16 19 20 78
11
28.
19
16
24
20
22
7
78
92
Full binary tree loses its nature when operations of insertions and deletions
are done. For incomplete binary trees, extra storage is required and overhead of
NULL node checking takes place. So complete binary tree is the better one since
the property of complete binary tree is maintained even after operations like
additions and deletions are done on it.
29.
30.
Does the minimal spanning tree of a graph give the shortest distance between any 2
specified nodes?
Answer:
No.
Explanation:
Minimal spanning tree assures that the total weight of the tree is kept at its
minimum. But it doesnt mean that the distance between any two nodes involved in
the minimum-spanning tree is minimum.
31.
Convert the given graph with weighted edges to minimal spanning tree.
1
410
600
612
200
310
2985
1421
5
400
200
310
612
(b) Indexed
(c) Random
Answer:
(a) Sequential
33.
34.
35.
02
02
NAME
03
FIRST_NAME
YEAR_OF_STUDY
03
LAST_NAME
03
FIRST_SEM
03
SECOND_SEM
Section II Algorithms
1.
What is an algorithm?
An algorithm consists of a finite set of steps that may require one or more
operations. These operations should be definite and effective. An algorithm should
produce one or more outputs and may have zero or more inputs.
This consists of five distinct areas:
1. to device algorithms
2. to validate the algorithms
3. to express the algorithms
4. to analyse the algorithms
5. to test the programs for the algorithms
2.
3.
Indirect Recursive:
An algorithm A is said to be indirect recursive if it calls another algorithm
which in-turn calls algorithm A.
4.
priori analysis
ii.
posteriori analysis
Priori Analysis:
The bounds of algorithms computing time are obtained by formulating a
function.
Posteriori Analysis:
Testing the actual computation of space and time are recorded while the
algorithm is executing.
5.
Define - Big- O.
For the function f(n)
f(n)=O(g(n))
iff there exist positive constants c and d such that:
f(n) <=c*g(n)
for all n,n>=d.
This is defined to be the worst-time complexity of the function f(n).
For example:
O(n)=3n+2 because,
3n+2 <=4n for all n>=2.
6.
Meaning
O(1)
O(n)
O(n*n)
O(n*n*n)
O(2*2*2*2*..............*n) :
7.
8.
i.
ii.
iii.
Dynamic programming,
iv.
Back-tracking,
v.
9.
10.
11.
O(logn)
O(3n/2-2)
Merge Sort
O(nlogn)
Insertion Sort
O(n*n);
Quick Sort
Selection Sort
12.
O(nlogn)
O(n)
13.
14.
Kruskals Algorithm :
O(n*n)
O(e loge)
15.
16.
17.
18.
RDBMS Concepts
1.
What is database?
A database is a logically coherent collection of data with some inherent
meaning, representing some aspect of real world and which is designed, built and
populated with data for a specific purpose.
2.
What is DBMS?
It is a collection of programs that enables an user to create and maintain a
database. In other words it is general-purpose software that provides users with the
processes of defining, constructing and manipulating the database for various
applications.
3.
4.
5.
6.
Logical level: This is the next higher level of abstraction that describes
what data are stored in database and what is the relationship among
those data.
View level: The highest level of abstraction describes only part of entire
database.
7.
Entity Integrity: States that Primary key cannot have NULL value
Referential Integrity: States that Foreign Key can be either a NULL value
or should be Primary Key value of other relation.
8.
9.
solve real life problems, with performance at least comparable to that of existing
system.
Its two subsystems are
Research Storage
System Relational Data System.
10.
How is the data structure of System R different from the relational structure?
Unlike Relational systems in System R
Domains are not supported
Enforcement of candidate key uniqueness is optional
Enforcement of entity integrity is optional
Referential integrity is not enforced
11.
12.
13.
14.
15.
of code that operate on the object. These bodies of code are called methods. Objects
that contain same types of values and the same methods are grouped together into
classes.
16.
What is an Entity?
It is a 'thing' in the real world with an independent existence.
17.
18.
19.
20.
21.
What is an attribute?
22.
23.
24.
What is Relationship?
It is an association among two or more entities.
25.
26.
27.
25.
26.
27.
28.
29.
30.
31.
32.
34.
What is Record-at-a-time?
The Low level or Procedural DML can specify and retrieve each record
from a set of records. This retrieve of a record is said to be Record-at-a-time.
35.
36.
37.
38.
relational calculus
The tuple-oriented calculus uses a tuple variables i.e., variable whose only
permitted values are tuples of that relation. E.g. QUEL
The domain-oriented calculus has domain variables i.e., variables that range
over the underlying domains instead of over relation. E.g. ILL, DEDUCE.
39.
What is normalization?
It is a process of analysing the given relation schemas based on their
Functional Dependencies (FDs) and primary key to achieve the properties
Minimizing redundancy
Minimizing insertion, deletion and updation anomalies.
40.
attributes X and Y that are subsets of R specifies a constraint on the possible tuple
that can form a relation state r of R. The constraint is for any two tuples t1 and t2 in
r if t1[X] = t2[X] then they have t1[Y] = t2[Y]. This means the value of X
component of a tuple uniquely determines the value of component Y.
41.
A in F with a dependency Y A
42.
R, where X and Y are both subsets of R, specifies the following constraint on any
relation r of R: if two tuples t1 and t2 exist in r such that t1[X] = t2[X] then t3 and
t4 should also exist in r with the following properties
t3[X] = t4[X] = t1[X] = t2[X]
t3[Y] = t1[Y] and t4[Y] = t2[Y]
t3[Z] = t2[Z] and t4[Z] = t1[Z]
where [Z = (R-(X U Y)) ]
43.
44.
45.
any attribute A from X means that the dependency does not hold any more.
46.
What is 2NF?
A relation schema R is in 2NF if it is in 1NF and every non-prime attribute
A in R is fully functionally dependent on primary key.
47.
What is 3NF?
A relation schema R is in 3NF if it is in 2NF and for every FD X
of the following is true
X is a Super-key of R.
A is a prime attribute of R.
A either
48.
49.
What is 4NF?
A relation schema R is said to be in 4NF if for every Multivalued
dependency X
50.
What is 5NF?
A Relation schema R is said to be 5NF if for every join dependency {R1,
R2, ..., Rn} that holds R, one of the following is true :
Ri = R for some i.
The join dependency is implied by the set of FD, over R in which the
left side is key of R.
51.
52.
53.
Types:
Binary search style indexing
B-Tree indexing
Inverted list indexing
Memory resident table
Table indexing
54.
55.
56.
57.
58.
59.
really exist. Such situations are called phantom deadlocks and they lead to
unnecessary aborts.
60.
61.
62.
63.
64.
Network schema uses a graph data structure to organize records example for
such a database management system is CTCG while a hierarchical schema uses a
tree data structure example for such a system is IMS.
65.
What is a query?
A query with respect to DBMS relates to user commands that are used to
interact with a data base. The query language can be classified into data definition
language and data manipulation language.
66.
67.
What are the primitive operations common to all record management systems?
68.
Name the buffer in which all the commands that are typed in are stored
Edit Buffer
69.
70.
Are the resulting relations of PRODUCT and JOIN operation the same?
No.
PRODUCT: Concatenation of every row in one relation with every row in
another.
JOIN: Concatenation of rows from one relation and related rows from
another.
71.
paging; controls locking for concurrent resource usage; dispatches and schedules
user requests; and manages space usage within its table-space structures
.
72.
73.
Which part of the RDBMS takes care of the data dictionary? How
Data dictionary is a set of tables and database objects that is stored in a
special area of the database and maintained exclusively by the kernel.
74.
75.
76.
77. Define SQL and state the differences between SQL and other conventional
programming Languages
SQL is a nonprocedural language that is designed specifically for data
access operations on normalized relational database structures. The primary
difference between SQL and other conventional programming languages is that
SQL statements specify what data operations should be performed rather than how
to perform them.
78.
Name the three major set of files on disk that compose a database in Oracle
There are three major sets of files on disk that compose a database. All the
files are binary. These are
Database files
Control files
Redo logs
The most important of these are the database files where the actual data
resides. The control files and the redo logs support the functioning of the
architecture itself.
All three sets of files must be present, open, and available to Oracle for any
data on the database to be useable. Without these files, you cannot access the
database, and the database administrator might have to recover some or all of the
database using a backup, if there is one.
79.
80. What are the four Oracle system processes that must always be up and running for the
database to be useable
The four Oracle system processes that must always be up and running for
the database to be useable include DBWR (Database Writer), LGWR (Log Writer),
SMON (System Monitor), and PMON (Process Monitor).
81. What are database files, control files and log files. How many of these files should a
database have at least? Why?
Database Files
The database files hold the actual data and are typically the largest in size.
Depending on their sizes, the tables (and other objects) for all the user accounts can
go in one database filebut that's not an ideal situation because it does not make
the database structure very flexible for controlling access to storage for different
users, putting the database on different disk drives, or backing up and restoring just
part of the database.
You must have at least one database file but usually, more than one files are
used. In terms of accessing and using the data in the tables and other objects, the
number (or location) of the files is immaterial.
The database files are fixed in size and never grow bigger than the size at
which they were created
Control Files
The control files and redo logs support the rest of the architecture. Any
database must have at least one control file, although you typically have more than
one to guard against loss. The control file records the name of the database, the date
and time it was created, the location of the database and redo logs, and the
synchronization information to ensure that all three sets of files are always in step.
Every time you add a new database or redo log file to the database, the information
is recorded in the control files.
Redo Logs
Any database must have at least two redo logs. These are the journals for
the database; the redo logs record all changes to the user objects or system objects.
If any type of failure occurs, the changes recorded in the redo logs can be used to
bring the database to a consistent state without losing any committed transactions.
In the case of non-data loss failure, Oracle can apply the information in the redo
logs automatically without intervention from the DBA.
The redo log files are fixed in size and never grow dynamically from the
size at which they were created.
82.
What is ROWID?
The ROWID is a unique database-wide physical address for every row on
every table. Once assigned (when the row is first inserted into the database), it
never changes until the row is deleted or the table is dropped.
The ROWID consists of the following three components, the combination
of which uniquely identifies the physical storage location of the row.
Oracle database file number, which contains the block with the rows
Oracle block address, which contains the row
The row within the block (because each block can hold many rows)
The ROWID is used internally in indexes as a quick means of retrieving
rows with a particular key value. Application developers also use it in SQL
statements as a quick way to access a row once they know the ROWID
83.
What is Oracle Block? Can two Oracle Blocks have the same address?
Oracle "formats" the database files into a number of Oracle blocks when
they are first createdmaking it easier for the RDBMS software to manage the
files and easier to read data into the memory areas.
The block size should be a multiple of the operating system block size.
Regardless of the block size, the entire block is not available for holding data;
Oracle takes up some space to manage the contents of the block. This block header
has a minimum size, but it can grow.
These Oracle blocks are the smallest unit of storage. Increasing the Oracle
block size can improve performance, but it should be done only when the database
is first created.
Each Oracle block is numbered sequentially for each database file starting
at 1. Two blocks can have the same block address if they are in different database
files.
84.
85.
Name two utilities that Oracle provides, which are use for backup and recovery.
Along with the RDBMS software, Oracle provides two utilities that you can
use to back up and restore the database. These utilities are Export and Import.
The Export utility dumps the definitions and data for the specified part of
the database to an operating system binary file. The Import utility reads the file
produced by an export, recreates the definitions of objects, and inserts the data.
If Export and Import are used as a means of backing up and recovering the
database, all the changes made to the database cannot be recovered since the export
was performed. The best you can do is recover the database to the time when the
export was last performed.
86.
What are stored-procedures? And what are the advantages of using them.
Stored procedures are database objects that perform a user defined
operation. A stored procedure can have a set of compound SQL statements. A
stored procedure executes the SQL commands and returns the result to the client.
Stored procedures are used to reduce network traffic.
87.
the block in which the handler was defined. If there are no more executable
statements in the block, control returns to the caller.
User-Defined Exceptions
PL/SQL enables the user to define exception handlers in the declarations
area of subprogram specifications. User accomplishes this by naming an exception
as in the following example:
ot_failure EXCEPTION;
In this case, the exception name is ot_failure. Code associated with this
handler is written in the EXCEPTION specification area as follows:
EXCEPTION
when OT_FAILURE then
out_status_code := g_out_status_code;
out_msg
:= g_out_msg;
88.
89.
b)
c)
d)
Answer:
(b) Are always in 1NF
90.
c) i & iii
d) ii & iii
Answer:
i & iii
Explanation:
Theta joins are joins made on keys that are not primary keys.
91.
AC -> C
C -> B
is in 1NF
b) is in 2NF
c) is in 3NF
d) is in BCNF
Answer:
( is in 1NF since (AC)+ = { A, B, C} hence AC is the primary key. Since C
B is a FD given, where neither C is a Key nor B is a prime attribute, this it is not in
3NF. Further B is not functionally dependent on key AC thus it is not in 2NF. Thus
the given FDs is in 1NF.
92.
93.
94.
95.
96.
97.
98.
99.
If a cold backup is performed, the only option available in the event of data
file loss is restoring all the files from the latest backup. All work performed on the
database since the last backup is lost.
Hot Backup:
Some sites (such as worldwide airline reservations systems) cannot shut
down the database while making a backup copy of the files. The cold backup is not
an available option.
So different means of backing up database must be used the hot backup.
Issue a SQL command to indicate to Oracle, on a tablespace-by-tablespace basis,
that the files of the tablespace are to backed up. The users can continue to make full
use of the files, including making changes to the data. Once the user has indicated
that he/she wants to back up the tablespace files, he/she can use the operating
system to copy those files to the desired backup destination.
The database must be running in ARCHIVELOG mode for the hot backup
option.
If a data loss failure does occur, the lost database files can be restored using
the hot backup and the online and offline redo logs created since the backup was
done. The database is restored to the most consistent state without any loss of
committed transactions.
103.What are Armstrong rules? How do we say that they are complete and/or sound
The well-known inference rules for FDs
Reflexive rule :
Y.
Augmentation rule:
If X
Y then XZ
YZ.
Transitive rule:
If {X
Y, Y
Z} then X
Z.
Decomposition rule :
If X
YZ then X
Y.
Y, X
Z} then X
YZ.
Y, WY
Z} then WX
Z.
Of these the first three are known as Amstrong Rules. They are sound
because it is enough if a set of FDs satisfy these three. They are called complete
because using these three rules we can generate the rest all inference rules.
Set X+ = X
2.
Set Old X+ = X+
3.
For each FD Y
X+
4.
b.
If (K + = R then set K = (K +
The updates that are applied to database after it becomes effective in real
world .
Simulatneous Update:
The updates that are applied to database at the same time when it becomes
effective in real world .
1.
2.
3.
4.
Method
Provides response to a message.
to each other.
A message is sent to invoke a method.
It is an implementation of an
operation.
5.
6.
A class that has no functionality of its own. Its member functions hide the
use of a third party software component or an object with the non-compatible
interface or a non- object- oriented implementation.
7.
8.
9.
10.
11.
12.
13.
Hence the layout of the handle is typically stable, even when the representation
changes and also that handles are small enough to move around relatively freely so
that the user neednt use the pointers and the references.
14.
File& f;
public:
int do_it(int){
return fwrite( ).suceed( );
}
};
class error_message: public Action{
response_box db(message.cstr( ),"Continue","Cancel","Retry");
switch (db.getresponse( )) {
case 0: return 0;
case 1: abort();
case 2: current_operation.redo( );return 1;
}
};
A user of the Action class will be completely isolated from any knowledge
of derived classes such as write_file and error_message.
15.
the different parts. Classes that are made only for the purpose of sharing code in
derived classes are called seed classes.
16.
What is an accessor?
An accessor is a class operation that does not modify the state of an object.
The accessor functions need to be declared as const operations
17.
What is an inspector?
Messages that return the value of an attribute are called inspector.
18.
What is a modifier?
A modifier, also called a modifying function is a member function that
changes the value of at least one data member. In other words, an operation that
modifies the state of an object. Modifiers are also known as mutators.
19.
What is a predicate?
A predicate is a function that returns a bool value.
20.
What is a facilitator?
A facilitator causes an object to perform some action or service.
21.
22.
23.
What is slicing?
Slicing means that the data added by a subclass are discarded when an
object of the subclass is passed or returned by value or from a function expecting a
base class object.
Consider the following class declaration:
class base{
...
base& operator =(const base&);
base (const base&);
}
void fun( ){
base e=m;
e=m;
}
As base copy functions don't know anything about the derived only the base
part of the derived is copied. This is commonly referred to as slicing. One reason to
pass objects of classes in a hierarchy is to avoid slicing. Other reasons are to
preserve polymorphic behavior and to gain efficiency.
24.
25.
For example, the interface invariants of stack class say nothing about
pushing yet another element on a stack that is already full. We say that isful() is a
precondition of the push operation.
Post-condition:
A post-condition is a condition that must be true on exit from a member function if
the precondition was valid on entry to that function. A class is implemented
correctly if post-conditions are never false.
For example, after pushing an element on the stack, we know that isempty()
must necessarily hold. This is a post-condition of the push operation.
26.
27.
What are the conditions that have to be met for a condition to be an invariant of the
class?
The condition should hold at the end of every constructor.
The condition should hold at the end of every mutator(non-const)
operation.
28.
and
sends
back
the
return
value
// fine
to
the
object.
Here data[3] yields an Array1D object and the operator [] invocation on that
object yields the float in position(3,6) of the original two dimensional array. Clients
of the Array2D class need not be aware of the presence of the Array1D class.
Objects of this latter class stand for one-dimensional array objects that,
conceptually, do not exist for clients of Array2D. Such clients program as if they
were using real, live, two-dimensional arrays. Each Array1D object stands for a
one-dimensional array that is absent from a conceptual model used by the clients of
Array2D. In the above example, Array1D is a proxy class. Its instances stand for
one-dimensional arrays that, conceptually, do not exist.
29.
What is cloning?
An object can carry out copying in two ways i.e. it can set itself to be a copy
of another object, or it can return a copy of itself. The latter process is called
cloning.
30.
1.
2.
3.
4.
5.
6.
Client
(Active object)
7.
Message
Server
( Passive
8.
9.
Static modeling is used to specify structure of the objects that exist in the
problem domain. These are expressed using class, object and USECASE diagrams.
But Dynamic modeling refers representing the object interactions during
runtime. It is represented by sequence, activity, collaboration and statechart
diagrams.
10.
Class A
Class B
Aggregation: Its' the relationship between two classes which are related
in the fashion that master and slave. The master takes full rights than
the slave. Since the slave works under the master. It is represented as
line with diamond in the master area.
Example:
car contains wheels, etc.
Car
Wheels
Class B
Class A
which
culminates
the
properties
of
the
other
three
(i.e.
Booch,Rumbaugh,Jacobson).
G.Booch
Methodology
Rumbaughs
Methodology
Jacobsons
Methodology
UML
classes. Any change in the independent class will affect the states of
the dependent class.
Diagram:
Dependent Class
11.
Independent Class
12.
add/subtract some properties in the part (slave) side. It won't affect the whole part.
Best example is Car, which contains the wheels and some extra parts. Even though
the parts are not there we can call it as car.
But, in the case of containment the whole part is affected when the part
within that got affected. The human body is an apt example for this relationship.
When the whole body dies the parts (heart etc) are died.
13.
Abhilash
Link:
Student
Association:
14.
MCA.:Course
Course
15.
16.
Whether unified method and unified modeling language are same or different?
Unified method is convergence of the Rumbaugh and Booch. Unified
modeling lang. is the fusion of Rumbaugh, Booch and Jacobson as well as Betrand
Meyer (whose contribution is "sequence diagram"). Its' the superset of all the
methodologies.
17.
Who were the three famous amigos and what was their contribution to the object
community?
The Three amigos namely,
James Rumbaugh (OMT): A veteran in analysis who came up with an
idea about the
Associations).
Grady Booch: A veteran in design who came up with an idea about
17.
OMT
ClassName
+Public Attribute;
#protected Attribute;
-private Attribute;
+Public Method();
#Protected Method();
-private Method();
UML.
ClassName
<<actor>>
+Public Attribute;
#protected Attribute;
-private Attribute;
classattribute;
+Public Method();
#Protected Method();
-private Method();
classmethod();
Booch:
In this method classes are represented as "Clouds" which are not very easy
to draw as for as the developer's view is concern.
Representation:
Classs Name
PublicAttribute;
| Protected
18.
19.
Who is an Actor?
An Actor is someone or something that must interact with the system.In
addition to that an Actor initiates the process (that is USECASE).
It is represesnted as a stickman like this.
Representation:
20.
ATM
Customer
Check for
validation
here the object on the customer acccess the ATM facility only when the guard
condition is met.
21.
Student
Course
Student
Course
I:
II:
22.
Calculate
<<refinement>
>
23.
Suppose a class acts an Actor in the problem domain,how can i represent it in the
static model?
In this senario you can use stereotype.since stereotype is just a string
that gives extra semantic to the particular entity/model element.
It is given with in the << >>.
Class
<< Actor>>
Attributes
MemberFunctio
ns
24.
class person
{
public:
char getsex();
void setsex(char);
void setsex(int);
};
In this example we can see that there is a function setsex() with same name
but with different signature.
Operating Systems
1.
ii.)
The local data for each user process must be stored separately.
Thus, the permanent part is the code, and the temporary part is the pointer
back to the calling program and local variables used by that program. Each
execution instance is called activation. It executes the code in the permanent part,
but has its own copy of local variables/parameters. The temporary part associated
with each activation is the activation record. Generally, the activation record is kept
on the stack.
Note: A reentrant procedure can be interrupted and called by an interrupting
program, and still execute correctly on returning to the procedure.
2.
3.
4.
What is thrashing?
It is a phenomenon in virtual memory schemes, when the processor spends
most of its time swapping pages, rather than executing instructions. This is due to
an inordinate number of page faults.
5.
d) Circular Wait: A closed chain of processes exist such that each process
holds at least one resource needed by another process in the chain.
6.
7.
8.
a)User data: Modifiable part of user space. May include program data, user
stack area, and programs that may be modified.
b) User program: The instructions to be executed.
c) System Stack: Each process has one or more LIFO stacks associated with
it. Used to store parameters and calling addresses for procedure and system calls.
d) Process Control Block (PCB): Info needed by the OS to control
processes.
9.
10.
11.
The set of dispatchable processes is in a safe state if there exist at least one
temporal order in which all processes can be run to completion without resulting in
a deadlock.
12.
13.
14.
4. Resource Reuse
15.
16.
17.
18.
19.
20.
Define latency, transfer and seek time with respect to disk I/O.
Seek time is the time required to move the disk arm to the required track.
Rotational delay or latency is the time to move the required sector to the disk head.
Sums of seek time (if any) and the latency is the access time, for accessing a
particular track in a particular sector. Time taken to actually transfer a span of data
is transfer time.
21.
Free memory is maintained in linked lists, each of equal sized blocks. Any
such block is of size 2^k. When some memory is required by a process, the block
size of next higher order is chosen, and broken into two. Note that the two such
pieces differ in address only in their kth bit. Such pieces are called buddies. When
any used block is freed, the OS checks to see if its buddy is also free. If so, it is
rejoined, and put into the original free-block linked-list.
22.
or if Ti = Tj and i < j.
23.How are the wait/signal operations for monitor different from those for semaphores?
If a process in the monitor signals and no task is waiting on the condition
variable, the signal is lost. So this allows easier program design. Whereas in
semaphores, every operation affects the value of the semaphore, so the wait and
signal operations should be perfectly balanced in the program.
24.
algorithms?
Placement algorithms determine where in the available main-memory to
load the incoming process. Common methods are first-fit, next-fit, and best-fit.
Replacement algorithms are used when memory is full, and one process (or part of
a process) needs to be swapped out to accommodate the new incoming process. The
replacement algorithm determines which are the partitions (memory portions
occupied by the processes) to be swapped out.
25.
26.
With demand paging, a page is brought into the main-memory only when a
location on that page is actually referenced during execution. With prepaging,
pages other than the one demanded by a page fault are brought in. The selection of
such pages is done based on common access patterns, especially for secondary
memory devices.
27.
What is mounting?
Mounting is the mechanism by which two different file systems can be
combined together. This is one of the services provided by the operating system,
which allows the user to work with two different file systems, and some of the
secondary devices.
28.
29.
What is multi-processing?
The ability of an operating system to use more than one CPU in a single
computer system. Symmetrical multiprocessing refers to the OS's ability to assign
tasks dynamically to the next available processor, whereas asymmetrical
multiprocessing requires that the original program designer choose the processor to
use for a given task at the time of writing the program.
30.
What is multitasking?
Multitasking is a logical extension of multi-programming. This refers to the
simultaneous execution of more than one program, by switching between them, in a
single computer system.
31.
Define multithreading?
The concurrent processing of several tasks or threads inside the same
program or process. Because several tasks can be processed parallely and no tasks
have to wait for the another to finish its execution.
32.
Define compaction.
Compaction refers to the mechanism of shuffling the memory portions such
that all the free portions of the memory can be aligned (or merged) together in a
single large block. OS to overcome the problem of fragmentation, either internal or
external, performs this mechanism, frequently. Compaction is possible only if
relocation is dynamic and done at run-time, and if relocation is static and done at
assembly or load-time compaction is not possible.
33.
34.
What is a Kernel?
Kernel is the nucleus or core of the operating system. This represents small
part of the code, which is thought to be the entire operating system, it is most
intensively used. Generally, the kernel is maintained permanently in main memory,
and other portions of the OS are moved to and from the secondary storage (mostly
hard disk).
35.
36.
It is faster to switch between threads. It will be faster since the memorymapping does not have to be setup and the memory and address translation
caches do not have to be violated.
Threads are efficient as they share memory. They do not have to use system
calls (which are slower because of context switches) to communicate.
37.
38.
39.
40.
41.
42.
43.
What are the four layers that Windows NT have in order to achieve independence?
Hardware abstraction layer
Kernel
Subsystems
System Services.
44.
What is SMP?
To achieve maximum efficiency and reliability a mode of operation known
as symmetric multiprocessing is used. In essence, with SMP any process or threads
can be assigned to any processor.
45.
What are the key object oriented concepts used by Windows NT?
Encapsulation
Object class and instance
46.
47.
48.
49.
50.
51.
swapping
interactive user request
timing
parent process request
52.
53.
What is mutant?
In Windows NT a mutant provides kernel mode or user mode mutual
exclusion with the notion of ownership.
54.
55.
What is FtDisk?
It is a fault tolerance disk driver for Windows NT.
56.
Waiting
Transition
Terminated.
57.
58.
59.
60.
What are DDks? Name an operating system that includes this feature.
DDks are device driver kits, which are equivalent to SDKs for writing
device drivers. Windows NT includes DDks.
61.
UNIX Concepts
1.
2.
What is an 'inode'?
All UNIX files have its description stored in a structure called 'inode'. The
inode contains info about the file-size, its location, time of last access, time of last
modification, permission and so on. Directories are also represented as files and
have an associated inode. In addition to descriptions about the file, the inode
contains pointers to the data blocks of the file. If the file is large, inode has indirect
pointer to a block of pointers to additional data blocks (this further aggregates for
larger files). A block is typically 8k.
Inode consists of the following fields:
File owner identifier
File type
File access permissions
File access times
Number of links
File size
Location of the file data
3.
4.
and inodes. A directory is a special file that the kernel maintains. Only kernel
modifies directories, but processes can read directories. The contents of a directory
are a list of filename and inode number pairs. When new directories are created,
kernel makes two entries named '.' (refers to the directory itself) and '..' (refers to
parent directory).
The system call for creating a new directory is mkdir (pathname, mode).
5.
6.
- open file
- create file
- close an open file
dup2(oldfd,newfd)
fcntl(filedes,cmd,arg)
7.
8.
9.
Link
ln filename1 filename2
Symbolic link
ln -s filename1 filename2
What is a FIFO?
FIFO are otherwise called as 'named pipes'. FIFO (first-in-first-out) is a
special file that is said to be data transient. Once data is read from named pipe, it
cannot be read again. Also, data can be read only in the order written. It is used in
interprocess communication where a process writes to one end of the pipe
(producer) and the other reads from the other end (consumer).
10.
How do you create special files like named pipes and device files?
The system call mknod creates special files in the following sequence:
1. kernel assigns new inode,
2. sets the file type to indicate that the file is a pipe, directory or special
file,
3. If it is a device file, it makes the other entries like major, minor device
numbers.
For example: If the device is a disk, major device number refers to the disk
controller and minor device number refers the disk.
11.
12.
13.
Assuming the block size to be 1KB calculate the maximum size of a file in the Unix
file system.
The first 10 data block pointers can point to 10 data blocks each of size 1
KB .
The 11 th pointer points to a table of block pointers the table has 256
pointers each pointing to data block of size 1 KB. Similarly the 12 th pointer can
address
(256 X 256KB) i.e. 64 MB and the 13 th pointer (256 X 64 MB) => 16 GB.
Hence the maximum size of the file is 10 KB + 256 KB + 64 MB + 16 GB.
14. What are the uses of these disk related commands: df, dfspace, du and ulimit?
$ df
$ dfspace
$ du
$ ulimit
Section II
Process Management
1.
Brief about the initial process sequence while the system boots up.
While booting, special process called the 'swapper' or 'scheduler' is created
with the Process-ID 0. The swapper manages memory allocation for processes and
influences CPU allocation. The swapper inturn creates 3 children:
the process dispatcher,
vhand and
dbflush
with IDs 1,2 and 3 respectively.
This is done by executing the file /etc/init. Process dispatcher gives birth to
the shell. Unix keeps track of all the processes in an internal data structure called
the Process Table (listing command is ps -el).
2.
user is 'UserID'. Process also has 'Effective User ID' that determines the access
privileges for accessing resources like files. The system calls used for getting the
various IDs are:
3.
getpid()
- process id
getppid()
- parent process id
getuid()
- user id
geteuid()
- effective user id
4.
5.
system. Each process has process context, which is everything that is unique about
the state of the program you are currently running. Every time you execute a
program the UNIX system does a fork, which performs a series of operations to
create a process context and then execute your program in that context. The steps
include the following:
Allocate a slot in the process table, a list of currently running programs
kept by UNIX.
Assign a unique process identifier (PID) to the process.
iCopy the context of the parent, the process that requested the spawning
of the new process.
Return the new PID to the parent process. This enables the parent
process to examine or control the process directly.
After the fork is complete, UNIX runs your program.
6.
7.
8.
9.
10.
11.
Description
fork()
exec()
wait()
exit()
getpid()
getppid()
nice()
brk()
12.
13.
Explanation:
The fork creates a child that is a duplicate of the parent process. The child
begins from the fork().All the statements after the call to fork() will be executed
twice.(once by the parent process and other by child). The statement before fork() is
executed only by the parent process.
14.
15.
16.
but also have some special ways to communicate that take advantage of their
relationship as a parent and child. One of the most obvious is that the parent can get
the exit status of the child.
17.
18.
19.
20.
For some reason, the process with PID 6173 could not be terminated with the
command $ kill 6173. What could be the reason and how can you terminate that
process?
The kill command when invoked sends a termination signal to the process
being killed. Since the signal number is not specified unix assumes the default
signal number which cannot kill certain high priority processes.
In such cases we can use the signal number 9 $ kill 9 6173.
19.
What is a shell?
A shell is an interactive user interface to services of an operating system,
that allows an user to enter commands as character strings or through a graphical
user interface. The shell converts them to system calls to the OS or forks off a
process to execute the command. Results of the system calls and other information
from the OS are presented to the user through an interactive interface. Commonly
used shells are sh,csh,ks etc.
21.
22.
23.
24.
25.
Section - III
Memory Management
1.
Only the required memory pages are moved to main memory from the swap
device for execution. Process size does not matter. Gives the concept of the virtual
memory.
It provides greater flexibility in mapping the virtual address space into the
physical memory of the machine. Allows more number of processes to fit in the
main memory simultaneously. Allows the greater process size than the available
physical memory. Demand paging systems handle the memory more flexibly.
2.
What is the major difference between the Historic Unix and the new BSD release of
Unix System V in terms of Memory Management?
Historic Unix uses Swapping entire process is transferred to the main
memory from the swap device, whereas the Unix System V uses Demand Paging
only the part of the process is moved to the main memory. Historic Unix uses one
Swap Device and Unix System V allow multiple Swap Devices.
3.
4.
What is a Map?
A Map is an Array, which contains the addresses of the free space in the
swap device that are allocatable resources, and the number of the resource units
available there.
Address
Units
10,000
5.
What is a Region?
A Region is a continuous area of a processs address space (such as text,
data and stack). The kernel in a Region Table that is local to the process maintains
region. Regions are sharable among the process.
6.
What are the events done by the Kernel after a process is being swapped out from
the main memory?
When Kernel swaps the process out of the primary memory, it performs the
following:
Kernel decrements the Reference Count of each region of the process. If the
reference count becomes zero, swaps the region out of the main memory,
Kernel allocates the space for the swapping process in the swap device,
Kernel locks the other swapping process while the current swapping operation
is going on,
The Kernel saves the swap address of the region in the region table.
7.
Is the Process before and after the swap are the same? Give reason.
Process before swapping is residing in the primary memory in its original
form. The regions (text, data and stack) may not be occupied fully by the process,
there may be few empty slots in any of the regions and while swapping Kernel do
not bother about the empty slots while swapping the process out.
After swapping the process resides in the swap (secondary memory) device.
The regions swapped out will be present but only the occupied region slots but not
the empty slots that were present before assigning.
While swapping the process once again into the main memory, the Kernel
referring to the Process Memory Map, it assigns the main memory accordingly
taking care of the empty slots in the regions.
8.
9.
What are the entities that are swapped out of the main memory while swapping the
process out of the main memory?
All memory space occupied by the process, processs u-area, and Kernel
stack are swapped out, theoretically.
Practically, if the processs u-area contains the Address Translation Tables
for the process then Kernel implementations do not swap the u-area.
10.
11.
12.
13.
What are the processes that are not bothered by the swapper? Give Reason.
Zombie process: They do not take up any physical memory.
Processes locked in memories that are updating the region of the process.
Kernel swaps only the sleeping processes rather than the ready-to-run
processes, as they have the higher probability of being scheduled than the
sleeping processes.
14.
15.
What are the criteria for choosing a process for swapping into memory from the
swap device?
The resident time of the processes in the swap device, the priority of the
processes and the amount of time the processes had been swapped out.
16.
What are the criteria for choosing a process for swapping out of the memory to the
swap device?
The processs memory resident time,
Priority of the process and
The nice value.
17.
18.
What are conditions on which deadlock can occur while swapping the processes?
All processes in the main memory are asleep.
All ready-to-run processes are swapped out.
There is no space in the swap device for the new incoming process that are
swapped out of the main memory.
There is no space in the main memory for the new incoming process.
19.
20.
21.
22.
23.
set. And on a page fault, the kernel updates the working set by reading the page
from the secondary device.
24.
What are data structures that are used for Demand Paging?
Kernel contains 4 data structures for Demand paging. They are,
Page table entries,
Disk block descriptors,
Page frame data table (pfdat),
Swap-use table.
26.
What are the bits(UNIX System V) that support the demand paging?
Valid, Reference, Modify, Copy on write, Age. These bits are the part of the
page table entry, which includes physical address of the page and protection bits.
Page address
27.
Modify Reference
Valid Protection
vfork() system call executes exec() system call. The child process from vfork()
system call executes in the parents address space (this can overwrite the parents
data and stack ) which suspends the parent process until the child process exits.
28.
29.
30.
31.
33.
34.
35.
Protection fault refers to the process accessing the pages, which do not have
the access permission. A process also incur the protection fault when it attempts to
write a page whose copy on write bit (UNIX System V) was set during the fork()
system call.
36.
In what way the Fault Handlers and the Interrupt handlers are different?
Fault handlers are also an interrupt handler with an exception that the
interrupt handlers cannot sleep. Fault handlers sleep in the context of the process
that caused the memory fault. The fault refers to the running process and no
arbitrary processes are put to sleep.
37.
What does the swapping system do if it identifies the illegal page for swapping?
If the disk block descriptor does not contain any record of the faulted page,
then this causes the attempted memory reference is invalid and the kernel sends a
Segmentation violation signal to the offending process. This happens when the
swapping system identifies any invalid memory reference.
38.
What are states that the page can be in, after causing a page fault?
On a swap device and not in memory,
On the free page list in the main memory,
In an executable file,
Marked demand zero,
Marked demand fill.
39.
40.
41.
How the Kernel handles the copy on write bit of a page, when the bit is set?
In situations like, where the copy on write bit (UNIX System V) of a page is
set and that page is shared by more than one process, the Kernel allocates new page
and copies the content to the new page and the other processes retain their
references to the old page. After copying the Kernel updates the page table entry
with the new page number. Then Kernel decrements the reference count of the old
pfdata table entry.
In cases like, where the copy on write bit is set and no processes are sharing
the page, the Kernel allows the physical page to be reused by the processes. By
doing so, it clears the copy on write bit and disassociates the page from its disk
copy (if one exists), because other process may share the disk copy. Then it
removes the pfdata table entry from the page-queue as the new copy of the virtual
page is not on the swap device. It decrements the swap-use count for the page and if
count drops to 0, frees the swap space.
42.
43.
44.
How the Kernel handles both the page stealer and the fault handler?
The page stealer and the fault handler thrash pages because of the shortage
of memory. If the sum of the working sets of all processes is greater that the
physical memory then the fault handler will usually sleep because it cannot allocate
pages for a process. This results in the reduction of the system throughput because
Kernel spends too much time in overhead, rearranging the memory in a fast pace.
Computer Networks
1.
2.
3.
(ii) point-to-point
4.
5.
6.
7.
8.
9.
Advantages:
Inexpensive, easy to install, simple to understand, easy to extend.
STAR topology:
In this all computers are connected using a central hub.
Advantages:
Can be inexpensive, easy to install and reconfigure and easy to trouble
shoot physical problems.
RING topology:
In this all computers are connected in loop.
Advantages:
All computers have equal access to network media, installation can be
simple, and signal does not degrade as much as in other topologies because each
computer regenerates it.
10.
11.
12.
13.
A gateway operates at the upper levels of the OSI model and translates
information between two completely different network architectures or data
formats.
14.
What is Brouter?
Hybrid devices that combine the features of both bridges and routers.
15.
What is subnet?
A generic term for section of a large networks usually separated by a bridge
or router.
16.
What is SAP?
Series of interface points that allow other computers to communicate with
the other layers of network protocol stack.
17.
18.
Frame relay is a packet switching technology. It will operate in the data link
layer.
19.
20.
What is Beaconing?
The process that allows a network to self-repair networks problems. The
stations on the network notify the other stations on the ring when they are not
receiving the transmissions. Beaconing is used in Token ring and FDDI networks.
21.
What is redirector?
Redirector is software that intercepts file or prints I/O requests and
translates them into network requests. This comes under presentation layer.
22.
23.
What is RAID?
A method for providing fault tolerance by using multiple hard disk drives.
24.
What is cladding?
A layer of a glass surrounding the center fiber of glass inside a fiber-optic
cable.
25.
What is attenuation?
The degeneration of a signal over distance on a network cable is called
attenuation.
26.
27.
28.
What is Bandwidth?
Every line has an upper limit and a lower limit on the frequency of signals
it can carry. This limited range is called the bandwidth.
29.
30.
What are the data units at different layers of the TCP / IP protocol suite?
The data unit created at the application layer is called a message, at the
transport layer the data unit created is called either a segment or an user datagram,
at the network layer the data unit created is called the datagram, at the data link
layer the datagram is encapsulated in to a frame and finally transmitted as signals
along the transmission media.
31.
What is ICMP?
ICMP is Internet Control Message Protocol, a network layer protocol of the
TCP/IP suite used by hosts and gateways to send notification of datagram problems
back to the sender. It uses the echo test / reply to test whether a destination is
reachable and responding. It also handles both control and error messages.
32.
33.
What is the minimum and maximum length of the header in the TCP segment and
IP datagram?
The header should have a minimum length of 20 bytes and can have a
maximum length of 60 bytes.
34.
0.0.0.0
127.255.255.255
Class B
128.0.0.0
191.255.255.255
Class C
192.0.0.0
223.255.255.255
Class D
224.0.0.0
239.255.255.255
Class E240.0.0.0
35.
247.255.255.255
What is the difference between TFTP and FTP application layer protocols?
The Trivial File Transfer Protocol (TFTP) allows a local host to obtain files
from a remote host but does not provide reliability or security. It uses the
fundamental packet delivery services offered by UDP.
The File Transfer Protocol (FTP) is the standard mechanism provided by
TCP / IP for copying a file from one host to another. It uses the services offered by
TCP and so is reliable and secure. It establishes two connections (virtual circuits)
between the hosts, one for data transfer and another for control information.
36.
37.
What MAU?
In token Ring , hub is called Multistation Access Unit(MAU).
38.
39.
40.
41.
42.
43.
44.
45.
46.
What is region?
When hierarchical routing is used, the routers are divided into what we call
regions, with each router knowing all the details about how to route packets to
destinations within its own region, but knowing nothing about the internal structure
of other regions.
47.
48.
49.
51.
52.
53.
54.
55.
56.
57.
58.
59.
What is Kerberos?
It is an authentication service developed at the Massachusetts Institute of
Technology. Kerberos uses encryption to prevent intruders from discovering
passwords and gaining unauthorized access to files.
60.
What is OSPF?
It is an Internet routing protocol that scales well, can route traffic along
multiple paths, and uses knowledge of an Internet's topology to make accurate
routing decisions.
61.
62.
63.
64.
65.
66.
What are the advantages and disadvantages of the three types of routing tables?
The three types of routing tables are fixed, dynamic, and fixed central. The
fixed table must be manually modified every time there is a change. A dynamic
table changes its information based on network traffic, reducing the amount of
manual maintenance. A fixed central table lets a manager modify only one table,
which is then read by other devices. The fixed central table reduces the need to
update each machine's table, as with the fixed table. Usually a dynamic table causes
the fewest problems for a network administrator, although the table's contents can
change
67.
without
the
administrator
being
aware
of
the
change.
68.
69.
70.
71.
BOOTP helps a diskless workstation boot. How does it get a message to the
network looking for its IP address and the location of its operating system boot files?
BOOTP sends a UDP message with a subnetwork broadcast address and
waits for a reply from a server that gives it the IP address. The same message might
contain the name of the machine that has the boot files on it. If the boot image
location is not specified, the workstation sends another UDP message to query the
server.
72.
73.
74.
75.
What is REX? What advantage does REX offer other similar utilities?
The Remote Execution Service (REX) is designed to enable users to run
commands on other machines without logging in and without the overhead of larger
utilities like Telnet. Because REX preserves the full shell environment, it is better
than other remote procedures.
76.
77.
78.
79.
80.
What is the difference between an unspecified passive open and a fully specified
passive open?
An unspecified passive open has the server waiting for a connection request
from a client. A fully specified passive open has the server waiting for a connection
from a specific client.
81.
Burst ModeA transmission mode where data is transmitted in bursts rather than in
continuous streams.
ContentionA condition occurring in some LANs where the Media Access Control
(MAC) sublayer allows more than one node to transmit at the same time, risking
collisions.
EmulationA program that simulates another device. For example, a 3270 emulator
emulates an IBM 3270 terminal, sending the same codes as the real device would.
services
to
all
of
corporation's
sites.
Multi-homed
HostA
device
attached
to
two
or
more
networks.
PING (Packet Internet Gropher)A utility program used to test a system's TCP/IP
software by sending an ICMP echo request and then waiting for a response
Protocol Interpreter (PI)A process that carries out FTP functions. FTP uses one
Protocol Interpreter for the server and another one for the user.
ProxyA mechanism whereby one system functions for another when responding to
protocol requests.
Round Trip TimeThe time for a TCP segment to be sent and its acknowledgment
received.
Transmission Control Block (TCB)A data structure that holds information about
TCP and UDP connections.
Terminal ServerA network device that provides physical access for dumb terminals,
usually using an abbreviated TCP/IP protocol to enable a dumb terminal to remotely
log on.
82.
Client/Server
Computing
1.
What are the five major technologies that can be used to create Client/Server
applications?
Database Servers
TP Monitors
Groupware
Distributed Objects
Intranets.
2.
What is Client/Server?
Clients and Servers are separate logical entities that work together over a
network to accomplish a task. Many systems with very different architectures that
are connected together are also called Client/Server.
3.
Service
Shared resources
Asymmentrical protocols
Transparency of location
Mix-and-match
Message based exchanges
Encapsulation of services
Scalability
Integrity
Client/Server computing is the ultimate "Open platform". It gives the
freedom to mix-and-match components of almost any level. Clients and servers are
loosely coupled systems that interact through a message-passing mechanism.
4.
5.
6.
7.
8.
File servers
Database servers
Transaction servers
Groupware servers
Object servers
Web servers
9.
10.
11.
12.
13.
14.
With a transaction server, the client invokes remote procedures that reside
on the server with an SQL database engine. These remote procedures on the server
execute a group of SQL statements. The network exchange consists of a single
request/reply message. The SQL statements either all succeed or fail as a unit.
15.
16.
17.
If the bulk of the application runs on the Server side, then it is Fat servers. It
tries to minimize network interchanges by creating more abstract levels of services.
18.
19.
20.
21.
22.
What are the most typical functional units of the Client/Server applications?
User interface
Business Logic and
Shared data.
23.
24.
In 3-tier Client/Server systems, the application logic (or process) lives in the
middle tier and it is separated from the data and the user interface. In theory, the 3tier Client/Server systems are more scalable, robust and flexible.
Example:
25.
TP monitor, Web.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
GUI clients
OOUI clients
What are called Non-GUI clients, GUI Clients and OOUI Clients?
Non-GUI Client: These are applications, generate server requests with a
minimal amount of human interaction.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
What is OLTP?
In the transaction server, the client component usually includes GUI and the
server components usually consists of SQL transactions against a database. These
applications are called OLTP (Online Transaction Processing)
OLTP Applications typically,
Receive a fixed set of inputs from remote clients.
Perform multiple pre-compiled SQL comments against a local
database.
Commit the work and
Return a fixed set of results.
48.
What is a TP Monitor?
There is no commonly accepted definition for a TP monitor. According to
Jeri Edwards' a TP Monitor is "an OS for transaction processing".
TP Monitor does mainly two things extremely well. They are
Process management and
Transaction management
They were originally introduced to run classes of applications that could
service hundreds and sometimes thousands of clients. TP Monitors provide an OS on top of existing OS - that connects in real time these thousands of humans with a
pool of shared server processes.
49.
50.
51.
List out the benefits obtained by using the Client/Server oriented TP Monitors
Client/Server applications development framework
Firewalls of protection
High availability
Load balancing
MOM integration
Scalability of functions
Reduced system cost.
52.
Appendix-I
Disclaimer:
This list is not meant to be exhaustive, so some sections in the company question
papers may be missing. The pattern of questions asked may also change.
AZTEC
Writing C Programs
Questions on C++
Analytical Reasoning
BFL
Computer Awareness
Analytical Ability
CITICORP
Objective C Questions
Quantitative Aptitude
Analytical Reasoning
COSL
General English
Quantitative Aptitude
Psychometric Test
Analytical Reasoning
CTS
General English
Quantitative Aptitude (Permutations & Combinations)
Analytical Reasoning
D.E.SHAW
Objective C / Writing C Programs
Quantitative Aptitude
Analytical Reasoning
HCL-Systems
Computer Awareness (C, C++, Java, Operating systems, Networks)
Objective C questions
Programming Skills
Analytical Reasoning
HCL - Applications
Computer Awareness
Objective C questions
C++ / Java
Analytical reasoning
HONEY WELL
Computer Awareness
General English (Verbal Ability)
Quantitative Aptitude
Computer Awareness (Programming languages, Operating systems and Data
structures)
Logical and Analytical Reasoning
HUGHES
Objective C questions
Computer Awareness (Networks, C, Java, Data Structures and Operating Systems)
Quantitative Aptitude
Analytical Reasoning
I2 TECHNOLOGIES
Objective C questions
Writing C/C++ Program for the Given Problem
Analytical Reasoning
IBM-GLOBAL
C / UNIX / Windows
Analytical Reasoning
Quantitative Aptitude
INFOSYS
Computer Awareness(C, Computer Networks,Operating Systems)
Essay Writing
Solving Puzzles
Analytical Reasoning
LUCENT
Computer Awareness(Computer Networks, Operating Systems, C)
Questions on C Language
C++ / JAVA
Analytical Reasoning
MASCOT
Computer Fundamentals
Hardware/Software related questions and Algorithms
General Awareness
General Questions on Programming Languages
MOTOROLA
Quantitative Aptitude
Analytical Reasoning
NOVELL
Objective C questions
Operating System Concepts
Quantitative Aptitude
ORACLE
C and Data Structures
Writing C code
PL/SQL and RDBMS
OOPS / C++
Computer Networks
Software Engineering
PHILIPS
Electronics and Mathematics
General Computer Science
Quantitative Aptitude
RAMCO
General English
Objective C questions
Quantitative Aptitude
SEIMENS INFO
General awareness
C / UNIX / C++ / motif / DBMS / X-windows / Ms-windows
SISL
General Awareness
Data Structures
Unix / C / RDBMS / TCP/IP / OOPS / c++ / xWindows / MS Windows
SUN
C / Data Structures
OOPS / Java / C++ / Operating Systems / TCP/IP
TATA IBM
Objective C questions
TATA INFOTECH
Computer Basics and C
Quantitative Aptitude
Analytical and Verbal Reasoning
VERIFONE INDIA
C programming
Computer Networks / Database Management Systems / Compilers / Data
structures / Algorithms / Operating systems
Quantitative Aptitude
WILCO
Objective C questions
Quantitative Aptitude
WIPRO
System Software / Operating systems / C
Quantitative Aptitude
Analytical Reasoning
WIPRO INFOTECH
Objective C questions
Operating Systems / Compiler / Algorithm / Data structures
Analytical and Non-verbal Reasoning
Quantitative Aptitude
Appendix-II
Suggested Reading
(note: we are collecting the list of books for suggested reading; well provide it later)