1. An index is automatically generated with the following 
constraints. 
a. Check 
b. Not null 
c. Primary key 
d. Foreign key 
2. Select mod(16,3) from emp; 
a. 1 
b. 2 
c. 3 
d. Error in the stmt 
3. The data dictionary view to see the list of constraints enabled 
on a 
table is 
a. user_tables 
b. user_table_constraints 
c. user_constraints 
d. There is no dictionary view available for the same 
4. Identify the pseudocolumns 
a. rowid 
b. sysdate 
c. rowval 
d. dual 
5. select deptno, count(empno) from emp 
where count(empno)>=5 
group by deptno; 
identify the line no which contains the error 
a. 1 
b. 2 
c. 3 
d. 1,3 
6. choose the group function that can be used with any data type 
a. sum() 
b. min() 
c. avg() 
d. all 
7. which of the following sequence is true 
a. WHERE,HAVING,GROUPBY,ORDERBY 
b. GROUPBY, WHERE, HAVING, ORDERBY 
c. ORDERBY,GROUPBY,WHERE,HAVING 
d. NONE OF THE ABOVE 
8. which of the proper keyword to deallocate memory 
a. free 
b. delete 
c. clear 
d. remove 
9. what is the index no of the last element of an array with 29 
elements 
a. 29 
b. 28 
c. 0 
d. programmer defined 

10. what is the final value of x when the code for(int 
x=0;x<10;x++) is 
run? 
a. 10 
b. 9 
c. 0 
d. 1 
11. what is the data type of FILE? 
a. integer 
b. union 
c. pointer 
d. structure 
12. if "a" is an array of 5*5 dimension, a[2][4] is same as 
a. **(a+2+4) 
b. *(a+2) + *(a+4) 
c. **(a+2)+4 
d. *(*a+2)+4) 
13. what is the output of .. 
#include<stdio.h> 
void main() 
{ 
char buffer[10]={"Genesis"}; 
printf("%d",&buffer[4]-(buffer)); 
} 
a. 3 
b. 4 
c. 0 
d. illegal pointer subtraction 
14. what is the output for 
#include<stdio.h> 
main() 
{ 
static int a[]={5,10,15,20}; 
int * ptr=a; 
int ** ptr_ptr=&ptr; 
printf("\n %d",**ptr_ptr++); 
} 
a. 5 
b. 10 
c. 15 
d. 6 
15. what is the value of expr.. 
1+2/3*4+1 
a. 2 
b. 3 
c. 4 
d. 4.666666 
e. 5 
16. identify the relationship between the many employees 
working 
in a dept.. 
a. one to one 
b. one to many 
c. many to one 
d. many to many 
17.there was a table given and it was asked which normal form does 
it 
follows.. 
18. the process of including some controlled redundancy for 
the 
sake of performance 
is known as 
a. normalization 
b. Cartesian product 
c. Denormalization 
d. None 
19. in a doubley linked list 
a. the last node contains the address of the first node 
b. each node contains the address of previous and next node 
c. each node contains the address of previous node 
d. none 
20. in a queue each node contains 
a. the address of previous node 
b. address of next node 
c. address of both the previous and next node 
d. none of the above 


************************: oracle paper 
 

