MAT2DMX Discrete Mathematics For Computer Science Assessment

Question 1 (Logic): 1 + 1 + 1 + 1 marks

Consider the following propositions:

p: “Python is open source”,

q: “Assembly language is hard”.

Write each of the following propositions in English

For example: is “Python is open source, or assembly language is hard”.

Note: You sentences must be grammatically correct. Do not use parenthesis () in your answer. For negation, the following structure is NOT ALLOWED: “It is not true that…”. You can also simplify the compound proposition before translating to English.

Question 2 (Logic: symbolic forms): 1 + 1 + 1 + 1 marks

Consider the following propositions:

p: “Dell is a US company”,

q: “Java is an OOP language”.

Convert each of the following propositions to symbolic expressions using symbols p, q and connectives ? (or), ? (and), ? (not), and ? (implies).

1. Java is an OOP language, and Dell is not a US company.
2. If Java is not an OOP language, then Dell is not a US company.
3. Dell is not a US company, or Java is not an OOP language.
4. Neither Dell is a US company, nor Java is an OOP language.

For example: is a symbolic expression corresponding to “Dell is a US company, or Java is an OOP language”.

Question 3 (Logic: truth tables) 1 + 2 marks

1. Draw a truth table for the expression.
2. Draw a truth table for the following two statements r ? (and (r ? (Include in only one table). Then use the obtained truth table to decide whether the two statements equivalent. Give your conclusion after the table.

Note:

1. Your tables should include all important sub expressions. Each column should call only one or two columns calculated before. A table with only columns for variables and one column for the final expression will not get full marks. Ideally, you should have 7 columns for Question 3.a, 8 columns for Question 3.b.
2. You should use only one table for Question 3.b.

Question 4 (Equivalent expressions): 2 + 2 marks

Verify if the two expressions below are equivalent. and Using following TWO methods:

1. Algebraic method (show rules for each obtained expression)
2. Using Input/Output table (Table needs to include columns for all literals and terms).

You should use only one table for question (b). Your table should have one column for each term. There should be at least 10 columns (3 literals, 5 terms, and 2 expressions).

In both question (a) and (b), give your conclusion.

Question 5 (Disjunctive Normal Form): 2 + 2 marks

Find Disjunctive Normal Form of the expression using the following TWO methods:

1. Algebraic method. Show rules for each obtained expression.
2. Using Input/Output table (Table needs to include columns for all literals and terms).

You should use only one table for question (b).

The two methods can be found in Section 5.1.2 (Week 5 – Handout) and Section 4.3.6 (Week 4 – Handout).

Question 6 (Boolean function): 2 marks

Write down an expression corresponding to the given function in Table 1 below:

Question 7 (Karnaugh maps and minimal expressions): 2 + 2 marks

Use Karnaugh maps and Karnaugh Map Algorithm to find minimal expressions for the following Boolean expressions:

Note:

Your answer needs to show maps and loops. Answer without maps and loops will NOT get marks.

Question 8 (Boolean expressions and logic circuits): 2 + 2 marks

• Draw a logic circuit for the following Boolean expressions. Do not simplify the expressions.

Label each gate with corresponding expression.

1. (xy+yz)x+z(this can be written as (xy+yz)(x+z))
2. xyz+xy(y+z)

Note:

there should be NO more than 2 inputs for each gate. For example, the term will need 2 gates to represent.

Question 9 (Graphs: degrees, Eulerian paths, Eulerian circuits): 1 + 1 + 2 marks

• Decide if the following graph has a Eulerian circuit. If No, justify. If Yes, give a circuit. A Yes/No answer only will not get mark.

• There are four graphs G1,G2,G 3,G4 whose degrees of vertices are as follows.

G1:{4,2,6,4,2,6,4},
G2:{2, 3, 4, 5, 6, 2},
G3:{2,3, 4, 5, 2, 7},
G4:{2, 4, 2, 4, 5, 7}.

Verify if each of four graphs G1,G2, G3,G4 has a Eulerian path or/and circuit? Explain (answer without explanation will not get marks).

Note:

You are advised NOT to draw graphs for this question. You should use conditions of the existence of Eulerian path or/and circuit.

Question 10 (Graphs: adjacency matrix): 1 + 1 marks

• Draw the graph corresponding the given adjacency matrix below:

Question 11 (Graphs: isomorphisms): 3 marks

Find an isomorphism between the following two graphs by filling the corresponding maps into Table 2 below (Explanation is not required).

Question 12: 2 marks

In this question, you are asked to generate a true table for the proposition (?in an Excel file and submit it separately from the Word file for other questions.

Table 3 below is a screenshot of a sample of solution from an Excel file. In such a file, values in columns B, C, and D (rows 3-10) are manually filled and values in column E (rows 3-10) are calculated by excel logical functions.

If values in columns B, C, and D are manually changed, then values in the column E will be automatically updated based on functions used. For example, Table 4 below shows how column E is updated with new values from columns C, B, D.

Your table supposes to have 8 rows of values. You can insert one or more columns for simpler propositions. In that case, make sure they all uses functions, not hard coding. Also new columns should be inserted before the final result column. For example, you can have as Table 5 below

Are you struggling to keep up with the demands of your academic journey? Don't worry, we've got your back! Exam Question Bank is your trusted partner in achieving academic excellence for all kind of technical and non-technical subjects.

Our comprehensive range of academic services is designed to cater to students at every level. Whether you're a high school student, a college undergraduate, or pursuing advanced studies, we have the expertise and resources to support you.

To connect with expert and ask your query click here Exam Question Bank