# CTS2000 - Qns(9 to(16 Words from string GODG are to be...

This preview shows page 1. Sign up to view the full content.

Sheet1 Page 1 REC-ROURKELA CTS 2000 Qns (1) to (8) : A list is represented as {a,b,c} etc. where these may be any number of elements in it. the elements of a list may be example L = {a,(b,c),b}. Some operations are defined like that of the following A(L) = first element of the list B(L) = all elements of the lsit except the first one and is a list itself. Example : if L = {a,(b,c),b} then A(L) = a and B(L) = {(b,c),b} Similarly other such operations like M(L), P(L) and R(L) has been defined properly. The question will be to perform the given operations in a given list.Trick is to solve in a systematic way each and every step taking vare of all the brackets. try yourself some random operations on some random list. try this question with a cool mind at the last.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Qns (9) to (16) : Words from string GODG are to be formed under some given rules like Rule 1 : If x and y are the strings of G only, containing atleast one G then GODG is a valid word. Rule 2 : If x and y are strings of G only, contaning at lease one G and xODy is also a valid string. Example : a set of strings like {GODGGG,GODGG,. ...... etc} are given. You have to tell how many valid strings are there. Qns. (17) to (24) : Number of bricks and target are given. you have to form a target using 4 type of bricks out of 5 bricks. Example : Bricks to be used is 7,8,11,4,1 only once. Target = 41. Using this bricks only once and also using any mathematical operations u have to get the target. 41 = 7*8 -11 -4 Qns (25) to (32) :...
View Full Document

## This note was uploaded on 06/27/2010 for the course MACS MCA taught by Professor Brs during the Spring '10 term at National Institute of Technology, Calicut.

Ask a homework question - tutors are online