Stack Data Structure follows which order for pushing and popping element from stack.

Examples of computational geometry problems include:

The quick sort algorithm is similar to which algorithm?

Let f(n) = n and g(n) = n^{(1+sin n)}, where n is a positive integer. Which of the following statements is/are correct?

I. f(n) = O(g(n)) II. f(n) = Ω(g(n))

What is a bipartite graph?

What will be the output of the following C code?

#include <stdlib.h>
int main()
{
srand(0);
printf("%d", rand()%100);
return 0;
}

Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE?

P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change

In a bipartite graph G with bipartitions A and B, what is the relationship between the sum of degrees of vertices in A and the sum of degrees of vertices in B?

Easha wants to implement an image viewer application to view images in a given folder. The application will be able to display an image and will also know what its next and previous images are at any given point of time so that the user can view the next/previous image by pressing the right/left keys on the keyboard. Which data structure is appropriate for Easha to use?

Consider the string abbccddeee. Each letter in the string must be assigned a binary code satisfying the following properties:

• For any two letters, the code assigned to one letter must not be a prefix of the code assigned to the other letter
• For any two letters of the same frequency, the letter which occurs earlier in the dictionary order is assigned a code whose length is at most the length of the code assigned to the other letter

Among the set of all binary code assignments which satisfy the above two properties, what is the minimum length of the encoded string?