Scribd
Upload
44 views2 pages

DST Modelpaper 1

This document contains a model paper for the discrete structures subject exam with 3 parts - Part A with 6 short answer questions worth 2 marks each, Part B with 4 long answer questions worth 5 marks each, and Part C with 4 long answer questions worth 8 marks each. The exam is for the 1st semester BCA course and follows the new education policy scheme. It provides 18 total questions across the 3 parts to test students on topics like relations, matrices, graphs, binary search trees, and logic proofs.

Uploaded by

Sathish Stellar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views2 pages

DST Modelpaper 1

This document contains a model paper for the discrete structures subject exam with 3 parts - Part A with 6 short answer questions worth 2 marks each, Part B with 4 long answer questions worth 5 marks each, and Part C with 4 long answer questions worth 8 marks each. The exam is for the 1st semester BCA course and follows the new education policy scheme. It provides 18 total questions across the 3 parts to test students on topics like relations, matrices, graphs, binary search trees, and logic proofs.

Uploaded by

Sathish Stellar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Bangalore University

I Semester BCA Examination (NEP - SCHEME)


Subject: COMPUTER SCIENCE
PAPER: DISCRETE STRUCTURES
MODEL PAPER -1
Time: 2 hours Max. Marks: 60
Instruction: Answer any FOUR questions from each part

PART- A

I. ANSWER ANY 4 QUESTIONS


Each question carries 2 marks 4x2=8
1. Find X and Y if (2x-4,5)=(10,3y-4)
2. Define domain and Range of a relation
3. How many 3 digit numbers can be formed by using digits 1 to 9, if no digit is repeated.
4. Define Scalar matrix with an example.
2 1
5. Find the adjoint of A=
5 3
6. Define Hand shaking lemma theorem.

PART-B

II. ANSWER ANY 4 QUESTIONS


Each question carries 5 marks 4 x 5 = 20
7. Out of 20 members in a family , 12 like to take tea and 15 like to take coffee. Assume
the each one like at least one of the two drinks , how many like .
a. Both Coffee and tea
b. Only tea and not coffee.
c. Only coffee and not tea.
8. Prove that ~(p↔q)≡ ~[(p→ 𝑞) ^(𝑞 → 𝑝) is logically equivalent.
9. Explain Tower of Hanoi problem .
10. Solve using Cramer’s rule 3x+y+z=3 , 2x+2y+5z=-1, x-3y-4z=2
11. Define Graph. Explain any three types of graph.
12. Find the minimum weight spanning tree by PRIM’s algorithm
PART-C

III. ANSWER ANY 4 QUESTIONS


Each question carries 8 marks 4 x 8 = 32

13. a) Consider f:R R given by f(x)=4x+3. Show that f is invertible. Find inverse of f.

b) Prove that p v (q ^ r)↔ {(p v q) ^ (p v r)} is tautology. (4+4)

14 a) Write converse ,inverse and contra positive of the following “If a quadrilateral is
square then all the sides are equal”

b) How many words with or without meaning can be made from the letters of the letters
of the word MONDAY assuming that no letter is repeated, if
i) 4 letters are used at a time
ii) all the letters are used at a time (4+4)

15. a) Let us consider the following elements search an element 75 using Binary search
technique. Elements are 2,5,18,27,36,49,55,65,75,98.
b) Let A={2,4,6} and B={4,6,8} R⊆A X B by R={(2,4),(2,6),(2,8),(4,4),(6,6),(6,8)}
represent the relation by digraph. (6+2)

16. a) Solve the equation using matrix method 5x+2y=4 and 7x+3y=5.
2 5 3
1 2 3
b) If A = and B = 3 6 4 find AB (5+3)
4 5 6
4 7 5
3 −3 4

17 a) Find the inverse of matrix A= 2 −3 4


0 −1 1
b) A non Directed graph G has edges .Find the number of vertices, if the degree of each
vertex is 2. (6+2)

18 Construct binary search tree using below numbers and perform preorder, inorder and
postorder traversals 10,90,40,60,30,20,80,60,50 (8)

**********BEST OF LUCK**********

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy