South Delhi : 28-A/11, Jia Sarai, Near-IIT Hauz Khas, New ...careerendeavour.com/wp-content/uploads/2016/02/test-4-cs...North Delhi : 33-35, Mall Road, G.T.B. Nagar (Opp. Metro Gate

North Delhi : 33-35, Mall Road, G.T.B. Nagar (Opp. Metro Gate No. 3), Delhi-09, Ph: 011-65462244, 65662255

South Delhi : 28-A/11, Jia Sarai, Near-IIT Hauz Khas, New Delhi-16, Ph : 011-26851008, 26861009

1



2

PAPER-I

1. All of the following advanced principles of child development that are closely allied to the stimulus responselearning theory, except (a) Pavilov (b) J B Waston (c) Hull (d) Gesell

2. All of the following can be signs that a child is gifted, except(a) early development of a sense of time (b) interest in encyclopaedias and dictionaries(c) uneasy relationships with peers. (d) Easy retention of facts

3. Frobel’s most important contribution to education was his development of the (a) vocational school (b) public high school(c) kindergarten (d) Latin School

4. Teacher tenure laws can best be justified because they(a) protect teachers whose political views differ sharply with those of the community(b) Provide for stability of staffing(c) Allow an experienced teacher to plan creatively(d) Protect teachers from excessive requirements of principals

5. Of the following the statement that is least educationally valid is that:(a) heterogeneous grouping is undemocratic(b) Drill periods should be brief(c) Study habits should be taught(d) Overlearning constitutes a waste of time

6. All of the following are evidence of a good class audio-visual programme except:(a) using globes and maps to teach geographic skills and concepts (b) developing a weekly list of recommended television programmes for home viewing(c) teacher previewing of all filmstrips to be shown to the class(d) allowing children to decide which educational television programmes they will view in class

7. Which of the following is not one of the seven major parts to the research report?(a) Results (b) Abstract (c) Method (d) Footnotes

8. When a citation includes more than ____ authors, only the surname of the first author is cited followed byet al.(a) 3 (b) 4 (c) 5 (d) 6

9. Approximately what percentage of scores fall within one standard deviation of the mean in a normaldistribution?(a) 34% (b) 95% (c) 99% (d) 68%

10. A researcher was interested in studying why the “new math” of the 1960s failed. She interviews severalteachers who used the new math during the 1960s. These teachers are considered:(a) Primary sources (b) Secondary Sources(c) External critics (d) Internal critics

11. Analysis of covariance is:(a) A statistical technique that can be used to help equate groups on specific variables(b) A statistical technique that can be used to control sequencing effects(c) A statistical technique that substitutes for random assignment to groups(d) Adjusts scores on the independent variable to control for extraneous variables

12. Which of the following formulae is used to determine how many people to include in the original sampling?(a) Desired sample size/Desired sample size + 1(b) Proportion likely to respond/desired sample size(c) Proportion likely to respond/population size(d) Desired sample size/Proportion likely to respond



3

Direction Q13-18: Study the passage carefully and answer the questionsMARK HUGHES is a master of the fine art of survival. His Los Angeles-based Herbalife InternationalInc. is a pyramid outfit that peddles weight-loss and nutrition concoctions of dubious value. Bad publicityand regulatory crackdowns hurt his U.S. business in the late 1980s. But Hughes, 41, continues to enjoya luxurious lifestyle in a $20 million Beverly Hills mansion. He has been sharing the pad and a yacht withhis third wife, a former Miss Petite U.S.A. He can finance this lavish lifestyle just on his salary and bonus,which last year came to $7.3 million.

He survived his troubles in the U.S. by moving overseas, where regulators are less zealous and consumerseven more naive, at least initially. Today 77% of Herbalife retail sales derive from overseas. Its newprowling grounds: Asia and Russia. Last year Herbalife’s net earnings doubled, to $45 million, on netsales of $632 million. Based on Herbalife’s Nasdaq-traded stock, the company has a market capitalizationof $790 million, making Hughes’ 58% worth $454 million.

There’s a worm, though, in Hughes’ apple. Foreigners aren’t stupid. In the end they know when they’vebeen had. In France, for instance, retail sales rose to $97 million by 1993 and then plunged to $12 millionlast year. In Germany sales hit $159 million in 1994 and have since dropped to $54 million.

Perhaps aware that the world may not provide an infinite supply of suckers, Hughes wanted to unloadsome of his shares. But in March, after Herbalife’s stock collapsed, he put off a plan to dump about athird of his holdings on the public.

Contributing to Hughes’ woes, Herbalife’s chief counsel and legal attack dog, David Addis, quit in January.Before packing up, he reportedly bellowed at Hughes, “I can’t protect you anymore.” Addis, who sayshe wants to spend more time with his family, chuckles and claims attorney-client privilege.

Trouble on the home front, too. On a recent conference call with distributors, Hughes revealed he’sdivorcing his wife, Suzan, whose beaming and perky image adorns much of Herbalife’s literature.

Meanwhile, in a lawsuit that’s been quietly moving through Arizona’s Superior Court, former Herbalifedistributor Daniel Fallow of Sandpoint, Idaho charges that Herbalife arbitrarily withholds payment todistributors and marks up its products over seven times the cost of manufacturing. Fallow also claimsHughes wanted to use the Russian mafia to gain entry to that nation’s market.

Fallow himself is no angel, but his lawsuit, which was posted on the Internet, brought out other complaints.Randy Cox of Lewiston, Idaho says Herbalife “destroyed my business” after he and his wife complainedto the company that they were being cheated out of their money by higher-ups in the pyramid organization.Will Hughes survive again? Don’t count on it this time.

13. Herbalife Inc is based in:(a) Los Angeles (b) Columbus (c) New York (d) Austin

14. Daniel Fallow:(a) Was a former attorney for Hughes (b) Was a former distributor of Herbalife(c) Co-founded Herbalife (d) Ran Herbalife’s German unit

15. Which of the following countries is mentioned where Hughes operated Herbalife?(a) India (b) China (c) Germany (d) Ukraine

16. The complaint of Randy Cox of Lewiston, Idaho, against Herbalife was:(a) The company did not pay them their dues(b) The products supplied by Hughes were inferior(c) Their higher-ups in the pyramid cheated them(d) Hughes had connections with the Russian mafia



4

17. Which of the following countries is NOT mentioned in the passage?(a) Russia (b) USA (c) France (d) Italy

18. In the year in which Hughes’ salary and bonuses came to US$ 7.3 million, what was the retail sales forHerbalife in France?(a) $12 million (b) $159 million (c) $54 million (d) $97 million

19. If people at your firm tell you that you have a great speaking voice because during your sales presentationsyou expressed your feelings by making your voice higher or lower, they are referring to the vocalcharacteristic known as:(a) Tempo (b) Rhythm (c) Pitch (d) None of these

20. Masculine conversational styles are characterized by:(a) Topic control (b) Hedging(c) Tag question (d) All of these

21. The quality of personal relationships in an organization is described by which term?(a) Communication climate (b) Conflict management(c) Negotiation style (d) Positive Relation

22. Which of the following identifiers describe disconfirming messages?(a) Descriptive (b) Equal(c) Concerned with another’s position (d) Indifferent

23. Planning an interview involves:(a) Identifying the other party (b) Defining the goal(c) Choosing the interview structure (d) All of the these

24. As you are sitting in the classroom, a fire engine pulls onto campus with its lights on and sirens blaringloudly. This commotion which caused a distraction for the students and course instructor is called:(a) Physical noise (b) psychological noise(c) Social Noise (d) Environmental stress

25. Which term comes next in the sequence : nd iy dt yo tj?(a) mp (b) nq (c) of (d) oe

26. Cattle is related to Herd in the same way as Fish is related to(a) Shoal (b) Herd (c) Flock (d) None of these

27. In a garden, there are 10 columns and 12 rows of mango trees. The distance between the two trees is 2metres and a distance of one metre is left from all sides of the boundary of the garden. The width of thegarden is:(a) 20m (b) 22m (c) 24m (d) 26m

28. Find the day on march 4th 2007(a) Saturday (b) Sunday (c) Monday (d) Friday

29. Find the next term in the series, 3, 10, 24, 50, 120,...(a) 170 (b) 145 (c) 226 (d) 168

30. The average marks in maths of a class of 24 students is 35. If the marks of the topper be included, theaverage rises by 0.4. The marks of the topper is :(a) 45 (b) 50 (c) 53 (d) 55

31. Statements :1. All books are cakes. 2. All cakes are apples.Conclusions :I. Some cakes are books. II. No cake is book.III. Some apples are books. IV. All apples are books.(a) Only I follows (b) Only either I or II follows(c) Only I and III follow (d) Only either III or IV follows



5

32. Statement : Sealed tenders are invited from competent contractors experienced in executing constructionjobs.Conclusions :I. Tenders are invited only from experienced contractors.II. It is difficult to find competent tenderers in construction jobs.Give answer(a) if only conclusion I follows; (b) if only conclusion II follows;(c) if either I or II follows; (d) if neither I nor II follows

33. Consider the following claim and determine which of the types of claims below it matches: "Some birdscan't fly."(a) A (b) E (c) O (d) I

34. Which of the following most closely resembles the reasoning given in this argument? "Every successfulmechanic uses cast-iron wrenches. Some mechanics use wrenches made of something besides cast iron.So some mechanics are not successful."(a) All valid syllogisms are incapable of surprising you. Some syllogisms are not at all able to surprise you.

So some syllogisms are not valid.(b) Everything worth doing is worth doing right. Everything boring is not worth doing right. So boring

things are not worth doing.(c) Every good bicycle has hand brakes. Some messengers' bikes are not good bicycles. So some mes-

sengers' bikes don't have hand brakes.(d) A tape recorder is a sophisticated piece of equipment. Some home appliances are unsophisticated

pieces of equipment. Therefore, some home appliances are not tape recorders.35. Which of the following types of claims can you perform contraposition on and end up with a logically

equivalent claim?(a) E and I (b) A, E, I, and O (c) A and O (d) I and O

36. Which of the following is true of contradictory claims?(a) They can both be false but they can't both be true.(b) They can both be true and false.(c) They can both be true but they can't both be false.(d) They always have opposite truth values.Directions (Q. 37-41): Study the following graph carefully to answer the questions:Number (in thousands) of products manufactured and sold by a company over the years.

37. What is the difference between the number of products manufactured by the company in the year 2009andthat in 2008?(a) 4000 (b) 5500 (c) 5000 (d) 4500



6

38. The number of products sold by the company in the year 2004 is what per cent of the number of productsmanufactured by it in that year? (rounded off to two digits after decimal)(a) 71.43 (b) 67.51 (c) 81.67 (d) 56.29

39. What is the per cent increase in the number of products sold by the company in the year 2006 from theprevious year? (rounded off to two digits after decimal)(a)19.25 (b) 33.33 (c) 10.45 (d) 42.66

40. What is the rat io of t he number of product s no t so ldby the company in the year 2007 to that not sold in the year 2005?(a) 3 :1 (b) 6 : 5 (c) 1 : 3 (d) 5 : 6

41. What is the approximate average number of products manufactured by the company over all the yearstogether?(a) 36550 (b) 39480 (c) 41220 (d) 43330

42. Find the odd one out(a) Political map (c) Isopleth (c) Choropleth (d) Chorochromatic

43. Which is the type of port:(a) Serial (b) Parallel (c) AGP (d) All of these

44. Parallel Port can not connect:(a) Printers (b) Scanners (c) Telephones (d) Monitors

45. Find the odd one out(a) facebook (b) Orkut (c) Hi5 (d) Bing

46. Find the 2’s complement of (-29)10(a) 11101 (b) 11100010 (c) 11100011 (d) None of these

47. USB stands for:(a) United Serial Bus (b) Universal Serial By-Pass(c) Universal System Bus (d) Universal Serial Bus

48. Which is the fastest port for data transfer:(a) USB (b) Serial (c) Parallel (d) FireWire

49. Acid rains are produced by(a) excess NO2 and SO2 from burning fossil fuels(b) excess production of NH3 by industry and coal gas(c) excess release of carbon monoxide by incomplete combustion(d) excess formation of CO2 by combustion and animal respiration.

50. What is true of ecosystem?(a) primary consumers are least dependent upon producers(b) primary consumers out-number producers(c) producers are more than primary consumers(d) secondary consumers are the largest and most powerful.

51. The relation between algae and fungi in lichen is(a) symbiosis (b) parasitism (c) commenalism (d) protocooperation.

52. Deforestation will decrease(a) soil erosion (c) soil fertility (b) land slides (d) rainfall.

53. Renewable source of energy is(a) biomass (b) coal (c) petroleum (d) kerosene.

54. Pick up the correct food chain(a) grass —> chamelion —> insect —> bird(b) grass —> fox —> rabbit —» bird(c) phytoplankton —> zooplankton —> fish(d) fallen leaves —> bacteria —> insect larvae.



7

55. Who adopted the constitution of India on 26th November 1949.(a) People of India(b) Parliament of India(c) Representative of the people of India in constituent Assembly(d) Cabinet

56. Which of the following are correct regarding the formation of states and its alterations, The parliament bylaw(i) Form a new State by separation of territory from any State or by uniting two or more State(ii) diminish the area of any State;(iii) alter the boundaries of any State(iv) alter the name of any State(a) i, ii and iv (b) i, ii, iii, (c) ii and iv (d) all of the above

57. Which of the following directive principles come into category of liberal principles(i) The state shall endeavor to secure a uniform civil code throughout the territory of India(ii) The state shall protect every monument or place or object of artistic or historic importance(iii) The state shall try to secure all workers a living wage and conditions of work ensuring a decentstandard of living(iv) The state shall take steps to separate the judiciary from the executive(a) i, ii, iii (b) i, ii, iv (c) ii, iii, iv (d) all of the above

58. Democracy exists in India, without peoples participation and co operation democracy will fail. This impliesthat(a) Government should compel people to participate and cooperate with it(b) People from the government(c) People should participate and cooperate with the government(d) India should opt for the presidential system

59. Which of the following are missions of NAAC?(i) To arrange for periodic assessment and accreditation of institutions of higher education or units thereof,or specific academic programmes or projects;(ii) To stimulate the academic environment for promotion of quality of teaching-learning and research inhigher education institutions;(iii) To encourage self-evaluation, accountability, autonomy and innovations in higher education;(iv) To undertake quality-related research studies, consultancy and training programmes, and(v) To collaborate with other stakeholders of higher education for quality evaluation, promotion andsustenance.(a) i, ii and v (b) ii, iii, iv, and v (c) None of these (d) All of these

60. Inter University Centre for International Studies is situated at(a) JNU, New delhi (b) Delhi University(c) Osmania University (d) Pune University



8

PAPER-II

1. For the given floating point representation if S, e, M represent sign, exponential and mantissa then therange of exponential is

(a) 1 1[2 1] to [2 1]e e (b) 1 1[2 ] to [2 1]e e

(c) 1 1[2 ] to [2 ]e e (d) 1[2 ] to [2 1]e e 2. For the given Johson counter n bit representation the total numbers of used state is given by

(a) 2n (b) 2n (c) 2n–1 (d)2

2n

3. For the given digital circuit shown determine the output expression

XY

ZP

Y

(a) x y z (b) xy (c) x x (d) xx

4. To schedule the processes, they are considered _________.(a) infinitely long (b) periodic (c) heavy weight (d) light weight

5. If the period of a process is ‘p’, then the rate of the task is :(a) p^2 (b) 2*p (c) 1/p (d) p

6. Consider a uniprocessor system executing three tasks T1, T2 and T3, each of which is composed of aninfinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds,respectively. The priority of each task is the inverse of its period, and the available tasks are scheduled inorder of priority, with the highest priority task scheduled first. Each instance of T1, T2 and T3 requires anexecution time of 1, 2 and 4 milliseconds, respectively. Given that all tasks initially arrive at the beginningof the 1st millisecond and task preemptions are allowed, the first instance of T3 completes its executionat the end of _____________ milliseconds.(a) 10 (b) 11 (c) 12 (d) 13

7. Which of the following condition is required for deadlock to be possible?(a) mutual exclusion(b) a process may hold allocated resources while awaiting assignment of other resources(c) no resource can be forcibly removed from a process holding it(d) all of the mentioned

8. Match the following:A. Presentation Layer i. Provides access for the end userB. Data link layer ii. Ensures relaible transmission dataC. Application Layer iii. Format and code conversionD. Transport layer iv. Reliable process to process message delivery(a) A-i, B-iii, C-iv, D-ii (b) A-iii, B-ii, C-i, D-iv(c) A-iii, B-iv, C-i, D-ii (d) A-iii, B-i, C-ii, D-iv

9. Match the following:A. FTP i. 21B. BOOT P ii. 25C. DNS iii. 53D. SMTP iv. 67(a) A-i, B-iii, C-iv, D-ii (b) A-i, B-iv, C-iii, D-ii(c) A-i, B-ii, C-iii, D-iv (d) A-iii, B-iv, C-ii, D-i



9

10. In the IPv4 addressing format, the number of networks allowed under class B address is(a) 214 (b) 216 (c) 221 (d) None of these

11. Select operation in SQL is equivalent to(a) the selection operation in relational algebra(b) the selection operation in relational algebra, except that select in SQL retains duplicates(c) the projection operation in relational algebra(d) the projection operation in relational algebra, except that select in SQL retains duplicates

12. Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then maximum andminimum sizes of the join respectively are(a) m + n and 0 (b) m • n and 0 (c) m + n and | m – n | (d) m • n and m + n

13. Consider a relation R(A, B, C, D, E, F, G, H) with the functional dependency setF {CH G, A BC, B CFH, E A, F EG} How many candidate keys will exist in R(a) 2 (b) 3 (c) 4 (d) 5

14. Consider a relation R(A, B, C, D, E) with functional dependencies F {A B, B C, C DE} is de-composed into R1 (A, B, C) and R2 (A, D, E).(a) Decomposition is lossy and dependency preserving(b) Decomposition is lossy and not dependency preserving(c) Decomposition is loss-less and dependency preserving(d) Decomposition is loss-less and not dependency preserving

15. Find the false statement(a) Each BCNF relation is in 3NF(b) A relation with two simple attributes is in 1NF, 2NF, 3NF and BCNF(c) A relation with cyclic functional dependency is in 1NF, 2NF, 3NF and BCNF(d) Loss-less, dependency preserving decomposition into BCNF is always possible

16. Which two models doesn’t allow defining requirements early in the cycle?(a) Waterfall & RAD (b) Prototyping & Spiral(c) Prototyping & RAD (d) Waterfall & Spiral

17. Which test refers to the retesting of a unit, integration and system after modification, in order to ascertain thatthe change has not introduced new faults?(a) Regression Test (b) Smoke Test(c) Alpha Test (d) Beta Test

18. The bit string for the set {2, 4, 6, 8, 10} (with universal set of natural numbers less than or equal to 10)is ____________________.(a) 0101010101 (b) 1010101010 (c) 1010010101 (d) 0010010101

19. Which one of the following statements is incorrect ? (a) The number of regions corresponds to the cyclomatic complexity.(b) Cyclometric complexity for a flow graph G is V(G) = N–E+2, where E is the number of edges and N

is the number of nodes in the flow graph.(c) Cyclometric complexity for a flow graph G is V(G) = E–N+2, where E is the number of edges & N

is the number of nodes in the flow graph.(d) Cyclometric complexity for a flow graph G is V(G) = P + 1, where P is the number of predicate nodes

contained in the flow graph G.



10

20. How many relations are there on a set with n elements that are symmetric and a set with n elements thatare reflexive and symmetric ? (a) 2n(n+1)/2 and 2n.3n(n–1)/2 (b) 3n(n–1)/2 and 2n(n–1)

(c) 2n(n+1)/2 and 3n(n–1)/2 (d) 2n(n+1)/2 and 2n(n–1)/2

21. What is the correct value to return to the operating system upon the successful completion of a program?(a) -1 (b) 1(c) 0 (d) Programs do not return a value.

22. What is the only function all C++ programs must contain?(a) start() (b) system() (c) main() (d) program()

23. What will be printed as the output of the following program? public class testincr { public static void main(String args[]) { int i = 0; i = i++ + i; System.out.println(“I = “ +i); } }

(a) I = 0 (b) I = 1 (c) I = 2 (d) I = 3

24. What is the output of the following program: public class testmeth { static int i = 1; public static void main(String args[]) { System.out.println(i+” , “); m(i); System.out.println(i); } public void m(int i) { i += 2; } }

(a) 1 , 3 (b) 3 , 1 (c) 1 , 1 (d) 1 , 025. In the following code fragment, Q is a queue of integers:

Q.insert(1);while ( !Q.isEmpty() ) {

int f = Q.getFront();if (f > 10)f = Q.dequeue();

elseQ.enqueue(f+1);

}The last time through this loop, what value is removed from the queue?(a) 9 (b) 10 (c) 11 (d) can’t tell—infinite loop



11

26. Which of the following statements is true for all depth first search traversals of the following graph starting atvertex 1?

15

2

37

64

(a) Vertex 3 cannot be visited immediately before vertex 5.(b) Vertex 3 must be visited before vertex 6.(c) Vertex 2 must be the second vertex visited.(d) Vertex 6 cannot be visited before vertex 5.

27. Consider the following graph. Which edges, and in which order, are selected by Prim’s algorithm if it stars atvertex 1?

2

71

4 5 6

3

2 4

1 5

3 67

910

8

(a) (1,3), (1,2), (3,6), (2,7), (3,5), (1,4) (b) (1,3), (1,2), (3,6), (2,7), (3,7), (7,6)(c) (1,3), (3,6), (1,2), (2,7), (3,5), (1,4) (d) (1,2), (1,3), (3,6), (2,7), (3,7), (7,6)

28. The following algorithm performs a postorder traversal of a proper binary tree and modifies some of the keysstored in the nodes. In the initial call r is the root of the tree.

6

1

1

3

3

143

6

Algorithm traverse2(r)Input : Root r of a proper binary tree.if r is an internal node then {

traverse2(left child of r)traverse2(right child of r)if (key stored in left child of r) = (key stored in right child of r) thenincrease the key stored in r by 1else decrease the key stored in r by 1

}Assume that algorithm traverse2 is performed over the following tree. After the execution of the algorithm howmany nodes will store the key value 2?(a) 1 (b) 2 (c) 3 (d) 4

29. Let T be a proper binary tree (so each internal node has 2 children) with 7 nodes: a,b,c,d,e,f,g.A preorder traversal of T visits the nodes in this order: d,b,c,e,a,g,f.An postorder traversal of T visits the nodes in this order: b,a,g,e,f,c,d.Which node is at a distance 3 from the root of T? (Hint. In tree T, node c is the right child of node d.)(a) a (b) b (c) c (d) d



12

30. Assume compression ratio of image is 1

2

nn then what is the redundancy?

(a) 112

n

(b) 2

11 n

n (c) 21 n (d) 1

21 n

n31. Transformation between RGB to CMYK coloring scheme represent by

(a)

111

L RM GY B

(b)

256256256

L RM GY B

(c)

222

L RM GY B

(d) None of the above

32. Which one of the following permutations of {1,2,3} is in lexicographic order?(a) 123 132 213 231 312 321 (b) 123 132 312 321 231 213(c) 123 132 231 213 312 321 (d) 123 132 213 231 321 312

33. Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining.The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum, minimum, andaverage chain lengths in the hash table, respectively, are(a) 3, 0, and 1 (b) 3, 3, and 3 (c) 4, 0, and 1 (d) 3, 0, and 2

34. You are given a hash table with n keys and m slots with the simple uniform hashing assumption. Collision areresolved by chaining. What is the probability that the first slots end up emtpy.

(a) n1

m

(b) nm 1

m

(c) mn 1

n

(d) mm 1

m

35. Consider the following statements(I) The sequence <20, 15, 18, 7, 9, 5, 12, 3, 6, 2> forms a max heap.(II) Given a hash table with more slots than the keys the collision resolution by chaining the worst case runningtime of a look is constant time.(III) There exists a comparision sort of 5 numbers that uses almost comparisions in the worst case.(IV) Relax operation sometimes increases the shortest path estimate.Which of the above is TRUE(a) I, II (b) II, III (c) III, IV (d) None of these

36. Given a set S = {A BC, CD E, C F, E F} of FD’s Which set of FD’s below follows from S?(a) <A BF, A CF, A ABCF> (b) <A BD, A CF, A ABCF>(c) <A BD, A BF, A ABCF> (d) <A BD, A BF, A CF>

37. Given a relation R(A, B, C, D, E, F) and an FD set

F = <A BCE, C D, BD F, EF B, BE A>A>Which is not a lossless-join decomposition of R?(a) R1(B, D, F), R2(A, B, C, D, E)(b) R1(A, B, C, E, F), R2(C, D)(c) R1(A, B, C, E, F), R2(C, D), R3(B, D, F)(d) R1(B, E, F), R2(A, C, E), R3(C, D)



13

38. Consider the following program :

void nontail ( int ){nontail ( x-2 );print(“%d” , x);nontail( x-1 );

}What is the output if invocation is nontail(5);(a) 32152141321 (b) 123141321 (c) 132151321 (d) 132152141321

39. Let A be a square matrix of size n x n. Consider the following program. What is the expected output?C = 100

for i = 1 to n do for j = 1 to n do { Temp = A[i][j] + C A[i][j] = A[j][i] A[j][i] = Temp - C }

for i = 1 to n do for j = 1 to n do Output(A[i][j]);

(a) The matrix A itself(b) Transpose of matrix A(c) Adding 100 to the upper diagonal elements and subtracting 100 from diagonal elements of A(d) None of the above

40. Consider the languages 1 0 1 | ! i jL i j , 2 0 1 | i jL i j , 3 0 1 | 2 1 i jL i j ,

4 0 1 | ! 2 i jL i j . Which one of the following statements is true?

(a) Only L2 is context free(b) Only L2 and L3 are context free(c) Only L1 and L2 are context free(d) All are context free

41. Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum numberof states in a non-deterministic finite automaton that accepts L?(a) n-1 (b) n (c) n+1 (d) 2n-1

42. Consider the following function.int f () {int k, result;result = 0;for ( k = 0; k < 5; k++ ) {if ( ( k % 3 ) == 1 )result = result + k;elseresult = result + 1; }return result; }What value is returned as a result of the call f () ?(a) 5 (b) 6 (c) 7 (d) 8



14

43. A full binary tree is a rooted tree in which every internal node has exactly two children. How many internalnodes are there in a full binary tree with 500 leaves?(a) 250 (b) 499 (c) 500 (d) 501

44. Consider the following algorithm:Algorithm T(r)Input : Root r of a proper binary tree.if r is a leaf then return 0else {p T(left child of r)q T(right child of r)if p > q then return p + 1else return q + 1}What does the algorithm compute?(a) The number of internal nodes in the tree.(b) The number of descendants of r.(c) The number of nodes in the largest subtree of r.(d) The height of the tree.

45. Consider the grammar defined by the following production rules, with two operators * and +S T * PT U | T * UP Q + P | QQ IdU IdWhich one of the following is TRUE?

A (a) + is left associative, while * is right associativeB (b) + is right associative, while * is left associativeC (c) Both + and * are right associative

(d) Both + and * are left associative

46. Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*

A (a) (b) (c) *a (d) , a

47. Consider the following function.f(k) {x = 2;for i = 1 to kx = x * x;return x;}If n and k are positive integers, then the least value of k such that f(k) > n is approximately(a) log2 (log2 n) (b) log2 n (c) n (d) nlog2 n

48. Assume that any n-bit positive integer x is stored as a linked list of bits so that the first element of the list is theleast significant bit. For example, x =14 =(1110)2 is stored as the linked list 0, 1, 1, 1 of size n =4.For this data structure, the operation that replaces x by can be done in(a) O(1) steps (b) O(log n) steps (c) O(n)steps (d) O(n log n) steps



15

49. Consider a regular language L over 0, 1 . Which of the following languages over 0, 1 must also be regular?

(I) { wL length of w is even }(II) { wL the length of w is prime }(III) { wL the length of w is an integer power of 2 }(a) None (b) I only (c) III only (d) I and III only

50. In the graph below, each edge label represents the probability that the connection between its endpoints isworking. If these probabilities are mutually independent, what is the probability that there is a path of workingedges from S to T ?

1

½

½

S T

1

½

½

1/3

1/3

(a) 5

12 (b) 59 (c)

23 (d)

56



1



2

PAPER-III

1. For the given ALP the initial address load in PC is 1000H. Determine the content of PC after HLTinstruction

MOV A, BL × I SP, 6015OUT FFHLT

(a) 1006 (b) 1007 (c) 1008 (d) 10092. For the given instruction LDA the addressing mode is

(a) Direct (b) Immediate (c) Indirect (d) Imphicet

3. An controlled invertor is represented by(a) EXNOR Gate (b) EXOR Gate(c) Coincidence circuit (d) All of the above

4. For the given circuit diagram determine the count sequence after next clk pulse.

D

0

D

0 1

J Q

K Q0

1

1

D1

(a) 0010 (b) 1001 (c) 1011 (d) 1100

5. The feasible region of the LPP

maximize, 1 23 2z x x subject to the constraints.

1 2 1 1 2 1 22 1, 2, 3, , 0x x x x x x x

(a) polygon (b) line segment (c) unbounded (d) no feasible region

6. Which of the following is not correct?(a) if the primal is a maximization problem, its dual will be a minimization problem(b) the dual to the given LPP would have as many variables as the number of constraints in the primal.(c) for a three variable and two constraints primal problem, the dual would be a two variable and threeconstraints problem.(d) if a primal variable is non-negative, the corresponding dual constraint will be an equation.

7. The minimum total man-hours to the follownig assignment problem

9 26 1513 27 635 20 1518 30 20

Man

Task A B CIIIIIIIV

is

(a) 35 hours (b) 36 hours (c) 28 hours (d) 40 hours8. In paging the user provides only ________, which is partitioned by the hardware into ________ and

______.(a) one address, page number, offset (b) one offset, page number, address(c) page number, offset, address (d) None of these



3

9. Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations perminute (RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a filestored in the disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek,and the average rotational latency for accessing each sector is half of the time for one complete rotation.The total time (in milliseconds) needed to read the entire file is ____________.(a)14020 (b)10987 (c)76412 (d)10204

10. Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20,90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is on track 50. The additionaldistance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm isused compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards 100when it starts execution) is____________ tracks(a) 9 (b)10 (c)11 (d)12

11. Consider the following sequence of micro-operations.MBR PCMAR XPC YYMemory MBRWhich one of the following is a possible operation performed by this sequence?(a) Instruction fetch (b) Operand fetch(c) Conditional branch (d) Initiation of interrupt service

12. For computers based on three-address instruction formats, each address field can be used to specifywhich of the following:(S1) A memory operand(S2) A processor register(S3) An implied accumulator register(a) Either S1 or S2 (b) Either S2 or S3 (c) Only S2 and S3 (d) All of S1, S2 and S3

13. A computer on a 10 Mbps network is regulated by token bucket. The token is filled at a rate of 2 Mbps. It isinitially filled to capacity with 16 mega bits. What is the maximum duration for which the computer can transmitat the full 10 Mbps ?(a) 1.6 seconds (b) 5 seconds (c) 8 seconds (d) 2 seconds

14. Consider a network with five nodes, N1 to N5 as shown below:

N5

N4

N2

N1

N3

3

4 6

2

1

The network uses a distance vector routing protocol. Once the routes have stabilized, what will be the distancevector at node N4.(a) 7, 6, 0, 2, 6 (b) 8, 7, 2, 0, 4 (c) 8, 6, 4, 0, 4 (d) 8, 7, 2, 2, 4

15. In an IPv4 packet, the value of HLEN is 1000 in binary. How many bytes of options are being carried by thispacket ?

(a) 20 (b) 32 (c) 12 (d) 40



4

16. In function point analysis, number of general system characteristics used to rate the system are(a) 10 (b) 14 (c) 20 (d) 12

17. Compute function point value for a project with the following domain characteristics: No. of I/P = 30,No. of O/P = 62, No. of user Inquiries = 24, No. of files = 8, No. of external interfaces = 2 Assume thatall the complexity adjustment values are average. Assume that 14 algorithms have been counted.(a) 663 (b).663 (c) 0.663 (d)0.06633

18. If P is risk probability, L is loss, then Risk Exposure (RE) is computed as(a) RE = P/L (b) RE = P + L (c) RE = P*L (d) RE = 2* P *L

19. Theoretically , how many 1.25 MHz carriers are there in a CDMA cell?(a) 18 (b) 22 (c) 9 (d) 64

20. What are the three Vs of Big Data?(a) Volume, Variety, Velocity (b) Volume, Velocity, Version(c) Version,Variety, Volume (d) Version,Variety,Velocity

21. Internet Protocol version 6 (IPv6) is(a) The 128 bits of an IPv6 address are represented in 8 groups of 16 bits each.(b) host-names are mapped to IPv6 addresses quad-A records.(c) avoids triangular routing(d) All of the above

22. Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair ofvertices is ½. What is the expected number of unordered cycles of length three?(a) 1/8 (b) 1 (c) 7 (d) 8

23. Let Ai = {i, i+1, i+2, …..}. Then set {n, n+1, n+2, n+3, …..} is the _________ of the set Ai.(a) Union (b) Intersection (c) Set Difference (d) Disjoint

24. Which command is used to display the unix version(a) uname -r (b) uname -n (c) uname -t (d) kernel

25. Which command is used to change protection mode of files starting with the string emp and ending with1,2, or 3?(a) chmod u+x emp[1-3] (b) chmod 777 emp*(c) chmod u+r ??? emp (d) chmod 222 emp?

26. Which command is used to make all files and sub-directories in the directory (progs) executable by allusers?(a) chmod -R a+x progs (b) chmod -R 222 progs(c) chmod -1 a+x progs (d) chmod -x a+x progs

27. A tool for reading XML documents is popularly called a .....................(a) XML delimiters (b) XML processor (c) XML parser (d) Both b and c

28. E-commerce infrastructure involves (a) Web servers (b) E-catalogs (c) Network (d) All of these

29. The truth values of traditional set theory is ____________ and that of fuzzy set is __________(a) Either 0 or 1, between 0 & 1 (b) Between 0 & 1, either 0 or 1(c) Between 0 & 1, between 0 & 1 (d) Either 0 or 1, either 0 or 1

30. If two fuzzy sets A and B are given with membership functions m(A(x)) = {0.2, 0.4, 0.8, 0.5, 0.1}m(B(x)) = {0.1, 0.3, 0.6, 0.3, 0.2} Then the value of m((A)B)C) will be(a) {0.9, 0.7, 0.4, 0.8, 0.9} (b) {0.2, 0.4, 0.8, 0.5, 0.2}(c) {0.1, 0.3, 0.6, 0.3, 0.1} (d) None of these



