CS - Computer Science - QUIZ

CS · Computer Science

George Mason University

Practice 10 questions on CS - Computer Science at George Mason University. Free AI-generated quiz on uNotes — track your score, retake anytime.

Questions

1Based on the Master Theorem application in the document, what is the tight asymptotic bound for the recurrence T(n) = 4T(n/2) + n^2?

2Which of the following statements are true regarding 'Call by Value' in the C programming language?

3What is the specific complexity of the recurrence T(n) = 2T(n/2) + n/lg n as derived using a recursion tree in the assignment solution?

4In C, if a structure is accessed via a pointer (e.g., struct node *y), which operator must be used to access its members?

5Which of the following are considered legal operations that can be performed on a C structure?

6What is the effect of the 'static' keyword when applied to a local variable within a function?

7According to the Cybersecurity Lab content, where is the SAM database located in Windows 10, and what is its primary purpose?

8Which federal law and specific section makes it illegal to traffic in passwords?

9The recurrence T(n) = T(n - 1) + 1/n is associated with which mathematical progression/series?

10What is the correct URL for the George Mason University Computer Science Department website?