Enter Ur Email ID To Get Study Material & Latest Job Updates In Mail Inbox:
(Please activate subscription from your mail Inbox)  FeedBurner

Home » , , » iGate patni C Based Questions, Interview C Questions

iGate patni C Based Questions, Interview C Questions

Written By Unknown on Friday, 2 November 2012 | 12:55 am

                iGate patni C skills Questions
________________________________________________________________________

1. find(int x,int y)
{ return ((x call find(a,find(a,b)) use to find
(a) maximum of a,b
(b) minimum of a,b
(c) positive difference of a,b
(d) sum of a,b

2. integer needs 2bytes , maximum value of an unsigned integer is
(a) { 2 power 16 } -1
(b) {2 power 15}-1
(c) {2 power16}
(d) {2 power 15}

3.y is of integer type then expression
3*(y-8)/9 and (y-8)/9*3 yields same value if
(a)must yields same value
(b)must yields different value
(c)may or may not yields same value
(d) none of the above

4. 5-2-3*5-2 will give 18 if
(a)- is left associative,* has precedence over -
(b) - is right associative,* has precedence over -
(c) - is right associative,- has precedence over *
(d)- is left associative,- has precedence over *

5. printf("%f", 9/5);
prints
(a) 1.8,
(b) 1.0,
(c) 2.0,
(d) none

6. if (a=7)
printf(" a is 7 ");
else
printf("a is not 7");
prints
(a) a is 7,
(b) a is not 7,
(c) nothing,
(d) garbage.

7. if (a>b)
if(b>c)
s1;
else s2;
s2 will be executed if
(a) a<= b,
(b) b>c,
(c) b<=c and a<=b,
(d) a>b and b<=c.

8. main()
{
inc(); ,inc(); , inc();
}
inc()
{ static int x;
printf("%d", ++x);
}
prints
(a) 012,
(b) 123,
(c) 3 consecutive unprectiable numbers
(d) 111.

9. preprocessing is done

(a) either before or at begining of compilation process
(b) after compilation before execution
(c) after loading
(d) none of the above.

10. printf("%d", sizeof(""));
prints
(a) error
(b)0
(c) garbage
(d) 1.

11.main()
{
int a=5,b=2;
printf("%d", a+++b);
}

(a) results in syntax,
(b) print 7,
(c) print 8,
(d) none,

12. process by which one bit patten in to another by bit wise operation is
(a) masking,
(b) pruning,
(c) biting,
(d) chopping,

13.value of automatic variable that is declared but not intialized
will be
(a) 0,
(b) -1,
(c) unpredictable,
(d) none,

14. int v=3, *pv=&v;
printf(" %d %d ", v,*pv);
output will be
(a) error
(b) 3 address of v,
(c) 3 3
(d) none.

15. declaration
enum cities{bethlehem,jericho,nazareth=1,jerusalem}
assian value 1 to
(a) bethlehem
(b) nazareth
(c)bethlehem & nazareth
(d)jericho & nazareth

16. #include
#include
void main()
{
char buffer[82]={80};
char *result;
printf( "input line of text, followed by carriage return : ");
result = cgets(buffer);
printf("text=%s ",result);
}
(a) printf("length=%d",buffer[1]);
(b) printf("length=%d",buffer[0]);
(c) printf("length=%d",buffer[81]);
(d) printf("length=%d",buffer[2]);

17. Consider scanf and sscanf function , which is true

(a) no standard function called sscanf
(b) sscanf(s,...) is equivalent to scanf(...) except that
input charecter are taken from string s.
(c) sscanf is equivalent to scanf.
(d) none of above.

18. #include
main()
{
char line[80];
scanf("%[^ ]",line);
printf("%s",line);
}
what scanf do ?
(a) compilation error . illegal format string.
(b) terminates reading input into variable line.
(c) and (d) other two options.

19. problem was big so i couldn’t remember . simple one.

20 . ceil(-2.8) ?
(a) 0
(b) -3.0
(c) -2.0
(d) 2

21. for( p=head; p!=null; p= p -> next)
free(p);

(a) program run smooth.
(b) compilation error.
(c) run time error.
(d) none of above.

22. int x[3][4] ={
{1,2,3},
{4,5,6},
{7,8,9}
}
(a) x[2][1] = x[2][2] =x[2][3] = 0
(b) value in fourth column is zero
(c) value in last row is zero
(d) none of above.

23. Problem was big so I couldn’t remember. Simple one.

24. main ()
{
printf("%u" , main());
}
(a) print garbage.
(b) execution error
(c) printing of starting address of function main.
(d) infinite loop.

25 . int a, *b = &a, **c =&b;
....
....
.....
a=4;
** c= 5;

(a) doesnot change value of a
(b) assign address of c to a.
(c) assign value of b to a.
(d) assign 5 to a.

26. Problem was big so i couldn’t remember . simple one.

27. Problem was big so i couldn’t remember . simple one.

28. Answer : swapping of values .

29. Simple one.

30. i =5;
i= (++i)/(i++);
printf( "%d" , i);
prints ,
(a) 2
(b) 5
(c) 1
(d) 6

More Technical Questions

1. One Nibble =?

2. Hexadecimal and Octal representation of 1024?

3. What a compiler does?

4. DOS? (Whether Graphical interface or Character interface and two more

Choices are given)

5. CPU - abbreviation

6. Fortran used as ( Ans : Scientific Language)

7. ASCII character set ? (total number)

8. Windows NT- What NT stands for?

9. Which is not an input device ? (keyboard, Disk, Mouse,Lightpen)

10. Which is not a pointing device ?( mouse,Joy stick,lightpen none)

11. Microsoft Chief ?

12. 4GL ? (Fortran,SQL,ADA, ....)

13. Father of Computers?

14. Which of them is Object Oriented Language.?

15. Power PC is the product of ? (Microsoft,IBM,Apple,Motorola,Intel)

(A combination of any correct 3 companies)

16. Latest processor used ? (Pentium, Power PC, Pentium pro,none)

17. MS Word is ?

18. First Super Computer built in India. (Ans : param)

19. Which of the following companies donot manufacture chips?

(Microsoft, Motorola, Intel, HP)

20. LAN - abbrevation

21. WAN - abbrevation

22. Modem is ? (related to electrical hardware.- Like Modulator &demodulator)

23. FDD - abbrevation ( floppy Disc drive)

24. BIT - abbrevation

25. Information is ? (message, data,processed data,none)

26. Which is not networking ?(internet, Ethernet, arcnet,none)

27. One Gigabyte =?( 2 power30 , 2 power 20 ,2 power 10 none)

28. Which of the following is not RDBMS ? (sybase, SQL,Acess,none)_

29. Oracle is ? (Ans : Relationasl Data Base Management System)

30. In Oracle, Table means ( Ans : Collection of records)

31. DMA - abbrevation (Direct Memory Access,Discrete memory Access,

Disk memoryaccess)

32. What is meant byStatic Variable ?

33. What is meant by QUEUE? {refer any data structures text}

34. What is meant by STACK? {refer any data structures text}

35. The processor used in first IBM PC? (8086,8088,zig4,intel)

36. Difference between 80286 and 80287

37. In bubble sort , no. of comparisons required ?(ans : formula : N*(N-1)/2)

38. No. of comparisons of an item in 100 items by binary comparison?

( 10,25,50 100)

39. CRT - (Cathode Ray Tube)

40. No. of entryvalues are there in ideally in a subroutine.

41. Binary tree?

42. Flow in one direction ? (Single linked list,Double linked

list,.......,....)

43. Electron screen size ? (here, 2 lines of algorithm is given.

Name the algoirithm)

44. Which is not storage device.? (printer,CD ROM,Disk,none)

45. A question regarding memory ? ( least used memory,recently unused

memory,..)

46. ISO - (International Standard Organisation)

47. HTML - (Hyper Text Makeup Language)

48. Flow chart for factorial N? (ans :choice a)

49. What is meant by Recursion ?

50. Struct(s)

{ int a;

long b;

}

Union (u)

{int a;

long b;

}

Print sizeof(s)and sizeof(u) if sizeof(int)=4 and sizeof(long)=4

51.Switch (i)

i=1;

case 1

i++;

case 2

++i;

break; ( ans : 1,2,3,none)

case 3

--i;

Output of i after executing the program

52. char S;

char S[6]= " HELLO";

printf("%s ",S[6]);

output of the above program ? (0, ASCII 0, I,unpredictable)

53. Unsigned char c;

for ( c=0;c!=256;c++2)

printf("%d",c);

No. of times the loop is executed ? (127,128,256,infinitely)

54. int i;

i=0;

repeat

i=i+1; <====== PASCAL PROGRAM

print i;

until(i<10)

end

No. of times the loop is executed?

55. Convert (int A,var ,int B;int c)

{

A=10;

B=4-;

C=120;

}

Convert (inta,b,c)

{ <====== PASCAL PROGRAM

a=1;

b=4;

c=12;

} convert (

A,B,c) ?

(

10,40,120

10,40,12,..........,............)

56. Procedure A

Begin

--------

end <====== PASCAL PROGRAM

Procedure B No. Of errors in the program ?(1,2,3,none)

Begin

-----------

end

57. int i;

i=2;

i++;

if(i=4)

{

printf(i=4);

} else

{

printf(i=3);

}

output of the program ? (4,3,unpredictable,none)

58. what is FAT?.

File allocation table

0 comments:

Post a Comment

Thanks For Your Comment. We Get Back To You As Soon As Possible.