CTS Paper Test Conducted in 2003 1st question was from function, (a,b,c)- L(a) is if u...
Cognizant technical mcq question, verified with a worked answer. Free to practise - no sign-up.
CTS Paper
Test Conducted in 2003
1st question was from function,
(a,b,c)- L(a) is if u delete 1st element from it whatever is left.
(a,b,c)-L(b) is 1st element of the list.
if (a,b) &a r two lists then M(l1,l2) is ((a,b),a)
X(a,l)=a
=L(a)
=M(a,l)
y(a,l)=l
=L(b)
=M(l,a)
based on this they gave 4 questions,most of the answers were b.
there is negative marking of .25.
if abacbb corresponds to bbcaba & acbbca corresponds
to acbbca then baabcb corresponds to what.
ans-bcbaab.
what they did in each question was either rotated the
full word clockwise by 1 .
like if abcbac corresponds to bcbaca & acbacb
correspnds to cbacba then abcabc corresponds to what.
ans-bcabca.
one question was on six block borders were given.
1 2 2 3 3 1
1 2 3 2 1 3
this was given in six different column blocks.
questions. was
if 1 2 3 2
2 3 2 1
1 3 2 3
3 2 1 2
then 1 2 - -
corresponds to which of the block.four options were given.all these things were in square blocks. like this 10 questions were given. then at last they had around 8 questions like this p--s--d- corresponds to what
1.utopian 2.convince 3.pervade 4.
ans- convince.-persuade.
one was perverse.
decadent(not sure).
CTS Paper
Test Conducted in 2003
There were 5 sections
total 40 questions
They distributed 2 sets to 2 batches. they were
conducted 1 after the other .not simultaneously
1.funtions(in all engineering students group u can get
hint of these questions)
2.based on dominoes
6 dominoes were given & target was given we had to
find the correct position of a specific domino from
the 4 options so that we can reach the target
8 problems were based on this
3.strings
3 rules were given 8 questions were asked based on those
rules.
we had to find whether the string given was valid or
not based on those rules.
there were 3 symbols g,o,d .in the Lang & x y were
strings of Gs with at least 1 g
4.based on coding of alphabets simple)
practice rs aggarwal reasoning for this
5.english anagrams
e.g. d_a_b_l_c
diabolic-devilish
a word incomplete was given & its meaning was given in
the choices
quixotic-utopian
persuade-convince
deprecate-degenerate
cognition-knowledge
quotidian-everyday
CTS Paper
Test Conducted at NIT-Surat 2003
section I
a question will be given from lists with some conditions. like L(a,b,c) is a list and the value of the list is the remaining elements in it except the first element. But if the list is L(a,(b,c))then it is called a list in a list and same conditions are put forward for that.
SECTION II
This also comprises similar type of questions. But with some ease.like xGyD is a word then xGGyGGo ia also a valid word and so find the number of valid words in the given set. Question may seem to be easy but very difficult if u attempt. It is very difficult the answer the first two sections.
section III
Consist a set of dominoes and essentially deals with numbers and this is also tough. NO aptitude. Some arrangement in a matrix of numbers.
section IV
Consists of anagrams and SOLVE THIS FIRST these can fetch you marks easily. ababab coded to bababa then what is cacaca coded to......?same type only.
section V
Words>U have to fill the words and find the corresponding meanings from the answer. It was easy. IF u prepare for GRE.
THe first mark was 20 out of 40.There is 1 mark for each question with a negative marking of O.25 Interview nothing special. Only puzzle solving and basic technical.
CTS Paper
PAPER
- A says " the horse is not black".
Show answer & explanation
The transformation groups characters by their value (a, b, c) and reconstructs the string by reading positions in sorted order of character types. For baabcb: sorting positions by character (a's at 1,2; b's at 0,3,5; c at 4) yields bcbaab when rearranged according to the pattern observed in the examples.
Step-by-step Derivation:
Pattern analysis:
- abacbb: characters sorted by type = [b,b,c,a,b,a] → bbcaba (positions reordered)
- baabcb: applying same rule:
- Sort by character: b(0,3,5), a(1,2), c(4)
- Rearrange: positions 3,5,0,1,2,4 → b,c,b,a,a,b → bcbaab
- Verification: The pattern groups identical characters and places them in consolidated blocks while preserving relative positional logic.