Scribd
Upload
122 views

Vit Assignment

This document contains an assignment for a computational techniques course consisting of 7 questions. Question 1 asks students to (a) explain 5 basic connectives using truth tables and (b) symbolize and prove inconsistent statements. Question 2 asks students to prove statements using truth tables. Question 3 defines concepts related to lattices, Boolean algebras, and properties. Question 4 asks students to obtain equivalent normal forms for logical expressions. Questions 5-6 cover graph theory concepts like paths, connectivity, degrees, and trees. Question 7 defines graph types and graph theory concepts. Question 8 asks students to solve a traveling salesman problem and explain chromatic numbers.

Uploaded by

Ravi Tej Gunisetty
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
122 views

Vit Assignment

This document contains an assignment for a computational techniques course consisting of 7 questions. Question 1 asks students to (a) explain 5 basic connectives using truth tables and (b) symbolize and prove inconsistent statements. Question 2 asks students to prove statements using truth tables. Question 3 defines concepts related to lattices, Boolean algebras, and properties. Question 4 asks students to obtain equivalent normal forms for logical expressions. Questions 5-6 cover graph theory concepts like paths, connectivity, degrees, and trees. Question 7 defines graph types and graph theory concepts. Question 8 asks students to solve a traveling salesman problem and explain chromatic numbers.

Uploaded by

Ravi Tej Gunisetty
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

School of Advanced Sciences

Assignment
Course Title: Computational Techniques

(1) (a) State five basic connectives and explain them with the use of truth tables?
(b) Symbolize the following statements and prove that they are inconsistent.
(i) If Rama gets his degree, he will go for a job.
If he goes for a job, he will get married soon.
If he goes for higher study, he will not get married.
Rama gets his degree and goes for higher study.
(ii) If Raja misses many classes, then he fails in the final examination.
If Raja fails in the final examination, then he is uneducated.
If Raja reads a lot of books, then he is not uneducated.
Raja misses many classes and reads a lot of books.
(iii) John will get his degree if and only if he passes all the examinations.
he will pass all the examinations, if and only if he works hard.
He will be unemployed, if and only if he does not get his degree.
John works hard if and only if he is employed.
(2) Prove the following with the use of truth tables.
(a) Simplify the following (P Q R) (P T Q) (P T R)
(b) Show that (P Q) ( P ( P Q)) ( P Q)
(c) Show that the following is an implication
(P (Q R)) = (P Q) (P R)
(d) Show that the following is an implication (P Q) Q = (P Q)
(e) (P (Q S)) ( R P ) Q = R S
(3) Define the following with relevant examples.
(a) POSET, TOSET, lattice, sublattice, direct product of lattices,
homomorphism of lattices
(b) Complete lattice, complement lattice, bounded lattice, distributive lattice
(c) Boolean algebra, sub-Boolean algebra, boolean function
(d) State and prove isotonic, distributive, modular inequalities in a lattice
(e) Show that every distributive lattice is modular, but not conversely.
(f) Show that a chain of three or more elements is not complemented.
(4) Obtain equivalent disjunctive normal forms and conjunctive normal forms for
(a) [(P Q) R]
(b) [(P Q) R] (P R)
(c) P (Q R)
(d) (P Q) R

(5) Explain the following with relevant examples


(a) Path, reachability,in a graph
(b) Weakly connected, unilateral and strongly connected in a graph
(c) Adjacency and path matrix in a graph
(6) (a) Prove that the sum of the degrees of the vertices of any finite graph is even.
(b) Prove that the number of odd degree vertices is even in a graph G
(c) Show that a tree with n vertices has exactly n-1 edges.
(7) (a) Simple, complete, bipartite, complete bipartite graphs.
(b) Chromatic number, matching, complete matching, maximal matching
(c) show that in a complete graph of n vertices there will be n(n 1)/2 vertices
(8) (a) Suppose we have three houses and three utility outlets ( gas, water and
electricity) situated so that each utility outlet is connected to each house. Is
it possible to connect each utility to each of the three houses without lines
or mains crossing. If possible find the chromatic number of the graph with
respect to vertex, edge and region proper coloring.
(b) A salesman based in Seattle needs to visit Salt Lake City, Houston, Dallas,
and Memphis. What sequence of trips would consist of the least total
distance traveled? In other words, find the optimal solution to the Traveling
Salesman Problem for these five cities.
From
To
Distance (miles)
Seattle
Salt Lake City 700
Seattle
Houston
1891
Seattle
Dallas
1683
Seattle
Memphis
1872
Salt Lake City Houston
1201
Salt Lake City Dallas
1003
Salt Lake City Memphis
1256
Houston
Dallas
224
Houston
Memphis
484
Dallas
Memphis
419
Explain chromatic number with respect to vertex, edge and region in the
above graph.

You might also like