•

.
MoSco (Previolls) EXAMINATrd'N, .02013
,
-::\1\p'
. . ~I

COMPUTERSCIEN~E
.~ '/!~~ JTq...~,
Paper: MCS-JOI ­

Computer Organization

1ime allowed: Three hour>

Maximum maries : 100
Allempl five questions in all, selecting al /eas/
O"I!questionfrom each Unit. All questions curry
equal marl(.\'.

Unit-I

J. (a) Conversion of the following Nwnber System.

• (i) (11010011)1 ~ (?) I.

(ii) (10011.11001), ~ (?)1Il

(iii) (2AC.BE) 16 ~ (?) 10

(iv) (0.3125) ~ (?)

10 1

(v) (526.24) ~ (7) 2x5 = 10

• 10

(b) What are counters 7 Design and explain the working of

Mod-13 counter. 10

P. T. O.
2. (a) Simplify the following Boolean Function using Fqur , (p) What is voice recognition device? Why do currently
variable Map: 6 available voice recognition devices have limited success ?

F(A, B. C, D) = L (0, I, 2, 5, 8, 9, 10) Give applications of voice recognition systems. 10

(b) Write a short note on Exclusive OR logic gate. 4 Unit-V

(e) What are Flip-Flops? Explain different types of flip- 9. Write an assembly lrulguage program code to find the largest

flops. 10 element from an array. 20

Unit-II 10. Explain the following:

3. Explain various Memory organizations : (i) Organization ofAritlunetic logic unit

• I I

(a) Cache Memory (ii) Instruction Cycle

(b) Virtual Memory (iii) Data & address bus

(c) Auxiliary Memory (iv) Register. 5 x 4 = 20

(d) Magnentic disk. 5x4

4. Explain Memory hierarchy and Mcmory management hlw. 20

Unit-Ul

5. What are Interrupts? Explain Priority Interrupt with example.

20
6. Describe the following:

(a) Asynchronous data Transfer. 10

(b) Direct Memory Access. 10

Unit-IV
7. Explain RISC and CISC characteristics of CPU. 20

S. (a) Explain diJferent types of Printers. 10

2 P503151 PS-3151 3 1000
 ..
10. (a) Explain operator overloading with example. De;:scl~ be its
•
rules and nceds.

(b) Write short notes on : PS-31S2

(i) Run-lime Polymorphism
M.Sc. (Previous) EXAMINATION, 2013
(ii) Compile-'Iime Polymorphism
Computer Science
(iii) File Handling
MCS-102
(iv) Type Conversion - Basic to class.
Programming in C++

1/111(' ,d'owed : Three hol.ll's

k l axiIJl11J..'1 marks J00
i'tlempf five ttllL's/iuJJS in n/l. selecting a/ least
lUll' (IUt'.W ifmjrom c(u.:h Unit. All questions carry

equal lIIorh.

Unil-I

1. (a) Explain Obj,ieci Oricnted System and Object Orienkd

Progl1lmming in detail.

(b) What arc the differences between Object Oriented

Programming and Prooedural Language ? Explai n.

2. (a) Explain terms given below:

(i) Polymorphism

(ii) C++ C haracter Set

(iii) C++ Operator

(iv) Conditional Statcments

(v) Integer Overflow, Underflow

PS-J152 4 1000 p,1. 0,

 (b) Describe the Applications and Benefits of OOPS. 6. (a) Write short notes on :

Unit-U (i) 2-D Array

3. Explain tcm1S given below with example: (ii) Dynamic AfTay

(a) While (iii) Dynamic Structure

(iv) Multi dimensional Array

(b) Do-while
(b) Write a C++ program of printing the stun of two matlix.
(c) For

(d) Break Unit-IV

\
(
I. (a) What do you mean by Inheritance ? Explain all types of
(e) Pointers ancl Functions
Inheritance with example.
(f) Predefined and User-defined function s
(b) What do you mean by Constructor. Explain Need of
(g) Call by reference function
Constructor and types of Constructor with example.
(h) Nested-if
8. (a) Deflllc Polymorphism. Explain function overloading and
(i) Recursive-fllllction
function over riding with example.
U) Go-to (b) Explain terms with example:
4. (a) Write a C++ program to check, input character is voval (i) Friend fllllction
01' not. (ii) Virtual nmction
(b) Write a C++ program to input 10 numbcrs and display (iii) Static Methods
sum of \0 numbers. (iv) Abstract class.

Unit-III Unit-V
5. (a) Explain Array in detail. Advantages ofAfTay. 9. (a) Explain basic C++ Stream Classes.

(b) Write a C++ progrnm to input dnay of 10 digits and (b) What do you mean by templates in C++. Explain with
search the digit given by uscI' in array. a suitable example.

2 PS-31S2 PS-31S2 3 P. T. O.

-
 ,
.;

PS-31S3
M.Sc. ( Previous ) EXAMIN~ 'ti'O~.;::2013" -­ -.­
COMPUTER SCIENCE
MCS. I03
Relation Database Management System
,
1i"mc allowed .- Three hOlle.v

MlI:cimllt1l marks: 100

Attempt Five '1l1estion, ill all. Selectillg at

Icast Olle question from cae" Unit. /111
questions can:v equal marks.

Unit . I

I. (a) Describe the characteristics of Database approach.

10
(h) What arc Data Mocle l ? Explain Re lational M odel
with suitable examplc. 10

2. Write short note on­

(i) Association

(ii) NOl'lnalizatioll

(iii) E ntities & Attributes

(i v) Referential Integrity. 4x5=20

P.T.O.
 Unit - Jl (v) All ':n1I'I"y~6 \\' ho arc no t manager and earning

3. (a) Write brief description of Relational Algebra . 10 the mininHlIlI salary. 5x4=20

Unit - IV
(b) Explain Inse rtion, Deletion & Updation operation
in database with examples. 10 7. (a) What is PI.) SQL ? Explain its purpose lind
advantages. 10
4. What is file organization? Explain various types of rile
organiZation with the ir advantages & Limitations. 20 (b) Describe the control structure used in PUSQL
with example. [()
Unit - III
f 8. Write shOit notes on-
S. (a) What is SQL '! Explain any four DML commands
(i) Cursor
with example. 10
(ii) Trigger
(b) Explain the Data Types used in SQL. 10
(iii) Locks
6. Consider a table EMPLOYEE with following schema­
(iv) Functions 4x5=20
Empno number (5), Ename v;irchar2(30), Edept
varchar 2( 10) city varehar 2( 10), salary number (8.2), Unit - V
designation varchar 2( 10)
9. (a) What is Buller Management .) Des.c ribe its
Write SQL query to find importance. 10

(i) All employees whose salary is greater than SOOO (b) What is the importance of concurrency control in
and less than 8000. DBMS ? Desc.ibc. 10

(ii) All empoleecs who are earning the second highest 10. Write short note on­

salary. (i) Di sasterRecovery

(iii) All employees whose salary is greater than 15000 (ii) DatabaseSecurity
but are. no t manager.
(iii)Deadlock
(iv) All employees whose name starts with 'R' but (iv) Seriali zation. 4x5=20
does not end with 'H'

PS~31S3 :2 PS-3IS3 3 BOO

,
 J

"- -----~
EX·:.\M~N~{m~
(.

M.Sc. (Previolls)
COMPUTER SCIENCE
MCS-IO-t
Opcrating Systcm

11111" allowed : '111..ee hOllr"

Maxillllllll lIIarks I VO
Allcmpl {i1'l! qucitiolJ.'i in all, selecting £II leasl
{}I,e qlleslionjj'om eaell Unit. All que.'ilions cany
equal mark...

Uriit-I

1. (a) What is Operating System. Explain th.: R,'"I Timc

System. 10
(b) Explain the Process States and relationship. 10

2. Explain the following :- 5 X4

(a) Memory Managcment

(b) Timc Sharing System

(e) Threads

(d) PCB (Process Control Block)

Unit-U

3. (a) What is Scheduling'! Explain thc dillcrence between

P. T. O.
 Premptive and Non-Prempl.ive. I{J (v) .loin
\
(b) Explain the fo ll owing terms ;- 5x2 Vnit-V
(i) CPU Scheduler 9. (a) Create a Shell Progr,ml1nc to input 3 Numbers & sh'ow
(ii) Throughput

(iii) Viltual memory

greater.

(b) What is Decision Making S tnt~ment.

, 10
10

(iv) MLQ (Multi Level Queue) 10. (a) What is Shell, Explain Shell variable naming. 10

(v) LRU (Least Recently Used) (b) What' is loop? Explain linite and inlinite loop with
cxrunple. 10
4. Explain the variou~ Scheduling Algorithm. 20
Unit-lll

5. What is Deadlock. Explain its Prevention and avoiuan("c

Technique. 10 + 10

6. (a) Explain Semaphore. 10

(b) What is file system. Explain the use of it. 10

Unit-IV

7. What is VI-Editor. Explain varius mode of it ,,w ith specific

commands. 20

8. (a) What is she ll , explain types of it. [0

(b) Explain the tbllowing commands :­ 2x5
(i) Cat s
(ii) Cp
(iii) head
(iv) Chmod

'1 I)S-3154 I'S-3154 3 HOO

 MCS-IOS

(Uatu Communication and Networking)

1imt.' al/olVcd : 7/lrcc hours

l\4uximllllt marks: 100

"'/ft1l11fJtjive (jues/ions ill (Ill. selectillg lIl/ewu

Olle qll('slioll };'om each lIllit. All '1u c.fi lioH
carry etllfO/ marks.

Unit-I

I. (a) Explain OS! M lnode l and Define functi on or each

. layer. 10

(b) Explain Data cUlll lll unicati on Networks and Defi ne

pruloc nl~ and st:1l1 tia ru 'l. 10

2. (a) Ex plain Analog and digital Transmission with suitable

example . [0

(b) Wh al nrc the ba,ir.: ty pes "r topolugies and explain it

with example \0

»,T_O.
 Unit-II (b) Explain I~ outi ng Algorithm wi th suitable example. 10

3. (a) What do you mean by sw itching ,! Expl ain any two 8. (a) Ex plain the concept of Firewall and types or Firewall.
methods of swi tching. 10 10
(b) Explain the technique Co ngestion control and define
(b) Write clown the short note on Asynchronous and
'open loop congest ion coni rol. 10
Synchronous Transmi ssion . 10
Unit-V
4. (a) What do you mean by Transmission Media ? Explain
Guided Media. 10 9. (a) What do you mean by End to Find delivery and reliable
delivelY on transport layer? 10
(b) What do your mean by encoding ? Define tl.
(b) Explain Network sec urity and Privacy Issue. 10
teChniques of encoding with suitable Example. 10
1O.(a) Explain ce llular Telephony and Frequency reusIng
Unit-IU
principal. 10
5. (a) What is the basic functions of Data link control ?
(b) Explai n the followin g FealLll'es of cellular Telcpho ny:­
Explain Enquiry Acknowledge. 10
(i) Tran smi ssion and Receiving
(b) Explain the following :- 10
(ii) Hand oil' and Roam ing. 10
(i) Pall select

(ii) Sliding window

6. (a) Explain th e types o f Bridges anclcompare it. 10

(b) Explain the followings :­

(i) Stop and wait ARQ

(ii) rEEE 802 .4 and IEEE 802.5 standard. :0

J Unit-IV
7. (a) What do you mean by routers? Explain Link state
routi ng with suitable exampl e. 10

PA-3155 2 I'A-3155 3 1100

-

PS-31S6
M.Sc. (Previous) EXAMINATION, 2013
COMPUTE R SCIENCE
M CS· 106
(SoftwlIrc Engineering und Visual Busic)
7inw allowed: Thrt't! hours
Maximum marks: / ()()

Allempljive questions ill all. sdectillg allcast

olle ques/ioll from each Ullil. All qltc,\"tioll
car,-y equal mark!!.

Unit-)

I. (a) What do you mean by software process model ?

Explain Prototype model in detail. 10

(b) Explain Mccoll's Quality Factor. 10

2. (a) Explain the following (Any two) IOx2=20

(i) Data Modeling

(ii) CoslEnlimatiol1 Model.

(iii) SRS

P,T.O.
 -
Unit-II (b) What are the dirfercJ1l property of graphics methods

:1. (a) E xplai n the concept of Abs tract and Modularity. 10 used in VB " 10

(b) What do you mean by Tes ting ? Compare be tween 8. (a) For what purpose we use commOn dialog control in
open box t~ s ting and close box testin g. to VB ? How wi II you add and usc the se control. 10

4. (a) Explain s iz,e Oriented M:ltrices in detail. 10 (b) Explain the concept or control array with an example.
10
(b) Explain the need and process of SCM. JO Unit-V
Unit-III
9. (a) Explain Data control ancl Data Aware control in detail.
5. (a) Describe the visual basi c 's rOE with its dilTer" nt 10
component. JO (h) Ex plain the method of connecting an ADO data control
to a database by writing codes, 10
(b) Explain eli rre rent types of control and events in VB. 10
10. Write short no tes o n the following­ 4x5=20
6. Differentiate between thc following with example
(Any five ) 5x4=20 (i) ODBC

(i) Array and C ollection (ii) Crystal Report

(ii) Check box and Option Box (iii) . Data Report

(iii) Tool Barand Status Bar (iv) Direct Access objects

(iv) Procedure and Function

(v) Exit c ontrol loop and Entry control loop

(vi) Propclty and methods of control

Unit-IV

7. (a) What is rec ursive fun cti on " write a program to find
factorial of a given number using recursive func tion,
10

1'1\-3156 2 PA-3156 3 lIon

 •

S-4151'~'-'~'
M.Sc. (Final) ~amjnaflon,
, , 2013

COMPlJTER SCIENC~ -
I'apcr: MCS-201

< Data ami File Structure Using C/C++

Tim e a/lowed : 'l1,,-ee huurs

Maximum marks .' lOll

Allempl fil't! questions in all. selecting at least
mle qllestionJ;'om each Unit. All questions carry
equal marks.

Unit-l

1. (a) What do you understand by Abstract data type ? 5

(b) Write Algorithm to insert and delete a node fi"Olll a linked

list. 15
•
2. (a) What is time and spaee complexity? 10

(b) What is the benefit of linked list over array? Explain

basic operati ons oflinked list. 10

Unit-II

3. (a) What is Stack ? Write its Application . 5

(b) Write a program for array representation of stack . 15

P. "I'. O.
 '. ' . I

4. (a) Differentiate betweenlntix. Postfix & Prefix representation Unit-V

& convert following Intix representations into prefix as 9. (a) What is graph? Explain different types ofgraphs.
well as postfix.
(b) Explain depth first and Breadth first traversal ofgraphs.
(i) 2 • 3 + 4/8
10. Explain different liIe Organizations in dettlil.
(ii) (a + b) 1 (c - d) • e

(iii) aO + CD • EO

(iv) 77 • 82 + 98 + 29'

(b) Write Algorithm to create a Circular Queue.

Un.i t-III

5. What is Binary Search? Write Algorithm for Binary

search. Also explain it using a suitable example.

6. (a) Compare complexities ofdiffercnt sorting methods.

(b) Write a program to sort an array using Bubble sort.

Unit-IV

7. (a) Write Basic Terminology ofTrees. 5

(b) Write Algorithms for 'lnorder, Preorder and Past order

tranusaloftrees. 10
(c) Write a short note on B-Tree.

8. (a) How to represent a Tree Go array? 5

(b) What arc AVL Trees? 5

(c) Explain the insertion in Height Balance trees, with need
oft eft & right rotation. 10

2 P8-4151 PS-4151 3 900

 I

10. Explain the loliowing :- oj x 5 20

(i) OKS

(ii ) PIIiGS PS-41S2

(iii)RGB M.Sc. (Final) EXAMINATION, 2013
(i v) CMY
COM PUTER SCIENCE
(v) HSV.
l)apcr : MCS-202

Computer Gr:lphic
\
Tillie a//()wed : three hOll/"s

Maxilll lllll lIIarks /00

Attemp t fil 'c (lues /ions in all. .\'electin)!. (II feasl
olle CfIlI!SliuI1Ji'ollt each Unit. All questiolls Cllr'Y
cqlwl /lw,.".\".

Unit-l

I. (a) Write down the primary advant ares and disad vantages
of LCD's. 5
(b) What do YO ll mean hy Frame bu ller explain. 5
(e) Discuss image processing. 5
(d) Explain pa:;sive graphics. 5

2. (a) Explain the work ing oflight emitting diode (Um) 5

(b) Discuss in brief:

(i) Random scan display 5

(ii) Rastar scan di splay. S

PS-4 1S;l 4 1000 P. T. O.

 (e) Is CRT is analog M digit al device bplain. 5 8. (a) Wrik a 2 x 2 tmllsfonnaliol1 matri~ lor each 6ffollowing
Unit-II scalling tJ1lnslonnatiQn. x 5= 5

3. (a) Implement the DDA algorithms to draw a li ne from (i) The entire picture three times as larger.
(0, 0) to (6, G). 10
(ii) The entire pic!ure onc third as larger.
(b) Write Ellisps midpoint drawing algorithm. 10
(i ii ) The X direction [our time large, the y direction
4. (a) For 10 PC-lS12 10 fram e buffer enterprct th~
lUlch;Ulgcd
, prescnher 's algorithms by hand to lind which pixel are
(iv) The y length reduced to two third their original valut!.
turned on I"or the line segment (I. 2) and (7, 6). 10
t.h ~ x length unchanged
(b) Write prcsenlwr 's algo for drawing a linc. 10
(v) The X direction reduced to three fourth their origin
Unit-Ill
and y direction increased by a factor ofseven fifth.
S. (a) Explain viewing transformution or window to viewport
Lransfonnation. 6 (b) Explain Arca sub division method. 5

(b) Explain in brief Bezicr curve and I3 spline. 14 (e) Show the reflection about the line y =-x is equivalcn!

6. (a) What is Clipping? Explain all types orlinc clipping alga. to a reflecti on relati vc to y-axi s followed by a counter
10 clockwise rotation of90· . 10
(b) Explain Homogenou s coordinate and composite
lJnit-V
trans[onnation. 10
9. Write short note on :- 20
Unit-IV
(i ) Transparency
7. (a) Refkct the triangu/a polygon whose vertices are (- 1. 0), B
(ii) Shadows
(0, - 2) and C (I, 0) about the line Y = x + 2. 7
(iii) Surface detail
(b) What is Projection ? Explain prcspeetivc and parallel
projection in detail. 13 (iv) Regularized Boolean set operation

2 PS-4l!'i2 PS-4}S2 3 P. T. O.
 ~S"4153 ,
M.Sc. (Final) EXAMINATION
Computer'Sciencc- ,----
< .>: .~-

,I),'A'~

Paper: MCS-203
.Javll

1ime allowed: Three huurs

Maximum marks J00
Allcmp l five question... in"all. selecting 0/ leasl
one question/rom each Unit. All questions carty
equal maries.

Unit-]
1. Explain fi)llowings :- 5 x 4 ~. 20
•
(i) Command Line Arguments

(ii) Final, Finally and Finalize

(iii) Constructor

(iv) Literals

OR
2. (a) Explain the features of Java in detail. 10

(b) Write a program to print List of prime no. among 0 to

100. 10

P. T. O.
 Unit-If (ii) Checkbox. Choice and List Control s 6
3. Explain followings with SlIiulble Java program ;- (iii) Swing. :)

(i) try, catch, finally, throw. throw~ 10 OR

(ii) Runnable and thread 10 8. (a) Whatdoyo ul11can by Event Handling? Explain Action
OR Listener, Key Listener and Item Listener API. 10

4. (a) What do you mean by Interrace ? How interface can (b) What do you mean by Java Beans? Explain beans
implement multiple inheritance in Java. 10 architecture in detail. 10

(b) What isApplet ? Explain applet life cycle with suitable l!nit-V
Java program. 10
9. (a) Write a program to delete related reco rd Iro m database
Unit-Ill llsing JDBe. 10
S. (a) Write a progl1Im SOli string array llsing string ilmctiolls. (b) What is Aspect Oriented Programming ? Explain
10 advantages ofAOP methodo logy. 10
(b) DiJIerentiatc aJT..ly and vector with suitable Java program. OR
[0
OR 10. (a) What is JOSC ? Ex plain JOSC architecture in dctail.

6. Explain followings ;- 5 x 4 = 20 10
(b) Write a program to update related record into database
(i) Wrapper class and utility class
using JDBe. 10
(ii) Stack

(iii) String and String ButTer Class

, (iv) Array list.

Unit-IV
7. Explain followings ;­

(i) Label, Text Field and Button Controls 6

2 PS-4IS3 PS-4IS3 3 1000

i"
 •
(b) Define Pigeon whole principle. Show tlmt ~ lIlon g (j

persons. tbere arc 3 persons who nrc mlltllnllri cnd s or

there arc 3 persons who arc c,)mpletd y ,trang,'rs LO

each other. 10 ,..,.:\~

lVl.Sc. (Final) EXf\:~tNATJON, 2J)J 3,., "
Unil-V
. ~ ;---.- _:
~ "l D. . ,"~
""
9. (a) Deline Graph and Digraph. Prove that the number M COMl'lIT E:R'S€ [£~OE ~ .
verticcs o r odd degree in a graph is always even. 10 Sevcn th-MCS-204
(b) Ld V = {a.b.c. d. t: } Discrete Malh(,m:Ilics

and E = {(a. b) (n. c) (a. d), (b. c) (b. c) (t:. c) (c . d») Time oJ/owed " t/trt!{, hours
then: Maxill/I/!/I !/Iuth .' 100

(i) Draw the diagrrun of graph . Atlempl (II ~\ ' FiI'i! questions ill all. sAe('ling of
O"e c/liL'slion ji-rml cach Unit. ti ll {/tl /ts fiol1s
IC(I\'/
(ii) Find the degrce of eaeh o r the vertices. 10 t:cm:,' t qual murk....

]0. (a) Definc Complemcntary Graph.lfG = (v. E) be a simple nit-I

graph consisting n verticcs and e edges. then prove that
I. (a) IrA = {I , 2. 3. 4. 5} B e {2. 4. 6, 8}
, the l\umbcroredges in tbe complementary gl1lph Ci arc:
C = {I. 3. 5, 7, CJ}
Hn(I1-I) -C} then prove 1()l1owing using Venn diagram .

(b) Find the adjacency and incidcnce matrix of the following A u (13 u C) = (A u B) u C 10
graph : Il
(b) Provc the following by principle of mathcmatical
induction.
2 + 3 + ... '1 n = n( n + I) 10
2

V2 ( -" -, ) V4
2. (u) Provc the following proposition using trllth table :

Ox
p ¢';> q '" ( p =) q) 1\ (q =) p)

PS-4 L5.t 4 1000 P.1'. O.

 .
.
.
(b) De line Tautology. Pro ve that fo ll owi ng proposition is 6. (8) Define the fo llowing logic circuit c":nlcnLi with IruUl ta bles
tautology : also. 10
{ (p ~ q)/\ p) => q 10 (i) ' OR' Gale

Unit-II (ii ) ' AND' Gate

J. (a) Prove that a relation R on a non-empty set A is symmetric (iii) ' NOr Gatc

if nncJonlyifR = R- 1 10 (iv) 'NAN D' Gate

(b) Prow that the relati on R in N x N defi ned by (a, b) R (b) COllstruct the circuit o f toll owi ng : 10
(c, d) <=> a + d = b + c is an equ ivalence relation . 10 (r v s) /\ q /\ (u V V V w)

4. (a) Examine the nature of lallowing lLlI1clion : 10 Unit-IV

f: R - ) R • I(x) = 2:-< + I 7. (a) ex pand fo llowing using BinOl11iallhcorcm : 10
(b) If f : R ~ R. /{x) = 2x + 3

g : R - ) R, g(x) = x2 - I arc two

and
(2X -~r
(b) Out of 15 I-Iockey playcrs, in how many ways a tcam
functi ons, then lind (gol) (x) and (fog) (x). 10
be 10 rl11ed. if 3 -I- 4+3
Vnit-III
(il II Player 10 be ~clcctcd
5. (a) Deline Boolean Algebra and prove that if a be an clement
(iil all the teams have same captain
of l3eolean Algebra. then 10
(iii) two players arc not includ ed ill lIny oC the (cam.
(i) a +a= a
8. (a) There arc 6 White, 4 Blue, 5 green balls in a bag. in
(ii) a . a = a
how many ways the balls are drawn? 10
(b) If a and b arc arbitrary clements ora Boolean Algebra.
(i) any fOllr balls
then prove tlial : 10
(ii) thre.: white ball s
(i) (0 + b)' = a' . b'
(iii) two whi te and one blue ball
:md ! ii) (a . b)' = <J' + b'
(iv) one ball or each colour

2 I'S-41S4 I'S-41S4 3 P. r. o.
·'

PS·4155
M.Sc. (Final) EXAMINATION, 2013
COMPUTER S(;lENCE
MCS-20S
Web Application Development
nme allowrd " Three hours
Maxim/wIll/arks: 100

•
IItlell/pl/ive '1l1eSliolls ill all. seiecl illl#(lI.le(lsl
Otlt: questioll ji"om cach unil. All quesr'''{)fl
(.'lIn~\' equal marks.

Unit-I

I. Explain the following :­

(a) IRe
I
(b) Telnet

(c) FTP

(d) E-mail 4x5=20

2. (a) Differentiate between internet and Intranet 5

(h) Write a note on internet by inclucii ng

(i) ISP
P."I".O.
 (ii) Dial-up & leased line connectivity
'­ (d) mid 0

(iii) Applications of internet 15 (e) left ()

Unit-II
8. Explain the followingjavascript functions:­
3. Explain the following HTML tags:­
(a) alert ()
(a) <BODY>
(1)) prompt ()
(b) <IMG>
(c) parse Int ()
, (c) <OL> .
(d) Char AI ()
(d) <FONT>
(e) CharCodeAt ()
(e) <Input> 5x4=20
Uni!- V
4. What is Hyperlinking ? Explain different types of
9. (a) Write a note on ADO. Net. How can we say that
hyperlinking suppot1ed by HTML with suitable
ADO.Net is ciisconnected connection Oriented
examples. 5+15=20
approach. 5+10=15
Unit-III
(b) Describe dil'ferentADO.Nct classes. 5
5. What are style sheets? Explain different types of style
sheets with suitable examples. 5+ 15=20
In. Explain any five page events with suitable examples.
20
6. How do we create tables in html page? Explain any
fi ve attributes of<table> tag. 5+ 15=20

Unit·IV

7. Explain the following VB script functions:­

(a) IJlsg box ()

(b) input box ()

(c) Clnt()

PS-41SS 2 PS-4155 3 1000

 --..
--~'v.:.s;-,,:'
"' ' .........
/'RY~\ I

PS-4j\p6 (A·} ...............

I"~\
-.:~"-
MlNA~i" q~t
" Il,j, j-~(- '... , .

COMI'UTEn SCIENCI~~
MCS - 206 (A)
(A.-lind"IIntelligen,·e)
Till /{: allowed: Three hours

Max imum IIwrks.' 100

Attempt allY fi ve questions ;11 till, selecting a t

lewil olle ques fiml from ea ch ullit. Allqlll'sf;OIl
corry equal marks.

Unit-J

I . (<I) Wh<lt do understand by Production Systcm? 10

(b) Expl<lin differcnt Con trol str<ltegies in detail. 10

2. (a) Convcrt followin g sentences i nto predicate logic: ­

(i) Evcryone likes fru its

(ii ) Ram i s r"theror Shyalll and Sshyam is brothers of

Rita .

(ii i) [t is raillin g sincc Monday.

1'.'1'.0.
 (iv) Jaipuri s th e C apital o f Rajasthan
(ii ) cun sult

(v) S tude nts can appear in exa minatio n in Hindi or in (i i i )

E ng li sh. 2x5
(iv) [sa

(b) What is Reso luti oll .) Why Resolutiun is used '/ (v) me mbe r 2x5

Unit-II ( b) Ex pl ain scman!ie Nels in Prulog . 10

3. (a) Write a shOll note on :­ Ii. G i vc dClai I aecOllll[ o n Mete predicate s. 20

(i) Bayes Theorem 5x2 Unit- V
(ii ) Rule Based S ystem . 9. Define Ex pe r! system . Expl ain it s arc hitecture &

(b) Explain fram es in det ail. 10 co mp one nts. 20

4. ('J) G ive difference betwccn procedural & Declarative 10. Wrile: shurt nuteson :- 20
knowledge . 10
(i) Knowlcd !o\c systc m [lui Iding too ls

(b) What is ecrlini ty fac tor ? How certin ity factors a re use:d
(ii ) Rule Based syste m Architecture.
in cxpert syste m'i 10

Unit-III

5. E xplain different C ontrol slrategices in de lai I. 20

6. Differentiate Breadths tirst & Depth first searc h usin g

suilable Exam ple . 20

Unit-IV

7. (a) Explain fo ll owing pro log co mmancis usin !o\ suitabk

e xamples.

(i) assert

I'S-4156 A 2
PS --lI 56 ;\ 3 700