DSSSB TGT CS Mock 04 – Question 114
Question: In database systems, what is a ‘Phantom Read’ anomaly? डेटाबेस सिस्टम में ‘फैंटम रीड’ (Phantom Read) विसंगति क्या है?
Computer Science Discipline section (90 Questions)
Question: In database systems, what is a ‘Phantom Read’ anomaly? डेटाबेस सिस्टम में ‘फैंटम रीड’ (Phantom Read) विसंगति क्या है?
Question: Which layer of the OSI model is responsible for end-to-end process-to-process communication, port addressing, and flow control? OSI मॉडल
Question: Which algorithm finds the Minimum Spanning Tree of a connected graph by maintaining a single growing tree and adding
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 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: In C++, what is a ‘vptr’ (virtual table pointer)? C++ में ‘vptr’ (वर्चुअल टेबल पॉइंटर) क्या है? Options: A
Question: What is the recurrence relation for the Merge Sort algorithm on an input of size \(n\), and what is
Question: Consider the following C function: int f(int *a, int n) { if (n 9 – 8 = 1.- f(a+2,