MCQsExam.com

Computer Science MCQs

Embarking on the vast digital realm, Computer Science is a journey of discovery. It delves into crafting intelligent systems, solving problems through software, and extends to the realm of Artificial Intelligence—teaching computers language understanding and image recognition. Beyond coding, it encompasses database management, utilizing extensive data sets, and ensuring technology serves us optimally.

Computer Scientists contribute to networks, safeguarding information, and enhancing user-friendliness in technology applications, from phone apps to websites. Upholding ethical standards, we prioritize fairness, safety, and privacy. As technology evolves, Computer Science evolves with it, continually enhancing our digital landscape. Join us on this exciting journey into the future of a better, more inclusive digital world! #ComputerScience #TechJourney #SimpleTechExplanation

Which PHP 8.3 feature allows declaring a constant on a trait?
  1. A-trait constants
  2. B-class constants
  3. C-interface constants
  4. D-enum constants
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / PHP
  7. More about this MCQ
Which data structure provides efficient pattern matching with O(m) preprocessing and O(n) search time?
  1. A-Naive String Matching
  2. B-Knuth-Morris-Pratt Algorithm
  3. C-Rabin-Karp Algorithm
  4. D-Boyer-Moore Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which algorithm efficiently computes the edit distance between two strings?
  1. A-Naive Recursion
  2. B-Wagner-Fischer Algorithm
  3. C-Greedy Algorithm
  4. D-Divide and Conquer
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In database systems, which normal form addresses multi-valued dependencies?
  1. A-Third Normal Form
  2. B-Boyce-Codd Normal Form
  3. C-Fourth Normal Form
  4. D-Fifth Normal Form
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Database Management Systems
  7. More about this MCQ
Which theorem establishes that any monotonic boolean function can be computed by a circuit of depth O(log n)?
  1. A-Cook-Levin Theorem
  2. B-Razborov-Smolensky Theorem
  3. C-Savitch's Theorem
  4. D-Ladner's Theorem
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In computational geometry, which algorithm efficiently computes the convex hull in 3D?
  1. A-Jarvis March
  2. B-Graham's Scan
  3. C-Quickhull
  4. D-Chan's Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which principle in computer security states that security should be designed in layers?
  1. A-Defense in Depth
  2. B-Principle of Least Privilege
  3. C-Separation of Duties
  4. D-Fail-Safe Defaults
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cybersecurity
  7. More about this MCQ
In distributed systems, which consensus algorithm is fault-tolerant?
  1. A-Paxos
  2. B-Raft
  3. C-Byzantine Fault Tolerance
  4. D-Two-Phase Commit
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which data structure provides efficient persistence with full path copying?
  1. A-Persistent data structures
  2. B-Ephemeral data structures
  3. C-Mutable data structures
  4. D-Immutable data structures
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In compiler design, which analysis determines possible values of variables?
  1. A-Data flow analysis
  2. B-Constant propagation
  3. C-Control flow analysis
  4. D-Alias analysis
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
In database systems, which protocol ensures conflict serializability?
  1. A-Two-Phase Locking
  2. B-Timestamp Ordering
  3. C-Multi-Version Concurrency Control
  4. D-Optimistic Concurrency Control
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Database Management Systems
  7. More about this MCQ
Which algorithm efficiently finds the shortest path in a graph with non-negative weights?
  1. A-Dijkstra's Algorithm
  2. B-Bellman-Ford Algorithm
  3. C-Floyd-Warshall Algorithm
  4. D-A* Search Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In operating systems, what is the primary purpose of the multilevel feedback queue scheduling?
  1. A-Adapt to process behavior
  2. B-Priority-based scheduling
  3. C-Round-robin scheduling
  4. D-Shortest job first
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Operating Systems
  7. More about this MCQ
Which data structure provides efficient range queries with O(log n) time for updates and queries?
  1. A-Fenwick Tree
  2. B-Segment Tree
  3. C-Binary Indexed Tree
  4. D-Sparse Table
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In computer networks, which protocol provides connectionless, unreliable datagram service?
  1. A-TCP
  2. B-UDP
  3. C-IP
  4. D-ICMP
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Computer Networks
  7. More about this MCQ
