SSC IMD SA Mock 02 – Question 195
Question: What is the time complexity of the Floyd-Warshall all-pairs shortest paths algorithm on a graph with \(V\) vertices? \(V\)
Question: What is the time complexity of the Floyd-Warshall all-pairs shortest paths algorithm on a graph with \(V\) vertices? \(V\)
Question: In compiler design, what is the output of the Lexical Analyzer passed to the Syntax Analyzer? कंपाइलर डिज़ाइन में,
Question: In relational algebra, what does the natural join \(R \bowtie S\) do? रिलेशनल बीजगणित में नेचुरल जॉइन \(R \bowtie
Question: Which algorithm finds the Minimum Spanning Tree of a connected graph by maintaining a single growing tree and adding
Question: What is the capacity (in bytes) of an IPv4 packet header without options? बिना किसी विकल्प (options) के एक
Question: Which normal form eliminates all transitive dependencies of non-prime attributes on candidate keys? कौन सा सामान्य रूप (Normal Form)
Question: In an OS using paging, if the memory access time is 100 ns and a page fault takes 8
Question: What is the recurrence relation for the Merge Sort algorithm on an input of size \(n\), and what is
Question: In C++, which smart pointer allows multiple pointers to share ownership of the same dynamically allocated object using reference
Question: In computer networking, which protocol operates at the Transport Layer to provide connectionless, unreliable, best-effort datagram delivery? कंप्यूटर नेटवर्किंग