4*. [Total No.

of Pages : 2
Roll No.
6E6021
B.Tech. VI - Semester (Main&Back) Examination, April-2019
Computer Science &Engineering
6CSIA Computer Networks
Common with CS, IT
Time 3 Hours Maximum Marks : 80
Min. Passing Marks : 26
Instructions to Candidates:
,.ittempt any Five questions. selecting One question from each unit. All Questions
carry equal marks. (Schematic diagrams must be shown wherever necessary.
Any data you feel missing suitably be assumed and stated clearly). Units ofquantities
used/calculated must be stated clearly.

UNIT-I

I. a) Explain distance vector routing algorithm in detail. (8)

b) Differentiate leaky bucket and token bucket algorithm. (8)

(014)

1. a) Describe the concept of congestion control in detail. (8)

b) Explain Dijkstra routing technique. Write the complete procedure to find shortest
path. (8)

2. a) What is tunneling? Explain with example. (8)

b) Differentiate lPv4 and IPv6.? (8)

(OR)

2. a) Explain fragmentation in networking. (8)

b) Differentiate POP3 and IMAP protocols with suitable example. (8)

(1) [Contd....
6E6021 / 2019
 UNIT-11I

3. a) Explain the term "Upward Multiplexing" and "Downward Multiplexing" with

reference to transport layer. (8)
b) Discuss the term connection establishment in transport layer. (8)
(OR)

3. Explain the working of "Go-Back-N" protocol also compare it with "Selective

Repeat" protocol.
(16)

4. Draw and explain TCP header and segment structure. (8)

b) Explain TCP service model n detail. (8)

(OR)

4. a) Explain the concept of Round Trip Time (RTT) and Retransmission Time Out
(RIO). (8)
b) Explain the orking of transport layer in Internet. (8 )
UNIT-V

5. a) What is proxy server and how it is related to HTTP.

(8)
b) Draw and explain Domain Name System (DNS) record structure. (8 )
(OR)

5. Write Short Notes on the followings: (2x8=16)

a) Compare SMTP and HTTP.

b) Explain File Transfer Protocol (FTP) and P2P File Sharing.

6E6021 (2)
 Roll No. [Total No. of Pages :1 2 I

r6E 6022
N
B.Tech. VI-Semester (Main & Back) Examination, April - 2019
Computer Science & Engineering
6CS2A Design and Analysis of Algorithms
Common with CS,(T

Time : 3 Hours Maximum Marks : 80

Min. Passing Marks : 26
Instt actions to Candidates:
All Questions
attempt any Five questions, selecting One question Man each unit.
earth equal marks. (Sehemahe diagrams must he shown wherever myessary
ny data you feel in solicit:ill, be uscu/ncC_' and stated clearly Units of
quantities usai/ealculateci must be stated elearlo.
Unit - I

1. a) Soil the following sequence using quick sort method_

16, 56, 63, 3, 10, 17, 22, 18, 24. 4, 11. (10)

1)) Compare and contrast merge sort and Quick sort Algorithms. (6)
(OR)
1. Find minimum spanning Tree for the following graph using Prim's and Kruskal's
(16)
Algorithm.

Unit -11
2. Find longest common subsequence of the given sequences x i and x 2 using steps of
(16)
Dynamic Programming
X =101011

x 2 =01101

[Contd.—
6E602212019 (1)
 (OR)
2. a) Discuss Branch and Bound Technique for Travelling salesman problem. (8)
b) Differentiate between Greedy Algorithm and Dynamic programming. (8)
Unit-1lf
3. Using KMP algorithm find whether pattern
P = <aabab>is present in Text

T = <aaababaabaababaab>
(16)
(OR)
3. Discuss Boyer - Moore Algorithm for pattern matching using had character and
Good suffix heuristics.
(16)
Unit - Ft
4. a) Explain Randomized Algorithm and its Advantages (8)
b) Differentiate between Quick sort and Randomized Quick sort.
(8)
(OR)
4. a) Explain Min - cut problem and associated algorithm.
(8)
b) Differentiate between Monte cario and las Vegas Algorithm. (8)

nit - V
5. Write short notes on following :
(2x8)
a) NP hard and NP complete problems.
b) Cook's Theorem.

(OR)
5. a) Vertex cover and set cover problem
(2x8)
b) Classification of problems.

