Scribd
Upload
13 views

Discrete Mids Finals

This document outlines the mid-term examination for the Discrete Structures course in the BSCS program, detailing the structure and content of the exam. It includes two sections with a total of 38 marks, covering topics such as disjunction, contradiction, DeMorgan's Law, sequences, arrangements, logical equivalences, and recursive functions. The exam is designed to assess students' understanding of fundamental concepts in discrete mathematics.

Uploaded by

Ashi Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

Discrete Mids Finals

This document outlines the mid-term examination for the Discrete Structures course in the BSCS program, detailing the structure and content of the exam. It includes two sections with a total of 38 marks, covering topics such as disjunction, contradiction, DeMorgan's Law, sequences, arrangements, logical equivalences, and recursive functions. The exam is designed to assess students' understanding of fundamental concepts in discrete mathematics.

Uploaded by

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

Department of Computer Science

Mid Term Examination

Program: BSCS. Semester: 1st


Course: Discrete Structures Course code: CCC-3

Instructor: Sir Anser Abbas Session (2023_2027)


Time Duration: 3 hours Total Marks: 18
Section I

Give to the point answers to these questions (16)


1. Define Disjunction with examples
2. What is Contradiction & Contingency
3. State Demorgan’s Law with mathematical representation (2)
4. Find term a7 & a8 of the sequence when “an=7+4n
5. Do as directed (2)
a. C(12,6)
b. P(8,5)
6. Prove P →(P˅Q) ≡ T

Section II (5x4=20)

1. Find arrangements of all six 5 letters in word “APPLE”


2. Prove through logical equivalent laws
¬[r ˅(q˄(¬r → ¬p))] ≡ ¬r˄(p ˅ ¬q)
3. Find f(1),f(2),f(3),f(4) if f(n) is defined recursively by f(0)=3
& n=1,2,3,4
f(n+1)= -2f(n)
4. How many positive integers with exactly four decimal digits i.e.
positive integers b/w 1000 & 9999 inclusive
• Have distinct digits
• Are divisible by 9
5. Draw membership table for “A∩(BUC)=(A∩B)U(A∩C)”

You might also like