NSCT – Mathematical Foundations MCQs 20 min Score: 0 Attempted: 0/20 Subscribe 1. . Mathematical foundations in computer science provide: (A) The theoretical basis for algorithms, data structures, and computation (B) Encrypting data only (C) Compressing files only (D) Backup onlyShow All Answers 2. . Set theory in mathematics is used to: (A) Compress sets (B) Encrypt sets (C) Represent collections of objects and relationships between them (D) Backup only 3. . A subset of a set is: (A) Compressing elements (B) Encrypting elements (C) A set where all elements are also in the original set (D) Backup only 4. . Relations in mathematics help in: (A) Defining connections between elements of different sets (B) Encrypting relations (C) Compressing relations (D) Backup only 5. . Functions are: (A) Compressing functions (B) Encrypting functions (C) Relations that map each input to exactly one output (D) Backup only 6. . Logic in computer science is used to: (A) Encrypt logic (B) Formulate statements, reason about problems, and design algorithms (C) Compress logic (D) Backup only 7. . Propositional logic involves: (A) Encrypting statements (B) Statements that are either true or false (C) Compressing statements (D) Backup only 8. . Predicate logic extends propositional logic by: (A) Backup only (B) Encrypting predicates (C) Compressing predicates (D) Including variables, quantifiers, and predicates 9. . Boolean algebra is: (A) Compressing booleans (B) Encrypting booleans (C) A mathematical structure to perform operations on true/false values (D) Backup only 10. . Matrices are used in computing for: (A) Encrypting matrices (B) Representing graphs, transformations, and linear systems (C) Compressing matrices (D) Backup only 11. . Probability in computer science is used to: (A) Encrypt probability (B) Model uncertainty, randomness, and stochastic processes (C) Compress probability (D) Backup only 12. . Combinatorics helps in: (A) Counting arrangements, combinations, and permutations in problem solving (B) Encrypting combinations (C) Compressing combinations (D) Backup only 13. . Graph theory is used to: (A) Encrypt graphs (B) Model networks, relationships, and connectivity between entities (C) Compress graphs (D) Backup only 14. . A simple graph is: (A) Compressing graph (B) Encrypting graph (C) A graph with no loops or multiple edges between the same pair of vertices (D) Backup only 15. . Number theory is important in computing because: (A) Encrypting numbers only (B) It is used in cryptography, hashing, and algorithm design (C) Compressing numbers only (D) Backup only 16. . Recurrence relations are used to: (A) Compress sequences (B) Encrypt sequences (C) Define sequences and analyze recursive algorithms (D) Backup only 17. . Modular arithmetic is: (A) Backup only (B) Encrypting arithmetic (C) Compressing arithmetic (D) A system of arithmetic for integers where numbers wrap around upon reaching a modulus 18. . Mathematical induction is: (A) Encrypting proofs (B) A method to prove statements for all natural numbers (C) Compressing proofs (D) Backup only 19. . Linear algebra supports computing by: (A) Compressing matrices (B) Encrypting vectors (C) Enabling operations on vectors and matrices for graphics, ML, and simulations (D) Backup only 20. . The main purpose of mathematical foundations in computing is to: (A) Provide tools and reasoning to model, analyze, and solve computational problems (B) Encrypt computations (C) Compress algorithms (D) Backup only
