llllil]lllilfliillll lilfl ]il llll lil M 2A347

Reg. No.:

Name:

Vll Semester B.Tech. (Reg./Supple./lmp.-lncluding Part Time) DegreeExamination, November 2011

2K6 cS 701 : INTERNET ^[f3,il#flT.to*,,NIcATIoN

SYSTEMTECHNOLOGIES

Time : 3 Hours Max. Marks : 100

(8x5=40)

1. Distinguish virtual circuit networks and datagram networks. 5

2. How video compression is achieved in the internet ? 5

3. Define CSMA/CD scheme and why CSMA/CD scheme failed in wireless networks. 5

4. Enumerate the advantages of cellular systems with smallcells, 5

5. Draw a GSM TDMA frame with its slots and bursts. How GSM avoids frequencyselective fading ? 5

6. Define the Piconet and Scatternet networking in Bluetooth and mention itsadvantages.

7. Discuss the DHCP protocol with its basic configuration.

8. Describe the basic objectives of WAP protocol.

PART _ A

PART _ B

5

5

trg

(4x15=60)

9. a) i) Discuss the types of delay encountered in packet switched networks. 5

ii) Illustrate queueing delay and packet loss in packet switched networks. 5

b) Discuss RTSP with its features and illustrate client-server interaction usingBTSP. 5

OR

10. a) Explain the mechanism involved in accessing audio and video through aweb server. I

b) Describe the tiered hierarchy of lSPs and state the characteristics of eachtier. 6

P.T.O.

M20347

11. a)

12. a)

b)

13. a)

b)

14. a)

16. a)

I|ililil[lffiilfiflil]]llililt

b)

i) Compare slow and fast frequency hopping spread spectrum systems.

ii) Discuss the lnter symbol interference problem and state the measures toovercome this problem.

Discuss the three fundamental behaviours of radiowaves depending on theirfrequency.

OR

Explain DSSS systems, importance with its transmitter and Receiver blockdiagram.

Explain FDMA and CDMA mechanisms.

Explain the IEEE 802.11 system architecture, protocolarchitecture and itsmanagement.

Explain the importance of L2CAP layer in Bluetooth and give the L2CAPpacket formats and services.

oR'

Draw the GSM protocol architecture for signalling and what are the tasksassociated with physical, datalink and network layer ? IDiscuss the features of HIPERLAN 2 and explain how it differc from HIPEHLAN 1. 7

Explain the Route optimization procedure of Mobile IP protocol. IExplain the classical enhancements of TCP for mobility with their advantagesand disadvantages.

OR

i) State the requirements that led to Mobile lP. 5

ii) What entities and terminology are needed to understand Mobile lP ? 5

lllustrate the Mobile lP Packet delivery process. s

I7

b)

15. a)

b)

b)

1tilililflll!ilffififir

Reg. No.

ilfltililil M 20348

Name:

Vll Semester B.Tech. (Heg/Suppl./lmprov. - lncluding Part Time) DegreeExamination, November 201 1

(2OA7 Admn.)2K6 CS 702 :

Time : 3 Hours

DESIGN AND ANALYSIS OF ALGORITHMS

Max. Marks : 100

(8x5=40)

!. 1. Write short notes on Big O Notation. 5

2. Use the master method to give tight asymptotic bounds for the recurrences

problem. s

3. How do you construct a Hulfman code ? 5

4. Write short notes on elements of dynamic programming. 5

5. What are the ways of solving NP complete problems ? s

6. Compare Euler tour with Hamiltonian cycle. s

7. Write short notes on probabilistic analysis. 5

8. What are indicator random variables ? 5

ll. A) Discuss the performance of quicksort algorithm with regards to partitioning. 15

OR

B) Explain any two most common techniques used in amodized analysis. 15

!ll. A) Explain the Divide-and-Conquer approach with a suitable example. 15

OR

B) Discuss in detail about Back Tracking. 15

P.T.O.

M 20348 Iilliltlillllflffilflllffiilillll

lV. A) Show that the Hamiltonian-path problem is NP complete.

OR

B) Show that the subset-sum problem is solvable in polynomial time if the target

value t is exPressed in unary.

v. A) Discuss randomized algorithm for n-Queen problem.

OR

B) Bring out the importance of Dixon's integer factorization algorithm with a real

