Computer_2013.pdf - PGCET-2013 > DAY-l ME/M.Tech/M.Arch/MBA 1030 am to 12.30 pm(Infrastructure Mana ement COMPUTER SCIENCE courses offered b TU UVCE/UBD

Computer_2013.pdf - PGCET-2013 > DAY-l ME/M.Tech/M.Arch/MBA...

This preview shows page 1 - 16 out of 16 pages.

Image of page 1

Subscribe to view the full document.

Image of page 2
Image of page 3

Subscribe to view the full document.

Image of page 4
Image of page 5

Subscribe to view the full document.

Image of page 6
Image of page 7

Subscribe to view the full document.

Image of page 8
Image of page 9

Subscribe to view the full document.

Image of page 10
Image of page 11

Subscribe to view the full document.

Image of page 12
Image of page 13

Subscribe to view the full document.

Image of page 14
Image of page 15

Subscribe to view the full document.

Image of page 16

Unformatted text preview: PGCET-2013 » > DAY-l ME/M.Tech/M.Arch/MBA 1030 am to 12.30 pm (Infrastructure Mana ement) COMPUTER SCIENCE courses offered b TU/ UVCE/UBD CE MAXIMUM MARKS TOTAL DURATION MAXIMUM TIME FOR ANSWERING MENTION YOUR PGCET NO. QUESTION BOOKLET DETAILS SERIAL NUMBER Os : Check whether the PGCET No. has been entered and shaded in the respective circles on the OMR answer sheet. Ensure whether the circles corresponding to course and the specific branch have been shaded on the OMR answer sheet. This Question Booklet is issued to you by the invigilator after the 2'“l Bell i.e., after 10.25 a.m. ‘The Serial Number of this question booklet should be entered on the OMR answer sheet. The Version Code of this question booklet should be entered on the OMR answer sheet and the respective circles should also be shaded completely. Compulsorily sign at the bottom portion of the OMR answer sheet in the space provided. N’Ib: THE TIMING AND MARKS PRINTED ON THE OMR ANSWER SHEET SHOULD NOT BE DAMAGED / MUTILATED / SPOILED. The 3" Bell rings at 10.30 a.m., till then; Do not remove the paper seal / polythene bag of this question booklet. 0 Do not look inside this question booklet. - Do not start answering on the OMR answer sheet. U :0 r89 was» NH This question booklet contains 75 (items) questions and each question will have one statement and four answers. (Four different options / responses.) After the 3"1 Bell is rung at 10.30 a.m., remove the paper seal / polythene bag of this question booklet and check that this booklet does not have any unprinted or torn or missing pages or items etc., if so, get it replaced by a complete test booklet. Read each item and start answering on the OMR answer sheet. 3. During the subsequent 120 minutes: . Read each question (item) carefully. - Choose one correct answer from out of the four available responses (options / choices) given under each question 1 item. In case you feel that there is more than one correct response, mark the response which you consider the best. In any case, choose only one response for each item. 0 Completely darken / shade the relevant circle with a BLUE OR BLACK INK BALL POINT PEN against the question number on the OMR answer sheet. - 4. Use the space provided on each page of the question booklet for Rough Work. Do not use the OMR answer sheet for the same. 5. After the last Bell is rung at 12.30 pm, stop marking on the OMR answer sheet and affix your left hand thumb impression on the OMR answersheet as per the instructions. - « 6. Hand over the OMR ANSWER SHEET whimiawignam witis. 7. After separating the top sheet, the invigilator will return the bottom sheet replica (Candidate’s copy) to you to carry home for self-evaluation. 8. Preserve the replica of the OMR answer sheet for a minimum period of ONE year. 9. Only Non-programmable calculators are allowed. N Marks Distribution PART-I : 50 QUESTIONS CARRY ONE MARK EACH (1 T0 50) PART-II : 25 QUESTIONS CARRY TWO MARKS EACH (51 '10 75) com lllllllllllllllll||||||||||| 0...... mom 45 Space For Rough Work 002 COMPUTER SCIENCE & ENGINEERING PARTw—HI.’ . Each question carries one mark. 11 bits in operation code imply that there are (A) 2n _ ' 7(B) 211 (C) M * (D) n2 In which addressing mode: the operand is given explicitly in the instruction ? (A) Absolute (B) Immediate (C) Indirect .. (D) Direct For a pipelined CPU with a single ALU, consider the following situations : l. The J+lth instruction uses the result of the It“ instruction as an operand 2. The execution of a conditional jump instruction 3. The Jth and J + 1th instructions require the ALU at the same time Which of the above can cause ahazard ? ' (A) ‘1 & 2 only (B) 2 & 3 only (C) 3 only . ‘ (D) All the three Which of the following is incorrect ? _ p 3 _ $ : ,. 1. In the programmed I/O method, the CPU waits for theI/Qdevices. 50x1=50 possible distinct operators. 2. In the Interrupt driven 1/0 device informs the CPU of its ready status via an interrupt. transaction. (A) 1 and 2 ' (B) 2 and 3 l (C) l, 2 and 3 (D) None of the above 3. . In .DMA, the CPU sends its 1/0 to the DMA controller which manages the entire , Sflaoe‘Fdr- Rough Work 002 Ad 6. What logic gate is represented by the circuit shown belewr‘zg 2, 3 A :7 "'3'”me (A) AND (B) NAND . (C) NOR { , ’ (D) EQUIVALENCE 7. The mintenns corresponding to decimal number 15 is (A) ABCD (B) ABCD (C) A’+B’+C’+D’ ' (D) A+B+C+D‘ 8. How many different trees are possible with 10 nodes ‘? (A) 1014 (B) 1200 (C) 50 . (D) 68 9. In an AVL tree, at what condition the balancing is to be done ? (A) Pivotal value is equal to zero ‘ (B) Pivotal value not equal to zero (C) If the pivotal is greater than 1 or less than 1 (D) If the pivotal value isii‘ilfinity ‘ , ’ ' 10. A 3-ary tree in which every internal node has exactly 3 chilch'en. The number of leaf nodes in such a tree with 6 internal nodes will be _ «. 4. - (A) 10 (B) 11 (C) 12 (D) 13 11. The number of nodes in the largest maximal independent set of the complete bipartite graph K(4, 2) is (A) 2 (B) ‘3 (C) 4 ~ (D) 6 ________________________________._————————————— Space For Rough Work A-l 4 002 12. 13. 14. 15. 16. 17. 18. A full binary tree with n non-leaf nodes contains (A) Log 2n nodes (B) n + 1 nodes (C) 2n nodes . (D) 2n + 1 nodes Algorithm which «solvesthe all pairs shortest path problem is (A) Dijkstra’s algorithm ,. (B) Floyd’s algorithm (C) Prim’s-algorithm , (D) Warshall’s algorithm The height of a binary tree is themaximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is (A) 2h ‘ (B) 2““1-41 ‘ (C) 2h+1 -l (D) 2h+l The algorithm design technique used in the quick sort-algorithm is (A) Dynamic programming (B) Backtracking (C) Dividevand Conquer (D) Greedy method How many distinct binary search trees can be created out of 4 distinct keys ? (A) 42 L (B) 24 (C) 14 (D) 5 ’ The following numbers are inserted into an empty binary search tree in thé given order: 10, l, 3, 5, 15, 12, and 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root) ? (A) 4 . _ (B) 6 (C) 2, ’ (I?) 3 What is the purpose of flow control ? _ (A) To ensure that data is retransmitted if an acknowledgment is not received. (B) To reassemble segments in the correct order at the destination device. (C) To provide a means for thereceiver to govern the amount of data sent. by the sender. (D) To regulate the size of) each segment. ‘ Specific! Rough Work 19. 20. 21. 22. 23. A-l Acknowledgements, sequencing, and flow control are characteristics of which OSlTayer. 7 (A) Layer 2 (B) Layer 3 3,, ,1 A; . (C) Layer 4 (D) Layer 7 p, E at}, What is the powerful, centralized computer system that performs data storage and processing tasks on behalf 6f clients and other network devices ? ’ . (A) Client ‘ (B) Host computer (C) Terminal (D) Network Error control is needed at the transport layer because of potential errors occurring (A) from transmission line noise. (B) in routers. (C) from out-of—sequenee'delivery. (D) from packet losses. ’ ’ . T‘ .. - " ‘4“ ‘ 14" Which of the following is responsible for approving standards and allocating resources in the Internet ? ‘ J (A) Internet Architecture Board (IAB) 7: ,5. , (B) Internet Engineering Task Force (IETF) . ‘ (C) ‘ Inter NIC (D). None of above ' Which of the following is true when describing a multicast address ? , (A) Packets addressed to a unicast address are delivered to a single interface. (B) Packets are delivered to all interfaces identified by the address. This is also called a one- t-o-many address (C) Identifies multiple interfaCes and is only delivered to one address. This address can also be called one-‘to-one-of-many. - (D) These addresses are meant for non-routing purposes, but they! are almost globally unique so it is unlikely they will have an address overlap. . Spice For WWork 27. 29. Which: of the following is TRUE for the language ’{ aP : P is Prir’ne} ? (A) It is not accepted by Turing Machine; (B) It is regular but not context free. (C) It is context free but not regular. (D) It is neither regular nor context free but accepted by Turing Machine. v Fortran is (A) Regular language (B) Context free language (C) Context sensitive language (D) None of the above The equivalent regular expression for the regular expression ( aa+bb+ab+ba)* (A) ((a+b)-(a+b))* . (B) (aba+bab+bb)* (C) ((a+b)+(a+b))* (D) None of the above . Turing machine is capable of accepting (A) Only Regular Languages and Context Free Languages (B) Only Context Sensitive Languages (C) Recursively Enumerable Languages only (D) All four categories of Languages Context grammar is ambiguous if (A) the grammar contains useless non-terminals (B) it produces more than one parse tree for same sentence ‘ (C) some production has two non-terminals side by side on right hand side (D) None of the above In the design of lexical analyzer (A) Only finite automata is used (B) Only regular expression is used (C) Both finite automata and regular expression are used (D) Both finite automata and regular expression not are used Spacell‘or’ Rough Work 31. 32. 33. 35. The string 1101 does not-belong to theisetgrepresented by ‘ 4; (A) 110*(0+.1) (B) -1eo,+1)*101 - (C) (10)*(01)*(00+11)* (D) (00+(ll)*0)* -3 ii." The macroprocessonmusmgform <t; .u. - .n 5;; (A) recognize macro definitions and macro calls (B) save the macro definitions (C) expand Macro calls (D) all of these Relocation bits used by relocating loader are specified by (A) relocating loader itself (B) linker (C) assembler-r y . - A computer cannot ‘boot’ifit does not have (A) Compiler (B) Loader (C) OperatingSystem (D) Assembler ' Linker is , (A) same as loader 41m 1 _. 5 (B) required to create a load module (C) user source code as input (D) always used before programs are executed The order of the Power set of a Set .of order n; is . (I, (A) n . ..~ 1. 1113);» van 1 2 (C) n2 (D) 2“ ' Which of the following statements is FALSE ? n, V 15“” ‘9 2.»:(D) microprocessor 1 415,“ (A) The set of rational numbers is an Abelian group under addition. - r (B) The set of rational integers is an Abelian group under addition (C) The set of rational numbers form an Abelian group under multiplication. (D) None ofthe aboye. i 01.) ~ «_ 1., ‘, l t f ‘ Spam-Fwwsz-k 37. If every element of a group G is its own inverse; then G is (A) Finite (B) Infinite (C) Cyclic (D) Abelian 38. A self-complemented distributive lattice is called (A) Boolean Algebra (B) Modular Lattice (C) Complete Lattice . (D) Self Dual Lattice 39. Hasse diagrams are drawn for (A) Partially ordered sets (B) Lattices (C) Equivalence relations '(D) None of the above 40. The number of different permutations of the word BANANA is (A) 720 (B) 60 (C) 120 g (1')) 360 41. Which of the following is not a fundamental process state ? (A) Ready , ‘ (B) Terminated (C) Executing (D) Blocked 42. Poor response time is usually caused by (A) Process busy (B) High I/O rates _ . (C) High paging rates (D) Any of the above . ' 43. .SSTF stands for , . ' (A) ShOrtest—Seek-Time—First scheduling (B) Small-Small—Time—First (C) Simple—Seek—Time-First scheduling (D) Small-Simple-Time—First 44. Virtual memory is (A) simple to implement (B) used in all major commercial operating systems (C) less efficient' in utilization of memory (D) useful when fast I/O devices are not available ________________________________._——————-———-————- Space For Rough Work 002 9 A-l 45. To avoid race condition, the maximum number of processes that may be simultaneously inside the critical section is (A) zero (B) one (C) two (D) more than two , 46. is a technique of improving the priority of process waiting in Queue for CPU allocation (A) Starvation (B) Ageing (C) Revocation (D) Relocation 'V _ 47. In the Normal form, a composite attribute is converted to individual attributes. (A) First (B) Second (C) Third (D) Fourth 48. The relational model is based on the concept that data is organized and stored in two- dimensional tables called (A) Fields (B) Records (C) Relations _ p (D) Keys 49. specifies a search condition for a group or an aggregate. (A) GROUP BY Clause (B); if ,flAVINGClause (C) FROM Clause (D) WHERE Clause 50. How DOM differs from SAX ? (A) DOM is not event driven and builds up the whole memory. (B) SAX is event driven and requires less space. (C) DOM and SAX are packages. (D) None of these. Space For Rough ~Work 52. 53-. 54. 55. 56. 002 . » PART - II . , - -- , Each question carries two marks. ‘ " 25 x 2: 50 If memory access takes 20 ns with cache and 110 us without it, then the hit ratio (cache uses a 10 ns memory) is ‘ .. (A) 93% (B) 90% (C) 87% (D) 88% A hard disk with a transfer rate of 10 M bytes/second is constantly transferring data to memory using DMA. The Processor runs at 600 MHz. and takes 300 and 900 clock cycles to initiate and complete DMA transfer respectively. If the size of the transfer 15 20 K bytes, what is the percentage of processor time consumed for the transfer operation ? (A) 0.1% (B) 5.0% (C) 1.0% (D) 0.5% In serial communication employmg 8 data bits, a parity bit and 2 stop bits, the minimum baud rate required to sustain a transfer rate of 3000 characters per second 1s (A) 2400 baud T. _ . (B) 19200 baud (C) 4800 baud 5 (D) 1200 baud What is the content of Stack Pointer (SP) ? (A) Address of the current instruction p, . _‘ . .. 7. , - (B) Address of the next insntugtion : x. . , 7 ‘ i- .. (C) Address of the top element of the stack a; ' v' 4 (D) Size of the stack [(A+A’B)(A+A’B )][(CD,-1-C D )+(Ce D)]= (A) B (B) A (C) 0 . (D) 1 Identify the logic function performed by :the circuit shown (A) Exclusive OR ' (13) Exclusive NOR (C) NAND " . (D) NOR 1 Spacenorsinoaghwtuk 11 , A-l 57. Suppose a circular queue of capacity (n-l) elements is implemented with an array of n j elements. Assume that the insertion and deletion operations are carried out using REAR 1 and FRONT as may index variables, respectively- Initially, REAR=FfiONT=0The conditions to delete , queue full and queue empty are i V V (A) full:(REAR+1)mod n=FRONT ‘ " emptyzREAR==FRONT (B) full:(REAR+1)mod n=FRONT empty:(FRONT+l)MOD N==REAR (C) full: ==FRONT empty:(REAR+1)mod n==FRONT (D) full:(FRONT+1)mod n==REAR emptyzREAR==FRONT 58. The recurrent relation capturing the optimal execution time of the {TOWers of Hanoi problem with n discs is ' (A) T(n)=2T(n-2)+2 ' (B) T(n)= 2T(n-1)+n (C) T(n)=2T(n/2)+1 (D) T(n)=2T(n-l)+1 .' , 59. Name the sorting which takes a list of integers and puts each element on a smaller list, depending techniques takes the value of its least significant byte. Then the small lists are concatenated, and the process is repeated for eachf’most significant byte (until the list is sorted. ‘ (A) Radix sort (B) Qllick sort (C) Heap 3°“ ' '(D‘) Merge sea 60. Which statements are true regarding ICMP packets ? 1. They acknowledge receipt/of a TCP segment. ‘ ' " l : 2. They guarantee datagrarn delivery. _' .. . 3. They can provide hosts with information ahoutflnetworl; problems. i ' 4. They are encapsulated within IP datagram. I: ” . (A) 1 only 1 , {. (B) 2 and 3 (C) 3and4 ~ (D) 2,3and4 W A-l 12 002 61. 62. 002’ Why does the data communication industry use the layered OSI reference model ? 1. It divides the network communication process into smaller and simpler components, thus aiding component development, design, and troubleshooting. 2. It enables equipment from different vendors to use the same electronic components, thus saving research and development funds. 3. It supports the evolution (If multiple competing standards and thus provides business opportunities for equipment manufacturers. 4. It encourages industry standardization by defining what functions occur at each layer of the model. (A) 1 only (B) 1 and4 (C) 2 and 3 ‘ (D) ‘3 only What are two purposes for segmentation with a bridge ? 1. To add more broadcast domains. 2. To create more collision domains. 3. To add more bandwidth for users. 4. To allow more broadcasts for users. (A) lonly ' ’ (B) 2and3 (C) 2 and 4 . (D) 4 only Consider the languages: = {anbncmz n,m > 0} and L2 = { anbmcn : n,m > 0}. Which of the following statements is FALSE ? (A) 1.1an is a context free language (B) L1 .L2 is a context free language (C) L1 and L2 are context free languages (D) Ll 0L2 is a context sensitive language ,' '4 Which one of the following is not decidable ? , (A) Given a Turing Machine M, a string s andfan integerk, M accepts s within k steps. (B) Equivalence of two Turing Machines. (C) Languages accepted by givenfinite state machine is non- empty. (D) Languages accepted by a context free grammar is non- empty. . Space Forkough Work 13 A-l 65. A bottom-upparsergenerates », ‘ .RMD 1.. (A) LMD ‘ . (B) (C) RMD in reverse .(D) ,LMD in reverse 66. Backtracking is a problem associated with ' . ,1 ,1 . (A) Topdown Parsing v r _ (B) Bottomup, Barsing ;/ (C) BOth (A) and (B) (D) _ ,Noneof-rthe above '7 V .l; 67. The function f: 2—» z is given by f(x)=x2 1s (A) One-to-one (B) On to (C) One to One and onto , g_(D) . None of the above 68. AUB=AflBifandonlyif _> (A) A is empty set ‘ (B) ‘B is empty set (C) A and B are non-empty sets (D) A and B are empty sets 69. Every finite subset of lattice has _- (A) a LUB and a GLB (B) Many LUBs and a GLB _ (C) Many LUBs and many GLBs 1,; (D) . Either some LUBs and some GLBs 70. Consider an XML file called intro. xml and a document type definition (DTD) file intro. dtd as follows: Intro. xml ' < ?xml version— ~ “1.0”?> <!DOCTYPE myMessage SYSTEM “intro. dtd”> <myMessage> <message>Welcome to XML</message> <lmyMessage> Intro.dtd <!ELEMENT myMessage(message)> <!ELEMENT message(#PCDATA)> A validating parser will classify intro.xml as (A) Well-formed and validated: ' i (B) Well-formed but not validated ‘ (C) Validated but not well-fonned 5?" (D) Neither validated not well-formed Space Fo’allndgh Work - A-l 14 002 71. Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S); P0 P1 wait(Q); wait(Q), ....... , ‘ wait(S), s1gnal(S), 0 ............ , SignaKQ). signa1(Q). signal(S), respectively. The above situation depicts a . (A) Semaphore (B) Deadlock (C) Signal (D) Interrupt 72. If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37,14,124,65,67. (A) 310 . (B) 324 (C) 315 (D) 321 73. Consider a {logical address space of“ 8 pages of 1024 words mapped into memory of 32 frames. HoW'many bits are there in the physical address ? - (A) 9 bits (B) 11 bits (C) 13 bits (D) 15 bits 74. Usingthe SQL GROUP BY phrase with a SELECT statement din, help detect which of the following problems ? ' . _ (A) The multivalue, multicolumn problem, _, 1 (B) The inconsistent values problem ; ' f, (C) The missing values problem , (D) ThQ,general-purpose remarks column problem 75. A system uses FIFO policy for page replacement. lthas 4ipage frames with no pages loaded to begin with. The system first accesses first 100 distinct pages in some order and then access the same 100 pages but now in the reverse order. How many page faults will occur 7 (A) 196 (B) 192 (C) 197 (D) 195 M“— Space For Rough Work 002 15 A-l 002 ‘ 16 Ad ...
View Full Document

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Ask Expert Tutors You can ask 0 bonus questions You can ask 0 questions (0 expire soon) You can ask 0 questions (will expire )
Answers in as fast as 15 minutes