Attribution Non-Commercial (BY-NC)

Als PDF, TXT **herunterladen** oder online auf Scribd lesen

1,2K Aufrufe

Attribution Non-Commercial (BY-NC)

Als PDF, TXT **herunterladen** oder online auf Scribd lesen

- 2 - 4 - Quick-Union Improvements (1302)
- Data Structures Algorithms Tutorial
- Manual AutoCAD Plant 3D
- 20070918213950312
- Sentence Compression as ILP problem
- Implementing Data Structures Binary Trees and Hash Tables
- MCAREVISEDSYLLABUSF09
- Java Record
- Classification and Regression Trees
- avl
- Detailed Syllabus Ec 2013-14-9may2013
- Multiobjective evolutionary algorithm with a discrete differential mutation operator developed for service restoration in distribution systems 1-s2.0-S0142061514002798-main
- SAS_E-Miner2000 (2)
- finalexamap2-2012sample
- Trees Notes
- How to prepare for an interview at Google.
- Lecture-10 Regression Tree
- Chap 7 Trees
- Binary Tree
- Data Structure Lec11 Handout

Sie sind auf Seite 1von 134

Term-End Examination

June, 2006

FUNDAMENTALS

CS-O1: COMPUTER

three questionsfrom the rest.

map in product-of-sumform.

Also, draw the logic circuit for the simplified

exnression.

need of an array processorin the execution of a

vector instruciion. 5

multiplexers and a decoder. Make assumptions,it

I t t t - -

required.

cs-01 P.T.O.

(d) What is cache coherence? Why is it important for

shared-memorymulti-processorsystems?

.''..,:,:;..,'.-..'..:;:].,.

('e) Write an 8086 adsemblylaflguage program to find

the total number of occurrencesof the characters

"a" and "t" in an array of charactersstored in the

memory.

the following types :

(i) Conversion

(ii) Input-output

(iii) Transferof control

(iv) Arithmetic

architecturemachine :

using an evaluation-stack

A x . B/ D + E x F - G

Assume that the machine contains instructionsfor

PUSH, POP, ADD, SUBTRACT, MULTIPLY

and DIVIDE

decoders.

memory ? Explain this with the help of a diagram. 4

cs-01

3. Give at least three differences between each of the

following : 75

(ii) Horizontal microinstruction vs' Vertical

microinstruction.

(ii| Access methods of secondary storage vs' Access

methodsof main memory.

vs' Tighily coupled

(iv) Loosely coupledmicroprocessors

microprocessors.

(v) Flashmemoriesvs. PROMs.

:

having the following characteristics

* The baseof the number is 2'

o The mantissacan representat least 5 decimal

digits correctlY.

* 50'

The exponentrange is 10i

Make suitableassumptions,if required' 5

addstwo two-digitunpackedBCD numbers' 5

of these

least two advantagesand two disadvantages

machines. 5

microprocessors,with the help of an example for

each.

cs-01 P.T.O.

(b) What are thabasiccharacteristics

of RISC ?'Explain

briefly the reasonsthat make RISC based designs

more popular.

(c) An 8-bit register contains the binarv value

11001011. Perform the followingopnrufion, on

this :

(i) Mask the upper nibbleof the register.(A nibble

is a 4-bit sequence.)

(ii) Insert a value 1101 at the upper nibble.

(iii) Perform circularshift right.

(iv) Perform arithmeticshift left.

(v) Perform logical shift right.

Make assumptions,if required.

cs-01 4 12,000

PGDCA / MCA (I Yr) / BCA

Term-End Examination

June, 2006

CS-02 : INTRODUCTION

TO SOFTWARE

three questionsfrom the rest.

the factorialof a given number.

(b) What is a process ? Explain the various process

states with the help of a state diagram. Why is a

PCB required, and what is the information that a

PCB contains?

(c) Write a shell program to convert an integer to its

binary equivalent.

(d) How is a client-servermodel different from the

stand-alonemodel ? Explain this with the help of a

suitableexampleof each.

(e) Explain the various phasesof systemsinvestigation,

with the help of a suitableexample.

cs-02 P.T.O.

2. (a) Constructcontext free grammarfor the following 'C'

statements:

(i) Do..While

(ii) incrementoperator

an example of each, explain the Gantt chart and the

PERT chart schedulingtechniques.

managementin a UNIX operatingsystem. 5

below : 5

Process CPU time Priority

P 1 1 0 3

P 2 6 5

P 3 b z

P 4 4 1

P 5 8 4

tumaroundand waitingtime for eachprocessfor the

following schedulingalgorithms :

' (i) Shortest Job First

(ii) Round Robin (quantum2)

cs-02

4. (a) What are the main advantagesof distributedOS ?

How are the file systemand protectionsupportedin

distributedOS ?

(i) To print how many usersare working on the

system.

(ii) To run a processin the background.

(iii) To print the file namesand their file sizesin the

current directory.

(iv) To print a long listingof the directory.

(v) To print content of the "passwd" file.

development of a software product. Also mention

the limitationsof the developmentcycle.

the steps performedin demandpaging.

c s -0 2 4,000

PGDCA / MCA (I Yr) / BcA

Term-End Examination

June, ?OOG

IN C OB OL

P R OGR A MMIN G

three ouestionsfrom the rest.

to compute the total marks, averageand the grade

as per the following record format :

7-6 RollNo.

7 - 30 Name of the student

31 - 33 Marksin English

34 - 36 Marksin Mathematics

37 - 39 Marksin Physics

40 - 42 Marks in Chemistry

43 - 45 Marksin ComputerScience

46 - 48 Total marks

49 -57 Average

52 - 57 Grade

cs-03 P.T.O.

If a student scores less than 40 in any subject, then print

FAIL as the grade. Otherwise print the grade as per the

following conditions : 10

Average Grade

50<marks<60 A

40<marks<50 B

exampleof each i .

(i) DIVIDE

(iD USAGE clause

(iii) REDEFTNES

applicationfor a grocerystore. 10

Note : Make suitable assumptions,if needed and

mention them.

clause.Wrjte the format. Also, list some important

precautions to keep in mind while using the

RENAMES clause.

which performs the basic arithmetic operations like

addition,subtraction,multiplication,and division. 10

cs-03

3 . Write a COBOL program that converts a given date

(specifiedas the valuesof DAY and MONTH) to the Julian

date and storesit in the data name Julian.Assume28 davs

in the Februarymonth. 70

Note z The valueof DAY is the date of the month and

'

the value of MONTH is a valuebetween1 and

72. A Julian date is a 3-digit date representing

the number of days counted from the first of

January.

amount to be paid to a nationalized bank every month

taking the {ollowingpoints into consideration: 10

(i) Flat 60/ointerest if the loan amount is to be cleared

within one year.

(ii) Flat 7.2o/ointerestif the loan amount is to be cleared

within 18 months.

(iii) Flat 72o/ointerestif the loan amount is to be cleared

within 36 months.

COBOL statements,/clauses,

with the help of an example

for each ' 10

(i) REWRTTE

( i i ) T N S P E C T. . . . T A L L Y T N G

(iii) STRING

(iv) SET

(v) GO TO

cs-03 6,000

PGDCA / MCA (I Yr)

Term-End Examination

June, 2006

,,C '' & ,,P A S C A L "

three questions from the rest. All algorithms

should be written nearer to C or PASCAL

Ianguage.

order, i.e., 1 comes first, then 2, and so on. Which

of the following rearrangementscan be obtained in

the output order ? For those that can, explain how,

giving the sequenceof operations.For those outputs

that cannot be so obtained,explain why, 6

( i )r 2 4 5 3

( i 02 r 4 3 5

( i i i ) 2 7 5 3 4

( i v 3) 1 2 4 5

cs-04 P.T.O.

(b) What is a circular queue ? Explain how it is

implemented,using an array.

Write functions to "insert" and "delete" for the

queueabove.

(c) Construct the binary tree whose Pre-order traversal

is ABCDEFGH and In-order traversal is

CBDAFEGH, where each letter stands for the

information stored in some node of the tree. Show

all the steps involved.

(d) Write an algorithm to implement "insertion sort".

Explain how the algorithmworks in sorting the input

l i s t2 6 4 9 8 5 . I

(e) Distinguishbetweena graph and a tree. 2

to read the powers and co-efficientsof different

terms of a polynomialand createthe linkedlist.

(b) (i) What is a Binary SearchTree ?

(ii) Write an algorithm to create a Binary Search

. Tree from an input list of integers.

(ii) Explain how linked lists can be used to store

polynomialsof arbitrary degree.

(b) Explain, with an example, the usefulness of

height-balancingwhile constructing a Binary Search

Tree. 2

cs-04

(c) Constructan AVL tree from the following input list :

6 4 2 12 10 3, applyingappropriaterotation.

"External path length" for a binary tree.

(ii) Prove that for any binary tree of n nodes the

Externalpath length: Internalpath length + 2n.

(b) What is a heap ? Write an algorithm for insertinga

new elementinto a heap.

working ?

(b) Explain what an indexedsequentialfile organisation

is. Also give two advantageseach of sequentialand

indexedsequentialfile organisations.

(c) What is meant by "Depth First Search" of a graph ?

Considerthe followinggraph :

traversethe graph startingat node 1.

cs-04 7.000

PGDCA / MCA (I Yr)

Term-End Examination

June, 2OOG

" ANALYSIS& DESIGN

questionsfrom the rest.

use of a data dictionary. 3

(b) Explain the use of requirementanalysisin system

design. Make an SRS document for "School

ManagementSystem". 6

(c) Briefly describe five types of documentation

techniques. 5

(d) Briefly explain five componentsof muliimedia. 5

(e) What is an MIS ? Give four features of a typical

MIS. Explain the steps followedin the development

of an MIS. 8

(f) Why is it essentialto use systemsanalysisand design

methodologies to build a system ? Give three

reasoRs. 3

cs-05 P.T.O.

2. (a) Design a EFD for a Banking Management System,

' '' l

uPto'level2-'-

rnaintainedin a system. 6

(i) Peak load testing

(ii) Storagetesting

(iii) Recoverytesting

are the techniques used to review these requests ?

Explain with an example. 7

purpose.

Also give {our characteristicsand two examples of

forms.

be consideredas comnutercrimes. 3

testing. What is the use of procedure testing ? 4

cs-05

(a) Describe the structure of a feasibilityrepori' 3

5.

(b) List six considerationson which output to be

producedusuallYdePends. 3

' 3

example.

(d) What is the role played by user interface of the

software in systemdevelopment? Also explain four

steps of GUI develoPment. 6

cs-05 15,000

PGDCA / MCA (I Yr)

Term-End Examination

June, 2006

CS-O6 : DATABASEMANAGEMENT

SYSTEM

T i m e: 3 h o u r s Maximum Mqrks: 75

three questions from the rest.

hierarchical database model.

organisation ? With the help of an example explain

the structure of index sequential file'

of DDE mainiained at application level ?

centres. Clearly indicate the entities, attributes,

relationships and the key constraints.

(e) With the help of two examples for each, explain the

use of multimedia databases and knowledge

databases.

CS-06 P.T.O.

2. (a) Consider an employee file with the details given

below : -

A 80cMilind Prog. M.E. M Delhi 10,00c

B 5 1 0 {dwet Analyst B.E. M Mumbai 15,00c

c 200 Darronrl

Analyst B . E . M Delhi 72,OOC

D , 300 Vlukesh Prog. M.E. M Chennai 9,000

employeeIile.

(ii) Write a query to retrievethe record of

Salary> 12,000, Degree= M.E.,

Location = Delhi, Occupation= Analyst,

Sex = M.

(b) What are the main featuresof client-servermodel ?

Explain the stagesinvolvedin the developrnentof an

applicationusing this model.

required? What are the variousfunctionsassociated

with databaseadministration?

(b) Define a data manipulationlanguage.Write a.syntax

for the following'andgive an examplefor each : 70

(i) Selectstatement

(ii) Update statement

. (iii) Delete statement

(iv) Insert statement

cs-06

4. (a) With the help of an example relation and the

dependency diagram, explain ihe concept of

functional dependency.

client-server environment :

for each.

customer-city)

customer-name, balance)

customer-name, amount)

Rs. 1000.

(ii) Write the query to find the clients of banker

Patel, and the city they live in.

(iii) Write a statementto find all the customerswho

have a loan amountof more than Rs. 1200'

CS-06 P.T.O.

(iv) Write a statement to find all the customers

whose name starts with "R" and who have a

balanceof more than Rs. 10,000.

(b) With the help of an example,explainthe properties

of a Balancedsort tree.

CS-06 20.000

ADCA / NICA (II Yr)

Term-End Examination

June, 2006

CS-07 : DISCRETE

MATHEMATTCS

Time : 3 hours t ,

IvrcXImUmlVarKS: /5

three questions t'rom the rest.

formula :

l ( ( P^ l e ) v ( p n e ) ) v l p

adjacencymatrix :

CS-07 P.T.O.

(c) Let A = l\, 2, 3,4, 5). A ielation R is definedon A

suchthaa t R b i f fa + b < 6 .

(i) Write the relation matrix R.

(ii) Make a digraph of the relation.

(iii) Check if R is reflexive.

(iv) Check if R is symmetric.

and draw the correspondingmultigraph.

(e) Establish the following equivalence,using a truth

table :

P+QvR=(P=Q) v(P+R)

Does it represent a lattice ? Give reasons for your

answer.

network (write the output of each gate).

xl x2 x3 x4

cs-07

(h) For the FuzzySetA of X :{7,2,3, 4, 5l givenby

' 2'i' f i n dt h eu - c uotfA

t t n ' TJ'

for each s e { 0.1, 0'3, 0.7}.

graph using Kruskal's algorithm :

(ii) ExpressP n Q using ,t only

(c) Let g : R * R, where R is the set of real numbers,

be definedby g(x) = x2 + 2. Check if g is

(i) one-one

(ii) onto

or not :

(i) ( P + Q ) = [ P v ( Q n n 1< + e ^ p v R ) ]

(ii) (PvQ)+(Q=p)

CS.O7 P.T.O.

(b) In a single Venn diagram, show three sets A, B, C

andB\C, AnC, AU(Bc).

of the following argument.At each stage, mention

the rule you are applying

lf you send me sn e-mail message,then I will

finish writing the program. If you do not send me

sn e-mail message,then I will go to sleep early'

If I sleep early, then I wilt wqke up t'eeling

ret'reshed. Therefore, il I wqke up feeling

refreshed, then I haue t'inished writing the

progrqm.

(d) Let R be a relation from the set A to A, where

A : {1, 2, 3, 41and a R b ilf a > b.

Find (i) R2, (ii) F, (iii) R-1.

graph, using Dijkstra's algorithm. Show all the

intermediatesteps.

f (w, x, y, z) : > (0, 4, 6, 7, 8, 70, 1'2, 74)

(c) ExpressI (=x flx)) using universalquantifiers'Justify

your answer.

cs-07

5. (a) Construct a weighted connected graph on five

vertices that has exactly five minimum spanning

trees. Justifyyour answer.

(b) Expressthe number-87 using (i) 1's complement

form, (ii)two's complementform, (iii)sign magnitude

representation.Use 8-bit representation.

(c) Draw the logic diagram of HA (Half Adder) anci

using HA constructFA (FullAdder). 5

(d) Define Well Formed Formula(WFF). 3

c s -0 7 15,000

ADCA / MCA (II Year)

Term-End Examination

Jurie, 2006

C OMP U T IN G

questionslrom the rest. Use of calculators is not

qllowed.

following : 3

,in *

\'' ' "*2

J2""

(ii) , =

/1 +* r)'*

r ) + l,r- 3)'

[o ['- bJ

lt-;"-e)

cs-08 P.T.O.

(b) Which of the following are acceptablenames of

integer variables, real variables and unacceptable

names and why ?-

(i) 457.5

(ii) SUMMER

(iiil rNDrA

(iv) .ABC2

statements,and correct them.

(i) Y/6.35 : Q

(iii)Y:(-6.32)5'0+X

equivalentresistanceR for given 100 sets of values,

where you enter R, and R, from the key board.The

resistancesR, and R, are connectedin paralleland

the formula for the equivalentresistanceis given

below :

1 1 1

R R 1 R 2

cs-08

(eJ An air foil is to be plotted with a "camber". The

mean line of the foil js given by :

y=+ e p x - x z ) f o rx < p

p-

v=: o ( 1+ 2 p x - 2 p - * 2 ) forx>p

I-p-

x and p each, and which computesand prints the

valuesof y.

independently.If the probability that Doctor X is

availableis 0.9 and that Dr. Y is availableis 0.8,

then find the probabilitythat at least one of them is

availablewhen needed.

X 2 4 5 6 8 11

v 1B 72 10 8

.1 (

different numbers. The calculated mean is

72'14. But, while calculating,by mistake he

took the number 91., 75 and 82 insteadof the

correctedvalue of \9, 57 and 28 respectively.

The correct mean of twentv numbers is

CS-08 P.T.O.

(ii) If two regressioncoefficientsare, --.- 0'1 and

- O'9, the valueof r is

frequently is known as -

(iv) The probabilitiesof occurringof two eventsE,

F are 0'25 and 0'5, respectively,and of both

occurring simultaneouslyis 0'14. Then the

probability of the occurrenceof neither event is

equal to

elements each. Write a computer program to

compute and print the quantities

25

A = / t- t (c+d)

l I'

i.- 1

25

B=> (c -di)z

. i=1

25

P= I c,d,

i=1

f(x) : c.x + .rfi fot the followingdata : 6

X 1 A 16 25

f(x) I6 14 72 10

cs-08

(c) Writea programsegment to readformattedvaluesof

A and B from a file, and to compute

S=AB

T = A + B

ST

- x - = _

S+T

Also write the formattedvaluesof S, T and X into

a file.

program to find whether it is an isoscelestriangle. 4

the given data : 6

x 1 3 4 6 8 9 11 74

v 1 2 4 4 5 8 9

(c) The ratio of relativisticto classicalmomentum as a

function of the speedof light is given by the formula

ratio = J==

It-(

Write a program that will compute and print a table

of the ratio for

f = 0 1 9 1t o 0 . 9 9 i n s t e p so f 0 . 0 1 .

cs-08 P.T.O.

4. (a) The ideal compressor outlet temperature and

efficiencyfor a gas turbine are given by

rp r*

r =ro , and

tfl

r o,)t;

e f f i c i e n (ceY)= 1 - ltl

\ ' 2/

pressure,Prthe outlet pressure,and y, the ratio of

specificheats.

T o = 4 5 0 , P , = 1 0 , P z = 5 5 , a n dY = 1 ' 5 . 5

mean, standarddeviationand coefficientof variation' 5

No. of persons 10 35 40 15

n!

c(n, k) =

k(n_k)l

Write a subroutineto calculatethe factorial and call

it in the main program.

cs-08

5. (a) Identify errors, if any, in the following FORTRAN

statements:

(i) Do8. I=1,3

(ii) Do 33 L = M, N(3),I

(iii) GIDAN = XYL + -N(3.2)

(iv) DO 44 K : 1. M+2, N

(v) C(1e) : B(- 4) + F13

respectively,0.4,0.5, and 0.1 of the total

production. The percentage of defective items

produced by I, II, and III is 2o/0, 4o/o and lo/o

respectively.For an item chosenat random, what is

the probabilitythat it is defective?

fnl

An enquiry into the budget of the middle class

familiesin a certaincity of India gave the following

information :

Expenses

(in Rs.) (in Rs.)

Food 40o/o 140 165

Fuel 10% 20 23

Clothing 20% 60 70

Rent 20o/o DU BO

Miscellaneous

1070 30 55

taking 1998 as the basevear.

CS-08 P.T.O.

Assume that your stock of sales merchandise is

maintained based on the forecast demand' If the

distributor'ssalespersonnelcall on the first day of

each month, compute your forecastsales from the

given historicaldata.

June 140

July 180

August 770

Using a simple three-month moving average'

what is the forecastfor SePtember?

Using a weighted moving average,with weights

of 0'20, 0'30, and 0'50 for June, July, and

August, respectively,what is the forecast for

September?

cs-08 13,000

ADCA / MCA (II Yr)

Term-End Examination

June, 2006

AND

C S - O 9: D A T A C OMMU N IC A T ION

NETWORKS

three questions Jrom the rest.

to a PCM signal using 8 bitlsample. What is the bii

rate on the transmission line I 3

between manchester encoding and differential

10001011011.

'

(c) Calculate the number of networks that can exist in

Class A, B and C IP addresses.Also, calculate the

number of hosts a network in each class can have'

accepts the token and then crashes immediately ?

How does protocol handle this situation ?

CS-09 P.T.O.

(e) Answer the following questions with respect to a

TCP header:

(i) Why is the TCP header length required ?

Explain this.

(ii) What is the need of a variable size sliding

window ?

(0 What is a subnet? How is subnettingimplemented?

Explain this with the help of an example.

procedures both in the normal case and in the

call-collisioncase,with the help of a diagram each. s

(b) Explain two important reasons for having a

minimum frame lengthin CSMA/CD. Explainthis

diagrammatically. 5

(c) Derive the throughput expressionsfor ALOHA and

Slotted ALOHA. s

and explain its operations. s

(b) Why is there a need for compression? Differentiate

betweenJPEG and MPEG standards. 4

(c) Give at leastthree functionsof a modem 3

(d) How does UDP handleflow control, error control or

retransmissionupon receipt of a bad segment? s

cs-09

4.. (a) Explain the operation of an FDDI token ring, with

the help of a diagram. Also, list the two key

differencesbetweenFDDI and IEEE 802'5. 7

the following : I

- (ii) Error recoveryusing RFJ command

(iii) Two-way data exchange

(iv) Link setup and disconnection

(ii) services

Connectionorientedand Connectionless

(iii) ARP and RARP

(iv) Upward multiplexingand Downward multiplexing

(v) X'25 and Frame relay

cs-09 20,000

ADCA / McA (II Yr)

Term-End Examination

June, 2006

CS-10: SOFTWARE

ENGINEERING

T i m e: 3 h o u r s Maximum Mqrks : 75

questionsfrom the rest.

of books. The main objectivesof the s/w are :

. On-line record of valid borrowers.

o Online record of books issued.

o Online reservationof books.

For the above mentionedsystem

(i) Developa SoftwareRequirementSpecification.

(iil Design DFD upto two levels.

(iii) Constructthe structurechart for this system.

(iv) Suggest a testing strategy for any two s/w

modulesin (iii) above. 20

cs-10 P.T.O.

(c) Why is there often tension between a software

engineering group and an independent software

quality assurancegroup ? Is this healthy ? Justify your

answer.

three important principles. Elaborate these

principles.

integrationtesting.Give one exampleof each.

of size

oriented metrics?

it to independent paths ? Explain with suitable

example.

prepared?

is it measured?

where the withdrawal and deposit operations are

allowed. 10

(SCM)? Explain the elementsof a SCM system.

cs-10

5. (a) Develop a procedural design for an interactive user

interface that queries for basic "lncome Tax"

information. Derive your own requirements and

assumethat all tax computationsare performed by

other modules.

testing tools are better than the statictestingtools'

object used during data modelling.

cs-10 18,000

ADCA / MCA (III Year)

Term-End Examination

June, 2006

CS-12 : COMPUTERARCHITECTURE

three questionst'rom the rest.

with the help of an appropriatediagram.

organization for a main memory system with 16

memory modules.Each moduleis assumedto have a

capacityoflMbyte.

Design 1 : 16-way interleavingwith one memory

bank.

Design 2 : 8-way interleavingwith two memory

banks.

For this systemcalculatethe following : 10

(i) addressformat for each organization.

(ii) maximum memory bandwidth.

CS-12 P.T.O.

(c) Show the numerical analysis demonstrating the

perf.ormancedegradationcausedby branchingin an

instruction pipeline. State all the assumptionsand

explain each notation used. 8

superpipelinedprocessors:

o Time required to exeiute N instructions

. The relationship between Speedup and Base

machine

Explicitly state the assumptionsand explain each

notation used. 7

network-connected with the help of

multiprocessors,

a diagram.

1 2 3 4

S1 X X

s2 X

S3 X

pipeline processor.

cs-12

3. (a) List two differencesbetweeneach of the following : 6

(i) Crossbarversusmultistageswitches

(ii) Virtual channelvs. physicalchannel

(iii) Buffer deadlockvs. channeldeadlock

(b) A computer systemhas a 12g byte cache. It usesa

4-way set associativemapping with B bytes in each

block. The physicaladdresssize is 32 btts. and the

smallest addressableunit is 1 byte. Answer the

following for this system:

and cacheaddresses.

(ii) To what block frame of cache address will

000010AF1ube assigned?

(iii) If the addresses00001OAFru and FFFFTAxyru

are assignedto the same set, find the valuesof

x and y.

code segment:

51 : Load R1, M(100)

52 : MOVE R2, R1

53 : Inc Rl

54 : Add R2, R1

55 : Store M(100),R1

Also draw the corresponding data dependency

graph.

c s -1 2 P.T.O.

(b) Differentiate between a VLIW processor and a

superscalarprocessor'Also, explainthe pipeliningin

I

VLIW architecture,with the help of a diagram'

in the SPARC architecture,with the help of 'a

diagram.

'context' mean with respect to a

(b) What does

multithreadedsystem ? With the help of a diagram'

explain multiple context prQcessors'

cs-12 25,000

@l

ADCA / MCA (lll Year)

Term-End Examination

June, 2OOG

C S-l 3 : OP E R A T IN G

S Y STEM S

three questionsfrom the rest.

effective disk space allocation strategy ? Also, explain

the indexing strategy for non-contiguous allocation of

disk space.

example illustrating the anomalous behaviour of

FIFO.

problem. Write an algorithm to solve it.

for mutual exclusion in distributed svstems.

WINDOWS o/s with respect to features of open

source software.

cs-13 P.T.O.

:

2. (a) Explain processor synchronization issues in a

Multiprocessorsystemwith sharedmemory. 6

(b) Define processscheduling.What is the role of the

scheduler? List all the schedulersavailable,along

with their working principles. 9

(i) Paging system

(ii) Segmentedsystem

(b) Write and explain an algorithm for deadlock

prevention. 7

for inter-processsynchronization. B

(b) What is a digitalsignature? Explain the method for

generationand verificationof digital signatures. 7

with an example.

(b) Explain the architectureof a DistributedFile system,

with special relerenceto a client-serverdivision of

labour.

cs-13 20,000

MCA (IIl Year)

Term-End Examination

June, 2006

three questionslrom the rest.

between cognitive systems and expert systems' 4

disjunctive normal form ' 4

( i ) - ( P & Q )& ( P v Q )

(iil -Pv-Q) &(R+S)

betweenInductiveInference

(c) Write three differences

and Abductive Inference mechanisms. Give one

application of each type of inferencing technique. 4

of knowledge from memorY. 3

'script' context of knowledge

(e) Explain in the

'movie

representation. Cteate a script'. Make

necessary assumptions. 5

cs-14 P.T.O.

(f) How does the use of a heuristicfunction reducethe

searchspace? Suggesta good heuristicfunction for

each of the following : 6

(i) TravellingSalespersonproblem

(ii) 8 puzzleproblem.

(S) Write an algorithm for matchingsubstrings. 4

equation,ax2 + bx + c = 0, a # 0, a, b, c e R. 5

(b) Transform the following FOPL statements into

equivalentconceptualgraphs : 5

(i) Vx Normal (x) & Grown (x) + Walk (x)

'

(ii) Vy Haswings(y) & Layseggs(y) -+ Isbird(y).

(c) Explain the five levelsof knowledgerepresentation. 5

for each. 3

(b) Write a LISP function that will reversethe elements

of a list.

[eg.input list ((ab)(c(de))),outputlist (((ed)c)(ba)) 5

(c) Name any four arc-relationsused in an associative

network. Give an example displaying the three

arc-relations. 4

(d) Apply the unificationalgorithm to the following set

of clauses:

l P ( X , Y ) n Q f i , j o e )n R ( Y , Z ) ,

P (john, mary) n Q (john, A) n R (mary,A) ) 3

cs-14

4. (a) Write and explain the various steps of the branch

and bound searchtechnique. 5

algorithms' 6

(i) Admissibilitycondition

(ii) Completenesscondition

(iii) Dominanceproperty

(c) Give any four functions performed by a

comprehensivememory managementsystem' 4

for matching?

the probabilistic'measures 4

each of the following pairs of lists match i 4

(ii) (abc(da) f), (?x bc (d ?y) ?z)

You are given two jugs of capacity4 gallonsand

3 gallons. Neither has any measuringmark on it'

How can you get exactly2 gallonsof water into the

4 gallon jug ? Write production rules for the

problem and obtain the solution of this problem. 7

cs-14 19,000

MCA (III Year)

Term-End Examination

June, ?OOG

C S - 1 5 : R E L A T ION A L

D A T ABASE

MANAGEMENTSYSTEM

questionsfrom the rest.

stores have to keep track of products, suppliers,

customersand employees.Make an E-R diagram,

. statingthe assumptionsused,if any. I

example.How is it relatedto normalization? Explain

this with the help of an example. 7

diagram.Describea suitablemethod using Locks, for

handling a large number of concurrenttransactions

per minute in an online airline reservationsvstem. 7

cs-15 P.T.O.

(d) Explain the significance and usage of views in .a

relational databasesystem, with the help of suitable

examples.Explain any four constraintsof updating a

fuple in a view.

'of

Explain the concepts clustering and hashing

indices,using an exampleof each.

GRADE (stud_id,subject_id,grade)

SUBJECT (subject-id,s-namd, teacher)

(i) Write the relational algebraic query for the

following :

. List the studentnumber, subjectnamesand

gradesof the studentwhoseid is 100.

' List the grades of all the students in the

subjectstaught by teacher "XYZ".

(ii) Convert the queries above into an optimized

query graPh.

BPO:

Customer (C-code, C-name, C-phone)

Product (P-code, P-desc, P-price)

Call (Ca-id, C-code, P-code, Ca-result, Ca-date)

cs-15

Write the appropriate SQL commands for the

following :

(i) Find the name of customersto whom a call is

not made.

(ii) Find the total number of calls made to the

'Smith'.

customerwn'osename is

(iii) List C-name and P-desc of the calls made

today.

(iv) Find the product details of those products

whose price is aboveaverage.

faculty and the students'

FACULTY (f-id, f-name, subject-id)

STUDENT (S-id, S-name, S-course,S-dob)

MARKS (S-id, subject-id, marks)

Constraints' One facultyteachesonly one subject'

(i) Identify suitable accessrights for the faculty,

studentsand databaseadministrator'

(ii) Createthe accessmatrix for (i) above'

(iii) Write the query modification statement for the

students.

transactionsin RDBMS, with suitableexamples' 5

generate timestamps ? Explain the timestamp

ordering protocol for concurrencycontrol' 5

cs-15 P.T.O.

(c) Explain the different time components involved in

accessinga disk block.

(d) "The decomposition of a relation into BCNF is

always dependency preserving." Is this statement

true ? Give reasonsfor your answer.

exampleor diagram : 10

(i) Data independence

(ii) Security in statisticaldatabases

(iii) Serialisability

(iv) Closureof an FD

(b) Supposethe write aheadLog Schemeis being used.

Give the REDO and UNDO processesin the strategy

of writing the partial update made by a transaction

to the database,as well as in the strategyof delaying

all writes to databasetill the commit.

cs-15 4 19,000

ADCA / MCA (lll Yr)

Term-End Examination

June, 2OOG

CS-16: OBJECTORIENTED

SYSTEMS

questionsfrom the rest.

books to students and staff. It collects different

penalties from both categoriesin case of late return

of books.The library also managesdifferentregisters

which hold information about members, books,

magazines, newspapers, penalties collected, etc.,

manually.The library needsa systemto maintainthe

registersas well as for performingtransactionssuch

as issue and return of books, etc. Identify classesfor

the system and draw the class diagram. Add three

attributesand three operationsto the classes.Explain

the classesas well as associations,

if any.

Make assumptions,if necessary. 70

cs-16 P.T.O.

(b) Identify at least five classesin a Railway Reservation

System,and show their relatedassociations.

each:

(i) State Diagrams

(ii) Generalization

(iii) Abstract Classes

between various entities like Student, College,

Teacher, Hostel, Library of a IJniuersity

Information System. The diagram should also

include attributes.

Make necessaryassumptionswherever necessary.

relationshipsamong the following object classes: 10

School, Playground, Principal, Board, Classroom,

Book, 'Student, Teacher, Cafeteria, Rest room,

Computer, Desk, Chair, Ruler, Door, Swing.

Include associations, aggregations and

generalizations.Use qualifiedassociationsand show

multiplicity balls in your diagrams.You do not need

to show attributes of operations. Use association

names where needed.

example.

cs-16

3. (a) Define a Scenario.Give an example of a Scenario.

Also, define an Event trace and give an example of

it.

(b) Draw a Data Flow Diagram for computing the

volume and surfacearea of a cylinder. Inputs are the

height and radiusof the cylinder.Outputsare volume

and surfacearea. 10

methodology and the structured software

developmentapproach.

(b) For each of the following systems, identify the

relative importance of the three aspects of

modelling : 10

(i) Telephone Answering machine

(ii) Typewriter

Overloadingof functions? Explain two situationsin

which one would need to use overriding, with an

exampleof each. 10

(b) What is encapsulation? Explain the need for

encapsulation,using an example.

cs-16 23,000

ADCA / MCA (II Year)

Term-End Examination

June, 2006

CS-51 : OPERATIONSRESEARCH

Nofe : Question number 7 is compulsory. Attempt any

three more questionsfrom questions numbered

2to5.

is 10 tons. The weighi per unit (w,) and value per

unit (v,)of each item is given in the following table :

i vi wi

1 5 2

2 6 3

3 4 1

Assume that only integral units of the items can be

loaded. The value of the load carried is to be

maximised.

(i) Formulate this situation as an integer

programming problem.

(iil If the problem is to be solved by dynamic

programming, write the general recursion for this

problem. 4

CS-51 P.T.O.

(b) Find the range of valuesof p and q"whichwill render

the entry (2, 2) a saddlepoint for the game

Player B

81 82 83

A,' 12 6

l 5-ll

Player

A O, Z 101

lo

t l

A3L6 p 4)

Are there values for p, q that will make (3, 1) a

saddle point ? Justify your answer. 4

reasonsfor your answers.

j

1

with probabilities = x und 11", then x can

2 2

take any real value.

0,

is a convexfunction.

pay-off matrix A, max min a.. >*min max a...

i j ' J j i i j

cs-51

(d) My diet requires that all ihe food I eat come

from one of the four "basicfood groups" (ice cream,

soda,/cola, biscuits and cake). At present, the

following four food items are available for

consumption: biscuits,chocolateice cream, cola and

cake. Each biscuit costs 50 p, each scoop of

chocolateice cream costsRs. 10, each bottle of cola

costs Rs. 10 and each piece of cake costs Rs. 5.

Each day, I must consume at least 500 calories,

6 grams of chocolate, 10 grams of sugar and

8 grams of fat. Thesecontentsper unit of each food

is given below.

Sugar Fat

Chocolate

Food Calories (grams) grams)

(grams)

Chocolateice

200 2 2 4

cream (/scoop)

Cola (/bottle) 150 0 4 1

Cake (/piece) 500 0 4 5

Formulatean LP model that can be used to satisfy

my daily consumptionrequirementat minimum cost. 4

(e) Solve the following LPP by simplexmethod. 70

Max 4x, + 3x,

subjectto x, + *2 . 8,

2xr+xr>10

'

x1,x2>0

CS-51 P.T.O.

2. (a) Data are gathered on the sale of TV sets at a retail

shop over 100 days. They are compiled and

presentedbelow.

1 5

2 15

3 20

4 30

5 18

6 9

7 3

per day.

Maximizez=x7+x2

xr+4xr>10

x|xr20

CS-51

(c) An average of 10 customersper hour arrive at a

bank with only one teller. The averageservicetime

for each customer is 4 minutes. Assume that both

inter-arrivaltimes and servicetimes are exponentially

distributed.

(i) Which category of queuing models does this

situation fall in ?

(ii) What is the probabilitythat the ieller is idle ?

(iii) What is the average number of waiting

customers? 5

(d) List three major limitationsof the PERT model. 3

resulting from rental agreementsthat allows cars to be

returned to locations other than those at which they

originally rented. At the present time, there are two

locations (sources) with 15 and 13 cars surplus,

respectively,and four locations(destinations)

requiring9, 6,

7 and 9 cars, respectively.The transportationcost (in Rs.)

of a car betweenthe locationsare as follows :

Destinations

and obtain an initial basic feasible solution. Further,

identify the destination that will receive a supply less than

required, and the amount it receives. 15

CS-51 P.T.O.

4. (a) Four different jobs can be carried out on any of

the four machines.The matrix below gives the cost

(in Rs.) of processingjob i on machinej.

Machine -+

M1 M2 M3 M4

Job J

J1 5 7 11 6

J2 8 5 9 6

J3 4 7 10 7

J4 10 4 8 3

How should the jobs be assignedto machines(one

iob to one machine)so that total processingcost is

minimum ?

(b) A machine produces lOo/odefectiveitems. Denote a

good unit by G and a defectiveunit by B. Carry out

simulation to identify each of the 15 coniecutive

units producedas G or B.

I Use the sequenceof random digits :

4076486653 8950826528 4934582003 l

How many G's and B's are produced?

(c) A shopping plaza is in the shape of a rhombuswith

verticesA (- 1, 0), B (0, 1), C (1, 0), D (0, - 1). A

phone booth is to be located at a point P in the

plaza so that the sum of the squaresof its distance

from all the verticesis minimum.

(i) Formulate this situation as a quadratic

programmingproblem.

(ii) Write the Kr-rhn- Tucker conditions for this

problem.

CS-51

5. (a) The daily demandfor a commodityis approximately

100 units. Everytime an order is placed,a fixed cost

of Rs. 100 is incurred.The daily holding cost per

unit inventory is Rs. 0.02. Determinethe economic

lot size.

problem :

Maximizez = l2xt + 3x, - x,

s.t. 10x, + 2x, + x, > 100

7xr+3x"+2xr<77

2xr+4xr+xr<80

*1a0,x,xr20.

market of the same product. Their different

strategiesare given in the following pay-off matrix.

Company B

81 82 83

A1 12 -2 ol

Company A | |

A2 L1 2 3l

the game.

CS-51 17,000

ADCA / MCA (lI Year)

Term-End Examination

June, 2006

C S- 5 4 : F IN A N C E& A C C OU NTINGON

C OMP U T E R S

T i m e: 3 h o u r s Mqximum Mqrks : 75

three questionsfrom the rest.

concepts :

(ii) Accrualconcept

(iii) Consistencyconcept

Explain the statement. Discuss the role of

accountingfeedbackin the processof control. 6

c s -5 4 P.T.O.

2 . From the following balancestaken from the books of M/s

Ram Kishore & Co, prepare a Trading and Profit & Loss

account for the year ending December 31tt, 2004 and

balancesheetas on that date. 15

Amount Amount

Particulars

Rs. (Dr) Rs. (Cr)

Debtors & Creditors 25,000 22,O00

Purchasesand Sales 89,000 1,15,000

Returns 17,000 12,000

Drawing and Capital 8,000 1,25,000

Fire insurancepremium 2,000

Life insurancepremium 5,000

Income tax paid 10,000

Bills receivableand

14,000 16,000

payable

Wages and Salaries 18,000

Telephone expenses 3,000

Sales promotion

21,000

expenses

Audit fees 8,000

cs-54

Amount Amount

Particulars

Rs. (Dr) Rs. (Cr)

Investments 60,000

Interest on investment 5,000

Interest on bank

overdraft

6,000

Bad debts recovered 2,000

Total 3 ,2 4 ,0 0 0 3,24,000

Closing Stock as on 31st December.2004 amounted to

Rs. 25,000.

structure.Also explainthe variousfactorswhich determine

and influencethe capitalstructureof a firm. Js

Explain why they are approacheddifferently. I

give four of its advantagesand three disadvantages. .-'

c s -5 4 3 - P,T.O.

5. (a) The following figures relate to a company

manufacturinga varied range of products :

Total Sales Total Cost

Particulars (Rs.) (Rs.)

Year ended

22,23,000 1 9 , 8 3 , 6 0 0

31't March. 2003

Year ended

2 4 . 5 1 . 0 0 0 27.43,200

3 1'' March, 2004

Assumingstabilityin price with variablecosts carefully

controlled to reflect predeterminedrelationshipsand

an unvarying fixed cost, calculate

(i) The Profit Volume ratio

.

(ii) Fixed Costs

(iii) Fixed Costs percentageto Sales

(iv) Break even Point

(v) Margin of Safetyfor the year 2003 and 2004' 75

(b) XYZ Ltd. manufacturerof industrialvalvesprovidesthe

following informationfor the year ended3ltt March,

2005.

Particulars Per unit Total

Sales(15,000 valves) (i) 25 3,75,000

Production Overheads

Variable 15 2,25,000

Fixed 3 45,000

(ii) 18 2,70,000

Gross Profit L,05,000

Administration,selling and 32,000

distributionoverheads(Fixed)

Net Profit 73,000

' 4

cs-54

The actual Sales, Production and Stocks for the yeay are

as under :

II II IV

Opening

2,000 1,000 4,000

Stock

Production 6 , 0 0 0 4 , 0 0 0 5 , 0 0 0 3 , 0 0 0 1 8 , 0 0 0

Closing

2 , 0 0 0 1 , 0 0 0 4 ,0 0 0 3 , 0 0 0 3 , 0 0 0

Stock

profitability on the basis of Absorption Costing and

MarginalCosting. 15

c s- 5 4 18,000

MCA (Revised)

Term-End Examination

June, 2006

M C S- O 1 1: P R OB L E MS OL V INGAND

P R OGR A MMIN G

(Weightage75o/o)

three questionsfrom the rest'

and write a program in C, to print the fibonacci

series. 10

(b) Write a program that does not use the inbuilt string

functions to perform the following : 10

factorial of a number using recursion. 10

MCS-o11 P.T.O.

(d) A C program containsthe followingdeclarations: 10

int i, j;

long iX;

short S;

float X;

double dX;

char C;

Determine the resultantdata type of each of the

following expressions:

(i) i+C

(ii) X+C

(iii) dX + X

(iv) ((int) dX) + iX

(v) i+X

(vi) S+j

(vii) iX + j

(viii) S + C

(ix) iX + C

(x) i+j

o/os,o/od,o/oc) that are' comrnonly

used within the

printf function, with an examplefor each. 10

(b) When can two matricesof order a x b and c x d be

subtracted? Also write a program in C to find the

differenceof two such matrices. 70

MCS-o11

3. (a) Design an algorithm, draw a corresponding flow

chart and write a C program to check whether a

given string is a palindrome or not. 10

(b) Explain the meaning of each of the following

functions prototypes and mention the return data

type of each of them : 70

(i) double f(double a, int b);

(ii) void f(long a, short b, unsigned c);

macro ? Find the largest number among two

numbers using a function definition as well as a

macro. Which is more efficient in terms of execution

time and code size ? 1t1

IU

alphabetical order, using an array of pointers. 10

gross salary and net salary, if the details of an

employee along with the basic pay, attendance and

deductions are given as input. 1n

tv

number of words and number of lines in a given file. 1n

MCS-o11 11 , 0 0 0

MCA (Revised)

Term-End Examination

June, 2006

MCS-012 : COMPUTERORGANISATION&

ASSEMBLY LANGUAGEPROGRAMMING

(Weightage 75o/o)

three questionsJrom the rest.

function, and find the function in sum of producl

form. Draw the resultantlogic diagram.

F ( A ,B , C , D ) : > ( 0 , 2 , 4 , 5 , 6 , 7 , 8 , 7 0 , 1 3 , 1 5 )

memory. Assumethat the cellsof RAM are made of

R - S flip-flop.

speedof 3000 rotations/sec.Each track on the disk

has 100 sectors.Find the averageaccesstime for

the disk.

MCS-O12 P.T.O

(d) Explain, with an example of each call, any five DOS

function calls supported by INT 21H in the 8086

assemblylanguage. 10

:

logic-microoperations

(i) SelectivecomPlement

(ii) Mask operations

(iii) Insert

(iv) Clear

its functioningwith the help of a suitablediagram'

using an accumulatormachine :

A = B + C " D . E + F

be achieved by using addition operations only ?

Explain this, using a 4-bit binary number.

input-output using D flip-flops. Describe its

functioning. 5

micro-instruction formats, with the help of suitable

diagrams. 10

MCS-012

3. (a) Explain the process of handling an interrupt that

occurs during the executionof a program, with the

help of an example.

(b) Write a program in 8086 assemblylanguagethat

checks an input string against a password string

stored in the memory and outputs an appropriate

messageif the stringsare not equal.

(c) What is the significanceof FAT ? What are the

limitationsof FAT 16 ?

fetch an instruction?

(b) Explain any five addressingmodes used in an 8086

microprocessor,with the help of an example of

each.

(c) Assume a computerhas 32 word RAM each having

a word of 16 bits and a cache memory of 4 blocks,

with each block having 16 bits. Where can we find a

main memory address21 in the cache(if it exists)if

(i) Set associative

mapping is used?

(ii) Direct mapping is used?

(iii) Associativemapping is used ?

Explain your answerswith the help of a diagram in

each case. 10

the largest,'andthe secondlargestnumber from a list

of 10 numbersstoredin the memorv.

MCS-012 P.T.O.

(b) Draw the logic diagram of a full adder. Create a 2-bit

adder-subtractorcircuit using the block diagram of

the full adder. 6

a diagram,whicheveris appropriate: I

(i) Parity bit

(ii) Floatingpoint notation

(iii) Refreshrates in video controllers

(iv) An l/O channel

MCS-O12 11 , 0 0 0

MCA (Revised)

Term-End Examination

June, 2006

MCS-013: DISCRETE

MATHEMATICS

three questionsfrom the rest.

quantifiers : 2

-(vx P(x))

(c) Give a direct proof of the statement "The cube of

an odd integer is odd". 4

( ( x ,v x r ) ' n ( x , A x i ) ' ) '

S

Sfi) = x * 1. Check whether foS(X) = gof(X). 3

MCS-o13 P.T.O.

(0 In how many different ways can a 7-person

committee be formed containing 3 women and

4 men from amongst a group of 20 women and

30 men ?

inclusive,are there which are divisibleby 2 or 5 ? 3

of the following statements: 5

(i) lBvA1(A+B) =Al

(ii) lB VA [A + B = 1,.,1

where I,.,is the n x n identity matrix.

on A such that aRb iII a + b. Check if R is a 3

(i) Reflexiverelation

(ii) Symmetricrelation

(iii) Transitive relation

(i) Au(BnC)

.

(ii) AAB

n2(n+1)2

13+ 23 + 33 +... * n3_

4

MCS-O13

(b) For the booleanalgebra

( { 0 ,1 1 ,A , V , ' )

evaluatethe booleanexpression

E ( X 1X, 2 ,X 3 )= ( X 1v X 2 )^ ( X i v X ; ) n ( X , v X r ) '

forXr=0,X2=1,X3=0.

52 cards. What is the probability that all four are

kings ?

a tautology or not.,

(ii) p ^ -p

(iii) q -+ (q --> p)

Also give an exampleof a famous conjecturewhich

is not a theorem.

(c) 7C'

Use Pascal'striangleto find

MCS-013 P.T.O.

5. (a) For the following functions defined in tabular form

below, find the boolean expression in CNF and

DNF.

x1 x2 x3 f(x1,x2, x3)

0 0 0 1

0 0 1 0

0 1 0 1

0 1 1 1

1 0 0 0

1 0 1 1

I

1 1 0 1

1 1 1 0

find 9 people who were bom in September.

formed using the English alphabet. How many will

begin with a vowel ?

MCS-O13 11 , 0 0 0

\ MCA (Revised)

Term-End E>ramination

June, 2006

DESIGN

(Weightqge 75o/o)

three questionsfrom the rest.

and explain each of them in detail. 10

development.

(i) Coupling and Cohesion

MCS.O14 P.T.O.

(d) Considerthe followingsituation:

and Type B. For the Type A account,the bank pays

a dividendon the accountbalanceat the end of each

quarter. The balance can be insured. The insured

amount gets 8'750/oannual interest. The uninsured

amount gets 5'00o/oannualinterest.

on an average daily balance for that month. No

dividend is paid for a balancebelow Rs. 2,000,/-,

otherwise50lointerestis paid on the first Rs. 5,000/-,

5'5%o on the next Rs. 20,000/- and 7o/o over

Rs. 25,000,/-.

situation. 15

system design ? How does cost benefit analysis

contribute in it ? 10

performed ? Describe the relationship between data

mining and logical design.Also, describea tool for

data mining 70

important for an organization ? List the advantages

and disadvantages

of CASE tools.

MCS-O14

(b) What is the importanceof studyingthe maintenance

of a system ? Explain the various types of system

maintenancein SDLC.

(c) Explain information security architecture,with the

help of a suitablediagram.

security? Also, briefly describe3 risksand 3 threats. 10

(b) What are the mbthods for gathering the user

requirement? What problemsare encounteredwhen

using these methods? 10

DFD.

(b) Construct the zerolevel and first level DFDs for the

problem of "on line examination".

(c) Explain four reasonsfor the need of documentation

of a system.

MCS-O14 11 , 0 0 0

MCA (Revised)

Term-End Examination

June, 2006

M C S- O 1 5: C OMMU N IC A T ION

SKILLS

after it :

do with computers. But it does have a lot to do with

humans. Courtney Wilkins, a microbiology and

immunology student at the University of Arkansas,

successfullyinfected the ... elegansearthworm with the

mammalianvesicularstomatitisvirus and had it replicate.

Others had tried and failed before and Wilkins'

breakthroughwill let researcherslearn more about how

viruses move from one host to another, and what

proteins they attach to in humans. Some cells in C

elegans, a microscopic earthworm comrhonly used in

biomedicalresearch,are similar to some human cells.

MCS-o15 1 i P.T.O.

"There were a lot of labs interestedin whether this

could work, so it just seemedpretty exciting,l' she said.

Since January 2002, Wilkins began siudyingwhether she

could infect the worms with a virus and have the virus

spread.She usuallyworked with muscleor intestinalcells

and eventually settled on using the vesicular stomatitis

virus. The virus is related to rabies and similar to

foot-and-mouth disease and mostly infects livestock,

Wilkins said. It took three to four months to establishthe

cell cultures. Khaled Machaca, one of Wilkins' advisers

and a professor of cell biology,. said the experiment

wasn't without its rough spots. He said that there were

points when he had to remind Wilkins that her decision

to undertakethe researchwas a risky one, becauseit was

unknown whether it would work. And that meant Wilkins'

degreewas at stake,becauseher careercould be stopped

if nothing came of the research,he said.

successful in her experiment. Wilkins remeinbered

discoveringabout 9 pm, one night in 2004 that the VSV

had replicated inside the worm cell. She immediately

called Marie Chow, a professorof virology and another

advisor. "Courtney gets so excited that she starts to

stutter," Chow-said. "She couldn't get the words out, so

we knew there was somethingto it," she said.

MCS-o15

(i) How was the researchmentionedin the passagea

risky proposition? 2

to the outcome

of the research? Why was it so ? 2+2

'spread'. 7

meaningas

(v) Use 'livestock'and 'rough spots' in a sentenceeach

of your own to bring out their specificmeanings. 2

choicesgiven : 5

back. (round/on/over /into)

(ii) Be careful. Your gun should not go

accidentaily.(awayI oII/ over/ on)

(iii) The Government was determined to push ihe

legislation . (through/in/on/oII)

(iv) I ran an old friend in Amsterdam.

(out/th rough/ into/ upi

becauseof the fog. (on,/off/up/awag)

participantson the need for more strict quality control

measuresin India. (About 500 words) 10

MCS-o15 P.T.O.

4 . You are Nihal Chand, ManagingDirector, PurifiersIndia

Ltd. Write a Memo to all the three Managers (Sales,

Productionand Finance)to hold a meetingwith them, in a

week'stime, for the yearlyreviewof the Company. 10

Vitae (CV) for the job in response to the following

advertisement: 75

"COBOL Programmers, with minimum 2 years'

experience required by a well-known Data Processing

Company in Delhi. Apply within 10 daysto Box 65, New

Delhi- 110068.

MCS-o15 11 , 0 0 0

MCA (Revised)

Term-End Examination

June, 2006

(Weightase75%)

three questions from the rest. AII algorithms

'C

should be written nearer to language.

'O'

using Big notation :

1. scanf("%d", &n);

2. for (i:1, m=n+66; i<:m; i++)

3. printf ("%d\n", i);

4. for (j:n/27, m:n/5; j<:m; j++)

5. printf ("%d\n", j);

Also compute the overall complexity of the given

code.

(b) Derive the expressionfor computingthe height of a

completebinary tree. Also, computethe height of a

completebinary tree of 1024 nodes. 70

MCS-021 P,T.O.

(c) Write a program to delete the leftmost node from a

doubly linked list. 10

indicatethe changesin each step. 10

4 , 2 , 7 , 7 , 6 , 5 , 9 , 3 , 9 I9 ,

terms do not matter in computingthe complexityof

the algorithm in Big 'O' notation.

an elementinto the tree and displaythe tree. 10

(i) Sequentialfile and Index file

(ii) Linear Data structure and Nonlinear Data

structure

lt z 3 1 tl

t l

A = 1 12 0 l

t l

L1 3 1 J ss.

(i) Write the steps involved in calculatingthe ranlc

of A. 5

(ii) Write an algorithmto find the transposeof A. 5

MCS-021

4. (a) (i) How does DFS algorithm differ from BFS

algorithm?

(ii) What are the stepsof DFS algorithm?

(iii) Give two examples each of applications in

which the BFS and DFS algorithms,

respectively,are implemented. 10

(b) Write an algorithm each for PUSH & pop

operationson a stack,implementedusing linked list. 10

example.Which shortestpath algorithm is the most

'

efficient ? And why ? 10

(b) Write the quick sort algorithm.Further,use the input

numbers given below in the algorithm, and show-

each and every step of the algorithm. 10

7, 6, 7, 0, g, 72, 3, 2, 5, 2g

MCS-021 5,000

MCA (Revised)

Term-End Examination

'

June, 2006

MCS-022: OPERATING

SYSTEM

CONGEPTS AND NETWORKING

MANAGEMENT

three questionst'rom the rest.

(b) Differentiatebetweenthe following concepts: 6

(i) Multiprogramming

(ii) Multitasking

(iii) Multiprocessing

(c) Write a shell script that prints a list of every unique

word in a file, in reversealphabeticalorder. 6

(d) Explain the function of the following : 4

(i) LS-L

(ii) /etc/shadow Iile

MCS-022 P.T.O.

(e) Define the concepts of domains, workgroups and

trusted relationships in the context of Windows

2000.

(f) What is Kerberos ? Describe Kerberos management

in the Windowsoperatingsystem. 6

approachesto packet switching.

operating system.

models, and map the layers between the two

approaches.

Lintx ?

2000 operating system. Further, explain the

differencebetweenthe securityfeaturesof an OS and

of a network. 10

file sewer in the LINUX operatingsystem; .- 5

MCS-022

4. (a) Describethe GUI featuresof Linux. Also explain the

corresponding GUI features of Windows 2000.

Further, comparethe usefulnessof thesefeatures. 10

(b) Describe two features of the Intrusion Detection

System(lDS). 5

(c) What are the requirementsfor a user to be able to

kill a process in Linux ? Write the necessary

commands. 5

5. Describethe following : 20

(i) Fault tolerant system

(ii) sNMP

(iii) IPSec

(iv) Architectureof the Windows2000 operatingsystem

MCS.O22 5,000

MCA (Revised)

Term-End Examination

June, 2006

MCS-023: DATABASEMANAGEMENT

SYSTEMS

Time : 3 hours Maximum Mqrks : 700

(Weightage 750/o)

three questionsfrom the rest.

Each department has a name, a unique number,

and a particular employee who manages the

department.

each of which has a name, a unique number

and a single location.

sex, and bdate. An employee is assigned to one

department but may work on several projects.

MCS-023 P.T.O

(iv) We are keeping track of the dependents of

each employee for insurance purposes. We

keep each dependent'sname, sex, birthdate,

relationship to the employee. Draw the E - R

diagram for the company. Make suitable

assumptions,if any. Fxplain all the relationships

in your E - R diagmm w'r-t. relationship

cardinalityand participation constraints'

or not the following functional dependencies are

satisfiedby the relation or cannot be determined.Give

reasonsfor your answers.

A + B, A -+ C, AB -+ C, C + A, BC -+ A,

AC-+B,B-+A

r(R)

A B C

1 4 2

3 5 6

J 4 6

7 3 8

9 1 0

approach and the file basedapproach'

MCS-023

i

STUDENT (sname,Phone,dob, s-id)

COURSE (1$, c-tame, credit, teacher-id)

RESULT (s-id, c-id, marks)

Formulatethe SQL queriesfor the following : 70

(0 Find the namesof the studentswhose resultsare

not declaredin anYcourse.

(ii) Find the teacherswho are teaching more than

one course.

(iii) Display the name and marks of those students

'1-1-1985' and have

who were born before

scoredmore than 80 mark in any course'

(iv) Find the details of studentssecuringpass marks

(50%) in more than 3 courses.

(v) Find the total number of credits earned by a

studentwhose id is 10'

(e) What is serializability? Explain this with the help of

an example. How is it related to concurrency

control ? 5

data replication ? Explain the classification of

replication. 5

and E, having the followingFD's :

A-+B,BC+E,andED-+A.

(il List anY two candidatekeYsof R'

(ii) Is R in 3NF ? ExPIain'

(iii) Is R in BCNF ? ExPlain. 10

MCS-023 P.T.O.

(b) Describe the 3-tier client-serverarchitecfure. List 4

advantagesof client-serverarchitecture.

data independence? Explain this with the help of an

example.

with the help of an exampleeach. Give a situation

with justification, in which multi-level indices are

required. 10

(b) Write a pseudocode of two different types of

concurrent transactions that may be executed in a

Railwayreservationsystem.What are the concurrency

related problems that may be encountered in

concurrent execution of the transactionsabove ? 10

process of recovery ? Explain this with the help of

suitableexample.

with the help of an example. What are its

advantages?

systems? What is the relationshipbetween securitgr

and integrity ?

MCS-023

5. Explain the following in the context of DBMS, with the

help of an exampleor diagram:

(i) Views

(ii) Referentialintegrityconstraint

(iii) Databasemanager

MCS-023 5,000

J

trcs{r-l

MCA (Revised)

Term-End Examination

June, 2006

MCS-024: OBJECTORIENTED

TECHNOLOGIESAND JAVA

PROGRAMMING

three questionsfrom the rest.

exampleof a Polymorphism. 5

(b) What is an object ? How are objects and classes

associated with each other ? Also give two

advantagesof messagespassingbetweenobjects. 5

(c) When can an object be used as a reference of

another object ? What care shouldbe taken in such

kind of referencing? Your explanation should be

supportedby an example. 5

(d) What is multilevelinheritance? How does it differ

from multiple inheritance? Also give an example of

multiple inheritance. 5

MC5-024 P.T.O.

(e) What are the five issuesthat are to be taken care of

while overridinga method ?

(f) Explain the concept of Multithreadingwith the help

of a diagram. Also, give at least two advantagesof

Multithreading.

k) Give the reasonswhy the main( ) method in Java is

defined as public and static. Also explain, why the

name of Java class containingthe main( ) method

has the same name as the name of the file in which

it is stored.

(h) Where does the Applet class appear in the

hierarchy of Java classes? Show this through a class

hierarchydiagram.

(b) What is a Package ? Explain the processof defining

your own package,with the help of an example.

(c) Write the syntax, and explain, any four constructors

of the String class.

(d) Explain the order of constructorcalling in multilevel

inhefitance,with the help of an example

(e) What is this pointer ? Explain its use'with the help

of an example.

text ? Write a program to retrieve RGB values in a

given colour

(b) What is a TCP socket? Explain how a TCP socket

is different from a UDP socket.

MCS-024

'abstraction'? Explain two advantagesof

(c) What is

abstractionwith an examPle.

1 public class exam I

2 Publicint a = 1;

3 public int b : 2;

4 public void method (final int c)

5 {intd=3;

6 classassignI

7 Privatevoid iMethod (int e) {

8 // line 8

e l

10 1

11 l

12 1

Write all the variablesamong a, b, c, d and e that

can be relerencedat Line 8.

(b) Write a program to computethe factorialof a given

number in Java.

(c) Explain the seven steps that are to be followed to

establisha connection from a Java program to a

database.

(d) Write an Applet in Java that will displaythe current

date.

MC5-024 P.T.O.

5. (a) What is a session? Explain how hidden form fields

are used for sessiontracking.

(b) Write a program in Java using the StringBufferclass

which reversesthe string"IGNOU MCA student".

(c) Write five differencesbetween an interface and an

abstractclass.

(d) What is method overloading? Explainhow a method

is overloadedin Java, with an example.

- MCS-024 5,000

MCA (Revised)

Term-End Examination,

June, 2OOG

ALGORITHMS

T i m e: 3 h o u r s Maximum Mqrks : 700

three questions from the rest. All algorithms

should be written neqrer to C/C++ Ianguage.

where b > 0.

(n + a)b = @(nb). 6

(ii) Give an analysisof the efficiencyof ihe Binary

Searchand Linear Searchmethods. 4

(b) What is Randomized euicksort ? Analyse ihe

expected running time of Randomized euicksort,

with the help of a suitableexample. 7

(c) Explain the Greedy Structure algorithm. Give an

example in which the Greedy technique fails to

deliveran optimal solution. s

MCS-031 P.T.O.

(d) Describethe two properties that characterisea good

dynamic programming Problem.

two such problems.

analysed ? Show that the Travelling Salesperson

problem is NP-comPlete. 10

length n that is already sorted in increasingorder ?

What about the time for decreasingorder ?

and the greedy choice approach to solve problems ?

function f, defined by

f(x=) 5*3+3x2+10'

Show that f(x) = trl(x2).

MONUS, definedas follows.

MONUS:NxN--+N

[m-n if m>n

such that MONUS (m, n) = {

| 0 otherwise

MCS-031

3. (a) Show how a DFS (Depth First Search)works on the

graph below. Assume that the vertices are

consideredin alphabeticalorder and assumethat the

graph is represented using adjacency list

representationin which each adjacencylist is ordered

alphabetically.

it becomesknown) to its left and the time it is visited

(i.e., its adjacentnodes are generated)to its right in

the diagram below. For each edge, write its

next to it in the diagram.

classification 10

Automata (FA) for the following languagesover the

alphabet) : {a, b}. 70

is a multiple of three.

(i0 Languagehaving exactlytwo b's in any word.

statistic in a set of n elements (i.e., Randomized

Select). I

MCS-031 P,T.O.

(b) Write a recursiveprocedure to compute the factorial

of a number.

(c) Design a Turing Machine that incrementsa binary

nurnberwhich is storedon the input tape.

searchtechnique.Answer the following with respect

to these techniques. Give justification for your

answerin each case.

(i) Which algorithm has some knowledge of

problem space?

(iil Which algorithm has the property that if a

wrong path is chosen, it can be corrected

afterwards?

(b) Write Kruskal's algorithm and use it to find a

minimal cost spanning tree of the following graph.

(Show the intermediatesteps). 10

procedure ?

MCS-031 8.000

MCA (Revised)

Term-End Examination

June, 2006

A N D D E S IGN

three questionsfrom the rest.

employees working in the offices are categorised as

Branch Manager and clerks. If needed, the Branch

Manager also has to work as a clerk. The bank deals

with its customers in terms of opening different types

of accounts, deposits and withdrawal of money. The

bank wishes to develop a system for each of its

branches. Identify the classesin the system and draw

a class diagram. Each class must have at least three

attributes and two operations. Make necessary

assumptions, if any. 10

(b) What is encapsulation ? Explain two benefits of

encapsulation with an example.

MCS-032 P.T.O.

(c) What is a state diagrarn ? Explain the different

notations used in state diagram.

a use case.

between one-way association and two-way

association, with an example for each'

'referential

(fl What is an integrity constraint ? Explain

integrity constraint' with an example.

structure rather than on operation implementations

in object oriented systems development'

system. 70

(i) Process

(ii) Data Flow

(iii) Actor

(iv) Data Store

DFD.

example,how concurrencyis identifiedin a dynamic

model.

MCS-032 2 +

(b) Explain how associationsare implemented as a class,

with diagrams and code written in C++dava' 10

persistent data are identified. 5

a collaboration'diagram for a library system' Make

necessary assumptions 10

composition and draw a UML diagram for it' 5

example for each. 5

are handled. 5

objeci classesare mapped to tables. 5

adjustment of inheritance ? Explain one way of

adjustment of inheritance, with an example. 10

MCS-032 8,000

MCA (Revised)

Term-End Examination

June, 2006

MCS-033: ADVANCEDDISCRETE

MATHEMATICS

hr"" t""ttr""t frt

- |

1. (a) Check whether ," 62 - n + 2) is a solutionto

the recurrencebelow or not.

example of a planar graph with 6 vertices and

S-regions, and verify Euler's formula for your

example. 4

MC5-033 P.T.O.

(c) A post office has stamps only in denominationsof

Re. 1, Rs. 2 and Rs. 5.

(i) Find the generatingfunction for the number of

ways in which you can pay n rupees using

thesLstamps.

(ii) If the post office has only 20 stampsof Re. 1,

10 stamps of Rs. 5 and 10 stamps of Rs. 2,

find the number of ways in which you can pay

a postageof Rs. n.

(d) Considerthe following graph.

v4 v^

J

(ii) Draw the complementof the graph.

(iii) How many edgesneed to be removed to get a

spanning tree of the graph ? 4

(e) Using an appropriate substitution, solve the

recurrence

n-1

Yn = Vr,-1 + n for n t 1, go = 1

n

MCS-033

2. (a) Let an be the numberof subsets of lI, 2,3, ..., nJ

with at leasttwo elements,n > 1.

(i) What are the values of.a, a, and a, ?

(ii) Set up a recurrencefor an, and solve it.

(b) 'The

Petersen graph is bipartite.' True or false ?

whv ?

number of the following graph :

v4

{aO,a' uz, ...l.Find the generating functionof the

s e q u e n c {ea o ,a o * u l , u 1 + a 2 , . . . } . U s e t h i s t o

deduce the identity

C ( n , r ) + C ( n ,r + 1 ) = C ( n + 1 , r + 1 ) , r > 1 .

Give examples of graphs G, and G, such that

),(G1)= d(Gr) and ),(G2)< 6(Gr).Is it possibleto find

a graph G with f(G) > 6(G)? Justifyyour answer.

MCS-033 P.T.O.

(b) Find the general form of the soluiion to a recurrence

relation with constant coefficients for which ihe

characteristicroots are 1 with multiplicity 2 and 2

with multiplicity 1. The relation also has a

non-homogeneous. part which is a linear combination

of n2 and 2".

where an satisfiesar.,- Sar.,_ - 6un_r, Ior n> 2,

1

andao=1,ar=1.

(b) State Dirac's and Ore's sufficiencycondition for a

graph to be Hamiltonian.Which of the conditionsis

stronger ? If neither of the conditions apply for a

graph, can you conclude that the graph is

non'Hamiltonian ? Justify your answer with

examples.

MCS-033 8.000

MCA (Revised)

Term-End Examination

June, 2006

ENGINEERING

MCS-034: SOFTWARE

three questionsfrom the rest.

levelsof CapabilityMaturity Model (CMM). 10

are based? Explain the COCOMO model in detail,

with ihe hetp of an example. 70

attributesof softwarequality. 10

of CASE tools. Also, depictthe positioningof CASE

tools in a SoftwareApplicationdevelopment,with the

help of an example. 70

MC5-034 P.T.O.

2. (a) Write the outline of Software Requirement

Specifications(SRS). With the help of a suitable

example, explain the different sectionsof an SRS

document. 12

(b) Draw, and explain, a risk analysistable. 8

attributes that include the description of different

data items ? Give an exampledata item indicatingits

attributes. 13

(b) Write any seven challenges faced by CBSE

(ComponentBasedSoftwareEngineering).

changesto a Baseline,with the help of a diagram. 1 0

(b) Define Software Project Management.Explain any

four elementsof it. 10

test case selection guidelinesfor Boundary Value

Analysis,and illustratethem using an example. 12

(b) Explain the factors that affect the task set for a

project.

MCS-034 8,000

MCA (Revised)

Term-End Examination

June, 2006

MANAGEMENT

questionsJrom the remainingquestions.

' Account, Profit and LossAccount for the year ended

37.72.2005 and a BalanceSheet as on that date : 30

Machinery 6,000 purchases 1,200

for bad debts 1,500

MCS-035 P.T.O.

Dr. Rs. Cr. Rs.

Sunlw

stock 28.800

creditors 6,990

charges 1,500 A/c I,2OO

Purchases 36,000

Insurance 1,500

Discount on

sales 1,500

Repairs to

plant 48O

Travelling

expense 1,500

Interest on

overdraft 60

Drawings 1,500

MCS-035

Adjustments :

(i) ClosingstockRs. 10,500.

(ii) WagesoutstandingRs. 900.

(iii) Rent is payable@ Rs. 60 per month.

(iv) Commissionearnedbut not receivedRs. 1,000.

(v) Write off bad debts Rs. 800 and adjust the

provisionsfor doubtfuldebtsat 5%.

(vi) Depreciateplant at 10% p.a.

(vii) Intereston capitalat 5%op.a.

(viii) The proprietor introducedan extra Rs. 1,000

capitalon 1tt December.

(ix) Prepaidinsuranceamountedto Rs. 500.

(b) Shree Pipes Ltd. usesabout 75,000 valvesper year

and the usageis fairly cohstantat 6250 per month.

The valvescost Rs. 1.50 per unit when bought in

quantitiesand the carrying cost is estimatedto be

20o/o of average inventory investment on annual

basis. The cost to place an order and processthe

deliveryis Rs. 18. It takes45 dayslo receivedelivery

from the date of an order and a safety stock of

3,200 valves is desired. You are required to

determine: 10

(i) The most economical order quantity and

frequencyof orders.

(ii) The order point.

(iii) The most economical order quantity if the

valvescost Rs. 4.50 each insteadof Rs. 1'50

each.

MCS:035 P.T.O

2. Explain the meaning and significanceof the following

accountingconcepts,giving suitableexamplesfor each : 20

(i) Businessentity

(ii) Money measurement

(iii) Continuity

(iv) Cost

elaborateon the problemsand cost associatedwith

it. 10

(b) Briefly explain the various evaluationcriteria used for

evaluatingcapital projects. 10

giving suitableexamples. 20

discussthe different credit policy variablesgiving examples

of each. 20

functions and focus areas of the treasurydepartment ? 20

MCS-035 8,000

- 2 - 4 - Quick-Union Improvements (1302)Hochgeladen voneshwaar1
- Data Structures Algorithms TutorialHochgeladen vonMohan Gupta
- Manual AutoCAD Plant 3DHochgeladen vonAndres Pozo
- 20070918213950312Hochgeladen vondarwin
- Sentence Compression as ILP problemHochgeladen vonAbhishek Sikchi
- Implementing Data Structures Binary Trees and Hash TablesHochgeladen vonGobara Dhan
- MCAREVISEDSYLLABUSF09Hochgeladen vonmattasiva
- Java RecordHochgeladen vonJ Nikle Reddy
- Classification and Regression TreesHochgeladen vonnectar1978
- avlHochgeladen vonRirin Hutagalung
- Detailed Syllabus Ec 2013-14-9may2013Hochgeladen vonsharmalove
- Multiobjective evolutionary algorithm with a discrete differential mutation operator developed for service restoration in distribution systems 1-s2.0-S0142061514002798-mainHochgeladen vonSatishKumarInjeti
- SAS_E-Miner2000 (2)Hochgeladen vonNusrat E
- finalexamap2-2012sampleHochgeladen vonapi-168787955
- Trees NotesHochgeladen vonsubramanyam62
- How to prepare for an interview at Google.Hochgeladen vonShashi Kolar
- Lecture-10 Regression TreeHochgeladen vontmtb04
- Chap 7 TreesHochgeladen vonBhavin Panchal
- Binary TreeHochgeladen vonDeepakVerma
- Data Structure Lec11 HandoutHochgeladen vonJʋŋaiɗ Aĸɓar
- Epi Light JavaHochgeladen vonarungov
- Lec8Hochgeladen vonAwaix Xahid
- Binary Search Tree_3Hochgeladen vonakg299
- SpaHochgeladen vonccsdsfd
- Bump Hunting AlgorithmHochgeladen vonvarun
- Final List of ExperimentsHochgeladen vonabcd
- Introduction to Splay TreesHochgeladen vonSamuel Rodriguez
- final coding michaelloeserHochgeladen vonapi-460758544
- 9_TreeHochgeladen vonHritik Kumar Murmu
- Unit03 TreeHochgeladen vonhackermlf

- CS-16jHochgeladen vonamritanshuu
- Michael Jackson Patent Us 5255452Hochgeladen vonamritanshuu
- Google PaperHochgeladen vonclark
- MCS Dec 2005Hochgeladen vonamritanshuu
- MCS (S) Dec 2005Hochgeladen vonamritanshuu
- MCnAHochgeladen vonamritanshuu
- MCA6sem2008Hochgeladen vonamritanshuu
- CS-51Hochgeladen vonamritanshuu
- CS-51jHochgeladen vonamritanshuu
- MCA2sem2008Hochgeladen vonamritanshuu
- MCA4sem2008Hochgeladen vonamritanshuu
- CS-16Hochgeladen vonamritanshuu
- CS-13jHochgeladen vonamritanshuu
- CS-13Hochgeladen vonamritanshuu
- CS-12jHochgeladen vonamritanshuu
- CS-12Hochgeladen vonamritanshuu
- cs172008Hochgeladen vonamritanshuu
- 5semassigjan08Hochgeladen vonamritanshuu
- 3semassigjan08Hochgeladen vonamritanshuu
- 1semassigjan08Hochgeladen vonamritanshuu

- Lecture 34Hochgeladen vonAyam Mas
- Ecs208 Chapter 1 All UpdatedHochgeladen vonbino_rye
- The firm as a viable system: managing inter-organisational relationshipsHochgeladen vonGandolfo Dominici
- D.concreteStruc.N15Hochgeladen vondrp
- Keys to Overtone SingingHochgeladen vonSkye Løfvander
- probandstatslessonplansweek1Hochgeladen vonapi-280056038
- e12tim53Hochgeladen vonIshamael Snook
- Eval Exam 3Hochgeladen vonKrisia Martinez
- Cumulative Sums in GamsHochgeladen vonjczerna
- Numerical simulation of risisng bubbleHochgeladen vonShripad Pachpute
- Lab reportHochgeladen vonWilliam Liew
- PID Math DemystifiedHochgeladen vonvesridhar
- chp6 soluHochgeladen vonNooruddin Sheik
- Encased Column DesignHochgeladen vonEmad Khan
- syllabusHochgeladen vonseomana
- Seyedali Mirjalili-Evolutionary Algorithms and Neural Networks. Theory and Applications-Springer (2019).pdfHochgeladen vonBenja
- mesin projekHochgeladen vonNordiana Idris
- Bthesis IIHochgeladen vonArun Kumar Yadav
- reteaching 2-5Hochgeladen vonapi-296726470
- Real English 3 Repaso BuenoHochgeladen vonMarileath
- Articulo IAHochgeladen vonHector Bautista
- 06 ThermicsHochgeladen vonAnrapo
- 2010 VJC Physics Prelim H2 P3Hochgeladen voncjcsucks
- Development of SurfacesHochgeladen vonAmir
- Cosmo I First PlanHochgeladen vonJesselle Hannah Agbayani Ancheta-Ruiz
- Dec Lab ManualHochgeladen vonSam Xingxn
- J3UoWHcAwbsrywm6xn7RHochgeladen vonShivam Nishad
- AS 2550-1Hochgeladen vonJ_C83
- Microsoft Excel for Cost AccountantHochgeladen vonAcharya
- 2. Decision TreeHochgeladen vonKhairul Hossain Saikat