DSSSB TGT CS Mock 03 – Question 184
Question: What is the time complexity to multiply two \(n \times n\) matrices using Strassen’s matrix multiplication algorithm? स्ट्रैसेन के
Computer Science Discipline section (90 Questions)
Question: What is the time complexity to multiply two \(n \times n\) matrices using Strassen’s matrix multiplication algorithm? स्ट्रैसेन के
Question: In an operating system using the Banker’s algorithm, what does it mean when the current system state is classified
Question: Which of the following database isolation levels completely prevents Dirty Reads, Non-Repeatable Reads, and Phantom Reads? निम्नलिखित में से
Question: In Python, what is the Global Interpreter Lock (GIL)? पायथन में ग्लोबल इंटरप्रेटर लॉक (GIL) क्या है? Options: A
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
Question: What is the primary function of the ‘ARP’ (Address Resolution Protocol) in a local area network? लोकल एरिया नेटवर्क