M.P. Bhoj( Open) University, Bhopal -2006-07
CS-09
(Data Communication and Network)
Ist Theory Assignment
Max mars - 20
Note :- All questions carry equal marks : Questions are to be
solved in sequence as given in assignment :
Q. 1
a) What are the different transmission medium used in a
network ?
b) Explain synchronous and a synchronous modes of
transmission?
Q. 2
CS-09
(Data Communication and Network)
IInd Theory Assignment
MM- 20
Note :- All questions carry equal marks : Questions are to be
solved in sequence as given in assignment :
Q. 1
a) Explain sliding window protocol?
b) Explain Transmission control protocol (TCP)
Q. 2
a) What is a network protocol ? Explain the function of
protocol?
b)
Explain the implementation of LAN using wireless
technology.
MCA Second year
a) Why cryptography is required? Explain.
b) Explain circuit switching ad packet switching.
Q. 3
a) Define gateway, Router, Bridge and switch.
b) Explain various types of Modem.
Q .3
(a) Explain Network architecture with the help of OSI model.
Q. 4
(b) Compare Hop by Hop versus source routing.
Q. 4
(a) Explain routing in WAN
(b) What is network security ? Explain the use of firewall for
network security.
A host in an organization ha an IP address 150.37.64.34
and a subnet mask 255.255.240.0. What is the address of
this subnet ? What are the ranges of IP that a host can
have on this subnet ?
M.P. Bhoj( Open) University, Bhopal -2006-07
MCA Second year
(iv) Binary search tree
CS-10
(Discrete structure & Graph Theory)
Second Assignment
CS-10
(Discrete structure & Graph Theory)
First Assignment
MM- 20
MM- 20
Q. 1
Q. 2
Q. 3
Q. 1
a) Show that R5 can be divided from the premises
P  (Q 5),  R V P and Q.
a  b  a*b=a  b=b
b) Show that :
(b) Demonstrate that R is a valid inference from the
premises.
(x) (P (x) VQ (x)) (x) P(x) V (x)Q(x)
P Q, Q R and P
b) State and prove language’s theorem.
a) Show that the set N X N is denumerable, Hence the set
of Positive rational numbers, as well as the set of rational
numbers, is also denumerable.
b) Let  L,   be a lattice. For any a, b, c  L the
following holds :
b) Write brief note on recursion in automatic theorem
proving.
a) Show that set R of real numbers is not denumerable.
a  c  a  (b* c)  (a  b) x c
Q. 2
Q. 3
(b) Use the Karnaugh map representation to find a
minimal sum of products expression of
further more, n is the least positive integer for which ax=e.
b) Write shortest pat algorithm for traveling salesman
problem.
a) Write short notes :
(i) Paths
a) Let  G, *  be a finite cyclic group generated by an
element aG. If G is of order n, that is, |G| = n , then ax =e,
so that
G= {a, a2, --------- , ax = e}
f ( a, b, c, d) =  (0, 5, 7, 8, 12, 14)
Q. 4
a) Let  L,   be a lattice in which * and  denote the
operation of meet and join respectively for any a, b, c 
L, prove
Q. 4
a) Write short notes :
(ii) Reach ability
(i) Minimum spanning tree
(iii) Automatic Theorem proving
(ii) Lattice
M.P. Bhoj( Open) University, Bhopal -2006-07
MCA Second year
(iii) ISO morphism and Homomorphism
(iv) Prepositional calculus
CS-11
(Optimization Techniques)
First Through Assignment
MM- 20
Note :- All questions are compulsory :
Q. 1 a) What is the role of operation Research in Indian
economy ?
b) What is the role of Management science in decision
making ? Write their application ?
Q. 2 a) Solve the following LPP using graphical method
max z = 30x1 + 40x2
Subject to 3x1 + 5x 2 < 40
3x1 + 2x2 < 35
x1-x2 = 3
Where x1–x2 > 0
(b) What do you mean by integor
Q. 3 Write short note on following :
(i)
Unbounded solution
(ii)
Saddle point
(iii) Big M method
(iv) Assignment Problem
(v)
Queuing model
Q. 4 a) Discuss the development of operation Research in
Indian Context.
b) Solve the following LPP using 2-Phase method :
Max Z = 3x1+2x2
Subject x1+x2 < 2
Where x1, x2 > 0
CS-11
(Optimization Techniques)
Second Theory Assignment
MM- 20
Note :- All questions are compulsory :
Q. 1 a) Explain the concept of inventory model with the help of
an example.
b) What do you mean by goal programming ?
Q. 2 a) Solve the following transportation problem by Bogel
Method :
W1
W2
W3
W4
Capacity
F1
19
30
50
10
7
F2
70
30
40
60
9
F3
40
8
70
20
18
Requirement 5
8
7
14
34
b) Write the MODI algorithm
Q. 3 a) What is the difference between transportation problem
and assignment problem?
b) Solve the dynamic programming
Max Z = y12 + y22 + y33
Subject to y 1 + y2+y3
Where y1, y2, y3 > 0
Q. 4 Write short notes :
1. Slack variable and surplus variable
2. Sequencing model
3. Advantage and disadvantage of ILPP
4. Zero sum game method
5. Non Square Matrix
M.P. Bhoj( Open) University, Bhopal -2006-07
MCA Second year
CS-12
(OOP Using C++)
First Theory Assignment
CS-12
(OOP Using C++)
Second Theory Assignment
MM- 20
Note :- All questions are compulsory :
Q. 1
a) What are the difference between Cad C++
b) Write important object oriented concepts
Q. 2
MM- 20
Note :- All questions are compulsory :
Q. 1
a) What do you understand by function ?Give on example
b) Write a program to calculate vocational using
b) Explain inline function with an example ?
Q. 3
a) Write a program to overload a function to calculate
recursion.
Q. 2
area of triangle ?
b) Explain different type of inheritance. Give example of
a) Write different modes in which a file can be opened.
b) Write a program to sort an every using pointer.
a) Compare pass by value and pass by reference
b) What is pure virtual function. Give one example.
Q. 3
multilevel inheritance ?
Q. 4
a) Write a program to generate bibbonacci series.
a) What is polymorphism. Give an example
b) Explain the concept of encapsulation within example .
Q. 4
a) Describe the features of input / out stream support by
C++.
b) What do you understand by construction? Explain
parameterized construction with example?
M.P. Bhoj( Open) University, Bhopal -2006-07
MCA Second year
CS-13
(Java Programming)
First Theory Assignment
CS-13
(Java Programming)
Second Theory Assignment
MM- 20
Note :- All questions are compulsory :
Q. 1
Q. 2
Q. 3
a) Write Down different data types in Java. Give the
Note :- All questions are compulsory :
structure of simple Java program.
Q. 1
a) Explain various Java control statement.
b) What do you understand by type casting. Give rules of
b) Explain interface and package. What is class path
type casting in Java.
variable ?
a) Write down features of object oriented programming.
Q. 2
a) Explain overriding of method with an example.
b) Different between structure and class.
b) What do you understand by built in exception. Write
a) What do you understand by command line argument ?
name of 5 built in exceptions.
Give an example ?
Q. 4
MM- 20
Q. 3
a) What operation can be performed on string. Write a
b) Describe key wards super. Why it is used ? Give an
program shown the use of any 3 operations.
example ?
b) What is an applet. Why it is used. Explain the life cycle
a) Explain multithreading. Write life cycle of a thread.
of an applet.
b) Describe exemption handling. Differentiate between
throw and throws.
Q. 4
a) Explain Java beans, session and swing.
b) What do you understand by serve let. Give an example.
M.P. Bhoj( Open) University, Bhopal -2006-07
CS-14
(Computer Graphics & MM)
First Theory Assignment
CS-14
(Computer Graphics & MM)
Second Theory Assignment
MM- 20
Note :- All questions are compulsory :
Q. 1
MM- 20
a) Define following terms- Pixel, bitmap, Resolution,
Note :- All questions are compulsory :
persistence and aspect ratio.
Q. 1
b) What do you understand by display device and display
contractors ?
Q. 2
b) What do you mean by scan conversation or
Rasterization. Explain the side effects of rasterization.
Q. 4
Q. 2
a) Describe the propertics of Bezier curve.
b) What is multimedia with hardware required for
multimedia.
a) Explain Mid-point circle algorithm.
b) Write short note on character generation and display.
Q. 3
a) Explain DDA algorithm for line drawing. Give its
advantages and drawbacks.
a) Explain Flat panel Display.
b) Explain Different input devices.
a) Explain Random scan display and roster scan display.
b) Explain Hard copy devices.
Q. 3
MCA Second year
a) Explain the seed fill algorithm.
b) Explain windowing and clipping.
Q. 4
a) Explain window to view port mapping.
b) Write Sutherland - Hodgman polygon clipping.
M.P. Bhoj( Open) University, Bhopal -2006-07
CS-15
(Structured system analysis and Design)
First Theory Assignment
CS-15
(Structured system analysis and Design)
Second Theory Assignment
MM- 20
Note :- All questions are compulsory :
Q. 1
Q. 2
Q. 3
MM- 20
a) Explain the qualities of project manger.
Note :- All questions are compulsory :
b) Explain the system development process.
Q. 1
a) What is the Data Flow Diagram ? Describe various symbols
a) Describe Rapid Application development mode.
used in drawing a DFD.
b) What do you understand by Requirement analysis ?
b) Explain Decision Table with an example.
a) What are the features of good software requirement
Q. 2
(2) Coupling and Cohesion
b) Describe computer Aided system Engineering (CASE).
a) What do
you understand by feasibility analysis.
Q. 3
system modeling.
a) What is entity, attributes and relationship.
b)
Describe different type of feasibility.
b) What is system modeling. Explain different tools of
a) Distinguish between :
(1) Logical Data modeling and strategic Data Modeling
specification (SRS)?
Q. 4
MCA Second year
What is fact finding. Explain various fact finding
techniques.
Q. 4
a) Write a short note on mobile and wireless technology
b) What are Goss life cycle Activities ?
M.P. Bhoj( Open) University, Bhopal -2006-07
MCA Second year
CS-09
(Data Communication and Network)
CS-10
(Discrete structure & Graph Theory)
Project Assignment
Project Assignment
Max mars - 10
Note :- Attempt any one allotted by the RD or course
coordinator.
Q. 1
a) Write a detailed note on wireless LAN also give
architecture of wireless LAN.
Max mars - 10
Note :- Attempt any one allotted by the RD or course
coordinator.
Q. 1
b) Explain the concept of Broadband ISDN (BISDN).
Q. 2
a) Explain architecture of TCP/IP
(x) (P(x) n Q(x) ) => (x)P(x) n (x)Q(x)
(b)
Prove that every finite group of order n is isomorphic to a
permutation group of degree n.
Q. 2
(a) Let  G, *  and  H,   be groups and g : G  H be
a homomorphism. Then the kernel of g is a normal
subgroup.
b) Describe various protocols of TCP/IP suite
Q. 3
a) Describe Domain Name System. Explain various types
of domains with example.
a) prove that :
b) Explain IP Addressing. Describe supernet and subnet.
(b) show that :
(x) (P (x) V Q (x) )  (x) P (x) V (x) Q(x)
Q. 3
Prove that a non empty subset H of a group G is subgroup
of (G, *) iff a, b  H  a * b-1  H.
(b) Prove Euler’s formula.
M.P. Bhoj( Open) University, Bhopal -2006-07
MCA Second year
2.1x2-1.4x3  1
x1+3x2-2x3  2
where x1, x2, x3 = 0
is non -negative integer .
CS-11 (Optimization Technique)
Project Assignment
Note
Q. 1
Q. 2
Q. 3
Max mars - 10
:- Attempt any one allotted by the RD or course
coordinator.
a) solve the following LPP using simplex method :
Max Z = 5x1 + 3x2
subject to
3x1 + 5x2 <= 15
5x1 + 2x2 <= 10
Where
x1, x2  =10
b) Draw a Network diagram showing the layout of
simulation system in Hospital management.
a) what do you mean by transshipment problem ? explain
with the help of an example.
b) Solve the following sequencing problem :
Professor
Course
C1
C2
C3
C4
C5
P1
11
13
9
16
17
P2
4
3
5
2
6
P3
6
7
5
8
4
P4
16
8
13
9
11
Each professor assigned with only one course at a time.
a) Write the algorithm for processing n-jobs through mmachines.
b) Solve the following integer programming problem :
Max Z= -3x1+x2+3x3
subject to -x1+2x2+x3  4
CS-12 (Objected Programming Using C++)
Practical Assignment
Max mars - 10
Note :- All questions are compulsory.
Q. 1
Write a program to display the use of pointer.
Q. 2
Write a program to overload function to add two numbers.
Q. 3
Write a program to show multilevel inheritance.
Q. 4
Write a program to override volume function to find
volume of a box.
Q. 5
Write a program to overload binary ‘+’ to add time.
Q. 6
Write a program that use constructor to initialize three
sides of triangle and function to calculate area.
Q. 7
Write a program to show use of friend function.
Q. 8
Write a program that first open a file for entering text then
open it to display the text entered.
Q. 9
Write a program using switch case that perform addition
subtraction and multiplication of matrices.
Q. 10 Write a program to show the use of virtual function.
M.P. Bhoj( Open) University, Bhopal -2006-07
MCA Second year
Course code - CS-13
Practical Assignment
Course Code CS-14
Java Programming
Project Assignment
Note : all question are compulsory :
Max mars - 10
Computer Graphics & Multimedia
Q. 1
Write a program to find factorial of given number.
Q. 2
Write a program to generate fibbonacci series.
Note : Attempt any one allotted by the RD or course co-ordiantor
Q. 3
Write a program to count number of characters, words and
Q.1
Max mars - 10
a) Draw s line from (0, 0) to (6, 6) using DDA algorithm.
lines in a file.
b) Draw the breshnham line drawing with and points (10,
Q. 4
Write a program to find the sum of columns of a matrices.
5) and 15, 9) with a slope of 0.8.
Q. 5
Write an applet to accept a message and display that
Q. 2
message in blue colour.
a) Explain mid point circle algorithm with an example.
b) Explain boundary fill algorithm
Q. 6
Write an applet to change the colour of applet window
Q. 7
Develop a notepad application
system
Q. 8
Write a program to show multilevel inheritance.
b) Perform a 450 rotation of triangle A (0,0), B(1, 1) ,
Q. 9
Write a program to show the function overloading.
C(5,2) about the origin.
Q. 10 Write a program to show JDBC.
Q. 3
a) Explain mapping from window to view port co-ordinate
M.P. Bhoj( Open) University, Bhopal -2006-07
Course code - CS-15
Project Assignment
Structural system analysis & design
Max.Marks - 10
Note :- Attempt any one allotted by the RD or course coordinator.
Q. 1
a) Design software requirement specification (SRS) for a
library management system.
b) What is information system ? Distinguish between DSS
and EIS.
Q. 2
a) Draw E-R diagram for a university having various
department, course and students.
b) Explain model driven development strategy.
Q. 3
a) Explain analysis & design phase.
b) Explain various tests for feasibility.
MCA Second year