Scribd Logo
Upload

Welcome to Scribd!

  • 68 views

    Final Exam CS202 - Fall 20 - 21

    Uploaded by

    tmees tmeesa
    This document contains an examination paper for a Discrete Structures course. The paper has 4 questions testing various concepts: 1) Logical equivalences, validity of argument forms, and set theory concepts. 2) Logical equivalences, converses and inverses of conditional statements, and mathematical proofs. 3) Summations, products, simplifying expressions, and proving an equality involving derivatives. 4) Cartesian products, set operations, describing address spaces in IPv4, and calculating available IPv4 addresses.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Final Exam CS202 - Fall 20 - 21

    Uploaded by

    tmees tmeesa
    68 views4 pages
    This document contains an examination paper for a Discrete Structures course. The paper has 4 questions testing various concepts: 1) Logical equivalences, validity of argument forms, and set theory concepts. 2) Logical equivalences, converses and inverses of conditional statements, and mathematical proofs. 3) Summations, products, simplifying expressions, and proving an equality involving derivatives. 4) Cartesian products, set operations, describing address spaces in IPv4, and calculating available IPv4 addresses.

    Original Description:

    Exam

    Original Title

    Final Exam CS202 - Fall 20--21

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains an examination paper for a Discrete Structures course. The paper has 4 questions testing various concepts: 1) Logical equivalences, validity of argument forms, and set theory concepts. 2) Logical equivalences, converses and inverses of conditional statements, and mathematical proofs. 3) Summations, products, simplifying expressions, and proving an equality involving derivatives. 4) Cartesian products, set operations, describing address spaces in IPv4, and calculating available IPv4 addresses.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    68 views4 pages

    Final Exam CS202 - Fall 20 - 21

    Uploaded by

    tmees tmeesa
    This document contains an examination paper for a Discrete Structures course. The paper has 4 questions testing various concepts: 1) Logical equivalences, validity of argument forms, and set theory concepts. 2) Logical equivalences, converses and inverses of conditional statements, and mathematical proofs. 3) Summations, products, simplifying expressions, and proving an equality involving derivatives. 4) Cartesian products, set operations, describing address spaces in IPv4, and calculating available IPv4 addresses.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

    Arab Academy for Science, Technology & Maritime Transport

    College of Computing and Information Technology

    EXAMINATION PAPER

    Department : Computer Science Date : 4 /2/2021


    Course Title : Discrete Structure Time allowed : 2 hours
    Course Code : CS202 Start Time : 09 :00 am
    Lecturer : Associate Professor Dr. Hatem Khater

    Student's name : --------------------------- Reg.# : -------------------

    Question # Marks
    Available Actual
    1 10

    2 10

    3 10

    4 10

    Lecturer Name : Associate Professor Dr. Hatem Khater


    Signature :
    Date:
    MPC6/1-1
    Arab Academy for Science, Technology and Acad. Year : Fall 2020/2021
    Maritime Transport-College of Computing & Semester : 3
    Information Technology--Heliopolis Department :
    No. of Pages : 4 Time Allowed : 120 Mins
    No. Of Questions : 4 Date : 4 / 2 / 2021
    Examiner : Dr. Hatem Khater
    CS202 Discrete Structures (Final Exam) (40 Points)
    Answer the following questions:

    Question (1) (10 Points)


    A. Show that following equality holds

    B. Show that the statement forms ~(p  q) and ~p  ~q are not logically equivalent.

    C. Determine whether the following argument form is valid or invalid by drawing

    a truth table, indicating which columns represent the premises and which
    represent the conclusion, and annotating the table with a sentence of
    explanation.
    p → q ∨ ∼r
    q→p∧r
    • p→r
    D. Let D = {1, 2, 3, 4, 5}, and consider the following statement,
    Please show that the following statement is true

    Question (2) (10 Points)

    A. Use simplifying theorem to verify the logical equivalence :

    B. Write the converse and inverse of each of the following statements:


    If today is Easter, then tomorrow is Monday.
    C. At some time you may have been shown a “mathematical trick” like the
    following. You ask a person to pick any number, add 5, multiply by 4, subtract
    6, divide by 2, and subtract three times the original number. Please show their
    final result. Prove how does this “trick” work?
    D. Prove that the following formula by mathematical induction:

    n
    n ( n + 1)( 2 n + 1)
    i 2
    =
    6
    i =1

    CS202 Discrete Structures Page1/1 MPC6/1-1


    Question (3) (10 Points)
    A. Let ak = k + 1 and bk = k − 1 for all integers k. Write each of the following
    expressions as a single summation or product:

    a. b.

    B. Simplify the following expressions:

    C. Does 5n - 3n Divisable by 2?
    D. Prove that :

    (dn/dxn ) (cos ax) = an (cos (ax=n. ∏ /2))

    Question (4) (10 Points)

    A. What is the Cartesian product A × B × C, where A = {0, 1}, B = {1, 2},

    and C = {0, 1, 2}?

    B. prove that A ∩ B = A ∪ B (Using membership table)

    C. Let A = {1, 2, 3} and B = {u, v}

    1- Find A × B
    2- Find B × A
    3- Find B × B
    4- How many elements are in A × B, B × A, and B × B?
    5- Let R denote the set of all real numbers. Describe R × R.

    D. In version 4 of the Internet Protocol (IPv4)

    The internet address is a string of 32 bits as follows:


    Class A address [ 0 -netid(7 bits) – hostid (24 bits)]
    CS202 Discrete Structures Page1/2 MPC6/1-1
    Class B address [ 10 -netid(14 bits) – hostid (16 bits)]
    Class C address [ 110 -netid(21 bits) – hostid (8 bits)]
    Class D address [ 1110 –multicast address (28 bits)]
    Class E address [ 11110 - address (27 bits)]
    Where, Network number(netid) -host number(hostid)
    Restrictions
    ▪ 1111111 is unavailable in netid
    ▪ All 0s and all 1s are unavailable in hostid
    ▪ The computer on the Internet has either class A or B or C addresses.
    How many different IPv4 addresses are available for computers on
    the Internet?

    Best Wishes

    CS202 Discrete Structures Page1/3 MPC6/1-1

    You might also like