Test BankChapter Seven (Software Engineering)
Multiple Choice Questions
1. Which of the following software engineering methodologies is the most rigid?
A. Incremental model
C. Extreme programming
B. Waterfall model
D. Evolutionary prototyping
ANSWER: B
2.
Department of Mathematics and Statistics
Foundations of Mathematics - MATH2350 - FALL 2011
TEST 1
24 October 2011
Time: 60 min.
This examination has EIGHT questions printed on this page. For each question, write your answer
clearly and if it is necessary,
Sultan Qaboos University College of Science
Department of Mathematics and Statistics
MATH3340, Fall Semester 2012, Quiz 2, Version B
Time allowed: 20 mins.
Total Marks: 20
Name: I.D.N0.:
1. [5 Marks] Use set builder notation and logical equivalences to sh
Fundamental Mathematics - 347 G1 Homework 7 Solutions
1. 7.1. For a counter example, choose x = n. Then ax bx 0 mod n for any a and b. To modify the statement, we need to rewrite it as follows: Noting that ax bx mod n is the same as saying n|(ax bx) or n|
Home Work to be submitted in week 14 in the class room and it will be assessed by a quiz.
Please do the following problems from the text book:
Page 85
Ex 26
Page 147
Ex 15
Page 280
Ex 10, Ex 36
Page 529
Ex 51, 53
Page 565
Ex 46(f), 49, 51
Page 580
Ex 44,
HW 2 Solutions: sections 1.3-1.6
1
Section 1.3
Problem 8 Translate these statements into English, where R(x) is x is a rabbit and H(x) is
x hops and the universe of discourse consists of all animals.
(a) x(R(x) H(x)
(b) x(R(x) H(x)
(c) x(R(x) H(x)
(d) x(R
SOLUTION SET 2DUE 2/6/2008
Please report any errors in this document to Ian Sammis ([email protected]).
Problem 1 (#2.1.8). Determine whether these statements are true or false.
a) cfw_
b) cfw_, cfw_
c) cfw_ cfw_
d) cfw_ cfw_
e) cfw_ cfw_, cfw_
f
Sultan Qaboos University - College of Science
Department of Mathematics and Statistics
MATH3340, Spring Semester 2012, Final Exam
Date: 23.05.2012
Total marks: 100
Time Allowed: 2.5 hour
THIS EXAM PAPER IS THREE PAGES. SHOW ALL YOUR WORK.
1. [4+4+2+6=16 M
Homework Assignment #3
Problem One (1.6.4)
Suppose that A=cfw_2, 4, 6, B=cfw_2, 6, C=cfw_4, 6, and D=cfw_4, 6, 8. Determine which of these sets are subsets of which other of
these sets.
Every set is a subset of itself
B is a subset of A
C is a subset of b
Solutions to Homework Set #6
CSE 260
Section 2.3
2. Determine whether f is a function from Z to R if
(a) f (n) = n.
This is not a function because the rule is not well-dened. We do not know whether f (n) = n or f (n) = n.
For a function, it cannot be both
COT 3100 Discrete Mathematics
Homework 1 Key
February 5, 2010
Problem 1
Section 1.2 #10. Show that each of these conditional statements is a tautology by using truth tables.
(a) (1 point) [p (p q )] q
p
T
T
F
F
q
T
F
T
F
p
F
F
T
T
pq
T
T
T
F
p (p q )
F
F