5

31. A 4-input neuron has weights 1, 2, 3 and 4. The transfer function is linear with the constant of proportionalitybeing equal to 4. The inputs are 4, 10, 5 and 20 respectively. The net output will be:(a) 238 (b) 76 (c) 119 (d) None of these

32. Assume that you are given a chain of matrices < A1 A2 A3 A4 >, with dimensions 2 × 5, 5 × 4, 4 × 2and 2 × 4 respectively. Compute the optimal number of multiplications required to calculate the chainproduct.(a) 82 (b) 72 (c) 90 (d) 85

33. If all the edge cost of the uniform cost search is constant then it will behave like(a) BFS (b) DFS(c) A* (d) Best First search

34. In 2- Player game pruning is done when(a) (b) (c) (d) !

35. Which of the following sets of codewords could be the Huûman code for some 4 symbol source alphabet?(a) 01, 10, 00, 111, (b) 0, 10, 110, 111,(c) 1, 01, 10, 001, (d) 0, 110, 111, 101.

36. Which is taotology

(a) p p q q (b) p q q p

(c) q p q p (d) All of these

37. The number of elements that can be sorted in log n time using heap sort is

(a) 1 (b) log n (c) log / log log n n (d) log n

38. The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of thefollowing is the postorder traversal sequence of the same tree? (a) 10, 20, 15, 23, 25, 35, 42, 39, 30(b) 15, 10, 25, 23, 20, 42, 35, 39, 30(c) 15, 20, 10, 23, 25, 42, 35, 39, 30(d) 15, 10, 23, 25, 20, 35, 42, 39, 30

