of 4 /4

West Bengal State University Computer Application/BCA Part 1 Paper 1 Question Paper 2012

manojit

• View
208

3

Embed Size (px)

DESCRIPTION

West Bengal State University Computer Application/BCA Part 1 Paper 1 Question Paper 2012

Text of West Bengal State University Computer Application/BCA Part 1 Paper 1 Question Paper 2012

Digitized by Manojit

WBSU-CMAV-Part_1-2012 01

West Bengal State University

Part 1

Computer Application (Major)

Full Marks: 100 | Time: 4 Hour

1. Answer any nine questions from the following:

a) Define O (Big Ohh) with example.

b) Define subset with example.

c) Define complete graph with example.

d) Define trail with an example.

e) What is binary tree?

f) What do you mean by stack overflow?

g) Write circuit diagram of F(A,B,C) = A.B + A.C with minimal gates.

h) Convert: (5792)10 = (?)8

i) What is equivalence relation?

j) What do you mean by circuit? Cite an example.

k) Define encoder.

l) What do you mean by multiplexer?

[9x2]

Digitized by Manojit

WBSU-CMAV-Part_1-2012 02

Group A

2. Formulate the symbolic expression in words using

p : Lee takes Computer Science

q: Lee takes Mathematics

a) p ∨ q

b) p ∨ ¬ q

c) p ^ ¬ q

d) ¬ p ^ ¬ q

3. a) Prove that 7n - 1 is divisible by 6 for all n ≥ 1.

b) If A = {1, 3, 5} and B = {4, 5, 6} then find: A ∪ B, A ∩ B, A - B, B - A.

[4+(1+1+1+1)]

4. Using generating function solve the difference equation:

yn+2 - 6yn+1+ 8yn = 0, y0 =1, y1 = 4

[8]

5. Verify the proposition: (p ^ q) ^ ~(p ∨ q) is contradiction.

[8]

6. a) What is isomorphism? Give example.

b) Show that is graph G, the number of odd vertices is an even number.

[4+4]

Digitized by Manojit

WBSU-CMAV-Part_1-2012 03

Group B

7. Write and algorithm to add and multiply two polynomials. [5+7]

8. a) Sort the following list of elements using any algorithm based on Divide and Conquer method.

22 99 33 88 44 77 55 66 100 90

b) Also compute the average case complexity of the algorithm followed.

[8+4]

9. Write Kruskal’s algorithm to find minimum spanning tree. Illustrate your algorithm with an example.

[6+6]

10. Write algorithms for implementing stack with all three operations: create, push and pop using array.

[6+6]

Group C

11. Describe half adder using circuit realization and truth table. What are the differences between half adder and full adder?

[2+3+3]

12. a) Find the minimal POS expression using 4 variable k-map and also draw the circuit for the minimized expression.

F(A, B, C, D) = ∑(0, 1, 3, 11, 12, 13) + ϕ(2, 8, 9)

Digitized by Manojit

WBSU-CMAV-Part_1-2012 04

b) Is k-map always giving the unique form of minimized function of a function? State the reason.

[5+(1+2)]

13. NAND is a universal gate - explain. Design XOR and XNOR with the help of AND, OR and NOT gate only.

[2+3+3]

14. a) Convert the hexadecimal number A0B2 into binary, decimal and octal.

b) Draw the gate level master-slave flip-flop.

[3+5]

15. a) Draw a circuit diagram for a 3-bit decoder.

b) Prove that x + yz = (x + y) (x + z) using Boolean algebra.

[5+3]

Group D

16. Write short notes on any of the software development Models with proper example and diagram.

[10]

17. What do you mean by cost estimation of a project? Construct a model for explaining cost estimation of a project.

[10]

Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents
Documents