6th Semester (Dec-2015; Jan-2016) Computer Science and Information Science Engineering Question Papers
2 likes1,066 views
The document appears to outline examination questions for various subjects including Compiler Design, Unix System Programming, Computer Networks, Data Compression, and File Structures. Each subject includes multiple parts with specific questions that cover theoretical concepts, algorithms, and practical programming tasks. The structure requires students to select and answer a predetermined number of questions from each part, reflecting a comprehensive assessment of their knowledge in these areas.
![6* ge,n C S
10cs63:USN
Sixth Semester B.E. Degree Examina .2015lJan.20l6
Gompiler Design i ")
- rl,.;,'l4
Time: 3 hrs. Max. Marki::100
Note: Answer any FIVE full questions, selecting ,:{i,
'
atleast TWO questions from each part. t , .i
-,p
PART - A ,. ,,
r*)'
.f; | a. With the help of a diagram, explain the various phases of a compiler. (10 Marks)
H b. What is meant by input buffering? Write an algorithm for look ahead code with sentinels.
. E (04 Marks)
$* c. Construct transition diagram to recognize the tokens below
g 1 i) identifier ii) Relational operator iii) unsigned number. (06 Marks)
6V
-hP ir'
.H+ 2 a. With a neat diagram explain the role of a parser. ' (05 Marks)-
:E & L E-,-r^.:-
^ro^-^7. ^*^-:^^^-. aa. al-al.'E s b. Explain different error recovery strategies. *il :" I (08 Marks)
E a' c. Considerthe context free grammar S ] SS ffi'*'1 a
€ E And the string aar'a* ^:
e'E : n,--- lr- , h
: ; i) Give a left most derivation for the string
E E ii) Give a right most derivatio4sft{Wte string
7 E iii) Give a parse tree for the string'
E f iv) Is the graffrmar ambiguous or unambiguous? Justiflz.
= b ,.i '.'^^^.i^E : v) Describe the language.,generated by this grammar
E' F vi) Remove the left recursion from the grammar?
E .p vii) Left factor thisgiammar. (07 Marks)
;; ,.. ;i{";l .. ,*J!cE
"*#.+,*,*&*,Qo*"Givpn
tgs"gt 't
.,.,,,.Ei S -+a l(L), tbL, S 1s*' * ' '
B H i) Dod*'hecessary changes to make it suitable for LL(1) parser
8"
{ ii) gheck the resultant grammar is LL (1) or not
; E 11, UrIecK Ine resultanr grammar rs LL (i, oI nor
E E :Lr:$tro* the moves made by the predictive parser on the input (a, (a, a)). (12 Marks)
g
E b. Wffitris meant by handle pruning? List the actions of a shift reduce parser. Consider the
B g qffiowing grammar
3 .€ *rMowing grammar
nts *#S -+ TL ;nts r-#S -+ TL ;
Eg ^^' T+intlfloat,Y
=
t.th$
g I r$"l L + L, id lid parse the input string int id, id;using shift reduce parser. (08 Marks)
6 9 **,*
?-h{.}j
QKa# I a. Given the gtammar
*so.lci,aa
:* S-+AA
E A-+Aalb
E i) Consfiuct sets of LR( I ) items
E ii) Construct canonical LR(l ) parsing table (12 Marks)
g b. How LALR parsing table is constructed? Develop an algorithm for the same. (08 Marks)
I of2](https://image.slidesharecdn.com/6thcsdec-jan2016-160317043107/85/6th-Semester-Dec-2015-Jan-2016-Computer-Science-and-Information-Science-Engineering-Question-Papers-1-320.jpg)
![5a.
b.
6a.
b.
PART - B
Give the syntax directed definition to process a sample variable declaration
construct dependency graph for the input float x,y, z.
Write the grammar and syntax directed definitions for a simple desk calculator
annotated parse tree forthe expression 3*5 + 4n.
^@(
" q5*
10cs63
(10 Marks)
methods.
(10 Marks)
1
i', s! :i: i f 3l,r I r'rittqfr
ffiffi llfiFry
r. ,-. ii: i'tt
a.
b.
a.
b.
Draw the DAG for the arithmetic expresston " &
*
a * a * (b - c) + (b - c)*d. Show the steps for constructing the DAG. *&* (10 Marks)
What are three address codes? Explain different ways of representin! ftrree address codes,
with examples. ,*, .r if (10 Marks)
**.* l]r"
Distinguish between static scope and dynamic scope. Brig,flJ explain access to non - local
names in static scope. & (10 Marks)
Explain in detail, the strategy for reducing fragmentatiqg inheap memory. (10 Marks)
Discuss the following terms : " ffi.q *,
i) Basic blocks ii) Next use information Yriii)'Flow graph.
With example, explain common subexpression and dead code elimination
.' * rk x >k x
?i'i{i +:J-'j
;*ll,Iii{ii#:r
#'
qh+d
t"l'q,.'
s
{ifi*b*.''" '' 3
{llrtlui"' Jc* 'b & h"
t q'J&
u%-/
'r: f'!t* 1
w
'2'of 2](https://image.slidesharecdn.com/6thcsdec-jan2016-160317043107/85/6th-Semester-Dec-2015-Jan-2016-Computer-Science-and-Information-Science-Engineering-Question-Papers-2-320.jpg)
6th Semester (Dec-2015; Jan-2016) Computer Science and Information Science Engineering Question Papers
- 1. 6* ge,n C S 10cs63:USN Sixth Semester B.E. Degree Examina .2015lJan.20l6 Gompiler Design i ") - rl,.;,'l4 Time: 3 hrs. Max. Marki::100 Note: Answer any FIVE full questions, selecting ,:{i, ' atleast TWO questions from each part. t , .i -,p PART - A ,. ,, r*)' .f; | a. With the help of a diagram, explain the various phases of a compiler. (10 Marks) H b. What is meant by input buffering? Write an algorithm for look ahead code with sentinels. . E (04 Marks) $* c. Construct transition diagram to recognize the tokens below g 1 i) identifier ii) Relational operator iii) unsigned number. (06 Marks) 6V -hP ir' .H+ 2 a. With a neat diagram explain the role of a parser. ' (05 Marks)- :E & L E-,-r^.:- ^ro^-^7. ^*^-:^^^-. aa. al-al.'E s b. Explain different error recovery strategies. *il :" I (08 Marks) E a' c. Considerthe context free grammar S ] SS ffi'*'1 a € E And the string aar'a* ^: e'E : n,--- lr- , h : ; i) Give a left most derivation for the string E E ii) Give a right most derivatio4sft{Wte string 7 E iii) Give a parse tree for the string' E f iv) Is the graffrmar ambiguous or unambiguous? Justiflz. = b ,.i '.'^^^.i^E : v) Describe the language.,generated by this grammar E' F vi) Remove the left recursion from the grammar? E .p vii) Left factor thisgiammar. (07 Marks) ;; ,.. ;i{";l .. ,*J!cE "*#.+,*,*&*,Qo*"Givpn tgs"gt 't .,.,,,.Ei S -+a l(L), tbL, S 1s*' * ' ' B H i) Dod*'hecessary changes to make it suitable for LL(1) parser 8" { ii) gheck the resultant grammar is LL (1) or not ; E 11, UrIecK Ine resultanr grammar rs LL (i, oI nor E E :Lr:$tro* the moves made by the predictive parser on the input (a, (a, a)). (12 Marks) g E b. Wffitris meant by handle pruning? List the actions of a shift reduce parser. Consider the B g qffiowing grammar 3 .€ *rMowing grammar nts *#S -+ TL ;nts r-#S -+ TL ; Eg ^^' T+intlfloat,Y = t.th$ g I r$"l L + L, id lid parse the input string int id, id;using shift reduce parser. (08 Marks) 6 9 **,* ?-h{.}j QKa# I a. Given the gtammar *so.lci,aa :* S-+AA E A-+Aalb E i) Consfiuct sets of LR( I ) items E ii) Construct canonical LR(l ) parsing table (12 Marks) g b. How LALR parsing table is constructed? Develop an algorithm for the same. (08 Marks) I of2
- 2. 5a. b. 6a. b. PART - B Give the syntax directed definition to process a sample variable declaration construct dependency graph for the input float x,y, z. Write the grammar and syntax directed definitions for a simple desk calculator annotated parse tree forthe expression 3*5 + 4n. ^@( " q5* 10cs63 (10 Marks) methods. (10 Marks) 1 i', s! :i: i f 3l,r I r'rittqfr ffiffi llfiFry r. ,-. ii: i'tt a. b. a. b. Draw the DAG for the arithmetic expresston " & * a * a * (b - c) + (b - c)*d. Show the steps for constructing the DAG. *&* (10 Marks) What are three address codes? Explain different ways of representin! ftrree address codes, with examples. ,*, .r if (10 Marks) **.* l]r" Distinguish between static scope and dynamic scope. Brig,flJ explain access to non - local names in static scope. & (10 Marks) Explain in detail, the strategy for reducing fragmentatiqg inheap memory. (10 Marks) Discuss the following terms : " ffi.q *, i) Basic blocks ii) Next use information Yriii)'Flow graph. With example, explain common subexpression and dead code elimination .' * rk x >k x ?i'i{i +:J-'j ;*ll,Iii{ii#:r #' qh+d t"l'q,.' s {ifi*b*.''" '' 3 {llrtlui"' Jc* 'b & h" t q'J& u%-/ 'r: f'!t* 1 w '2'of 2
- 3. 10cs62USN Sixth Semester B.E. Degree Examination, Dec.2015 lJan.20l6 UNIX System Programming Time: 3 hrs. Max. Marks: !00 Note: Answer FIVE full questions, selecting o at least TWO questionsfrom each part.()! E :: ^. ^_ € PART-A E 1 a. Discuss the differences between ANSI C and K & R C with example for each. (10 Marks) UI € b. What are the API common characteristics? List any six values of the global variable errno fi along with their meanings whenever API's fail. (10 Marks) E9 H= 2 a. Explain the commands to create different file types supported by LINIX. (06 Marks) * :1 b. Explain IINIX Kernel support for files with a neat diagram, (08 Marks) g Y c. Differentiate symbolic links and hard links. (06 Marks) oo ,l coo E q 3 a. Explain the following general file API's: *. r'.',-,;': fl Y i) open( ) ii) fcnt( ) iii) lseekQ)' (12 Marks) E .fl b. Explain Symbolic Link file API's. (08 Marks) UL oB .g S 4 a. Draw and explain the summary of starting and terminating a C program. (06 Marks) S -L b. With a neat sketch, explain the memory layout of a C-program. (06 Marks) 5 u c. Explain exit, _exit and atexit functions with their prototypes. (08 Marks) ESo0< a'ts PART-B ; € 5 a. What is a race condition? Write a program for generating race condition. (08 Marks) -li f b. Explain in detail the fuiily of exec functions. (12 Marks) -z- ts 'Ee € E 6 a. What are sigh4l3fl Write a program to setup signal handler for the SIGINT signal using F F sigaction API. (06 Nlarks) u" E b. What is signal mask of a process? Explain sigprocmask function along with its prototype. $ € (06 Ntarks) A fi c. D+fiirc daemon process. Discuss the basic coding rules of the daemon process. (08 Marks) EE g d ' *&' *E 7 a i Discuss the applications of FIFOs. (04 Marks) F.S ," 3 b " Explain Popen and Pclose functions. (06 Marks) E ^E t* l, c. Explain different API's used with message queues. (10 Marks) 6s.flWo - q q,*ls $ff -b a. Explain shmget, shmctl, shmat and shmdt functions. (12 Marks) , J b. Write short notes on client server properties. (08 Marks) () z ! og
- 4. IUSN lOCS/IS64 Max. Marks:100 leve1. (10 Marks) for policing the (10 Marks) (07 Marks) 255.255.240.0. (06 Marks) (07 Marks) Sixth Semester B.E. Degree Ex , Dec.2015lJzn.20l6 Gomputer Networks - ll Note: Answer any FIVE full questions, selecting atleast TIYO questions from each part. b. o o o L o. 6 o ci o oX G'U oo ll coo .E c O ::J oCaO *.a oaJ o0<63 cd -6 td :! c-X oi !/d :* !o ^.= -^o don uo F> (r< _N () Z (B o a. Time: 3 hrs. 2a. b. PART _ A a. Differentiate between connection oriented and connectionless services. (04 Marks) b. Define routing and its goals. (06 Marks) c. Explain Dijkstra's algorithm. Consider the network given below in Fig. 1(c). Use the Dijkstra's algorithm to find shortest paths from node 4 to other, nodes" (10 Marks) Explain the FIFO and priority queue scheduling for managing traffic at flow Define congestion coutrol with graph. Explain the leaky bucket algorithm traffic at flow level. 3 a. Explain the IP address classification. belong to : . i) 200.58.20.16s ri) 128.167.23.20 'iii) t6.t96.128.s0 iv) 150.156.10.10. Identify the following IP address to which class they A host in an organization has an IP address 150.32.64.34 and subnet mask What is the address of this subnet? Give the format of IPv6 basic header. Compare IPv6 with IPv4. a. Write a note on : i) IGMP protocol il) Mobile IP. b. Explain the three way handshake for establishing a TCP connection. c. Write a short note on routing information protocol. (10 Marks) (06 Marks) (04 Marks) Fig.Q1(c) I of2
- 5. k PART _ B a. Explain the routing table poisoning and denial -of -service attacks. b. Define network management and explain SNMP and SNMP messages. c. Differentiate between DES and RSA. a. Define MPLS. Explain its operation. b.Exp1ainthec1assificationofresourceallocationschemes. c. With a neat diagram, explain the differentiated services QoS. ::: ';t*." ' a. Briefly explain MPEG standards and frame types for compressioii '' t,- b. With a neat dragram, explain theH.323 components and list lheisfens in signaling. c. Explain session initiation protocol (SIP) in detail. 10cb/rs64 (08 Marks) (08 Marks) (04 Marks) (06 Marks) (06 Marks) (08 Marks) (06 Marks) (06 Marks) (08 Marks) 8a. b. c. Write short notes on : i) Zigbee technology il) Clustering in sensor networks. (08 Marks) Briefly explain the direct and multihop,routing of intra-cluster routing protocol, with the help of relevant diagrams. (06 Marks) Explain sensor node structure with l0tevant figure. (06 Marks) {<*x++ 2 of2
- 6. USN c. 3a. b. C 1OCS1IS653 Max" Marks:100 (88 Marks) U o O. tr d {) d {j (JX 6U --tl o! eO :r: =-- ?a. oU u^ d- Uu ia tr5 o..i o= Bo @lE 6E o.! >- ,+ =c3uo E. xL ;>' U< - a.l 0) -7 o a. E Sixth Semester B.E. Degree Examination, Dec.20t15/Jan.20tr6 Tirne: 3 hns. Data Gompression Note: Answer FIVE full questions, selecting at lesst TWO questions from each part" PART _ A a. Explain Lossy and lossless compression Techniques with examples. (s4 Marks) b. For the sequence, 12323454567898910 frnd the entropy. Llsing the differences of neighboring sequences, flnd the entropy and give your comrnent. (08 Marks) c. A source emits letters from an alphabet A : {at, az, a3, a,4, a5} with p(al) : p(a3) : 0"2, p{a2) :0.4, p(aa) : p(as) : 0. 1. i) Calculate entropy of the source. ii) Find a Huffman code for this source. iii) Find average length of Huffman code and hence its redundanc,y. 2 a. Encode the following sequence using LZW algorithm: xyzzy hxyzzy hxyzzy hxyzzy hxllxyJlXyJL The alphabet for the source is {,b, L, *, y, z} . The LZW dictianary inittially looks as fotrlcws: Index I 2 ) -) 4 5 Entry h v 7 ! x (10 Marks) b. Write an algorithm used by CALIC to fbrm the initial prediction and explain this algcrithm. {06 Marks) (04 &{arks} {{}6 fr{arks) 4a. b. Show that SNR of uniforrt quantizer of a uniformly distributed sourct: is 5.S2ndB. (06 Marks) Write down the operation of a jayant Quantizer suppose the multiplier values are Mo: M+:0.8, Mr : Ms:0.9, Mz: Mo:0.1, M:: Mz: l,2. haitial value of the step size 46:0.5,andthesequencetobequantizedis0.l,-0.2,0.2,0,1,-0.3,A1,0.2,0.5,0.9, 1.5. (SB Marks) What is vector quantization? Explain the vector quantization, with a block diagram" (tG Mar}cs) Explain the splitting technique for initializing the LBG algorithm. liraining set vectors are given in Table Q 4b (i) and initial set of output points in Table Q 4b(ii). {18 s4artes) Table 4b (ii) I of2 Briefly exptrain different groups in Facsimile encoding. Wirat is distortion? Discuss different ways to measure distortion. FIe sht 75 65 59 64 5s 57 72 44 62 60 56 7A We eht i80 t2a 119 150 162 88 175 4t Lt4 1i0 91 112 Table 4.b (i) Heieht 45 75 45 80 Weisht 50 n7 tt7 180
- 7. lOCS/IS663 a,Describethepropertiesofu,',.uffi,*,,,.o1soexplain,timeinvarianceandtransfer function of the lrinear system. (06 N[erks) b. Find the inverse z - transform of the function )za + I(z' - zz' -i7+ 4z-l c. Explain the orthonormal transform and that orthonormal transforms are energy preservinpJ. (08 Marks) 6 a. tsy considering the example of encoding the sequence of values {xn} given bellow, explain b. in detail how subband coding works. 10 t4 10 L2 14 8 14 12 10 8 10 t2 What is a filter? Discuss FIR and IiR filters. Discuss c,oding algc,rithrn with a suitable diagram. Also explain the frame structure of layer - iI coding. (08 Marks) 7 a. For seven -- level decomposition shown below in Table Q7 (a) obtain the bitstream generated by the EZW coder ii) Decode the bitstream generated in the previous step. Verify that you the r:riginal co-efficient values. {tr2 Marks) 26 6 13 10 64-7 7 4-4 1'.) 4-3 -20 Table 7 (a) (S6 V{arks} (08 1Iarks) (S4 Marks) (CIS lVlarks) (10 Marks) (06 Marks) (04 Marks) b. Explain rnultiresolution analysis and scaling function with an example. 8 a. With a neat block diagram, Explain ITU - T recommendation H.26L. b. Explain with diagram MPEG - 1 video standard. o. Using Ltr .?-62, derive an error factors for the set of co - efficient. 29.7 5 6.1 -6.03 1.93 -2.01 r.23 -0.95 2.11 {< ,r {< {< ,< 2 af2
- 8. uonAnv 1,USN oo 5o S0 h d Eo d () L ER 8.= y4t Eta oo ll c€ .= c d$ ir 0O YO oE €g o> E* gE bU () z = E8 Sixth Semester B.E. Degree Examina File Structures 1-5lJan.20l6 Max. Marks:100 i! ," i$ ,., & 'rl l:'l '-l rOrsos (05 Marks) (06 Marks) (05 Marks) (10 Marks) (04 Marks) name, employee (06 Marks) (06 Marks) (06 Marks) (08 Marks) 1. a. What do you mean by file structure? Explain in brief a short history of file,stfuoture design. (04 Marks) Time: 3 hrs. 2 a. What do you mean by a with an example. Note: Answer FIVEfull questions, selecting at least TWO questions from euch part. PART _ A Bring out the differences between physical files and logicalfiles. Define the following terms : i) Seek time ii) Rotational Delay iii) Transfer time With neat sketch, explain UNIX directory structure. record? Explain different methods for organizing records of a file b. c. d. b. Explain the tools available in UNIX for sequentr,pJ processing of a file. c. Write a Pack( ) and unpack ( ) methods in C+#fu employee id, employee designation, employee contact number fieldffilf 'variable length records. 3 a. Explain the different limitations of binffy. Jearching and internal sorting. b. Explain the algorithm for keysort. ''"',". ' c. Explain the different operations requiied to maintain an indexed file. dO [! 4 a. Explain how co - sequenti{,f,, cessing is implemented in a general ledger program. 00i6: 6 -ri't""' (10 Marks) E E b. Explain how much tirqqffierge sort takes to sort a given file. (10 Marks) Ed{ 5l ,&ffi PARr-B f E 5 a. What do yoffiair by B - tree? Explain deletion, merging and redistribution of elements on gF B-ftee.-'*" (loNlarks) :" I b. What ar.p.paged binary trees? Explain the problems associated with paged binary trees. E € :."*** (06 Marks) E E c. ffiron the four properties of Bx trees. (04 Marks) lrtD&. =p fl nts 6 q)Define indexed sequential access. Explain the block splitting and merging due to insertion 'E g w& * and deletion in a sequence set with example. (10 Marks) EE""Ne b. Explain simple prefix R* trees and its maintenance. (10 Marks) E@t*, a. What do you mean by hashing? Explain the simple hashing algorithm with example. -.i c.i" (10 Marks) b. What is collision? Explain the process of collision resolution by progressive overflow. (10 Marks) Write a short note on : i) Linear Hashing ii) AVL trees iii) Strengths and weakness of CD Rom iv) Pinned Records. ,k rk ,k ,k ,< (20 Marks)
- 9. USN Sixth Semester B.E. Degree Exarnination, Software Testing Time: 3 hrs. b. d. 7a. d. 8a. b. Explain risk roanagenaent in the quality plan. c. What is test 4pd analysis report. {< * * q< * .tran"2016 Max" Marks:1G0 t0{s55 (07 Marks) (CIS Marks) (08 hdarks) (87 Marks) (08 Marks) (09 &4ar[<s) (03 Marks) (04 Marks) (08 iV{arks} (88 Marks) (S7 Marks) (SS Marks) (CI61V{arks} (02 Marks) (07 Marks) (06 IVIarks) (04 Marks) (03 Marks) (06 Marks) (05 Marks) (CIS Marks) (03 Marks) (07 Marks) (10 Ntarks) (03 Marks) Note: Answer any FIVE full questions, selecting atleast TWO qaestions from esch pfirt" PAR.T _ A I a. Why do we test software? Discuss what a typical test case inforrnation should include. b. C. d o .9 ! c. (3 OJ G ! (JX (dU .o ,, oo ,' oidO a,^ aE oO =-50tr v -v d- L= o! o-X o -.i 6€. 6C !o 5 .:1 > +- ooo -oa,-c E> ^U lr< -N () o z o o. 2 a. What is boundary value analysis? Write the test cases using houndary value anatrysis testing for triangle problern. (87 Marks) b" Defrne equivalence class testing. Write weak robust equivalence class testing for conlmission problem. (06 Marks) c. Write the decision table for triangle problem and discuss how wellL decision iabtre testing b. Differentiate between black box testing and white box testing. c. Explain the levels of abstraction and testing in the waterfall modetr. deals with mu.ltiple fault assurnption. Explain metric based testing. Using Mc-Cabe's strongly connected graph, write the path/edge traversal. Def,rne thread. How do we test them? Explain atomic systern function testing by taking an example of next rlate. What is interaction testing? suitable diagram and explanation. Write six principles which constitute the core of software testing. List the goals of quality process. Cana system be correct and yet unsafe? Write the fault based testing terminology and assumptions" What is scaffolding? What purposes it serves, explain with an example. What are test oracles? Explain comparison based oracle. Write about a paragraph on any one : i) Seif-checks on oracles ii) Capture and replay. Based on test and analysis strategies explain any one : i) Clean room ii) Software reliability engineered iesting ii, Extrerne programming" 3a. b. 4 a" Define regression and progression testing b. Drai,v the context diagram of the SATM system and explain the same. c. Draw the PIN entry finite machine, oxplain with corresponding screens. Draw the lattice on sales and communicatio,n. (Hint slices on sales and commissinn). PART _ B 5 a. What is decomposition*based integration? Explain any one of them with an example. 6 a" Validation activities check work product against actual user requirement while verification activities check consistency of work product - justlify your arlsrr/er w,ith
- 10. USN 10rs665 (10 Marks) (1CI NIarks) Sixth Semester B.E. Degree Examination, Dec"2 an.2015 Gomputer Graphics and Visualiz€ttfion Max. Marks:100 Note: Answer any FIVE fall qwestions, selectt,ng stlesst TWO questions from euch part" ci o o ! E @ d (.) d () ?o d? s.co coo .=N(€+ gii @a -0 tz O0 b0a -o>q -O6 ..r? 6) OE -x trco.v a.z a'i. Sg O.= ;^- (+- o0- ca0 0)= =vF- o- (r< ,i ii z P o. Time: 3 hrs. 2a. b. b. 6a. b. ta. b. 8a. 1r PART _ A a. Explain the concept of pinhole camera of an imaging systern. Also dr:rive the expression for angle of view. (12 Marks) b. Discuss the graphics pipeline architecture, with the help of a functional schematic diagram. (08 Marks) With suitable examples, explain briefly primitives and atfributes" {i0 Marks) Classify the rrajor groups of API functions in openGl. Explain any four of them. (06 Marks) Give any t.,rro differences between additive color model ancl subtrar:tive color model. (04 Marks) a. F{ow are menus and submenus created in OpenGL? Illustrate with an example. (06 Marks} b. Write a program, to draw a rotating square. (06 Marks) c. What is the necessity of programming event driven input? Descrilbe window events and keyboard events. (08 Marks) 4 a. List the geometric objects and associated operations in affine space. (08 Marks) b. Expiain the conrplete procedure of converting a world object framr: into camera frame, u-sing the model view matrix. (tr2 Marks) PART _ B What is concatenation transformation? Explain rotation about a fixed point. (lCI Marks) What are quaternions? With an example, explain its mathematir;al representation. (ts Marks) Explain the different classical views, with neat diagrams. Describe flat shading, interpolative and ground shedding. Explain the'classification of light material interactions in OpenGL. (trO Mart<s) Describe the phong lighting model with neat advantages and disad,,zantages. (10 Marks) What is the use of scan conversion? Describe the digital differential analyzer algorithm fbr scan conversion of a line segment. (10 Marks) Write short notes on : 0 Hidden surf,ace removal ii) Cohen - Sutherland Iine clippingr { ) j {<**** (10 Marks)