6E6022 (2)
 Roll No. [Total No. of Pages : 3

I 6E 60231
B.Tech. VI Semester (Main&Back) Examination, April - 2019
Computer Science & Engineering
6CS3A Theory of Computation
Common with CS,IT

Time : 3 Hours Maximum Marks : 80

MM. Passing Marks : 26
Instructions to Candidates:
Attempt any five questions, selecting one question from each unit. All Questions
carry equal marks. (Schematic diagrams must be shown wherever necessary.
Any data you feel missing suitably be assumed and stated clearly). Units of quantities
used/calculated must be stated clearly.
Unit - I
1. a) Design a finite automata (FA) over {0, 1} which checks whether a given
binary number is even. (08)
b) Define NDFA. Compare it with DFA. (08)
(OR)
1. a) Convert the below NDFA to its equivalent DFA. (10)

b) Convert the following Moore machine into Mealy machine. (6)

6E6023/2019 (1)
 Unit - II
2. a) A grammar G has the following productions:
S ---> SS Iaa/ E
Find the language generated L(G). (10)
b) Find regular expression for the language of all words over (a, b) which accept
all the strings with atleast two b's. (6)
(OR)
2. a) Construct a grammar for language (10)

L ={a"b" c' I n 0}

b) Prove that (a ab + ha)* * (a + ab ba)* . (6)

Unit - ill
Convert the following grammar into Greibach normal form: (16)
S ----> AAI a

A --> SSP?

(OR)
3. a) What is Push Down Automata? Explain all its tuples. (6)
b) Construct a PDA accepting the language

L = {anb hin > 1} (10)

Unit - IV
4. a) Design a Turing machine that accept the language over (0,1) of all strings
which contain 010 as a substring. (8)
b) Explain Rice theorems in detail. (8)
(OR)
4. a) Design a TM that accepts {0 1 1"in 1} (8)
b) Explain following in respect of TM. (8)
i) Multiple tracks
ii) Subroutine

(2)
 Unit - V
5. a) What is linear bounded Automata? Explain its model and organization. (8)
b) Find LBA for L ={an , where n is a• prime no} . (8)
(OR)
5. Write short notes on Any Four. (4x4=16)
a) Chomsky Hierarchy of languages.
b) Context Free language.
c) Decision Algorithms for regular sets.
d) Universal turing machine.
e) Derivation trees.
f) Moore Machines.

6E6023 (3)
 [Total No. of Pages :I 2 1
Roll No. 1

[6E 60241
B.Tech. VI - Semester (Main & Back) Examination, April-2019
Computer Science and Engineering
41' I 6CS4A Computer Graphics And Multimedia Techniques

'Maximum Marks : 80
Time : 3 Hours
Min. Passing Marks : 26

Instructions to Candidates:
Attempt any Five questions, selecting one question from each unit. A ll questions
carry equal marks. (Schematic diagrams must be shown wherever necessary.
Any data you, feel missing suitably be assumed and stated clearly. Units of
quantities used/calculated must be stated clearly).

Unit - I
point circle generation algorithm.
1. a) Draw a circle having radius r 10, using mid -

(8)
(2x4=8)
b) Write short note on
i) Cathod Ray Tube
ii) Anti aliasing Technique.
(OR)

a) Draw a line using Bresenham's line algorithm with end points (10, 5) and
(8)
(15, 9).
(2x4=8)
b) Write short note on
i) Shadow mask technique.

ii) Beam Penetration technique.

Unit

2.
a) Translate a polygon with coordinates A (2, 5), B (7, 10) and C (10, 12) by tw
units in X-direction and two units in y-direction. (1

b) Describe cohen sutherland line drawing algorithm with region code detail.

(1)
[Coal
6E6024 12019
 (OR)
2. a) A point (4, 3) is rotated counter clockwise by an angle of 45°. Find the rotation
matrix and resultant point.
(8)
b) Show that a reflection about a liney -- x is equivalent to a reflection relative
to y-axis followed by counter clockwise rotation of 90°. (8)

Unit - III
3. a) Differentiate between the object space method and image space method of
detecting visible surface. (8)
b) Explain Back face Detection/Removal algorithm. (8)
(OR)
3. a) Explain depth buffer method for visible surface detection. (8)
b) Discuss properties of Bezier curve. (8)

Unit - IV
4. a) Explain in brief about RGB, CMY and HSV colour modes. (8)
b) Explain Gouraud shading and compare it with phong shading. (4+4=8)
(OR)
4. a) Explain various aspects of illumination models.
(8)
b) Write short note (any two) : (2x4=8)
i) Phong shading.
ii) Principles of Animation.
iii) Ray tracing Algorithm.

