DEPARTMENT OF IT

Question Bank

Programming Fundamental using C (Core 1)

Unit-1

1. Describe data types, variables, keywords using in c language.

2. Define all operators using in c language.

3. Write all the steps written in the c programming.

4. shortnote on getc(), getchar(), putc().

Unit -2

1. Define conditional statement .write all types of conditional statement.

2. What is Iterative statement .write all the iterative statements ?

3. What is the use of keyword BREAK AND CONTINUE ?

4. What is Nested Loop ?

Unit -3

1. What is Function ? 2. Describe call by value and call by reference . 3. What is Array ? Describe all types of Array. 4. Give a suitable program of 3*3 Matrix.

Unit-4

1. Define Structure, How to declaring , initializing and using . 2. What is pointer , define pointer arithmetic . 3. Differentiating between static and dynamic memory allocation . 4. Write file handling operation . 5. What is the use of malloc and calloc functions .

DATA STRUCTURE (Core-3)

Short Questions:-

1. Define data structure.

2. Define algorithm.

3. List out areas in which data structures are applied.

4. List out structure of algorithm.

5. List out properties of algorithm.

6. List out the steps involved in the development of an algorithm.

7. Define Abstract Data Type.

8. List out the classification of data structure.

9. What is linear/primitive data structure?

10. What is non-linear/non-primitive data structure?

11. Gives the names of linear data structure.

12. Gives the names of non-linear data structure.

13. Which are the operations performed on data structure?

14. How to measure the performance of algorithm?

15. What is time complexity?

16. Define space complexity.

17. When empirical testing is used?

18. What is the use of theoretical testing?

19. What is average, best and worst case complexity?

20. Define O notation of time complexity.

21. What is frequency count in apriori analysis?

22. List out the notation that used to express time complexity of algorithm.

Long Questions:-

1. Explain the classification of data structure. 2. 2. Explain various operations performed on data structures. 3. 3. Write a short note on abstract data type. 4. 4. Explain the properties of algorithm. 5. 5. Explain the steps for the development of algorithm. 6. 6. Differentiate between linear and non-linear data structure. 7. 7. What do you mean by algorithm? Give example. 8. 8. Explain efficiency of algorithm. 9. 9. Write a short note on asymptotic notations. 10. 10. Distinguish between best, worst and average case complexities of an algorithm. 11. 11. What do you mean by Time and Space complexity and how to represent these complexity? 1 12. 2. Explain the concept of data type. 13. 13. Find the complexity of following code. for (int i = 0; i < n; i++) { for(int j=I;j<end 15. Find the total

frequency count of following code. i=2n for j=1 to i for k=3 to j n=n+1 end end Short Questions:- 1. Define array. 2. List out application of Array. 3. Which operation is supported by an array ADT? 4. What will happen in a C++ program when you assign a value to an array element whose

subscripts exceed the size of array? 5. What is the index number of the last element of an array with 20 elements?

6. List out the operations performed on Array.

7. Give the number of elements in array a[1:5].

8. Give the number of elements in array a[1:5,1:4,1:3].

9. Give the number of elements in array A[3][2].

10. What is row major order?

11. What is column major order?

12. Write formula to calculate address of elements in one-dimensional array.

13. Write formula to calculate address of elements in two-dimensional array.

14. Write formula to calculate address of elements in three-dimensional array.

15. Define sparse matrix.

16. Define order-list matrix.

17. If the starting address of array a[-2,23] is 100 then what will be the address of 16th element?

18. If the starting address of array a[1:5,1:6] is 100 then what will be the address of a[3,4] element? 19. If the starting address of array a[1:5,1:6,1:4] is 100 then what will be the address of a[3,4,5] element?

20. Write any one difference between row major and column major.

21. What are the disadvantages of array?

Long Questions:- 1. What is an array? Which operations can be performed on Array? Explain with example. 2. How to calculate number of elements in one dimensional array? Explain with example. 3. How to calculate number of elements in two dimensional arrays? Explain with example. 4. How to calculate number of elements in three dimensional arrays? Explain with example. 5. Explain one-dimensional array. How one dimensional array can be represented in memory? 6. Explain two-dimensional array. How two dimensional arrays can be represented in memory? 7. Explain three-dimensional array. How three dimensional arrays can be represented in memory? 8. Explain any one method to calculate memory location for different position in two-dimensional array. 9. What are the applications of an array? Explain each with examples. 10. Explain sparse matrix. What are the benefits of the sparse matrix? 11. Explain order-list matrix. What are the benefits of the order-list matrix? 12. Write an algorithm for insert and delete operation in array. 13. Write an algorithm to implement sparse matrix. 14. Write an algorithm to search element in array. 15. Write program to insert element at position of user choice.

Short Questions:-

1. What is the limitation of sequential data structures? 2. What is linked list? 3. Give real world example of linked list. 4. Explain logical representation of linked list. 5. What are the advantages of singly linked list? 6. What are the disadvantages of singly linked list? 7. Which are the operations performed in singly linked list? 8. What is the need for linked representation of lists? 9. Define circular linked list. 10. What are the advantages of circular linked list? 11. What are the disadvantages of circular linked list? 12. What is the node structure for circular linked list? 13. Define doubly linked list. 14. What are the advantages of doubly linked list? 15. What are the disadvantages of doubly linked list? 16. List out operations performed in doubly linked list. 17. List application of linked list. 18. What is the difference between circular linked list and linear linked list? 19. What is the difference between array and stack? 20. What do you mean by polynomials? 21. Give node structure for the term of polynomial having single variable. 22. How singly linked list representation of polynomials? 23. Define sparse matrix?

Long Questions:-

1. Write short note on linked list. 2. Explain operation of singly linked list with algorithm. 3. Explain circular linked list. 4. What are the advantages of circular linked list over singly linked list? 5. Write

pseudo code to add node at the end in circular linked list. 6. Explain doubly linked list with advantage and disadvantage of it. 7. Write a pseudo code to delete a node from doubly linked list. 8. Explain operation of doubly linked list with algorithm. 9. Write short note on multiply linked lists. 10. Explain application of linked list. 11. Write short note on polynomial manipulation. 12. Write short note on sparse matrix. 13. Explain operation of linked stack and linked queue. 14. Write algorithm for push/pop operation on a linked stack. 15. What are merit of linked stack and queues over their sequential counterparts? 16. How are push and pop operations implemented on a linked stack? 17. Write algorithm for insertion/deletion operation on a linked queue. 18. Write short note on Dynamic memory management. 19. Explain application of linked stack and linked queue. 20. Write a pseudo code for implementing stack using linked list. 21. Write a pseudo code for implementing queue using linked queue.

Short Questions:-

1. Define tree. 2. What is degree of node? 3. Define sibling. 4. Define forest. Also give example of it. 5. Define binary tree. 6. List out type’s binary tree. 7. What is the difference between full binary tree & complete binary tree? 8. List out different techniques to represent tree. 9. List out different operations you can perform on tree. 10. List out traversal of binary tree. 11. What is inorder traversal? 12. What is preorder traversal? 13. What is postorder traversal? 14. What is the maximum number of nodes in a binary tree of depth k? 15. Trace the binary tree of inorder traversal: BFGPRSTWYZ. 16. What are the applications of tree? 17. Trace the binary tree of preorder traversal: PFBHGSRYTWZ. 18. What do you mean by expression tree? 19. Define leaf node and siblings with example. 20. What is threaded binary tree?

Long Questions:-

1.Explain tree data structure. 2. How to represent tree using linked list? 3. Explain binary tree with its representation including advantage and disadvantage. 4. Write a code to insert a node in a binary tree. 5. Write a code to delete a node in binary tree. 6. Explain array representation of binary tree with example? 7. Explain linked representation of binary tree with example? 8. Explain traversal technique of binary tree. 9. Explain inorder traversal with example. 10. Explain preorder traversal with example. 11. Explain postorder traversal with example. 12. Explain application of binary tree. 13. Create a binary tree using inorder and preorder traversal Inorder: D B H E A I F J C G, Preorder: A B D E H C F I J G 14. Create a binary tree using inorder and postorder traversal Inorder: D B H E A I F J C G, Postorder: D H E B I J F G C A 15. Create a binary tree from the following sequence: 14, 34, 22 11 24 33 20. Write algorithm to perform inorder traversal of binary tree. 21. Write algorithm to perform preorder traversal of binary tree. 22. Write algorithm to perform postorder traversal of bina

Short Questions:-

1. Define ordered linear search. 2. Define unordered linear search. 3. Give any one difference between order linear searches and unordered linear search. 4. Write down complexity of worst case and best case in ordered linear search. 5. Write down complexity of worst case and best case in unordered linear search. 6. Define binary search. 7. What are the difference between linear search and binary search? 8.

In linked list, which searching technique is better linear search or binary search? 9. What are the advantages of binary search over linear search? 10. Define sort. 11. Write down complexity of bubble sort and in which situation bubble sort should be used? 12. Write down complexity of insertion sort and in which situation bubble sort should be used? 13. Write down complexity of selection sort and in which situation bubble sort should be used? 14. Write down complexity of quick sort and in which situation bubble sort should be used? 15. Write down complexity of merge sort and in which situation bubble sort should be used? 16. What is the time complexity of merge sort? 17. What is the time complexity of quick sort? 18. Can bubble sort ever perform better than quick sort? 19. Which sorting techniques are an example of divide and conquer? 20. Which sorting techniques is an application of recursion?

Long Questions:-

1. Write short note on linear search with algorithm. 2. Write short note on binary search with algorithm. 3. What are the merits and demerits of binary search? 4. Write the pseudo-code for linear search using array and linked list. 5. Write pseudo-code for binary search using array and linked list. 6. Explain decision tree for binary search. 7. Write short note on bubble sort with algorithm. 8. Write short note on insertion sort with algorithm. 9. Write short note on selection sort with algorithm. 10. Write short note on merge sort with algorithm. 11. Write short note on quick sort with algorithm. 12. Which sorting technique is more suitable to use? Explain in detail. 13. Write pseudo-code for binary search using array and linked list. 14. Write down procedure for bubble sort. 15. Why is bubble sort stable? 16. Write down procedure for insertion sort. 17. Write down procedure for selection sort. 18. Write down procedure for merge sort. 19. Write down procedure for quick sort.

Data Communication and Networking (Core 4)

1. Discuss the use of computer networks. 2. Describe the features of LAN. 3. What is meant by piggybacking? What are its advantages and disadvantages? 4. How are errors caused in transmission lines? 5. Explain the Binary and Manchester encoding techniques with an example. 6. What is meant by congestion? List the ways of avoiding congestion. 7. Discuss the issues in network security. 8. Explain multiplexing technique. 9. Discuss the problems associated with Backward Learning. 10. What is transport address? Who will assign it? 11. Why is layered architecture of network preferred? 12. What is the principal difference between circuit switching and packet switching? 13. Explain how errors are detected using CRC. 14. What is meant by Pipelining? Discuss the merits and demerits of using this technique. 15. Discuss about any two methods of framing. 16. Compare virtual circuits and datagrams. 17. List the features of internetworking. 18. What is modern and codec?

19. What is flooding? What are its disadvantages? 20. What are the primary services offered by a computer network? 21. Mention the advantages of fiber optics. 22. What is meant by narrow band ISDN? 23. What is the significance of flow control? 24. List the drawbacks of simplex protocol. 25. Explain the use of bridges. 26. What is meant by inter networking? 27. List any four services of transport layer. 28. Mention the need for domain name system. 29. What are the components of multimedia? 30. What are the goals for setting up networks? 31. List the components of data communications. 32. Mention the advantages of co-axial cables. 33. What are satellite networks? 34. Briefly list the problems with single channel. 35. What is the need for routing algorithm? 36. List the features of token bus protocol. 37. Compare TCP and IP services. 38. Write a note on e-mail.

1. With a neat diagram, explain OSI reference model. 2. Describe the relative advantages and disadvantages of

a. Terrestrial links b. Satellite links and c. Optical fiber transmission.

3. Describe the error detecting and correcting techniques employed in data communication. 4. Discuss about collision free protocols. 5. Discuss the function and structure of e-mail protocol. 6. Write short notes on

a. Packet Switching

b. Message Switching

c. Circuit Switching

7. Explain the transport layer connection management. 8. Explain the bus type topology and ring type topology networks. Compare their performance. 9. What are the objectives of computer communication networks? What are the network

components? Explain. 10. Explain the function of TCP/IP protocol. 11. Explain ISDN architecture and its services. 12. Describe the sliding window protocol for data link layer. 13. Describe the congestion control algorithms. 14. Explain IEEE’s logical link control protocol used for LAN. 15. Explain the traditional cryptography used for network security and privacy. 16. Describe the structure and functions of E-mail protocol.

17. Explain wireless communications and their suitability to computer networks. 18. Explain the design issues of datalink layers. 19. Discuss the method of performing protocol specification and verification. 20. Describe the structure of network layer in the internet. 21. Discuss the services offered by the application layer. 22. Describe the ATM AAL layer protocols. 23. Write short notes on the following

a. World wide web b. High speed LANs.

24. Explain the applications of computer networks. 25. Discuss the methods used for controlling errors in datalink layer. 26. Explain the various media used for data transmission in computer networks. 27. Explain any two protocols used by the datalink layer. 28. Explain the multi path routing algorithm. 29. Discuss the features of ATM networks. 30. Explain the design issues of transport layer. 31. Write short notes on

a. Channel allocation problems b. Simple network management protocol.

1. Define data communications. Explain its four fundamental characteristics 6Marks* 2. Draw basic block diagram of data communication systems and explain different components of system 6Marks* 3. Describe Simplex, half-duplex and full duplex methods of data flow 8Marks 4. Define performance, reliability and security. 5Marks 5. Explain in detail point to point and multipoint connection 5Marks 6. Describe different topologies in which a network is laid out Physically. 10Marks 7. List the differences between LAN,WAN and MAN networks with Examples 8Marks* 8. What are ISPS? List different types of ISP’S and functions in brief? 6Marks 9. Define protocol and explain key elements of protocol. 6Marks 10 Name the four basic network topologies and cite an advantage of each type. 4Marks 11. Explain the three criteria necessary for an effective and efficient Network. 5Marks 12. List the seven layers and its functionality in OSI model. 7Marks 13. Explain the duties of Physical layer and Data Link layer in OSI model. 10Marks 14. List the responsibilities of the Network layer and Transport layer. 10Marks 15. What is the difference between a port address, a logical address and a physical address? 6Marks 16. Give some advantages & disadvantages of combining the session, presentation and application layer in the OSI model into one single application layer in the internet model. 10Marks 17. Explain the functions of session, presentation and application layer in detail. 10Marks 18. Explain TCP/IP architecture with a layer diagram. 12Marks* 19. What are the functions of IP, ARP, RARP, ICMP, and IGMP Protocols at network layer? 6Marks 20. Explain UDP, TCP, and SCTP Protocols at transport layer? 6Marks 21. Explain four levels of addressing employed in TCP/IP protocol. What is the number of bits in IPV4 address? What is the number of bits in an IPV6 address? 6 marks* Explain why most of the addresses in Class A are wasted . Explain why a medium size or large –size corporation does not want a block of class C addresses. 8 marks* What is the network address in block of addresses? How can we find the network address if one of the addresses in

block is given? 8 marks* What is dotted decimal notation in IPV4 addressing ? What is the number of bytes in an IPV4 address represented in dotted decimal notation ? What is hexadecimal notation in IPV6 addressing ? What is the number of digits in an IPV6 address represented in he

Object Oriented Programming in C++ (Core-5)

1. Define Object Oriented Programming. 2. Define Objects. 3. What are the features of Object oriented programming. 4. Define Encapsulation and Data hiding. 5. Define Data Abstraction. 6. Define Data members. 7. Define Member functions. 8. Define Inheritance. 9. Define Polymorphism. 10. List and define the two types of Polymorphism. 11. Define Dynamic Binding. 12. Define Message Passing. 13. List some benefits of OOPS. 14. List out the applications of OOP. 15. What is the return type of main ()? 16. List out the four basic sections in a typical C++ program. 17. Define Token. What are the tokens used in C++? 18. Define identifier. What are the rules to be followed for identifiers? 19. State the use of void in C++. 20. Define an Enumeration data type. 21. Define reference variable. Give its syntax. 22. List out the new operators introduced in c++. 23. What is the use of Scope resolution operator? 24. List out the memory referencing operators. 25. Define Implicit Conversion. 26. What is call by reference? 27. What are inline functions? 28. State the advantages of Default Arguments. 29. Define Function overloading. 30. Define friend function. 31. Write the limitations/ disadvantages of C++ 32. What is meant by Lvalue and Rvalue ? PART – B 1. Explain the basic concepts of Object oriented programming (11) 2. Explain the use of constant pointers and pointers to constant with an example.(11) 3. a. State the differences between class and struct and also illustrate with an example. (6) b. What are the difference between pointers to constants and constant to pointers? (6) 4. a. Write a C++ program using inline function. (6) b. Write a C++ program to illustrate the static function (6) 5. Explain briefly about function overloading with a suitable example. (11) 6. a. Discuss constant and volatile functions. (6) b. What is linkage specification and also explain its need. (6) 7. Explain about call by reference and return by reference with program. (11) 8. Explain Nested classes and local classes with an example (11) 9. Explain in detail about control structures with eg.(11) 10. Write a program to evaluate the following function Sin(x) = x - x3 /3! + x5 /5! – x7 /7! + …. 11 a) What is a friend function . What are the merits and demerits of using friend function?(5) b) Write a program to explain the inline function (6) 12. a) Explain the structure of C++ program (5) b) Write a program to explain the concept of array of objects (6) 13. Explain in detail about formatted and unformatted console I/O operations (11) 14. a) Write about inline function (5). b) Discuss about access specifier. Write about declaring member function inside and outside a class (6) UNIT – II CONSTRUCTORS AND OVERLOADING PART – A (2 MARKS) 1. Define Constructor. 2. List some of the special characteristics of constructor. 3. Give the various types of constructors. 4. What are the ways in which a constructor can be called? 5. What is meant by dynamic initialization of objects. 6. Define Destructor. 7. List some of the rules for operator overloading. 8. What are the types of type conversions? 9. What are the conditions should a casting operator satisfy? 10. How the objects are initialized dynamically? 11. Define abstact class. 12. Define virtual base class PART – B 1. a. Explain the copy constructors with an example? (6) b. Explain explicit Constructors, Parametrized Constructors, and multiple Constructors with suitable example. (6) 2. a. How to achieve operator overloading through friend Function? (6) b. Write a program using

friend functions for overloading <>operators? (6) 3. Explain the wrapper classes with examples? (11) 4. Write a program to add two complex numbers using operator overloading concept 5. Create a class vector to hold an array of integers and perform the following operations using constructor for dynamic allocation of array based on size given as argument a) create two vectors using constructor b) Add the vectors and return the resultant vector c) Multiply all elements in the vector by a given number X and display the resultant vector 6. Write a C++ program to find the area of various 2D shapes such as square, rectangle, triangle, circle and ellipse using function overloading. INHERITANCE AND POLYMORPHISM PART – A (2 MARKS) 1. What are types of inheritance? 2. Give the syntax for inheritance. 3. Define single inheritance. 4. Define multi-level inheritance. 5. Define multiple inheritance. 6. What is an abstract class? PART – B 1. Explain the different types of polymorphism (11) 2. Explain various types of Inheritance. (11) 3. Describe Pure Virtual function with an example. (11) 4. Write a C++ program using this pointer. (11) 5. Write a C++ program using dynamic_const. (11) 6. Explain in detail about cross casting and down casting. (11) 7.a)Explain in detail about the various run time casting in C++ (6) b) Write a C++ program for calculating the are of rectangle and circle using run time polymorphism (5) 8.a) Write a program in C++ to read two strings and perform the following string manipulation function (7) (i) Find the long string (ii) Compare the two strings (iii) Concatenate them b) Explain in detail about dynamic objects. How are they created ? (4) UNIT – III Pointers and arrays , Memory , Polymorphism 1. What is a pointer . Give eg. 2. Give the use of new and delete . 3. Write the use of functions malloc() and free() 4. Explain how to create dynamic objects 5. What is static binding? 6. What is dynamic binding ? 7. What are the types of polymorphism? 8. Define ‘this’ pointer. 9. What is virtual function? 10. When a function is declared as virtual, C++ determines which function to 11. What is pure virtual function? 12. Define RTTI. 13. What is cross casting? 14. What is down casting? 15. How is a string object created ? UNIT – IV FILE MANIPULATION PART – A ( 2 MARKS ) 1. Define manipulators and also mention the manipulators that are used in C++. 2. What is the need for streams? 3. List some predefined streams. 4. What are the possible types that a file can be defined? 5. What are the two methods available for opening the files? 6. 1. Explain about Formattted and Unformatted IO with suitable Example (11) 2. What is manipulator? Difference between manipulators and ios Function? (11) 3. Explain the process of open,read,write and close files? (11)What is global namespacxadecimal notation? EXCEPTION HANDLING PART – A (2 MARKS) 1. What is the need for template function in C++? What are their advantages? 2. What are the drawbacks of using macros? 3. What is Function Template? 4. What are the components of Exception Handling? 5. What is Uncaught Exception? 6. What is the terminate () functions? 7. What are the disadvantages of the exception handling? PART – B 1. Explain the Function template (11) 2. Explain the class template (11) 3. What is the need for exception handling (11) 4. Explain the following function 5. a) What are specifications? In which case are they needed? (6) b)What are the disadvantages of the exception handling mechanism? (6) 6. When do we need multiple catch blocks for a single try block? Give an example? (11) 7.. Explain function template with good example program(11) 8. Discuss exception

