List of top Data Science and Artificial Intelligence Questions asked in GATE Data Science and Artificial Intelligence

Given the table facts: \[ \text{facts (D1, D2, val)} \] with the following data: 

 Consider the following SQL query: 

 What is the total number of rows produced?

Consider the following algorithm: 


 What will be the output (O/P) of this algorithm?

Consider the following graph with heuristic values: Which of the following represents the correct order of node expansion using the A* search algorithm?

Consider the following sets: \[ A = \{"this", "that"\}, \quad B = \{"that", "other"\}, \quad C = \{"other", "this"\} \] 

 Which of the following sets remain non-empty at the end?

Consider the given graph and shortest paths: The shortest paths given are: \[ a - b - c - d, \quad e - f - g - h, \quad a - f - c - h \] Which of the following cannot be an edge in the original graph?

Consider the following database schema: \[ \text{Person (aadhar CHAR(12) PK, name VARCHAR(32))} \] \[ \text{Customer (name VARCHAR(32), email VARCHAR(32) PK, phone CHAR, aadhar CHAR(12) FK(aadhar))} \] Which of the following statements is/are correct?

Given the relation: \[ R = \{A, B, C, D, E, F, G\} \] With the following functional dependencies (FDs): \[ A \rightarrow BCEF, \quad E \rightarrow DG, \quad BC \rightarrow A \] Which of the following statements is correct?

Given the lists: \[ A = [1,2,3], \quad B = [4,5,6] \] Which of the following statements will result in \[ A = [1,2,3,4,5,6]? \]

When does the worst case of binary search occur?

Suppose that insertion sort is applied to the array \([1,2,3,5,7,9,11,x,15,13]\) and it takes exactly 2 swaps to sort the array. Select all possible values of \( x \).