Term-End Examination
December, 2OO5
GS-01@ : COMPUTERFUNDAMENTALS
v - { E + B )( A + B + O
Use Kamaugh's map to simplly the equation. Then
draw ihe corresponding logic circuit using AND, OR,
and NOT gates.
cs-01
@ P.T.O.
(c) Gi\rean €xampleof the additionof hro floatingpoint
opemndsusing an arithmeticpipeline. Show all the
stepslnvolved.
(d) Describe th€ following in the context oI a
multiproc€ssorsystem,giving an exampleof each r
(i) Test, S€t
(ii) Compare,Suiap
(e) Explain the characteristicsof highb encod€d and
unencodeCmicrcinstructions,
cs{l o
(b) An 8-blt miqo-processorhas a 16-bit addressbus.
The tirst 15 lires of fh€ addressare usedto selecta
bank of 32 K bytes of memory.The high order bit
ol the addressis us€d to select a registet which
receivesthe contentsof a databus.Explainhow this
coofiguration can be used io extend the rnemory
capacilyoI ti€ systemol 8 banksol 32 K bytesea&
for a total of 256 K bytesof memory.
csol @ P.T.O.
(b) Explaln the following terms with th€ help of an
€xample of diagram :
(i) Single Error Correcting Code
(ii) Constant Linear Velocily lCL\4 Disk Layout
(iii) Res€tvector
(iv) Interrupt vector table
(v) Accesq Time lor a magnetic disk
(vi) Floatingpoini number lormai
cs-01@ 4,000
PGDCA I MCA (l Yr) / BCA
Term-End Examination
December,20O5
CS-02@ : INTRODUCTION
TO SOFTWARE
cs-02@ P.T.O.
{d) Consider the tollowing set of processesthat arrive in
the ready queue at th; same time :
Process CPU Time
Job 1 4
Job 2 3
Job 3 6
Job 4 5
Job 5 2
Considet the lollowing scheduling algoriihms :
First Com€ First Sened (FCFS) and Round Robin
(quantum=1)
(i) What is the turnaroLmd time for each of ihe
algorithms above ?
cs02@
4. (a) Explah all rhe designphd,es of a cornpiler. 6
(b) Write the UNIX commands for the following ; 4
(i) To view all processesrunning including user and
system process€s.
(ii) To produce a iist of ali fiies in the curent
directory without headers, but in three columns.
(iii) From hro softed lists of names, finding out the
number of oamesthat are common to both.
(iv) To find out the number ol iimes the character
"?" occursin a file.
cs-02@ 3,000
PGDCA/MCA0Yr)/BCA
Term-End Examination
December,20O5
GS-03@: FILESTRUCTUREAND
PROGRAMMING IN COBOL
Time : 2 hours MoximumMarks: 60
cs,o3@ P,T.O
(c) lndicaie the value of ihe r€ceiving data items fo.
€ach of th€ lollowing :
Source ]ienl ReceMng ltem
P]CTURE VALUE PICTURE VALUE
it s99999 19738 9999D8
(i0 99V99 10101 Z,ZZZ.99
(iii) 9999V99 25700 $--,*".99
(ivi 99V99 00010 $z,Zzz.99
(v) 999V99 13789 99999
(d) A table conlains the deiails oJ 500 books ol
6 subjects. Write th€ PROCEDURE DIVISI0N
staiementsnecassary for countingthe numberof those
book in eachsubject whosepriceis aboveRs. 1,000.
(e) List five statements/claus€s used in sequentialfile
organization in COBOL.
(f) What is the useof FILLER statefteniin COBOL ?
Explajn tt with thrce sujtabieexamples.
cem@
3 . The humanresource(HRl depanmentol a businessprocess
organization (BPO) maintains a list of tbe resumas of
I
applicants. Write a program to sort the resum6s in
descendingorder of qualificaiion.Assumethe categoriesof
qualification are doctoraie, post graduate, grdduaie,
diploma and others. 10
A non-govemmentorganization(NGO) receiv€sfinancial
1 4 aid
. lrom the State Government, to help the Tsunami
I victims and to maintain the records with the following files
I
I Master File
SchemeCode
TransaciionFile
ReceiptldentificationCode
I Name
Fund
Agency Code
Name
Scheme Id
InchargeCode
cs-03@ P.T.O.
5. Explain the use of the following verbs/statem€nts with the
help of one exampleof each :
(a) DIVIDE
(b) rF
lc) soRr
(d) Go To
(e) INSPECT
cs03@ 3,000
PGDCA / McA (I Yr)
Term-End Examination
December,2OO5
cs,o4@ P,T.O
(o Write an algorithm that acc€pts two lower triangular
matrices, M and N, each with P rows as input. The
total number ol elements in the lower triangles is
P(P + 1). Now, the algorithrnshouldoutput a single
mairix Q oI order P x (P + 1) \ihich represents boih
the lower triangularmatrices.It is not necessarylor
Q to be ejther a lower triangularor upper triangular
matrix. 13
cs-04@
Find the minjmum cost spanning tree for the
following graph :
cso4o 3,000
PGDCA / MCA (I Yr)
Term-End Examination
December.20O5
cs-o5o P.T.O.
(e) Explain all the forms of softwareptru"y. Ho*
"un
each one of them be eradicated? 10
cs{5@
5. ia) Write the help of an example explain the
developmentlife cyclefor a muliimediaproduct.
cs-05o 6,000
PGDCA/MCA0Yr)
Term-End Exarhinatlon
December,2OO5
CS-06@: DATABASE
MANAGEMENT
SYSTEM
cs-06@ P.T.O.
(b) E\amine th€ table shown below I
B001
42, MG Road, 91-11-24000001,
Delhi,110011 91-11-24000002
B002
C2, iector 41, 971"20,2400876.
, . P . , 2 0 1 3 0 691L20-2400477
N o i d aU
82, Rohini-3,
B003 91 11-21000011
New Delhi,110011
(t Why is the table abovenot in 1NF ?
(jt Describe the processof normalizingthe data
showri in ihe table above to the second normal
Iorm (2ND.
(iii) Identifu the primary, foreign keys in your 2NF
relations.
Explain a B'tree with the help of an example. How
i5 a key inserted in a B-tree ? 5
cs,06@
2. (a) What is Indexedsequeniialfile processing? How is it
diflerent from Sequentialfile processingmethod ?
What are tbe disadvantages of Indexedsequentialfile
processingwhen comparedto Multi'key access?
(b) Considerthe followingrehlions ,
Hoiel (hotelNo,name, address)
Room (roomNo,hotelNo, type, price)
Booking thoielNo, guestNo,dateFrom,daieTo,
roomNo)
Guest {guestNo, name, addr€ss)
Wnt€ the SQL $ar?menr)for lhe following :
(i) List f,he names and addressesof all guests in
Delhi, alphabeiically ordered by name.
(ii) List all family rooms with a pice below Rs. 400
per nighl. rn as{endir8 order ol price
(iii) What is the lotal revenue per night from all
lamily rooms ?
(iv) List the price and type of all rooms at th€ Taj
Hotel.
(v) How many hotelsar€ there ? 10
cs-06
o P.T.O.
4. (a) List the differences between the following Join
operarions:
Equijoin and Natural join
Give example ol each join operation to illustrate
'Null" Is
lb) What is the purpos€of ? a componeni ot a
primary key allowed to accept "ntrll" ? Why ?
cs-06@ 7.000
Its-o6-l
ADCA I McA (ll Yr)
Term.EndExamination
December,2OO5
Cs-07@ : DISCRETE
MATHEMATTCS
Time : 3 hours MaximumMarks: 75
Note t Questionnumber 7 is computsory.Ans.uer cn9
three questionslrom the rest.
v5
cs-07
@ P.T.O.
{t) Why,s the $aph non-Eulerian ? How can you
make this graph Euletian by :emoving an edge
and adding a new edge ?
aRbif la-bl<3.
(i) Is R refleive ?
(ii) ls R symmetric ?
(iii) ls R transitive ?
cs-07
@
(f) Consider the following compl€te weighted gmph I
v1
cs,07@ P.T.O.
(b) Find a Minimum Spanning Tree in the following
graph using Kruskal'salgorithm.
P o P ^ Q
1 1
0 1
0 1
I 0
cs-07
o
(c) tet U = {a, b, c, d, e, fl, A - {a, b, c, d, el,
B = la, d, el.
4. (a) c h e c kr h a i B = { 1 1 , 2 , 3 } , 1 1 , 2 1 , { 3 } , 0 } i s a
Booleansubalgebra ol lPlll,2.31), n, U). Whai
are the atoms and anti-atoms'n B ?
I
I
20 people said they have increased the RAM and
added a CD-writer, 15 said they have added RAM
and an additional hard disk, 10 said they have added
a CD-writer and added an additional hard disk, 5
'
have carri€d oui all the thrce upgradations.
cs47@ P.T.O.
Use the breadih lirst search algoriihm to find the
lenglh of the shortest path from vl to each of the
other vertices in the following graph. Also, find the
length of the shortest path from vl to v8.
"3 v6
cs,o7@ 5,000
ADCA / MCA (ll Year)
Term-End Examination
December, 20O5
(i) A/ts=A"B
(it c= 123E-05
(iit K = ALOG(3/4)
cs,o8@ P.T.O.
-
(b) Write down the FORTMN equi@leni lor the
following math€matical€xpressions:
(i) 5P - 4QR + tose6
l 1
(t, jP3/'?
- a-tl
_22
(iiD -_
12n
cs,o8
o
(0 Write a program section to multipb hro matrices
A (p x q) and B (q x t to form a matrix C. You can
assumethat A, B and C are alreadydeclaredin the
program. 3
i 2.
squaresto the poinis (2, 3), (3, 5) and (4, 8).
l,
(percentageol salary),
cs-08
o P,T,O,
(b) Read N pairs of values(X, Y,), i = 1, 2, ... N in h,./o
arrays X and Y. Write a program section to compute
the co€flicieni ol correlation.You can assumeN is
already stored in the computer m€mory- 8
(b) Find the 1st and 3rd Quartilesand Mode for the
following data ,
Marks ot Stud€nts
0-5 4
5-10 10
10-15 20
15-20 8
20-25 5
25-30 3
csos@
(b) The following resuits were worked out from th€
scores in Mathemaiics and English in certain
Mean 80 50
s.D. 15 10
The coelficient oI correlation beiween
X and Y = 0 4. Estimaie the marks obtained in
Mathemaijcs by a sludent who has secured
60 matl.,s in English. Also compuie the mark
obtained in English when she secures85 marks in
Mathematics.
n
t 5. (a) Two coins are tossed six times. What is the
probability that heads appear on bbth lhe coins at
least hrice ?
(b) D€scribethe lour tests as criteria for a good Index
Number. From ihe Jollowing data calculaie the price
itdex number tor 2002 w:)fh 2007 as base year, b!
Rsher's method r
2001 2002
Commodity
Price Quantity Price Quantity
20 8 40 6
B 50 10 60 5
C 40 50
D 20 20 20 25
cs,o8
o 6,000
ADCA ,t MCA (Il Yr)
Term-End Examination
Decemb€r,2OO5
AND
CS-09@ : DATA COMMUNICATION
NETWORKS
cs,oe
o P.T.O
{gl Television channels arc 6 MHz wide. How many
bitslsec can be sent, if €ight level digital signalsare
us€d ? As$rme the channel is noisele;s.
cs-oeo
ADCA / MCA (ll Yr)
Term-End Examination
December,2OO5
CS-10I : SOFTWAREENGINEERING
cs-10@ P.T.O.
{i) D€velop a SRS (System Requirement Specs).
cs-ro
o
(c) State frue or /olse with reason :
(i) S^V is developed or engineered, it is not
manufactured in lhe classicalsense.
(ii) S/4L/ does not wear out.
{c) Sofh.\,areMaintenance
cs-10@ 6,000
(b) A 4 mbpstokenring hasa tokenholdingtime value
of 10 m sec.Whatis ihe longestframetbat can be
sent on this ring ? 5
lc) Ust thre. ditterences between IPv4 and IPr6. 3
cs,oe@ 6,000
E;o-l
ADCA / MCA (lll Yr)
Term-End Examination
December,2OO5
CS-l2@ : COMPUTER
ARCHITECTURE
Time : 3 hours MsximumMarks: 75
cs-12
@ P.T.O
{0 With the help of diagrams,explaindeadlocksituation
caus€dby a circularbit at buffersor at communication
channel.
3. Differentiatebetweenthe following: 15
0, lvresnversus l oms
cs12@
4. (a) Why do most RISC integer units use 32
generafpurposeregisters? Explain the concept of
register windows implemented in the SPARC
cs,12
@ 5,000
ADCA ,/ MCA (lll Year)
Term-End Examination
December,2OO5
SYSTEMS
CS-13@ : OPERATING
(i) Pay-slipgeneration
(ii) Process control of a chemical plant
Justily your hnswers
(b) With the hetp of an example reference string
diffetentiate between the Least R€centlg Used and
Optimal Page Replacementpolicies. 6
cs,l3@ P.T.O.
2. (a) There are five jobs in a queue,
waiting io be
processed. Their respective iotal process
t,mes are 6,
1, 2, 1 and S.
c e 1 3@
4. (a) Explain the following dynamic
memory atocation
algorithmswith an examplefor each :
(i) First fit
(it Best fit
(iii) worsf fil
cs-13
@ 5,000
MCA (Ill Year)
Tetm-End Examination
December, 2005
CS-14@: INTELLIGENT
SYSTEMS
Time , 3 hours Maximum Marks : 75
,l
cs-14
(t P.T.O.
G) Use Truth Table to prove the following :
(i) P -+ Q is equi\Elent to -P v Q
(it -(P v Q) is equivalentto -P ^ -Q
cs-r4@
T
(b) D€scribeconnectives,quantifiers,constants,variables
and functions, with respect to ihe syntax of FOPL.
c s1 4 o P,T,O
s. (a) Consid€r four cities A, B, C, D. Draw the search
spaceol the TSP, when th€ startingcity is A.
cs-l4@ 5,000
MCA (lll Year)
Term-End Examination
December,2OO5
CS-ls @ : RELATIONALDATABASE
MANAGEMENTSYSTEM
cs-]5@ P.T.O.
(iii) Get part numbers that are supplied to all the
projects o{ Goa.
(iv) Get all cities in which at least one supplier, part
or project is located.
(v) Get palt numb€rs for parts that either weigh
more than 20 kg or are supplied by Sr-tpplier
s2.
(b) What is meant by Log based recovery techniques ?
Explainlhe write-aheadlog slrategytor recoveryin a
centralizedDBMS, with ihe help ol an example
c s J s@
(c) Convert the following ER diagram into 3NF tables. 5
Branch
c s - l 5@ P.T.O.
4. (a) A table STUDENT has columns Roll_No, Class,
Name and Marks. Write a program using embedded
SQL to display the classwise report for the number
of stud€nts in different mark nnges as follows :
Morks Number oJ students
Mark <= 40
40 < marks<= 50
50 < marks<= 60
60 < marks<= 80
Marks> 80
T.otal
(b) Describe4NF with th€ help of an example.Would
you prefer BCNF over 4NF ? Justify your answer.
(vi Distributedcatalog
Also give an exampleof each.
cs-15
o 5,000
ADCA / MCA 0Il Yr)
Term-End Examination
December,2OO5
CS-16@ ; OBJECTORIENTEDSYSTEMS
' M.D.imumMorks: 75
Time : 3 hours
Nole : Questionnumber7 is compulsory' Answerany
,hree ouestionsfrcm lhe rest.
cs-16o 1 P.r.o.
{d) DIaw an ER dlagram for a library and show the
relationships behreen the book, the book shelves,
the library stalf and the members of the library.
(v) SemesterExamination
cs,l6@
4. (a) What is encapsulation ? Explain the needs lor
encapsulationwith exampie.. 4
(b) What is specialization? Explain with example how
.is differentfrom generalization.
specialization 5
(cJ Explainhow the followingare implementedin C++ : 6
(i) Inhentanc€
(ji) Association
cs-r6@ 4,000
ADCA / MCA 0l Year)
Term-End Examination
December.2OO5
CS-sl@ : OPERATIONS
RESEARCH
Time: 3 hours MoximumMotks: 75
cs-s1@ P.T.O.
three models is r 500, 500 and 375 uoits,
rcspectively. However, the ratios of the number of
units produced must be equal to 3'i 2 : 5. Assume
that the profit per unit of Models I, I and lll is
Rs. 60, 40 and 100, respeciively.
Formulate tbis problem as an LPP model tq
determine the number of units of €ach product
which will maximiz€ profit.
(b) List the steps invoived in the most g€neral case of
the simulation process. 4
(c) Define the following dynamic programming terms : 6
(0 Stage
(n) State lariable
(iii) Decisionvariable
(iv) Immediate retum
(v) Opiimal return
(vi) State uansformalionlunciion
(d) List the major limitations ol the PERT moclel. 4 ,
Determine the optimal strategies fot both the
players, and the value of the gam€, Ior the following
pafoff mahix :
PlayerB
2 -2 4 I
6 I 12 3
PlayerA
2 0 6
2 -3 7 I
cs-s1@
A farmer buys a quantity of cabbageseeds{rom a
companythat claimsthai approximately80% ol the
seedswill ge(minaiei{ planled properb. lt 4 se€ds
are planted,rrhat is the probabitityttlai
(i) exactlyhro will g€rminate?
(ii) at leasttv,o will ge{mioate?
w2 w3 Surpply
.F1 20 t2 200
Factory F2 14 8 18 160
F. 24 90
Demand 180 120 150 450
c s5 1 @ P.T.O.
for the item is constant at 1000 units and each oder
costs Rs. 100 to place.
(i) Calculat€ the EOQ and th€ total costs
. associatedv!]th stockjng the item.
(ii) ff the suppli€r oi the item will onlg deliver
batches ot 250 units, how are the stock holding
costs affected ?
cs-s1o
(b) In a rail,.^raymarshalling yard, goods trains anive at a
rat€ of 30 trains per day. Assume that. the
int€r-arrival time follows an exponential distribution,
and the sen ce time (re., the time taken to servicea
train) distribution is also exponential with an average
ol 36 minutes.Calculatethe
(i) expected queue size (ine length);
(ii) probability that the queue size exceeds 10.
If tbe input of trains increases to an average ot
33 per day, what will the changesbe in (i) and (ii) ?
cs's1@ P,T,O.
(b) Use tlte Kuhn- Tucker conditions to solve the
following nonlinear programmingproblem :
M a x . z = 1 0 x - - x ? + 1 0 x ^- x?
cs-51@ 5,000
tcr-54@-l
ADCA / MCA (ll Year)
Term-End Examination
December,2OOS
oN
CS-54@: FINANCE& ACCOUNTING
COMPUTERS
(b) 'variance'
What is ? With the help of a suitable
example, calculate Direct Materlal Cost Variance,
Price Varianceand UsageVariance.
cs54@ P.T.O.
(b) What is the di{lerence between the fo]lowing ? Give
exampl€s to illustrate your explaiation
(i) Fixed Cost and VanableCost
(ii) Funds Flow Statement and Schedule oI
Changesin Working Capital.
(iit DenreciaLe:
Furnitureby 10Yo
Freeholdproperty by 5%
(ivj Loosetoolswerevaluedat Rs.1,760on 31.3.1998.
Of th€ SundrydebtorsRs. 600 are bad and should
cs,54@ P.T.O.
(vil Malntain a provision ol 5% on Sundry debtors for
doubtfuldebts.
(vji) The manageris eniitledio a commissjonof 10o/oof
rhp nel profirsafterchdrgingruch commjssior
cs-54() 6,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December,2005
GS-60@; FOUNDATION
COURSEtN
MATHEMATICSIN COMPUTING
Time: 3 hours Moximum Morks : 75
1 - 2
l. (a) Find lim l:j .
'(b)
Find the domatnand range of the function f, defined
by f(") = * 2- 4 .
3
{c) Differentiate
(i) (3x2 + 4) (x2 - 3)
(it x + --- + -=
with
cs€o
o P,T,O.
Show that
(2+ 31)2
{it
1+i
l f u = 1 2 , 4 , 6 , . . .A1=, { 4 n l n € N } a n d
B = {6n I n e N}, findA\B andA" n B". 4
csso@
(b) Evaluite ,
I( 2 x 2+ x - 1 l*
{c) Solve x3 - 30x + 133 = 0 by Cardano'smethod.
(ii) O, 3l is a set.
{Descartes,
6x-5-y=0,29+2_ 3x=0.
lf Ve5. dpply rhe rule tor finding the solution.
Otherwise, use the substitution method. 4
cs-60@ P.T.O.
4, (a) Find the equaiion of a sphere with centre
(2, 0, - 3), and which touchesthe plane
3x+4y-z=5.
t t
5. ( a ) S h o wl h d L | { ( x ) d x = l f { a - xldx. {orany
J J
0 0
function f defined on [0, a].
Hence evaluate
nl2
I sin"x dx.
cs-60@
Find the c€ntreof the conicoid
4x2-yz + 222+ l2x - l1y + 6z + 4 - 0.
Also reducethe equationto standardform.
cs€o@ 8,000
.: t..
BACHELOR IN COMPUTER
APPLICATIONS
Term-End Examination
December,2005
AND INTEGRAL
CS-601G) : DIFFERENTIAL
CALCULUSWITH APPLICATIONS
Time : 2 hours Mdximum Marks : 75
cs-601@ I
(iv) The functon f: R e R, given by
l-x dy
(b) If y= , prove that {1 - x2) + Y = o
il dx
.
l r y = t a n - ' ( x- )c o ' '
, r , _- - " , ) --
Il \. I r h e "{ri n d
1+x'J
Evaluate:
,. *2-fi
;-r 'f-1
G i v e nt h a t e = 2 . 7 2 , e 2 = 7 3 9 , = zo.og,
"3
i
= 54.60, flnd the value of
"4 J '
0
Simpson'sRule, and compare it with its exact value.
cs-601
@
2. (a) Il I" = l tannx dx, showthat
J
0
n{l.+l -)=1.
Deducethe valueof Ir. 5
3. ( a ) T r a c et h e c u r v ex = \ i n 2 t . y - c o s t . O < t < z f t ,
giving all the properti€syou requirefor doing so. 10
4. (a)
(b) Differentiate
nti-+l *.'.t..tn-1 1a*.,.[-+l I
Showthat ihe curves
r0 = a and r = ae
cul orthogondlly.
f f
(d) Is I sin {2e)d0 = 2 | sin e d0 ? Givereasonstor
J J
cs-601
@ P.T.O.
5. (a) Find the valuesof a, b and c if the fuhction I given
below is conrinuousal x = 0 :
sin(a+ 1)x+ sinx
, i fx < 0
f(x) = , i fx = 0
{b) E!,aluaie :
f d "
J d;t1.;q
1
lf y = cos (m sin x)i show ihat
(1 - *2)yn*2 (2n + 1)xyn*, + (m2 .2)yn = 0
cs-601
@ 1i000
BACHELORIN COMPUTEN
APPUCATIONS
Term-End Examination
Decernber.2OO5
GS-610G): FOUNDATION
COURSElN
ENGLISH FORCOMPUTING
Time : 2 hou's Maximun Marks: 50
cs$l0 @ P.T.O.
much longer than the sensation of fullness produced by
protein oi carbohydrates. At least two teaspoons of fat
per day is needed lor the digesflve system to absorb
vitamins A, D, E and K, which are. fat soluble. Thes€
vitamins are essentialfor healthy haii, skn, t€eth, and
€yes. Without the ability to absorb these vitamirls,
children run the risk of developmental ard neurological
disorders. Adulls need these vitamins to manufacture
Iertility hormones.
cs-610
@
(b) Say wh€ther th€ following statements are true ot
false according to the passage. Correct the
statements that are false.
cs-610
o P.T.O.
3. Do the follo$ing s€ntencesas directed.
(i) Correct the followlng sentenc€s :
(a) H€ is understanding the lesson now. l
(b) My sister had come frort London taat night. 1
cs-6ro
o
5. Read the follo\rnng passageand summarize it to one-third
its length. Give a $itable title. 10
cs-610
@ P.-r.o.
6. Write a composition ln about 300 words on any one of
the following topics : l0
(0 Tr€es are Green Gold
cs-610
o 6,000
r-.------=--.1
I cs611g I
BACHELOR IN COMPUTER
APPLICATIONS
Term-End Examination
December,2OO5
CS-611€) : GOMPUTERFUNDAMENTALS
AND PC SOFTWARE
cs€]1
o P.T.O.
(d) Write a step-by-step procedure to do each of the
following activities using MS-WORD.
cs-61
r@
6. {a) Wlte a st€p-by-step procedure to create a iable in
the WORD document,with the help of an example.
cs-6rr @ 6,000
lE{116-l
BACHELORIN COMPUTER
APPUCATIONS
Term-End Examination
December,2OO5
c s € r2@ P.'r.o.
(c) Explainthe following terms : 10
(i) Auto tormat
(ii) Auto Jil
(iii) Font
(iv) wYsrwYG
{v) Pagesetup
(dl What is a 'Brl){irser'? Exptain any two differences
betweenthe hro basiccategodesof Blowsers.
cs-612
@
4' (a) What is "liltedng a datalrase"? Expiaintwo waysto
fiiter a dotabas€.
lb) What 1sa Pivot table? Explainthe processof adding
and removingpivot table data.
c- jnlolved in restrictingaccessto
{aJ Explainthe processes
a workbook. 5
{b) Explainthe followingterms.: 6
(i] Telnet
{il) lntemef SewiceProvider
(iii) www
(c, What are "Macros" ? Explain the steFs to run a
Macro.
cs-612
@ 6,000
BACHELORIN COMPUTM
APPUCATIONS
Term-End Examination
December,20O5
cs62o P.T.O,
Write a program that acc€pts ihyee numbets and
decides 10
(i) wheihev these ca$ be lengths o{ the sides of a
triang]ei
(ii) if ttleg foifn an, equ(ateral, isoscelesot scalene
irianglei
(iii) i{ they {orm a right-ansl€d tria$gle.
cs€2o
4. (a) Defioe the following ;
(i) Full binary tree
(ii) lndex€sw.r.t. liles
(iii) Hash function
css2@ 8,000
BACHELOR IN COMPT.ITER
APPLICATIONS
Term-End Examination
December, 2005
cs.63
@ P,T.O
(d) Write UNIX commands for the following ,
(i) to direct th€ output to th€ file as well as to the
CSffiO P.T.O.
4. (a) How is a client server model differeni from the other
two operating system structures ? List at least four
advantages of client s€rrer mod€].
(b) What is shell programming ? Write a shell progam
to prjnt all the cont€nts of an existing text lile in
upper case.
cs,ffi@ 7,ADD
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December, 2OO5
CS-ar@ : INTRODUCTION
TO COMPUTER
ORGANISATION
Time : 3 hours Msxinum Mdrks : 75
cs-64
o PTO.
Explain the use of 'IDIV' and 'AAS' instructions,
with ihe help of an exampleof each.
Delay = 20 s€conds
-l.
Delag = 5 seconds
D
Delay= 1g.""on."
cs-64
o
(b) Explain diflerent steps of an instruction cycle for
multi-operand instructions, with tlte help of an
example.
(c) Il a memory read cycletakes50 ns and a cachereacl
cycle takes 10 ns, ih€n (using this data) can yoll
prove that the performance with cache is better ?
Make suitableassumptionsabout hit ratio.
cs64o P.T.O
5' (a) Explain the following terms with the help ol a
suitablediagram/exampleeach :
(i) I/O processor
(ii) Logicmicro-operations
(iii) Micro'insiructions
cs-64
o 7,000
F s.@l
BACHELOR tN COMPT'TEB
APPUCATIONS
Term-End Examination
December,2OO5
CS-66@: MULTIMEDIA
cs-66@ P.T.O.
2. (a) Explain the three categoriesof presentationtools
availablefor multimediadevelopment. 6
(b) What is QuickTjme ? Explain the working ol
QuickTime. Also write iwo ad!,?ntages of using
QuickTime. 9
cs-66@ 6,000
BACHELORIN COMPUTER
APPUCATTONS
Term-End Examination
December.2OO5
CS-68 O : COMpUTERNETWORKS
Time : 3 hours Moximum Marks: 75
Note : Question nwnber 1 is compulsory. Answer ony
three questions lrom the rcst.
cssso P.T.O.
(vi) Compare bridges with gatevrays. Explain iheir
funclioning using suitable diagrarn.
(vii) How does an ATM network work ? Explain through
an appropriat€diagram.
(a) RIP
(b) osPF
cs-6e@
(iii) Differentiatebehreen
(a) Hubs and Switches
(b) Analog data and Digiial data
cs-68@ 6,000
BACHELOR IN COMPUTER
APPLICATIONS
Term-End Examination
December, 2005
CS-69@ : TGP/IPPROGRAMMING.
{' FTP
(ii) Telnet
(ii0 SMTP
cs-6s
o P.T.O.
ic) ldentify the header of each TCP flag. Also, explain
its importance.
{' URG
(i0 RsT
(iit 5YN
(iv) PSH
{ii) www,ignou.co.in
(iii) www.ignou.org
(iv) www.ignou.ac.uk
cs-6e
o
3. (a) Draw the various fields of an tP header Explain the
process of fragmeniation and reass€mbly of an IP
Wcket in Internet. 10
{b) Write th€ iftportance of ARP and RARP in tAN. 5
la! 145.10a.92.65
lbl 193.79.42.85
(b) Like IP address, all the hatdwar€ addressesare also
unique throughout the network. Wh9 is hardware
address not used in place of lP address? Jr.rstifyyorjr
cs-69
o 6,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December, 2OO5
CS-70@ : INTRODUCTION
TO SOFTWARE
ENGINEERING
cs-70@ P.T.O,
3. {a) Write the processof schedulinga project.
{b) What are CASE tools ? What are varioust!?es of
CASEtools? What are th€ benelitsol usingCASE
tools ?
cs-70@ 6,000
BACHELOB IN COMPUTER
APPLICATTONS
Term-End Examination
December, 2OO5
GS-71@ : COMPUTERORIENTED
NUMERICALTECHNIOUES
cs-71 P.T.O.
@
(c) Find43x3.
(d) Compute f(6) using Lagrange'sformula on the
following data :
3 5 8
(*) ' 1.1 t6 2.1
(e) From ihe valuestabulatedfind the pojnt x, where the
Iunction f has maximum value :
1 3 5
f(x) , 30
Use the forward difference formr-rla.
Show three itemtions of Causs- Jacobi method for
solving the equations :
sxt+x2+2x3=10
3 x 1+ 8 x 2 + \ = 13
xt+x2+4\:10
cs-71
@
{b) From the following data compute f(1) and f{10) usjng
Nev,'ton's forward or backward dilference formulas,
whicheveris appropliate.
0 4 8 72
(x) , 46 66 6I 93
(c) Using di\rided difference, show that the following
data representsa third degre€ polynomial. Obtain
ihis pobnornial. Hence, find the vatueof f(5).
0 2 3 4 7
r(x): 4 58 1.12 466
3 x 1+ x 2 + x 3 = 4
xl +2x2+3x3=3
2
(b) E\raluate
the inteoral
- I = Jf xe-^dx
0
W lj) Trapezoidal Rule, lii) Smpson's Rule. Divide
the inten?l into four subintervals.
cs-71
@ P . TO ,
4. (a) Find the solution of the {o[ovJtng simultaneous
equaijonsby the Causs- Seidelmethod corr€ct upto
the nearestinteger.
2x+y+52=8
4'.+y+22=8
x+59+z=12
Y = i t - . y ) , y ( 0=)1
cs-71@ 6,000
BACHELOR IN COMPUTER
APPLICATIONS
Term-End Examination
December,2OO5
cs-72@ P.T.O.
'ld) What is abstraction in an obj€ct-oriented language ?
Describe the important types of abstraction wiih the
help of an exampleeach. 5
cs:720
5. {a) Whal js aD actjvity djagram ? Wher do we use
aciivity diagrams ? Glve an €xample of an activity
diaghm.
What are the commandline arguments ? Explain
their use with the help o{ an example.
cs-72@ 3 6,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December, 2OO5
Instantaneousdescription,Halted configuration.
(e) Give the guiding rul€s lor constructing a Turing
machin€ m out of m.. 3
(D Explainthe notatjons O and,r.
@,
cs-7so P.T.O.
2. \al Diff€rentiatebetw€enany three typer of grarnrnars,
basedon iheir productionrules.
(b) Prove that L = {anb'an b- ln, m > 1l is not
6
{c) State any three undecidableproblems. 3
cs-73@
E{plain ihe equivalence of regular expression and
FA. Also, give the iransition diagram {or the
following :
(i) R=P+Q
{ii) R = P'
(iii) R=PQ
cs.73o 6,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December. 2005
TO INTERNET
CS-74@ ; INTRODUCTION
PROGRAMMING
cs-74@ .P.T.O.
(c) Consider the following classes, declared in separate
source {iles : 1A
public classC{
public void method(int i) I
(" value is" +i)i
system.out.print
l
)
public classB extendsC
j public void method (ini j)
I system.out.prlnt
(" This valueis" +j);
l
public void melhod (string s)
I
(" 1 was passed-"
sgstem.out.print +s)i
I
public sraticvoid rnain (String argsl ] )
{ C bl=new (C);
C b2=new(C);
bl.method (5);
b2.method{6);
)
I
What will be the output when th€ main m€ihod of the
Class B is run ?
cs74o
II
I
2. lal Define Class. De[iae Static Class-Gi€ an €xamp]e
ol each. 6
(b) Lisi and explain at leaat four classesol java.lang
packag€.
cs-74@ P.T.O
5. (a) Explain the concepts of Polymorphism and
Inheritance.Giv€ an exampleof_ea.h. B
(b) D'ffe/entiate between the following : 7
(i) Thread and Process
(ii) Applet and Applicaiion
(iii) Jal"?and C++ Programming
cs-74@ 6,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December, 2OO5
CS-7s@ : INTRANETADMINISTRATION
cs75@ P.T.O
{e} What is the use ol ICMP protocol ? Whar are rne
uarious messages€xchanged jn it ? Explain th€ use
ol ihe Sourc€ Redireci ICMP messag€. 5
i0 Whal do€s the RARP protocol do ? 3
lgJ Whai is the Intemei DNS zone ? 2
(h) What are the various lntemehrorking devices ? How
do lhev diffet in theA lunctionalities?
cs-75@
4. (a) What are the different E,commerce protocols ? How
do they help in businessdevelopmeni in lniemet ?
cs-75@ 6,000
BACHELOR IN COMPUTEB
APPUCATIONS
Term-End Examination
December, 2005
CC-09@: INTERNETAWARENESS
cc-os@ P.T,O
(b) What is FTP ? Also m€ntion any tro applications of
this tool. 5
M I P
What are Mailing Lists ? How are they usefulto the
Intemet users?
cc-oe@ 1,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December. 2OO5
CC-rt@: USUALBASIC
Time : 2 hours l v t a x t m u m w r a r K s: / 5
cc,11
o P.T.O.
2. (a) Explain at least5 propertiesof a lorm.
cc-l1@ 1,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examinatiod
December, 2OO5
CG-16@: INTRODUCTION
TO C++
Time: 2 hourc
Not€: Quesiio, number 7 is compulsory. Answerang
three questionsJrom
cc-16@ P.T.O.
{b) With the help of an exampleprogram. explain the
use of opetator overloadingin C++ programs,
c c1 6 o
5. (a) Wriie the syntax foy the declaration of a template in
C++. Demonstrak jrs u"e wllh an exa?ple. 5
cc-16o 1,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December, 2005
CS-601O : DIFFERENTIAL
AND INTEGRAL
CALCULUSWITH APPLICATIONS
.,,t i,-,
ii,"1i-,J,,]
hn] The line ] ' v-- 2 i. u tanqenlro ihe ( u.w
II|,|:|-2 a t ( ab )I o ra l lv a l u e
o sl n
cs-oor
@ . P:T,O.
(iv) Th€ function I : R, R, given by
L - _ L
f{x)=/n Jx: I t - \ I . is an odd tuncrion
t i
d9
(b) If y = p,ou",r,",O - l) + Y= o
UE, dx
/- ,\
{ c ) ) t v = r a n r l *-1. o r - r l l - " ^ "] ' r . - r , ' a *d.c
l t""/
(d) Eviluate ,
, -J;
"2
x+! l/x - I
cs-6ol@
2. (a) If In =
I
0
tannx dx, show ihat
n (ln_,+ I.*r) = 1.
Deduce th€ value ol 15. 5
4. (a) Eval.l,ate:
| ,l . a'.
'
il - 4x' w.r.l.sin (4y
lb) Dillerenriare
(d) ls
J
sin(2e)d0 = 2 j sin e d0 ? Give reasonsfor
your ansrrer. 2
c9601@ P.T,O,
5, la) Rnd lhe values of a, b and c if th€ lunction I given
below is continuousat x O . 5
sin(a+1)x+sinx
, i fx < 0
f(x) = , i fx = 0
(b) Eraluate:
f d x
J {1';rrr*;5
tc) li y - cos {m sin r): show rnal
{1 - x")y",, - (2n r 1)xyn*, + {m- - n") yn - 0 5
cs-60i@