List of top Questions asked in CUET (PG)

The agent observes input-output pairs and learns a function that this learning maps from input to output. For example, the inputs could be camera images, each one accompanied by an output saying "bus" or "pedestrian," etc. This type of learning is known as:
\(\underline{\hspace{1cm}}\) is the process of computing the distribution over past states given evidence up to the present.
When the output is one of a finite set of values (such as sunny/cloudy/rainy or true/false), the learning problem is known as:
The term "Residual" is defined as:
Consider the following arguments and determine whether they are valid.
A. Either I will get good marks or I will not graduate. If I did not graduate I will go to America. I got good marks. Thus, I would not go to America.
B. Either I will pass the examination or I will not graduate. If I do not graduate I will go to America. I failed. Thus, I will go to America.
C. If I study then I will pass examination. If I do not go to shopping then I will study. But I failed examination. Therefore, I went to shopping.
D. If the mall is free then there is no inflation. If there is no inflation then there are price controls. Since there are price controls, therefore, the mall is free.
Choose the correct valid arguments from the options given below:
If we encrypt the following plain text using rail fence technique with depth 2, what will be the encrypted message?
Plain Text = DIFFICULTWAYLEADSTODESTINATION
In Playfair cipher what happens when two identical letters appear in the same pair?
Which of the following is not included in the CIA triad?
If a cryptanalyst only knows the encryption algorithm and ciphertext, then which type of attack can be performed by him?
Which of the following IP address can be used as a loop-back address?
Arrange the following steps in order in which they take place, while solving problems using State Space Approach. (A) Identify the set of rules (all possible actions).
(B) Describe the states.
(C) Identify the initial state followed by the goal state.
(D) Find the solution path in the state space.
Choose the correct answer from the options given below:
With respect to Artificial Intelligence, find the correct properties of an agent. (A) An agent's choice of action at any given instant does not depend on its built-in knowledge.
(B) Agents do not interact with the environment.
(C) Agents interact with the environment through sensors and actuators.
(D) An agent's choice of action at any given instant can depend on its built-in knowledge and on the entire percept sequence observed to date, but not on anything it hasn't perceived.
Choose the correct answer from the options given below:
Match LIST-I with LIST-II \[\begin{array}{|c|c|}\hline \text{LIST-I (Evaluate an algorithm's performance)} & \text{LIST-II (Meaning)} \\ \hline \text{A. Completeness} & \text{III. Is the algorithm guaranteed to find a solution when there is one, and to correctly report failure when there is none?} \\ \hline \text{B. Cost optimality} & \text{IV. Does it find a solution with the lowest path cost of all solutions?} \\ \hline \text{C. Time complexity} & \text{I. How long does it take to find a solution? This can be measured in seconds, or more abstractly by the number of states and actions considered.} \\ \hline \text{D. Space complexity} & \text{II. How much memory is needed to perform the operation?} \\ \hline \end{array}\] Choose the correct answer from the options given below:
Match LIST-I with LIST-II \[\begin{array}{|c|c|}\hline \text{LIST-I (Standard logical equivalence)} & \text{LIST-II (Theorem)} \\ \hline \text{A. } (\alpha \iff \beta) \equiv (\beta \iff \neg \alpha) & \text{IV. Contraposition} \\ \hline \text{B. } (\alpha \iff \beta) \equiv ((\alpha \iff \beta) \land (\beta \iff \alpha)) & \text{I. Biconditional elimination} \\ \hline \text{C. } (\alpha \lor \beta) \equiv (\alpha \land \neg \beta) & \text{III. Distributivity of } \lor \text{ over } \land \\ \hline \text{D. } (\alpha \lor \beta) \equiv (\neg \alpha \lor \neg \beta) & \text{II. De Morgan's law} \\ \hline \end{array}\] Choose the correct answer from the options given below:
Convert the following statement into First Order Logic: "For every \(s\), if \(s\) is a student, then \(s\) is a player"
A device which connects dissimilar LANs of different topologies, using different sets of communication protocols, is called:
Match LIST-I with LIST-II:\[\begin{array}{|c|c|}\hline \text{LIST-I} & \text{LIST-II} \\ \hline \text{A. Physical} & \text{I. Bit} \\ \hline \text{B. Data Link} & \text{II. Frame} \\ \hline \text{C. Network} & \text{IV. Packet} \\ \hline \text{D. Transport} & \text{III. TPDU} \\ \hline \end{array}\] Choose the correct answer from the options given below:
Which of the following functionality is to be implemented by the transport layer?
Match LIST-I with LIST-II:\[\begin{array}{|c|c|}\hline \text{LIST-I} & \text{LIST-II} \\ \hline \text{A. 10Base5} & \text{I. Thick coax} \\ \hline \text{B. 10Base2} & \text{II. Thin coax} \\ \hline \text{C. 10Base-T} & \text{IV. Twisted pair} \\ \hline \text{D. 10Base-F} & \text{III. Fiber optics} \\ \hline \end{array}\] Choose the correct answer from the options given below:
The data link layer has a number of specific functions it can carry out. These functions include: (A) Providing a well-defined interface to the network layer
(B) Dealing with transmission errors
(C) Regulating the flow of data so that slow receivers are not swamped by fast senders
(D) Routing packets from the source machine to the destination machine
Choose the correct answer from the options given below:
What will be the number of cross points needed for a full duplex 8-line cross point switch with no self connections?
In a system with multiple instances of resources, the resource allocation graph for deadlock avoidance does NOT contain the following edge:
Consider a paging system in which the hit ratio is 80%, TLB (Translation Look Ahead Buffer) access time is 100 nanoseconds, and main memory access time is 100 nanoseconds. Find Effective Access Time (EAT), assuming page-table lookup takes only one memory access.
The time complexity in order to build a heap of 'n' elements is ..............
The operating system is not responsible for: