CS/IT OPERATING SYSTEMS

Transcription

1 CS/IT 5 (CR) Total No. of Questions :09] [Total No. of Pages : 0 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 06 CS/IT OPERATING SYSTEMS. a) System Boot Answer Question No. Compulsory. Answer One Question from each Unit. b) Define System Calls c) Define Mutual Exclusion d) Swapping e) Atomic transaction f) Recovery g) Streams Maximum marks:70 7X=4 M 4X4=56 M. Explain various operations on processes and how process scheduling is implemented. 3. What are the various services offered by the Operating Systems? Explain. I 4. a) Explain about infinite buffer producer/consumer problem for concurrent processing which uses binary semaphores. b) Write the program for mutual exclusion using semaphores. 5. Write a brief on different scheduling algorithms. II 6. a) Three processes share 4 resource units that can be reserved and reused only one at a time. Each process needs a maximum of units. Show that a deadlock cannot occur. b) In a fixed partitioning scheme, what are the advantages of using unequal size partitions? c) Enumerate the reasons for allowing two or more processes to, all have access to particular region of memory? P.T.O

2 7. a) What are the difficulties that may arise when a process is rolled back as the result of a dead lock? Explain. b) What is the difference between internal and external fragmentation? c) Write a brief on segmentation? 8. a) Explain hash file organization. b) Discuss the address information elements of a file directory. c) Write a brief on RAID 9. a) Explain Log structured File systems. b) Write a brief on Free Space Management c) Write a brief on File sharing and Protection.

3 CS/IT 5 (RR) Total No. of Questions :09] [Total No. of Pages : 0 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 06 CS/IT DISCRETE MATHEMATICAL STRUCTURES Answer Question No. Compulsory. Answer One Question from each Unit.. a) What is well-ordered property of the positive integers b) Write Product rule in counting c) State:Pigeon hole principle d) Define Boolean function e) Define equivalence relation f) What is spanning tree g) Define path of a graph. a) Explain the rules of inference for quantified propositions. b) Write the negation of the following statements. i. Jan will take a job in industry or go to graduate school ii. James will bicycle or run tomorrow iii. If the processor is fast then the printer is slow. Maximum marks:70 7X=4 M 4X4=56 M 3. a) Show that among any n+ positive integers not exceeding n there must be an integer that divides one of the other integers. b) Prove using rules of inference or disprove. i. If it is hot today or raining today it is no fun to snow ski today ii. It is no fun to snow ski today Therefore it is hot today UNIVERSE=DAYS. Duke is a Labrador retriever All Labrador retriever like to swin Therefore Duke likes to swin. P.T.O

4 4. a) How many different license plates are there that involve or letters followed by 4 digits? b) Solve the recurrence relation ar 3ar, r, a0 using generating function. 5. a) How many 5-digit telephone numbers have one or more repeated digits? n n b) Using Mathematical induction, prove that x-y is a factor of the polynomial x y II 6. a) What are the special properties of binary relations? Explain. b) Solve the recurrence relation an 9an 6an 4an 3 0 for n a) Solve a a a n n n 5 n 6 n 3 I b) Define recurrence relation. Explain how to solve recurrence relations by substitution method. 8. a) Explain topological sorting b) Write a brief on multi-graphs and Euler circuits. 9. Write a brief note about the basic rules for constructing Hamiltonian cycles. How to determine whether a graph contains Hamiltonian cycle or not using Grin berg theorem? Explain.

