• Placement Questions
• /
• C

Frequently Asked C interview questions and answers for freshers

(#M40018705) C QUESTION C- QUESTIONS Keep an EYE

Which of the following is the correct order of evaluation for the below expression?
z = x + y * z / 4 % 2 - 1

Options
1) * / % + - =
2) = * / % + -
3) / * % - + =
4) * % / - + =

Asked In C (7 years ago)

Unsolved Read Solution (5)

Is this Puzzle helpful?   (120)   (45) Submit Your Solution Program

(#M40018711) C QUESTION C- QUESTIONS Keep an EYE

To scan a and b given below, which of the following scanf() statement will you use?
#include
float a;
double b;

Options
1) scanf("%f %f", &a, &b);
2) scanf("%Lf %Lf", &a, &b);
3) scanf("%f %Lf", &a, &b);
4) scanf("%f %lf", &a, &b);

Asked In C (7 years ago)

Unsolved Read Solution (12)

Is this Puzzle helpful?   (75)   (30) Submit Your Solution Program

(#M40018713) C QUESTION C- QUESTIONS Keep an EYE

The keyword used to transfer control from a function back to the calling function is

Options
1) switch
2) goto
3) go back
4) return

Asked In C (7 years ago)

Unsolved Read Solution (21)

Is this Puzzle helpful?   (86)   (30) Submit Your Solution Definition

(#M40166240) C QUESTION juspay interview question Keep an EYE

You are given a forest (it may contain a single tree or more than one tree) with N nodes.

Each node is given an integer value 0 to (N­-1).

You have to find:
The depth of forest at which maximum number of nodes are present.
N can be very large. Aim for an algorithm with a time complexity of O(N).

INPUT FORMAT

An integer T, denoting the number of testcases, followed by 2T lines, as each testcase will contain 2 lines.
First line of each testcase has the value of N.
Second line of each testcase has list of N values where the number at index i is the parent of node i. The parent of root is -1. ( The index has the range [0, N­-1] ).

OUTPUT FORMAT

For each testcase given, output a single line that has the depth of forest at which maximum number of nodes are present. If multiple depths has same number of nodes, then deepest depth should be selected.

SAMPLE INPUT

2

6

5 -1 1 1 5 2

13

4 3 -1 -1 1 2 7 3 1 4 2 1 2



SAMPLE OUTPUT

3

1

Asked In C Mohamed yasin (1 year ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (29)   (30) Submit Your Solution Variables

(#M40018741) C QUESTION C- QUESTIONS Keep an EYE

What will be the output of the program?
#include
int main()
{
char str[]="C-program";
int a = 5;
printf(a >10?"Psn":"%sn", str);
return 0;
}
Options
1) C-program
2) Ps
3) Error
4) None of above

Asked In C (7 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (5)   (2) Submit Your Solution Program

(#M40031339) C QUESTION Problem solving Keep an EYE

Q. What is the output of the following program?

void main(){
int a=1;
while(a++ <= 1)
while(a++ <= 2);
printf("%d",a);
}

Asked In C Dinesh thatti (7 years ago)

Unsolved Read Solution (23)

Is this Puzzle helpful?   (25)   (15) Submit Your Solution Output

(#M40029368) C QUESTION C Keep an EYE

Q. What is difference between .com program and .exe program?

A. Both .com and .exe program are executable program but .com program execute faster than .exe program. All drivers are .com program. .com file has higher preference than .exe For example

Asked In C MAN (7 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (4)   (1) Submit Your Solution

(#M40018748) C QUESTION C- QUESTIONS Keep an EYE

In which order do the following gets evaluated
1. Relational
2. Arithmetic
3. Logical
4. Assignment

Options
1) 2134
2) 1234
3) 4321
4) 3214

Asked In C (7 years ago)

Unsolved Read Solution (9)

Is this Puzzle helpful?   (47)   (23) Submit Your Solution Program

(#M40018728) C QUESTION C- QUESTIONS Keep an EYE

Does mentioning the array name gives the base address in
all the contexts?

Asked In C (7 years ago)

Unsolved Read Solution (3)

Is this Puzzle helpful?   (3)   (2) Submit Your Solution

(#M40139463) C QUESTION technical (cocubes) Keep an EYE

Brain of computer is ?
1.secondary storage
2.cpu
3.ram
4.none

Asked In C soumya (5 years ago)

Unsolved Read Solution (18)

Is this Puzzle helpful?   (10)   (4) Submit Your Solution Technical