39. Let a, b . Then an automaton A accepting only those words from having an even number of a’ssrequires ______ states including start state.(a) 3 (b) 15 (c) 6 (d) 4

40. Consider the following statement

(I) The depth of a BFS tree on an undirected graph G V, E from an arbitrary vertex v V is the diameterof the graph G.(II) Every directed acyclic graph has exactly one topological ordering.

(III) Give a graph G V, E with positive edge weights. The Bellman ford algorithm and Dijkstra’s algorithmcan produce different shortest path tree despite always producing the same shortest path weightsWhich of the following is FALSE(a) I (b) II (c) III (d) I, II

41. Suppose the relation R(A, B, C, D, E) has minimal keys AC and BC Which FD does not necessarily hold?

(a) ABC DE (b) AC BDE (c) AB DE (d) BC DE



6

42. What is the channel capacity of BSC

(a) 1 Plog P 1 P log 1 P (b) 1 Plog P 1 P log 1 P

(c) 1 Plog P P 1 log P 1 (d) 1 Plog P P 1 log 1 P

43. Consider a DMSx with symbols, ix , i 1, 2,3, 4 . The following table list all 4 possible binary codes.

i

1

2

3

4

x Code A Code B Code C Code Dx 00 0 0 0x 01 10 11 100x 10 11 100 110x 11 110 110 111

