Q11hardHow many pointers are updated when inserting a node into the middle of a Singly Linked List?A4B0C1D2Check AnswerReveal Answer & ExplanationDiscuss on Board
Q12hardWhat is the time complexity of Heapify (converting an array into a heap)?AO(N)BO(N log N)CO(1)DO(log N)Check AnswerReveal Answer & ExplanationDiscuss on Board
Q13easyWhich structure uses the FIFO (First-In-First-Out) principle?ALinked ListBStackCQueueDStringCheck AnswerReveal Answer & ExplanationDiscuss on Board
Q14easyWhat is Rehashing?ADeleting the whole table.BCreating a larger table and moving all existing items to it when the load factor exceeds a certain threshold.CChanging the data type of the keys.DRunning the hash function twice for security.Check AnswerReveal Answer & ExplanationDiscuss on Board
Q15mediumAn OS needs to manage a list of processes waiting for the CPU in order of arrival. Which structure is standard?ADoubly Linked ListBStackCQueueDArrayCheck AnswerReveal Answer & ExplanationDiscuss on Board
Q16mediumWhich of the following is a "Cryptographic" hash function requirement, but NOT necessarily required for a standard Hash Table?APre-image resistance (Impossible to reverse the hash to find the key)BUniform distributionCDeterminism (Same key always yields same hash)DFast computationCheck AnswerReveal Answer & ExplanationDiscuss on Board
Q17mediumA system needs to handle a Load Factor of 2.0. Which collision resolution strategy is the only one that can handle this?ADouble HashingBSeparate ChainingCLinear ProbingDQuadratic ProbingCheck AnswerReveal Answer & ExplanationDiscuss on Board
Q18mediumTrace a Binary Search for target = 7 in the array [1, 3, 5, 7, 9, 11, 13]. What is the value of the mid index in the first iteration (using 0-based indexing)?A3B0C4D2Check AnswerReveal Answer & ExplanationDiscuss on Board
Q19mediumWhich structure would be best to model a "Social Network" where users can have many friends and those friends can also be friends with each other?ABinary Search TreeBGraphCLinked ListDMin-HeapCheck AnswerReveal Answer & ExplanationDiscuss on Board
Q20mediumWhich characteristic fundamentally distinguishes a Non-Linear data structure from a Linear one?ANon-linear structures do not use pointers.BIn non-linear structures, an element can be associated with more than one predecessor or successor.CLinear structures are always stored on the heap.DNon-linear structures can only store integers.Check AnswerReveal Answer & ExplanationDiscuss on Board