# HNBGU BCA First Semester Previous Year 2013-14 Question Papers

**Programming in C**

**Note: Attempt any five questions. All questions carry
equal marks.**

- (a) Explain the basic structure of C program.

(b) Define C tokens and explain it with examples - (a) Write a programme to find the factorial of any number using recursion function.

(b) Write a C programme to find the reverse of any number. - (a) Explain the various data types with example.

(b) Write a C program to multiply two matrix. - (a) What are various functions used in C programming? Explain it with examples.

(b) Differentiate between the following:

Structure and Union

Call by value and call by reference - (a) Explain the various string operations with example.

(b) Write a programme to join the two strings without using string function. - (a) Define a structure, Create a structure that can describe a hotel with information as name, address, room, room charge.

(b) Write a programme to sort the elements of array using pointer. - Write short notes on any four of following.

- Various operator in C
- Pointer to function
- Storage classes
- C preprocessor
- Multidimensional arrays
- Decision making statement

**Fundamental of computers**

**Note: Attempt any five questions. All questions carry
equal marks.**

- (a) What are the characteristics of fourth generation computers?

(b) What do you mean by CPU ? define the block diagram of the computer. - (a) Differentiate any two of the following:

Ram and rom

Top down and bottom up approach of programming

LAN and WAN

(b) What is an Algorithm? Write an algorithm to find the factorial of a number. - (a) Why do you need and operating system? Describe the objective of operating system.

(b) What is flowchart? What are the symbols used for drawing a flowchart? Draw a flowchart to sum first 50 natural numbers. - (a) What do you mean by computer program? What are the different types of program files?

(b) What are the different data types? Explain in detail. - (a) What are the characteristics of a good program?

(b) What do you mean by debugging and testing? Explain the different types of testing. - (a) Differentiate between high level, machine level and assembly level languages.

(b) What do you mean by printers? Explain the different kinds of printers with their usages. - Write short notes on any four the following:

- Optical storage devices
- VDU
- TCP/IP
- Internet and Its protocol
- Data communication

**Mathematical foundation of Computer science**

**Note: Attempt any five questions. All questions carry
equal marks.**

1(a) If Q be the set of rational
numbers and a function f:Q->Q be defined by f(x) = 2x+3, show that f is
bijective. Find a formula that defines the inverse function.

(b) Define a relation and a function. Give and
example of a relation which is reflexive and transitive but not symmetric.

2(a) Show that the set N of all
natural numbers is not a group with respect to addition.

(b) Show that the set of all n, nth roots of
unity forms a finite abelian group of order n with respect to multiplication

3(a) Decompose the following
permutation into transposition:

(i)
1 2 3 4 5 6 7

6 5 2 4 3 1 7

(ii)
1 2 3 4 5 6 7 8

3 1 4 7 2 5 8 6

(b) If a group G has four elements,
show that it must be abelian.

4(a) Five the two numeric functions
and such that neither asymptotically dominates nor asymptotically dominates

(b) Solve the
recurrence relation a_{r}-3a_{r-1}+2a_{r-2}=6,
satisfying the initial conditions a_{0}=1 and a_{1}=4.

5(a) Solve the
difference equation:

a_{r+2}-2a_{r+1}+a_{r}=3r +5

(b) If f is a homeomorphism
of a group G into a group G’ with kernel K, then K is a normal subgroup of G.

6 Prove that each of
the following is a tautology:

(i)
[(p->q)^(q->r)]->(p->r)

(ii)
[p^(p->q)]->q

7 Write the form of the negation of
each of the following:

(i)
The corresponding sides of two triangles are
equal if and only if the triangles are congruent.

(ii)
If the number x is less than 10, then there is a
number y such that x^{2}+y^{2}-100 is positive

8 (a)If X be the set of factors of
12 and if ≤
be the relation divides, i.e., x ≤ y if and only if x | y. Draw the Hasse
Diagram of (X,≤)

(b) Prove that any right (left )
cosets of a subgroup are either disjoint or identical

## 0 Comments