| 08?ij":?

:
o. ages:l 2

ttn
fr. Tech. V-Sem (Main and Back) Examination, January/February - 2024
t{ Artificial Intelligence and Data Science
rd 5AID4-04 Computer Graphics and Multimedia
tn
CS,IT, AID, CAIO CDS, CCS

Time : 3 Hours Maximum Marks : 70

Instructions to Candidates
Attempt all Ten questions fro* Purt A, Five qaestions out of Seven questions
from Purt B und Three questions out o.f Five qaestions from Part C.
Schematic diagrams must be shownwherever necessary. Any dotayoufeel missing
suitably be assumed'and stated clearly. (Jnits of quantities used/calculated must
be stated clearly.
(Jseof following supporting material is permitted during examinqtio,n.(Mentioned
form No.205

PART A
be given up to 25 words onlv)'
Alr queqtion, urffiil:T:tt (10x2:20)

1. Define Pixels.

2, What is translations?

3. Define Gray scale.

4. Explain which clipping process handles the clipping of strings.

5. What is surface rendering?

6. What isAnimation?

7. Define color Models.

8. Write the steps for 3-D transformations.

9. DefineAspect Ratio

10. What is polygon clipping.

5nfi54 t2024 (1) [Contd.....

 PART - B
(AnatyticaVProblem solving questions)
Attempt any Five questions. {5x4:20}

1. Compare DDA and Bresanham's algorithm.

2. Explain scan conversion.

3. Vfrite any four applications of Computer Graphics"

4. Explain transformation in homogenous co-ordinate system-

5. Explain B Spline curves and3 D scaling system:

6. Explain HSV color model

7. DefineRaytracing algorithmwithanexample.

PART. C
(Descriptive/AnalyticallProbtem Solving/Design questio n)
Attempt any Three questions. ' (3x10:30)
1. Derive the various parameters to draw circle using mid-point circle algorithrn and
calculate intermediate pixel for circle having cerder point coordinates (0,0) and
radiusr: 10. (10)

2. Obtain the final coordinates after two rotations on point (6,9) with rotation angles
are 300 and 600 respectively. (10)

3. Write short notes on

a) LineAttributes (s)
b) Flood Fill Technique (s)

4. Expiain Fhysical and Synthetic graphics systeno ? Also explain the raster scan and
vector scan display with example. (4+6)

5. What isAnimation? Explain animation function in details. Also write the steps in
generation of animation. (10)

s81754 Q)
F I
I

I
Roll No. I lotal No. oI rages : 3
I

B.Tech. V-Sem (Main&Back ) Examination, January/February '202 4

Artificial Intelligence and Data Science
. 5AID4-03 Operating System
CS, IT, AID, CAIO CDSO CIT,CCS
me : 3 Hours Maximum Marks :

Instructions to Cundidates:

, Attempt ull Ten questions from Purt A, Five qaestions out of Seven questions
from Purt B and Three qaestions out of Five qaestions from Purt C.
Schematic diagrams must be shownwherever necessary. Any datayoufeel missing
suitably be assumed and stated clearly. Units of quantities used/calculated must
be stated clearly.

Use offotlowing supporting material is permitted during examination. (Mentioned

in form No.205)

PART A
(Answer should be given up t0 25 words only).

Alt questions are compulsory. (10x2:20)

1. Define logicatr and physicalAddress.

2. Explain the features of operating system.

3. Define the terrnvirfualMemory.

4. Explain the term file system in brief.

5. What is semaphore?

6. Draw the process state diagram.

7. Why page size is always power of 2?

8. What is starvation? How can me overcome it?

9" Wlrat is thrashing?

1{}. Differentiate between pager and swapper.

sE'1753 t2024 (1) [Contd....

 +

PART. B
(Anatytical/Problem solving questions)

Attempt any Five questions. (5x4:20)

