GATE 2020 & INFORMATION TECHNOLOGY ENGINEERING GUIDE with10 Practice Sets (6 in Book & 4 Online Sets) ~ Covers every topic as per the Latest Syllabus ~ 2-Levels of Exercises with Explanations ~ Includes 2005- 2019 Solved papers + 10 Practice Setsdisha GATE 2020 COMPUTER SCIENCE & INFORMATION TECHNOLOGY ENGINEERING GUIDE with10 Practice Sets (6 in Book & 4 Online Sets)* Corporate Office : 45, 2nd Floor, Maharishi Dayanand Marg, Corner Market, Malviya Nagar, New Delhi-110017 Tel. : 011-26692293 / 26692294 ‘Typeset by Disha DTP Team Compiled & Edited by Vinit Garg (B. Tech, M. Tech) DISHA PUBLICATION ALL RIGHTS RESERVED Get free access to Online Test(s)? INSTRUCTIONS 1. You can access your test on any Window based Desktop, android tablets or ipads and mobile phones absolutely free 2. Visit the link below or scan the QR code: 4 Mock Tests Bite ey 3, Click on "Attempt Free Mock Tests”, @ Registration window pops up, enter all the details in the form & click "Sign UP" 4, User is now logged in the account & all the Mock Tests appears in the grid. User can attempt the Free Mock Tests) by clicking the "Start” button, 5. Contact us at support@mylearinggraph.com for any support. © Publisher ‘No part of this publication may be reproduced in any form without prior permission of the publisher. The author and the ‘publisher do not take any legal responsibilty for any errors or misrepresentations that might have crept in. We have tried ‘and made our best efforts to provide accurate up-to-date information in this book. For further information about the books from DISHA, Log on to www.dishapublication.com or email o info@ dishapublication.com GP 3876* Solved Paper 2019 2019-1-16 Eee ue ecru amen ete) Part A-- Verbal Ability si(1-58) 1. English Grammar 1-14 2. Sentence Completion 15-22 3. Synonyms & Antonyms 23-34 4, Verbal Analogies / Contexual Usage 35-44 5. Critical Reasoning & Verbal Deduction 45-58 Part B- Numerical Ability si(59-128) 1. Number System 59-70 2. Algebra 71-82 3. Percentage & Its Applications 83-90 4, Time, Work, Speed and Distance 91-104 5. Ratio, Proportion, Partnership and Mixtures (Aligations) 105-116 6. Permutation and Combination & Probability 117-128 Ree (CLS CR Ua en Ud 41. Mathematical Logic a2 2. Probability 13-32 3. Set Theory & Algebra 33-52 4. Combinations 53-64 5. Graph Theory 65-76 6. Linear Algebra 77-102 7. Numerical Methods 103-118 8. Calculus 115-1461. Digital Logic 1-64 2. Computer Organization and Architecture 65-148 3. Programming and Data Structures 149-268 4, Algorithm Analysis 269-320 5. Theory of Computation 321-390 6. Compiler Design 391-452 7. Operating System 453-534 8 Databases 535-614 9. Computer Networks 615-684 10. Information System and Software Engineering 685-722 PRACTICE SETS 1. Practice Seta P51 - Ps? 2. Practice Set2 ps-13- ps-24 3. Practice Set3 75-25 - P5-36 4, Practice Set-4 5-37 Psa 5. Practice Set 75-49 - P5-60 6. Practice Set6 Ps-61-PS-72 4 ONLINE PRACTICE SETS GP 3876With an aim to provide the best possible material to the students to prepare for the GATE, GATE Masterpiece is a one of its kind for the preparation of Computer Science & Information Technology Exams and a result of many years of research. The unique feature of this book is that it has Numerical Answer Type Questions which have been added by the IITs. Also, book has come with 10 practice sets on the Gate pattern. The key idea, which allows this book to deal with a wide range of content related to the CS & IT Exams along with covering each and every topic, is based on the syllabus introduced by IIT for GATE. Covering 100% topics of the syllabus for CS & IT Exam, the content of this book includes an extended version of a collection of exhaustive theory, past year questions, practice problems and 10 practice sets. In writing this book, we have assumed that readers are well acquainted with the very basic concepts of Computer Architecture, Programming, Theory of Computation, Algorithms, etc. Drafted in compliance with GATE syllabus by qualified and experienced professionals, this book has questions of previous 15 years of GATE examinations. Having 100-150 questions in each unit with detailed solutions, this book in helpful in practicing and preparing for the exams in an effective manner within the shortest span of time. Structured approach, Introduction of Concepts in Simple Terms, Fundamental Principles in Context of Simple Application and Accuracy were our main objectives that we aimed while writing this book. In order to make sure that the students get well prepared for the exams, we have divided into three section. Students who read this book will gain a basic understanding of principles, problems and solutions, including an introduction to the format of GATE exam. 1. General Aptitude - Covering Verbal Ability and Numerical Ability 2. Engineering Mathematics 3, Technical Section 4, 10 offline & online Practice Sets SUPPLEMENTS: Online Tests which contains 4 Practice Sets designed exactly on the exact pattern of GATE exam, ACKNOWLEDGEMENT Special thanks go to our team which has given its best possible effort to prepare such a book, thoroughly checked the solutions, so as to eliminate any possibility of error. However, some errors may have crept in, so feedbacks from the readers regarding the same are highly appreciated, AuthorSyllabus for Computer Science & Information Technology ‘SECTION | : GENERAL APTITUDE(GA) Verbal Ability: English grammar, sentence completion, verbal analogies, ‘word groups, instructions, critical reasoning and verbal deduction. Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data interpretation. SECTION II : ENGINEERING MATHEMATICS Engineering Mathematics: Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions. Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition Calculus: Limits, continuity and differentiability. Maxima ‘and minima, Mean value theorem. Integration, Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional, probability and Bayes theorem. ‘SECTION Ill : TECHNICAL SECTION al Logi Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point). Computer Organization and Architecture Machine instructions and addressing modes. ALU, data Jpath and control unit. Instruction pipelining, Memory hierarchy: cache, main memory and secondary storage; /0 interface (interrupt and DMA mode). Programming and Data Structures Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Algorithms Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide and conquer. Graph search, minimum spanning trees, shortest paths. Theory of Computation Regular expressions and finite automata. Context-free ‘grammars and push-down automata. Regular and contex- free languages, pumping lemma. Turing machines and undecidability. Compiler Desi Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Operating System Processes, threads, inter process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems. Databases ER-model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control. Computer Networks Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/lPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (ONS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls. GP 3876TOPIC WISE NUMBER OF QUESTIONS ANALYSIS Gate Computer Science & Information Technology (2006-19) swoiece | 2008 | 2007 | aoe [ anos [x10 | 20m | 2012 | ao [aoe | 2s | aoe | zor | aaun | 2019 cenertaptioge | : we [| ||» |» |» | » |» cameos [ufo falofalelele«l[sfefulula fa a commuurowmeton | | a Tals fsfrfsle]sfefa]a] > fs ee Cole lc elec s | meoromanivn fs] s foto f«lelelel>l>[«[>f«|[« reovotcompurnon| «|? |» |7t«lels|>f«[«[«[«|«]« comnieroun | © |e «[sf>faf-[«le[s{>[-|-]> commun | 2] ef? t7[s(st-lets[s[s]-]>|[s onan sfe[e[s[s/>/«[=[s[-[-[>|[- [> conpuernarwons |r fu fo ts fefa]elsfefsfe]e] ss ates taguaningL_” -1 ea omiE eae c928¢ dDINSTRUCTIONS There are a total of 65 questions carrying 100 marks ‘The subject specific GATE paper section consists of $5 questions. The GA section consists of 10 questions, Questions are of Multiple Choice Question (MCQ) or Numerical Answer type, A multiple choice question will have four choices for the answer with only one correct choice. For numerical answer type questions, the answer is a ‘number and no choices will be given. Questions not attempted will result in zero mark. Wrong answers for multiple choice type questions will result in NEGATIVE marks. For all 1 mark questions, + mark willbe deducted for each wrong answer. For all? marks auestins, mark wil be deducted for each wrong answer, Ther is NO NEGATIVE MARKING for questions of NUMERICAL ANSWER TYPE. QUESTIONS 1 TO § CARRY ONE MARK EACH 1, Two eats start at the same time from the same Tocation and go in the same direction. The speed of the first car is 50 km/h and the speed of the second ear is 60 knvh. The ‘number of hours it takes for the distance between the two cars to be 20 km is @1 (b) 3 © 2 @ 6 The expenditure on the project as follows: equipment Rs20 lakhs, salaries RS.12 lakhs, and contingency Rs.3 lakhs. (@) break (b) break down (6) breaks (@) breaks down 3. Ten friends planned to share equally the cost of buying, «gift for their teacher. When two of them decided not to contribute, each of the other friends had to pay Rs, 150 more, The cost of the gift was Rs, (@) 12000 (b) 3000 (©) 6000 (a) 666 4. Acourtis toa judge as is toa teacher (@) asyllabus (©) astudent (6) aschool (@) a punishment 5. The search engine's business model around the 6. (a) sinks (b) bursts (c) revolves (@) plays QUESTIONS 6 TO 10 CARRY TWO MARKS EACH Three of the five students allocated to a hostel putin special requests to the warden, Given the floor plan of the vacant rooms, select the allocation plan that wll accommodate all their requests Request X; Due to pollen allergy, I want to avoid a wing next to the garden. Request by Y: I want to live as far from the washrooms as possible, since I am very sensitive to smell Request by Z: [believe in Vaastu and so want to stay inthe South-west wing, The shaded rooms are already occupied. WR is washroom, i fulcrum of trust2 ® ie £ a= mT TPE () (@ The police arrested four criminals -P, Q, R and S$, The criminals knew each other. They made the following statements: Pssays “Q committed the crime.” says “S commited the erime.” R says “I did not doit” S says “What Q said about me is false.” ‘Assume only one of the arrested four committed the crime and only one of the statement made above is true. Who committed the crime? @Q OR @s @P “A recent High Court Judgement has sought to dispel the ideal of begging as a disease which leads to its stigmatization and criminalization — and to regard it as a symptom. The underlying disease isthe failure ofthe state to protect citizens who fall through the social security net.” Which one of the following statements can be inferred from the given passage? (a) Begging has to be banned because it adversely affects the welfare of the state (b) Begging is an offence that has to be dealt with family (©) Beggars are created because of the lack of social welfare schemes (@) Beggars are lazy people who beg because they are "unwilling to work 9. Ina college, there are three student clubs, sixty students are only in the Drama club, 80 students are only in the Dance club, 30 students are only in the Maths club, 40 students are in both Drama and Dance clubs, 12 students are in both Dance and Maths clubs, 7 students are in both Drama and ‘Maths clubs, and 2 students are in all the clubs. If 75% of the students in the college are not in any of these clubs, then the total number of students in the college is (a) 975 (b) 1000 (@) 225 (a) 900 10. Inthe given diagram, teachers are epresentedin the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of the people, the percentage of ‘administrators shall be in the rage of. (a) 161030 (b) 4610.60 (©) 311045 (a) 01015 TECHNICAL SECTION TEST QUESTIONS 1 TO 25 CARRY ONE MARK EACH 1, “Which one ofthe following kinds of derivation is used by LR parsers? (a) Rightmost (b) Rightmost in reverse (©) Leftmost (@) Leftmost in reverse 2. Consider the following C program: include int main(){ 2,3,4,5,6,7,8,9.01,2,5}, *ip-arr4; ‘The number that will be displayed on execution of the program is 3. For E= {a,b}, let us consider the regular language L= tx [x= at orx= 5102, £30) ‘Which one of the following can be @ pumping length (the constant guaranteed by the pumping lemma) for L? @5 0) 4 9 @ 3 A Let = (1,2, .m) Let =f, Nixe NXE} Consider the following two statements on [Al LA =m" xi() ich ofthe abot Sateen e TRUE? (a) Only IT (b) Only I (c) Neither [nor I (d) Both I and IT 5 Asean ous esa yeas ce fe 16 tocihecth bet yc sn nan fm fe asus ans. ae Toray obec ote gi dros ren int ales geet te ps GP 3876un. (a) 28 its and 4 bits (b) 24 bits and 4 bits (©) 24 bits and Obits (@) 28 bits and O bits Consider the grammar given below: Soda ABD Boble Dodle Leta, 6, d, and $ be indexed as follows a[o|als 3 {2 lilo Compute the FOLLOW set of the non-terminal B and write the index values forthe symbols in the FOLLOW set inthe descending order, (For example, ifthe FOLLOW set is {a, 6, d,$}, then the Key should be 3210) Let X be a square matrix. Consider the following two statements on X. 1. Xis invertible IL. Determine of ¥is non-zero. Which one of the following is TRUE? (a) Limplies Il; Il does not imply 1 (0) T does not imply If TT does not imply 1 (©) Land Il are equivalent statements (@) Himplies 1; F does not imply 1 The chip select logic for a certain DRAM chip ina memory- system design is shown below. Assume that the memory system has 16 address lines denoted by A1S to AO, What is the range of addresses (in hexadecimal) of the memory system that can get enabled hy the chip select (CS) signal? (@) C800 to CFFF (b) C800 to C8FF (©) DAOO to DFFF (@) CA0010 CAF Consider a sequence of 1d elements: A= {-5,-10, 6,3, -2,13,4, -9,-1,4, 12,3, 0}. ‘The subsequence sum 5 (i,)= AIK] = Determine the maximum of § (i) where 0<7 int jumble (int x, int y) (x return x ;} int main (fin. Y= jumble (y, x), = jumble (95 printf(“%d \n", x); return 0; ) ‘The value printed by the program is Let G be an arbitrary group. Consider the following relations on G: Ry: Wa, b € G, aRb if and only if 3g € G such that ang! bg Ry: Wa,b € G, aRb if and only if a= 5"! Which of the above is/are equivalence relationelations? (@) Neither R, nor R, — (b)R, only (©) Ry only (aR, and Ry Consider the following two statemenis about database transaction schedules: 1. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. I Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate. view serializable schedules that are not conflict serializable. Which of the above statements is/are TRUE? (@) Lonly (b) Monly (6) Neither Lor (4) Both I and It Let Gbean undirected complete graph on n vertices, where ‘n> 2. Then, the number of different Hamiltonian cycles in Gis equal to @ a Om (b) 2 @ Which of the following protocol pairs ean be used to send and retrieve e-mails (in that order)? (a) SMTP, MIME (©) IMAP. SMTP. (b) IMAP, POP3, (@) SMTP, POP3 The following C program is executed on a Unix/Linux system: # include int main () { inti; The total number of child processes created is Consider Z= 1 ¥, where X, Yand Z are all in sign-magnitude form. Xand ¥ are each represented inn bits. Toavoid overflow, the representation of Z would require @ minimum of (a) nbits (b) n+ bits (©) n+2bits (@) n= L bitsex Sowep Paper - 2019 Which one of the following is NOT a valid identity?” © G+) Oz-xOH+2) (@) x@y=x+y,ifxy=0 22, Which one of the following statements is NOT correct about the B+ tre data structure used for ereating an index ofa relational database table? (@) Key values in cach node are kept in sorted order (b) B+ Tree is aheight-balanced tree (©) Each lea node has a pointer to the nex leaf node (4), Non-leaf nodes have pointers to data records 23. If Lisaregular language over Z= {a,b} ; which one ofthe following languages is NOT regular? (@) wnt we Ly} (b) Prefix (Z) = {x © 3] 3 y-e E* such that aye L] (0) LR fxy|xe Lye L} (@) Sulix (L) = fy © 34| 3.x Zouch that ay € L] 24, In 16-bit 2° complement representation, the decimal number -28 is: (@) 1000 0000 1110 0100 (b) 0000 0000 1110 0100 (©) 1111 1111 0001 1100 (@ 111 1111 1110. 0100 25, Two numbers are chosen independently and uniformly at random from the set {1, 2... 13}. The probability (rounded off to 3 decimal places) that their 4-bit (unsigned) binary representations have the same mos significant bitis QUESTIONS 26 T0 55 CARRY TWO MARKS EAC 26. Consider the following relations P(X, YZ), UK, ¥, T)and ROY P ¥ Y Zz (1 YL 1 YL 2 n 2 22 Ya ZA @ x Y 2 vt a XI Ym 5 xl vi 6 6 B 1 RB B B Wow many pies will be returned by the following relational algebra query? rafP* Ih 6p y-nyooraf 2” 8) Te yay Answer 2. 29. 3. Which one of the following languages over © NOT a context fee? (2) G0 | w ela, 54) (b) {wal wAb" | we fa, b}*, 20} (©) {a"b! lie {n3n5n},n 20} (@) {wah wwe fa, b}*, 20} Consider te following e-program # include < stdioh > intr Ot statie int nun retum num int main Q { for (rr: 10) print (6a, (Q); retum 0; } Which one of the following values will be displayed on execution ofthe programs? @) 2) 30) 4 @ 6 There are n unsorted arrays: A, . A, .-, dy. Assume that n is odd, Each of Ay , yy. contains n distinct elements, There are no common elements between any two arrays. ‘The worst-case time complexity of computing the median of the medians of 4, , 4p... 4, is (a) O(n) () O(nlog.m) © ov) (@) QF log n) A relational database contains two tables Student and Performance as shown below: Smita Performance Roll_no. | Subjeet_code | Marks os 86 1 B 95 1 c 0 2 A 8 2 c 2 3 | _c 80 The primary Key of the student table is Roll_no. For the performance table, the columns Roll_no and Subject_code together form the primary key. Consider the SQL query aiven below: Select S, Student_name, sum (P. Marks) FROM Student Sy Performance P WHERE P. Marks > 84 GROUP BY $ Student_name; The number of rows returned by the above SQL query is ‘Consider the following C program *# include int main 4 GP 387632. 34. 36. Assume that in a certain computer, the float sum = 0.0, = 1.0, while (i> 0.0625) sum + ifs printf ("% fin", sum); return 0; } ‘The number of times the variable sum will be printed, when the above program is executed, is. Let the set of functional dependencies F= {OR S, RP, S Q}hold on a relation schema X= (PORS), X'is not in BCNF. Suppose 1 is decomposed into two schemas ¥ and Z, where Y= (PR) and Z= (ORS) Consider the two statements given below. 1. Both ¥ and Z are in BONF IL. Decomposition of X into Y and Z is dependency preserving and lossless Which of the above statements is/are correct? (@) Honly (b) Both I and It (©) Neither I nor It (@) Lonly ‘The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 KB, and the disk block address is 32-bits long. The maximum possible file size is (rounded off to Idecimal place) GB. In @ RSA eryptosystem, the value of the public modulus parameter 1 is 3007. If itis also known that 6 (n) = 2880, where 6 () denotes Euler’s Totient function, then the prime factor of n which is greater than 50 addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable, The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Bulfer (TLB) in the address translation path has 128 valid entries. At most how many distnet virtual addresses ean be translated without any TLB miss ? (@) 256210 (b) 16210 (© 4x2 (@) 8«2% Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let, 1 Xq. Ay, Xy, Xe, and X, be the placeholders for the non= terminals 1. 7-1-0 1, the following table Production rule ‘Semantic action DoT X, type =X, type Tint Tiype= int T float Ttype = float LoL, id AXytype =X, type add Type (id entry, X, type) Lid add Type(id entry, X, typt) ‘Which one of the following ae the appropriate choices for XX, Ay and X27 @M=EYAL AAT OX =LYAL, OX @X=LY=T.% 37 A 2, 4B. Sowen Paren -2019 ETO Consider the following matrix 124 8 139 27 14 16 64 15 25 125, ‘The absolute value ofthe product of Eigenvalues of R is ‘Consider the following C function, void convert (int m){ itq@m 10® bytessee. 49. Consider the augmented grammar given below: | Let |, = CLOSURE ({[S'-> +S]}). The number of items in the set GOTO (I, .<) is: 50. Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in rilliseconds) as shown below [Process rir] 3 [Pa Aivalime [oT 13 [a crubustiine [3] 1} 3 z ‘These processes afe Tun On @ single processor using preemptive shortest remaining time first scheduling algorithm. If the average waiting time ofthe processes is | millisecond, then the value ofZ is, ‘51. Consider that 15 machines need to be connected in a LAN using &-port Ethernet switches. Assume that these switches donot have any separate uplink port The minimum number ‘of switches needed is, 52. Consider the first order predicate formula 6 vx [(¥ez |= (@=3) V(e= 1))) => 3 whw>3) 4 (Vez) w= (w=2)VE=1))] Here ‘a | 6 denotes that ‘a divides 6° where a and 6 are integers, Consider the following sets: SE {1,23 )o.100} $2 Set ofall positive integers $3. Set ofall integers Which of the above sets satisfy 6 ? (@) Sland $3 (b) SI and $2 (©) S2and $3 (@) 81,82 and $3, '53. Consider the following C program ‘include < stdo.h > int main(){ int af] = {2, 4, 6,8, 10}; inti, sum=0,*b= ad; for (i= 0;1<5:i+d+) sum = sum + (*b i) ~ %(b—i); printf ("96d\n" sum); return 0; } ‘The output ofthe above C-program is, ‘54, Suppose that in an IP-over Ethernet network, a machine X. ‘wishes to find the MAC adatess of another machine Yin its subnet. Which one of the following techniques can be used for this? (a) X sends an ARP request packet to the local gateway’s MAC address which then finds the MAC address of Y and sends to X (b) X sends an ARP request packet with broadcast IP ‘address in its local subnet (©) X sends an ARP request packet to the local gateway's IP address which then finds MAC address of Y and sends to.X (@) X sends an ARP request packet with broadcast MAC address in its local subnet $5, What is the minimum number of 2-input NOR gates required to implement a 4-variable function expressed in sum-of minterms form as f = ¥ (0,1,5,7,8,10,13,15)? Assume that al the inputs and their complements are available. GP 3876SOE GENERAL APTITUDE TEST ‘otal number of students in the chub = 60+ 80+ 30-+ 38+ 10+5+2= 225 1. (@) Astwo cars are moving in the same direction 1. Relative speed of tvo ears =60--50~= 10 kav "Now, total number of students in the college Now, distance between two cars in 1 hour = 10 km. 25 100 _ 999, Time required when two ate at 20 km apart 0. © 5 = 70-2 hours TECHNICAL SECTION TEST 2 (@) The noun ‘expenditure’ is singular and will agree! (b) LR Parser uses rightmost derivation in reverse order with “breaks down’ isthe appropriate word to make because LR Parser is @ bottom up Parser. Hence, the sentence contextually as well as grammatically option (bis correct. correct as it means “divides into’, “Break? means 2 (@) As ven C Program reduced fo process # include 3. (6) Letthe each friend share &x initially. int main () then, cost of the git = 10x ( ‘when, two friend decided nt to contribute then share intare(]= {1,2,3,4,5,6,7,8,9,0,1,2, 5) of each friend = (+ 150) sip arch 4; 10x = 8x + 150) Print £(-%d\n, P(LD = 600 return 0, Hence, cst ofthe gift = 10x = £6000 } 4. (©) The way “count and ‘judge’ make a complementary In this program, iP = arr + 4, will point to the fiflh ous, similarly, “school” and ‘teachers’ makes clement of the array, because it will increment with complementary pai. base address ofthe array by 4 5. (¢) The word ‘revolves’, which, in the context of this And, Prin {0% d\n", iP[1);iP(1] is equal to the sentence means ‘work or funetions’ its in the blank *GP +1),so,itwill further incremented tothe pointer ‘most appropriately. Rest ofthe options ae irrelevant to the next clement. Hence, the number that will be in the context ofthe sentence. The words “plays also displayed on the execution ofthis program is 6 ‘means “works” but the phrase ‘plays around’ means 3. (b) As given that. the regular language ‘act casually’, and hence option (D) is ruled out. x [x= aK orx = blO* UR, K > 0} 6. (a) Allocation plan given in option (A) satisfy all the = {x]x=a2 (a')* ox =bI0 (DIY) request made by student X, Y and Z. x [x= aa a8, al! or b!, b%2, bM..} 7. (b) Let us check each statement one by one. Suppose ‘The set x | x is consists of {a?, a8, af, al! .., here that P says “O committed the crime’ is true. Then R the pumping length is 3. So, to get the another string says “I did not do it” is false, Thus R committed the ‘we can repeat the length 3. So, the regular expression ‘crime is not possible as only are of the arrested four is @(a)* = aa(aaa)*. The set x is consists of {b!, ‘committed the erime. v2, bM, bf}. Here, the pumping length is 12. ‘Again, in the same way, Q says “S committed the So to get the another string we can repeat the length 12. crime” is false. So, the regular expression is b!(b!?)* Let S says “what Q said about me is false” is true. =b!9 (bbbbbbbbbbb)* Then, P says““Q committed the erime” is false. ‘Now, by using options, the possible pumping length says “S committed the crime" is false can be 24, Since every repetition will be multiple 3 R says “I did not doit” is false and 12 Then, R did the crime. 4. (a) Asgiven that 8& (©) 1,2,3, nh % @ 5 (x, X) xe X,XCU} ees ‘The number of K clement subsets of a set U with n clements is 2" Ne =28, [e k=0,1,2,..) oF Peg Rey Rey tant R= = In %c,, not having any element, so, we can not select any element = Inc, having only one element, so, we can select only one element,2 @ ep @ Sowen Paper - 2019 = Inc, having two elements, so, we can select two elements subset Similarly for "cy to "c, contain 3 to n elements. So, ‘we can select (3 to n) clement subset respectively. Now, the total number of ordered pairs in A. So, |Al=0 cy + 14%, +20, +... + nie, IAL=0486, + 2%, + 3G Fu tn, K\2 ix (zl By the combinational identity =>K [l-- 2m K So, lis core. Hence, both I& If ae correct. As given that, Cache memory size Block size = 168 So, Byte offset Main memory addres ‘As we know that In fully associative cache, the cache is organized into a single, Cache set and ali cache lines are part ofthis set So, we need zero bits for set number field (index fila) as there is only one set. ‘The address can therefore be effectively broken down 6KB into two fields only 1, Tag bits field 2, Byte offset field So, Tag bits = Total memory address bits — Byte offset bits 32-4 =28 bits Hence, tag field bits is 28 and index field bits is zero. Abie TAG Feld _[Bye Oma] <—— ibis —> As given grammar; S>Aa AS>BD Bo be Dodie According to question: Follow (B) to be the set of terminals that can appear immediately tothe right of non-terminal (B) in some sentential form. Therefore, Follow (B)= {da} So, index of ais 3 and dis 1. Hence, their index in descending order is 31 ‘As.we know that, The inverse of a matrix is AGA Al So, if |A| = 0, then inverse of matrix cannot be ay defined. 8 9. 10. n If|Al #0, then A is invertible matri. IFAT exists, then, |Al # 0 means that denominator determinant of matrix, [A| Hence, both given statements are equivalent. (a) Asaiven address lines AisAue Ata hia Ay Aig Mg nnn Ao ‘According to question Ays= LAy= LA =0,Aq=0:Ay = 1 A rest ofthe is yp tO wil be valable fom doonnc00000 re tit II1NY So, the posible range in binary {100 0 900 90 100 11141143114 [++ By converting binary into Hexadecial) Hence th range the adress ofthe memory stem ‘is (C800 to CFFF). (29) Asgiven that ‘The subsequent sum Sti,/) Da where {0 XYZ+RyZ+RYzt aye So, LHS = RHS Thus, XOR-operator following commutative and associative So, option (a) s valid &) x@y] =["Oy]= [yey] ‘So, option (b) is also valid. (©) LHS. (c+ y@z=t+yz+(xFy).2 Ri x@(y+z)= x(¥4z]+X(y+z) So, LHS.#RNS Hence, option (c) is not valid. ity 80,x@y =[X¥+0] = (x+y) LHS.=RHS So, option (d) also valid (@) By taking each options (@) BY tee isa hight-balanced search tree. (b) All the leaf nodes are connected with a pointer Pr (©) Allthe sky values in each node are kept in sorted order. (@) All the non-leaf nodes have pointers to the next level nodes but not tothe data records because BB* tree non-leaf node consists of only keys and tree pointers (node pointers) B® tree structure for non-leaf node Tk TTR Tree Point Where, K, and K, are keys (@)_ By taking each options (@) {WWE | We L} need not be regular since if Lis an infinite regular language, then {WW | WeL} will not only be infinite, but also non- regular. Hence, WWR is possible as not regular (6) If, Lisa regular language, then, refx (L) is also regular, by closure property. (©) IfLisa regula language, Then, L¥is regular, so, LLRs also regular. By using closure property (@) If, Lis regular language, then sufix (L) is also regular by closure property. (2) Binary representation of (28), is 228 2 2[ 70 2] 31 fata ‘Read from bottom $0, (28), = (11100), #28 = (011100) 2's complement of (011100) is 11100 V's comp. 100011 +1 (BRS 100700 (2’s complement form) Similarly, 16 bits representation of (+28) 428 = (0000 0000 0001 1100) V'scomplement 111 1111 110 0011 4 (@’s complement form) (0.503) As given that, ‘Two numbers are chosen independently and uuniformally at random from the set (1, 2y...-13). So, that means we have to select two numbers one after other, with replacement, GP 387626. 2. a @) Inthe given set, there are 7 numbers with most significant bit 01 ~ 7 (MSBO)) and 6 numbers with ‘mos significant bit (8 — 13(MSB1). So, probability when either both of them of (MSBO) ($4 “L313 (or probability when either both of them of (MSB1) -[s & “[3"13 Now, choose randomly and independently two elements out of 13 elements such that MSB is same. So, required probability (P), =| rac maser + meso *Muse0 rota [rer+6xe] 85 0 eid" yep 79.5029 = 0.503 According to Query- = Tl, Gny-nyany-vo"®” Ie wil satisfy only one row x[y[z[v]v x by 1% bY Ly Now, only one column X will Be selected of expression. TL ee x6, yen) According to Query-2 (Prav-nynonre")) So, result It will satisfy only two row x[y[Ttly¥Y]v x ty 1s [% [yy xy 16 fy, y, Now, only one column X will be selected So, result of expression x TNC yenvaans@et)) “Xp ‘The relational algebra return unique tuples only. So, (Query-1) ~ (Query-2) = (X,—X, Since, X, is not in B, o (Quety-1) ~(Query-2) = 1 By taking each options (a) {ww | we (a, B)*} => S > aSa | BSD |e is in CEL. (Wa WR" | We (a, b)*, n> 0} It is not in CFL because after pushing W, we need to push a’s into tack which will stop the W from being matched with I. If we don’t push a’s after 1, than later we cannot match with B So, this language is not acceptable by a PDA. Hence, itis not aC.FL, ©) 28, 2». Ts @ © © Sowen Paren - 2019 FEE (©) {a°b! |i tn, 3n,5n}, 020} = S— aSb | aSbbb | aSbbbbb |¢ = {a8} {a"b™} U {ab} is CFL because cach of the three parts is a CFL and closure under union guarantees tht result also is @ CFL. (Warerw8 | We (a, b}*, n= 0) = $—aSa|bSb|A Amarble It is a CFL, because when we can fist push I, then a’s, b’s pop with a’s and 17® pops with the W. So, PDA can accept the language. Hence, it is also a CFL In the given program : For (r();r():1()) ‘When we call) first time then it will return ‘7° ‘When we call 1(), second time then it will return °6° and ‘6's non-zer0. For conditional checking r() will execute and num will be 'S" So, body of the loop executed and return value will bbe 5 and hence 5 willbe printed ‘When we call) fom updating values then itl tum 4 ‘When we call 1(, for testing condition then it will return 3 and iti also non-zero again condition will be tested as (). So, Print £(°% a”, r()), wil prin the value 2,50 the output is 52 Let, total n element in each row. Since given arrays are not sorted. So the time complexity to find median of a row is O(n), in an unsorted aray, Total n row, $0 total time :n * (O(n) ‘nce to find median of all these medians. So, total time complexity is Total time = O17) + O(n) = O(n?) ltisacatesian product of student an performance ables. So, without any condition, there are S = 6= 30 rows But on applying where Pmarks > 84, therefore just remove those tuples from P marks which ae < 84 So, there are tuples in the relation P Now, total 5 = $= 25 tuples in the result of cartesian product after applying where clause also, So, total $ different student names because of the statement “Group by S. Student-name” the rows are divided into “5” groups, one for each student and for cach group one row will be returned as output. @ (2?) again ®. Teeration Condition ‘Sum Step) re i= 2.0/10> 00625 | 1 Sie) me We o7n.0> 0.0625 [1.5 Step ure (0/4.0> 0.0625 [1.75 Step ve W=2.08.0> 0.0625 | 1.875 Ste ve i= 2.0716.0> 0.0625 | 1.9375 Step) vie i =2.032.0> 0.0625] False Break otal sum value printed is 5= Sowen Paper - 2019 3B. 3. 38, @ “ As given that, F={QR>S,R>PS—>Q) ZMQRS) Ye@R) ZQRS) ‘The decomposed relations Y(P, R) and Z(Q, R, S) satisfying the dependencies {R—> P} and {QR — S, SQ} respectively. Here Y is in BCNE, and relation Z is not in BCNF but in 3NF. Since, no dependency is lost. ‘When we combine Y and Z. So, itis dependency of preserving and, common attribute between Y and Z relations is R, which is key for relation Y. So that given decomposition is lossless join decomposition Hence, only Il statement is correct. As given that, Disk block size = 4KB Disk block address = 32-bits or 4 bytes Number of adres per DB [isk block size)_] __4KB © [ Disk block address) | ~ 4 Bytes Max file size = [12 [direot pointers] « 4 KB +210 [Single Indirect Pointer] 4KB. + (219 210) [Double indiret pointer] » 4KB] = [48 + 4096 = 4194308] KB 198448KB = 40GB (97) As given that n= 3007 (0) = 2880 As we know that @ (P—1) * (q~ 1) = 30 « 96 = 2880 In which 97 is prime factor which greater than 50. Hence, 97 is the correct answer. As we know that 1 word = 4 bytes =2? As given that, Page size = 8KB = As per questions, ‘The memory is word addressable Page size Word size BB 2] on So, number of words in I page =| 5-]= 2! So, 11 bits are required to represent a page (in words). :. 128 pages can be address with each of size 2 KW As given, number of valid entries in T.L.B = 128 [Number of virtual addresses can be translated without 28 x 210 = 256 x 210 Hence, option (d) is correct. According to inherited attribute defination, an attribute is inherited if the attribute value of a Parse- tree node is determined from attribute value of its parent and siblings. So, SDT for inserting type information in the symbol 1 37. (12) As given that, R= table DL {Lid ype = TStyle} Tint { TStype = int} float {TEStype = float} LA Ly. id {Ltype= L. type} add tpye id entry, Litype) Lid add type (id entry, Litype) Replace these attribute information in the given SDT. Hence, option (a) is correct. 124 8 39.07 14 6 64 1s 25: 125 Product of eigen values of Ris equal to the determinant 124 8 bras 139 a] yh 39 27 14a ot) FIL 4 a6 64 15 25 125, hs 25-125 Now, appving. R,—> R,—R, RRR, ROKR, p24 8 pis “lo 2 12 56 lo 3 21 10] 1s pl fs 1 \R|=1p 12 56]=p 12. 56 B 21} b 2 an By applying asin RoR 2R, ROR, ns 19 [r|=)0 2 18)= b (120-108) =12 lo 6 | Hence, the absolute value of the product of Eigen values of Ris 12. Let us consider, nis equal to 6. Convert (6); / en Print f(%.d", m2); / on Print f%ad", m2); Convert (0); Prin fC a eA, “] Print f(%d", n); It will be continued recursively so it will not print anything and not terminated. GP 387639. (0.8) ‘As given that, A polynomial 3x° + 6 * y + Gy + 6) has only real roots ‘As we know that, the quadratic polynomial, art + bet e=0 #8 — dac > 0 [has only real roots) So, (6y)P=4x 3x By +6)>0 Pay+220 yee, 2, {In this 4 pairs will be at distance 2 from each others ¥[2.6) (children of the same parent), 8 pairs will be at Since, is uniformly distributed in (1,6). distance 4 from each other and 16 pairs will be at So, probability distribution function ree nee a distance 6 from each other. 1 forfisy so} So, to find expected length between two nodes fO)=45 4 8 16 0 otherwise eX) -[>{4)-#(S)-0-(48)] ‘ 8432+96]_[136 ne P2s sid LoLsis Now, [SS eb> Iss L> IS pec L>lid| S|, 68 8 Is e| IS ia So, numberof tems = Total number of productions in particular state = 5 Hence, number of items set GOTO (Ip, <) is 5. GP 387650. (2) Now, as given that, ‘Avg waiting time (WT) = I ms, So, Total (WT) =4 ms ‘According to given table » Arrival time arn an ?, 0 , T 7 z 7 0 ?, 3 3 WE WL TZ r 7 Z 7 Z ° SL. (3)_Inswitch out of 8 ports I port dedicated to the switch itself. So, 7 available ports forthe clients MM; o 1 2 4 § 8 | Process | AT | BT | CY | TAT] WE rth TP] LP Ww eta ea eis ae ta nyo Sry BLS LL Leb? Py 4 T 3 1 0 Me P a Se average waling ime (WT) 7 [229] 3 M 4 4 My ‘Now, consider case Il, when Z=2 Por Switch My Gant chart: aa Pp mle TATA TS o 1 2 3 4 6 9 Now, response table Process | AT | BT | CT | TAT] WT a > [0 | o » [3 [3 6 [3 » [4 [2 2/0 So, average waiting time (WT) 1404340) _ 3 | aims So, the average waiting time of the process is Here, there are 15 clients. Hence, minimum number of switches needed is 3 [Note : To extend star topology in daisy chain manner | millisecond, then the value of Z is 2 then atleast one switch port looses for it53. 54. =) Sowen Paper - 2019 52. (©) As given that, First order predicate formula 6 is, ¥ (¥pp| X= (Z=X)VZ= 1) = 3WiW> X)(¥,|W = (W=2)V (Z=1))] Here, "foreach prime‘, there exist prime 'w' where We Xx" [Now consider frst set SU: {1,2,3, oo» 100} It fails to satisfy the formula because when X= 97 (prime number) There exist another prime number (), where x Please note that except, we and you all nouns and pronouns fall into the category of third person. > Conditional clauses may be put in three categories. Main clause - future, “i... present (likely or probable) ‘© He will help you if you ask him 2 Main clause conditional, “if”... pat (unlikely, imaginary) ‘+ He would help you ifyour asked him 3. Main clause - conditional, perfect “if”. past perfect (impossibie ‘* He would have helped you if you had asked him. GERUND AND INFINITIVE - Usage and Errors in their uses Gerund is a noun in the form of present participle of a verb, for ‘example ‘Fishing is mybest pastime. While ‘infinitive’ is the basic form ofa verb which is used with to’ for example -I want to meet ‘you: In this sentence, ‘to meet” isan infinitive. Usage of Gerund Gerund acts as a subject when an action is being considered in ‘general sense. Swimming isa sport © Climbing mountains is a sport, too * Riding is pleasanter than walking, © Thate telling les. Verbs such as enjoy, excuse, suggest, help, avoid, dread, prevent, risk, recollect, stop, detest, finish, mind, dislike, deny, no use, no ‘200d, resent, delay, postpone, defer, forgive, pardon, ete. are followed by the gerund, * Theyenjoyed watching TV al day. Will you excuse us coming late. Will you stop talking so loudly. Would you mind moving abit. It’s no use asking them fora ticket.PEER) coven Arment ron GATE + Ie’sm0 ‘good’ calling her at this hour. ‘A gerund is put after a preposition ‘© Theyaretired oftalking However, prepositions ‘except’ and “but” are an exception which are followed by an infinitive ‘A gerund that shows a physical activity is placed after come and Bo. ‘= Hewent shopping. ‘© They went boating, "Nouns that are followed by a gerund are placed in the possessive case, ‘+ Shehatesher husband's smoking while the kids are around, When there’sa sense of hesitation, dislike, risk, ete, the ‘gerund is used ‘+ Tdistikeis coming so fate in the night. ‘+ cannot risk losing my purse in this jam packed bus. In possessive case, an adjective before gerund is pt. ‘* She doesn’t mind their playing as long as they do not make a noise Usage of Infinitive Infinitive acts as a noun, an adjective and adver Here are some verbs that are followed by infinitive tr, attempt, care, decide, prepare, undertake, arrange, forget, agree, regret, remember, promise, consent, neglect, swear, refuse, purpose, ‘endeavour, fil, hope, hesitate, determine, manage, seen, et. ‘© tried to contact them several times, ‘+ Lattempted to solve all these questions. ‘* Would you care to ask your help to hand over the keys to She was just preparing to go when father called. 1am sorry [forgot to post your letter. Lregretto inform you to gramophone reached here broken She refused to pay head to my warning. He failed to response in affirmative. hesitated to ask her forthe dinner. Some verbs lke tll, oblige, permit, teach, advise, encourage, request, remind, war, order, invite, aliow, compel, instruct, tempt, urge, show, forbid, et. are followed by object and infinitive ‘+ The principal told the staff to stay back after school gets over, ‘+ Finally, he obliged to accept my offer ‘+ Willyou permit meto go? ‘+ The doctor advised him to take rest fora few days. ‘+ Sheencouraged me to sit for this competition. He requested me to help the accident victim, She forbade me to smoke in her office. They instructed us to sit outside the office. ‘Verbs/expressions such as—do, can, will, et, mayand must, et., are followed by infinitive without , © Lethim play as long as he wants The verb ‘see’ may be used infinitive or without it, '* Gosoe her or Go tosce her. Expressions like ‘would rather’, ‘rather than’, ‘sooner than’, ‘had better’ are followed by infinitive without 0. ‘© You had better inform the authorities in advance, ‘*Pdrather havea quiet night at my place. ‘© Pdrather fil than copy in the exams. ‘After adjectives such as angry, glad, like, delight, astonished, the infinitive is used. ‘* She was angry to see the children trampling on her flowers. ‘+ _vasglad tohear the news of your engagement with Sussane. ‘* 'dliketo meet him when Tam there next week ‘+ She was astonished to hear the news of your success in exams. ‘The verb ‘know’ isnot followed by the infinitive but conjunction and then infinitive ‘© She doesn’t know how to drive. ‘* Doyou know how to talk with elders? had better’ followed by the infinitive without 0 ‘+ You'd better leave this place before the police arrive. ‘© You'd better stop drinking as your condition is deteriorating, ‘When the verb of perception like ‘to see’, “to hear’, “to watch” ‘occur in the sentence, infinitive is ot used with ‘to’ ‘* _Isawhim climb the window. Splitinfinitive is not used ‘* “He vowed not to go there’ and not ‘He vowed to not go there’ Auxiliary Verbs ‘A verb that is used with another verb to form a particular tense or ‘mood, for example - she was pleased, they have let. Sometimes ‘more than one auxiliary verb is used to form a tense, for example - She will be going, They have been warned. Auxiliary verb are either modal verbs or primary verbs. Can’ expresses ability © Youcan drive, can’t you? ‘© She can speak French fluently. ‘* The police are doing all they can to find the truth. “May’ denotes permission, doubt or possibility. ‘* Youmay be lat, so call me tomorrow. ‘© These chemicals may cause irritation to your skin. ‘* Nevermind, Imay have been wrong, “Might” also expresses possibility but you are not at all certain ‘* Thetrain might bea few hours late ‘© They might not want to come with us. ‘*Theymight have missed the light. "Should? is used to say what is the right thing todo. ‘+ You should have taken her along. You should not be so selfish, ‘© Youshouldn't come home after 12 in the night. ‘* The children should not stay up late in the night. “Could” is used as past tense of *Can’ to express doing something in the past ‘* Bythe time he was 12, he could drive the car competently, ‘© Touldn’t catch the train as | was caught in a traffic jam, ‘+ My income was so low that I coulda’t afford the rent “Must is followed by the bare-infinitive, ‘© You must hurry up ifyou don’t want to miss your train, ‘© She must wear the seatbelt ifshe doesn’t want tobe penalized, ‘© Ifyou want to improve your grades, you must work hard. “Must” also expresses strong advice or orders. ty about+ Youmust stop chewing tobacco if you want to avoid cancer, “Must” is used to say that something is very likey tobe true. # That elderly woman must be 90 + Their newbungalow must have cost them around 10 milion, ‘© She must have been really upset with her brother. ‘Should and ought have much the same meanings, but ‘ought’ is followed by to, Ought to” is used to say that ‘someone should do something because it isthe best thing to do. ‘+ Hereally ought to stop drinking, ‘+ You ought to get together sometime soon, ‘© He ought to be ashamed of himself. ‘When you talk about things which actually did not happen, though they were likely to- ‘© You should have been here before 11 ‘Do’ makes questions and negative forms ofthe ordinary verb + Do you like apples? ‘+ Shedoesnt fee! like going to cinema tonight. ‘+ Does he speak Japanese? Yes, he does. “Do's used to emphasize the main verb in a sentence. + Dobealert ‘+ Shedoes look charming in that dress. ‘+ Ido think the manager has behaved badly “Do isalso used with present participles ending in_ing ‘+ She does shopping on Saturday. + You ust keep quiet Let me do the taking Leaving out words after auxiliary verbs. ‘+ They say they've completed the work, but I don’t” think theyhave (instead of... have completed the work). ‘+ Areyou going to appear inthe exams this year? Well no, I'm not (instead of.....'m not going to appear in the exams). To avoid repeating words from a previous clause, we use an auxiliary verb (be, have, can, will, would, etc) Adjectives and Errors in their usage ‘A word that names an attribute, used to describe a noun or pronoun, © Asmall child Atall man ‘An adjective has three forms which are (a) positive e.g, cold (by comparative e.g. colder and (c) Superlative e.g, coldest Rules of Comparison ‘After adjectives such as junior, senior, superior, inferior, posterior, prior, et, the preposition ‘to"is applied and not ‘than’. ‘+ ‘Theteare several students junior to him in the class, ‘+ Weareiin the same department, but he’s senior to me. ‘+ Yourbike is far superior to mine. ‘+ Healways fet inferior to his wife. Please note after these words ‘more’ or ‘most isnot use. ‘+ “Thereare several students more junior to him’ is wrong, ‘Words such as minor, major, interior, exterior arethe adjectives of positive degree. Hence, before them ‘more’ or ‘most’ and after “than” or ‘to's rarely use. ‘+ There isa major problem with traffic in Delhi. ‘© Losing by eleven wickets was a major setback fr the team. ENGLISH GRAMMAR + ‘Theinterior ofthe country is mainly desert. Aer ‘Comparatively” or ‘relatively the adjective of positive degree is used. + Crime onthe hill stations is comparatively searce # This sofware is relatively easy to use When ‘enough’ is used in a sentence, use positive degree. + You would be foolish enough to fend him 10,000, * Theear is big enough to accommodate eight persons. “To is used after ‘prefer’, if there is comparison between two ‘nouns or noun equivalents # She prefers tea to coftee. # [prefer to wear cotton clothes When adjectives are joined with ‘and’ then both the adjective take same degree + badandugly woman (both positive) + worse and uglier woman (both comparative) # worst and ugliest woman (both superlative) ‘Toconvert superlative degree into comparative and postive, same ‘examples are given below. + Sachin s the best player in the team. (Superlative) + Sachin is beter than al other player inthe tam, (Comparative, O + Sachin is better than any other players in the team. # Noother player in the team as good as Sachin, (Positive) Synthesis of Positive degree and Comparative degree * He is as good as you. (Positive degreo) * Heisnot better than you. (Comparative degree) Itis, therefore, clear that for positive degree, ‘sola... as'is used onthe other hand, fr comparative degre, ‘comparative + than’ isused Some adjectives that confuse the most Each is used every one of two or more things or people + Each student was given a partieular job for gardening #Thetikets ost ®250 each * Yougiveeach ofthe children a balloon. “Every used to refer toall things or people in a particular group «Every child will gethis share of chocolates, + She enjoyed every page ofthe novel # They applauded every word ofthe speaker “Less defines’ ‘not so much ortoa smaller degree + Thope you would worry less if you understood the case. # Shei doing less talking lately. “Fewer” epresentsa smaller numberof + Fewer trains are late these days + Fewer birds migrated here thi yar. ‘Older’ refers to persons or things. + These plants are older than those in that garden “Elder is used of two people especially brothers and sisters + iselder son Sunny became an architect * Marbella isthe elder of two. “A lite” expressesa small amount. + Marbella speaksa little Portuguese. # She's litle over 3 yearsFERED) oven Armone ror GATE + Thaves litletime tospare. Line’ epresents ony sal amount, notch sense in negative) + ‘Thereislittlesugarlftisthe kitchen ‘The ltl (chat isused to emphasizehow small an amount theres © Shedld the litle she coud do “Farther shows a greater distance then before. + Wevent hiking and devied not to go any farther. “ Further’ means more otoa greater degree ‘+ ‘The minister refused to comment or recent developments until he evidence could be studied further. “Later defines fcr the time youre talking about + Pimjustraveling. cll you ate. “The latter isthe second of two poople or things + Inthelater ease, you'l have to pay on interest of 25% ‘Adverbs and Errorsin their wsage ‘An adver is a word that qualifies the meaning ofa verb, adjective or another adverb ‘She hook her head sadly. Intheexampl, sadly’ isan adverbwhichtells the speciality othe verb shake (Adverbs oftime ae toda, yesterday, ago, at present, lat ‘month, lst ear, presently, shortly, recently lately, ete ‘Adverbs of numbers ~ once, twice, three, et. Gi. Adverbs of place—here, there, in, out, indoors, outdoors, far, near, away, et. (iv) Adverbs of quantity — too, very, much, enough, quits completely, whol partially, ily rather, fr, (©) Adverbs of manner ~ Thus, so, carfily, badly, fluently, ete (vi) Adverbs of affirmation or Negation — Yes, no, surely, not certainly. ct. "Now, sme important adverbs are explained here “Too' expresses ‘more than’ s acceptable or possible 4+” Don't you think the colour of your jacket is too bright “0.1 do something” She sto weak to ctimb the stairs. “To. forsomething* + “This box is too heavy forme “Much far too" + Sussane is far too young to goto school “None 10" (notatall) + He was none too pleased when he was told about new developments “Only too" sed to emphasize that a particular situation exists when you wish against it ‘The principal regretted is say that these rumours are only too tue “Very is used with both pleasant and unpleasant adjectives. + She's very beautfl + She's very uly “Very is used with positive degree very clever, very honest very lucky, very good, very wie, te. “Much isused with comparative demee much stronger, much pleasenter, much better, much wiser, cic “Very much + comparative’ is used ‘© very much stronger, very much better, very much wiser, et, “Very and much’ are also used with superlative degree ‘© The very best gymnast in the country. ‘© Much the best boy in the class. “Very” is used before the present participle ‘+ very enjoying, very entertaining, very interesting, very daring, very challenging, very perplessing et. “Much isused before the past participle, ‘* much surprised, much admired, much tired, much aggrieved, ‘much ashamed, much amazed, ete Please note that ‘very’ is not used with a past participle except afew instances. ‘© verypleased, very frightened, very delighted, very dejected, very drunk, very contented, very limited, etc. * Quite’ (means perfectly, completely) is not used in place of very. + She is quite beautifull ©) She is very beautiful o ‘©The boss is quite busy 9 The boss is very busy ” © Bobis quite handsome. 9. Bob is very handsome. o However ‘quite’ is used in the sense of ‘very’ with some past participles © Quite delighted (= very delighted) = Quitetired ery tired) “Quite” is also used with positive degree. ‘© quite well, quite wrong, quite chilly quite warm, quite right, uite alone, quite cool, et. “Plenty is followed by ‘of © Drinkplenty of water in summer. ‘© There's plenty of time. So, don’t rush the things, Ifthe gender is not known, use the pronoun of masculine gender. ‘© Ifanybody has got the book, he may return it by Monday. “Both” and ‘as well’ are not used together. ‘* Both Sussane and Rick have failed in the exams, “Supposing” and “if are not used together. ‘* Supposing, it really isa storm, ‘© If that babysitter does not turn up, who will hold the baby? "AS con” is used with an adjective or adverb in betwoen when ‘wemean that something or someone is like something or someone clse, or that one situation resembles another. ‘+ TheCharlie Chaplin movie was as funny as his last one. ‘© He finished the job as quickly as he could, "Negative forms may be used wit either ‘not as” of ‘not'so" ‘© The gap between two poles is not as wide as it was before, ‘© The bees are not, so common as last summer. ‘Adverb ‘nor’ is not used with words that have negative sense, ‘*Thedoctor forbade him not to smoke. (incorrect) ‘© Thedoctor forbade him tosmoke. (correct) “Only* isto be positioned right before the word it modifies. ‘+ He only bought two eggs. (incorrect) ‘* He bought only two eggs. (correct) “Due to” modifies a noun and not a verb. So no sentence should begin with ‘due to"