SSC IMD SA Mock 02 – Question 190
Question: What is the maximum number of edges in an undirected simple planar graph with \(n \ge 3\) vertices? \(n
Question: What is the maximum number of edges in an undirected simple planar graph with \(n \ge 3\) vertices? \(n
Question: In database recovery, what does the ‘Checkpointing’ technique accomplish? डेटाबेस पुनर्प्राप्ति में ‘चेकपॉइंटिंग’ तकनीक क्या पूरा करती है? Options:
Question: Which algorithm is an example of an asymptotic \(O(V^2)\) Greedy approach to find the Minimum Spanning Tree (MST) of
Question: What is the primary purpose of ‘Dynamic Programming’ compared to standard recursion? मानक रिकर्शन की तुलना में ‘डायनामिक प्रोग्रामिंग’
Question: Consider the following C function: int f(int *a, int n) { if (n 9 – 8 = 1.- f(a+2,
Question: In C++, what is a ‘vptr’ (virtual table pointer)? C++ में ‘vptr’ (वर्चुअल टेबल पॉइंटर) क्या है? Options: A
Question: What is the primary characteristic of an idempotent HTTP method in RESTful web services? RESTful वेब सेवाओं में एक
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)? एक अप्रत्यक्ष ग्राफ में ‘आर्टिक्यूलेशन पॉइंट’ (कट