0% found this document useful (0 votes)
30 views8 pages

2076 Questions 2

This document contains instructions for a computer science exam on multimedia computing. It includes long answer and short answer questions covering various topics in multimedia such as color models, Huffman coding, speech generation, animation, JPEG vs MPEG, user interface design, multimedia programming, color dithering, file sizes, lossless vs lossy compression, and applications of multimedia in telemedicine. Students are required to answer 2 long questions and 8 short questions in 3 hours.

Uploaded by

baivabbidari876
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views8 pages

2076 Questions 2

This document contains instructions for a computer science exam on multimedia computing. It includes long answer and short answer questions covering various topics in multimedia such as color models, Huffman coding, speech generation, animation, JPEG vs MPEG, user interface design, multimedia programming, color dithering, file sizes, lossless vs lossy compression, and applications of multimedia in telemedicine. Students are required to answer 2 long questions and 8 short questions in 3 hours.

Uploaded by

baivabbidari876
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

C5c.

319-2076

Tribhusan University
Institute
of Science and Technology
207%
. x
Fachelor Level / Third Yenr /Fifth Semester/Science Full Marks: 60
Computer Science and Information Technology (CSe319) Pass Marks: 24
(Multimedia Computing) Time: 3 hours.
Candidates are required o give their answers in their own words as for as practicable.
The figures in the margin indicate full marks.
GroupA
Long answer questions
Atternpt any wo questions [2x10=20]
wt ‘Explain the global struc turea with block disram and explain cach block in detail.
of multimedi
2, List and explainthe various colour models used in image and videos.
Why do we need Huffman coding? Explain i with suitable example.
i (em Aen) fw pA
Group B
Short answer questions [A
‘Attempt any eight questions hen [8x s=40]
4. Explain the speech generation method. . se Phme: mallet umd o ( eeety

How can you genera animation using computer? 3 min mad Join bot
Blieplere ich Tele Hae
6. Differentiate befbieen JPEG and MPEG. phere.
PinPol & poe spet is chiffon
7.__ Discuss in brief about user interface deslgn process in multimedia.
5._Fpla th abtraction levels of the programming, of hjectoriened approach.
i
roe
9, . Discuss the colour dithering technique with example. pr 1 Heir Maa ning Semel
Caleulste the file size in bytes fora 30 second recordinatg 44.1 hz, § bits resolution stereo
fy n 4 Voiced gumd i by eal Leteehorcels
alphabety
:/m,u18 prcuced
tamed
compression.
and lossy compression.
ifferentiate betweenbetw en lossless and
Differeniate yoo
n
the applications
Explai of multimedia bn telemedicine. whon vocal cherels Gr pon
Eg {15 eh.
(alphabet)

1051.10 Ee
ese. 317.2075 —
E acl 77
“Tribhuvan University
Institute of Science and Technology
2076
&
Bachelor Level / Third Year /Fifth Semester/Science Full Marks: 60
Camputer Science and Information Technology {€5¢:317) Pass Marks: 24
(Simulation and Modelling) Time: 3 hours.
Candidates are required to give their answers in their own words as foras practicable.
The figures in the margin Indicate full marks.
Section A
Attempt uny two questions. (2x16=20)
I. Define queuing system. Explain different queving disciplines. Also explain different
~ performance measures for evaluation of queuing system.
2. Differentiate between chi-square test and KS test for uniformity. Use KS test to check for the
= uniformity for the input set of random numbers given below. 0.54, 0.73, 0.98, 0.11, 0.68, 0.45.
Assume level of significance to be Da=0.05 => 0.565.
3. What do you understand hy static mathemati I model? Explain with example, Differentiate
between stochastic and deterministic activities.
Section B
Attempt any eight questions. = 40)
(3x5
3 Discuss the merits and demerits of system simulation.
markov's chain with a suitable exumple.
6. Define arrival pattern. Explain non-stationiry Poisson process.
7. Differentiate between validation and calibration. How cun we perform validation ofa model?
8. Use Mixed method to generate a sequence of random numbers with Xo= 27, 0= 17,
= m=100 und
9. What do you understand by replication of runs. Why is it necessary Fd £ -
10. Explain generation of non wniform random number generation using inverse method © 3
11 Parts are being made at the rate of one every 10 minutes. They are of two types, A und B. And
are mixed randomly with about 10% being type B. A separate inspector is assigned to examine
cach part. Inspection of part A tikes 6+ 2 minutes while
inspector ejects 10% of parts they inspect. Draw GPSS block 8diagram
takes 10 + 2 minutes, Both
to simulate the above
problem for 100 pasts.
12. Write short notes on (any two): @x2.5=5)
a System and its environment
b. Simulation run statisti

108710
Osc. 318. 207600

Tribluvan Univer y
Institute of Science and sit
Technatogy
2076
Bachelor Level / Third Year /Fifth Semestec/ B
Compater Science and Information Seience Ful Marks: 60
(Web Technology) Technology (cSc:316) Poss Mark; 24
Time: 3 hours,
nddatss ore EqUITd
“The figures In the margin (ive thir answars in their ov words usor as practicable.
indicate fol mri
Lang Anwer Questions Se
Attempt Any Tov questions.
(2x10-20}
Create weh form for book scarch og. The form should
search type. 8 text bos for searchcatalkeyw ord, 1 radi o butt on
contain a dro own defining.
fol, pow write PILI script to store data from the fom intofor dava download type rae of
retsive the results from stored table in a new puge, base tsble gna. don
Loy
How can you ersate objects in JavaScript? Create 1ITML page containing
With image wd its description in paragraph. Write n JavaScript function o chang a division
value of description in the paragraph during onmouseover and onmouseout event e the
image, on the
3. low pusitioning of ITM elements con be done
Wito hdiv with some content and (wo prmgraph tagsusing with CSS? Create a HTML page
and pd. Write external CSS for the div tag Ravine fixed positsome ion
contents having id pi
with
und width 2px. The pl should have relative position. he font type borde of
r style sold
Arial snd color should he red. The p2 hve absolute position with plfop should Opx and
be
Tefi200p. 1208]
Section B
Short Answer Questiany i
Attempt Any Eight questions. |8xs=10]
a. What is HTTP protocol? Define HTTP Request and Response. 124)
5. Create a HTML page with ings header, ale and footer. Insert a lik conianing mail
to infZiostedinp in the footer tog. Set the keywords “fost”, “csi” using Mtg in
the page,
How jQuery animate can be used 10 create custom animation? Write syntax a
script. 242
7. What is the use of JSON? Haw can you parse a JSON, illustrate with an ly

10st !
CSc 31820768

What is XML? Create an XML file containing records of employee having elementsof
simple and complex types. 114)
How XSD of a XML. is created? Nlustrate with an example. [243
How can you define variables in PIP? Define any two varisbles of suring types and
display thei results afer concatenation, 1141
How web puges can be made resposive media queries? Hlustrate with an example.
123)
Why Inline frames are used? Create a HIMI, pope containing ® iframe with in a
posagraph. The iframe hive source to bps inst cd op and its height and width
are 200px and 00px respectively. [+4]

1osTTY
bhiezan University
Institute of Science and Technology
2076

Bachelor Level / Third Year /Fifth Semester/Scl
ence
Computer Science and Information Techralogy (CSc.316) Full Marks: 60
(Erymography) Pass Marks: 24
Time: 3 hours,
Candidate are required to give their answers in theie own
The figures In the margin indicate wor ris as for as practicable.
full prarks,
Sectionp ¢!!
Attempt Any Two questions ae
2 [2x10=20]
foment monalphabetic and polalphabesc cipher, wish one ts
ond ween. Which types of keys are considered as weal keys more vulnerable? ust
found operation in IDEA. in DES? Explain th
[24246]
7. Sate the Ferma theorem with example. Given the me number
— Fat £=5, private key of sender with “f Fandom intege
p=29 and ts primitive
m=13 using Elgamal cryptosystem. r K=11, encr the yp
messag
te
+ vey {545
%, ~ Compare the SIIA parameters between ofiA
-1 an SHA<2 family. Decrypt tho clpter test
ngvanb y| 7B
es| 8sstgt cipherol, 37X)
Sections
Attempt Any gh questions
elm dct ptm Bi he procedr sf saring he secret 10x55 40]
ey Di e
5. Dbstuish betsoen steam chor nd boc cipher i CTYPE the 231 t
© SAMERACE UNTILL O'IR LIVE END us ng message
Rall fence cipher using 4 as number of WE ARE 15¢
ray,
1243)
Define digital signature. Describe the approach of es
ss, 2+3
7 Whatisthe taslcof frewall? List the el
emeofnxt50s9, +3)
Mons oes the mata: of worms iter hth
rr ius? Define PK wit is architecture mode
.
,. Explain the procedure of ix column we a
transformation n AES wits aneample,
10: Jot the rol of rime nuraber [5]
= Euclidean algorithm, n Euler totient function? Find the GE of D
nt 12 and 16 using
(254235)

1osT1u
Cc. 316-2076
I
11. Writk down any two limitations of MAC? What does policy and mechanism mesh ia
cryporaphytDescribe with ascenaria 2+3]
12, ie short notes on AryTon) 252s]
73 Classes of intruder
b. S51.
c. Dos Artack
CSc. 31520764

Tribhuvan University
of Sclence and Technology
Institute
2076 \
x ce Full Marks: 60 5
Bachelor Level / Third Year /Fifth Semester/Scien
Computer Science and Information Technology (CSc-315) Pass Marks: 24
(System Analysis and Design) “Time: 3 hours.
Candidates are required to give their answers in their own words as for as practicable.
‘The figures in the margin indicate full marks.
Section A
Attempt any two questins. (@x10=20)
1. What is wateefall model? Explhin prototyping made! for developing information systems atong
vith merits nd demerits, rs)
2. Definef lity, Explain different categories of feasibility. How do you measure economic
7 fail? x tobert on (+850)
3. Assuming n retnil clothing store in 3 mall, draw a context diagram and a level-0 diagram that
repost he ellis at th iv. wre
eet Section1
Attempt any eight questions. @x5=iy
Expl modem spesches 0 syste lysis nd design. ©
57 to pion decom? xg, ©
6. Whats project initiation? Explain differen ac ies you will perform during project initiation
phase (+4)
7, Explain the process
of identifying and select formation system development project in brief.
©
s group interview? What are the benefits and drawbacks of group interview? (2 + 3)
9, How do you format forms and reports? Explain general guidelines for formatting forms and
reports? @+3)
10, List major activities of mainicnanse. Explain differnt types
of maintenance activities. 1 +4)
Po,
11, What is object oriented developmeily Have is it different from structured development?
~
243)
13, hon sco
n. Spiral model ¢
punks 3
b. Deisn te
pe ,
wos We=
wnt
Se 314.20768

Tribhuvan University
Institute of Science and Technology
20%
0
Bachelor Level / Third Year! Fifth Semester Science:
Computer Science und Information pide
(Design amd Analysis of Algorithms) Technology (CSe.314) Panpusi
imei
Candidates are required 10 give their an er in their own words as for as practicable.
The questions are of equal marks
Long Answer Questions Section A
Attempt any two questions @x10=20)
1. What do you mean by complexity of an algorithm? Expl ahout the asymptotic notations used to
describe the fime/space comy plexity of any algorithm with their geometrical interpretation and
example. +9)
2. Explain shout the div le and conquer paradigm for algorithm design with suitable example. Write
~~ the Quick sort algorithim using randomized approch and explain is time complexity 6)
3. Explain in brief about the Backtracking approach for algorithn desi en. How it differs with
recursion? [Explain the N-Queen Problem and its algorithm using bac icking and analyze its
i complexity. (24246)
Section B
ShortAnmwer Question:
Attempt any cizht questions ($15=40)
J ie te algorithm for Selection Sort and explains time and space complexi
ty ©
5, ole the Flloing recurrence relations ysing master method.
Ca T= en @s425)
ow
bo T(n) AT (nl
4) + kn ele!
Fin he greedy algorithm for factional knapsack problem with is ime comp
te 5) ov!
7. race the heap-sort algorithm far the followin data: {12,45, 62, 50, 85, 15, 28).
©)
8 What do you mean by Dynamic Programing Suess? Explain
the cloments of DP, (243)
J.Jenlai the approimation forthe for solving vertex cover with
sulabie example, ©
12, Epi the Prins algorithm for MST problem and anslyze iv
ime ecrmplexiy. ©
11 pti in bre abou the elsses , NP ani NP Complete with
example, ©
ey ee
b. Trach und Insractable problems

stu *

You might also like