Scribd
Upload
21 views

GCR Bca Sem2 C4

The document discusses topics in discrete structures theory including set theory, functions, relations, growth of functions, recurrence relations, graph theory, and propositional logic. It provides questions and explanations of key concepts in each topic.

Uploaded by

raukiraj37
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

GCR Bca Sem2 C4

The document discusses topics in discrete structures theory including set theory, functions, relations, growth of functions, recurrence relations, graph theory, and propositional logic. It provides questions and explanations of key concepts in each topic.

Uploaded by

raukiraj37
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

B.Sc.

COMPUTER APPLICATION
PAPER NAME - DISCRETE STRUCTURES THEORY
PAPER NO. - CORE COURSE - C4

SEMESTER - 2

TOPIC – INTRODUCTION TO SET THEORY

Very short answer type questions: (1 Marks)

1. What is set?
2. Define function.
3. Write A={x:x is a natural number less than 6} in roster form.
4. Write {2,4,6,......} in the set builder form.
5. What is empty set?
6. What is finite set?
7. What is infinite set?
8. What is subset?
9. What is power set?
10. What is universal set?
11. Write power set of A={1,2,3}.
12. Define relation.
13. What is Cartesian Product? Explain it with an example.
14. What is Venn diagram?
15. Choose the correct answer from the given alternatives.
I. A __________ is an ordered collection of objects.
a) Relation b) Function
c) Set d) Proposition
II. The set O of odd positive integers less than 10 can be expressed by _____________
a) {1, 2, 3} b) {1, 3, 5, 7, 9}
c) {1, 2, 5, 9} d) {1, 5, 7, 9, 11}
III. Power set of empty set has exactly _________ subset.
a) One b) Two
c) Zero d) Three
IV. What is the cardinality of the set of odd positive integers less than 10?
a) 10 b) 5
c) 3 d) 20
V. The set of positive integers is _____________
a) Infinite b) Finite
c) Subset d) Empty
VI. The union of the sets {1, 2, 5} and {1, 2, 6} is the set _______________
a) {1, 2, 6, 1} b) {1, 2, 5, 6}
c) {1, 2, 1, 2} d) {1, 5, 6, 3}
VII. Let set A ={1, 2} and B = {3, 4} then A X B (Cartesian product of set A and B) is
a) {1, 2, 3, 4} b) {(1, 3),(2, 4)}

GCR - BCA DEPTT. Page 1


B.Sc. COMPUTER APPLICATION
PAPER NAME - DISCRETE STRUCTURES THEORY
PAPER NO. - CORE COURSE - C4

c) {(3, 1), (4, 1)} d) {(1,3),(2,4),(1,4),(2,3)}


VIII. A function is said to be__________ if and only if f(a) = f(b) implies that a = b for all a and b in
the domain of f.
a) One-to-many b) One-to-one
c) Many-to-many d) Many-to-one
IX. The inverse of function f(x) = x3 + 2 is ____________
a) f -1 (y) = (y – 2) 1/2 b) f -1 (y) = (y – 2) 1/3
c) f -1 (y) = (y) 1/3 d) f -1 (y) = (y – 2)
X. Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x)
= 3x + 4. Then the composition of f and g is ____________
a) 6x + 9 b) 6x + 7
c) 6x + 6 d) 6x + 8

Short answer type questions: (5 Marks)

1. Explain different types of set.


2. Explain different types of relation.
3. If f(x)=x2+1 and g(x)=x+2 are functions from R->R. Then find (i)(f+g)(x), (ii)(f-g)(x),
(iii)(fg)(x), (iv)(f/g)(x), (v) f ᴏ g, (vi)g ᴏ f.

Long answer type questions: (15 Marks)

1. What are the basic operations on function? Explain with example.


2. What are the basic operations on set? Explain with example.

TOPIC – GROWTH OF FUNCTIONS

Very short answer type questions: (1 Marks)

1. List asymptotic notations used.


2. Find big Oh of f(n)=7n+8.
3. Find big Oh of f(n)=6n+nlogn.
4. Find big Oh of f(n)=3n3+7n+8.
5. Find big Oh of f(n)=2n+7n8+logn.

Short answer type questions: (5 Marks)

1. Explain big Oh notation with suitable example.


2. Explain omega notation with suitable example.
3. Explain theta notation with suitable example.
4. Explain properties of summation notation.
5. Explain properties of bounding summation.

GCR - BCA DEPTT. Page 2


B.Sc. COMPUTER APPLICATION
PAPER NAME - DISCRETE STRUCTURES THEORY
PAPER NO. - CORE COURSE - C4

Long answer type questions: (15 Marks)

