Written Part:
1. Find the output of the following code written in bash
2. Mention the reason for the failure of a software project.
3. Find the number of output values of some SQL code and the table given.
4. Implement an XOR gate using a high-active 2 to 4 decoder and a NOR gate.
5. How A* algorithm find the optimal solution?
6. Define problem P and NP. What is the difference between an approximation algorithm and a Heuristic Algorithm?
7. Why is it said that the pumping lemma is a negative proof?
# Implement an XOR gate from the output of a 2-to-4 level high decoder using a NOR gate.
# Subnetting math. An IP address was given. Find out the subnet mask, broadcast address, and number of subnets.
# Distinguish between P and NP problems. What are the differences between Probabilistic search and Heuristic search?
# A code in bash using multiple for loops. Output was required.
# What is overfitting? How can it be overcome?
# Why / how A* search can find the most correct output.
# 2 questions from Automata Language. One was to find the string. Another way to generate the parsing table, maybe.
# A code snippet of a C program was given. Asked about the output and the reason for the output. The main theme was comparing an unsigned variable with a negative number.
unsigned int var = 10;
If (var > -5)
printf(“yes”);
else
printf(“No”);
# A database table was given. Then some queries were written. The question was to find out several tuples from the queries.
# Suppose a singly Linked List is given. If the last node refers to a null pointer, then it is a snake. But if the last node points to the first node, then it is a snail. Now write an algorithm that can properly find out whether the linked list is a snake or a snail.
# A question was DHCP-related.
