Professional Documents
Culture Documents
Term-End Examination
June,2OO5
GS-01: COMPUTER
FUNDAMENTALS
Time : 3 hours MoximumMorks: 75
b = a + f
CS-01 P.T.O.
(d) Explain the lollowing addressingmodes with one
exampleeach.Also give one use of each addressing
mode,
(i) Regisieraddressjng
(ii) Index addressing
(iiil Stackaddressing
(iv) Base addresslngscheme
.
tej Write a program in 8086 assemblylanguag€ to
displaya stringstoredin the data segmenton th€
computer monifor, only if the first characterof the
srringis an uppercase
alphabet.
cs-01 2
(ii) The key issuein inierlacing is the selectionof
propel parameterpassng.
(iii) Hard$,areinterrupts can be inloked with th€
helpof the iNT function.
(c) Draw the logic d:agramfor 8 x 1 multiplexer.
cs-or P.T-O
5. (a) State whether the follov,lng are ifue or false. Give
one reasoneach ln suppon of your answer.
end
What is the need of Cache ? How does it enhance
the speedof memory access?
(d) Give four differences bei(een horizontal and v€rtical
micro-instnction.
cs-01 4 25,000
PGDCA / MCA (I Yr) ,r BCA
Term-End Examinatiori
June,2OO5
CE-02; INTBODUGTION
TO SOFTWARE
Time, 2 hours Maxi um Marks: 60
cs-02 P.T.O.
3. {a) What are the desirable characteristics of disk
allocation ? What arc trro advantagesand hro
disadvantagesof the Indexedallocationmethod ?
(b) Why is demand pagjng used in virtual memory
management? With &e help o( an example,explain
the demandpagingscheme.
cs{2
(b) What is a 4GL ? What are three diflerences
betreen th€ 4GL and earlierlanguages-
Ust any
thEe 4ctr.
cs-02 10,000
PGDCA/McA0Yr)/BcA
Term-End Examination
June, 2OO5
CS-03: FILESTRUCTUREAND
PROGRAMMING IN COBOL
(i) WRITE
(i' USAGE
liii) GO TO
cs-03 P.T.O.
(c) Four data names A, B, C, D have the following data
descriptions I
77 A ?tC a@) VALUE 1921
77 B PrC 9(2JV9l.2) VALUE1212
77 C PIC 999V 9l.2) VALUE24a.44
77 D PtC 9l.2)V 99 VALUE28.8
Whatwili the contentsof A, B, C, D be after ihe
executionof eachof the followingstatements?
(i) ADD A, B, C CMNG D ROUNDED
(n) COMPUTEY = A**Y + (D + C)*2
z = (c - Br3
(iit CoMPUTE (A- D)
('v) COMPUTEB INTO D GMNG A ROUNDED
(v) MULTIPLY D BY 13 GIVING B ROUNDED
ON SIZEERRORMOIV'E10 TO D
li) RegistraiionNumber
(ii) CourseCode
(iii) Student'sName
(iv) Student'sMarksin 5 subjectslor 6 semest€rs
(v) Student'sCrade
Cr€ate the data division for the processingol thts
data.
cs-03
Write the gen€ral formats for "STRING" and
"UNSTRING" statements.A field named NAME
contains50 charact€rs.
Wdte a COBOL sraremenr
to changeall instancesof "SHRI" by "MR" and
"SMT" by "MS".
How are READ and WRnE $atements us€d in
relative file organization? Write all the dilfereni
formatsol READ and WRITE.
, cs-03 P.T_O.
3. A Sports Club maintainslhe following master Jile lot the
majoi items usedin sports :
Item Code 6 characters
item Name 20 characters
SupplierCode 6 characters
Price 8 declmaldigits
Numberof ltems 6 decimaldigits
The tronsociion lile rccords t\e folovring data ,
Item Code 5 characterc
Receiv€d^sued 1 charactet
Date of transaction 8 characters
Write a progam in COBOL to update the numb€r of
ttemsin the moslel tile usingthe tronsoctiontile. 10
cs{3 14,000
I cso4|
PGDCA / MCA (I Yr)
Term-End Examination
June,2O05
{ii) - + A. B,/CDE 10
cs44 P.T.O.
, (d) Define the foliowingtermswith a suitableeyampleof
(i) Tree
(il) Depth of a Tree
(ili) Height ol a Tree
cs-04
3. (a) L1 and L2 are trro singlg linked lists which are
already sorted. Now, writ€ an algorithm to
concatenate Ll and L2. Ensure that the
concatenatedlist is sorted.
(b) Wriie a funciion that rehrrnsthe height of an AVL
5. (a) 'heap' ?
What is a Write an algorithm for th€ insert
as w€ll as deleteheap op€raiions.
(b) List at leasi 3 differences behr€€n Anays and
Pointers.
cs-04 14,000
PGDCA/MCA0Yr)
Term-End Examination
June, 2O05
cs-05 P.T.O.
2, (a) Explain at l€ast hro objectives of inpui deJign. 5
'lteasibility" mean
{b) What does the ielm ? List the
seven tgpes of feasibility, and the four stages in a
feasibility study. 10
c$05
6. (a) Explain the planning and control aspects of
management,Explain each of these lunctions at ihe
styategic,tactical and operational levels, with the
help of examples.
r8,000
PGDCA / McA (l Yr)
Terrn-End Examination
June.2OO5
CS.O6: DATABASEMANAGEMENT
' SYSTEM
c$06 P.T.O.
(c) Explain the threelevel architecture of DBMS,
includingthe diagram.How is the mapping behreen
these levels achieved ?
cs-06
4. {a) Consider the following schema :
P.T.O
(b) What are the differ€nt relational operatovsused in
relational algebra? Consid€rthe following relations
A and B, and performA U B, A n B and A - B.
A + FlightNo. Airways
lC 2715 JndianAi'lines
lC 1007 Jet Airways
IC 9119 Sahara
lC 3849 IndianAirlines
B -+ FlightNo. Airways
IC 1007 Jet Airways
lC 5187 Ca.thayPacific
IC 1003 SingaporeAirlines
cs-06 19,000
ADCA / MOA (ll Yr)
Term-End Examination
June.2OOS
CS-07: DISCRETE
MATHEMATICS
Tlme : 3 hours Mqtimum Morks : 75
{0 2+3=6
( i i i )2 + x = 7
cs{7 P.T.O.
(c) Find the product Gt x G2 of the following graphs :
v2
u1 u2
cs-07
to For the lattice(D{231), g.c.d., Lc.m.)draw the
Hasse diagram. Also check that the lattice is
complemented.
{h) Flnd the diameter and radius of the following
F graph :
cs-07 P.T.O.
3. (a) The adjacency rnahix of a graph G ls
0 0 1 1 0
0 0 1 1 1
1 1 0 0 1
1 l 0 0 0
0 0 0
cs-07
(i0 How many teachers have used both Pascal and
c?
(iii) How rnanyteachershave use.dFortran, but not
c?
liv) How many usednone ol the three languages?
C I U E
cs-07 P.T.O.
t € t X = 1 1 2, , 3 ,4 , 5 , 6 i r .
^ r0 0.4 0.3 0.s 0.1 1l
l1 2 3 4 5 6)
- fo.l 0.3 0.1 0.1 0.2 0rl
"=1Tz s'? s 6l
(i) Which of the {uz4 setsA and B are notma! ?
Glve reasonsfor your ah$rer.
(ji) FindAnB.
(ii0 Find Ac.
(iv) Find the supportol A.
(v) End Ao,t .
ctu7 16.000
ADCA / MCA (Il Year)
Term-End Examination
June,2OO5
Note :
(i) Use ol calculator is allowed.
(ii) Question number 7 is cormpulsory. Answer ony
three lrom the rest.
-
1 Q,' :Q.
'
lll) r=
4rr€o
l . ; 2
(iit z = R2+l,ol-- -l I
\ oci
(b) Which of the following are correct repres€ntations
of
real constants? Give reasonsfor your answers.
2 2 2 5 ;0 1 3 7 : 2 E - 7 ; 7072E+2
cs-08 P.T.O.
F (c) Write a program in FORTRAN which reads a, b,
and c (the lengths in met€rs of the sides ol a
triangle),computesth€ area of the triangle and ihen
determines the number of one-litre iins of paini
required to paint this area with on€ coat of paint
(assumingthat on€ litre of paint can cover 10 mz
area). Note that ihe area of a triangle is given by
b =40
P=a+b
X=a+b
Q =a'b
CS-OB
R = P,/Q
z=x/Y
PRINT., P,Q,R
PRINT ,, X,Y,Z
STOP
END
x (independentvariable) y (d€p€ndentvariable)
9 6
7 4
4 7
5 10
3 9
2 6
cs-08 3 P.T.O.
Calculateth€ mean and standard deviation for ihe
following ,
Size of item
6 3
7 6
8 9
9 13
10 8
11 5
72 4
J = 4
x = 22.5
Y=-100
Z-025
P = Z+X.Y
Q = P+20'Y"l
R = _ Y'8.o/REAL (J)
X=Q+R
Y=X'2.0-Z
Z=Z-R
cs-08
J = INT (3.0'2,/REAL (I)
I=l+6
PRINT', I,J,X,Y,Z
PRINT., P,Q,R
STOP
END
tb) Write a FORTRAN programto find the two roots
of the quadntic equaiionAX2 + BX + C = 0. Read
the valuesof A, B, and C as 15 25, 30 12512 and
0 675 E-01, tespect:vdy.
(c) Fach of the {oilowingarithmeticstatementscontains
iit least on€ error. Point out the grrors ;nd correct
the statements:
(t v = x,/Y- 37,375.15
liiJ z = 7 52E+(2.r)
(iii) MAXA = P
Slandard deviaiion 8 9 10
Find which of these have the larger variaiion. 4
cs-08 P.T.O.
3, (a) The sum of the squares of the first
n natural
numb€rsis givenby
n { n + 1 )( 2 n + 1 )
S_
0-10 l4
77-20 t7
21-30 22
3 1- 4 0 26
41-50 23
51-60 18
cs-08
4. (a) A lactory manulactunngtelevisionshas fout units
A, B, C and D. The unitsA, B, C, D manufacture
15%, 20Vo, 30/0, and 35% ol the total output,
r€spectiveiy.Ii was found that oui ol their output
1%, 2%, 2voand 3% are def€clive.A lelevisionis
chosenat mndom lrom the total output, and found
to be delective.What is the probabilitythat it came
from unitD ? 3
2x-5=3y+72
ox+9+zz=3
x-F'y=20
Further, list ihe modificationsrequired, iI any, for
effectlv€ program execution.jf the program were
. wrlttenusingFORTRAN90 instead. 7
cs-08 P.T.O.
5. (a) Calculatethe Cost of Living lndex Numberfrom th€
following data :
Ptice
Items Weights
Base Year Current Year
Food 400 500 5
Fuel 90 120 2
Cloihing 150 2DO 3
House Rent 300 250 2
Miscellaneous 300 380 1
GiveD below is a setes ol rveekly denand tor
out-patientCareai an ambulatorycentre.Also shown
are foiecasts of demand calculated by t\ro
forecastingm€thodsthat are under consldeiation.
Forecast
Demand
Model A Model B
536 575 550
590 600 580
554 580
622 595 600
778 6r0 670
673 625
640 630 650
595 640 645
(t Compuie the MAD ior each forecastmodel
(i, lndjcaie which modei you think is beller-and
whv.
CS4B
The Mother Dairy Ice Cream Shoppe has recohled
the demandfor a particularflavour during the past
6 weeks,as shown below :
Gallons Gallons
1"t Week,
Febnrary
19 27
Febwary
2nd Week, 1s Week,
17 29
February March
3'd Week, 2"d w'eek,
22
February March
t
] Calculate a 3-week moving av€rage for the data
I to forecasi demand for the next $reek.
Cabu,ate a weigbted average torecast lot Ihe
data, using a weight oI 0 6 for the most recent
data and weights of 0 3 and O-1 lor surcessively
old€r data.
cs{B 18,000
ADCA / MCA (ll Yr)
Term-End F-xamlnatlon
. Jrme, 2OO5
CS-09: DATACOMMUNICATION
AND
NETWORKS
' Time: 3 hours MoximumMorks: 75
ilore r Quertion 7 is compulsory. Answer ony thtee
lrcm the rcst.
cs-09 P.T.O.
{d) PPP is based clos€lyon HDLC, which has user bit
stuffing to prevent accidental flag-bvtes within the
payload fuom causing confusion. Giv€ one reason
why PPP uses character stuffing instead. Explain
your choic€ o{ reason.
cs 09
4. (a) Why is compressionrequired? Compare the JPEG
and MPEG formats, with expldnation-
(b) Wvife the shori€si path rouiing algorithm, and
explarneach slage. 10
cs-09 18,000
ADCA / MCA 0l Yr)
Term-End Examlnation
June,2OO5
GS-10: SOFTWAREENGINEERING
cs-10 P.T.O.
For the above mentioned system,
(i) develop a Systems Bequirement Specifications.
(ii) design DFDs for 2 le',els.
(iii) identifi,/ the soft'arare modules and their
functions,
(M suggest a iesting strategy for dny one of d1e
software modules proposed in (iit abow. 20
(b) Develop a procedural design for a program that prints
the distinct characters in its input strtng. Write hro
test cases for the procedure. 10
cs-l0
4. {a) Write, and explain, the principle of fwction,orient€d
metrics, with the help of an example. Gve three
diffeymces behreen tll'lction-oriented metrics and
si2e-odenfed mellics,
cs-l0 t4,000
ADCA / MCA 0l Vear)
Term-End Examination
June.2OO5
cs-51: OPERATIONSRESEARCH
Time : 3 hours MoximumMorks: 75
Minutesper unit
Product
Process2
1 10 6
2 5 15
cs-s1 P.T,O.
(b) Patientsanive at a doctor'scllnic at randomand ihe
averagerate of arrilal is 5 per hour. Determinethe
probabiity that duringa period of one hour, there is
no arrival. Also find the probabilitythat during one
hour there are. more than 2 arit"?ls. You may
assumethat the number of arrivalsduring an bou.
foilows a Poissondistribution.
{c) Describethe ABC and VED classificatonof items in
an inventoryand its use ln inventorymanagement,
(d) l-ist any three limitations ol an OR,approach to
solvingpracticalproblems.
(el Suppoe A is an n x n integer matdx whose entries
are 0, 1 and- 1. Statethe ruleto determineif A ts
a unimodular mahix. Also explain the algorithmic
use of the unimodularity properiy ,n integer
programmmg.
{0 In a job-shop, there are three operators and there
are three tasks to be performed. The manager
estimatesthe time in mintuesof the tfue€ op€rators
to do the three iasksas {ollows:
Tasks
OpeGtors
1 2 3
I 10 9
I 9 10
u 8 12 10
The rnanagerwantsto minimizethe total time taken
by the three operators, as this will minimize the
el€ctficiiy consumption. How should th€ manager
assignthe tasksto the opentors ?
2. la) Solve ihe linear programming prcblem lormulated in
Q.l(a), using the simplexmethod. 7
(b) A mechanic who attends to llat igres of the vehicles
and replaces them, can attend to one vehicle ai a
hme. Vehicles anit€ according to a Poisson
distributionwith mean 2 per hour. for this service.
The service time distribution is negativ€ expoDential
with meln - 15 minutes.
(iJ Calculate the steady state probabiiities of finding
K vehicles in the system.
(ii) Find the avemg€ time spent by a customer in the
cs-51 P.T.O,
4. (u) Derlve ihe Kuhn - Tucker condltions lor the
following problem :
Maximize-{2x1 - 5)2- l2xz-.1)2
s u b j e tcot x . \ + 2 x 2 < 2
x 1> 0 , x Z > 0 .
(b) Using the concept of dominance,'reduce the
Iollowing 3 x 3 matrix to a two plaler zero sum
matrix game, and sohe {or the optimal sirategiesof
the playersand valueof $e game.
Aayet Il
Aavat
i ' --32 't l
l-2 l
L 4 3 2)
5. {a) Solve the lollowing problem using dynamic
programmmg :
Maximize 2x1 + 5x2 + x3
subjectto xl - 2x, + 3xr S 7
K>0,xirieger,
i=1,2,3.
(b) Define the following terrns and give one example of
cs-51 20,000
ADCA / MCA (U Year)
Term-End Examination
June.2OO5
P.T.O.
(b) 'Variance analysis ?
What do you understandby
Also explain how the ,"?riancecan be controlled.
(ii) Per{o{maflcebudgeting 5
cs-54
5. Frorn the tollowjng particulars ior the year ending
31st March2003 ol M/s XYZ Ltd., prepareTtadingand
Profit and LossA/c and BalanceSheeton ihat daie
Rs. Rs
Stock 15,950
23,200
(1.4.2002)
Apprenticeship 3,480
1,45,000
|{1.4.2002)
Purchases 58,000BiUsreceivable 10,150
SaJes 2,32,000Bills payable 7,250
OUice 58,000
23,345 Sundrydebtors
expenses
Return Plant and 13,050
4,350
inward Machinery
Iniercst on 45,a20
870 Sundrycreditors
loan
Reiurn Loan (Dr) @ 10%
1,760 14,500
on 1.4.20O2
cs-54 P,T,O.
(i) lnterest on capital to be allowed at 5% for the year.
(ii) Interest on drawings to be charged for the year is
Rs.232.
{jii) Apprenticeshippremium js for thrce years recelveo
in advanceon 1srApdl 2002.
(iv) Stock 'Jatued at Rs. 8,700 destroyed by lire on
25.3.2003, but the insurancecompany admitted a
claim of Rs. 5,800 only to be paid in the geat 2004.
(v) Rs. 14,500 out of adveriisement€xpensesare to De
carried {or\rard.
(vil The manageris entitledto a commj6sionof 10% at
the net profii calcutatgd after charging such
1B,000