llllil]lllilfliillll

lilfl

]il

llll

M 2A347

lil

Reg. No.:

Name:

Vll Semester B.Tech. (Reg./Supple./lmp.-lncluding Part Time) Degree

Examination, November 2011
2K6 cS 701 : INTERNET

^[f3,il#flT.to*,,NIcATIoN
TECHNOLOGIES

Time : 3 Hours

SYSTEM

Max. Marks : 100

PART _ A

(8x5=40)

networks.
2. How video compression is achieved in the internet ?
1. Distinguish virtual circuit networks

and datagram

5
5

networks.

3.
4.

Define CSMA/CD scheme and why CSMA/CD scheme failed in wireless

5.

Draw a GSM TDMA frame with its slots and bursts. How GSM avoids frequency
selective fading

Define the Piconet and Scatternet networking in Bluetooth and mention its
advantages.

7.

Discuss the DHCP protocol with its basic configuration.

8.

Describe the basic objectives of WAP protocol.

6.

Enumerate the advantages of cellular systems with

smallcells,

tr

PART _ B

9.

a) i) Discuss the types of delay encountered

ii)

(4x15=60)
in packet switched

networks.

networks.

Illustrate queueing delay and packet loss in packet switched

b) Discuss RTSP with

BTSP.

its features and illustrate client-server interaction using

5
OR

10. a) Explain the mechanism involved in accessing audio and video through a
web

server.

b) Describe the tiered hierarchy of lSPs and state the characteristics of each

tier.

6
P.T.O.

I|ililil[lffiilfiflil]]llililt

M20347

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

ii)

Discuss the lnter symbol interference problem and state the measures to
overcome this problem.

b) Discuss the three fundamental behaviours of radiowaves depending on their

frequency.
OR

12. a) Explain DSSS systems, importance with its transmitter and Receiver block
diagram.
b) Explain FDMA and CDMA mechanisms.

I
7

13. a) Explain the IEEE 802.11 system architecture, protocolarchitecture and its
management.
b) Explain the importance of L2CAP layer in Bluetooth and give the L2CAP

packet formats and services.

oR'
14. a) Draw the GSM protocol architecture for signalling and what are the tasks
associated with physical, datalink and network layer

b) Discuss the features of HIPERLAN 2 and explain how it differc from HIPEHLAN

I
1.

15. a) Explain the Route optimization procedure of Mobile IP protocol.

b) Explain the classical enhancements of TCP for mobility with their advantages
and disadvantages.
OR

16. a) i) State the requirements that led to Mobile

ii) What entities

lP.

and terminology are needed to understand Mobile lP

b) lllustrate the Mobile lP Packet delivery

process.

M 20348

1tilililflll!ilffififir ilfltililil

Reg. No.

Name:

Vll Semester B.Tech. (Heg/Suppl./lmprov. - lncluding Part Time) Degree

Examination, November 201 1
(2OA7 Admn.)

2K6 CS 702 : DESIGN AND ANALYSIS OF ALGORITHMS

Time : 3 Hours

Max. Marks : 100

(8x5=40)

!.

1. Write short notes on Big O Notation.

2.

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

problem.
3.

How do you construct a Hulfman code

programming.
5. What are the ways of solving NP complete problems ?
6. Compare Euler tour with Hamiltonian cycle.
7. Write short notes on probabilistic analysis.
8. What are indicator random variables ?
4.

Write short notes on elements of dynamic

ll. A) Discuss the performance

of quicksort algorithm with regards to

s
s
5

partitioning.

15

OR

analysis.
approach with a suitable example.

B) Explain any two most common techniques used in amodized

!ll. A) Explain the Divide-and-Conquer

15

15

OR

B) Discuss in detail about Back Tracking.

15
P.T.O.

Iilliltlillllflffilflllffiilillll

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

15

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.

15
15

OR

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

example.

15

M 20349

Illltffilllililffi[ilililililtlllt

Reg. No.

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

Vll Semester B.Tech. (Reg./Sup./lmp - lncluding Part time) Degree

Examination, 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

f)

of multimedia.

Explain the different parameter mention for HDTV.

g) Explain

