Beruflich Dokumente
Kultur Dokumente
Or
Or
5. (a)
(P v Q) /\ l (l P /\ (l l
Q v R))) v
In a Boolean algebra, prove that
(lp /\ lQ) v (lp /\ lR)
(a + b)(a' + e) = ae + 'a'b = ae + a'b + be .
is a tautology.
Or
Or
(b) In a lattice, prove that
(b) Show that
(a * b) EB(b * e) EB(e * a) ~ (a EBb) * (b EBe) * (e EBa). (x )(P(x) v Q(x)) => (x) P(x) v (:3x )Q(x) .
\
6. (a) Let M = ({qQ, ql}, {0,1}, Ii, qQ' {ql}) be an 9. (a) If f: 0 ~ 0' is a homomorphism, prove
NFA where li(qQ, 0) = {qo' ql}, li(qQ, 1) = {ql}, that the Kernel offis a normal subgroup of O.
li(ql' 0) = f/J li(ql' 1) = {qQ, ql'} . Find DFN. Or
Or (b) Let H be a subgroup of a group O. Define
(b) Construct finite state automata equivalent Left and right cosets of H and prove that any two left
cosets of H are either identical or disjoint.
to the regular expression 01 [((10)*+ 111)* + OJ 1 .
2 1712IRI0 3 1712IRI0
17131R11 MAY 2008
Or
(i) Arul commenced business with 5. (a) From the following profit and loss ale
Rs. 21,000 calculate funds from operations:
Or
To discount 1,200
To good will 12,000
(b) From the following particulars; prepare a
bank reconciliation statement as on 3~t December, To Net profit 25,400
2000. 51,000 51,000
(i) Bank balance as per cash book as on
31.12.2000 Rs. 5,400. Or
2 17131R11 3 17131R11
Trial Balance 9. (a) From the following forecast information.
Particular Debit Credit Prepare cash budget for the months April, May and
Capital - 40,000 June 1997. Balance of cash on 1stApril is 8,000.
Sales - 25,000
Months Sales Purchases Expenses on Other
Purchases 15,000 1997 wages expenses
Salaries 2,000 J Rs. Rs. Rs. Rs.
Rent 1,500 J February 90,000 66,000 4,000 6,000
Insurance 300 March 80,000 60,000 4,000 6,000
Drawings 5,000 April 96,000 88,000 6,000 7,000
Machinery 28,000 May 1,00,000 60,000 5,000 8,000
Bank balance 4,500 June 1,20,000 70,000 6,000 7,200
Cash 2,000 Additional informations:
Stock (1.1.93) 5,200
Debtors 2,500 (i) Customers are allowed a credit period
(i) Stock on 31.12.93 - 4,900 (iii) Wages of a month are paid next month.
rJ
(ii) Salaries unpaid - 300 (iv) Other expenses are paid in the next
------
~
month.
(iii) Rent paid in advance - 200
6 17131R11 7 17131R11
(b) Prepare a fund flow statement from the
Reorder period: 'P' = 4 to 6 weeks
following figures:
'Q' = 2 to 4 weeks
Particulars 31.12.94 31.12.93 Particulars 31.12.94 31.12.93
Assets Liabilities Calculate for each component:
Cash 40,000 1,30,000 creditors 3,65,000 3,19,000
(i) Re-order level
Debtors 1,60,000 1,00,000 Provision
Stock and for dividend 2,00,000 (ii) Minimum level
work in Long term 5,35,000
2,55,000 2,35,000 loan
(iii) Maximum level
progress
Land and Equity (iv ) Average level
building 10,20,000 5,40,000 capital 40,00,000 36,00,000
Plant and Surplus 1,29,000 1,00,000
Or
Machinery 35,44,00028,04,000
Furniture and (b) Discuss the essentials of a good system of
fittings 2,10,000 2,10,000
wage payment.
52,29,000 40,19,000 52,29,000 40,19,000
11. (a) The management of 'B' company ltd are
10. (a) Two components 'P' and 'Q' are used as
considering the sales budget for the next budget period.
follows:
You are required to present to the management a
Normal usage - 300 units per week statement showing:
Maximum usage - 450 units per week (i) The marginal cost of each product
Minimum usage - 150 units per week (ii) To recommend which of the following
Or
(b) What are the advantages and limitations of
standard costing?
10 17131R11
11. (a) Write a program to create a file of student's
information with their marks details.
1714/R12 MAY 2008
Or
PROGRAMMING IN C
(b) Write a C program to copy the contents of
one file to another.
PART A - (7 x 5 = 35 marks)
Or
(b) Write a C program to read a line of text from
the terminal.
Or
(b) Draw flow chart for the selection process of
switch statement explain with an example.
4 17141R12
3. (a) Distinguish between the following: PART B - (4 x 10 = 40 marks)
(i) Actual and formal arguments
Answer ALL questions.
(ii) Global and local variables
Or Or
(b) Write notes on self-referential structures. (b) Write a C program to find the product of
2 matrices.
2 1714/R12 3 1714/R12
9. (a) Briefly explain gated R-S flip flop using NOR 17151R13 MAY 2008
and NAND gates.
DIGITAL PRINCIPLES AND COMPUTER
Or
ORGANISATION
(b) Explain the working of BCD counter..
10. (a) Explain the following: (For those who joined in July 2006 and after)
Or
4 17151R13
3. (a) Explain R-S flip flop with an examples of a 6. (a) Explain:
possible sequence of input signals. (i) Static and Dynamic RAM
Or (ii) VAX-11 virtual memory.
(b) Explain binary half-adder. Or
4. (a) Add the following 1's complement number (b) Discuss on Interrupts.
Or
(b) What should one do during the interview?
2 17161R14 3 17161R14
9. (a) Prove that a spanning tree T of a given
weighted connected graph G is a shortest spanning tree 17171R15 MAY 2008
of G if and Only if1here exists no other spanning tree of
G at a distance of one from T whose weight is smaller GRAPH THEORY
than that ofT.
Or
(b) Prove that a graph has a dual if and only if it (For those who joined in July 2006 and after)
is planar.
.
Time: Three hours Maximum: 75 marks
(b) State and Prove the Five Colour Theorem. 1. (a) There are 16 books on a bookshelf. In how
many ways can 6 of these books be selected if a selection
11. (a) Prove that the complete graph of five vertices must not include two neighbouring books?
is non-planar. Or
Or (b) Prove that n = C(n - r) = nC r.
(b) State and Prove the Polya's Counting
Theorem.
2. (a) Prove that a graph G is disconnected if and
only if its vertex set V can be partitioned into two
nonempty, disjoint subsets VI and V2 such that there
exists no edge in G whose one end vertex is in subset VI
and the other in subset V2.
Or
(b) Prove that in a connected graph G with
exactly '2k' odd vertices, there exists ok' edge-disjoint
sub graphs such that they together contain all edges of G
4 17171R15 and that each is a Unicursal graph.
3. (a) Prove that in any tree with two or more 6. (a) Prove that every tree with two or more
vertices, there are at least two pendant Vertices. vertices is 2-chromatic.
Or Or
(b) Prove that every connected graph has at least (b) Prove that a graph with at least one edge is 2-
one Spanning t~ee. chromatic if and only if it has no circuits of odd length.
4. (a) Prove that with respect to a given spanning 7. (a) Prove that in any digraph G the sum of all in-
tree T, a chord Cithat determines a fundamental circuit degrees is equal to the sum of all out-degrees, each sum
r occurs in every fundamental cut-set associated with being equal to the number of edges in G.
the branches in r and in no other.
Or
Or
(b) Describe any two application of graphs in
(b) Prove that the maximum flow possible Computer Science.
between two vertices 'a' and 'b' in a network is equal to
the minimum of the capacities of all cut-sets with PART B - (4 x 10 = 40 marks)
respect to 'a' and 'b'.
Answer ALL questions.
5. (a) Prove the following for any simple, connected,
planar graph with 'f regions, 'n' vertices and 'e' edges All questions carry equal marks.
(e > 2).
8. (a) Prove that a simple graph with 'n' vertices
(i) e~(3/2)f
and. 'k' components can have at most (n-k)(n-k+l)/2
(ii) e:::;3 n - 6 . edges.
Or
Or
(b) Define incidence and adjacency matrices. (b) Prove that a given connected graph G is an
Give suitable examples. Euler graph if and only if all vertices of G are of even
degree.
2 17171R15 3 17171R15
1718/R16 MAY 2008
SOFTWARE ENGINEERING
PART A - (7 x 5 = 35 marks)
\
3. (a) Write short notes on Delphi cost estimation. PART B - (4 x 10 = 40 marks)
Or
Answer ALL questions.
(b) In what way programmer ability influence
software cost?
8. (a) Describe the different categories of project
sIze.
4. (a) What are desirable properties involved in Or
software requirements specification? Explain. (b) Explain any three factors that influence
Or quality and productivity.
(b) Explain about PSA. 9. (a) What are the steps required to plan a
software project?
5. (a) What is Information Hiding? In what way it Or
is useful for software development?
(b) Explain the format of a software requirement
Or
specifications.
(b) Write short notes on Structure.
10. (a) Write down cost estimation procedure using
6. (a) Write down difference between validation COCOMO.
and verification. Or
Or (b) Explain about formal specification
techniques.
(b) What is unit testing? Explain.
11. (a) Explain about design notations in software
7. (a) Write short notes on design activities in design.
software maintenance.
Or
Or
(b) What are the benefits observed from
(b) What is primary function of quality walk through?
assurance group during software maintenance?
2 17181R16 .3 17181R16
17191R17 MAY 2008
Or
Or
Or
2 17191R17 3 17191R17
11. (a) Define a class string use overloaded ==
operator to compare two string.
1720/R18 MAY 2008
Or
(b) Discuss how super fast spelling checker can be OBJECT ORIENTED PROGRAMMING AND C++
implemented in C++.
PART A - (7 x 5 = 35 marks)
Answer ALL the questions.
Or
Or
(b) Explain container ship of class and nested 8. . (a) Explain in detail the application of object
class. oriented programming.
Or
(b) Illustrate the use of subroutine with suitable
programming example.
4 17211R19
4. (a) Explain the components of an IBM PC system PART B - (4 x 10 =40 marks)
Unit.
Answer ALL questions.
Or
All questions carry equal marks.
(b) Write a note on ROM selection.
8. (a) Explain
5. (a) What are the five main timing signals used by (i) Timing Bus cycle
an IBM PC system.
(ii) Read Bus cycle
Or (iii) Write Bus cycle and
(b) Explain the functions of system board. (iv) Fetch-Execute cycle.
2 17211R19 3 17211R19
. (6 pages)
1722/R20 MAY 2008 4. (a) Write a note on the classification of
stochastic processes.
OPTIMIZATION TECHNIQUES Or
(b) Explain transition probability matrix with
(For those who joined in July 2006)
suitable example.
Time: Three hours Maximum: 75 marks
5. (a) Explain arrival characteristics.
PART A - (7 x 5 = 35 marks)
Or
Answer ALL questions. (b) Explain various measures of performance in
the steady state.
1. (a) Explain any two underlying assumptions of
LPP that limits it applicability. 6. (a) In (M 1M 11:GDloo/oo), prove that the
Or
probability distribution that there are n customers in
(b) (i) State the properties of standard LP the system is geometric.
form
(ii) Define slack variable. Or
'-- 2. (a) Explain graphical procedure to solve an LPP. (b) For (M 1M 12):(00FIFO) queuing model find
PO,P! and p(n > 2) if A = 5/hour and ,u = 4/hour.
Or
(b) Explain degeneracy and cycling with 7. (a) State and prove any two properties of Z-
example. transforms.
2 17221R20
9. Solve the integer Linear
PART B - (4 x 10 = 40 marks) (a) following
programming problem:
8. (a) Solve the following LPP using graphical
Maximize z =Xl + 5X2
procedure:
Subject to
Maximize z =2x I + 3X2
Xl +10x2~20
Subject to x2~2
xI~2.
2XI+X2~6
Xl +2X2 ~8 Xl' X2 are nonnegative integers.
Xl -X2 ~1
xI~2
Or
XI,X2 ~ O. (b) Obtain an optimal solution of the assignment
problem.
Or I II III IV V
1 11 17 8 16 20
\ (b) Solve the following LPP using simplex
method: 2 9 7 12 6 15
3 13 16 15 12 16
Maximize z =5XI +7X2 4 21 24 17 28 26
Subject to 5 14 10 12 11 15
3 17221R20 4 17221R20
(: [P.T.O.]
"
(i) What is the probability tat a customer (b) Customers arrive at a one-person barber
will not have to wait for services? shop according to a Poisson process with a mean inter -
arrival time of 20 minutes, customers spend an average
(ii) What is the expected number of of 15 minutes in the barber chair
customers in the system?
(i) the probability a customer will not have
(iii) Computer Lq, Ws' Wq . to wait for a hair-cut
Or
(ii) the expected number of customers in
(b) A super Market has three girls ringing up the barber shop
sales at the counters. If the service time for each
customer is exponential with mean 5 minutes and if (iii) the expected time taken by a customer
people arrive in Poisson fashion at the rate of 15 an to spend in the barber shop.
hour find
(i) the probability of having to wait for
seI'Vlce
OPTIMIZATION TECHNIQUES Or
2. (a) Explain graphical procedure to solve an LPP. (b) For (M 1M 12):(00FIFO) queuing model fmd
Po,PI and p(n > 2) if A =5/hour and ,u= 4/hour.
Or
(b) Explain degeneracy and cycling with 7. (a) State and prove any two properties of Z-
example. transforms.
2 17221R20
PART B - (4 x 10 = 40 marks) 9. (a) Solve the following integer Linear
programming problem:
8. (a) Solve the following LPP using graphical
procedure: Maximize Z =XI +5X2
Subject to
Maximize Z=2XI +3X2
Xl +10x2::=;20
Subject to x2::=;2
xI::=;2.
2XI +X2::=;6
Xl +2X2 ::=;8 Xl' X2 are nonnegative integers.
Xl -x2::=;1
xl::=;2 Or
XI,X2 ~ O.
( (b) Obtain an optimal solution of the assignment
problem.
Or
I II III IV V
(b) Solve the following LPP using simplex 1 11 17 8 16 20
method: 2 9 7 12 6 15
3 13 16 15 12 16
Maximize z = 5XI +7X2
4 21 24 17 28 26
Subject to 5 14 10 12 11 15
2XI + x2::=;6
10. (a) Customer arrive at a service section
3XI +4X2::=;12.
according to a Poisson process with a mean interval
XI,X2 ~O
time of 30 minutes. The service time is distributed as
exponential with mean service time 15 minutes.
3 17221R20 4 17221R20
[P.T.O.]
---
(i) What is the probability tat a customer (b) Customers arrive at a one-person barber
will not have to wait for services? shop according to a Poisson process with a mean inter -
arrival time of 20 minutes, customers spend an average
(ii) What is the expected number of of 15 minutes in the barber chair
customers in the system?
(i) the probability a customer will not have
(iii) Computer Lq, Ws' Wq . to wait for a hair-cut
Or
(ii) the expected number of customers in
(b) A super Market has three girls ringing up the barber shop
sales at the counters. If the service time for each
customer is exponential with mean 5 minutes and if (iii) the expected time taken by a customer
to spend in the barber shop.
people arrive in Poisson fashion at the rate of 15 an
hour find
(i) the probability of having to wait for
servIce
(ii) the expected percentage of idle time for
I
each girl
(iii) the average queue length as the
l
I
) average number of units in the system.
Or
(b) List two interactive graphical input devices
with their applications.
Or
(b) Explain bundled attributes.
4 1723/R21
4. (a) Explain anyone character attributes. PART B - (4 x 10 = 40 marks)
(b) Write the equations of rotation and its 8. (a) Write note on:
matrix form. (i) Printers and
(ii) Plotters.
5. (a) Explain multiple window and view point
commands.
~ Or
(b) Explain an three display processors.
Or
9. (a) Explain mid point circle algorithm. Illustrate
(b) Explain an one interactive input method. the use of this algorithm to determine the position along
the circle octant in the first quadrant from x = 0 to
6. (a) Explain three dimensional coordinate
x =y in a circle of radius 10.
systems.
Or
Or (b) Explain:
(b) (i) Mid point subdivision clipping
Define segment and its attributes.
algorithm and
7. (a) Explain three dimensional scaling with. its (ii) Text clipping algorithm.
matrix.
10. (a) Explain the logical classification of input
devices.
Or
Or
, (b) Explain rubber band methods and dragging
techniques. (b) Explain an two input modes.
2 1723/R21 3 1723/R21
17241R22 MAY 2008
Or
(b) Explain bottom up variant of software design. of data usage and logical navigation.
Or
6. (a) How do you distinguish between logical and
physical design? (b) Explain the benchmark in the system analysis
and design.
Or
(b) Explain the main components of computer- / 11. (a) Discuss the common problems of database
user interface design. design.
Or
7. (a) Explain the concept of structure design.
(b) Explain various converSIOn methods of
Or
changing old system into new system.
(b) What are the vendor maintenance support?
11. (a) Write an essay on the TCP connection (For those who joined in July 2006)
management. Time: Three hours Maximum: 75 marks
Or PART A- (7 x 5 =35 marks)
(b) Discuss server side and client side concepts Answer ALL questions.
of www.
1. (a) Explain networks for companies.
'\ Or
(b) Explain metropolitan area networks.
2. (a) Explain network layer.
Or
(b) Compare OSI and TCP/IP reference models.
Or
(b) Explain data link simplex stop and wait
protocol.
4 17251R23
4. (a) Explain Global system for mobile PART B - (4 x 10 = 40 marks)
communications.
Answer ALL questions.
Or 8. (a) Discuss any three transmission media in
detail.
(b) Write note on the design aspects of a bridge.
Or
5. (a) Explain the services provided by network
(b) Explain the following transmission media:
layer to transport layer.
(i) Magnetic media.
Or
(ii) Twisted pair and
(b) Explain flooding static algorithm.
(iii) Base band coaxial cable.
6. (a) Explain the services provided to the upper
layers by the transport layer. 9. (a) Discuss error correcting and detecting codes
in detail.
Or Or
(b) Write a note on UDP. (b) Discuss the token ring for IEEE standard
802.5 with suitable diagram.
7. (a) Write note on traditional cryptography.
10. (a) Write note on
Or
(i) Hierarchical routing and
(b) Explain video on demand system with
(ii) Routing for mobile hosts.
suitable diagram.
Or
2 17251R23 3 17251R23
11. (a) Explain how an element is inserted in to a
min-max heap with suitable algorithm. 17261R24 MAY 2008
Or
DATA STRUCTURE USING C++
(b) Explain and write an algorithm to delete a
key Btree. Give an analysis of the algorithm.
(For those who joined in July 2006)
PART A - (7 x 5 = 35 marks)
Or
(b) Explain data abstraction.
Or
(b) Explain the four scopes of C++.
Or J
(b) Explain pointer manipulation in C++.
4. 1726/R24
4. (a) Explain Virtual member functions. PART B - (4 x 10 = 40 marks)
Or 8. (a) Explain recursive Binary search and
selection sort with suitable algorithms.
(b) Write a note on Dynamic binding in C++.
ff
Or
5. (a) Define the following with respect to a tree
(b) Discuss performance analysis and
(i) Degree of a node measurement of pr::>grams.
(ii) Terminal node
9. .(a) Write note on
(iii) Siblings
(i) Non-virtual member functions
(iv) Degree of a tree and
(ii) Virtual member functions
(v) Depth of a tree.
(iii) Pure virtual member functions.
Or
Or
(b) Explain an one operation on Max heap.
(b) Discuss Creation of a Linked list and explain
6. (a) Explain any two types of uniform hash how to inset a node in it.
functions.
10. (a) Discuss various types of representations of
Or binary trees with suitable diagrams.
(b) Explain chaining in hash tables. Or
7. (a) What are the conditions for a binary tree to (b) Explain with suitable function
be red-black tree?
(i) To search an element in a binary
search tree and
Or
(ii) Insertion into a binary search tree.
(b) What are the defining properties of m-way
search tree?
2 17261R24 3 17261R24
(b) Find the approximate values of the integral.
1 1
1727/R25 . MAY 2008
J - dx COMPUTER BASED NUMERICAL METHODS
0
Using
(i) Trapezoidal rule and
(For those who joined in July 2006)
(ii) Simpson's Rule with h = 0.25 Time: Three hours Maximum: 75 marks
11. (a) Apply Runge-Kutta Fourth order formula to
obtain approximate solution of Answer ALL questions.
by obtaining y(O.I) and y(0.2) and y(0.3). 1. (a) Draw a flow chart to find real roots of a
quadratic equation.
Or
Or
(b) Given dy / dx = X2 + y, y(O) = 1, obtain y(0.2)
(b) Explain Newton - Ralphson method of
y(O.4) and y(0.6) using Taylor's method and obtain
finding roots of transcendental equation.
y(0.8) using predictor method.
2. (a) Explain Birge-Vieta method.
Or
2 17271R25 3 17271R25
11. (a) Explain the CGI programming with java 17281R26 MAY 2008
Script and PERL.
JAVA PROGRAMMING
Or
(b) Explain various operators available in VB
Script with examples. (For those who joined in July 2006)
PART A - (7 x 5 = 35 marks)
1. (a) List the seven layers of OSI model and their
functions.
Or
Or
4 17281R26
/
3. (a) Write vanous characteristics of java PART B - (4 x 10 = 40 marks)
Programming.
8. (a) Discuss:
Or
(i) The four conceptual layers of TCPIIP
(b) Explain with a simple Java Program the software and
declaration, initialization and display of variables.
(ii) IP address
4. (a) List any ten COInmonJava Exceptions.
Or
Or
.(b) Write note:
(b) Explain Runnable interface.
(i) Internet explorer
5. (a) Define a Thread in Java. List the advantages (ii) Netscape Navigator.
of using thread over processes.
Or 9. (a) Explain various control statements available
in Java with a suitable Program.
(b) What are the attributes of <APPLET> tag?
Explain each attributes with example. Or
6. (a) Explain various data types in Java Scripts (b) Explain any five Java Exception in Java with
with suitable example suitable examples.
Or
10. (a) Write an essay datagram and its classes with
(b) Write the syntax of a function in Java Script example.
with a suitable example.
Or
7. (a) Explain any two data type in PERL with
(b) Write note on :
example.
Or (i) creating and
(b) Write a note on Msgbox function in VB (ii) loading and displaying image object in
Script with example. Java.
2 17281R26 3 17281R26
17291R27 MAY 2008
OPERATING SYSTEMS
PART A - (7 x 5 = 35 marks)
1. (a) Write a brief note on Early operating
systems.
Or
processes.
Or
5. (a) Explain memory protection in relation to (b) Discuss the components of Unix operating
memory allocation. system.
(b) Explain any three basic operations on a-file. 11. (a) Explain Unix SVR4 I/O Management.
7. (a) Explain direct file access method. Or
2 17291R27 3 17291R27
1730/R28 MAY 2008
PART A - (7 x 5 = 35 marks)
Answer ALL questions.
Or
PART B - (4 x 10 = 40 marks)
Answer ALL questions.
2 17301R28 3 17301R28
17311R29 MAY 2008
PART A - (7 x 5 = 35 marks)
5. (a) Explain network file services. 10. (a) Explain the role of the server in detail.
Or Or
(b) Explain system application architecture. (b) Explain any two network operating systems
in detail.
6. (a) Explain physical and data link layer of OSI
Model. 11. (a) Explain client server system development
software.
Or
Or
(b) Explain inter-process communication.
(b) Write note on
7. (a) Explain remote system management
(i) Training and Technical staff and
Or (ii) Systems administrator training.
(b) Explain WAN issues in LAN administration.
PART B - (4 x 10 = 40 marks)
2 17311R29 3 17311R29