life example. 15

15

15

15

Illltffilllililffi[ilililililtlllt M 20349

Reg. No. :

Name: ............

Vll Semester B.Tech. (Reg./Sup./lmp - lncluding Part time) DegreeExamination, November 2011

(2OA7 Admn.)2K6CS 703 : COMPUTEH GRAPHICS AND MULTI MEDIA

Time : 3 Hours Max. Marks : 100

lnstruction : Answer all questions.

1. a) Mention the ditferent attributes used for drawing line and arc.

b) Explain about exterior ciipping.

c) Write any two properties of Bezier curves.

d) Write short notes on BSP trees.

e) Define multimedia and describe various attributes of multimedia.

f) Explain the different parameter mention for HDTV.

g) Explain the different types of compression technique.

h) Define JPEG and mention component of JPEG. (8x5=40)

2. a) Describe any two hard copy devices. Ib) Device the window-to-view port transformation . 7

OR

a) Describe matrix formulation of 2-D transformation : translation, rotation andscaling. 7

b) Discuss the following algorithms used for line : 8

i) The basic incrementalalgorithm

ii) Mid point line algorithm.

P.T.O.

flrfi[ffimfi[flfifiuffi1

M 20349

3. a) Explain the different types of sweep representation.

b) Describe the procedure for drawing Bezier curves.

OR

a) Explain the Z-Buffer algorithm for hidden surface removal.

b) Explain the properties of B spline. How it is differ from Bezier.

4. a) Explain the list of Multimedia applications'

b) Explain the data stream characteristics for continuous media.

oFi

I7

I7

7

I

5. a)

b)

7

8

a)

b)

7

I

7

Ia)

b)

What are the devices and software to support MlDl ?

Explain the following :

i) Howthe computer-generated speech signalalso ?

ii) How the speech signaltransmit over network ?

Distinguish between multimedia system and hyper media system.

Explain the different properties of H.261 and H.263,

OR

Explain the steps ol lossy sequential DCT based coding modes.

What is editing features ? Explain its briefly.

llllllffllllllllllffillllllllllllllllll M 2o3soReg. No. : ............

Name: ......,....,

vll Semester B.Tech. (Reg./Sup./lmp. - Including part Time) DegreeExamination, November 201 1

(2A07 Admn.)2K6 CS 704 - INTERNET AND WEB PROGRAMMING WITH JAVA

Time : 3 Hours Max. Marks : 100

(8x5=40)

l. 1) Describe the creation of a simple interface using Swing that will enable auser to input the following partitioned fields :

. First and Last names

. Email Address

. Password and its validation.

2\ Explain with an example aboutthe event handling using Java Swing with anexample.

3) How is data manipulation and data navigation done in Java Database Connectivrty ?

4) Explain how a servlet is created and executed with an example.

5) lllustrate with an example about how controlstatements are executed inHTML.

6) Discuss about the Document Object Mode! with an application for it.

7) Describe about the standard actions in server side scripting language.

8) lllustrate with an example about how dynamic contents are added andexecuted in PHP.

P.T.O.

M 20350 lllllllllilllllllllllllllllllflllllllll

(4x15=60)

ll. A) Define a Layout. Mention the different types of layouts implemented in Javawith an example for each.

OR

B) Explain in detail about the Swing basic containers and Swing componentswith examples.

lll. A) Explain the life cycle of a Servlet. AIso explain how the session tracking isdone in Servlets ?

OR

B) Define JDBC. Mention the components used in JDBC. List out the steps toConnect to the database using JDBC with an example.

lV. A) lllustrate with an example, the working of HTML tags, Frames and forms.

OR

B) With a complete example, illustrate the working of the Simple Obiect AccessProtocol.

V. A) Explain any one application in detail using PHP. Also mention the stepsused for solving the application.

OR

B) Define a JSP. Mention its advantages and applications. Also explain with anexample about the Scripting components involved in the JSP.

lllllllllll!ffiffiilllllfllllilllil M 203s1

Reg.No. :

Name: ............

Vll Semester B.Tech. (Reg./Sup./lmp. - lncluding part Time) DegreeExamination, November 201 1

(20oT Admn.)2K6CS 705 (A) : ADVANCED DATABASE SYSTEMS

Time : 3 Hours Max. Marks : 100