Operating System (CORE-6) 1. Explain the layered structure of an operating system by giving typical operations and the objects that are operated in each layer. 2. What is multiprogramming? State objective of multiprogramming. Enlist and explain in brief various multiprogrammed operating system. 3. Define a file system. What are

various components of a file system? State and explain commonly used operations on file. 4. Draw and explain Layered File System. 5. Explain advantages and disadvantages of following file allocation methods:- i) Contiguous Allocation ii) Linked Allocation iii) Indexed Allocation 6. What is disk scheduling? Explain the following types of disk scheduling by giving an example:- i) SSTF Scheduling ii) C-SCAN Scheduling 7. Explain the concept of Process. Draw a process transition diagram and explain the various process states. 8. State and explain various scheduling criteria. Explain the following scheduling algorithms by giving an example: i) Shortest Job First Scheduling ii) Priority scheduling 9. Explain threads. Differentiate between heavyweight and lightweight processes. 10. What is meant by Process Control Block? Draw and explain different fields of PCB. Explain Context Switch by giving an example. 11. State and explain various memory management techniques. 12. What are the advantages of OS portability from the point of view of i) Component Manufacturer ii) Independent Software vendors iii) Programmers iv) Users ? 13. Discuss the main difficulties in writing an OS for a real time environment. 14. Explain Distributed System. 15. Explain various methods for disk allocation. 16. What are the advantages and disadvantages of indexed allocation scheme? 17. Suppose the head of moving-head disk with 200 tracks, numbered 0 to 199 is currently serving a request at track 143 and has just finished a request at track 125. if the queue of requests is kept in the FIFO order 86, 147, 91, 177, 94, 150, 100, 175, 130 What is total head movement to satisfy these request for the following disk scheduling algorithms? i) FCFS ii) SSTF iii) C-SCAN 18. Which algorithm will be used for CPU scheduling in: i) Batch OS ii) Interactive OS iv) Real time OS? Why? 19. State whether following are true or false with justification: i) Multitasking is a kind of multiprogramming. ii) Multi-user system does not imply multiprogramming. iii) Response times are more predictable in preemptive system than in nonpreemptive system. 20. Assume that following jobs have arrived in the order 1,2,3,4 and 5: Job Arrival Time Burst Time Priority 1 0 15 2 2 2 3 1 3 5 5 5 4 6 8 4 5 7 12 3 Give Gantt chart and calculate Avg. Turnaround Time and Waiting Time for: i) FCFS ii) SRTF and Preemptive priority algorithm 21. Define the essential properties of following OS with its advantages and disadvantages. i) Distributed ii) Real Time iii) Time sharing 22. What is the purpose of Command line interpreter? Why is it usually separated from kernel? 23. What is the purpose of system call? 24. What are the differences between user level threads and kernel level threads? Under what circumstances one is better than other? 25. Consider the following set of process with the length of CPU burst time in milliseconds:- Process Burst Time Priority P1 7 3 P2 9 2 P3 2 1 P4 1 4 P5 3 5 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 and all at time 0. a) Draw Gantt chart, illustrating the execution of these processes using FCFS, SJF, preemptive priority and RR (quantum = 1) scheduling. b) What is turn around time of each process for each of the following scheduling algorithm in Part A? c) What is the waiting time for each process for each of the scheduling algorithms in Part A? d) Which of the schedule in Part A, results in the minimal average waiting time(overall process)? 26. Explain the following:- a) Disk Caching b) Sector queuing 27. What are different space allocation strategies? 28. Describe the difference between following:- i) Symmetric and A-symmetric Multiprocessing ii)Time sharing and real time OS 29. What problems could occur of system allowed a file system to be mounted simultaneously at more than one location? 30.One of the drawbacks of early OS was that users lost the ability to interact with their jobs 31. Differentiate between Process and threads. 32. A hard disk has 63 sectors per tracks, 10 platters each with 2 recording surfaces and 1000 cylinders. The address of a sector is given as a triple where c is the cylinder number ,h is the surface number and s is the sector number. Thus 0th sector is addressed