In formal language theory, which automaton recognizes the context-free languages?
  1. A-Finite Automata
  2. B-Pushdown Automata
  3. C-Linear Bounded Automata
  4. D-Turing Machine
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which algorithm efficiently solves the maximum flow problem in unit capacity networks?
  1. A-Ford-Fulkerson Algorithm
  2. B-Edmonds-Karp Algorithm
  3. C-Dinic's Algorithm
  4. D-Push-Relabel Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which principle in software engineering states that software entities should be open for extension but closed for modification?
  1. A-Open-Closed Principle
  2. B-Single Responsibility Principle
  3. C-Liskov Substitution Principle
  4. D-Interface Segregation Principle
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
In distributed systems, which protocol ensures exactly-once message delivery?
  1. A-Two-Phase Commit
  2. B-Paxos
  3. C-Raft
  4. D-Byzantine Agreement
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which data structure provides efficient storage and retrieval of spatial data?
  1. A-B-tree
  2. B-Quadtree
  3. C-R-tree
  4. D-Octree
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In compiler design, which optimization technique moves computations outside loops?
  1. A-Constant folding
  2. B-Loop invariant code motion
  3. C-Common subexpression elimination
  4. D-Dead code elimination
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which data structure provides efficient pattern matching in compressed text?
  1. A-Suffix Array
  2. B-FM-index
  3. C-Hash Table
  4. D-Trie
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In operating systems, what is the primary purpose of the second chance page replacement algorithm?
  1. A-Modification of FIFO
  2. B-Modification of LRU
  3. C-Modification of OPT
  4. D-Modification of MRU
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Operating Systems
  7. More about this MCQ
Which algorithm efficiently computes the maximum subarray sum?
  1. A-Brute Force
  2. B-Kadane's Algorithm
  3. C-Divide and Conquer
  4. D-Dynamic Programming
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In database systems, which normal form requires that every determinant is a candidate key?
  1. A-Third Normal Form
  2. B-Boyce-Codd Normal Form
  3. C-Fourth Normal Form
  4. D-Fifth Normal Form
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Database Management Systems
  7. More about this MCQ
Which theorem establishes that any boolean function can be computed by a circuit of depth O(log n)?
  1. A-Cook-Levin Theorem
  2. B-Shannon's Expansion Theorem
  3. C-Razborov's Theorem
  4. D-Ladner's Theorem
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In computational geometry, which algorithm efficiently computes the closest pair of points?
  1. A-Brute Force
  2. B-Divide and Conquer
  3. C-Sweep Line
  4. D-Randomized Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which principle in computer security states that users should have the minimum privileges necessary?
  1. A-Defense in Depth
  2. B-Principle of Least Privilege
  3. C-Separation of Duties
  4. D-Fail-Safe Defaults
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cybersecurity
  7. More about this MCQ
In distributed systems, which consensus algorithm is leaderless?
  1. A-Paxos
  2. B-Raft
  3. C-Byzantine Fault Tolerance
  4. D-Two-Phase Commit
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which data structure provides efficient persistence with path copying?
  1. A-Persistent data structures
  2. B-Ephemeral data structures
  3. C-Mutable data structures
  4. D-Immutable data structures
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In compiler design, which analysis determines the lifetime of variables?
  1. A-Data flow analysis
  2. B-Liveness analysis
  3. C-Control flow analysis
  4. D-Alias analysis
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
In database systems, which protocol ensures serializability through timestamp ordering?
  1. A-Two-Phase Locking
  2. B-Timestamp Ordering
  3. C-Multi-Version Concurrency Control
  4. D-Optimistic Concurrency Control
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Database Management Systems
  7. More about this MCQ
Which algorithm efficiently finds the longest common subsequence of two sequences?
  1. A-Naive Recursion
  2. B-Dynamic Programming
  3. C-Greedy Algorithm
  4. D-Divide and Conquer
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In operating systems, what is the primary purpose of the banker's algorithm?
  1. A-Deadlock avoidance
  2. B-Deadlock detection
  3. C-Deadlock prevention
  4. D-Memory management
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Operating Systems
  7. More about this MCQ
Which data structure provides efficient range minimum queries with O(1) time after O(n log n) preprocessing?
  1. A-Segment Tree
  2. B-Sparse Table
  3. C-Fenwick Tree
  4. D-Binary Indexed Tree
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In computer networks, which protocol provides reliable, ordered, and error-checked delivery of data?
  1. A-UDP
  2. B-TCP
  3. C-IP
  4. D-ICMP
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Computer Networks
  7. More about this MCQ
