Questions

• • Define P and NP classes. Differentiate between approximation and heuristic algorithm.
• • Build XOR with a 2-to-4 decoder and a NOR gate.
• • Strategy pattern has 3 algorithms: insertion sort, selection sort, and quick sort. Describe something about the system.
• • Why is A* optimal? Give a condition when it is optimal.
• • Main reasons for failure in software projects.
• • What is overfitting? How to avoid it?
• • Why is the pumping lemma only used for negative proofs?
• • How does a DHCP attack work?
• • Networking question: Derive subnet, host range, and network IP.
• • Scripting code: Output derivation (Quick sort).
• • What is a functional interface in Java? Provide an example.
• • Predictive parsing cell entry in A ->∞ and A->∈. Describe it in terms of First and Follow.
• • Algorithm for checking a loop in a singly linked list.
• • Explain the length of the 1st Run and 2nd Run with probability P for 1 and Q for 0.
• • Output:

unsigned int i = 10;
if (i > -1)
    cout << "Yes";
else
    cout << "No";

• • DBMS Query: Number of topics
• SELECT COUNT(*) GROUP BY name;
• SELECT name, COUNT(topic) FROM table_name GROUP BY name;
• SELECT DISTINCT topic FROM table_name WHERE condition;
• SELECT name FROM table_name WHERE topic = 'specific_topic';
• SELECT AVG(score) FROM table_name GROUP BY topic;