You are on page 1of 10

TEST STRUCTURE

Duration: 40 minutes
Proctoring: Browser + Webcam proctoring enabled
Schedule: Every 8 AM Saturday - 8 AM Monday
Type: Randomization and shuffle enabled per section

Section 1
(Compulsory): Aptitude & Problem-solving - 8 Questions (10 Minutes)

Section 2
(Compulsory): Basic CS - Pseudo Code based - 8 Questions (10 Minutes)

Section 3 (1 out of 2)
CS Mathematics - 5 Questions (20 Minutes)
Or
Basic Coding - 1 Question (20 Minutes)

Each section will have questions randomly picked up from a pool of questions:

Section 1: 8 out of 50
Section 2.8 out of 50
Section 3: 5 out of 20 or 1 out of 5
Section-1: Aptitude and Problem Solving - 8 Questions (10
Minutes)
(Numbers)

1. On dividing certain number by 234 we get 43 as remainder. If the same number is divided by 13
what will be the remainder?

A.6
B. 9
C. 4
D. 7.

2. Find the remainder when 3^27 is divided by 5 ?

A. 3
B. 2
C. 4
D.1

(Probability )

3. When tossing two coins once, what is the probability of heads on both the coins?

A. 14
B. 12
C. 34
D. None of these

2. A card is randomly drawn from a deck of 52 cards. What is the probability getting an Ace or King or
Queen?

A. 3/13
B. 2/13
C. 1/13
D. 1/2
2. Two boys starts from the same place walking at the rate of 55 kmph and 5.5 kmph respectively in the
same direction. What time will they take to be 8.5 km apart?

A. 17 hr
B. 14hr
C. 12 hr
D. 19 hr

( Percentage)
1. A fruit seller had some oranges. He sells 40% oranges and still has 420 oranges. How many oranges he had
originally?

A. 420
B. 700
C. 220
D. 400

2. In an election between two candidates, one got 55% of the total valid votes. 20% of the votes were invalid. If
the total number of votes was 7500, what was the number of valid votes that the other candidate got?

A. 2800
B. 2700
C. 2100
D. 2500

(Permutations and Combinations)

1. In how many different ways can the letters of the word 'CORPORATION' be arranged so that the vowels always
come together?

A. 47200
B. 48000
C. 42000
D. 50400
2. . In how many ways can a group of 5 men and 2 women be made out of a total of 7 men and 3 women?

A. 1
B. 126
C. 63
D. 64

(Mixture and Alligation)

1. A container contains 40 litres of milk. From this container 4 litres of milk was taken out and replaced by water.
This process was repeated further two times. How much milk is now contained by the container?

A. 26 litres
B. 29.16 litres
C. 28 litres
D. 28.2 litres

2. The cost of Type 1 material is Rs. 15 per kg and Type 2 material is Rs.20 per kg. If both Type 1 and Type 2 are
mixed in the ratio of 2 : 3, then what is the price per kg of the mixed variety of material?

A. Rs. 19
B. Rs. 16
C. Rs. 18
D. Rs. 17

Section-2: Basic Computer Science - 8 Questions (10 Minutes)


1. What is printed when the following lines of code are evaluated?

x = 0
while x < 3:
if x <= 1:
print("Donut Select")
else: print("From DoSelect")
x = x + 1

A.
Donut Select
Donut Select
From DoSelect
B.
Donut Select
Donut Select
Donut Select

C. DoSelect

D. None of above

Q2. Find the output

while ( more input is available)


{
read a character
if ( the character is a '{' )
push it on the stack
else if ( the character is a '}' and the stack is not empty )
pop a character off the stack
else
print "unbalanced" and exit
}
print "balanced"

Select the unbalanced sequence that will be declared balanced from above code

