
DS1 FINAL EXAM REVIEWER
Authored by Yuki Minami
Computers
University
Used 1+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
30 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
If a relation R on a set A is symmetric, which of the following must be true?
For all a,b∈A, if aRb, then aRb holds.
For all a,b ∈ A, if aRb then bRa
For all a ∈ A, aRa
For all a,b, c ∈ A, if aRb and bRc, then aRc
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
How many different 5-letter words can be formed using the letters A, B, and C with repetition allowed?
150
120
125
243
Answer explanation
3^5 = 243
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
In how many ways can you select 3 out of 8 distinct objects?
336
56
112
672
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following relations on R (the set of all real numbers) is an equivalence relation?
{(x,y)∣x≠y}
{(x,y)∣x=y}
{(x,y)∣x≥y}
{(x,y)∣x≤y}
Answer explanation
Equivalence relation means that x and y are the same values, thus it should be x=y.
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
If you flip a coin 3 times, how many possible outcomes are there?
16
4
6
8
6.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
If you have 5 different hats and you want to choose 2 to wear in a specific order, how many ways can you do this?
30
25
20
10
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In a network of computers, each computer is a node and each direct connection between computers is an edge. The number of direct connections a computer has is referred to as what in graph terminology?
Adjacency
Path
Loop
Degree
Answer explanation
"direct connections" refer to the end-to-end points of the computer, which is also equivalent to degrees in graphs.
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?