|
CTS |
|
|
Paper 31 |
CTS BLACK
Vocabulary, strings, dominoes, functions, coding (each section 8 ques)
CTS BROWN
Word series, numerical series, functions, figures, verbal (each section
8 ques)
CTS VIOLET
Functions, strings, bricks, jigsaw puzzle, cryptic clues (each section 8
ques)
CTS RED
1) 8 functions 2) 4 cryptic clues, 4 anagrams
3) 4 Tetris figures, 4 bricks 4) 8 strings 5) 4 jigsaw puzzles 4 number
series
BROWN 2002
There were different papers for different sessions. The paper had 5
sections, 5 * 8 = 40 Que's. totally
Section 1: Functions
Q: 1 - 8
Certain functions were given & based upon the rules & the choices had to
be made based on recursion. This is time consuming, but u can do it. Try
to do it at the end. Start from the last section.
L(x) is a function defined. functions can be defined as
L(x)=(a,b,ab) or (a,b,(a,b),(a,(b,b)),a,(b,b)).... two functions were
given A(x) & B(x) like if l(x)=(a,b,c) then A(x)=(a) & B(x)=(b,c)
i.e., A(x) contains the first element of the function only. & B(x)
contains the remaining, except the first element.
then the other two functions were defined as
C(x) = * if L(x) = ()
A(x) if L(x) = () & B(x) != () & C(B(x)) otherwise
D(x) = * if L(x) = ()
** if B(x) = ()
A(x), if L(x) != () & B(x) != ()
D(D(x)),otherwise ;
Now the Questions are,
1 : if L(x) = (a,b,(a,b)) then C(x) is ?
(a): a (b): b (c): c (d): none
2 : if L(x) = (a,b,(a,b)) then find D(x)
same options as above
3 : if L(x) = (a,b,(a,b),(b,(b))) find C(x)
4 : find D(x)
5 : if L(x) = (a,(a,b),(a,b,(a,(b))),b) then find c(x)
6 : find D(x)
7 : if L(x) = (a,b,(a,b)) then find C(D(x))
8 : find D(C(x))
Section 2: Word series
Q’s: 9 - 16
If S is a string then p, q, r forms the sub strings of S. For eg, if S =
aaababc & p = aa,q =ab, r =bc . Then on applying p q on S is that
ababaabc. Only the first occurrence of S has to be substituted. If there
is no sub string of p, q, r on s then it should not be substituted. If S
= aabbcc, R = ab, Q = bc. Now we define an operator R 
Q when operated on S, R is replaced by Q, provided Q is a subset of S,
otherwise R will be unchanged. Given a set S =… when R Q, P=
= 672; R, Q  P operated successively on S, what will be new S?
There will be 4 =: if s = aaababc & p = aa, q = ab, r = bc then applying
p q, q r & r p will give,
(a): aaababc (b): abaabbc (c): abcbaac (d): none of the a,b,c
10: if s = aaababc & p = aa q = ab r = bc then applying q r & r p will
give,
11: if s = abababc & p = aa q = ab r = bc then applying p q, q r & r p
will give,
12: if s = abababc & p = aa q = ab r =bc then applying q r & r p will
give,
13: if s=aabc & p=aa q=ab r=ac then applying p->q(2) q->r(2) r->p will
give,(2) Means applying the same thing twice.
14: Similar type of problem.
15) if s = abbabc p = ab q = bb r = bc then to get s = abbabc which one
should be applied.
(a): p->q,q->r,r->p
16) if s = abbabc p = ab q = bb r = bc then to get s = bbbcbabc which
one should be applied.
Let us consider a set of strings such as S = aabcab. We now consider two
more sets P and Q that also contain strings. An operation P Q is defined
in such a manner that if P is a subset of S, then P is to be replaced by
Q. In the following questions, you are given various sets of strings on
which you have to perform certain operations as defined above.
Choose the correct alternative as your answer. (Below are some ques from
old ques papers)
a) Let S = abcabc, P = bc, Q = bb and R = ba. Then P Q, Q R and R P,
changes
S to ________? (A) ............ (B) abcabc (C) ............ (D) none of
A, B, C
b) Let S = aabbcc, P = ab, Q = bc and R = cc. Then P Q, Q R and R P,
changes
S to _________? (A) ababab (B) ............ (C) ............ (D) none of
A, B, C
c) Let S = bcacbc, P = ac, Q = ca and R = ba. Then P Q, Q R, P R and
changes
S to ________? (A) ............ (B) ............ (C) bcbabc (D) none of
A,B,C
d) Let S = caabcb, P = aa, Q = ca and R = bcb. Then P Q, P R, R Q and
changes S to ________?
(A) ............ (B) ............ (C) ............ (D) none of A,B,C. |
|
This paper is
downloaded from: www.ChetanaS.com |
|
|
If
you think you can, you can... |
|
|
