List of top Programming and Data Structure Questions

Which one of the following options is correct for the given data in the table?

Consider the following C program:

Consider the following C program:

The output of the above program is __________ . (Answer in integer)

Consider a stack data structure into which we can PUSH and POP records. Assume that each record pushed in the stack has a positive integer key and that all keys are distinct. We wish to augment the stack data structure with an \( O(1) \) time MIN operation that returns a pointer to the record with the smallest key present in the stack: 1) Without deleting the corresponding record, and 2) Without increasing the complexities of the standard stack operations. Which one or more of the following approach(es) can achieve it?
An array \( A \) of length \( n \) with distinct elements is said to be bitonic if there is an index \( 1 \leq i \leq n \) such that \( A[1..i] \) is sorted in the non-decreasing order and \( A[i+1 .. n] \) is sorted in the non-increasing order. Which ONE of the following represents the best possible asymptotic bound for the worst-case number of comparisons by an algorithm that searches for an element in a bitonic array \( A \)?

Consider the following C code segment: 

The output of the given C code segment is __________. (Answer in integer)

Consider an unordered list of \(N\) distinct integers. What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest in the list?

 Consider the following C program:

Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into the I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its lifetime (not counting the time the process enters the ready queue when it is run initially) is _________ (Answer in integer).

Consider the following C program


The value printed by the given C program is _________ (Answer in integer).

Consider the following C function definition. \begin{verbatim} int fX(char *a){ char *b = a; while(*b) b++; return b - a; } \end{verbatim} Which of the following statements is/are TRUE?
Consider the following C program. Assume parameters to a function are evaluated from right to left.} \begin{verbatim} #include stdio.h int g(int p) { printf("%d", p); return p; } int h(int q) { printf("%d", q); return q; } void f(int x, int y) { g(x); h(y); } int main() { f(g(10), h(20)); } \end{verbatim} Which one of the following options is the CORRECT output of the above C program?
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 operation is used to insert a new element at the front of the deque.
The postfix for a string is ABC + − D*, the actual string will be :
Which of the following is not true about queue ?
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 a classical encryption technique
Which of the following is an example of a classification problem
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
F1- score is used in binary classifiers. F1 can be defined as