the different types of compression technique.

JPEG.
2. a) Describe any two hard copy devices.
b) Device the window-to-view port transformation .
h)

Define JPEG and mention component of

(8x5=40)

I
7

OR

a) Describe

matrix formulation of 2-D transformation : translation, rotation and

scaling.

b) Discuss the following algorithms used for line :

7
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.

for drawing Bezier curves.

b) Describe the procedure

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
a) What are the devices and software to support MlDl ?

b) Explain the following

Howthe computer-generated speech signalalso ?

ii) How the speech signaltransmit over network ?

i)

5.

a) Distinguish between multimedia system and hyper media system.

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

OR
a) Explain the steps ol lossy sequential DCT based coding modes.

b) What is editing features ? Explain its briefly.

llllllffllllllllllffillllllllllllllllll

M 2o3so

Reg. No. : ............

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

vll Semester B.Tech. (Reg./Sup./lmp.

2K6 CS 704

- Including part Time) Degree

Examination, November 201 1

(2A07 Admn.)
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 a
user 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 an
example.

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 in

HTML.

6) Discuss about the Document Object

7) Describe

Mode! with an application for it.

about the standard actions in server side scripting language.

8) lllustrate

with an example about how dynamic contents are added and

executed in PHP.

P.T.O.

20350

lllllllllilllllllllllllllllllflllllllll

(4x15=60)

ll. A) Define a Layout. Mention the different types of layouts implemented

in Java

with an example for each.

OR

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

lll. A) Explain the life cycle of a Servlet.

AIso explain how the session tracking is

done in Servlets ?
OR

B) Define JDBC. Mention the components used in JDBC. List out the steps to
Connect 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 Access
Protocol.

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

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

lllllllllll!ffiffiilllllfllllilllil
Reg.No.

M 203s1

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

Vll Semester B.Tech. (Reg./Sup./lmp.

- lncluding part Time) Degree

Examination, November 201 1

(20oT Admn.)

2K6CS 705 (A)

Time : 3

: ADVANCED DATABASE

Hours

SYSTEMS
Max. Marks : 100

PART _ A

1. a) Describe structured types and inheritance

in

SeL.

b)

Describe the Multiset types in SQL.

c)

Explain briefly on Page Rank in Google Search Engine.

(gxs=40)

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

example.
3. a) Explain the concept of Ranking with example.
b) Explain the Nesting and Unnesting with

15
15

OH

b) Explain the information retrievaland structured data.

15

P.T.O.

M 20351

lliltil] ill ffiil tillt ilil

]il

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

til lllt

15

OR

b)
5. a)

Explain the concurrency control in Distributed Databases.

15

Explain the indexing of spatial data.

15

OR

b) Explain briefly

on transactional workflows.

15

tlmffiilililililtflllllil1ilililil

M 20352

Reg. 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) Degree

Examination, November 2011
QaoT Admn.)
2K6 CS 705 (H) INFORMATION STORAGE MANAGEMENT

Max. Marks : 100

Time:3 Hours
PAHT. A
1. Mention the role lLM strategy.

{8x5=40)

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.

PAHT- B
9. Explain about information storage system and its requirements also mention its
applications..

15

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

significance.

15

P.T.O.

M 20352

Ilill]lilfim[Illflililffiilililll

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

15

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.

15

t0
5

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 security
attributes.

10

15

oFr
16. Explain in detailabout storage management standards and initiative.

15

M 20601

ilililil[llllilililIlilIililll]lllt

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)

the NP problems and show that travelling salesman problem is an NP

complete

ll. a) Explain

problem.

15

OR

b) Explain in detail the NP complete problems.

are NP

complete

Prove that the satisfiability problems

15

P.T.O.

M 20601

il1.

ffifl]t

ilr ffir

llil

fifl

lfll

llll

f,ll

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.

15

lv. a) Explain in detailthe randomized decision trees with suitable examples. Write
notes on randomized algorithms.

15

OR

b) Write notes on differences between interactive proofs and mathematicalproofs

by giving suitable examPles.
V. a) Explain polynomialtime sampling with example.

b) Write notes on derandomization.

15
10

OR

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

15