Professional Documents
Culture Documents
*'l
PGDCA/ McA (l Yr) / BCA
Term-End Examination
December,2OO5
CS-01: COMPUTERFUNDAMENTALS
CS01 P.T.O
{D Explain the problems fhai prevent a RJSC pjpeline
from achieving ma,\imum speed. How can ihese
problemsbe handled?
Memory locaiion
0100 A100
0101 2BOT
0500 5001
0501 0100
A100 0101
What would the value oI ih€ operand be if the
(t LoAD INDIRECT
0100?
{jt LoAD 0500 ?
(c) What is the purpose of an index regisier ? Explain
this with fhe help of an example. How is it related to
the auto-increment mode o{ addfessing ?
(d) In the lollowing compuiations, a and b are exl€inal
inputs and z is the linal output, x and y ar€
intermediateresults.
xea.aj y<-b'b. z e - - { x+ V J , / \ x - Y )
Draw the data llou' giaph for this code.
cs-o1 P.T.O.
(b) Determine ibe number ol steps requir€d to e''?lua1e
ihe adihmetjc exp€ssion :
S = AIll@Btll + N2l , Bl2l + A{31' Bl3l +
Af4lo Bl4l
'n rhe lollowing computer sy\ip{ns
CS-01 18,000
PGDCA/ McA (r yr) / BCA
Term-End Examination
December, 2OO5
CS-02; INTBODUCTION
TO SOFTWARE
Time:2 hours MoximumMorks,6b
CPUTime
_ l 20
P^
P^ 09
P
'4 12
cs-02 P.lo.
Draw Canit charts for SJF and Round Robin
schedulingalgorithms(time quanium = 2 uniis).Also
calculate the average waiting time for both the
algorithms.
cs-02
4. (a) Wrjie down the important tasks p€rformed bV a two
pass assembler,
5. (a) What are CASE Tools ? List any sjx benefih of ii.
cs42 9,000
PGDCA / McA (l Yr) / BcA
Terrn-End Examinatlon
December,2OO5
GS-03: FILESTRUCTUREAND
PROGRAMMING IN COBOL
Tirne : 2 hours Maximum Marks , 60
(i) |\4ERGE
(it cl-osE
(ii' EXIT
cs-03 P.T.O.
(c) A Spods departrnentin a Univ€rsity siores the
informationaboutsportsp€rsonneland sportsitems.
Create the daia division for processlng this
cs,03
3. A transportcompanymaintat)s inlormation about trucks,
busesand taxiesin th€ lolloning jiles j
8 digits
8 digils
cs,03 P.T.O.
4. Wriie a program in COBOL to k€ep the record of
Joumalsin ihe folowing lormat r 10
6-20 Title
21- 30 Publishing
Agency
31-40 ]SBN
41 - 45 Y€aro{ publishing
46 - 50 Vohme
51 - 55 Price
The BrogramshouLdensurethat :
(i) Journalcodeis withinrang€10000 io 19999.
lii) PublishjogAgencashouldcontain only alphabetsand
blanks.
iiiil lssuevolurn€and price contajn only numbers.
'11,000
PGDCA/MCA0Yr)
Term-End Examination
December,20O5
cs-04 P.T.O.
Writ€ an algorithm to insert a node beforg a given
node in a linked list.
cs,04
Write an algorithm to inseir a node into a Binary
SearchTree.
cs44 12,000
PGDCA / MCA (l Yr)
Term-End Examination
December,2OO5
cs-05 P.T.O.
(b) Lisi \,?rious factors which are responsible for the
quality of a system. Also explain the dilferent )ev€ls
of qualit assurance.
cs45 16,000
I cs06I
PGDCA ,/ MCA 0 Yr)
Term-End Examination
December, 2005
CS-06: DATABASEMANAGEMENT
SYSTEM
cs 06 P,T.O
(b) Examineth€ tableshown below :
CS-06
2. (al Consider tl€ foliowing relations :
Employee(emplD, FirsiName,LastNam€,address,
DOB, sex, position, deptNo)
Deparlment (d€piNo, depiNam€,mgi, emplD)
Proj€ct {projNo, projName, deptNo)
Work on {eftplD, projNo, hours worft€d)
Write the SQL statements for the following :
(i) List th€ name and address€sof all employees
who work for the IT depadment.
(ii) List the total hours worked b9 €,ach employee,
arrainged in order of depariment number and
within department, alphabeticauy by employee
3' (a) Wbat is the need for evaluation ol a DBMS ? Lisi the
technical cliteria that are to be considered during ihe
evaluationprocess_
I P-T,O.
1 ",-ou
I
(b) Whai are the main l€attrresof the Object Oriented
Database Management Sgstem ? How is ihis
advaniageous over RDBMS ?
What is a knowledge-basesystem? With the help of
an examplefor each, explainhow ii is differ€nt from
a conventionalDBMs.
cs-06
Give queries expressed jn relaijonal algebra, iLrple
calculusand dornaincalculusfor the following | .
(i) List all students taking courses with Zeba.
(ii) List all stud€nts iaking ai least one course thai
their advisor ieaches.
(iii) List those professors who teach more than one
section oI lhe same coutse.
(b) What are tbe desjgr goals ol a good relaiional
databasedesign ? Is it always possibleto achieve
these goals ? li some oJ ihese goals ar€ not
achievable,whai alternategoals shbuld yolr aim for
ard wby ?
cs-06 18,000
ADCA / MCA (II Yr)
Term-End Examlnation
December, 2OO5
CS-07: DISCRETE
MATHEMATICS
Time: 3 hours Maximum M1*s : 75
vt t3
v? vs
cs 07 P.T.O.
(ii) ls the graph Eulerian7 Ju$tiiyyour answer.
f t 1 12. , 3 1 ,l 1 ) ,i 2 t ,{ 1 ,3 } ,1 2 ,3 ) t ,< ) .
Also check whether ihis poset is a latiic€.
Let
P i The dog barks at strangers.
cs-07
(0 Draw the graph tvith its aCjac€ncymatfix :
::i:l
Also lind the incidencematrix of the graph.
a " b = a + b - 1 .
Ch€ck whether
(iii) * is commutatve.
cs{7 P.T.O.
2. (a) Check, using truth tables, wheth€r the following
statementsare consistent:
"lf the electricitymeter is.faulty, the electriciiybills
are high."
"lf the'consumers complain about el€ctriciiy bills,
ele(triciNmetersarp faully
''lf
the electricitybills are not high, consumerswill
not complain about bills."
(b) Draw a graph with veriex sei V = lvt, vr, va. vo, vrl
and ru(h thar d(vr)= 2. d(v2)- 2. d(vJ)= 4.
diva) = 1, and dlvu) = 1. ls there a lree with given
vertex s€t v and giv€n degrees? Justifyyour answer.
CS 07
(c) t.et X = {a, b, c, d, e) and let A and B be {uzzysets
given by
[ a b 9 d " I a.,a
I o l ' 0 2 ' 0 ' 0 . 1 0' 4J
f a b c d e l
1 0 2 ' o s0' 5 ' 0 3 ' 0 2 1
Siate the DeMorgan'sIaws and ch€ck ihem for the
sets A and B.
CS-07 P.T.O.
(i) How many watched none o{ ihe 'ihree
programm€s?
cs-07
Find ihs shoriestpafh from vt to vrt in the following
graph using Dijksiras algorithm :
v 2 2 v 4
v5
cs-07 22,000
iE"' I
ADCA / MCA (Il Year)
Term-End Examination
December,20O5
( l i 1 l o 3+
t' "61
-"2tc
,t2n
cs-08 P-T-O,
Indlcatethe error in the following I
{t lF lA = B) THEN
(ii) x=srN(451
(iji) Y = ALOG(2,/3)
cs,08
(h) Find the s.d. of a seri€s X for which )X = 50,
-,,2 =
z^r ruuu ana r = Ilrl).
4X-5Y= 33
20x 9Y = 167
Fit a straight line y = a + bx by th€ method of
least squareson the poinis (2, 10), \4,20), (6,25).
cs-08 P . TO ,
(b) Compute ihe regressioncoefficienfs br* and b*r,
and the coefficient of correlation for the.following
data :
X 2 4 6 8 10
5 7 9 8 l1
0 1 0 4
10-20 6
20 30 20
30-40 10
40-50 7
50-60 3
cs 08
Boxl contains 3 white and 7 black balls and Boxz
contains one white and 9 black balls. A box is selected
at random and a ball is drawn.
cs-08 16,000
ADCA / MCA 0l Yr)
Term-End Examination
December, 2OO5
cs,09 P.T.O.
(t Answ€r the followjng questions with respect to
Internei congestioncontrol algorilhm :
(i) Explatn all the parameiers used in ihe .
algorithm.
(ii) Plot the congestionwindow as a tunction of the
iransmission number and explaio the function ol
the algorithm.
cs-09
4. ia) What do you understand by Quali\, of Service
parameters ? List any live QoS parameters of
tansport layer.
(b) Make the diagram oI TCP header and explain its
variousiields.
(c) What is congestion ? Elaborate leaky buckei
algorithm used for cong€stion control.
cs 09 P.T.O.
{b) A ne\, liftual circuit is b€ing set up in all ATM
neh4ork. Betveen the source and destination hosts
li€ thr€e ATM swjtches.How many messageswill be
sent to €stablishthe circuit ? 3
Difterentiatebetwe€nbroadcastrouting and multicast
routing. 5
(d) Answer the following qu€stjons :
(i) A Class B nelrrork on the Intemet has a suorrcr
mask ol 255.255.240 0. What is the ma){imum
number of hosts per subn€t ? 2
(ii) The proiocol field used in 1Pv4 header is not
pres€nt in the {ixed IPv6 header, Why not ? 3
cs,09 25,000
ADCA / McA 0l Yr)
Term-End Examination
December,2005
CS-10: SOFTWAREENGINEERING
cs-10 P.T.O
{b) Dilferentiaie bet'reen Processand Product. Which
one is more impo ant and why ? 5
tcl Explain at leastfive user interfacedesign principles. 5
cs,10
5. (a) Write ai least live dlt'ferences between Black Box
Testingand White Box Testing.
cs-10 23,000
ADCA / MCA (lll Yr)
T€m-End Examination
Decembet. 2OO5
C$-12 : COMPUTERARGHITECTURE
Time : 3 hours Maximum Marks : 75
Note : Question number 1 is computsory. Antwer qnv
three questiansfrom the rest.
cs-12 P . TO ,
{c) Explaln any three ieaturesol Data parallelismand
Process managementof parallel programming
languages.
csr2
A twolevel memory system has eighi virtual pirges
on a disk to be mappedinto four-pagelrames in the
main memory. Page trace is given as
1 ,0 , 2 , 2 , 7 , 7 , 6 , 7 , 0 , 7 ,2 , 0 . 3 . 4
Using the FIFO page replacementpolicy, compute
the hit ratio in ihe main memory. Show the
successivevirtual pagesr€sidingin the four frames.
(a) CPI 2
(b) MIPS rate 2
{c) Throughputrate 2
(d) Speed-up factor of K'stage pipelining over an
equivalent non'pipeljning procesor 3
PipeJjne perf omance,/cost }atio 3
(0 Efficiency and throughput of linear K-stage pipeline 3
cs-12 P . f. o .
Consider the forward Loopcarried dependence
(LCD) in the following loop :
Dol=1,N
A ( l )= A ( 1+ 1 ) + 3 . 1 4 1 5 9
Enooo
Explain why a forward LCD does not prevent
vectorizatjon of a loop.
cs-12 20,000
ADCA ,/ MCA (lll Year)
Term-End Examination
December, 2OOS
CS-13: OPERATINGSYSTEMS
c s -1 3 P.T.O.
2. (a) A file system, resident on the disk should have the
to owing characterisiicl€atures:
(i) The fite (ecords sbould be read sequ€nlially as
well as randomly.
(ij) There should be a practical lim of the file size.
(iij) The file space allocat€d, shoutd neither be
under-utilized nor over-utilized.
Explain ihe most suiiable lile space allocation
scheme keeping in mind the features above. Justify
cs-]3
4' la) What is ihe primary goal of Authentication? How
can you achievethis goal through (i) the passworo
mechanism, and {ii) artifact based mechanism 2
(b) Wlth the help of a block diagram expia;n th€
clieri/setyer diviSon of labour of file system in a
worksiaiion based model oI distribuied computing.
25,000
MCA (lll Year)
Term-End Ef,amination
December, 2OO5
CS-14: INTELLIGENT
SYSTEMS
Time : 3 hours MaximumMarks: 75
cs-14 P.T.O
(d) Expiain the 'matching proc€ss,,with the help of a
diagram. Considel ihe lollowing fragment of
associative n€twork.
csj4
tg, Wrii€ the concepts indicated by ihe following
ConceptualDep€ndency primitiveactions.
. ATMNS
. MTMNS
. PROPEL
. GRASP
. MOVE
. EXPEL
cs-14 P.T.O.
3. ia) Explain, by giving a $itable example, the use 01
property inheriianc€. Mention the data structure
most suitable for stotage oI associative network
lii) contradictory,
(iii) valid.
S . P V Q & - P V - Q & P
(b) Draw the next lev€l of the search space for the €ighi
puzzle problem starUng lrom the node. Suggest one
heurisiic function to reduc€ the search and justily
your answ€r.
1 3 5
8 4
7 6 2
spaceol this puzr€
cs14
k) Explain the role of variabl4 in complex pattern
matching. Whicb matching technique will be
appropriate, if knowledge is represent€d in the form
oI a conceptual gGph ? Justily your an$,uer.
cs,14 24,000
MCA (ll Year)
Term-End Examination
December.2OOS
CS-15: RELATIONALDATABASE
MANAGEMENTSYSTEM
Time : 3 hourc Maximum Marks : 75
cs,15 P,T-O-
(ii) Fjnd the namas ol all th€ employ€es who live in
the same cjty where the compary for which
th€y work is located.
cs-15 2
{d) Explain the terms 'rnulti-valueddependency' an
'joiD
depeDdency'wjthihe help ol an arampJe
A.)CD
B-+C
c s1 5 P.T.O.
3. (a) A relational database consisis of the {ollowing
relationsaboutstudentsin an institute :
STUDENT(ROLLNO#,STUDENT_NAME,
ADDRESS,AGE)
DEPARTMENT(DEPT_NAME,COURSE',
TEACHEB)
TIMETABLE(COURSE#,SUBJECT-NAME,
. SEMESTER,TIME, ROOM#]
. PERFORMANCE (ROLLNO#,COURSE#,GRADE)
Writea programin embedded SQL to get the names
of all tho$€studentswho havesecuredA gradein a
courseofleredby th€ ComputerScienceD€paftment
in the First s€mester.
cs-l5
5. (a) What is the purpose of ihe lntention mode iocking
schem€? Briefly explainthe variouslocksused in the
Intention locking scheme.
cs{5 25,000
ADCA / MCA 0II Yr)
Term-End Examination
December, 20O5
CS-16I OBJECTORIENTEDSYSTEMS
P.T.O
(b) Why do we use object diagrams? What are the two
types ol object diagrams? Give an exampleof each
type.
{i) AbstractClass€s
(ii) Concreie Classes
(iii) Generalization
Bank
- Branch
cs 16
(b) What do you mean by consiraints? Gve examples
for each ol the followingcases:
cs-]6 P.T.O.
5. (a) Draw an ER diagraff lor a crlcket lournament. The
ln{ormation to be depictedin the diagram includ€s
teams,mrumbersof the teams.captain,ma[ager and
coach oJ each tedr', matches of the tournament,
runs scoredby each team in each match, winnef of
each match.
Identify the entities and show relationshipsamong
them. Includeatlributeswh€revernecessary. 10
(b) Whai is meiadata ? Explain concept of meta clase
with an example.
CS'16 r6,000
MCA (IU Year)
Term-End Examination
Decenibet, 2OOs
CS-14: INTELLIGENT
SYSTEMS
Time, 3 hours MaximumMarks: 75
csl4 P.T.O.
(dJ Explain the 'matching process,,wiih the help of a
diagram. Consjd€r the foilowing fragment of
associativenetwork,
C914
(g) w'ite the concepts indicated by the lollowjng
ConceptualDependencyprimitive actions.
. ATMNS
MTRANS
PROPEL
CRASP
MOVE
EXPEL
cs-l4 P.T.O.
3. (a) Explain, by givjng a suitable exampl€, the use of
propertg inheritance. Mention the data structure
ilost suitable for storage of associative netwotk.
{iii) \.alid.
S : P V Q & - P V - Q & P
1 3 5
8 4
7 6 2
space ol this puzzle
cs-14
{c) Explain the role ol variabl€s in complex pattem
matchjng. Which matching technique will be
appropriale. il knowledgeis represenredin the for;
ol a conceptual graph ? Justil]' your answer.
cs-14 24,04O
MCA (lll Year)
Term-End Examination
December, 2OO5
CS-ls : RELATIONALDATABASE
MANAGEMENTSYSTEM
Time : 3 hourc Maximum Marks : 75
P.T.O.
(ji) Find the names of all the employees who live in
ihe same city.wher€ ih€ company lor which
they work is located.
A-+CD
B + C
F J-DE
P.T,O
3. {a) A r€laiional database consists of ihe following
relationsalroutsfudentsin an instlure :
STTJDENTRO[NO*, STUDENT-NAME,
ADDRESS,AGE)
DEPARTMENT(DEPI-NAME, COURSE#,
TEACHER)
TIMETABLE(COURSE#,SU&'ECT-NAME,
SEMESTER,TIME, ROOM#)
PERFORMANCE{ROLLNO*, COURSE#,GRADE)
Write a programiD embeddedSQL to get the nam€s
ol all lhose studentswho havesecuredA' gradein a
courseofferedby the ComputerScienceDepartment
in the First semester.
cs-i5 25,000
ADCA / MCA (lI Year)
Term-End Exarnination
December,2OO5
CS-51: OPERATTONS
RESEARCH
Time: 3 hours MoximumMarks: 7b
(iii) Feasiblercgion
(iv) Simulationprocess
(v) Degeneracy
P.T.O
(b) Consider a small plant which makes two types of
automobileparts, say A and B. lt buys casiingsthat
are machin€d, bored and polished.The capaciiy o{
machining is 25 per hour for A and 24 per hour for
B, the capacltyof boring ts 28 per hour lor A and
35 per hour for B, and the capacityof polishing js
35 per hour for A and 25 per hour lor B. Castings
fof part A cost Rs. 2 and setl for Rs. 5 each, and
those for part B cost Rs. 3 and sell for Rs. 6 each.
The three machineshave running costs of Rs. 20,
Rs. 14 and Rs. 17 50 per hour. Assume thai an9
combinationof parts A and B can be sold. Formulate
this problem as an LP rnodel to detemine the
produci mjx which maximizes profit.
Player B
Ptayer A
Bi 82 83
2 4 5
Az 1 0 7 q
A3 4 p 6
cs51
(0 The number of cheques pr@essed by a bank every
day is nolmally distrjbutedq,'th a mean ol 30,100
and sfandard de\rat:ob ol 2450. Find lhe probability
that ihe bank processesmole than 32,000 cheques
in a day-
I (a)
xt+ 2xz+ xa + xo = 10
and x1' x2' x3 > 0
cs-51 P.T.O.
Cost of RepaiB (Rs. lakh)
Road
Rl Rz ,'3
cr 9 1 4 1 9 1 5
c2 7 7 7 2 0 1 9
Conhactors
ca 9 1 8 2 1 1 8
c4 10 12 18 79
c5 10 15 2t 16
cs-51
(iii) The management is thinking of instalting a
cornputer system to handle the inlormation and
reseryations.Thi\ r. expeded to ,educe Lhe
'
service time from 5 to 3 minutes. The
additioniil cost of having the new sgstem works
oui to Bs. 50 per day. lf the cost of goodwill oi
having to wait is estimated to be 12 pajse per
mintte spent waiiing before being seived,
should the company install the computer
system ? Assume an 8-holrr working day. 8
4. la) Suppose there are n machines which can perform
two jobs. If x of ihem do the lirst job, then thev
produce goods worth g{x) = 3x, and if y of them
trerform the second job, ihen ihey produce goods
worth h(y) = 2 5y. Machines are subjeci io
deprecjatjon_So, aftet p€rforming ihe {jrst job only
a{x) - x/3 machines remain uDavailableaDd after
performing the second job b(y) = 2y/3 \nachtnes
t€main availAblein the beginningof ihe secondyear.
The process is repented with tbe r;maining
machin€s. Oblain the maximum toial leiurn after
three yearc, and aiso find the opiimal policy in each
year. 9
{b) Solve the game whose pagoff matdx is gjven below r 6
B3
30 40 -80
0 15 -20
90 20 50
cs-sr P.T.O.
5. (a) The production departmentfor a companyrequires
3600 kg of raw malerial tor matufacturing a
padicular it€m per gear.ll has been estimatedthat
the costof placingan orderis.Rs.36 and the costof
inv€ntoryca(ryingis 25 perceni o{ ih€ ir^resbnentin
fhe iflventories.The price is Bs. 10 per kg.
Delerminean orderingpolicyfor the taw material.
s.t. x1 + xz < 14
-xr+xr<6
andx1,x2 z 0.
18,000
ADCA / MCA (ll Year)
Term-End Examinatlon
December, 2OO5
(iv) LiqurdiryRatro
cs-54 P.T,O,
Balance Sheet of ABC Ltd. as on 31-12-98
Liabiliti€s Rs.
OrdinaryShares(Rs. 10 each) 1,00.000
91%PreferenceShares 50,000
8% Deb€ntures 50,000
RetajnedEarnings 20,000
Cr€ditors 45,000
2,65,000
FixedAsseis 1,80,000
Stores 25,000
Debtors 55,000
B/R 3,000.
bank 2,000
2,65,000
(bJ Wlai are th€ dilferent &pes of lnvestment
Proposals? 5
cs,54
3 . (a) What are the essential elements of a Project
Report ? Wbat arc lhe dillerent methods of
appraisal?
cs-54 P.T.O.
f Hg x F 5 6 6 6 = *
' j ^ i c . i . i
:
: < x x x x x x ; < 8
Eg L . i o o o N O ' n O Fa
. j s i j
E
; E
3 - ?-
E
3 1 6 : . y . : ' s
! r = Y 1 * E r
8 5 f E s # E d
: < x x x x x x x
4 $e8 8 R $ 8 S 8 3
c
R8
a 3 - 9 3 $ S R 9
6
O
g
' h c
g * i *
5 * ; o - u 6 X
s 5 H X 5 * . E
i t t r i r e 3 .*
; d P : 6 P d : i
= a e E q * T - e :
o N , 9 - . Y ; , t = . F
The following is the odditionalihformotionoudilable,
(i) Depreciationol Rs. 10,000 and Rs. 20,000 hav€
been charged or Plani and Land & Bujldjng
resiectivelyin 1996.
(ji) An inlerimdjudendol Rs. 20,000 hasbeenpaidin
1996.
(iii) lncomeTax oI Rs. 35,000hasbeenpaidin 1996.
cs-54 23,000
BACHELOB IN COMPUTER
APPUCATIONS
Term-End Examination
Decembeq 2OOE
CS-60: FOUNDATIONCOURSElN
MATHEMATICSIN COMPUTING
/ 1 \
r. (a) r i n dl ( 2 l l.l : l . f i - 3 5 r i r r r x=r l r l . F u n h pl ro r
cs,60 P.T.O
Reduceth€ equaiion
Izt3 -sl
L.--- , x*:tJ
(x)= j x" -e
I g ,x=r3'
If q, 9,T ar€ the roots of th€ equation
*3 + 6*2 + 6x + 8 = 0, find the equation whose
roots are (& + F), (p + y), (y + d).
"=-ua2.
cs,60
3. (a) Find the length of ihe major and minor axes, the
eccentricity,co-ordinatesof the verticesand foci of
2x2+3y2=12
a. (a) | { x- 1 ) d x
J (x+1)Jx+2
cs-60 P.T.O.
5. (a) Skeich the surfacedefinedby
-2 .,2 _2
1 6 - t - 9 = '
Name the curveslormed by inters€ctingih's surtace
with
(i) y=3
(ii) x = 4.
cs-60 16,000
BACHELOR TN COIVIP(.rIER
APPUCATIONS
Term-End Examination
December,20O5
CS-601: DIFFERENTIAL
ANO INTEGRAL
CALCULUSWITH APPLICATIONS
cs601 P.T.O
{jv) Th€ domain of the lunction l, given by
t(x) =
f r i-'-- lo-
FindU(P, 0 and L(P, I), where f(x)= xlxl and
p =J ,! ! i ')
l' 4 2 4 "l
. v5x-,/a+zx
x+a 2Jx -.13a + x
J
[ (*'- u a*
-l
by applying
(i) Simpson'sRule
(ii) Trapezoidal
Ruie.
Which of these approximations
is nearer to the
actual !,?lue?
cs601
(0 Find ihe surJace area o{ the solid generated by
revolvingth€ arc of the parabola,x2 = 4ay bounded
by its latus rectum about ihe axis ol y.
= xz-3x+4
" 7.:r;i
(b) A point movesin a line so that its distances from a
fixed point at any time t is proportionalto tn. If v be
the velocity and a be ihe acceleration at any urne r,
show that (n - 1) v2 = nas. 4
Evaluate : 5
I x-1
J (x+1)Jx+2
\x2 + 4)
t*l = n2 1y2* 41.
i cssol P,T.O
(b) Show ihat
^12
f -
I cos"'0sinn0 d0
nl2
= r- - "' 'o
I cos' sin(n - ll0 do
rt+n m.n J
0
nl2
Lreducethe value ot I cos_0 sin 3e d0.
J
0
a ,
ls + (f-'(xJl = ll'(xll-r for anv derit"ble and
dx
invertiblefunction f ? Give reasonsfor your answer.
cs,60l
5. (a) Find ihe maxima and minima ol the funciion
f{x) = 5in * 11 * .^ *,
for all values of x in I 0, ,r {.
Show thai
I
I x(1- r)"dx
J {n+r)(n+z)
D
cs-601 1.000
BACHELOB IN COMPUTER
APPUCATIONS
Term-End Examination
December, 2005
GS-610; FOUI,IDATION
COURSElN
ENGLISHFORCOMPUTING
c$610 P.T.O.
The i renlion of the electric motor and the inietnal
combustionenginein the nineteenthcenturychangedthis
odentation completeiy. Firstly, these machines were a
startling boost to productivity.They enabledman to do
far more work and to cultivate and halest gr€ater
acrcage.Secondly,machinesreplaceddraft animals,with
the r€$lt that modem. agricultural opemtions became
dependenton petroleum and electricity. An absenceof
either one would be disastrousto pr€5entfood production
throughout much of th€ wor)d-
cs-610
{iii) Whai huo basjc forms ol energy were sulficient to
support lile in early agncultural societies ?
(iv) What caused a change lrom the older syst€m in the
nin€teenth century ? Discuss briefly.
cs,610 P.T.O.
(b) Complete the given sentencewith a suitable tag
cs{10
5. Read the passag€and summarizeit io one-third of iis
length. 10
cs-610 P,T.O.
After two genemtions ot compulsory schooling,
which has at least taught e\,€ryone to r€ad, the businesso{
forcing circulaiionsup above ihe million ma* has not
been diflicult onc€ the method was discovered. The lagt
Lord Northcliffe showed the way with ihe Doily Mail in
the nineties. He saw that ther€ was a vast body ol people
who wer€ not attracted by the newspaper that catered Jor
ihe professionalman and the club member, but who
would be eager to buy a Joulnal that would deal in an
interesting and arresting fashion with the things ihai were
reah a part oJ thpir ltu€s. He realized that unparalleied
succ€s9awaited the ne$sFape. that wouLd reduce politics
to a minimum, provide chatq articleson sport, hobbies,
and everyday interests, substitute literary and theatrical
gossjp tor serious criticism of books and ih€ stag€, and,
above all, appeal to the special interests ol women. Once
thi$ new policy had been put into practic€, its commercial
value was obvious enough. The other papers we/e bound
to follow the lead ol the Daily Mail sooner or later. The
process was hastened by the influence of American
jo\fnalistic rnethods. Sirce the War the iransformation ot
penny joumals has proceeded with sudden acceleration. ln
reaching out to an ever-wider public belonging to the
lower cultural lev€ls, mosi of them have rapid9 dropped in
int€llectual and literary quality until now they scarcely
pretend to appeal to people of intelllgence. They provide
news and views, not for their own sake, but as a means o{
purveing a daily dose of entertainment that will save
readers the trouble of tuming to books.
cs-610
6. Write a composition in about 300 words on any one ol
the following topics r
(i) The negativeimpact of technology
(ii) Noise Pollution
cs-610 8,000
BACHELORIN COMPUTER
APPUCATIONS
Term-End Examination
December,2OO5
cs-611 P.T.O
(d) Write one feature and ole use of each ol the
Iolowing in MS-WQRD ,
(i) TemplateWjzards
(ii) Macros
(iii) Tab stops
cs-61l
5. {a) Wite one use each ol the followjng wjth refererce
io WNDOWS O/S ,
11,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December, 2005
C$-612 : PC SOFTWARESKILLS
c s6 1 2 P.T.O.
(e) What is a Domain Name System(DNS) ? What are
the bases oi class'licationsol DNS ? Explain with
i\ro exampleseach.
cs-612
l
5. (a) Explain the steps involvedin displaying,editing and
dejetjnga ScenarioManager.
(b) What is e-mail ? Explain three common points
betweene mail and postalmail services.
(c) Prove ihat the sum of the squares of the first n
. l2n)(2+
n 1 ) ( 2 n +2 )
Inreg?rsrs - .
3
Prove that the sum of two odd numbers is odd. 2
c s6 1 2 11,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December,2OO5
cs-62 P.T.O.
2. (a) A 3-dimensionalintegerarrayX l4l I5l I3l is stored
using lhe columnmajor order. Wha: \tjl) the
addressof X l2l i3) I1J be it the base addressls
100 ? Also, calculatethe addressif the array ls
stored using row major order.
{ii) Digraphs
a b + c . d e l t ' - g h . +
cs-62
4. (a) Consid€r the lollowing glaph ,
cs-62 15,000
BACHELOB IN COMPUTER
APPUCATIONS
Term-End Examination
December,20O5
CS-63: INTRODUGTION
TO SYSTEM
SOFTWARE
cs-63 P.T.O.
(d) Write the UNIX commands for the following :
(i) display ttp tyw and nature of inlorrr,ati.tn
that is h€ld in a directory.
(ii) To remove a dir€ctory
(iii) To print last 5 lines of a text file.
(iv) To sort the files tn alphabetical order of a
r 5,000
BACHELOR IN COMPUTEB
APPUCATIONS
Term-End Examination
December.20O5
TO COMPUTER
CS64 : INTRODUCTION
ORGANISATION
cs 64 P.T.O,
(dJ Wriie an ingtruction sequenc€ lor evaluating
A + B x C + D / E x F using zero adclress
instluctionsand one addressinstructions.
cs-64
The 8 bit registersAR, BR, CR and DR, initially
ha\,€the followingvalues:
AR = 10110110
B R- - 1 0 0 1 0 1 0 1
cR = l00r0r
DR= 00111010
Determine the 8 bii values in each register after the
e\ecution of the tolowing sequence ol micro
lj) AR FAB ^ BR
(ir) BR - CR a DR
(iiii DR <__DR _ cR
liv) cB e AR y DR
where'A denotesAND and'O'denotesXOR.
cs,64 P . TO .
5. ia) DAfineaccesstime and cycleiime. ls cycletime equal
to accesstime ? Giv€ r€aso.,sfor your ansMrer. 4
(b) Drawa circuitdiagramof an B x 8 RAM. 3
, - 1 ^ . _ .
How doPs t
Frplain the 2:-D chid organi'iat'on.
cs€4 14,000
BACHELOR IN COMPUTER
APPLICATIONS
Term-End Eiamination
Decernber, 20O5
CS.66 ; MULTIMEDIA
Time : 2 hours Maxinlum Marks : 75
cs,66 P.T.O.
(d) What is hypertext ? Explain any two application
areasof hypertext.
Ust and explain hro input and two output devices for
multimedia systems.
cs'66 10,000
BACHELOB IN COMPUTER
APPUCATIONS
Term-End Examination
Decernber.2OO5
NETWORKS
GS-68: COMPUTER
Time: 3 hours MoximumMatks, 75
cs 68 P.T.O.
Th€ maximum payload of TCP s€gmeni is 65,515
bfies. Why ?
ib) Channelcapacity
(c) Muliiplexing
(d) Quality of Semice {eoS)
(e) Fuli-DurplexTransmisston
(iijl What is th€ basic purpose of MAC layer protocol ?
Explain the function of foliowing MAC layer
(a) Efhemet
(b) Token bus
cs 68
(ii) Answer rhe iollowing :
(a) Explain ISDN BRI Seruices.
(b) Differentiate betr..veenbroadband and baseband
services.
(c) Describe the following three fieids of TCp
neaoer :
(l) Sequ€ncenumber
(ll) Data offset
(lll) Urgent pointer
{it How does ATM d)Iter lrom frame rchg ? List and
brieflg detine the ATM sovice classes.
cs-68 12,000
BACHELOR IN COMPUTER
APPLTCATIONS
Term-End Examination
December,2OOS
CS-69: TCP/IPPROGMMMING
cs-6s P.T,O
k) How many address biis does the latett version of IP
(lPv6) have ? What i6 the maximum number of IP
addressespossiblewith lPv6 ?
Identifg the header of each flag and explain its
meaning :
(i) URG
{it AcK
(iit FrN
lM RST
lg, How is flow control managed by Sliding Window
protocol ?
{i\J) \^,\rw.igno\r.nic.in
(b) How is the donrain name rnapped with IP address ?
U9e diagram to explain the process.
4. (a) How many bits are \rsed to represent th€ netid and
hortjd pari ol an IP address jn Class A. B and C
neh.vorls ? 6
(b) What is multicast addless and why is it used ? .3
(c) Explain IP Routing and how it rak?s place. 6
cs-69 11,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December, 2005
CS-70: INTRODUCTION
TO SOFTWARE
ENGINEERING
Time : 3 hours Maxinun l\tarks : 75
cs-70 P T.O
2. (a) Considerthe followingteam structure.
A s€nior programm€rand some junior programmers
form a team that is called a Chief Programmer
team. Compate the communication paths in this
sttuciure with .controlled decentralized structure.
What are the advantages and disadvantages of this
structure ? Under what conditionswill 9ou suggest
that this structureb€ used ?
4. (a) How are MIS and DSS related? How do they diff€r
from each other ?
cs,70
5. (a) Siate at leastten principlesof Sotixare Engineedng.
cs-70 13,000
BACHELOR IN COMPUTER
APPLICATIONS
Term-End Examinatlon
December,2OO5
CS-71: COMPUTERORIENTED
NUMERICALTECHNIOUES
cs-71 P.T.O.
(d) Show, by ihe divided ditfer€nce table that a
polynomial o, degre€ three may be made to pass
throughthe points (0, 1) (1, 1), (3, 25), (4, 61) and
(6,211). You do not need to find the actual
2 3 4
cs71
T
(b) From the following data, compute l(51 and f(9) using
Nev,ton'sforwardand backwarddifferenceformulae,
respeciively :
4 6 8 t0
(x) L9 40 142
2 4 6
s(u I6 12 16
UsingNev,ton'storwardfo@ula find the time when
(i) + =0,and
a2^
(ii) -=0.
ot-
3 x 1+ x 2 + 5 \ = 20
2x\+5x2+2x3-18
P.T.O.
(b) Find, by the bisectionm€1hod,th€ interualof length
0;125 jn which the least positive root of th€
equationx3 - 4x - 9 = o lies.
^ 2 -
Eraluate (x').
f
\+2x2+10\=61
10xr+x2+2\=44
cs-71
I
Find the condtion numb€r of
(il ft=*
(i0 {xj = I
F
Furth€r, are these lunctions ill-conditioned ? Give
reasonsfor your answer.
cs-71 9,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December,2OO5
CS-72: C.}} AND OBJECTORIENTED
PROGRAMMING
cs-72 P.T.O.
Classderived: public base
I
int j;
public :
void set-j(int num) lj=rum;)
int get_j( ) {reiurn jj}
void main( )
I
base 'bp;
deri\€d di
bp = &d;
bp + set i(10)! (i)
bp -.t set_j120); (it
cout<< bp -+ get i( )j
cout<< bp + get j( ); (iv)
I
What is inheriiance ? What are its advaniages ?
Explain any t\ro types of inheritance with the h€lp of
an exemplardiagram,
(d) What is UML ? What are the benefits of UML for
system designeN ? List four types ol UML diagrams-
cs-12
2. Designand impl€menta class'string' using an array, with
a maiimum sizeoI 20 charirctets.The classshouldcontain
the necessary constructors, destrucior, ov€rloaded
assignment operator and a friend function for
concatenationof trro shings.Make sLritable assumptionsjf
required.Also i!,rite main() for the abo!€. 10
cs 72 14,000
I csisl
i BACHELOR IN COMPUTER
I APPUCATIONS
Term-End Examination
i
Decembet,2OOS
cs-73 P T.O.
(e) Considerthe followingproductions
i
5 + aBlbA
A -.> aS/bAA/a
B -> bS/aBB/b
For the string aabbbaabba,f'nd
(i) the left mostderivation
(ii) Parsetree
cs-73
(b) Pro@ ihat, if f(x) = 8x3 + 5x2 + 7, tben
)
(i) I(x) = a{x), and
(ii) J{x) = o(xz)
15,000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
December,2OO5
CS-74: INTRODUCTION
TO INTERNET
PROGRAMMING
Time : 3 hours MoximumMarks: 75
cs 74 P.T.O.
(e) Write a progEm in Java ihaf asks the user to
choose "cir;le" or "reciangle". On chooging
"circle" she has to enter its radius. If "rectangle"
is chosen, she is prompted to jnput the lengths ol
its sides.
cs 74
4. (a) Consid€rihe following classdefinition :
publjc ciassExcelleniextendsGood
I public Excellent(int i)
I
J
public (int i, int j)
Excellent
I super(i. k)i
l
l
In how many n?ys can the instancesof Excellent
clas! be created ? Write the corresponding
cs-74 14,000
BACHELOR IN COMPUTER
APPLICATIONS
Term-End Examination
December,2O05
CS-75: INTRANETADMINISTRATION
cs-75 P.T.O.
(d) Which of the following sel1licesshould be enabled
in a secure workstation connected in an Ethernet
LAN ? Give reasonslor your answer.
Anacron,ftp, neds, nfs, telnet,sendmail,SSH, syslog,
SNMP, time- (Assumethe LAN is connectedio ihe
Internet but is not connected via Firewall nor is
Kerberosused).
cs-75 14.000
BACHELOR IN COMPUTER
APPUCATIONS
Term-End Examination
Decembet. 2QO5
cc-09: INTERNETAWARENESS
fime : 2 hours MaximumMarks, 75
cc-09 P.T,O
2. (a) Write an applicationfor eachof the following :
(i) Majl Retlectors
(ii) MailingLists
(iiil List Servers
Fi-ri) Save as . .
cc{9
State th€ lunction of each of the following Internet
Tools ih at tlle most two seniencesi
(i) Messenger
(ii) FTP
{iit Shopping
cc-09 2,000
BACHELOR TN COMPUTER
APPUCATIONS
Term-End Examination
December.2OO5
Moximum Morks : 75
Note : Questton number 1 is cofipulsory. Attempt any
thtee questionsfrcm the rcst.
l. la) Ljst and explain lhe tive \rindows that are displayed
by VjsualBasic when ii gets siarted. 10
o) Wrjt€ an event procedur€ that accepts iwlJ strings m
and n as inpuf. The procedure should print whether
m is a substring of n 6r not. Don t use any library
lunction tor finding wheiher one strjng js substring of
other. 10
What is a Control Array ? Explain the two ways o{
creating the Control Array.
Note I Wriie all the steps im'olved in both the ways. I0
cc-11 P . TO ,
(c) Explain the lollowing terms used in Ol,E : 6
(i) Source Application
{ii) Linked object
(iii) ContainerApplication
cc11 1,000
BACHELOR IN COMPUTER
APPIJCATIONS
Term-End Examination
December, 2OO5
TO C++
CG-16: INTRODUCTION
P.T.O.
(b) Explain th€ use of "?' op€rator in C++ programs,
with an example.
(c) Explain at least one advantageof a virtual function,
with ihe help oI an example.
(d) Does C++ support modular programming ? Justify
CC-16 2,000