Which of the above code satisfy the kraft inequality.(a) A, B, C, D (b) B, C, D (c) A, C, D (d) A, B, D

44. The predicate logic equivalent of the above statement is “Any person can fool some of the people all of thetime, all of the people some of the time but not all of the people all of the time.”

(a)

Person Person Fools , , Person Fools , ,

Person Fools , ,

x x y t y x y t t y y x y t

t y x x y t

(b)


Person Fools , ,


t y x x y t

(c)


Person Fools , ,


t y y x y t

(d) None of these

45. Consider the following statementsi) If f(n) = O g(n) and g(n) = O (h(n)) then f(n) = (h(n))ii) A binary search tree on n integer keys in the range from 1 to n2 can be constructed in O(n) worst-case time.iii) Kruskal’s algorithm of finding a minimum spanning tree of a weighted undirected graph is an example of adynamic programming algorithm.iv) The transitive closure of a directed graph G = (V, E) can be computed in O(v2) time by the Floyd-Warshallalgorithm, which repeatedly squares the adjacency matrix of G.v) The (log n) th smallest number of n unsorted numbers can be determined in O(n) worst-case time.Which of the above statements are correct(a) i ,iv (b) ii,iii (c) iii, iv (d) i , ii ,iii, iv, v

46. Consider the following StatementsI. The worst-case running time randomized quicksort on an array of length n is (n2).II. The recurrence for merge sort algorithm can be written as T(n) = 2T(n/2) + (n)III. The time complexity of the Heapify algorithm is O(n)IV. The asymptotically tight upper bound for T(n) = T(n-2) + 1 is O (log n).Which of the above is/are correct?(a) I,II (b) II (c) I, II, III (d) I,II,III,IV