the test was of 1 hour 30 ques. g apti and 30 of 
technical.......some 
ques. of g apti were very lengthy so don't end up in solving 
them.....time was less......some 15 ques. from arithmetic......and 
rest 
15 
logical,statement interpretation,arrangement,tense 
correction......and 
like 
that...... 
i am enclosing here the 2 C questions : 
1. given a square matrix which consists only of 1 and 0......find 
which 
rows,which cols and which diagonals consist entirely of 1's. 
2. given an array of integers find all possible combinations of 
the 
numbers whose sum equal to 90..... 
ans : knapsack problem (in data structures - aho ullman) 
Note : for them solution was not the criteria.......but the 
approach 
was important......the solution should be generalised and 
optimized........optimization was given the top priority........ 
here is the techincal paper : 
plz try to solve them urself by trying on comp. 
1. const int MAX=10; 
main() 
{enum a {a,b,MAX}; 
print MAX; 
} 
2. enum object is a const which can only be assigned a value at 
initialization or a variable which can be assigned any value in 
the 
middle of 
the program? 
3. void *p; 
what operation cannot be performed on p? 
ans : arithmetic operation unless it is properly typecasted 
4. char **p="Hello"; 
print p,*p,**p 
5. main() 
{char str[]="Geneius"; 
print (str); 
} 
print(char *s) 
{if(*s) 
print(++s); 
printf("%c",*s); 
} 
6. what does the function fcloseall() does ? 
7. main() 
{printf("Genius %d",fun(123)); 
} 
fun(int n) 
{return (printf("%d",n)); 
} 
8. difference between definition and declaration. 
9. find the error? 
fun() 
{int i=10; 
if(i<10) 
return 2.0; 
else 
return 3.0; 
} 
10. int a=9,b=5,c=3,d; 
d=(b-c)<(c-a) ? a : b; 
print d 
11. 1+2/3*4+1=? 
12. In C++, a variable can be defined wherever needed whereas not 
in C 
13. main() 
{int i=4; 
fun(i=i/4); 
print i; 
} 
fun(int i) 
{return i/2; 
} 
14. what is an array ? 
15. printf("\" NITK %%SURAHKAL%% !\""); 
16. difference between scanf and gets in case of string input 
17. table t1 m rows and x cols 
table t2 n rows and y cols 
in t1*t2 rows? cols=? 
ans. m*n ,x+y 
18. symbol of realtionship between 2 entities? 
19. which one cannot come in data modelling 
a. customer b. student c. office d. speed 
20. can a database table exist without a primary key ? 
21. whether higher normal forms better than lower forms as far 
redundancy is concerned ? 
22. file is at which level 
ans. conceptual level 
23. what is a foreign key 
 

ORACLE 
====== 
Oracle at BIT...well i cleared the written but the interview was 
really rigourous...it was in 4 rounds....with streching upto 8 
hrs 
per candidate who was selelcted....Oracle took a total of 10 
people(9 BEs and 1 MCA) 

The oracle paper was difficult to remember... 

but i can give brief outline as to what could be studied...The 
Technical consisted of C,Pl/SQL and JAVA....go through Ivan 
Bayross for Pl/SQL and Pointers in C by Kanetkar....some of the 
qs 
were directly from there..... 

u may also do DBMS concepts.....as to what is Data 
Modelling,Transactions, Distributed Databases 

In my interview.....first we had a short test on C Programming 
where in i 
was given C programs to write on PREORDER Tree traversal and 
Conversion of 
Infix to Postfix expression...the interview followed where they 
grilled me 
on Java and C preprocessors from head to toe...but was unable to 
clear the 
second round of interview 


I think these questions will be useful for those who are going to 
attend the Oracle_Bangalore Interview. 

The questions asked to me in Oracle Interview are: 

1st interviewer(one hour 10 minutes) 
______________________________________ 

1. There is dual switch bulb,we have to write the truth table 
and also FSM for that dual switch bulb. 

2. Write a program to check whether the given comments are 
nested comments are or not(/*ajsd/*asdh*/asd*/ is nested comment 
but /*asd*/ /*kjasdh*/ is not a nested comment)-you can write program 
in any language... 

3.Check whether the trees are structurally similar or 
not....program using linked list 

4. What is virtual functions and some question on virtual 
functions.... 

5.What are the statemnets beging with # mean in C language 
and how they can be handled by macroprocessor and if it comes in the 
middle of program how it will be handled.. 

6.Write a program for finding the factorial of a given 
number.. 


2nd interviewer(one hour 20 minutes) 
_________________________________________ 

1. Write a program to find whether a linked list is circular 
or not 

2. Write a program to reverse a linked list... 

3.Write a program to find the mirror image of the given 
binary tree. 

4.Tell something about genetic algorithms and explain ur 
M.Tech project.... 

3rd interviewer(one hour 10 minutes) 
______________________________________ 

1. What is a process and a thread 

2.Write a algorithm for deletinga node in an binary search 
tree... 

3.What is inheritance,virtual function,singleton class and 
pure virtual function... 

4.Write a unix network program to implement the ftp 
protocol,, 

5. write a algorithm to find a loop ina linked lsit. 

6.he concentrated mainly in unix.. what is socket and what is 
binding and how is client server thing works..... 


4th interviewer(one hour ) 
_________________________________________ 

1. What are the various scheduling algorithms and explain 
the algorithms 

2. Write what will happen when you run a program that 
contains many functions... 
you have to tell what is stored in stack and what is 
stored in the heap and other steps how a program is executed... 

3. Write a program for quicksort and also merge sort 

4.What is the process control block and explain the structure 
with a diagram... 

5.Write a program to insert nodes in a linked list and print 
them and some modifications after writing the program to write 
functions for addnode.... 

6.he concentrated mainly in Operating systems...