Computer Science Discipline

Question: In database concurrency control, which graph cycle indicates a deadlock? (Variant 69) डेटाबेस कॉनकरेंसी नियंत्रण में कौन सा ग्राफ

Question: What is the maximum number of edges in a connected planar graph with \(V = 10\) vertices? (Variant 71)

Question: What is the time complexity of inserting a new key into a Hash Table with \(n\) elements using chaining,

Question: In computer networks, what is the minimum frame size in standard Ethernet (IEEE 802.3) operating at 10 Mbps with

Question: Which layer of the OSI model is responsible for end-to-end process-to-process communication, port addressing, and flow control? (Variant 66)

Question: In database systems, what is a ‘Phantom Read’ anomaly? (Variant 64) डेटाबेस सिस्टम में ‘फैंटम रीड’ (Phantom Read) विसंगति

Question: What is the time complexity of searching for an element in an array of size \(n\) using Binary Search?

Question: Which CPU register holds the address of the next instruction to be fetched from memory? (Variant 63) कौन सा

Question: In computer networks, what is the minimum frame size in standard Ethernet (IEEE 802.3) operating at 10 Mbps with

Question: What is the maximum number of edges in a connected planar graph with \(V = 10\) vertices? (Variant 61)