DSSSB TGT CS Mock 03 – Question 182
Question: What is the minimum number of 2-input NAND gates required to implement a 2-input Exclusive-OR (XOR) gate? 2-इनपुट एक्सक्लूसिव-OR
DSSSB TGT Computer Science Full Length Mock Test 03 (Hard Level)
Question: What is the minimum number of 2-input NAND gates required to implement a 2-input Exclusive-OR (XOR) gate? 2-इनपुट एक्सक्लूसिव-OR
Question: Which of the following data structures is typically used by compilers to manage the scope and lifetime of variable
Question: In an undirected graph, what is an ‘Articulation Point’ (or Cut Vertex)? एक अप्रत्यक्ष ग्राफ में ‘आर्टिक्यूलेशन पॉइंट’ (कट
Question: What is the time complexity to multiply two \(n \times n\) matrices using Strassen’s matrix multiplication algorithm? स्ट्रैसेन के
Question: What is the time complexity of searching for a pattern of length \(m\) in a text of length \(n\)
Question: In a B+ Tree, where are the actual data records (or record pointers) stored? B+ ट्री में वास्तविक डेटा
Question: In an operating system, what is the ‘Working Set Model’ of a process used to monitor and regulate? ऑपरेटिंग
Question: What is the worst-case space complexity of Depth-First Search (DFS) on a tree of height \(h\) and branching factor
Question: In object-oriented programming, what principle states that ‘objects of a superclass should be replaceable with objects of its subclasses
Question: Which algorithm is specifically designed to solve the Single-Source Shortest Path problem in a graph containing negative edge weights