7

47. For the above graph how many MST are Possible

2

2

2

2 2

2

2

2

111

1 1

(a) 5 (b) 6 (c) 8 (d) 1048. Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph.

In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P,NP and NP Complete (NPC)?

(A) P

NP

NPC (B)

NPP

NPC

(C) P = NP

NPC(D)

N =NP=NPC

Which of the above figure is correct?(a) A (b) B (c) C (d) D

49. Consider two strings A = “qpqrr” and B = “pqprqrp”. Let x be the length of the longest common subsequence(not necessarily contiguous) between A and B and let y be the number of such longest common subsequencesbetween A and B. Then x + 10y = ___.(a) 33 (b) 34 (c) 35 (d) 36

50. Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirectedgraph. The tree T formed by the tree arcs is a data structure for computing.(a) the shortest path between every pair of vertices.(b) the shortest path from W to every vertex in the graph.(c) the shortest paths from W to only those nodes that are leaves of T.(d) the longest path in the graph

51. For each of the following statements, state if the statement is valid or not.

In all examples, the variables x, y range over the set R of all real numbers.

(1) 2. x x x (2) 2. . x y x y (3) 2. . x y x y

(4) 2. . x y y x x x (5) . . 1 x y x y

(a) 1, 2, 4 (b) 1, 3, 4 (c) 2, 3, 5 (d) 1, 2, 3, 4, 552. Which of the following algorithm consider the difference between the current state and goal state?