In formal language theory, which grammar generates the context-sensitive languages?
  1. A-Type 0
  2. B-Type 1
  3. C-Type 2
  4. D-Type 3
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which algorithm efficiently solves the assignment problem in polynomial time?
  1. A-Brute Force
  2. B-Hungarian Algorithm
  3. C-Simplex Algorithm
  4. D-Branch and Bound
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which principle in software engineering states that a class should have only one reason to change?
  1. A-Open-Closed Principle
  2. B-Single Responsibility Principle
  3. C-Liskov Substitution Principle
  4. D-Interface Segregation Principle
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
In distributed systems, which algorithm solves the Byzantine Generals Problem?
  1. A-Paxos
  2. B-PBFT
  3. C-Raft
  4. D-Two-Phase Commit
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which data structure is used for efficient storage and retrieval of multidimensional data?
  1. A-B-tree
  2. B-R-tree
  3. C-Quad-tree
  4. D-Octree
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In compiler design, which optimization technique eliminates redundant computations?
  1. A-Constant folding
  2. B-Common subexpression elimination
  3. C-Loop invariant code motion
  4. D-Dead code elimination
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which data structure provides efficient string matching with O(m) preprocessing and O(n) search time?
  1. A-Naive String Matching
  2. B-Knuth-Morris-Pratt Algorithm
  3. C-Rabin-Karp Algorithm
  4. D-Boyer-Moore Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In operating systems, what is the primary cause of priority inversion?
  1. A-Resource holding by low-priority task
  2. B-Deadlock situation
  3. C-Starvation of low-priority tasks
  4. D-Context switching overhead
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Operating Systems
  7. More about this MCQ
Which algorithm efficiently multiplies two large integers using divide and conquer?
  1. A-Schoolbook Multiplication
  2. B-Karatsuba Algorithm
  3. C-Toom-Cook Algorithm
  4. D-Schönhage-Strassen Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In database systems, which isolation level prevents dirty reads but allows non-repeatable reads?
  1. A-Read Uncommitted
  2. B-Read Committed
  3. C-Repeatable Read
  4. D-Serializable
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Database Management Systems
  7. More about this MCQ
Which theorem establishes that any monotonic boolean function can be computed by a monotonic circuit?
  1. A-Cook-Levin Theorem
  2. B-Razborov's Theorem
  3. C-Savitch's Theorem
  4. D-Ladner's Theorem
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In computational geometry, which algorithm efficiently computes the convex hull of a set of points?
  1. A-Jarvis March
  2. B-Graham's Scan
  3. C-Quickhull
  4. D-Chan's Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which principle in computer security states that security should not depend on the secrecy of the algorithm?
  1. A-Saltzer-Schroeder Principle
  2. B-Kerckhoffs's Principle
  3. C-Principle of Least Privilege
  4. D-Defense in Depth
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cybersecurity
  7. More about this MCQ
In formal language theory, which pumping lemma applies to context-free languages?
  1. A-Regular Pumping Lemma
  2. B-Context-Free Pumping Lemma
  3. C-Context-Sensitive Pumping Lemma
  4. D-Recursively Enumerable Pumping Lemma
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which algorithm efficiently finds the minimum spanning tree in a graph with dense edges?
  1. A-Kruskal's Algorithm
  2. B-Prim's Algorithm
  3. C-Borůvka's Algorithm
  4. D-Reverse-Delete Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In cryptography, what is the main vulnerability addressed by forward secrecy?
  1. A-Long-term key compromise
  2. B-Session key compromise
  3. C-Man-in-the-middle attacks
  4. D-Replay attacks
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cybersecurity
  7. More about this MCQ
Which data structure provides efficient persistence with O(1) copying overhead?
  1. A-Persistent data structures
  2. B-Immutable data structures
  3. C-Mutable data structures
  4. D-Ephemeral data structures
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In distributed systems, which protocol ensures atomic commitment across multiple nodes?
  1. A-Paxos
  2. B-Two-Phase Commit
  3. C-Raft
  4. D-Byzantine Agreement
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which theorem establishes that any sufficiently powerful formal system cannot be both consistent and complete?
  1. A-Church-Turing Thesis
  2. B-Gödel's Incompleteness Theorem
  3. C-Rice's Theorem
  4. D-CAP Theorem
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which algorithm is used for finding strongly connected components in a directed graph?
  1. A-Kruskal's Algorithm
  2. B-Kosaraju's Algorithm
  3. C-Prim's Algorithm
  4. D-Dijkstra's Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In operating systems, what is the primary purpose of the working set model?
  1. A-Process scheduling
  2. B-Memory management
  3. C-Deadlock prevention
  4. D-File system organization
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Operating Systems
  7. More about this MCQ
Which data structure is used for efficient range queries and updates?
  1. A-Fenwick Tree
  2. B-Segment Tree
  3. C-Binary Indexed Tree
  4. D-K-D Tree
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In compiler design, which parsing technique handles the largest class of grammars?
  1. A-LL Parsing
  2. B-LR Parsing
  3. C-Recursive Descent Parsing
  4. D-Operator Precedence Parsing
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
In database systems, which normal form requires that every non-prime attribute is fully functionally dependent on every candidate key?
  1. A-First Normal Form
  2. B-Second Normal Form
  3. C-Third Normal Form
  4. D-Boyce-Codd Normal Form
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Database Management Systems
  7. More about this MCQ
