• Placement Questions
• /
• Programming

Placement Papers with Solutions

(#M40166396) NRI FINTECH QUESTION Shell scripting Keep an EYE

Wha will be th output of ine following script?
#!/in/bash
secondLoop="A B C D E F G"
counter=0

for a in 6 7 8 9
do
for b in "$secondLoop"
do
let "counter+=1"
done
done
echo "This script has $counter iterations"​

Option
1) This script has 28 iterations
2) This script has 21 iterations
3) This script has 4 iterations
4) This script has 0 iterations

Asked In Nri Fintech BUBAI GHOSH (5 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (5)   (6) Submit Your Solution

(#M40166306) COGNIZANT QUESTION write pattern Program in java Keep an EYE

* * * * *
* *
* *
* *
* * * * *

Asked In Cognizant Priya (6 years ago)

Unsolved Read Solution (9)

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

(#M40166296) TCS QUESTION Keep an EYE

Parul takes as input two numbers: a and b. a and b can take integer values
between 0 and 255. She stores a, b and c as 1-byte data type. She writes the
following code statement to process a and b and put the result in c.
c = a + 2*b
To her surprise her program gives the right output with some input values of a and b,
while gives an erroneous answer for others. For which of the following inputs will it
give a wrong answer?

Asked In TCS DASARI SAI MADHU (6 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (41)   (13) Submit Your Solution Technical

(#M40166286) JAVA QUESTION NEAREST PERFECT SQUARE Keep an EYE

Find the nearest perfect square of the given number.
Sample input:600
Sample output:576.

Sample input:47011
Sample output:47089

Asked In Java Arun (6 years ago)

Solved divya Read Solution (1)

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

(#M40166274) TCS QUESTION Keep an EYE

#include
int main()
{
int i,j;
for(i=0;i<5,i++)
i=j=i;
j=0;
printf("%d",j);
}

Asked In TCS Renuka Parmar (6 years ago)

Unsolved Read Solution (15)

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

(#M40166253) TCS QUESTION For exam for 2019 passouts My Coding Question got repeated from pre-pinsta! Keep an EYE

For exam for 2019 passouts My Coding Question got repeated from pre-pinsta!

Asked In TCS Akash (6 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (12)   (6) Submit Your Solution Arrays

(#M40166250) TCS QUESTION pnkages Keep an EYE

what is pnkages

Asked In tcs pelluru srinadh (6 years ago)

Unsolved Read Solution (1)

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

(#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 (6 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (36)   (43) Submit Your Solution Variables

(#M40166232) HR INTERVIEW QUESTION how to reverse a string without using array Keep an EYE

how to reverse a string without using array?

Asked In HR Interview Priya (6 years ago)

Unsolved Read Solution (1)

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

(#M40166221) C QUESTION c mcq's Keep an EYE

solving ability with enhanced problems

Asked In C manoj (6 years ago)

Unsolved

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