DSSSB TGT CS Mock 03 – Question 176
Question: What is the time complexity of searching for a pattern of length \(m\) in a text of length \(n\)
Computer Science Discipline section (90 Questions)
Question: What is the time complexity of searching for a pattern of length \(m\) in a text of length \(n\)
Question: In database recovery management, what does the ‘Write-Ahead Logging’ (WAL) protocol mandate? डेटाबेस पुनर्प्राप्ति प्रबंधन में ‘राइट-अहेड लॉगिंग’ (WAL)
Question: Which of the following routing protocols uses the Bellman-Ford distance-vector algorithm and suffers from the ‘Count-to-Infinity’ problem? निम्नलिखित में
Question: What is the primary vulnerability targeted by a ‘Cross-Site Scripting’ (XSS) attack on a web application? वेब एप्लिकेशन पर
Question: In Python, which built-in function returns an iterator that aggregates elements from two or more iterables in parallel tuples?
Question: What does the acronym REST stand for in modern web API architecture? आधुनिक वेब एपीआई आर्किटेक्चर में REST का
Question: In JavaScript, what is the output of console.log(typeof NaN, NaN === NaN);? जावास्क्रिप्ट में console.log(typeof NaN, NaN === NaN);
Question: Which phase of a compiler constructs the Abstract Syntax Tree (AST) and checks for context-free syntactic validity? कंपाइलर का
Question: What is the Cyclomatic Complexity \(V(G)\) of a control flow graph with 14 edges and 10 nodes having 1
Question: In symmetric cryptography, which block cipher mode of operation turns a block cipher into a self-synchronizing stream cipher? सममित