Patni Placement Paper Technical 2009 @ Orissa
1. An index is automatically generated with the following constraints.
a. Check
b. Not null
c. Primary key
d. Foreign key
a. Check
b. Not null
c. Primary key
d. Foreign key
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
a. user_tables
b. user_table_constraints
c. user_constraints
d. There is no dictionary view available for the same
4. Identify the pseudo columns
a. row id
b. sys date
c. row val
d. dual
a. row id
b. sys date
c. row val
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
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
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
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
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
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
a. 10
b. 9
c. 0
d. 1
11. What is the data type of FILE?
a. integer
b. union
c. pointer
d. structure
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)
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
#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
#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
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
a. one to one
b. one to many
c. many to one
d. many to many
18. The process of including some controlled redundancy for the sake of performance is known as
a. normalization
b. Cartesian product
c. De normalization
d. None
a. normalization
b. Cartesian product
c. De normalization
d. None
19. in a doubly 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 containsa. 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
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
No comments:
Post a Comment