Which algorithm efficiently computes the maximum flow in a flow network?
  1. A-Ford-Fulkerson Algorithm
  2. B-Edmonds-Karp Algorithm
  3. C-Dinic's Algorithm
  4. D-Push-Relabel Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which principle in software engineering states that a system should be composed of small, independent modules?
  1. A-Principle of Least Astonishment
  2. B-Principle of Modularity
  3. C-Single Responsibility Principle
  4. D-Open-Closed Principle
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
In computer graphics, which algorithm is used for hidden surface removal?
  1. A-Z-buffer Algorithm
  2. B-Painter's Algorithm
  3. C-Ray Tracing Algorithm
  4. D-Scanline Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Computer Graphics
  7. More about this MCQ
Which data structure is typically used to implement a priority queue with efficient extraction of the minimum element?
  1. A-Linked List
  2. B-Binary Heap
  3. C-Hash Table
  4. D-Binary Search Tree
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In cryptography, what is the main vulnerability that the Saltzer-Schroeder principle addresses?
  1. A-Man-in-the-middle attacks
  2. B-Complexity leading to security flaws
  3. C-Key distribution problems
  4. D-Side-channel attacks
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cybersecurity
  7. More about this MCQ
Which theorem establishes that no algorithm can solve the halting problem for all possible program-input pairs?
  1. A-Cook's Theorem
  2. B-Turing's Halting Theorem
  3. C-Rice's Theorem
  4. D-Gödel's Incompleteness Theorem
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In formal language theory, which hierarchy classifies languages based on their generative power?
  1. A-Turing Hierarchy
  2. B-Chomsky Hierarchy
  3. C-Kleene Hierarchy
  4. D-Backus-Naur Hierarchy
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which algorithm solves the all-pairs shortest path problem for graphs with negative weight edges?
  1. A-Dijkstra's Algorithm
  2. B-Bellman-Ford Algorithm
  3. C-Floyd-Warshall Algorithm
  4. D-Johnson's Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In the context of functional programming, what is the Y-combinator used for?
  1. A-Memory allocation optimization
  2. B-Implementing recursion without named functions
  3. C-Type inference
  4. D-Lazy evaluation
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / JAVA
  7. More about this MCQ
In operating systems, what is the primary cause of the Belady's anomaly?
  1. A-FIFO page replacement algorithm
  2. B-LRU page replacement algorithm
  3. C-Optimal page replacement algorithm
  4. D-Clock page replacement algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Operating Systems
  7. More about this MCQ
Which data structure provides O(1) time complexity for search, insert, and delete operations on average?
  1. A-Binary Search Tree
  2. B-Hash Table
  3. C-Red-Black Tree
  4. D-B-Tree
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which algorithm efficiently finds the shortest paths between all pairs of vertices in a weighted graph?
  1. A-Dijkstra's Algorithm
  2. B-Bellman-Ford Algorithm
  3. C-Floyd-Warshall Algorithm
  4. D-A* Search Algorithm
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
In computational complexity theory, which class contains problems that can be verified in polynomial time?
  1. A-P
  2. B-NP
  3. C-NP-Complete
  4. D-NP-Hard
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which theorem in database theory states that no conjunctive query with inequalities can be expressed in relational algebra?
  1. A-Codd's Theorem
  2. B-Chandra-Merlin Theorem
  3. C-CAP Theorem
  4. D-ACID Theorem
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Database Management Systems
  7. More about this MCQ
In distributed systems, which consensus algorithm uses a leader-based approach with log replication?
  1. A-Paxos
  2. B-Raft
  3. C-Byzantine Fault Tolerance
  4. D-Two-Phase Commit
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which cryptographic protocol enables two parties to establish a shared secret key over an insecure channel without prior shared secrets?
  1. A-RSA Encryption
  2. B-Diffie-Hellman key exchange
  3. C-Elliptic Curve Cryptography
  4. D-Quantum Key Distribution
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cybersecurity
  7. More about this MCQ
In the context of compiler design, what is the primary purpose of the Sethi-Ullman algorithm?
  1. A-Register allocation optimization
  2. B-Lexical analysis optimization
  3. C-Syntax tree minimization
  4. D-Intermediate code generation
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which combinatorial optimization problem asks for the shortest possible route that visits each vertex exactly once and returns to the origin?
  1. A-Traveling Salesman Problem
  2. B-Hamiltonian Cycle Problem
  3. C-Chinese Postman Problem
  4. D-Knapsack Problem
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which CSS property changes text color?
  1. A-font-color
  2. B-text-color
  3. C-color
  4. D-font-style
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cascading Style Sheets - CSS
  7. More about this MCQ
