Download as pdf
Download as pdf
You are on page 1of 1
Section-1 Ol (a) What is difference between a process and a thread? Explain your answers with examples. (b) What is thrashing? Explain different page replace- ment algorithms. Q2 (a) Expalin [SO/OSI sewen layers reference model with detailed functions of each layer. (b) Why analog signal is converted into digital? Explain analog to digital conversion methods. Section-2 ‘Q3 (a) Explain operator overloading in C/C++, (b) What is inheritance and polymorphism? Give an example also in each case. Q4 (a) What are advantages of linked lists over dynamic arrays? (b) What is Hashing? Give few Examples of its appli- cations where hashing is highly useful. O5 (a) Explain the basic phases of software engineer- ing Ilfe cycle. (b) In software Engineering, differentiate between structured-oriented and object-oriented design. Section-3 O6 (a) Why we use normalization? Explain INF.2NF, 3NF with at least one example. (b) Explain three levels of database architecture with one example of each level. Q7 (a) Give the comparison of raster Scanning and Random Scanning? (b) Give description of some 3D techniques for render- ing process, Q8 Compulsory Question. COMPULSORY QUESTION 8. Write only the correct answer in the Answer Book. Do not reproduce the questions. (1) Ifthe highest frequency of a signal is 2100 Hz and lowest frequency of a signal is 200 Hz, sample rate will be: (a) 4000 Hz (b) 4600 Hz (c) 4200 Hz (d) 2300 Hz (2) None of these (2) A456 K modem can download at a rate of Kbps and upload at a rate of Kbps. (a) 33.6; 33.6 (b) 33.6; 56.6 (c) 36.6: 33.6 (d) 56.6; 56.6 (e) None of these (3) A system call provides interface between: (a) A process and a thread (b) A thread and a user program (c) A process and an operating system (d) A process and a user program (e) None of these (4) CPU scheduling information about a process is held by: (aya PC (b) the CPU Register (c) the Cache (d)a PCB (e) None of these (3) An example of Last-In-First-Out (LIFO) data struc- ture is a: (a) Class (b) List (c) Stack (d) Tree (e) None of these (6) In Object Oriented Programming, overload methods: (a) Can have the same types and number of parameters as another method with the same name in the same class as long as the return type is different. (b) Cannot be used as methods that manipulate attri- butes (c) Must always have different number of parameters (d) Must have different number of parameters or if the number of parameters is the same a different sequence of parameter type (¢}) None of these (7) If you wanted to sort many large objects or struc- tures, it would be most efficient to: (a) Place them in an array and sort the array (b) Place pointers to them in an array and sort the array (c) Place them in a linked list and sort the linked list (d) Place references to them in an array and sort the array (¢}) None of these (8) The type of the variable a pointer points to must be part of the pointer’s definition so that: (a) Data types do not get mixed up when arithmetic is. performed on them. (b) Pointers can be added to one another to access structure members (c) No one’s religious conviction will be offended (d) The computer can perform overloading (e) None of these (9) 1f we have a tree of n nodes, its depth can be calcu- lated as: (a) Log? (n+1)— 1 (b) Log? n (c) Log? (n+1)—-1 (d) Log lO (n+1)— 1 (¢}) None of these (LO) Which one of the following methods does not change the original value of the argument in the calling function? (a) Call by passing reference of the argument (b) Call by passing the address of the argument (c) Call by passing value of the argument (d) Call by passing pointer of the argument (¢}) None of these (B) Write short notes on the following: (a) Virtual Memory (b) VLAN (c) 802.11b (d) BIOS (e) FAT32

You might also like