PART _ A

1. a) Describe structured types and inheritance in SeL. (gxs=40)

b) Describe the Multiset types in SQL.

c) Explain briefly on Page Rank in Google Search Engine.

d) How the text mining applied in data-mining techniques ?

e) Give the advantage of centralized system with diagram.

f ) Explain the three different portioning techniques.

g) Write notes on time specification in SQL.

h) Explain Real-Time Transaction Systems.

PART _ B

2. a) Explain the object identity and reference types in SeL. 15

OR

b) Explain the Nesting and Unnesting with example. 15

3. a) Explain the concept of Ranking with example. 15

OH

b) Explain the information retrievaland structured data. 15

P.T.O.

M 20351 r lliltil] ill ffiil tillt ilil ]il til lllt

4. a) Explain the two forms of inter-operation parallelism and query optimization. 15

OR

b) Explain the concurrency control in Distributed Databases.

5. a) Explain the indexing of spatial data.

OR

b) Explain briefly on transactional workflows.

15

15

15

tlmffiilililililtflllllil1ilililil M 20352Reg. No. : .,,.r...,,r....,r,..!...,r..

Namg : .....,......r.....rr.rr..rt,irr.r.rr..r.r

Vll Semester B.Tech. (Reg./Sup.llmp. - Including Part Time) DegreeExamination, November 2011

QaoT Admn.)2K6 CS 705 (H) INFORMATION STORAGE MANAGEMENT

Time:3 Hours Max. Marks : 100

PAHT. A

1. Mention the role lLM strategy.

2. Enlist the requirements of data centre infrastructure elements.

3. Merition the components of lSS.

4. How cloud storage system is effective ? Explain.

5. Define the concept of information measurement.

6. Differentiate FITO and FIPO.

7. Define information security and its significance.

8. Enlist the key management activities with examples.

{8x5=40)

PAHT- B

9. Explain about information storage system and its requirements also mention its

applications..

OR

10. Explicate the concept of RAID and mention about different levels and its

significance.

15

15

P.T.O.

M 20352

11. Describe in detail about architecture and topology of lp-SAN.OR

12. Explain with examples importance and working of virtualprovisioning.

13. a) Describe the causes and consequences of downtime.

b) Describe the effect of single points of failure in a storage infrastructure.

OR

14. a) Describe the recovery and backup purposes with examples.

b) Write short notes on local replication technologies.

15. Explain in detail about information security system and list the critical securityattributes.

oFr

16. Explain in detailabout storage management standards and initiative.

Ilill]lilfim[Illflililffiilililll

15

15

t0

5

10

5

15

15

ilililil[llllilililIlilIililll]lllt M 20601

Reg. No" :

Name :

VII Semester B.Tech. (Reg./Sup./lmp. - lncluding Part Time) Degree

Examination, November 201 1

(2007 Admn.)

LKGCS 70s (F) : COMPUTATIONAL COMPLEXITY

Tirne:3 Hours Max. Marks: 100

tnstruction : Answer all questions.

l. a) Write notes on Karp-completeness based on Karp theorem.

h) Write notes on space complexity.

c) Write notes on randomized reduction.

d) Wrlte notes on Valiant's theorem.

e) Write notes on interactive proofs with suitable examples.

f) Explain multi-party communication complexity.

g) Write notes on quantum computation with suitable examples.

h) Write notes on random walks. (8x5=40)

ll. a) Explain the NP problems and show that travelling salesman problem is an NP

complete problem. 15

OR

b) Explain in detail the NP complete problems. Prove that the satisfiability problems

are NP complete 15

P.T.O.

M 20601 I ffifl]t ilr ffir llil fifl lfll f,ll llll

I7

il1. a) Explain about major aspects of the failure probability of randomized algorithms.

b) Explain in detailthe concept of counting complexity.

OB

c) Explain PTMs in detailwith suitable examples.

a) Explain in detailthe randomized decision trees with suitable examples. Write

notes on randomized algorithms.

OR

b) Write notes on differences between interactive proofs and mathematicalproofs

by giving suitable examPles.

a) Explain polynomialtime sampling with example.

b) Write notes on derandomization.

OR

c) Explain in detail the PCP and the hardness of approximation with the help of

suitable examples.

lv.

15

15

15

10

5

V.

15