as , the 1st sector is addressed as and so on. Calculate the address of 1050th sector. 33. A hard disk has 63 sectors per tracks, 10 platters each with 2 recording surfaces and 1000 cylinders. The address of a sector is given as a triple where c is the cylinder number ,h is the surface number and s is the sector number. Thus 0th sector is addressed as , the 1st sector is addressed as and so on. Calculate the sector number whose address is . 34. What are the services provided by OS? 35. What do you mean by Zombie state of a process? 36. Give difference between Multilevel and Multilevel feedback queue. 37. Write a program for creation of child process. 38. What is blocked suspended and ready suspended state of a process? 39. What are privileged instructions? Which of the following instructions are privileged? i) Set the value of timer ii) Read the clock iii) Clear the memory iv) Turn off interrupts v) Switch from user to monitor mode 40. Compare Linked and Indexed allocation. 41. Describe the semaphore. How the semaphores help in the process synchronization? 42. Describe resource allocation graph. 43. What are monitors? 44.Consider a system consisting of m resources of the same type being shared by n processes only one at a time. Show that the system is deadlock free if the following condition hold: i) The maximum need of each process is between 1 and m resources. ii) The sum of all maximum needs is less than m + n. 45.Consider the following snapshot of a system Allocation Max Available A B C D A B C D A B C D P0 0 0 1 2 0 0 1 2 1 5 2 0 P1 1 0 0 0 1 7 5 0 P2 1 3 5 4 2 3 5 6 P3 0 6 3 2 0 6 5 2 P4 0 0 1 4 0 6 5 6 Answer the following question using the banker’s algorithm: i) What is the content of matrix “Need”? ii) Is the System in a safe state? iii) If a request from process P1 arrives for (0, 4, 2, 0) can the request be granted immediately? 46. Compare the following main memory organization schemes : contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues: a) External fragmentation b) Internal fragmentation c) Ability to share code across processes. 47.What is the purpose of paging the page tables? 48.Consider the following page reference string 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 for a memory with three frames. How many page fault would occur for following replacement algorithm. i) LRU replacement ii) FIFO replacement iii) Optimal replacement. 49.What is thrashing? How it can be prevented? 50.What advantages do threads have over multiple processes? What major disadvantages do they have? 51.Explain differences betweeniii) Logical and physical address. iv) Internal and external fragmentation. 52.Define critical section. What are the requirements to solve critical-section problem? 53.Write an algorithm to implement a semaphore using:- v) The Swap instruction vi) The Test and set instruction. 54.What is the race condition? 55.Consider the following page reference string A,B,C,D,B,A,E,F,A,B,C,G,F,C,F. How many page faults would occur for the following page replacement algorithm assuming three and four frames? Remember all frames are initially empty: vii) FIFO viii) Optimal ix) LRU 56.Write short note on x) Belady’s Anomaly xi) Thrashing xii) Locality of references 57.How address calculation is done in segmentation? 58.Give memory partition of 100K,500K,200K,300K and 600K(in order).How would each of the first fit, best fit and worst fit algorithm place process of 212k,417k,112k,and 426k(in order)? Which algorithm makes the most efficient use of memory? 59.State and explain the necessary condition that lead to deadlock situation. 60.What is purpose of resource allocation graph? 61.Explain the combined approach to deadlock handling. 62.Why is it difficult to protect a system in which users are allowed to do their own I/O? 63.Explain how relocation helps for the protection of the data. 64.Explain Access-list and access matrix. 65.What is meant by semaphore? What are the drawbacks of semaphore? 66.Consider the following page reference string 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5 Assume page framer =3, pure demand paging. How many page faults would occur for i) FIFO ii) LRU iii) Optimal

