Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-01
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
SECTION – B
6. Use the following words in one sentence each to bring out the difference in
their meaning. 2
BC A -01
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-02
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
3. What is mail merge? How envelopes can be print by using Mail Merge
command? 6
SECTION – B
6. Differentiate GUI & CUI. List the advantages of GUI over CUI. 2
BCA-02
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-03
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
2. Draw and explain the block diagram of a digital computer system. Match
the diagram with the different parts of a PC System? 6
SECTION – B
BCA-03
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-04
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
1.a) Define left hand derivative (L.H.D.) and right hand derivative (R.H.D.) of a
function with example. Give an example whose l.h.d. and r.h.d. exists but
derivative does not exists. : 6
then show that f and g are not continuous of 1/2 but (f + g) is continuous
at x = 1/2.
2.a) Describe Lagrange's Mean value theorem and check that for f(x) = x - | x |
Conclusion of Lagrange's mean value theorem does not holds. 6
b) Find the radius and centre of the sphere passing through (1, 0, 0) , (0, 1,
0), (0, 0, 1), and
FG 1 , 1 1 IJ
H 3 3 3K
3. a) Integrate the following: 3+3
z z
π /2
tan x
(i ) e x (log cos x + tan x ) dx (ii ) dx
tan x + Sec x
o
Sin x
b) Differentiate y = (cos x ) + (tan x ) Sec x
SECTION – B
z
π
Sin x
5. Evaluate by using simpson's 1/3rd rule of dx , n = 4 2
x
o
x2 x3 x4
6. Show that . log e (1 + x ) = x − + − .... by Maclaurian's Method. 2
2 3 4
z
1
7. Integrate x + x 2 dx 2
0
8. Expand Cos6 θ - Sin6 θ in terms of the cosines of multiples of θ. 2
BCA-04
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-05
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
2. Explain Quick Sort method. What is the advantage of quick sort over all
other methods of sorting? 6
(i) do-while
(ii) Switch
(iii) for
SECTION – B
5. Write a C program for Insertion sort and analyze them with the help of
algorithm and flow chart. 2
a) Recursion.
b) On-notation. .
BCA-05
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-06
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
2.a) Explain the page fault handling routine in a computer system employing
virtual memory. 6
5. Explain the following Unix commands: (a) CP (b) Chmod (c) sort (d)
vi (e) Is (f) tee. 2
6. Explain the terms : Process Switch and context switch ? How are they
related? . 2
(a) pwd (b) man (c) Hy (d) shy (e) who (f) grep.
9. What are the criteria used for comparing various. CPU scheduling
algorithms? Differentiate between Preemptive and Nonpreemptive
scheduling policies. 2
BCA-06
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-07
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
d) Bill of material.
SECTION – B
BCA-07
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-08
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
SECTION – B
b) SQI
c) DDL
BCA-08
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-09
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
SECTION – B
5. Explain the various types of sequential logic circuits using their logic
diagram and truth tables. 2
6. What are the basic functions of data transfer techniques? Differentiate the
various techniques in brief. . 2
a) Role of Interrupts
b) Pipelining
BCA-09
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-10
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
1. What is a form? What are the form properties? Create a new form with
new name "TESTFORM". 6
2. What is a custom control? Load any picture on picture control. Set its
properties as per your choice. 6
SECTION – B
9. Create a project and save with name "TESTPROJECT". Write code such
that whenever project is loaded it gives you beep sound. 2
BCA-10
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-11
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
SECTION – B
a) MPEG
b) MP3
BCA-11
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-12
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
3. Design the databases used for "Library Management System" that will
make accessing books and author details in a library easier and more
efficient. 6
SECTION – B
6. What are the roles of MS-Access in constructing the database? Discuss the
other functions of MS-Access in brief. 2
a) Redumdancy
b) SQL
BCA-12
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-13
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
SECTION – B
i) Router
ii) Gateway
iii) J P address
iv) LAN
BCA-13
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-14
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
a) Retransmission Times
b) Time out.
c) Pensistence times.
d) Keepaline times.
3. Describe the Nagle's Algorithm. How is differ from silly window syndrome
problem? .
SECTION – B
6. What do you mean by Sockets? What is the difference between client and
server sockets? 2
(a) Socket ( ) (b) accept ( ) (c) Bind ( ) (d) Sockaddr ( ) (e) Close ()
(f) Writer ( )
BCA-14
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-15
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
a) Deadlock prevention
b) Deadlock avaidance
2. Define process scheduling . What is the role of the scheduler? List all the
schedulers available along with their working principles. 6
SECTION – B
4. What is paging ? Explain the principle of its operation with the help of a
diagram. 2
i) Disk controller.
BCA-15
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-16
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
1. Derive Simpson's 1/3rd and 3/8th rule for numerical integration. Which is
z
1
1
better and why? Evaluate dx by 1/3rd and 3/8th rule by dividing the
0
1+ x2
interval into 6 equal parts. 6
SECTION – B
x 0 1 2 3 4
y 1 0 3 10 21
4 1 0
A = −2 1 1
5 −2 4
7. Find the smallest root of the equatin Xex = 1 correct to 4 decimal places by
any known method. 2
x 1 3 4 2
y -8 18 25 -1
BCA-16
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-17
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
1. Define the terms : Data hiding, Data encapsulation, Data Abstraction and
Polymorphism, in detail. 6
2.a) What is the difference between over loading and overriding functions? 6
SECTION – B
9. What are static variables and functions? HOw they are differ from instance
variables and functions? 2
BCA-17
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-18
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
b) Design Moore and Mealy machine for input from (0 + 1 + 2) print the
residue module of '5' of the input treating it as ternary (base 3 with digits 0,
1, 2) number.
L = ( a + b) x b (a + bb) . 6
r = a ( a + b)* ab
S→ a/absb/aAb
A → bs / a AA b
is ambiguous.
BCA-18
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-19
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
2. Define Software Development life cycle (SDLC) , What is spiral model. List
the advantage and disadvantage of waterfall model. 6
SECTION – B
BCA-19
mRrj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;]
bykgkckn
Assignment – 2010-2011
Bachelor in Computer Application (BCA)
SUBJECT CODE : BCA-20
DeefOekeâlece Debkeâ : 30
MAXIMUM MARKS : 30
Section —A
SECTION – B
BCA-20