1. Explain various asymptotic notations with suitable examples.

TOPIC – RECURRENCES

Very short answer type questions: (1 Marks)

1. What are two types of linear recurrence relation?


2. Find order of recurrence relation?
an = an-1 + 4an-2 + 4an-3
3. Is the following recurrence relation homogeneous?
an - 6an-1 + 9an-2 = 0
4. What are two solutions of non homogeneous recurrence relation?
5. Find first 4 terms of the recurrence relation.
an = 2an-1 + n + 1, a0 = 1
6. Write generating function.
7. What is sum of arithmetic series?
8. What is sum of geometric series?

Short answer type questions: (5 Marks)

1. What is recurrence relation?


2. What is linear recurrence relation?
3. Compare homogeneous and non homogeneous linear recurrence relation.
4. What is particular solution of non homogeneous recurrence relation?
5. What is master theorem for a recurrence relation?
6. Solve using master theorem:
T(n) = 4T(n/2) + n

Long answer type questions: (15 Marks)

1. Solve given homogeneous recurrence relation:


an = an-1 + an-2, n>=2, a0 = 0, a1 = 1
2. Solve recurrence relation:
an - 4an-1 + 4an-2 = 0, a0 = 1, a1 = 3
3. Solve homogeneous recurrence relation:
an = 3an-1 + 2n, a0 = 3
4. Solve given non homogeneous recurrence relation:
an+3an-1+2an-2=3n,n>=2 and a0=0, a1=1.
5. What is recurrence tree? Explain with suitable example.
6. Solve given recurrence relation using method of generating function:

GCR - BCA DEPTT. Page 3


B.Sc. COMPUTER APPLICATION
PAPER NAME - DISCRETE STRUCTURES THEORY
PAPER NO. - CORE COURSE - C4

an-7an-1+10an-2=0, n>=2 and a0=3, a1=3.


7. Solve given recurrence relation using method of generating function:
an-2an-1-3an-2=0, n>=2 and a0=3, a1=1.

TOPIC – GRAPH THEORY

Very short answer questions: (1 Marks)

1. What is a graph?
2. What is an edge in a graph?
3. Define degree of a vertex in a graph.
4. What is isolated vertex?
5. What is pendant vertex?
6. What is null graph?
7. What is a directed edge?
8. Write euler formula for planar graph.
9. Find number of edges in a complete graph.
10. Find number of edges in a tree graph with n nodes.
11. Draw expression tree of (4*5)*(6-2)+(7+5).
12. What is binary tree?
13. What is complete binary tree?
14. The sum of degree of vertices in a graph is always _______.
15. The number of vertices of odd degree in a graph is always _____.

Short answer type questions: (5 Marks)

1. What is multi graph?


2. What is subgraph?
3. Differentiate between walk, path and trail.
4. Explain euler path, euler circuit and euler graph.
5. Explain hamiltonian graph.
6. Give adjacency matrix representation of a graph with suitable example.
7. Give adjacency list representation of graph with suitable example.
8. What is a directed graph?
9. Define indegree and outdegree of graph with example.
10. Explain planar graph with example.
11. What is 4 colouring problem in a graph.
12. What is cut set?
13. What is cut vertices?
14. What is binary search tree?
15. Construct binary search tree of keys 10,56,78,34,2,3,6,8,90.
16. What is rooted tree?
17. What is weighted graph? Give one example.

GCR - BCA DEPTT. Page 4


B.Sc. COMPUTER APPLICATION
PAPER NAME - DISCRETE STRUCTURES THEORY
PAPER NO. - CORE COURSE - C4

Long answer type questions: (15 Marks)

1. Explain graph isomorphism with suitable examples.


2. What is spanning tree? Write kuskal’s algorithm for finding minimal spanning tree.
3. Explain graph traversal method with suitable example.
4. Explain preorder, postorder and inorderbinary tree traversal with suitable examples.
5. Write short notes on weighted graph, binary tree, height of binary tree and konigsberg bridge
problem.

TOPIC – PREPOSITIONAL LOGIC

Very short answer type questions: (1 Marks)

9. What is logical connectives?


10. Name the different logical connectives.
11. What is tautology?
12. What is contradiction?

Short answer type questions: (5 Marks)

8. Write short note on well formed formula.


9. What do you mean by equivalence. Give example.
10. Compare tautology and contradiction with example.
11. Verify that p ʌ q ʌ p is a contradiction and p → q ↔ p v q is a tautology.
12. Explain logical connectives with notation and truth table.

Long answer type questions: (15 Marks)

1. What do you mean by logical equivalence? Give different logical equivalences and show their
use in an example.

GCR - BCA DEPTT. Page 5

You might also like