algorithm. 67.When do page fault occurs? Describe the action taken by O.S. when page fault occurs. 68.Explain single contiguous memory management technique with advantage and disadvantages. 69.Explain relocatable partioned memory management technique with example. 70.What is deadlock? What are the necessary conditions for deadlock? 71.Explain the working of banker’s algorithm for deadlock avoidance with suitable examples. 72.What are the main characteristics of capability lists and access lists? 73.Explain cryptography in access control techniques.

INTER- NETWORKING(CORE-7) 2. 1 a) What are the different versions of wired Ethernet. Explain it briefly. b) Differentiate between repeaters, bridges, routers, and hubs. [12] 2. a) What are the various types of classes and blocks. Explain with neat diagram. b) How to create subnets from a block of classless IP addresses. With neat diagram. [12] 3. a) What do you Understand the Transmission control protocol transition state diagram. Explain it. b) Explain how the snooping will work in classical Transmission control protocol with neat diagram. [12] 4. a) Explain how the Initial routing tables in path vector routing in unicasting routing protocol. With neat diagram. b) What are the applications of multicasting routing protocol? [12] 5. With help of neat sketch explain the following a) Core-Based Tree Protocol. b) DVMRP. [12] 6. a) Explain how a name or address is resolved in the domain name system. b) What is the role of NVT in a TELNET communication? [12] 7. a) Differences between FTP and TFTP b) What do you understand about the TFTP flow and error control? Explain it. [12] 8. a) What is the roles of SMI and MIB in network management? Explain it, b) Difference between an internet and an extranet.