PARTB COMPUTER SCIENCE AND INFORMATION TECHNOLOGY 1. @)__ What is indefinite blocking? How can it occur? 4x 10=40) ©) Name the electronic component used in the first, second, third and fourth generation of computers (©) An organization uses an employee code which is formulated by concatenating section id of an employee (alphabetic in nature) with a numeric department code. Specify the employee code as a regular expression (@) _Depict the following scenario in an entity relationship diagram, “Acustomer can make many payments, but each payment is made by only one customer”, (©) Consider a paging system with the page table stored in memory. Ifa memory reference takes 200 nanoseconds, how long does a paged memory reference Gi) If'we add associative registers and 75 percent of all page table references are found in the associative registers, what is the effective memory reference time? (Assume that. finding page table entry in associative registers takes zero time, if entry is there). () Consider the following segment table. Segment Base Length 0 219 600 1 230014 2, BO - .100 3 1327 580 4 198296 ‘What are the physical addresses for the following logical addresses? @ 0,430 Gi) 2, 500 Gi) 3, 400 (vy) 1,10 (@) Identify which amongst the following gates are logically complete and whi ‘Sustty your answer plete and which are universal. @ AND gate Gi) NAND gate Gi) NOT gate (iv) NOR gate CA 2011 109 @ e @ ® CA 2011 List any two ways of implementing page table. A bospital maintains a patient file in which each record contains the following data : Name, Admission date, Social security number, Room, Bed Number, Doctor. Which items ean serve as primary key? (@ Which pair of items can serve as a primary key? ‘Waat are registers? What is the function of following registers Program Counter (PC), Instruction Register (IR)? Compare and contrast the following parameter passing mechanisms in terms of execution Giciency and power to produce side-effects © Cally value-result @ Callby reference GD Callbyname as) How is a compiler different from interpreter? Given a program P having 200 statements. If £, is average compilation time per statement and ¢, is average execution Sine pe satement and f, is average interpretation time per statement. For a specific set of data, let program P execute as follows 20 statements are executed for initialization purposes. ‘This is followed by O iserations of a loop containing 8 statements, followed by the execution of 20 statements for printing the results, sing these compute CPU time required to execute a program using compilation and using interpretation model which is beneficial (as) 4 Gisk pack bas 10 disk plates each having 200 tracks. Given there are 40 sectors per track and cach sector can store 256 bytes, Calculate the total number of bytes that ean be stored in chis pack. ao ‘What isa half adder? Give its definition using a truth table. Desig a logic circuit diagram for ‘he half adder. What are the limitations ofa half adder? How can they be resolved? a5) ao 12o | © @ CA 2011 Subtract 0111000, from 1011100, using complementary method. Check and show your answer using decimal representation. © Divide 100001, by 110, al Find complement of following numbers. @ @ 3% G6 What are the various levels of data abstraction in a database system? How are they used to achieve data independence? ag Consider the following table : EMP (EmpNo, EName, Job, Manager, Salary, Commission, DeptNo) Write SQL queries to perform the following : (@ To display Employee name, salary and department number who are not getting commission, G)__Display name, job and salary of employee who do not have manager, Gi) Display name of employee who have P’ as any alphabet of name. (iv) Display the different job types being offered to employees. a6) Given the following two relations. (a0) R1(A, B,C); R2(B, D, E) A BC BDE ro. Y¥ 1p s 33 Y 2qT Koy Sa Ley Tat Mol 2 N7¥ Perform natural join and equi join of these two relations. Consider the following page reference string : 7,0,1,2,0, 8, 0,4,2, 8, 0,8,2, 1,20, 1,7,0,1 How many page faults would occur for the following replacement algorithms assuming three frames in memory? (FIFO page replacement Gi) Optimal page replacement. a6) ‘All frames are initially empty. 4©) The following are the set of processes with their respective CPU burst time Gz milliseconds) aay Process CPU burst Pr 10 2. PB and PL sw Gantt chart for each of the scenario. ons of passes used in two-pass assembler? Explain pass-1 algorithm. (10) @ explain the criteria on the basis of which data structures used in language processi ecified as) the following segmented paging memory system. There are 4 segments for the given 2 total of 5 page tables in the entire system. Each page table has a total of ical memory requires 12 bits to address it; there are a total of 128 frames. (3) 0x73| [+25] [0-85] [oxoF] [oxiz ox2c| }ox2p| |oxs1| |oxad] | 0x00 o+05| |ox1E| |ox01| Joxsp] |oxop oi7| |orsa| [oxaF| Joxie] | ox66 o-s7| |o-oF| |ox09| }oxec] | ove2 5 |ort4| |or7a| Joxoa| |oxar| | 0x50 6 |oxsB| |or2e| Joxsa| | ox78| | 0x32 Lorn | [orec| |oxs2| [ox] | own ° 1 2 3 4 Page Tables Physical address: memory = 12bits ‘How many bytes are contained within the physical memory? (@) How large isthe virtual address? (Gi) What is the physical address that corresponds to virtual address 0 x 312? Explain ‘agsinst procrams and data CA 2011 ae t+ different security and protection mechanism commonly used for protecting files ao)