Which HTML tag creates a hyperlink?
  1. A-<link>
  2. B-<a>
  3. C-<href>
  4. D-<url>
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / HTML
  7. More about this MCQ
What is a firewall's primary role?
  1. A-Encrypt data
  2. B-Monitor network traffic
  3. C-Block unauthorized access
  4. D-Detect intrusions
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cybersecurity
  7. More about this MCQ
Which malware demands payment?
  1. A-Virus
  2. B-Ransomware
  3. C-Spyware
  4. D-Adware
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cybersecurity
  7. More about this MCQ
What are main Computer Graphics types?
  1. A-Raster and Vector
  2. B-Raster and Scalar
  3. C-Scalar only
  4. D-All of the above
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Computer Graphics
  7. More about this MCQ
Who is a father of Computer Graphics?
  1. A-Nikola Tesla
  2. B-Ivan Sutherland
  3. C-Ada Lovelace
  4. D-Marie Curie
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Computer Graphics
  7. More about this MCQ
Which is a branch of AI?
  1. A-Machine Learning
  2. B-Cyber Forensics
  3. C-Full-Stack Development
  4. D-Network Design
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Artificial Intelligence (AI) and Machine Learning (ML)
  7. More about this MCQ
Who is considered a pioneer of AI?
  1. A-Geoffrey Hinton
  2. B-Andrew Ng
  3. C-John McCarthy
  4. D-Jürgen Schmidhuber
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Artificial Intelligence (AI) and Machine Learning (ML)
  7. More about this MCQ
Which scheduling uses time slices?
  1. A-First-Come-First-Served
  2. B-Shortest Job First
  3. C-Round Robin
  4. D-Priority Scheduling
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Operating Systems
  7. More about this MCQ
How many OSI model layers are there?
  1. A-5
  2. B-6
  3. C-7
  4. D-8
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Computer Networks
  7. More about this MCQ
Which is a balanced binary tree?
  1. A-AVL Tree
  2. B-Binary Search Tree
  3. C-Complete Binary Tree
  4. D-Full Binary Tree
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
Which data structure uses LIFO?
  1. A-Queue
  2. B-Stack
  3. C-Linked List
  4. D-Tree
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
What is NOT a .NET component?
  1. A-CLR
  2. B-FCL
  3. C-JVM
  4. D-CTS
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Dot NET
  7. More about this MCQ
What does PHP stand for?
  1. A-Private Home Page
  2. B-Personal Hypertext Processor
  3. C-PHP: Hypertext Preprocessor
  4. D-Process Hypertext Protocol
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / PHP
  7. More about this MCQ
What is the full form of URL?
  1. A-Uniform Resource Locator
  2. B-Universal Resource Locator
  3. C-Uniform Resource Link
  4. D-Universal Reference Link
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Computer Networks
  7. More about this MCQ
Which protocol is used for secure communication over a computer network?
  1. A-HTTP
  2. B-FTP
  3. C-HTTPS
  4. D-SMTP
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Computer Networks
  7. More about this MCQ
What does API stand for?
  1. A-Application Program Interface
  2. B-Application Programming Interface
  3. C-Applied Programming Interface
  4. D-Advanced Programming Interface
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Software Engineering
  7. More about this MCQ
Which of the following is not a programming language?
  1. A-Python
  2. B-Java
  3. C-HTML
  4. D-C++
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / HTML
  7. More about this MCQ
Which data structure follows the LIFO principle?
  1. A-Queue
  2. B-Stack
  3. C-Linked List
  4. D-Tree
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Algorithms and Data Structures
  7. More about this MCQ
What does SQL stand for?
  1. A-Structured Question Language
  2. B-Structured Query Language
  3. C-Simple Query Language
  4. D-Standard Query Language
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / MySQL
  7. More about this MCQ
Which programming language is known as the backbone of web development?
  1. A-Python
  2. B-Java
  3. C-JavaScript
  4. D-C++
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Javascript
  7. More about this MCQ
What does CSS stand for?
  1. A-Computer Style Sheets
  2. B-Creative Style Sheets
  3. C-Cascading Style Sheets
  4. D-Colorful Style Sheets
  5. MCQ By: MCQSEXAM
  6. Computer Science MCQs / Cascading Style Sheets - CSS
  7. More about this MCQ
MCQs Exam