Scribd
Upload
234 views2 pages

Mathematical Foundation of Computer Science

This document is the exam paper for a Mathematical Foundations of Computer Science course. It contains 7 questions testing a range of topics: 1) Incidence matrices for graphs and calculating edges and faces in a planar graph. 2) Proving properties of Euler cycles and algorithms for shortest paths. 3) Verifying inequalities using induction and rules of inference. 4) Determining validity of arguments using logic. 5) Solving recurrence relations and finding recurrence relations for sequences. 6) Classifying grammars and designing finite state machines. 7) Short notes on De Morgan's laws and accepting states in finite automata.

Uploaded by

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

Mathematical Foundation of Computer Science

This document is the exam paper for a Mathematical Foundations of Computer Science course. It contains 7 questions testing a range of topics: 1) Incidence matrices for graphs and calculating edges and faces in a planar graph. 2) Proving properties of Euler cycles and algorithms for shortest paths. 3) Verifying inequalities using induction and rules of inference. 4) Determining validity of arguments using logic. 5) Solving recurrence relations and finding recurrence relations for sequences. 6) Classifying grammars and designing finite state machines. 7) Short notes on De Morgan's laws and accepting states in finite automata.

Uploaded by

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

POKHARA UNIVERSITY

Level: Bachelor Semester – Spring Year : 2006


Programme: BE Full Marks: 100
Course: Mathematical Foundations of Computer Time : 3hrs.
Science
Candidates are required to give their answers in their own words as far
as practicable.
The figures in the margin indicate full marks.
Attempt all the questions.

1. a) Write the incidence matrices of a complete graph K 6 and a complete 8


bipartite graph K3, 4.
b) A connected, planar graph has nine vertices having degrees 2, 2, 2, 3, 7
3, 3, 4, 4 and 5. How many edges are there? How many faces are
there?
2. a) Prove that a connected graph with one or two vertices, each of which 8
has even degree, has an Euler cycle.
b) Write an algorithm that finds the lengths of the shortest paths from a 7
given vertex to every other vertex in a connected weighted graph G.
3. a) Using induction, verify that the inequality 2n + 1  2n, n = 3, 4, 5, 7
6… 8
b) Give an argument using rules of inference to show that the conclusion
follows from the hypotheses.
Everyone in the Discrete Mathematics class loves proofs. Someone in the
Discrete Mathematics class has never taken calculus. Conclusion:
Someone who loves proofs has never taken calculus.
4. a) Determine the validity of the following arguments. 7
If the colonel was out of the room when the murder was committed,
then he couldn't have been right about the weapon used. Either the
butler is lying or he knows who the murderer was. If Lady Barntree
was not the murderer, then either the colonel was in room at the time
or the butler is lying. Either the butler knows who the murderer was
or the colonel was out of the room at the time of the murder. The
policeman deduced that if the colonel was right about the weapon,
then Lady Barntree was the murderer. Was he right?
b) What are the differences between proof by contradiction and proof by 8
contra-positive?
5. a) Solve the recurrence relation a n = √an-2 / √an-1 with an initial conditions 8
a0 = 8, a1 = 1/(2√2) by taking the logarithm of both sides and making
the substitution bn = logan.
b) Find a recurrence relation and initial conditions that generate a
7
sequence that begins with the given terms 1, 1, 2, 4, 16, 128, 4096, …
6. a) Determine whether the following grammar G = (N, T, P, σ) is 8
context-sensitive, context-free, regular or none of these. Give all
characterizations that apply. Where, A finite set T of terminal
symbols = {a, b, c}, a finite set N of non-terminal
symbols = {σ, A, B} with productions P = {σ → AB, AB → BA,
A→ aA, B →Bb, A→ a, B → b} and starting symbol σ.
b) Design a finite state machine M = (I, O, S, ƒ, g, σ) and draw its 7
transition diagram, which is capable of producing output string
"101000100001" from the input string "aabbaabbaaab".
7. Write short notes on the following: 52
a) De-Morgan’s laws for logic
b) Accepting state in finite state automata.

You might also like