5 CSE/IT 5 (CR) Total No. of Questions :09] [Total No. of Pages : 0 II/IV B.Tech. DEGREE EXAMINATIONS, APRIL/MAY- 06 CSE/IT OPERATING SYSTEMS. a. System Boot Answer Question No. Compulsory Answer ONE question from each Unit b. Process Control Block c. Example for IPC Systems d. Thread Issues e. Swapping f. Purpose of Disk scheduling g. File System mounting Maximum marks:70 7X=4 M 4X4=56 M. What is an Operating System? Explain its purpose and describe the different types of Operating Systems with examples. 3. a. What are the two separate and potentially independent characteristics embodied in the concept of the process? Discuss. b. What resources are typically shared by all of the threads of a process? Explain. 4. a. Give short note about the following: i. Binary Semaphores ii. Bounded Waiting I b. What resources are typically shared by all of the threads of a process? Explain. 5. a. Describe various operations on threads. Discuss about threads synchronization. b. Write about Kernel level threads. II 6. a. Explain all the strategies involved in deadlock detection and how it is recovered. Explain. b. Explain the structure of the page table. Explain. P.T.O

6 7. a. Discuss the hardware support requirement for the inverted page table structure. How does this approach affect sharing? Explain. b. There exist N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M and the sum of all maximum needs is less than M + N. Show that a dead lock cannot occur. 8. a. Write short notes on: i. Sequential file ii. Indexed sequential file. b. Write a brief on Application I/O Interface and Kernel I/O Interface. 9. a. Write short notes of the following: i. Random disk scheduling ii. Priority disk scheduling b. Explain the functions of a file management system with a diagram.

7 CSE/IT 5(R-5) Total No. of Questions :09] [Total No. of Pages : 0 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 06 CSE/IT DATA STRUCTURES USING C Answer Question No. Compulsory. Answer One Question from each Unit.. Explain the following a) Linked Stack b) Radix sort c) Sparse Matrix d) Compaction e) Symbol table f) Hashing. a) Explain storage structures for arrays. b) Explain any two applications of Stacks. 3. Describe an algorithm to implement the operations of Stacks using arrays. I 4. Write a program to implement the operations of Doubly linked list. 5. a) Discuss about linked Queues. b) Discuss about Dynamic storage management. II 6. Explain Binary search tree traversals with algorithms. 7. Explain different methods to represent Graphs. 8. Write a Program to implement Binary search. Explain with an example. Maximum marks:60 6X= M 4X=48 M 9. Write an algorithm to sort given elements using Heap. Explain with an example.

8 CSE/IT 5 (RR) Total No. of Questions :09] [Total No. of Pages : 0 II/IV B.Tech. DEGREE EXAMINATIONS, APRIL/MAY- 06 CSE/IT DISCRETE MATHEMATICAL STRUCTURES. Write short notes on: Answer Question No. Compulsory Answer ONE question from each Unit a. Define an equivalence relation b. Define one-to-one function with an example. c. Define Tautology and contradiction d. Draw the truth table for disjunction of two statements. e. Draw bipartite graph f. Define isomorphism of graphs and give an example. g. Define a lattice and give an example.. a. Let f : Maximum marks:70 7X=4 M 4X4=56 M be such that f(x)=x+. Is f invertible and if is, what is the Inverse? b. Show that ()() p q p q and p () q r are logically equivalent. 3. a. Define a power set. What is the powerset of {0,,}? b. Show that ()() p q p q is a tautology. I 4. a. How many permutations of the letters ABCDEFGH contain the string ABC? b. What is the solution of the recurrence relation an an an with a 0, a 7? 5. a. Prove that, among 00 people there are at least 9 who were born in the same month. b. Use generating function to find the number of ways to select r objects of n different kinds if we must select at least one object of each kind. II 6. a. Show that divides on the set of positive integers is not an equivalence relation. b. Solve the recurrence relation ak 3ak for k=,,3... and initial condition a a. What are the equivalence classes of 0 and for congruence modulo 4? P.T.O

9 b. Find all the solutions of the equivalence relation a n n an an 8. a. Draw the Hasse diagram for the partial ordering ( A,) B/ A B P(S). b. Show that K n has a Hamiltonian circuit whenever n 3 9. a. State and prove the Four Color problem. on the power set b. A connected multi graph with at least two vertices has an Euler circuit if and only if each of its vertices has even degree.