A. {}{}{}
B. {{{}}
C. {{{}}}
D. {}{}{{}}

Q3. For the given input, find the output

declare a stack of characters


while ( there are more characters in the word to read )
{
read a character
push the character on the stack

}
while ( the stack is not empty )
{
pop a character off the stack
write the character to the screen
}

What is output for input "upgradscholarship"?

(A) sholarshipupgrad
(B) pihsralohcsdargpu
(C) upgradscholarship
(D) upgradpihsralohcsdargpu

Q4.

Begin
Read Temp
If Temp > 45 then
X <- Very hot
Else
If Temp > 35 then
X<- warm
Else
If Temp > 20 then
x <- perfect
Else
If Temp < 20 then
X <- cold
End.

Test the above algorithm with the value Temp =25. The variable X will contain

A. 'cold'
B. 'warm'
C. 'perfect'
D. 'very hot'
Section 3: CS Mathematics - 5 Questions (20 Minutes)
Q. 215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
What is the sum of the digits of the number 21000?

Q. A palindromic number reads the same both ways. The largest palindrome made from the product of
two 2-digit numbers is 9009 = 91 99.
Find the largest palindrome made from the product of two 3-digit numbers.

Q. The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual
in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations
of one another.
There are no arithmetic sequences made up of three 1-, 2-, or 3-digit primes, exhibiting this property,
but there is one other 4-digit increasing sequence.
What 12-digit number do you form by concatenating the three terms in this sequence?

Q. The prime 41, can be written as the sum of six consecutive primes:
41 = 2 + 3 + 5 + 7 + 11 + 13
This is the longest sum of consecutive primes that adds to a prime below one-hundred.
The longest sum of consecutive primes below one-thousand that adds to a prime, contains 21 terms,
and is equal to 953.
Which prime, below one-million, can be written as the sum of the most consecutive primes?

Q. In England the currency is made up of pound, , and pence, p, and there are eight coins in general
circulation:
1p, 2p, 5p, 10p, 20p, 50p, 1 (100p) and 2 (200p).
It is possible to make 2 in the following way:
11 + 150p + 220p + 15p + 12p + 31p
How many different ways can 2 be made using any number of coins?
OR Section-3: Basic Coding - 1 Question (20 Minutes)

Question 1

Problem Statement:

In numberland, the main occupation of its citizens is to perform tasks on numbers. One such
important task is the finding of interesting number sequences.

As per the numberland institute of research, an interesting sequence is defined as a sequence


of numbers that are consecutive, for example:
123456
10 11 12 13

Are interesting sequences. Mathematically, an interesting sequence has the following generic
property:n(i + 1) = n(i) +1

The task faced by the research institute is as follows:


Given an ordered set of distinct numbers, extract the length
of the largest interesting sequence that can be obtained
by rearranging the set of numbers.

Help the research institute in finding the longest interesting subsequences.

Input
The input consists of two lines.
The first line contains N, the length of the input sequence.
The second line of input consists of N numbers, the sequence of numbers that must be
analysed.

Constraints
9 N 1000
If Ki be ith element in the sequence, 1 Ki 2000

Sample Test Case


Input
11
15 17 13 16 14 3 4 6 1 2 5

Output
6

Here we can rearrange the sequence as


13 14 15 16 17 1 2 3 4 5 6

Observe that there are two interesting sequences:


123456

and
13 14 15 16 17

Sequence 1 2 3 4 5 6 is of maximal length therefore, the answer is 6

Question 2

Problem Statement:

Phoebes grandma has given her a delicious recipe for Chocolate Chip Cookies.
Monica has become a fan of them and has asked Phoebe to give her the recipe.
Unfortunately, though, a fire breaks out in her apartment and the recipe gets destroyed.
Monica is devastated upon hearing this but Rachel comes to the rescue and starts listing
out all the ingredients.
All the ingredients will be processed in the order they are listed.
Being Rachel, she forgets the sequence and makes up many of the ingredients to shut
Monica up, but Monica easily figures it out.

Each version of the correct recipe (ingredients in the different sequence) generates a
derived version of the cookie.
Now she wants you guys to help her in figuring out whether the recipe given by Rachel
generates any version of a chocolate chip cookie or not?
Input
The first line of input will consist of T(Number of Test Cases).
The second line will consist of 2 recipes S1, S2.
S1 being the correct recipe and S2 is the recipe given by Rachel.

Output
Print Yes, if a cookie is generated.
Print No, otherwise.
Note: The Output must be printed without the quotes.

Sample Test Case

Input
2
axle lxae
aaabab bacdba
ababa bbaaa

Output
Yes
No
Yes