Oracle




Oracle

Filed under:

Oracle Placement Question Paper

Technical Papers

1. const int MAX=10;
main()
{
enum a {a,b,MAX};
print MAX;
}
ans. 2

2. enum variable is a const variable which can only be assigned a value at initialization or a non const variable which can be assigned any value in the middle of the program?
ans. const variable

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
ans. Hello (null)
warning: suspicious pointer conversion

5. main()
{
char str[]="Geneius";
print (str);
}
print(char *s)
{
if(*s)
print(++s);
printf("%c",*s);
}
ans. suiene

6. what does the function fcloseall() does ?
ans. fcloseall() closes all open streams except stdin,stdout,stderr,stdprn and stdaux

7. main()
{
printf("Genius %d",fun(123));
}
fun(int n)
{
return (printf("%d",n));
}
ans. 123genius3

8. difference between definition and declaration. ans. definition once while declaration more than once

9. find the error?
main()
{
void fun();
fun();
}
void fun()
{
int i=10;
if(i<10)
return 2.0;
return 3.0;
}
ans. no error but warning

10. int a=9,b=5,c=3,d;
d=(b-c)<(c-a) ? a : b;
print d
ans 5

11. 1+2/3*4+1=? Ans. 2

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;
}
ans 1

14. what is an array ?
ans. contiguous collection of memory occupied by similar data types

15. printf(""NITK %%SURAHKAL%% !"");
ans. “NITK %SURATHKAL% !”

16. difference between scanf and gets in case of string input ans. scanf does not accepts white space while gets does

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 ans 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 ? ans. higher

22. file is at which level ans. conceptual level

23. what is a foreign key ans. primary key in some other table

Related Plament Papers and Companies

Covansys Placement Question Papers

Covansys Placement Question Papers covansys is recruiting heavily many people have been asking abt covansys first round pattern; You will be given a question booklet that contains many papers on different topics. Some are compulsorywhile some are optional (i.e. you can take this or that). All the papers are objective type. Aptitude will be your first section-aptitude will be quite easy (simple distance, time, numbers etc.) problems. You’ll probably also have one question like the GRE analytical section (i.e. you will be given a paragraph followed by a set of 4/5 questions based on that paragraph). This section is easy but

Flextronics(Hughes) Placement Question Papers

Flextronics(Hughes) Placement Question Papers 1. nice('val')? unix command 2. for(l=1;a< =l;a++) cout

DSRC Placement Question Papers

DSRC Placement Question Papers Information About test It is an online test..so u'l know results 10 mins aftr finishing t test..b4 u tak t test,they'l give a presntation abt DSRC...watch it carefully bcoz u've to write somthing abt t company at t end of t test..presntation goes on for 1/2 hour..test consists of 5 sections: Section 1: Complete the number sequence.. 25

Oracle

Oracle Placement Question Paper 1. How compiler treats variables of recursive functions 2. What is orthogonal matrix? 3. Given two tables and asked 2 qns on those table , 4. One is on join and another is on NOT IN 5. Given some qns on pointers( pretty easy) 6. Given five qns on data structures like , lifo, fifo 7. Qtn on primary key 8. How NULL in sql is treated? 9. Given a doubly linked list and asked r->left->right->data ans: r->data 10. Explain const char *ptr and char *const ptr 11. Remaining i didn`t remember

Flextronics(Hughes) Placement Question Papers

Flextronics(Hughes) Placement Question Papers Aptitude Questions 1. Age problem 2. Time and distance 3. Coin 4. direction problem 5. (2n + 2 n-1/2 n+1 – 2n) what is gives if n = something 6. ( 10n –1) n>1 when is divisible by 11.no divisible by 8 7. find the missing no. when it is divisible by some no 8. Boat problem 9. Average Technical Questions 10. Which one is called family tree 11. virtual function and overloading 12. DHCP protocol 13. order of insertion and Heap sort

  • Resources













  • Placement Papers Archives