Take FREE!! Online Mettl Mock Test to Crack TechM and Other Companies Written Exams.
Get Off-Campus Placement Jobs Info !!!
TCS NQT Technical and Managerial Round Interview Questions

# Programming Questions in JAVA Asked at Experienced

201 / 226

Given a matrix with 0’s and 1’s, you enter the matrix at cell (0,0) in left to the right direction. whenever you encounter a 0 you retain in the same direction, if you encounter a 1’s you have to change direction to the right of current direction and change that 1 value to 0, you have to find out from which index you will leave the matrix at the end.

Input : The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains two lines . The first line of each test case contains two integers n and mdenoting the size of the matrix. Then in the next line are n*mspace separated values of the matrix.

Output :

|  Matrix | | | |  Experience, Fresher

202 / 226

Given a value V, if we want to make a change for V cents, and we have an infinite supply of each of C = { C1, C2, .., Cm} valued coins, what is the minimum number of coins to make the change?

Input : The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is V and N,V is the value of cents and N is the number of coins.
The second line of each test case contains N input C[i],value of available coins.

Output :

|  Array | | | |  Experience, Fresher

203 / 226

In the below given series:

1, 2, 1, 3, 2, 5, 3, 7, 5, 11, 8, 13, 13, 17, ...

This series is a mixture of 2 series - all the odd terms in this series form a Fibonacci series and all the even terms are the prime numbers in ascending order.

Write a program to find the Nth term in this series.
Note:
The value N is a Positive integer that should be read from STDIN. The Nth term that is calculated by the program should be written to STDOUT. Other than the value of Nth term, no other characters/strings or message should be written to STDOUT.

For example, when N = 14, the 14th term in the series is 17. So only the value 17 should be printed to STDOUT.

Input : 14

Output :

|  Array | | | |  Experience, Fresher

204 / 226

Given a series whose even term creates a separate geometric series and odd term creates another geometric series.

Write a program to generate such series.For example,1, 1, 2, 2, 4, 4, 8, 8, 16, 16,......

Input : NA

Output : NA

|  Array | | | |  Experience, Fresher

205 / 226

Return the character which occurs for the maximum numbers of times in the Input String.
If multiple characters occur with the same highest frequency then return "0".

Input : Input1: abcdd

Output :

|  Strings | | | |  Experience, Fresher

206 / 226

A prime number is a whole number greater than 1 that is divisible only by itself and the number 1.

Given 'n' (1 <= n <= 100000), find the nth prime number.

Input : An integer n

Output :

|  Basics | | | |  Experience, Fresher

207 / 226

A Derangement is a permutation of n elements, such that no element appears in its original position. For example, a derangement of {0, 1, 2, 3} is {2, 3, 1, 0}.

Given a number n, find the total number of Derangements of a set of n elements.

Input : 1st Input: n = 2

For two elements say {0, 1}, there is only one
possible derangement {1, 0}

2nd Input: n = 3

For three elements say {0, 1, 2}, there are two
possible derangements {2, 0, 1} and {1, 2, 0}

Output :

|  Basics | | | |  Experience, Fresher

208 / 226

Every character in the input string is followed by its frequency.
Write a function to decrypt the string and find the nth character of the decrypted string. If no character exists at that positionthen then return "-1".
For eg:- If the input string is "a2b3" the decrypted string is "aabbb".
Note: The frequency of encrypted string cannot be greater than a single digit i.e.<10.

Explanation:

The decrypted string is "abccc", hence the 5th character in the decrypted string is "c".

Input : Input Specification:
Input1: A string.
Input2:5

Output :

|  Basics | | | |  Experience, Fresher

209 / 226

Given a number of objects N(non-repetitive object) Find the number of arrangements in which no objects occur at original positions.

Input : Input1: N, the number of Objects.
Input1: 3

Output :

|  Basics | | | |  Experience, Fresher

210 / 226

Consider the following series: 1,1,2,3,4,9,8,27,16,81,32,243,64,729,128,2187…

This series is a mixture of 2 series - all the odd terms in this series form a geometric series and all the even terms form yet another geometric series. Write a program to find the Nth term in the series.

The value N in a positive integer that should be read from STDIN. The Nth term that is calculated by the program should be written to STDOUT. Other than value of n th term,no other character / string or message should be written to STDOUT. For example , if N=16, the 16th term in the series is 2187, so only value 2187 should be printed to STDOUT.

You can assume that N will not exceed 30.

Input : if N=16

Output :

|  Basics | | | |  Experience, Fresher

+ Contribute Programming Qs.

Baig
1