Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Document preview thumbnail
Preview 4 out of 55 pages
Exam (elaborations)

C960 Discrete Mathematics II | 2026 Pre-Assessment Exam Prep | 55+ Practice Questions & Detailed Solutions | Algorithms, Big-O, Cryptography, Probability & Recurrence Relations | Western Governors University (WGU)

Document preview thumbnail
Preview 4 out of 55 pages

Prepare for the C960 Discrete Mathematics II course at Western Governors University (WGU) with this comprehensive 2026 Pre-Assessment (PA) Exam Questions and Answers study guide. This resource contains 55+ carefully selected practice questions with detailed step-by-step solutions covering every major competency assessed in the C960 course. Topics include algorithm design and analysis, algorithm efficiency, asymptotic notation, Big-O complexity, counting principles, permutations, combinations, multisets, probability theory, conditional probability, Bayes' Theorem, expected value, number theory, modular arithmetic, RSA encryption, Euclid's Algorithm, binary number systems, recursion, mathematical induction, recurrence relations, and recursive algorithms. Designed specifically for students preparing for the C960 Objective Assessment (OA) and Pre-Assessment (PA), this document reinforces both conceptual understanding and problem-solving techniques through fully worked examples. Each solution demonstrates the mathematical reasoning required to solve algorithmic, combinatorial, probabilistic, and cryptographic problems commonly encountered in discrete mathematics and computer science courses. Whether used for revision, self-assessment, or exam preparation, this guide provides an efficient review of the most frequently tested concepts while strengthening analytical thinking and mathematical proof skills essential for success in WGU's computer science curriculum. The material aligns closely with the concepts presented in the following internationally recognized academic references: Kenneth H. Rosen. Discrete Mathematics and Its Applications (8th Edition). McGraw-Hill Education. Susanna S. Epp. Discrete Mathematics with Applications (5th Edition). Cengage Learning. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein. Introduction to Algorithms (4th Edition). MIT Press. Douglas R. Stinson & Maura Paterson. Cryptography: Theory and Practice (4th Edition). CRC Press. Richard Johnsonbaugh. Discrete Mathematics (8th Edition). Pearson. Donald E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley. Rivest, R. L., Shamir, A., & Adleman, L. (1978). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21(2), 120–126. Bayes, T. (1763). An Essay towards Solving a Problem in the Doctrine of Chances. Philosophical Transactions of the Royal Society. These authoritative textbooks and peer-reviewed publications provide the theoretical foundation for discrete mathematics, algorithm analysis, combinatorics, probability, cryptography, recursion, and computational problem-solving covered throughout the C960 course. Relevant Students: Western Governors University (WGU) Computer Science students, WGU Software Engineering students, WGU Information Technology students, Computer Science majors, Software Engineering students, Cybersecurity students, Data Science students, Information Systems students, Mathematics students, Computer Engineering students, Programming students, Algorithm Design students, Cryptography students, Network Security students, Data Analytics students, Artificial Intelligence students, Machine Learning students, STEM students, students preparing for the C960 Objective Assessment (OA), students preparing for the C960 Pre-Assessment (PA). Keywords: C960, C960 Discrete Mathematics II, WGU C960, Western Governors University, WGU, Discrete Mathematics II, C960 OA, C960 PA, Objective Assessment, Pre-Assessment, Algorithms, Algorithm Analysis, Big-O Notation, Time Complexity, Asymptotic Analysis, Pseudocode, Counting Principles, Counting Techniques, Permutations, Combinations, Multisets, Lexicographic Order, Probability, Conditional Probability, Bayes Theorem, Expected Value, Random Variables, Number Theory, Modular Arithmetic, Euclid's Algorithm, RSA Encryption, Cryptography, Binary Numbers, Prime Numbers, Fast Exponentiation, Mathematical Induction, Recursive Algorithms, Recurrence Relations, Proof Techniques, Discrete Structures, Computer Science Mathematics, Practice Questions, Exam Questions and Answers, Study Guide, Exam Preparation, Algorithm Complexity, Mathematics for Computer Science

Content preview

C960 Discrete Math II PA 2026
Exam Questions and Correct
Answers | New Update



Pre-Assessment: Algorithms - Algorithm Structures:

Question 1:

Consider the following pseudocode that merges two lists of numbers into

one:

Merge0(List1, List2)

Set OUTlist to empty

While List1 is not empty OR List2 is not empty

, If one list is empty and the other is not,

Remove the first number from the non-empty list and add it to OUTlist

If both lists are non-empty,

Remove the first number from List1 and add it to OUTlist

Remove the first number from List2 and add it to OUTlist

Return OUTlist




If ListA is [1, 3, 5] and ListB is [2, 4, 6] then what is the result of Merge0

(ListA, Merge0 (ListB, ListA))? - ANSWER ✔✔[ 1, 2, 3, 1, 5, 4, 3, 6, 5

]

Step 1:

To solve this, we need to understand how the Merge0 function works. It

merges two lists by taking the first element of each list and adding it to

the output list in ascending order. If one list is empty and the other is not,

it removes the first element from the non-empty list and adds it to the

output list.

Using the given example, we have:

ListA = [1, 3, 5]

,ListB = [2, 4, 6]

Now, let's analyze the innermost function Merge0(ListB, ListA):

1. OUTlist = empty

2. OUTlist = [2]

3. OUTlist = [2, 1]

4. OUTlist = [2, 1, 4]

5. OUTlist = [2, 1, 4, 3]

6. OUTlist = [2, 1, 4, 3, 6]

7. OUTlist = [2, 1, 4, 3, 6, 5]

8. ListA is now empty, so we return OUTlist = [2, 1, 4, 3, 6, 5]

Step 2:

Now, let's use the result of Merge0(ListB, ListA) as the second argument

for the outer Merge0 function. So we have:

List1 = ListA = [1, 3, 5]

List2 = Merge0(ListB, ListA) = [2, 1, 4, 3, 6, 5]

Using the Merge0 function with these lists, we have:

1. OUTlist = empty

2. OUTlist = [1]

COPYRIGHT©PROFFKERRYMARTIN 2025/2026. YEAR PUBLISHED 2026. COMPANY REGISTRATION NUMBER: 619652435. TERMS OF USE.
PRIVACY STATEMENT. ALL RIGHTS RESERVED

, 3. OUTlist = [1, 2]

4. OUTlist = [1, 2, 3]

5. OUTlist = [1, 2, 3, 1]

6. OUTlist = [1, 2, 3, 1, 5]

7. OUTlist = [1, 2, 3, 1, 5, 4]

8. OUTlist = [1, 2, 3, 1, 5, 4, 3]

9. OUTlist = [1, 2, 3, 1, 5, 4, 3, 6]

10. OUTlist = [1, 2, 3, 1, 5, 4, 3, 6, 5]

11. return OUTlist = [1, 2, 3, 1, 5, 4, 3, 6, 5]

Therefore, the result of Merge0(ListA, Merge0(ListB, ListA)) is [1, 2, 3, 1,

5, 4, 3, 6, 5].

Pre-Assessment: Algorithms - Algorithm Structures:

Question 2:




Given this pseudocode:

S = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20}

x=2

While(x<11):

Document information

Uploaded on
July 21, 2026
Number of pages
55
Written in
2025/2026
Type
Exam (elaborations)
Contains
Questions & answers
$18.99

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
PROFFKERRYMARTIN
3.4
(51)
Sold
265
Followers
8
Items
10855
Last sold
1 day ago


Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions