D 11664 (Pages : 2) FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, DECEMBER 2005 IT 2K 502. GRAPH THEORY AND COMBINATORICS ‘Time : Three Hours ‘Maximum : 100 Marks Part A Answer all questions, Each question carries 5 marks, 1. (a) Draw the plantonie bodies. (b) Write the chromatic polynomial of $7 (e) Write Kruskal’s algorithm of finding a maximal spanning tree. (a) Write the Dijkstra’s algorithm, How many three digit numbers ean be formed using the digits 1,3, 5,4, 6,8 and 8? Also find how many can be formed if no digit can be repeated. () In how many ways ean a committes of 5 be chosen from 9 people and how many committees ofS or more can be chosen from 9 people ? Find the generating function to count the number of integral solutions te e, +e, +e, = 10if for earch i, 0 1 Calculate BOO = x =—__.. (7 wears) “ 5 xXF-5X+6 Solve a, -Sa,_; + 6aq.2 =" forn 22 (8 marks) Or Solve a, -7a,-2 + Wa,.2=73" forn22. (7 marks) Solve a, =7e,,2 = 2n, where n = 3! for k> 1 anda, = 5/2. (8 marks) [4x 15 = 60 marks}D 11665 (2 Pages) Names Reg. No.. FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, DECEMBER 2005 IT 2K 503—INFORMATION THEORY AND CODING Time : Three Hours i Maximum ; 100 Marks Answer all questions, L. (a) Define joint enteopy H (X, Y} conditional entropy } (84) and mutual information 1 (X : ¥. tb) Explain Huffman procedure fur constructing binary code, (c) Define minimum distance of a linear block code and show that it is equal te the minimum weight of non-zero code wavd. (d) Show that che non-zero code polynomial of minimum degree in a eyelie code is unique. fo) Construct the prime field GF(11) with modulo-L1 addition and multiplication. ( Letu,v,....u, by "2" vectors im a vector space “V" over a field "F". Show that the set of all linear combinations of u,, 0... .., 0, forms of subspace of V. fg} Define code rate and fractional rate loss with respect to convelutional eode and explain. {h} Define and explain about interleaved codes (8x5 = 40 marks} (a) Two sources emit messages {x,, x, i} with probabilities Bs Povey Py} and day ity with probabilities (a, ay} Prove that entropy. byt HO) < - Ya,ten, (a) ‘ (15 marka) Or (b) GI Adisereta memoryless source with A = fa, 6, c} emits the following string — becacheceecceccecaccen ‘Using the Lempel-Ziy algorithm, encode this sequence and find the code dictionary and the transmitted sequence. (12 marles) (ii) State Shannon's information eapacity Uncorem. (3 marks) TL. fa) 4) Explain the procedure for constructing standard array for an (n, 2) linear block eode and deseribe syndrome based decoding scheme far linear blocks vada. (12 marks) Gi) Define Hamming eode. (3 marks) Or ‘Turn over; 2 “ Dinees tb) G) If g 0 is 2 polynomial of degree n ~ K and is factor of X* + 1 then show that y (X) generates an (a, £) cyclic code. (8 marks) Gi) Consider the (7, 4) eyeliv code generated by y OX) = 1+ X +X Find the code polynomial corresponding to the messagu polynotsiul » (X) = 1 + X* in systematic form. F marks) IV. @) @_ Define characteristic and order of the finite field and explain. {6 marks) (i) Let“a* be a non-zero clement in a finite field GP (g). Show that @*-'= 1 and “n" divides q-h {9 marks) Or (b) Define BCH code and cxplain decoding procedure of the BCH codes. (5 marks) ¥. (a) Consider rate },, constraint length 3 convolution encoder with generator polynomials #"(D)= 1+ D+ DP and er(D)= 1+ DF G) Draw encoder and state dingram (ii) Construct trellis diagram curresponding to the message length of 5 bits. (ii) ‘Trace the path corresponding to the message 10110 and find the code pulynomisl G46 53 = 15 markey Or (b) Gi) Explain distance properties of convolution codes. (8 marks) Gi) Explain stack algorithm for decoding of convolutional codes. (@ marks) [4x 15 = 60 marks) 2D 11661 Name. auittOnt.uncior Reg. NoLA0G free. FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, DECEMBER 2005 TICS 2K 505. OPERATING SYSTEMS Kime : Three Hours Maximum : 100 Marks Answer all questions. 1. (2) Explain the different ways of requesting services from the Operating systems. (®) What is a Thread ? What are its characteristics ? (©) Explain with an example, how interrupts ere used in solving critical section problem. (d) Explain the role of context switching in Round Robin scheduling. (2) Explain the Least frequently used replacement algorithm. What are its disadvantages ? (® Briefly explain the various policies used in defining any paging algorithm. (@ What is a capability ? What agg its properties ? (h) What is a directory ? List some of the commands used to administer a directory. “(8x 5 = 40 marks) 2. (a) Describe the interrupt-driven I/O operation. Or (b} With the help of a diagram, deseribe the besie functions of en operating system. 2. (a) Explain how deadlocks can be detected using graph models. Or (b) State the Reader-Writer problem. What are the different ways of solving the problem ? Explain how it is solved using semaphores. 4. (3) Explain the basic strategies used for memory allocation, Or (b) Explain the principle of operation of segmentation and explain how it is implemented. 5. (ad (bo) Explain in detail, about the block management performed by the file manager for random access storage devices. Or What is a file descriptor ? Describe the contents stored in a file descriptor. (4 « 15 = 60 marks)D 11661 lime fay ib} te) td) e) ® (eo th) fa} (b} fa (b} ta} tb) tal tb) FIFTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, DECEMBER. 3005, TTS 2K 505. OPERATING SYSTEMS : Three Hours Maximum : L00 Marks Answer all questions. Explain the different ways of requesting services from the Operating systems. What is a Thread ? What are its characteristics 7 Explain with an example, how interrupts are used in solving critical section prablem, ‘Explain the role of context switehing in Round Robin scheduling. Explain the Least frequently used replacement algorithm, What are its disadvantages ? Briefly explain the various policies used in defining any paging algarithm. What is a capability ? What are its properties ? What is a directory ? List some of the commands used to administer a directory (8 = 5 =40 marks) Deseribe the interrupt-driven VO operation. Or ‘With the help of a diagram, deseribe the basic funetions of an operating system. Explain bow deadlocks can he detected using graph models, Or State the Reader-Writer problem, What are the differentways of solving the problem ? Explain how it is solved using semaphores Explain the basic strategies used for memory allocation. Or Explain the principle of operation of segmentation and explain how it is implemented. Explain in detail, about the block management performed by the file manager for random access storage devices, Or What is a file descriptor ? Describe the contents stored in a file descriptor. (4 * 16 = 60 marks}