MCQ தேர்வு

Q1
Which RAID level uses block-level striping with distributed parity?
Q2
Which algorithm is commonly used to find strongly connected components in a directed graph?
Q3
Which cryptographic property prevents an attacker from deriving the private key from the public key in a secure public-key system?
Q4
What is the worst-case time complexity of inserting n keys into an initially empty binary search tree when the keys are already sorted?
Q5
Which data structure is required for an iterative depth-first search implementation?
Q6
Which TCP mechanism allows a sender to retransmit a packet before the retransmission timeout expires when sufficient duplicate ACKs are received?
Q7
What is the primary purpose of a foreign key constraint in a relational database?
Q8
Which DNS record type maps a domain name directly to an IPv4 address?
Q9
Which protocol is connectionless and does not guarantee delivery, ordering or duplicate protection at the transport layer?
Q10
Which protocol is primarily responsible for mapping an IPv4 address to a MAC address on a local network?
Q11
In a distributed system, what does the term split-brain primarily describe?
Q12
What is the maximum number of edges in a simple undirected graph containing n vertices?
Q13
Which concurrency problem occurs when two or more transactions read and write shared data in such a way that the final result depends on execution order?
Q14
Which cryptographic hash property makes it computationally difficult to find two different inputs producing the same hash?
Q15
Which protocol is primarily used to securely transfer files over an SSH connection?
Q16
Which language recognition class corresponds to languages accepted by a deterministic finite automaton?
Q17
Which operating system technique moves an entire process between main memory and secondary storage?
Q18
Which RAID configuration provides disk mirroring without striping?
Q19
Which normal form requires every determinant in a functional dependency to be a candidate key or superkey?
Q20
Which virtual machine technology allows multiple operating systems to share the same physical hardware through a hypervisor?
Q21
Which algorithm has O(V + E) time complexity for finding a topological ordering of a directed acyclic graph?
Q22
Which property of an algorithm guarantees that it eventually terminates after a finite number of steps?
Q23
In a relational database, which normal form specifically eliminates transitive functional dependencies of non-key attributes on a candidate key?
Q24
Which CPU scheduling algorithm can cause starvation even when the system is not overloaded?
Q25
Which algorithm can find shortest paths from a single source in a graph containing negative-weight edges, provided there is no reachable negative cycle?
Q26
What is the primary purpose of a TLB in a virtual memory system?
Q27
Which scheduling algorithm is generally optimal for minimizing average waiting time when all process burst times are known in advance?
Q28
Which OS concept allows a process to use an address space larger than the available physical memory?
Q29
For a hash table using separate chaining, what is the expected average search complexity under a uniform hashing assumption?
Q30
Which compiler phase is primarily responsible for constructing an abstract syntax tree from tokens?
Q31
Which CAP theorem property means that every request receives a response indicating success or failure without guaranteeing the most recent data?
Q32
Which SQL operation is logically evaluated before the HAVING clause?
Q33
Which technique is commonly used to reduce overfitting in neural networks by randomly disabling a fraction of neurons during training?
Q34
Which database index structure is particularly suitable for range queries?
Q35
Which algorithm is used to construct a minimum spanning tree by repeatedly selecting the minimum-weight edge that does not create a cycle?
Q36
In an AVL tree, what is the maximum allowed absolute difference between the heights of the left and right subtrees of any node?
Q37
In a B+ tree of order m, what is the maximum number of children that an internal node can have?
Q38
Which principle of database transaction processing ensures that a transaction is treated as an indivisible unit?
Q39
Which compiler optimization eliminates repeated computation of the same expression when its operands have not changed?
Q40
Which property of a transaction guarantees that committed changes survive a subsequent system failure?
Q41
Which type of SQL JOIN returns every row from the left relation and matching rows from the right relation?
Q42
Which graph traversal guarantees the shortest path in an unweighted graph?
Q43
What is the worst-case time complexity of Floyd-Warshall all-pairs shortest path algorithm?
Q44
In TCP congestion control, which mechanism primarily detects congestion through packet loss or timeout and reduces the congestion window?
Q45
Which IPv4 mechanism allows multiple private hosts to share one public IPv4 address by translating network addresses and ports?
Q46
Which principle states that software entities should be open for extension but closed for modification?
Q47
Which synchronization primitive is specifically designed to allow only one thread at a time to enter a critical section?
Q48
Which SQL clause is used to eliminate duplicate rows from the result of a SELECT query?
Q49
Which machine learning problem occurs when a model performs extremely well on training data but poorly on unseen data?
Q50
Which software testing technique examines internal program logic, paths, branches and conditions?
Q51
Which data structure is most appropriate for implementing Dijkstras algorithm efficiently on a sparse graph?
Q52
Which statement about a deadlock in an operating system is correct?
Q53
Which data structure provides amortized O(1) insertion at the end and O(1) random access when implemented as a dynamic array?
Q54
Which algorithm is used by Ethernet switches to determine the shortest path through a network topology?
Q55
Which attack exploits the fact that user-supplied input is incorporated into a database query without proper parameterization?
Q56
Which HTTP status code indicates that the server successfully processed the request but is not returning a response body?
Q57
Which page replacement algorithm can exhibit Beladys anomaly?