List of top Data Science Questions

In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)

Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?

\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
 

Choose the correct answer from the options given below:

Match LIST-I with LIST-II 

Choose the correct answer from the options given below:

Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:

\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
 

Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.

Match LIST-I with LIST-II 

\[\begin{array}{|c|l|}\hline \textbf{LIST-I} & \textbf{LIST-II} \\ \hline \text{A. Encipherment} & \text{The use of mathematical algorithms to transform data into a form that is not readily intelligible.} \\ \hline \text{B. Digital Signature} & \text{Cryptographic transformation of a data unit that allows a recipient of the data unit to prove the source and integrity of the data unit and protect against forgery.} \\ \hline \text{C. Access Control} & \text{A variety of mechanisms that enforce access rights to resources.} \\ \hline \text{D. Data Integrity} & \text{A variety of mechanisms used to assure the integrity of a data unit or stream of data units.} \\ \hline \end{array}\]
 

\[\text{Matching\ Items\ in\ LIST\-I\ with\ LIST\-II}\]

Which model is represented by the following graph? 

Match LIST-I with LIST-II

\[\begin{array}{|c|c|}\hline \textbf{LIST-I (Asymptotic Time Complexity)} & \textbf{LIST-II (Algorithm)} \\ \hline \text{A. Logarithmic  \(O(\log n)\)} & \text{II. Finding an element in a sorted array} \\ \hline \text{B. Quadratic  \(O(n^{2})\)} & \text{III. Bubble sort (worst case)} \\ \hline \text{C. Cubic \(O(n^{3})\)} & \text{IV. Matrix Multiplication} \\ \hline \text{D. Exponential  \(O(2^{n})\)} & \text{I. The Tower of Hanoi problem} \\ \hline \end{array}\]
 

Choose the correct answer from the options given below:

Consider the binary tree given below. What will be the corresponding infix expression to this? 

Consider the following statements about arrays. Which of the following are TRUE? 

A. The index specifies an offset from the beginning of the array to the element being referenced. 
B. Declaring an array means specifying three parameters; data type, name, and its size. 
C. The length of an array is given by the number of elements stored in it. 
D. The name of an array is a symbolic reference to the address of the first byte of the array. 
Choose the correct answer from the options given below:

Match LIST-I with LIST-II

\[\begin{array}{|c|c|}\hline \text{LIST-I} & \text{LIST-II} \\ \hline \text{A. The first index comes after the last index.} & \text{I. Head-tail Linked List} \\ \hline \text{B. More than one queue in the same array of sufficient size} & \text{IV. Multiple Queue} \\ \hline \text{C. Elements can be inserted or deleted at either end.} & \text{III. Circular Queue} \\ \hline \text{D. Each element is assigned a priority.} & \text{II. Priority Queue} \\ \hline \end{array}\] Choose the correct answer from the options given below:

Consider the following code blocks. 

A. for (i=0; i<1000; i++) 
\(\hspace{1cm}\) statement block; 
B. for (i=0; i<100; i+=2) 
\(\hspace{1cm}\) statement block; 
C. for (i=1; i<1000; i*=2) 
\(\hspace{1cm}\) statement block; 
D. for (i=0; i<10; i++) 
\(\hspace{1cm}\) for (j=0; j<10; j++) 
\(\hspace{2cm}\) statement block; 
Arrange the number of iterations of the above loops (number of times 'statement block' is executed) in ascending order.

Arrange the following data types available in C language according to their size (smallest to largest): 
A. signed long int 
B. long double 
C. unsigned char 
D. unsigned int 
Choose the correct answer from the options given below:

\(\underline{\hspace{1cm}}\) refers to a set of data values and associated operations that are specified accurately, independent of any particular implementation.

What will be the foldback memory address range of the following memory chip while interfacing with 8085 microprocessor?

Which of the following statements are applicable to 8237 DMA controller for working in the Master Mode: 

(A) The signals Input Output Read and Input Output Write are kept in tri-state. 
(B) The signals Memory Read and Memory Write are kept in tri-state. 
(C) The signals Input Output Read, Input Output Write, Memory Read and Memory Write may all be used as per the data transfer requirement. 
(D) The data transfer can be terminated by sending low End of Process (EOP) from outside, also. 
Choose the correct answer from the options given below:

Arrange these interrupt call locations in order of priority (from highest to lowest priority) of the interrupts with whom they are associated with: 

A. 003CH 
B. 0024H 
C. 0034H 
D. 002CH 
Choose the correct answer from the options given below:

Match LIST-I with LIST-II

\[\begin{array}{|c|c|}\hline \text{LIST-I (Hex Code)} & \text{LIST-II (Instruction)} \\ \hline \text{A. 4F} & \text{I. MOV C,A} \\ \hline \text{B. 80} & \text{II. ADD B} \\ \hline \text{C. 47} & \text{III. MOV B,A} \\ \hline \text{D. 76} & \text{IV. HLT} \\ \hline \end{array}\] 

Choose the correct answer from the options given below:

128 $\times$ 8 RAM represents:

Which among the following statement(s) is/are true in the context of a page replacement policy? 

(A) The goal of a page replacement policy is to try to remove the page most likely to be referenced in the immediate future. 
(B) First in First Out (FIFO) and Least Recently Used (LRU) are the two most common page replacement algorithms. 
(C) The FIFO algorithm selects for replacement the page that has been in memory the longest time. 
(D) LRU algorithm is based on the assumption that the least recently loaded page is a better candidate for removal than the least recently used page. 
from the options given below: Choose the correct answer from the options given below:

The major difficulties that cause the instruction pipeline to deviate from its normal operation are: 

(A) Resource conflicts 
(B) Stack operation 
(C) Data dependency 
(D) Branch difficulties 
from the options given below: Choose the correct answer from the options given below: