Wew. recruitment .guru 3 ‘Question Baoklet Code —> CS : COMPUTER SCIENCE AND INFORMATION TECHNOLOGY Duration: Three Hours Maxismam Marks: 100) end the following instructions carefully. 1. Do nol open the scal of the Question Booklet until you are asked to do so by the invigilator. ‘2. Take oat the Optical Response Sheet (ORS) from this Question Booklet without breaking the seal and read the instructions printed on the ORS carefully. I’ you find that either 4a, The Question Booklet Code printed at the right hand top comer of this page does not match with the Question Booklet Code at the right hand top comer ofthe ORS or b. The Question Paper Code preceding the Registration number on the ORS is not CS, then exchange the booklet immediately witha new scaled Question Booklet. 3. On the right hand side of the ORS, using ONLY a black ink ballpoint pen, (i) darken the appropriate bubble under cach digit of your registration number and (ji) write your registration number. your name and name of the exarnination centre and put your signature atthe specified location. 4. This Question Booklet contains 20 pazes including blank pages for magh work. After you are permitted to open the seal. check all pazes and report discrepancies. ifany. to the invigilator. 5. There are a total of 65 questions camyine 100 marks. All these questions are of objective fype. Each ‘question has only one correct answer. Questions must be answered on the left band side of the ORS by darkeaing the appropriate bubble (marked A, B.C, D) using ONLY a black ink ballpoint pen ‘against the question number. For each question darken the bubble of the correct answer. More than one answer bubbled azainst a question will be treated as an incorreet response. ‘6. Since bubbles darkened by the black ink ballpoint pen cannot be crased, candidates should darken the bubbles in the ORS very carefully. 7. Questions Q.1 ~ Q.25 carry 1 mark cach. Questions Q.26 — Q.55 carry 2 marks each. The 2 marks ‘questions include two pairs of common data questions and two pairs of linked answer questions. The answer to the second question of the linked answer questions depends on the answer to the first ‘question of the pair. If the first question in the linked pair is wrongly answered ar is not atlempted, then tbe answer to the sccond question in the pair will not be evaluated. 8. Questions @.56 — 65 belong to General Aptitude (GA) section and carry a total of 15 marks. ‘Questions Q.56—Q.60 cary I mark each, and questions (2.61 — 0.65 carry 2 marks each. 9. Questions not attempted will result in zero mark and wrong answers will result in NEGATIVE marks, For all |-mark questions, ¥% mark will be deducted for cach wrong answer. For all 2 marks ‘questions, % mark will be deducted for cach wrong answer. However, in the case of the linked answer question pair, there will be negative marks only for wrong answer to the frst question and no negative marks foe wrong answer to the second question. 10, Calculator is allowed whereas charts, graph sheets or tables are NOT allowed in the examination hal 1. Rough work can be dane on the Question Booklet itself. Blank pages are provided at the end of the ‘Question Booklet for rough work. 12. Before the start of the examination, write your name and registration number in the space provided belenr using a black ink ballpoint pen. Name Rezistration Number | CS [ LI seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need Bor3 Wew. recruitment .guru COMPUTER SCIENCE & INFORMATION TECH. - 5 Q.1 to Q.25 carry one mark each, Qu az a3 os as Q6 Q7 ‘A binary operation @ on a set of integers is defined as 1@ y=x" + y*. Which one of the following statements is TRUE about ©? (A}Commatative bat not associative (C) Associative but not commutative (B) Both commutative and associative (D) Neither commutative nor associative ‘Suppose p is the number of curs per minute passing through a certain road junction between 5 PM and 6 PM, and g has a Poisson distribution with mean 3. What is the probability of observing fewer ‘than 3 cars during any given minute in this interval? fapaice’) (By 9120") (C) 17/(2¢") (D) 26/(2e") hx a Which onc of the following does NOT equal |i 9°]? h 1 oxtett) et] heen had (Ay [t vtyet) ret |i yen ste boat ty @) Bb ve: he ‘The smallest intezer that can be represented by un 8-bit number in 2°s compleaent form is (A286 (B)-138 oan (myo In the following truth table, V = 1 ifand oaly ifthe inpot is valid. Tapas Ouipas D, | D, 7D.) BT X TX TV es TLope,ofepolt x/ijovoloyvilt [x[x]iyolifta Giana ‘What function does the truth table represent? (A) Priority encoder (B) Decoder (C) Maltiplexer (D) Demultiplexer Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort? (Ap Oflog n) (B) O(n) Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of 1 nodes? (8) OMlog (€) 01m) (C)O(n bog) (D) 0) (ayoul) (D) Ot log nh sraviding a iece‘o€ kafersetion. ‘Tite denote meee alone: Tide sien be-maed for3 Wew. recruitment .guru COMPUTER SCIENCE & INFORMATION TECH. - CS Qa ao Quo Qu Qn Qu Considerthe languages 2, and £, ={a}. Which one of the following represents ££: ? (arte ByD a (D) {ea} ‘What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no cpsilon- and unit-production (1.c., of type A —- ¢ and A — a) to parse a string ‘with 2 tokens? (Ayn, Bynt © m4 () 2 A scheduling algorithm assigns priority proportional tothe waiting time of a process. Every process stars with priority 2e70 (the lowest priority). The scheduler re-evaluates the process prorities every time units and decides the next process to schedule. Which one of the following is TRUE if the ‘Processes have no LO operations and all arrive at time zero? (A) This algorithrn is equivalent to the firt-come-first-serve algorithm. (B) This algorithm is equivalent to the round-robin algorithm. (C) This algorithm is equivalent to the shortest-job-fira algorithm, (D) This algorithm is equivalent to the shortest-remuining-time-fist algorithm. ‘Maich the problem domains in GROUP I with the solution technologies in GROUP IL GROUPT GROUP (P) Service oriented computing (1) Interoperability (Q) Heterogencous communicating systems (2) BPMN, (R) Information representation (3) Publish-find-bind (3) Process description (@) XM (AYPH,Q2.R3,S4 (B)P3,Q4.R-25-1 (C)P-3, Qed, Rt S-2 (D) Pes. Q3. RZ, Sd ‘The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are (A) TCP. UDP, UDP and TEP (B) UDP, TCP, TCP and UDP. (©) UDP, TCP. UDP and TCP (D) TCP. UDP, TCP and UDP Using public key cryptography, X adds a digital signature o to message M. encrypts , and sends it to Y where if is decrypted. Which one of the following sequences of keys is used for the ‘operations’ (A) Encryption: X's private key followed by Y's private key; Decryption: X's public key followed by Y's public key (B) Encryption: X's private key followed by ¥"s public key; Decryption: X's public key followed by Y's private key (C) Encryption: X's public key followed by Y's private key; Decryption: ¥"s public key followed by X's private key (D) Encryption: X's private key followed by Y"s public key; Decryption: Y's private key followed by X's public key sraviding a iece‘o€ kafersetion. = ‘Tite denote meee alone: Tide sien be-maed forWew. recruitment .guru 3 COMPUTER SCIENCE & INFORMATION TECH. - CS QU4 Assume that source § and destination D are connecied through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S ta D. (A) Network layer — 4 times and Data link layer = 4 times (B) Network layer — 4 times and Data link layer ~ 3 times (C) Network layer — 4 times and Data link layer ~6 times (D) Network layer ~ 2 times and Datalink layer — 6 times QUS An index is clustered, if (Ajit is on a set of fields that form a candidate key. (B) itis on a sct of fields that include the primary key. (C) the data records of the file are organized in the same order as the data entrics of the indea. (D) the data records of the file are organized not in the same order as the data entries of thc index. Q16 Three concurrent processes X, ¥, and Z exccute three different code segments that access and ‘update certain shared variables. Process X execuics the P operatiog (i... waif) on semaphores 4a, b and ¢: process ¥ executes the P operation on semaphores b, c and d- process Z executes the P operation on semaphores c. a, and a before entering the respective code seements. After completing the execution of its cade segment, each process invokes the V operation (ie. signal) on its three semaphores. All scmaphores are binary semaphores initialized to onc. Which one of the following represents a deadlock-frce onder of invoking the P operations by the processes? (AX POPOIPC) FABIA CP) Z AeiPtd) Pa) (B) X:PU)P@)ACy YAP) Z: Pa)Pte)P\d) (C) X: PUPAE) Ys PLCIID)PUd)—Z: PlayPtc)P\d) DLP AMP) VME) ZA eiPdPad Q.17 Which of the following: statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine ‘Turing recognizable langusges are closed under union and complementation ‘Turing decidable languages are closed under intersection and complementation. ‘Turing recognizable languages are closed under union and intersection. (A)Land4 only (By and3only ——(€) 2oaly (D) Sonky Pep Q.18 Which of the following statements arc TRUE? 1. The problem of determining whether there exists a cycle in an undirected eraph is in P. 2. The problem of determining whether there exists a cycle in an undirected graph is in NP. 3. Ifa problem A is NP.Complete, there exists a non-dcterministic polynomial time algorithm tosalve A. (Av, 2and 3 (B) | and 2 only (©) 2and 3 only (D) 1 and only seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru COMPUTER SCIENCE & INFORMATION TECH. - 5 Quis 20 Qa Qn 24 Qs ‘What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? fayemn’) «By err lozn) (ced) (D) @ Crag n) Ing A-way set essoviative cache, the eache is divided into v sets, each of which consists off lines ‘The lines of a set are placed in sequence one after another. The lines in set s re sequenced before the lines in set (31). The main memory blocks are numbered 0 onwards. The main memory block ‘numbered j must be mapped to any one of the cache lines from (A)G mod v) *£ to (mod y*k+(k1) —— (B) (mod y) to (mod v) +1) (C) (mod 8) wo Y mod by + (1) (D) (mod k) * vt0 (j mod k) * v+ (v4) ‘Which one of the following expressions does NOT represent exclusive NOR of x and 3? (Ayayeaty’ 1B) xe y" © rey (D) sey" ‘Which onc of the following functions is continuous al x = 3? 2 esa if a3 (A) pldafr-k if as ives A. res 3 eh fxs § 2)= D) F(t woes © si ee es (D) F(a forss Function fis known at the following points: = © [os [os [oo [a2 [is [is [a1 [oa [a7 [a0 [a_[ 0 [ooo [036 [ost [tas [225 [324 [4at [5.76 [729 [900 The valucor [' f(x} computed using the raperoidal rule is (a) 8.983, «By 9.003 (9.017 (D)9.045 Consider an undirected random graph of eight vertices. The probability that shere is an edge ‘between a pair of vertices is 1/2. What isthe expected number of unordered cycles of length three? (ayia By oT (D) 8 ‘Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q. Sum of degrees ofall vertices is even. (AyPonly (B)Qonly (©)BothP and Q@ —_(D) Neither P nor Q sm seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 3 COMPUTER SCIENCE & INFORMATION TECH. - CS Q.26 to Q.55 carry two marks each. 26 The line graph L(G) of a simple graph G is defined as follows: © There is exacily one vertex vfe) in L(G} for each edge e in G. © Foranytwo edges e and.’ in G, [1G)hhas an edge between We} and fe). if and only ife and e! are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is acycle. (Q) The line graph ofa clique isa cl (R) The line graph of a planar graph is planar. (8) The line graph of a tree is a tree. (A) Ponly (B) Pand R only (©) Ronly (D) P,Qand S only (Q.27 What is the logical translation of the following statement? “None of my friends are perfect.” (Ay astF (a)45P() (B) 3xGF (x)o P(x) (©) arF(x)aaP (a) (D) A ax(F(x)a P(r) Q28 Consider the following sequence of micro-operations. MBR— PC MAR —X PCY ‘Memory — MBR Which onc of the following is a possible operation performed by this sequence? (Ay Instruction fetch (B) Operand fetch (C) Conditional branch (D) Initiation of interrupt service Q29 Consider a hand disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is . A file of size 42797 KB is stored in the disk and the starting disk location of the file is <1200, 9, 40> ‘What is the cylinder number ofthe last sector ofthe file. if tis stored in a contiguous manner? (ay 28 ¢B) 1282 (©) 1283 (D) 1284. 30. The number of elements that can be sorted in @log n) time using heap sort is tayeay (By 0 (Ving ») oe (es) (D) (log n) seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 201s COMPUTER SCIENCE & INFORMATION TECH. « C5 Q31 Consider the following function: int unknown (int nd int iy je k=O; fer (a icons itt) fer (4-25 return (hk)? ‘The return value of the funetion is fayemn’) «By 90rlogn) (C) enn") (D) fn'logn) Q32_ Consider the following languages 4={0r 10" Ipgr 20) pg 0. per} Which onc of the following statements is FALSE? (A) Lis context-free. (B) 200 Leis context-free. (C) Complement of L: is recursive. (D} Complemeat of fy is context-free but not regular. Q33._ Consider the DFA A given below, ‘Which of the following ure FALSE? 1. Complement of L(A) is context-free. 2 MA) = (C1040 0+ 1)*081%) 3. For the language accepted by A, A is the minimall DFA. +. Aaecepts all strings over (0. 1] of length at least (A) Land 3 only (By2and4only ——(C) Dan Fonly ——(D) 3 and 4 only Q34 A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, ¥, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to ‘memory, and then terminates. Each of the processes Y and Zreads.x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the operation (ie.. wai!) on a counting semaphore 5 and invokes the V operation (ve., signal) on the semaphore § after storing «to memory. Semaphore 5 is initialized to two. What is the maximum possible value of x afterall processes complete execution? wa 2 (By -1 ol (D2 seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 3 COMPUTER SCIENCE & INFORMATION TECH. - CS Q35._ Consider the following relational schema. Stucents(rullne- intezer, sname- string) (Courses{courscno: integer. enarne: string) Registration(gollno: integer, courscno:intezer, percent: real) ‘Which of the following queries are equivalent to this query in English? “Find the distinct names of all students who score more than 90% in the course numbered 107" (1) SELECT DISTINCT S.sname FROM Students as S, Registration as R WHERE R sollno=S rollno AND'R.courseno=107 AND R percent 290 (1D) Plenamel Gccarsena=107 sperentsao (Registration -Studcnts)) (UD) (T | Se Students, 3Re Registration ( S.rollno=R.rollno A R.courseno=107 4 R.percent>90 AT-sname=S sname)) (IV) [ | 3SFRe (e Students n-90)}) (Ay, Ut and tv (B)1, Wand 1m only (©). Wand 1¥ only (D) 1, U1 and 1V only Q.36 Determine the maximum length of the cable (in km) for transmitting data at a raic of S00 Mbps in an Ethemet LAN with frames of size 10,000 bits. Assume the signal spced in the cable to be 2,00,000 km’s, ay (B)2 w25 (Ds Q.37 In an 1Pv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the firs and the last bytes of the payload, respectively are (A) Last fragment, 2400 and 2789 (B) First fragment, 2400 and 2759 (C) Last fragment, 2400 and 2759 (D) Middle fragment, 300 and 689 38 The following figure represents access graphs of two modules MI and M2. The filled circtes represent methods and the unfilled cites represent attributes. If method = is moved to module M2 keeping the attributes where they are, what can we say about the average cohesion and coupling ‘between modules in the system of two modules? He (A) There is no change. (B) Average cohesion goes up but coupling is reduced. (C) Average cohesion goes down and coupling also reduces. (D) Average cohesion and coupling increase. seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 2013 COMPUTER SCIENCE & INFORMATION TECH. - 5 Q39. A cenain computation generates two arrays = and b such that afi1=#(4)for 0 0) [ Pequeve (ah a-m—1 | ‘What is the worst case time complexity of a sequence of m queue operations oa an queue? (ayer (By Gin +b) (€) Onky () 80°) (Consider an instruction pipeline with five stazes without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Feich Operand (FO), Execute Insinuction (ED) and Write Operand (WO). The stage delays for FI, DE, FO, ET end WO arc5 ns, 7 ns, 10 ns, 8 ns and 6 ns, respectively. ‘There ate intermediate storage buffers after euch stage and the delay of cuch buffer is | ns. A Program consisting of 12 instructions 1), 1. 1,, ... Ii. iS executed in this pipelined processor, Instruction 1, is the oaly branch instruction and its branch target is 1, If the branch is taken during the execution of this program, the time (in ns) needed to complete the program is (ays? «B) 165 ©) 176 (p) 328 A RAM chip has a capacity of 1024 words of 8 bits each (1K x 8). The number of 2 x 4 decoders ‘with enable line needed to construct a 16K. 16 RAM from 1K x 8 RAM is are Bs we (D7 Which one of the following is NOT logically equivalent to3x(v y(a) <'vz(A)}? tA) ¥xz08)¥ vl@)) (B) ¥x(v2(f) a y(5a) ©) vey y(a)sazhg)) (D) ¥x(ay(a)+32(58)) sraviding a iece‘o€ kafersetion. 10m ‘Tite denote meee alone: Tide sien be-maed forWew. recruitment .guru 2013, COMPUTER SCIENCE & INFORMATION TECH. - C5 Common Data Questions ‘Common Data for Questions 48 and 49: ‘The following code segment is executed on a processor which allows only register operands in its instructions. Fach instmiction can have atmast two source operands and one destination operand. Assume that all variables are dead after this code sezment crate d-et a e-e+ at e-et ep if (x > ad 4 yoatay , else ( a-a+ dy 48. Suppose the instruction set architecture of the processor has oaly two registers. The only allowed compiler optimization is code motion, which moves statements from one place to another while preserving correciness. What is the minimum number of spills ta memory in the compiled cose? ayo By 2 (D3 Q49° What is the minimum number of registers needed in the instruction set architecture of the processor to compile this code segment without any spill to memory? Do not apply any optimization other than optimizing register allocatia. ays (B+ ws (D6 ‘Common Data for Questions $0 and 51: “The procedure given below is required to find and replace certain characters insicle an input character string supplied in array a. The characters to be replaced are supplied in array oid, while their respective replacement characters are supplied in array ncw=. Amay A has a fixed length of five characters, while anys olde and news conain three characters each. However, the procedure is flawed. veid findand replace (ehar *A, char ‘olde, char *newe) [ fe (ine ino; <5; ite) 37 944) eldetg]) Ald] = newet gly for (int 4-0, ‘The procedure is tested with the following four test cases. (Q) olde - taker, news — "dab" (2) olde = rede", news - @) eldc - "bea", news - “eda” (#) olde ~ “abe, ewe ~ 50. The tester now tests the program.on all input strings of length five consisting of characters *2‘ tb’, ‘ct. td” and Se" with duplicates allowed. If the tester carries out this testing with the: four {est cases given above, how many test cascs willl be able o capture the flaw? (Ay Only one (B) Only two (C) Only tree 4D) All four Q51 trary x is made w hold the string “abcs=", which of the above four test cases will be successful in exposing the flaw in this procedure? (A) None (B) 2only (©) 3 and 4 only (D) 4only ax Cy seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 3 COMPUTER SCIENCE & INFORMATION TECH. - CS Linked Answer Questions Statement for Linked Answer Questions §2 and 53: A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The paze table base register stores the base address of the first-level table (7;), which occupies exactly one page, Each entry of T,stores the base address of a page of the second-level table (T;). Each entry of F; stores the base address of a page of the thint-level table (Z:)- Each entry of T; stores a paze table entry (PTE). The PTE is 32 bits in size. The processor used in the computer has | MB 16-way set associative virtually indexed physically tagged cache. The cache block size is 64 bytes. QS? Whatis the size of a page in KB in this computer? (ay? (B+ os (0) 16 Q.53° What is the minimum number of page colours needed to guarantee that no two synonyms map to different scts in the processor cache of this computer? wn B+ os (D) 16 Statement for Linked Answer Questions $4 and $5: Relation R has eight attributes ARCDEFGH, Fields of & contain only atomic values. F=(CH-G, ABC, B-+CFH, E--A, F+EG) is a set of functional dependencies (FDs) so that #* is exactly the scl oF FDs that hold for R. Q54 How many candidate keys does the relation f have? (as (Byt (os (D6 Q.55- The relation R is (Ayin INF, but not in 2NE_ (B) in2NF, but not in 3NE_ (C) in 3NF, but not in BONE. (D)in BONE. ax roy seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 3 COMPUTER SCIENCE & INFORMATION TECH. - CS General Aptitude (GA) Questions 0.56 to Q.60 carry one mark each. Q56 Which one ofthe following options is the closes Nadir (Ay Highest (By Lowest (©) Medium Q57 Complete the sentence: Universalism isto particularism as diffuscness is to (A) specificity «BY neutrality (C) generality 58 What will be the maximum sum of 44, 42, 40,7 (ayso2 «By S04 (€) 506 59 Were youa bind, you inthe sky. (Ay would fy «B) shall fly (C) should fly Q.60 Choose the grammatically INCORRECT sentence: (A) He is of Asian origin (B) They belonged to Africa. (©) She isan European. (D) They migrated from India to Austral Q.61 to Q.65 carry two marks each, meaning to the word given below? (D) Integration (D) adaptation (D) 500 (D) shall have flown, Q61 Find the sum of the expression 1 1 1 1 + + + i Viet Vie Tae aoe Jet wr (ays 9 «D) 10 Q.62 Out of all the 2-digit intezers between 1 and 100, a 2-digit number has to be selected at random. "What is the probability that the selected number is not divisible by 7? (ay 1390 4B) 1290 (€) 78.90, (D) 7790 ax a sraviding a iece‘o€ kafersetion. ‘Tite denote meee alone: Tide sien be-maed forWew. recruitment .guru 3 COMPUTER SCIENCE & INFORMATION TECH. - CS Q.63 After several defeats in wars, Robert Bruce went in exile and wanted to commit suicide, Just before ‘committing suicide, he came across a spider attempting tirelessly to have its net, Time and again, the spider failed but that did not deter it to refrain from making attempts. Such attempts by the spider made Broce curious. Thus, Bruce started observing the near-impossible goal of the spider to hhave the net. Ultimately, the spider succeeded in having its net despite several failures. Such act of the spider encouniged Bruce not to commit suicide. And then, Bruce went back again and won ‘many abattle, and the rest is history Which onc of the following assertions is best supported by the above information? (A) Failure is the pillar of success, (B) Honesty is the best policy. (C) Life bezins and ends with adventures. (Dy No adversity jusifies giving up hope. Q.64 A tourist covers half of his joumey by train at 60 kmvh, half of the remainder by bus at 30 kivh and the rest by cyele at 10 kivh, The uverage speed of the tourist in kmvh during his entire journey is (Ay36 (B)30 4 (Dy 18 Q.65 The current erection cost of a structure is Rs. 13,200. Ifthe labour wages per day increase by 1/5 of the current wages and the working hours decrease by 1/24 of the current period, then the new cost ‘of erection in Rs. is (A) 16,500, «B) 15,180, (©) 11.000 (D) 10,120 END OF THE QUESTION PAPER ax ro seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 2013 COMPUTER SCIENCE & INFORMATION TECH. - 5 Space for Rough Work ax ro seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 2013 COMPUTER SCIENCE & INFORMATION TECH. - 5 Space for Rough Work ax 1m seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 2013 COMPUTER SCIENCE & INFORMATION TECH. - 5 Space for Rough Work ax ry seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 2013 COMPUTER SCIENCE & INFORMATION TECH. - 5 Space for Rough Work ax 1 seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 2013 COMPUTER SCIENCE & INFORMATION TECH. - 5 Space for Rough Work ax ro seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need BorWew. recruitment .guru 2013 COMPUTER SCIENCE & INFORMATION TECH. - 5 Space for Rough Work seating a Ebeceoe betereot len: cthie deanok an neebes ales thie ee Sec need Bor