l. What is memory management unit (MM[I)? Explain Best fit, worst fit and Quick fit
algorithms in detail.
2. What are the necessary conditions of deadlock? Explain resource graph model
and safe-unsafe states with a suitable example.
3. Explain in detail the following CPU schedulingAlgorithm:

D Priority Scheduling
ii) Round Robin.
4. What is the importance ofpaging and segmentation in memory management? Expiain
with diagram?
5. Differentiate between Windows and Linux based operating system?
6. Consider 3 pages frames and following refence string use FtrFO page replacement
algo to calculate the number ofpage faults in each reference string is -
701203042303212A17A1
7 . Write and explain the Banker'sAlgorithm for deadlock avoidance?

PART. C
(D esc riptive/Analytic aVProblem Solvin g/Des ign qu e stiorni

Attempt any Three questions. (3*10:30)

1. What is Dining philosophers problem? Explain the solution of this problem by
using a suitable example.

2. Consider the following page reference string 1,2"3,4, 1,2,5,1"2,3,4,5 compare the
number of page faults with frame size 3,4 with LRU page replacement algorithm.
Also explainBeiady's anomely in detail.

3. Suppose a disk drive has 200 ryclinders the drive is initially at eyiinder position
. 9B. The queue with request from I/O to blocks on cytrinders" 86, 147,91,177 94,
750, 102, 175 130 what is the total head movement needed to satisff the request
for SCAN and C-SCAN scheduling algorithm

sE17s3 (2)
 4. Consider the following four processes, with the length ofthe CpU burst
time given
inmilliseconds.
Process Burst time (Ms Arrival Time fMs)
PO 15 0.0
P1 20 1.0
P2 3 2.0
P3 7 2.0
consider the shortest Remaining time first (SRrr; no,roa nobin (RR)
(Quantum :
5ms) Scheduling algorithms. Illustrate the scheduling crarfit chart.
which algorithm will give the minimum average waiting time.

5. consider apaging system with the page table stored in memory

a) If a memory reference takes 200 nanoseconds, how long doeg a paged memory
reference take?
b) If we add TLBs andTlpercent of all page-table references are found in the
TLBs, what is the effective memory reference time? Assume that finding a
page-table entry in the TLBs takes zerotime,ifthe entry is There.