(a) A* (b) Bidirectional Search(c) MEA (d) Beam Search



8

53. The negation of p q is

(a) p q (b) p q (c) p q (d) Both (a) and (b)

54. Consider the following grammar:|S bS a . This grammar is:

(a) SLR(1) but not LL(1) (b) LL(1)(c) not SLR(1) (d) none of these

55. Consider the following grammar:

||

||

S bAb bBaA aS CBB b BcC c cC

Which of the following is a reason why this grammar cannot be LL(1)?[Choose all that apply](a) This grammar has right recursion. (b) This grammar is ambiguous.(c) This grammar has left recursion. (d) This grammar is not right factored.

56. Which one of the following statement is TRUE

(a) I X, Y H X H Y H X, Y (b) I X, Y H X H Y H X, Y

(c) I X, Y H X H Y H X, Y (d) I X, Y H X H Y H X, Y

57. Suppose RGB raster system is to be designed using on 8 inch X 10 inch screen with a resolution of 100pixels per inch in each direction. If we want to store 6 bits per pixel in the frame buffer, how much storage(in bytes) do we need for frame buffer?(a) 600000 bytes (b) 500000 bytes (c) 400000 bytes (d) none of these

58. Reflection of a point about x-axis, followed by a counter-clockwise rotation of 900, is equivalent toreflection about the line ?(a) x= -y (b) x=0 (c) x=y (d) x+y=1

