List of top Programming and Data Structure Questions

A normal linear queue, if implemented using an array/list of size LIMIT, gets full when :

In queue following operation are performed enqueue(10), enqueue(20), enqueue(15), dequeue( ),enqueue(25), enqueue(35), dequeue( ), dequeue( ), what is the final content of queue.

The postfix for a string is ABC + − D*, the actual string will be :

The operation is used to insert a new element at the front of the deque.

Which of the following is not true about queue ?

Which of the following is a classical encryption technique

What is the size of the window for host A if the value of rwnd (Receiver Window) is 3000 bytes and the value of Cwnd (Cargestion Window) is 3500 bytes?

Which of the following is correct about F1-score

Geometric means to compute G-score is

Consider table with 100 slots. colloision are resolved using chaining, assuming simple uniform hashing what is the probability that the first 3 slots are unfilled after first 3 insertion

The test which was designed to provide a statisfactory operational definition of intelligence is called

Apply the master theorem on \(T(n) = 8T.(\frac{n}{2})+n^3\)

Which of the following is not a symmetric cipher model?

Which of the following is/ are shared by all threads in a process.
A. Program Counter 
B. Stack 
C. Address space 
D. Registers E. Queue 
Choose the correct answer from the options given below

Which of the following is an example of a classification problem

F1- score is used in binary classifiers. F1 can be defined as

What is the sub network address if the destination address is 200.45.34.56 and the sub net mask is 255.255.240.0?

Which of the following string does not belong to the set of strings represented by regular expression (a+b)* (ab+bba)

What is the maximum height of any AVL tree with 7 nodes? assume that the height of a tree with single node is 0

Which Al technique enables the computer to understand the associations and relationships between objects and events?

In a linked list, a pointer of the last node contains a special value, called

If f(x) = xis my friend, and P(x) = x is perfect, then the correct logical translation of the statement, "Some of my friends are not perfect" is

What will be the output of the following program assuming that the array begins at location 1002?
#include<stdio.h> 
void main() 
{int a[2] [3] [4] ={ {1,2,3,4,5,6,7,8,9,1,1,2,}, {2,1,4,7,6,7,8,9,0,0,0,0}}; 
printf("/n%u%u%u %d", a, *a, **a, ***a); 

What are the two types of search used to solve a problem in Al.

Match List I with List II

	List I		List II
A	Page replacement Policy	I	Circular wait
B	Deadlock	II	Page fault
C	Scheduling	III	Shortest job first
D	Dijakstra is banking algorithm	IV	Deadlock avoidance