5E1753 (3)
 Roll No. ________________________________ [Total No. of Pages : 2
5E1752 5E1752
B.Tech. V-Sem. (Main & Back) Examination, January/February - 2024
Artificial Intelligence and Data Science
5AID4-02 Compiler Design
CS, IT, AID, CAI, CDS, CIT, CCS
Time : 3 Hours Maximum Marks : 70

Instructions to Candidates:
Attempt all Ten questions from Part A, Five questions out of Seven questions
from Part B and Three questions out of Five questions from Part C.
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.
Use of following supporting material is permitted during examination. (Mentioned
in form No. 205).

PART - A

(Answer should be given up to 25 words only)

All questions are compulsory. (10×2=20)

1. What is Translator.

2. Define Bootstrapping.

3. What is token.

4. Explain error handling.

5. Define paising.

6. What is syntax.

7. Define DAG.

8. What is ambiguity.

9. What is activation record.

10. Define optimization.

5E1752 /2024 (1) [Contd....
 PART - B
(Analytical/Problem solving questions)
Attempt any Five questions. (5×4=20)
1. Classify the errors and discuss the errors in each phase of compiler.
2. What is symbol table? Write the procedure to store the names in symbol table.
3. Explain Bottom up paising in detail.
4. Explain Intermediate code forms using postfix notation.
5. Write short note on global data flow Analysis.
6. What is peehole optimization? Explain in detail.
7. Consider the grammer
E  E+E
E  E*E
E  id
Perform shift reduce paising of the input string “id1+id2+id3”.

PART - C
(Descriptive/Analytical/Problem Solving/Design questions)
Attempt any Three questions. (3×10=30)
1. Explain the paising techniques with a hierarchical diagram.
2. Discuss the phases of compiler with the help of appropriate diagram.
3. Construct syntax tree and postfix notation for the following expression
(a  (b * c)  d  e / ( f  g )) .
4. What is common subexpression and how to eliminate it? Explain with the help of
appropriate example.
5. Write short notes on
a. YACC error handling in paising.
b. Finite Automata lexical analyzer.

_____________

5E1752 (2) [Contd....

 Roll No. ________________________________ [Total No. of Pages : 3
5E1751 5E1751
B.Tech. V-Sem. (Main) Examination, January/February - 2024
Computer Sc. and Engg. (IOT)
5CIT3-01 Information Theory and Coding
CS, CCS, CIT
Time : 3 Hours Maximum Marks : 70
Instructions to Candidates:
Attempt all Ten questions from Part A, Five questions out of Seven questions
from Part B and Three questions out of Five questions from Part C.
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.
Use of following supporting material is permitted during examination. (Mentioned
in form No.205)

PART-A
(Answer should be given up to 25 words only).
All questions are compulsory.
(10×2=20)
1. Prove the following statement “The sun rises in the east” contains zero amount of
information.
2. Show that if there are ‘n’ number of equally likely message then entropy of the
source is log2n.
3. Define Kraft inequality.
4. Explain prefix code with example.
5. Differentiate between random ever and burst ever.
6. Classify the types of linear block code.
7. Explain 2 properties of Galois field.
8. Discuss cyclic codes and its generation.
9. Compare convolution code over other coding methods.
10. Describe the differences between state diagram and trellis diagram of convolution
code.

5E1751 /2024 (1) [Contd....

 PART - B
(Analytical/Problem solving questions)
Attempt any Five questions. (5×4=20)
1. The probabilities of five possible outcomes of an experiment are given as
P( x1 ) = 1/ 2, P( x2 ) = 1/ 4, P( x3 ) = 1/ 8, P ( x4 ) = P( x5 ) = 1/ 16 Determine the entropy and
information rate if there are 16 outcomes per second.

2. Show that for a discrete binding channel

H(X, Y) = H(X/Y)+H(Y)
H(X, Y) = H(X) + H(Y)

3. A discrete memoryless source emits four messages with probability set

[1 / 2, 1 / 4, 1 / 8, 1 / 8] .Constructs a Shannon-fano code for this message and also
find the efficiency.

4. A voice grade channel of telephone network has a bandwidth of 3.4KHz. Calculate

the information capacity of telephone channel for signal to noise ratio of 30 dB.

5. Illustrate the concept of systematic and non-systematic code.

6. The following polynomials f(x) and g(x) are defined over GF(3).
f ( x) = 2 + x + x 2 + 2 x 4
g ( x) = 1 + 2 x 2 + 2 x 4 + x 5
Calculate addition and multiplication of above 2 polynomials.

7. Describe viterbi algorithm in detail.

PART - C
(Descriptive/Analytical/Problem Solving/Design question)
Attempt any Three questions. (3×10=30)
1. a) Discuss the concept of joint entropy and mutual information. (5)
b) Explain different types of channels with their channel matrix (5)

2. Construct Huffman’s code for following set of messages. Also find the efficiency
P(x 1) = 0.49, P(x 2) = 0.14, P(x 3 ) = 0.14, P(x 4) = 0.07, P(x 5 )=0.07,
P(x 6) = 0.04, P(x 7 ) = 0.02, P(x 8) = 0.02, P(x 9 ) = 0.01 (10)

5E1751 (2) [Contd....

3. Consider a (7,4) linear blockcode with the parity-check matrix H given by
é1 0 1 1 1 0 0ù
ê ú
H = ê1 1 0 1 0 1 0ú
ê ú
ê0 1 1 1 0 0 1 ú
ë û
a) Construct code words for this (7, 4) code (5)

b) Show that this code is a Hamming code (5)

4. The generator Polynomial of a (6, 3) cyclic code is g( x )=1+ x 2.

a) Find all the code words for this code (6)
b) How many errors can this code correct (4)

5. Write a short note on

a) Sequential decoding (5)
b) Transfer function of convolutional code (5)

__________________

5E1751 (3) [Contd....