Scribd
Upload
219 views17 pages

CS - ISRO Previous Solved Papers

Uploaded by

MANAN SETHI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
219 views17 pages

CS - ISRO Previous Solved Papers

Uploaded by

MANAN SETHI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 17
PUBLIC SECTOR UNIT EXAMINATIONS +.ISRO INDIAN SPACE RESEARCH ORGANISATION Computer Science Previous Year Solved Papers Also useful for + HAL + BARC + CIL + BHEL + BEL - DRDO - UPPCL + SAIL + GAIL + DMRC - CRIS & other competitive exams Ge MADE EASY Publications Corporate Office: 4-Al4, Kalu Sarai (Near Hauz Khas Metro Station), New Delhi-110016 E-mail infomep@madeeasyin Contact 011-45124660, 8860378007 Visit us at: ww madesasypublicaions.org ISRO Previous Solved Papers : Computer Science ‘© Copyright, by MADE EASY Publications 1st Edition: 2017, MADE EASY PUBLICATIONS has taken due caren collecting the data and povdng the slutons, before publshing hs book. Insite of hs any inaccuracy printing evar accu then MADE EASY PUBLICATIONS awes no responsbiy. MADE EASY PUL ICATIONS vl ae grate you could pn out ny suc ear Yur suggestions wil be appreciate ‘lights af eserves. No arf publatonmaybereroduced,storednrinvoduced nia reeval system orasmited ‘any form ory any means lecvonc mechanical photo- > e (a) (ASB +C)(DE) (b) (A¥B+C\DE) (©) (A+B=C\DE) (@) (A+B +C\DE) The circuit shown in the given figure is a Ao——+} —P Diy Pe “Top {@) fulladder (b) full subtracter (d) decade counter When two numbers are added in excess-3 code and the sum is less than 9, then in order to get the correct answer it is necessary to (a) subtract 0011 from the sum (b) add 0011 to the sum as a6 a7 as as (¢) subtract 0110 from the sum (d) add 0110 to the sum The characteristic equation of an SR flip- flop is given by (@) Q,,=S+RQ, (b) Qy,=SQ,+5Q, (©) Q,:=5+AQ, A) Qy4= A graph with n vertices and n— 1 edges thats nota tree, is (a) Connected (©) Ever (b) Disconnected (d) Acircuit If a graph requires k different colours for its proper colouring, then the chromatic number of the graph is @1 (b) & k (k-4 > Aread bit can be read (@) andwritten by CPU (b) and written by peripheral (©) by peripheral and written by CPU (d) by CPU and written by the peripheral Eigen Vectors ot| 1 °°9° [cose 1 MADE EASY ISRO: 2007 3 Q.10 The term ‘aging’ refers to (2) booting up the priority of the process in multi-level of queue without feedback. (©) gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking (6) keeping track of the following a page has been in memory for the purpose of LRU replacement () letting job reside in memory for acertain amount of time so that the number of pages required can be estimated accurately. Q.11 Consider a set of n tasks with known runtimes ry, f ... f, to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? (a) Round Robin (b) Shortest job first (c) Highest response rationext (A) First come first served Q.12 Consider a job scheduling problem with 4 [ODS J, up, ug aNd J, with corresponding deadlines : (d,, 0, dy, dh) = (4, 2. 4, 2). Which of the following is not a feasible schedule without violating any job schedule? 8) de, dy Jy Ay ©) do don Jy oy (B) Jy, Jy, Ups dg (Jy dos dso Q.18 By using an eight bit optical encoder the degree of resolution that can be obtained 's (approximately) (a) 18° (©) 28° (0) 34° 140 Q.14 The principal of the locality of reference lustifes the use of (@) virtual memory (b) interrupts (©) mainmemory (d) cache memory Q.18 Consider the following pseudo-code set iat while (<= 1000) begin eee i= it tyend. What is the value of j at the end of the pseudo-code? (4 (b) 5 (6 7 Q.16 The five items : A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue, The two elements are deleted from the queue and pushed back on the stack. Now one itemis popped from the stack. The popped item is (aA (b) 8 wc (dD Q.17 Round Robin schedule is essentially the pre-emptive version of (a) FIFO (b) Shortest job first (@) Shortest remaining time (d) Longest remaining time Q.18 The number of digit 1 presentin the binary representation of 3x 512 +7 x64+5x8 13's (@ a (©) 10 9 (a) 12 Q.19 Assume that each character code consists of 8bits. The number of characters that can be transmitted per second through an synchronous serial ine at 2400 baud rate, and with two stop bits is (@ 109 (b) 216 @ 218 (d) 219 Q.20 If the bandwidth of a signal is § kHz and the lowest frequency is 52 kHz, what is the highest frequency (a) SkHz (©) 47 kHz (b) 10KHz (d) S7 KHZ Q.21 AnEthemet hub (@) functions as a repeater (b) connects to a digital PBX (©) connects to a token-ring network (d) functions as a gateway 4 Previous Years Solved Papers of ISRO Q.22 Phase transition for each bit are used in (a) Amplitude modulation (b) Carrier modulation (c) Manchester encoding (d) NRZ encoding Q.28 Study the following program I precondition :x >= 0 public void demo (int ) { System. out print (x % 10) if ((e1 10) ! = 10) { demo (x/ 10) System, out.print (x % 10) ) Which of the following is printed as a result of the call demo (1284)? (a) 1441 (&) 344g (©) 12344321 (d) 49211284 Q.24 Bit stuffing refers to {a) inserting a 0 in user stream to differentiate it with a flag (b) Inserting a 0 in flag stream to avoid ambiguity (6) appending a nipple tothe flag sequence (d) appending a nipple to the use data stream Q.25 Whatis the name of the technique in which the operating system of a computer ‘executes several programs concurrently by switching back and forth between them? (@) Partitioning (0) Mult-tasking (6) Windowing (a) Paging Q.26 If there are five routers and six networks in intranet using link state routing, how many routing tables are there? (@1 (o) 5 (6 1 Q.27 Virtual memory is (@) Part of Main Memory only used swapping (b) Atechnique to allowa program, of size more than the size of main memory, to nun MADE EASY (©) Part of secondary storage used in program execution (d) None of these Q.28 The level of aggregation of information required for operational control is (@) Detailed (b) Aggregate (©) Qualitative (a) None of these Q.29 Tho set of all Equivalence Classes of a set AotCardinality © (2) is of cardinality 2° (b) have the same cardinality as A (6) forms a partition of A (@) is of cardinality Q.30 0.75 decimal system is equivalent in octal system (@) 0.60 (b) 052 (©) 084 (d) 050 Q.31 InanSRlatch made by cross-coupling two NAND gates, if both Sand Rinputs are set 00, then itwill result in (@) Q=0,0=1 (b) Q=1,Q=0 (0) Q=1,.@= (4) Indeterminate states Q.32 Identify the correct translation into logical notation of the following assertion. Some. boys in the class are taller than all the girls Note: taller (x,y) is true ivi taller then y. (a) (Bx\(boy(x) > (¥ y)igirl{y) and taller(x,y))) (b) (90092) and fainky) and talon) (6) (Bxi(boy(x) > (¥ yigirlly) > taller(x,y))) (€) GeNboy(s) and yXaIn(y) > taller) Q.33 Company Xshipped § computer chips, 1 of which was defective, and company Y shipped 4 computer chips, 2 of which were defective. One computer chip is to be chosen uniformly at a random fram the 9 chips shipped by the companies. If the chosen chip is found to be defective, what is the probability that the chip came from the company Y? MADE EASY ISRO : 2007 5 on (a) (b) (9) ; win win S) Q.34 Ring counteris analogous to (a) Toogle Switch (b) Latch (©) Stepping Switch (a) $-R slip flop Q.35 The output and 1 levelfor TTL logic family 's approximately (a) O.tandSV — (b) 0.6 and 3.6V (c) 0.8 and 1.75V (d) 1.75 and0.9V Q.36 Consider a computer system that stores a floating-point numbers with 16-bit mantissa and an 8-bit exponent, each in two's complement, The smallest and largest positive values which can be stored are (a) 1x 10-78 and 2'5 x 1012 (b) 1x 10-258 and 25 x 10298 (0) 110-7 and 2'8 x 101% (A) 1x 10-7 and (2"°— 1) x 10%” Q.37 In comparison with static RAM memory, dynamic RAM memory has (@) lower bit density and higher power consumption (b) higher bit density and higher power consumption (c) lower bit density and lower power consumption (d) higher bit density and lower power consumption Q.38 The Hexadecimal equivalent ofO 11111 0011011110001 tis (a) COT3E (b) ABDSF (o) TCDES (a) FAACD. Q.89 Disk requests are received by a disk drive for cylinder 5, 25, 18, 3, 99, 8 and 35 in that order. A seek takes 5 msec per cylinder moved. How much seek time is needed to serve these requests for a Shortest Seek st (SSF) algorithm? Assume that the arm is at cylinder 20 when the last of these requests is made with none of the requests yet served (a) 125msec (©) 575 msec (b) 295 msec (d) 750 msec Q.40 Consider a system having 'm' resources of the same type. The resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of ‘m’ that ensures that deadlock will never occur is @ 1 (b) 12 ©) 13 (a) 14 Q.41 A task in a blocked state (@) is executable (b) is running (c) must still be placed in the run queues (d) is waiting for some temporarily unavailable resources Q.42 Semaphores (a) synchronize critical resources to prevent, deadlock (b) synchronize ertical resources to prevent contention (@) are used to do input / output (d) are used for memory management Q.43 On a system using non-preemptive scheduling, processes with expected run times of §, 18, 9 and 12 are in the ready queue. In what order should they be run to minimize wait time ? (@) 5.12,.9,18 (b) 5.9.12, 18 (©) 12,18,9,5 (@) 9,12, 18,5 Q.44 The number of page frames that must be allocated to a running process in a viral memory environmentis determined by {@) the instruction set architecture (b) page size (6) number of processes in memory (@) physical memory size Q.45 A program consists of two modules executed sequentially. Let f(t) and 1) respectively denote the probability density functions of time taken to execute the two modules. The probability density function of the overall time taken to execute the program is given by 6 Previous Years Solved Papers of ISRO MADE EASY A @) 19+ 410 (0) JAlehlddx ° : (0) [Heol —a}de (a max (4(9, 410) 2 Q.46 Consider a small 2-way set-associative memory, consisting of four blocks. For choosing the black to be replaced, use the least recently (LRU) scheme. The number of cache misses for the following sequence of block addresses is 8, 12.0, 12, 8 (a2 (b) 3 (4 ony Q.47 Which commands are used to control access over objects in relational database? (@) CASCADE and MVD (0) GRANT and REVOKE (©) QUE and QUIST (a) None of these @.48 Which ofthe folowing is aggregate function in SQL? (a) Avg (0) Select (c) Ordered by (d) distinct Q.49 One approach to handling fuzzy logic data mightbe to designa computer using ternary (base-3) logic so that data could be stored as “true”, “false”, and “unknown.” If each ternary logic element is called a fit, how many fts are required to represent at least 256 different values? @a 5 sé @7 Q.50 A view of database that appea application program is known as (a) Schema (0) Subschema (c) Virtual table (4) None of these toan Q.51 Armstrong's inference rule does not determine (2) Rettexivity (©) Augmentation (6) Transitivity (@) Mutual dependency Q.82 Which operation is used to extract specified columns from a table? (@) Project (b) doin (©) Extract (d) Substitute Q.53 In the Big-Endian system, the computer stores (@) MSB of data in the lowest memory address of data unit (b) LSB of data in the lowest memory address of data unit (6) MSB of data in the highest memory address of data unit (d) LSB of data in the highest memory address of data unit Q.54 BCNF isnot used for cases where arelation has (@) Two (or more) candidate keys (b) Two candidate keys and composite (6) The candidate key overlap (d) Two mutually exclusive foreign keys 2.85 Selection sort algorithm design technique is an oxample of (@) Greedy method (0) Divide-and-conquer (6) Dynamic Programming (@) Backtracking Q.56 Which of the following RAID level provides the highest Data Transfer Rate (Read /Write) (@) RAID 1 (b) RAIDS. () RAID 4 (d) RAIDS Q.57 Which of the following programming languages (s) provides garbage collection automatically (@) Lisp (b) Cre (6) Fortan (ac Q.58 The average case and worst case complexities for Merge sort algorithm are (@) O(r4), Or?) (b) O(7), O(nlog,n) (©) Onoggn). O(n) (@) O(n1095).(nlog,n) .59 The time taken by binary search algorithm to search a key in a sorted array of n elements is 2007 z MADE EASY ISRO: (a) Oleg, n) {b) On) (c) Qniog,n) (a) Or?) Q.60 Which of the followings correct with respec to Two phase commit protocol? (a) Ensures serializabilty (b) Prevents Deadlock (c) Detects Deadlock (d) Recover from Deadlock Q.61 The Fibonacci sequence is the sequence of integers (@) 1,3,5, 7,9, 11, 13 (©) 0,1, 1,2,8,5,8, 13, 21, 54 (©) 0,1,3,4,7, 11, 18, 29, 47 (0) 0, 1,3, 7, 15 Q.62 Let Xbe the adjacency matrix of a graph G with no self loops. The entries along the prine'pal diagonal of Xare (@) allzeros (b) all ones (6) both zeros and ones (A) different Q.63 Which of these is not a feature of WAP 2.0 (@) Push and Pull Model (6) Interface toa storage device (¢) Multimedia messaging (a) Hashing Q.64 Feedback queues (a) are very simple to implement (©) dispatch tasks according to execution characteristics (6) are used to favour real time tasks (@) require manual. intervention implement properly Q.65 Which of the following is not a UML DIAGRAM? (a) Use case (b) Class diagram (c) Analysis diagram (d) Swimiane diagram 2.66 Silly Window Syndrome is related to (@) Error during transmission (©) File transfer protocol (¢) Degrade in TCP performance (@) Interface problem Q.67 To execute all oops at their boundaries and within their operational bounds is an example of (@) Black Box Testing (b) Alpha Testing (¢) Recovery Testing (a) White Box Testing Q.68 SSL is not responsible for (@) Mutual authentication of client & server (b) Secret communication (©) Data integrity protection (d) Error detection and correction Q.69 A tule ina limited entry decision table is a (@) row of the table consisting of condition entries (b) row of the table consisting of action entries (6) column of the table consisting of condition entries and corresponding action entries (a) columns of the table consisting of conaitions of the stub Q.70 The standard for certificates used on internets (a) X25 (b) X301 (©) x09 (a) Xs09 Q.71 Hashed message is signed by a sender using (@) his public key (b) his private key (6) receiver's public key (@) receivers private key Q.72 An Email contains a texual birthday greeting, a picture of a cake and a song, The order is not important. What is the content-type? (@) Multipart / mixed (b) Multipart parallel (¢) Multipart / digest (d) Multipart alternative Q.73 Range of IP Address from 224.0.0.0 to 239,265,255.256 are (@) Reserved for loopback (b) Reserved for broadcast (6) Used for multicast packets (d) Reserved for future addressing 8 Previous Years Solved Papers of ISRO MADE EASY Q.74 IEEE 802.11 is standard for (@) Ethernet (b) Bluetooth (¢) Broadband Wireless (d) Wireless LANs Q.75 When a host on network A sends a message to a host on network B, which address does the router look at? (a) Port (o) IP (©) Physical (6) Subnet mask Q.76 Which of the following is not an approach of Software Process Assessment? (a) SPICE(ISOMECS504) (b) Standard CMMI Assessment Method for process improvement (e) IS 9001 : 2000 (d) IEEE 2000 : 2001 Q.77 A physical DFD specifies (a) what processes will be used (e) who generates data and who (©) what each person in an organization does (d) which data will be generated Q.78 In UML diagram of a class (a) state of object cannot be represented (0) state is relevant (©) state is represented as an attribute (@) state is represented as a result of an operation Q.79 Which of the following models used for software reliabilly (a) Waterfall (@) cocomo (b) Musa (d) Rayleigh Q.80 Dijikstra’s algorithm is used to (@) Create LSAs (b) Flood an internet with information (©) Calculate the routing tables (A) Create a link state database Po processes it ISRO-2007 : Computer Science Indian Space Research Organization ANSWERS 1. (ce) 17. (a) 33. (c) 49. (c) 65. (c) 2. (a) 18. (b) 34. (c) 50. (b) 66. (c) 3. (b) 19. (c) 35. (b) 51. (a) 67. (a) 4. (a) 20. (a) 36. (d) 52. (a) 68. (a) 5. (d) 21, (a) 37. (b) 53. (a) 69. (c) 6. (b) 22. (c) 38. (c) 54. (b) 70. (d) 7. (b) 23. (d) 39. (b) 55. (a) 71. (b) 8. (a) 24. (a) 40. (a) 56. (a) 72. (b) 9. () 25. (b) 41. (dd) 57. (a) 73. (c) 10. (b) 26. (b) 42. (b) 58. (d) 74, (a) 11. (b) 27. (b) 43. (b) 59. (a) 75. (b) 12. (b) 28. (a) 44. (a) 60. (a) 76, (a) 13. (d) 29. (c) 45. (c) 61. (") 77. (b) 14, (d) 30. (a) 46. (c) 62. (a) 78. (c) 15. (b) 31. (d) 47. (b) 63. (d) 79. (d) 16. (cd) 32. (d) 48. (a) 64. (b) 80. (c) 'Note: “ None ofthe given option is corect. Question may contain insufficient data MADE EASY ISRO : 2007 Eunos (c) 1. o 3. Y= (A+B+AB)C AC+BC+ ABC GA + AB)+ BE (X+¥Z) (YZ) (A+ AYA+B) + BC = C(A+B)+BC AC+8C+8C AC +C(B+B) = C(1+4)=C > pee BV EHDRE) = %: ) (By CVE) (b) The circuit shown in the question is of a full subtractor which is constructed by the help of two half subtractors. (a) When two numbers are added in excess: code and the sum is less than 9, then in order to get the correct answer, we need to subtract 0011 1.e., (3), from the sum, (d) Characteristic equation of SR tlipsop is, Q,., = $+, The characteristic table for SR flip-lop is: @ Ss LR] On 0) o0 [oo o}o}1) 0 or fo 4 oli} 4) x + 0} o 4 + }o}4 | o a{a}oj4 stilil: 10. "1. Drawing the Amap: Se So oo 1 0) i) «lf The characteristic equation wll be 2,., = S40, (b) {the number of vertices are‘ and there are n= 1! edges and is not a tree Considering the graph tobe a simple graph it can be said that the graph is cisconnected (b) Since to properly colour a graph, k different colours are needed. Hence, the chromatic number of the graph is (a) Aread bit can be read by CPU and written by the peripheral (b) Priority scheduling algorithm suffers from the problem of starvation. There might be the case that some low priority process does not get CPU, because of high priority processes. A solution to this problem is Aging. Aging refers to gradually increasing the priority of jobs that wait in the system fora long time to remedy infinite blocking. (b) Throughput refers to total number of tasks execuled per unit time. Shortest job first scheduling algorithm will result in the maximum throughput be shortest jobs will be executed first hence many task will be completed. cause all the 10 Previous Years Solved Papers of ISRO MADE EASY 12. (b) arrived and are then preempted after the Since the deadline of Jobs ‘VJ,’ and ‘J,’ is time quantum expires. Later, they are less as compared to the other two jobs, insertedin the job queue and again get CPU hence these two jobs must be executed for the fixed time quantum is required first. So, completing J, atter J, is will not So, it can be said that it's the pre-emptive be a feasible schedule of the four jobs version of FIFO. 13. (d) 18. (b) By using an 8-bit optical encoder, the Bx51247x64+5x8+3 degree of resolution that can be obtained 3 (241)2%+ (24241)284 (2241) 284 (241) is Ho 2194284 284 274 24 284 224 21420 360 = 11111101011 Sp 1A degree Therefore, total number of 1's are 9. 44, (d) 19. (c) ality ofreterence isa term which ie used Baud rate = 2400 where the related storage locations are Total number of bits = 8+1 start bit + 2 frequently accessed, A cache is used in stop bits Which the content of the memory locations 11 bits that are related to the memory location Number of characters transmitted / sec currently accessed in moved to the cache 2400 _ 549 sa-o18 will the possibilty that it will be accessed. 1 Hence, 218 characters can be transmitted 15. (b) per second, ‘On execution of the program, initially = 1 ‘x'=1; while condition is true, so now x = 2, 20. (d) i = 2, again condition satisfies, so now, Bandwidth = 6 kHz x = 4,1 = 3, again condition is satisfied Lowest frequency = 52 kHz x = 16, i = 4; condition is satisfied so Bandwidth = Highest frequency ~ Lowest x= 2',/=5. This time the condition will be frequency false. So, the value of will be 5 at the end. = S=x-82 = x = 57 kHz 16. (d) The highes! frequency will be $7 kHz. Four items are pushed into stack A, B, C, . 21. (a) D, E where Top is pointing E, Now 4 An ethernet hub functions as a repeater. In elements are deleted! and enqueue into telecommunications, a repeater is an ‘queue, So queue contain ED, C, Bwhere 4 Nea Banttontnontey E electronic device that receives a signal and fer is pointing B and Front pointing retransmits it at a higher level or a higher Now two elements are deleted from the power ‘queusiie, Eand Drespectively and pushed back on the stack ie., e, dwhere stack 22. (e) Top pointing Drow delete one element from Manchester encoding (also known as phase stack gives D. encoding) is a line code in which the encoding of each data bitis either low then 17. (a) In round robin scheduling algorithm, the processes run for a fixed time quantum in the same schedule in which they have high, or high then low. A logic‘0'isindicated by a‘0'to'T' transition at the center of the bil and the logic 1” is indicated by a ‘I’ to ‘0! transmission at the center of the bit The level of aggregation of information required for operational controls detailed MADE ERSY ISRO : 2007 n 23. (d) 29. (c) sonit25 The set of all equivalence class of a set A a of cardinality C forms a parition of A vit) serene 30. (a) — ce O75x8=0 [caryé] ois sens So (07), - (060 seni) dent pit) 31. (@) a naSR latch, made by cross coupling two ent) srinkt) NAND gates, if both S and R inputs are set The result will be 43211234. to 0, logic state is said to be in an indeterminate state or racing state. Race 24. (a) condition oceurs and output becomes Bit stutfing refers to inserting 0 in user cneabie ‘stream to differentiate it with a flag. ©, flag = 1911911 32. (d) user stream = 1111111011110, Considering each option: So bit stufing ie 1119110011110 + There exist some x, such that if is a boy then for every'x’yis agi andtaller 28. (b) than, eee In computers, mutitasking is a concept of + There exist any’ such thet’ a a boy performing multiple tasks over a certain andevery‘y is a gil and xis taller than period of time by executing them ”. concurrently, Now tasks start and interrupt «There exist an ‘x’ such that It's’ is a already started ones before they have boy then for every-x, if 'y is a girl then reached completion, instead of executing wig taller than the task sequential, so each started task + Some boys in the class are taller than needs to reach its end before anew one is all the girls. started 33. (c) 26. (b) Sines there are § routers, hence there will Probability of chip shipped by x be § routing tables. Since overy routorhas ts own routing table Probably of chip shipped by ¥ 27. (b) Probability of defect chip from x Virual memory is a memory management technique that is implemented using both Probability of defect chip from Y hardware and software. It maps memory Probability of defected chip from addresses used by a program, called virtual 40 addresses, into physical addresses in axe ‘computer memory. Main storage as seen Y= a9) 51) contiguous address space or collection of contiguous segments. 34. (c) 28. (a) Ring counter is analogous to stepping switch. A stepping switch electromechanical device which allows an san 2 Previous Years Solved Papers of ISRO MADE EASY inputconnection tobe connectedtooneot 41. (d) a number of possible output connections, Atask in a blocked state is waiting for some Under the control of a series of electrical temporarily unavailable resources. A pulses process thatis blocked! is one thatis waiting 35. (6) for some event, such as a resource becoming available or the completion of an The acceptable input signal voltage ranges input Poutouraperation from 0 volts to 0.8 volts fora low logic stat, P ere and 2 volts to § volts for a high logic state. 42. (b) a8. (3) Semaphores are used for synchronization Somaphoros ensure that only one process The smallest and largest possible values is in its crtical section at a lime. They that can be stored are 1 x 10-18 and : : synchronize critical resources to prevent (235 1)x 10% contention 37. (b) ) 43. (b) Static RAM has lower density because there n order to reduce wait time, shorted job are 6 transistors while DRAM has one + first is the scheduling policy that can be transistor and capacitor. Therefore density lisod. So. the chosuion manner at the (SRAM) < Density of (ORAM). A DRAM has ‘ , processes should be §, 9, 12 and 18. capacitor, therefore power consumption (ORAM) > (SRAM) 44, (a) So, dynamic RAM memory has higher bi The number of page frames that must be density and higher power consumption, allocated to a running process in a virtual memory environment is determined by instruction set architectures. The frames will be allocated as per the instruction sets that are allowed, 45. (c) Since the twomodules execute sequentially, The total runtime of the programis the sum of runtime of the two module. Probability density function of overall time taken Total number of seeks H (20-18) + (25~ 18) + (39-25) + (39-8) = Jfeet ade + (8-5) +(5-3)=59 Each take § ms per cylinder. 46. (c) Total time = 59 x 5 = 295 ms Sequence of block addresses 8, 12,0, 12,8 40. (a) Minimum value of m' can be obtained by #0_|seto taking (peak demands) ~1 {rom each we) process and adding 1 to it ‘set =(B-1)4 (4-14 (6-144 =i Total number of cache misses are 4 BCNFis not used for cases where arelalion has two candidate keys and composite. MADE ERSY ISRO : 2007 3 47. (b) 55. (a) GRANT, REVOKE and DENY are the three Selective sort algorithm design technique commands that are used to control access is an example of greedy method over objects in relational database. Data : 56. (a) control language is apart of SQL that allows AID level 1 provides the highest data gatabase eee awe transfer rate (read /write). RAID levels 2, 3 Seourily access te relational database and 4 are theoretically defined but not used 48. (a) in practice ‘Avg! is an aggregate function It gis an aggregate function is SQL. | 57. (a) tako the average of the input set provided [SSP provide garbage collection tothe query. automatically, whereas Fortan, C++ and C don't provide automatic garbage collection. : 58. (d) Number of values to be represented = 256 Merge sot algorithm has complexity of O(n Iftake fit = §, 3°= 243, which is insufficient log,n)in both average case as well as worst to hold 256. So, answer willbe, since 3°= oe 729, which is sufficient to hold 256 values. 59. (a) 50. (b) . Binary search redluce its search space to The external evel is the user's view of the halfin each ofits iteration. So, the time taken database end is closest to the users, A by binary search algorithm to search akey subschema expresses the external view. ima sorted array of melementsis Ollog,n) 51. (a) 60. (a) Armstrong's inference rule satitos Two phase commit protoco! ensures () Reflexivity, Ye X then X—> ¥ serializabiliy It does not prevent deadlock (i) Augmentation if X ¥then XT YT Neither it detects deadlock nor it recover (iii Tansitvity, if X> ¥, ¥> Zthen XZ trom deadioox 52. (a) 6. ¢) To extract a specified column trom a table None of the options is correct. In fibonacct projection operation is used. To extract a series previous two action give the next specified row in table, selection operation term value. Hence none of the options used satisty the propery. 53. (a) 62. (a) Two system are used for mapping (#) Big Since the graph Ghas no self loops, hence endian system (i) Little endian system. In there is no edge from a vertex to itset. big endian system, MSB of the data is in Hence, the corresponding entry will be 0. lowest memory address of data unit and So, the entries along the principal diagonal SB of the dataisinhighor memory address of Xare all zeros. of data unit 63. (d) 54. (b) WAP 2.0 is a push and pull model. It provides interface toa storage device. Also, it provides multimedia messaging Hashing is not a feature of WAP 2.0.

You might also like