Unit - V
5. a) Explain different types of data compression technology. (6)
b) Explain TIFF file format. (4)
c) Explain working of MPEG and JPEG. (6)
(OR)
5. Write short note on (any two) : (2x8=16)
a) Authoring tools.
b) Rich Text Format.
c) Animation Technique.
d) TIFF file format.

6E6024 (21
 Roll No.
(Total No of Pages 42 I
L6E 60251
B.Tecii, VI Semester (Main&Back) Examination, April - 2019
Coaiputer Science & Engg.
5A Embedded System Design

Time : 3 Hours Maximum Marks : 80

Min. Passing Marks : 26
ructions to Candidates :

t empt an 14 Tve questions sciectin One questiontrom each unit. All Questions
y equal mark:, Schematic elittei;ratf must be shown wherever necessary
iota yoafeel missihg .; Hitch* be t.o.satried and stated clearly Units of qUatitities
-

used/calculated must -,o icted clearly).

eat is Embedata v: stem? ` ~ . at are the hardware needs before designing an

embedded system? (8)

What is (he d between mbedded system and a general computing

system? (8)

What are program. aabiec.)(a.1(.: devices? Also explain field programmable gate arrays
and complete programmable logic devices. (16)

Unit - II
2. a) What do you understand by Interrupt in Embedded system? Discuss some
common interrupts sources. (8)
b) Discuss function Queue Scheduling Architecture in brief (8)

(OR)
2, a) Elaborate setting up interrupt service Routines and Interrupt vectors. (8)
h) Contrast between Interrupt Vectoring and Polling. (8 )

6E602512019 (1) [Contd....

 Unit - III
3. a) Discuss Real time performance Issues. (8)
b) Discuss Interprocess communication and Synchronization in RTOS. (8)
(OR)
3. Write short note on the following
i) Scheduler
ii) Reentrancy. (8)

b) How inter task communication process is done by mailboxes and pipes? (8)
Unit - IV
4. a) What are the advantages of using RTOS software architecture for an embedded
system? (8)
b) Discuss Hard Real time scheduling consideration. (8)
(OR)
4. a) How to save memory space in Embedded system? (8)
b) How to avoid creation and destruction of casks in Embedded system? (8)

Unit - V
5. Write short notes on following
a) Compilers and Linkers for Embedded System. (8)
b) Instruction set Emulators. (8)
(OR)
5. a) Debugging techniques (8)
b) Testing on Host machine. (8)

6E6025 (2)
 Roll No.
[Total No. of Pages : 131
in 6E 60951
B.Tech. VI Semester (Main&Back) Examination, April.2019
Information Technology
6IT5A Information Theory and Coding

Maximum Marks : 80
Time : 3 Hours
Min. Passing Marks : 26

Instructions to Candidates:
from each unit. All Questions
Attempt any Five questions, selecting One question
marks. (Schematic diagrams must he shown wherever necessary.
carry equal
Any data you feel missing suitably be assumed and stated clearlyUnits of quantities
used/calculated must be stated clearly).
Unit I
1. a) A channel has the following channel matrix.
P 0
[ P(y/x) ]=L 0 p I— p _
i) Draw the channel diagram.
likely outputs, compute the probabilities associated
ii) If the source has equally (10)
with channel outputs for p=0.2
b) Verify the following expression:
(6)
H (X,Y) = H (X/Y)+H(Y)
(OR)
that H(XIY) = 0. (8)
1. a) For a lossless channel prove
of five symbols once every millisecond with
b) A discrete source emits one
ti l l entropy
probabilities —2'4' 8' 16' and 176. respectively. Determine the source
(8)
and information rate.
Unit - II
2. a) Derive channel capacity expression for a binary symmetric channel (BS).
(8)

b) A voice grade channel of the telephone network has a bandwidth 3.4 KHz.
8a
Calculate the information capacity of the telephone channel for
(8)
signal-to-noise ratio of 30 dB.

[Contd....
6E 6095/2019 (1)
 (OR)
2. Construct a binary Huftinan code of the following message. Find out its
efficiency. (1 0)
Message ril ] m, m, m4 M. m6
Probability .30 .25 .15 .12 .10 .08
b) Verity the following expression :
C I +plog2p -p)log,(1-p).
Where C is the channel capacity of a BSC. (6)
Unit - 111
3. For a (6,3) systematic linear block code, the three parity check digits C 4 ,C„C ( are
C4 = (11 -(t 4 t
C. = d 1
C , (13
i) Construct the appropriate generator matrix for this code.
ii) Construct the code generated by this matrix.
iii) Determine the error correcting capabilities of this code.
(16)
(OR)
3. Define systematic and non systematic block codes. Give examples of each.
(8)
h) Explain the coding and decoding of linear Block codes. (8)
Unit-IV
4. a) Explain Galois field with its properties.
(8)
h) Find all cyclic binary codes of block length 5. Find the minimum distance of
each code.
(8)
(OR)
4. a) Explain cyclic code and its generation.
(8)
b) The generator polynomial of a (6,3) cyclic code is g(x) = 1+x 2 . Find all the
codewords for this code. How many errors can this code correct?
(8)
Unit - V
5. What are convolution codes? Enumerate their advantages over other
coding methods.
ii) Define constraint length, code tree, Trellis and state diagram. (10)
b) Write short note on.
i) Sequential decoding.
ii) Viterbi decoding.
(6)

6E 6095 (2)
 (OR)
a) Given the following coder obtain the convolutional code for the bit sequence
11011011 and decode it by constructing the corresponding code tree. (8)

Message M M1 M2
bits

h) Write short notes on any two: (8)

i) Burst error.
ii) Transfer function.
iii) Standard Array.

6E 6095 (3)
 [Total No. of Pages : 2
Roll No.
6E 60261
B.TechNI-Semester (Main&Back) Examination, April.2019
Computer Science & Engg.
6CS6.1A Advance Topics In Operating Systems
Common with CS,IT

Maximum Marks : 80
Time : 3 Hours
Min. Passing Marks : 26

Instructions to Candidates:
All Questions
Attempt any Five questions, selecting One question from each unit.
marks. (Schematic diagrams must be shown wherever necessary.
carry equal
Any data you feel missing suitably be assumed and stated clearly.) Units of quantities
used/calculated must be stated clearly.
Unit -1
How message passing is implemented in Operating System? Describe its design
issues in detail. Write the advantage of message passing system in Windows
(12)
and Linux Operating system.
(4)
b) What is the functions of Operating System?
(OR)
(8)
I. a) Explain client server model with diagram in detail.
b) Explain clock synchronization in distributed system of agreement algorithm
(8)

Unit - II

2. a) What are different problems faced during system security? Explain system
(8)
network threats regarding RAID system.
(8)
b) Explain disk management and disk felt matting in detail.
(OR)

2. a) How directories are implemented in file system? Explain reliability and integrity
(8)
in file system.
b) Explain distributed shared memory with its advantages and disadvantages.
(8)

[Contd....
6E6026 /2019 (1)
 Unit - III
3. a) Explain design principles and Kernel structure of LINUX operating system.
(8)
b) What is shell? Explain its usage and types of shell. (8)
(OR)
3. a) What is network file system? Also explain inter-process communications in
detail. (8)
b) Explain memory management and thread management in LINUX. (8)
Unit - IV
4. a) Explain the FAT and NTFS file system in context with WINDOWS OS. (8)
b) How process scheduling and threads are maintained in WINDOWS OS? (8)
(OR)
4. a) How volume management and fault tolerance are done in WINDOWS Operating
system? ( 8)
b) What are security features of WINDOWS Operatimi. System? Explain
environment subsystem and its security mechanisms (8)
Unit - V
5. a) Explain the concept of Data compression and also explain the techniques of
data compression. (8)
b) Explain process management and real time scheduling. (8 )
(OR)
5. Write short notes on following: (4x4=16)
a) Video Server Organization.
b) Window CE and JAVA card.
c) Multimedia file systems.
d) Symbian OS.

6E6026 (2)
 Roll No. 1 I
[Total No. of Pages : 2
N 6E6027
N
O B.Tech. VI - Semester (Main & Back) Examination, April-2019
■.c) Computer Science & Engg.
6CS6.2A Artificial Intelligence

Maximum Marks : 80
Time 3 Hours
Min. Passing Marks : 26
Instructions to Candidates:
Attempt any Five questions, selecting One question from each unit. All Questions
carry, equal marks. (Schematic diagrams must be shown wherever necessary.
Any data you feel missing suitably be assumed and stated clearly). Units of quantities
used/calculated mast be stated clearly.
UNIT - I

1. a) What is Ai and AI techniques? Briefly explain how Al techniques can be

represented. List out some of task domain of Al? (8)

b) Define production system. Explain the elements of production system and also
explain the characteristics of production system? (8)

(OR)

1. a) Discuss comparison between DES and BI -'S with various types of control
(8)
strategies.

b) Enumerate classical "water Jug problem". Describe the state space for this
problem. Solve this problem by giving its operation sequence. (8)

UNIT - II

2. a) What is knowledge representation and also differentiate knowledge and

knowledge base? (8)

b) What are KBS independent technologies? Explain in brief. Also write the
business benefits of KBS. (8)

(1) IContd
6E6027 /2019
 (OR)

2. a) What are the various approaches & issues in knowledge representation? (8)
b) Define the following terms: (8)
i) Mapping
ii) Homomorphic
iii) Horn clause
iv) Reasoning
UNIT - III
3. a) Flow fuzzy logic is different from conventional binary logic? Explain it with
appropriate example. (8)
h) Differentiate forward and backward reasoning. (8)
(OR)
3. a) What are the frames? Explain with suitable example. (8)
b) Define the theory of Conceptual dependency. Explain with diagram. (8)
UNIT - IV
4. What are game playing techniques? Explain minimax procedure with example.
(8 )
b) What is natural language processing ? Explain with example. (8)
(OR)
4. a) What is Alpha -- Beta planning strategy? Explain its need with example. (8)
b) Explain the goal stack panning approach for solving the compound goals. (8)
UNIT - V
5. a) What do you mean by learning ? Explain any one technique which is used in
learning? (8)
b) Define neural network and explain its application. (8)
(OR)
5. a) Explain single layer perception model of the neural network. What are its
features?
(8)
b) Differentiate the "Learning by taking advice" and "Learning by example" with
and example.
(8)

6E6027 (2)
, • (Total No. of Pages : 2
Roll No.
6E 6094
B.Tech. VI - Semester (Back) Examination, April-2019
Computer Science & Engineering
6CS4(0) Programming in Java
(Common with CS, IT)
Time 3 Hours Maximum Marks : 80
Min. Passing Marks : 26
Instructions to Candidates:
Attempt any five questions, selecting one question from each unit. All questions
cony equal marks. (Schematic diagrams must be shown wherever necessary. Any
data you feel missing suitably be assumed and stated clearly). Units of quantities
used/calculated must be stated clearly -

UNIT - I
a) Explain java virtual machine. What is the significance of Java byte code in Java
Programming Language? (8)
h) Explain Type conversion and Type casting in Java with an Example. ( 8)
(OR)
What is multithreading? How does it improve the performance of JAVA. (8)
b) How can you implement an array in Java whose size may change during
execution of a program? (8)
UNIT - H
2. a) Write a program to compute the sum of the digits of a given integer number
(8)
b) Write object oriented program in java which covers following concept (8)
i) Using break
ii) Using Continue
iii) Return
(OR)
2. a) What is method overloading ? What are the important points which should be
taken care of while overloading methods? (8)
b) What is multilevel inheritance? Demonstrate a multilevel inheritance with a
program code. (8)

6E609412019 (1) [Contd....

 UNIT-III
3. a) What is an interface? Describe the purpose and applications of interface . (8)
I)) What is string buffer? Give the three ways of creating a string object. (8)
(OR)
3. a) Define package in java ? What are the benefits of using package ? Explain with
suitable example.
(8)
b) Write short notes on the following string operation. (8)
i) CharAT0
ii) indexQf()
iii) substring
iv) append

UNIT - IV
a) What is main difference between Readers/Writers and Input / Output streams?
Give a few sub classes of Reader and writer class. (8)
) What is exception handling ? What are the types of exception? Write a code to
handle ArrayIndexOutOfBounds Exception. (8)
(OR)
4. Write short notes on the following : (4 x4=16)
i) try and catch
ii) throws
iii) Finally
iv) I/O streams.

UNIT - V
5. a) Explain the structure of applet, with the help of example. (8)
b) Describe complete life cycle of thread. How thread is different from process?
(8)
(OR)
5. a) What are the difference between multiprocessing and multithreading? What is
to be done to implement these in a program? (8)
b) Write a applet program to draw a filled circle with in an oval. (8)

6E6094 (2)