59. A discrete memoryless source with alphabets 0 1 2x s ,s ,s with respective probabilities 01P4

, 11P4

and 21P2

. What is the value of extended H(x)10.

(a) 20 bits/symbol (b) 10 bits/symbol (c) 15 bits/symbol (d) 40 bits/symbol

60. Which of the following are regular sets?

(I) 2 | 0, 0n ma b n m (II) 2 | 2n ma b n m

(III) 2 |n ma b n m (IV) | , , *xcy x y a bA (a) I and IV only (b) I and III only (c) I only (d) IV only61. Consider the finite automaton in the following figure

q0 q1 q2 q31 0,1 0,1

0,1 1

What is the set of reachable states for the input string 0011?(I) {q0, q1, q2} (II) {q0, q1} (III) {q0, q1, q2, q3} (IV) {q3}(a) Only (I) (b) Only (II) (c) Both (I) and (II) (d) Neither (I) nor (II)



9

62. An Euler circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Whichof the following undirected graphs must have an Euler circuit?(I) A complete graph with 12 vertices(II) A complete graph with 13 vertices(III) A tree with 13 vertices(a) I only (b) II only (c) III only (d) I and II

63. Consider the following pseudocode program.

int imain (){

i = 3S ()R ()

}void S () {

print i // prints the value of i on the current line of outputprint “ “ // prints a blank space on the current line of output }

void R () {int ii = 2S () }

What is the output of the program if the pseudocode uses either static (lexical) scoping or dynamic scoping?Static Scoping Dynamic Scoping(a) 3 2 3 2(b) 3 3 2 2(c) 3 3 2 3(d) 3 3 3 2

64. Consider the binary heap below that uses an array a [ ] = [9, 7, 4, 2, 6, 1, 3] to store its elements

9

7 4

2 6 1 3What will be the values of the remaining elements in the array after one delete-max operation from the heap?(a) [7, 4, 2, 6, 1, 33] (b) [7, 4, 6, 2, 1, 3] (c) [7, 4, 6, 2, 3, 1] (d) [7, 6, 4, 2, 3, 1]

65. Consider the following pseudocode of the recursive function goAgain.//assume N is a positive integerinteger goAgain (integer a, integer N)begin if (N = = 1) then return a else return a + goAgain (a, N/2)endWhat is the order of growth, as a function of N, of the number of times the function goAgain is recursivelyexecuted?

(a) log N (b) N (c) logN N (d) 2N



10

66. Suppose the partition function (of quicksort) is called on this array:4 7 6 5 1 8 0Which of the arrays below could result from the call, i.e. which of them satisfies the postconditions of partition?(Assume partition chooses the first element as the pivot.)(a) 1 0 4 5 6 8 7 (b) 4 0 1 5 6 8 7 (c) 4 0 1 5 6 7 8 (d) 1 0 5 4 6 8 7

67. What is the appropriate pairing of items in the two columns listing various activities encountered in asoftware life cycle?

(P) Requirements capture (1) Module development and integration(Q) Design (2) Domain analysis(R) Implementation (3) Structural and behavioural modeling(S) Maintenance (4) Performance tuning(a) P-3, Q-2, R-4, S-1 (b) P-2, Q-3, R-1, S-4(c) P-3, Q-2, R-1, S-4 (d) P-2, Q-3, R-4, S-1

68. The cyclomatic complexity of each of the modales A shown below is 10. What is the cyclomatic complexity ofsequential integration shown on the right hand side?

A B

B

A

(a) 19 (b) 21 (c) 20 (d) 10

69. Given the functional dependencies

; ; and X W X Y Y Z Z PQ Which of the following does not hold good?(a) X Z (b) W Z (c) X WY (d) none of the above

70. The binary operation is defined as follows

P Q PQT T TT F TF T FF F TWhich one of the following is equivalent to P Q ?(a) Q P (b) P Q (c) P Q (d) P Q

71. Given a relation R(A, B, C, D, E, F) and FD set

S = {A BC, C D, BA E, BD F, EF B, BE ABC} Which closure of attributes of S doesnot cover R?(a) A+ (b) BC+ (c) BE+ (d) EF+

72. Which of the following is/are undecidable?

(1) is a CFG. Is LG G ? (2) * is a CFG. Is LG G

(3) M is a Turing Machine. Is L(M) regular? (3) A is a DFA and N is an NFA. Is L(A) = L(N)?A (a) 3 only (b) 3 and 4 only (c) 1, 2 and 3 only (d) 2 and 3 only



11

73. For a connected, undirected graph G = <V, E>, which of the following must be true?(I) for all v degree(v) is even.(II) E > = V–1(III) G has at least one vertex with degree 1.(a) I only (b) II only (c) III only (d) I and II

74. Consider the following two languages.L1={w {a , b}*| w has equal number of a and b}L2={w {a, b, c}*| w has equal number of a and b and c}Which of the following is true about L1 and L2 ?(a) L1 and L2 are both regular.(b) L1 is regular, and L2 is context-free but not regular.(c) Neither L1 nor L2 is regular, but both are context-free.(d) L1 is context-free but not regular, and L2 is not context-free.

75. Two classical algorithms for finding a minimum spanning tree in a graph are Kruskal’s algorithm and Prim’salgorithm. Which of the following are the design paradigms used by these algorithms?

Kruskal’s algorithm Prim’s algorithm(a) The greedy method The greedy method(b) The greedy method Dynamic programming(c) Dynamic programming The greedy method(d) Dynamic programming Divide and conquer

GTB Nagar : 35, First Floor, Mall Road, G.T.B. Nagar (Opp. Metro Gate No. 3), Delhi-09, Ph: 011-65462244, 27241845

Jia Sarai : 28-A/11, Jia Sarai, Near-IIT, New Delhi-16, Ph : 011-26851008, 26861009 www.careerendeavour.com

1

COMPUTER SCIENCE & APPLICATIONSTEST SERIES-IV

PART-I

1. (d) 2. (c) 3. (c) 4. (a) 5. (d) 6. (d) 7. (d)

8. (d) 9. (d) 10. (a) 11. (a) 12. (d) 13. (a) 14. (b)

15. (c) 16. (c) 17. (d) 18. (a) 19. (c) 20. (a) 21. (a)

22. (d) 23. (d) 24. (a) 25. (d) 26. (a) 27. (a) 28. (b)

29. (a) 30. (a) 31. (c) 32. (a) 33. (c) 34. (d) 35. (c)

36. (d) 37. (c) 38. (a) 39. (b) 40. (d) 41. (d) 42. (a)

43. (d) 44. (d) 45. (d) 46. (d) 47. (d) 48. (d) 49. (a)

50. (c) 51. (a) 52. (d) 53. (a) 54. (c) 55. (a) 56. (d)

57. (a) 58. (c) 59. (d) 60. (c)

PART-II

1. (b) 2. (b) 3. (c) 4. (b) 5. (c) 6. (c) 7. (d)

. 8. (b) 9. (b) 10. (a) 11. (d) 12. (b) 13. (c) 14. (d)

15. (d) 16. (b) 17. (a) 18. (a) 19. (b) 20. (d) 21. (c)

22. (c) 23. (b) 24. (c) 25. (d) 26. (a) 27. (a) 28. (b)

29. (a) 30. (b) 31. (a) 32. (a) 33. (a) 34. (b) 35. (d)

36. (a) 37. (d) 38. (c) 39. (a) 40. (d) 41. (c) 42. (d)

43. (b) 44. (d) 45. (b) 46. (a) 47. (a) 48. (a) 49. (b)

50. (d)

PART-III

1. (b) 2. (a) 3. (d) 4. (b) 5. (b) 6. (d) 7. (a)

8. (a) 9. (a) 10. (b) 11. (d) 12. (a) 13. (d) 14. (b)

15. (c) 16. (b) 17. (a) 18. (c) 19. (c) 20. (c) 21. (c)

22. (c) 23. (b) 24. (a) 25. (a) 26. (a) 27. (d) 28. (d)

29. (a) 30. (d) 31. (d) 32. (b) 33. (a) 34. (c) 35. (b)

36. (d) 37. (c) 38. (d) 39. (a) 40. (b) 41. (c) 42. (b)

43. (a) 44. (a) 45. (a) 46. (a) 47. (b) 48. (d) 49. (b)

50. (b) 51. (c) 52. (c) 53. (d) 54. (b) 55. (c) 56. (a)

57. (a) 58. (c) 59. (c) 60. (a) 61. (c) 62. (d) 63. (d)

64. (d) 65. (a) 66. (a) 67. (b) 68. (a) 69. (c) 70. (b)

71. (b) 72. (d) 73. (b) 74. (d) 75. (a)

Date : 17-12-2015

Documents

South Delhi : 28-A/11, Jia Sarai, Near-IIT Hauz Khas, New ...careerendeavour.com/wp-content/uploads/2016/02/test-4-cs...North Delhi : 33-35, Mall Road, G.T.B. Nagar (Opp. Metro Gate