SSC IMD SA Mock 02 – Question 197
Question: Which normal form eliminates all transitive dependencies of non-prime attributes on candidate keys? कौन सा सामान्य रूप (Normal Form)
Question: Which normal form eliminates all transitive dependencies of non-prime attributes on candidate keys? कौन सा सामान्य रूप (Normal Form)
Question: What is the recurrence relation for the Merge Sort algorithm on an input of size \(n\), and what is
Question: In C++, what is a ‘vptr’ (virtual table pointer)? C++ में ‘vptr’ (वर्चुअल टेबल पॉइंटर) क्या है? Options: A
Question: Consider the following C function: int f(int *a, int n) { if (n 9 – 8 = 1.- f(a+2,
Question: What is the primary purpose of ‘Dynamic Programming’ compared to standard recursion? मानक रिकर्शन की तुलना में ‘डायनामिक प्रोग्रामिंग’
Question: Which algorithm is an example of an asymptotic \(O(V^2)\) Greedy approach to find the Minimum Spanning Tree (MST) of
Question: In database recovery, what does the ‘Checkpointing’ technique accomplish? डेटाबेस पुनर्प्राप्ति में ‘चेकपॉइंटिंग’ तकनीक क्या पूरा करती है? Options:
Question: What is the maximum number of edges in an undirected simple planar graph with \(n \ge 3\) vertices? \(n
Question: In computer networking, which protocol operates at the Transport Layer to provide connectionless, unreliable, best-effort datagram delivery? कंप्यूटर नेटवर्किंग
Question: In C++, which smart pointer allows multiple pointers to share ownership of the same dynamically allocated object using reference