If 12 men can complete a piece of work in 8 days, how many men will complete the same work in 6 days?

The average of 8 numbers is 20. If one number is removed, the average becomes 19. Find the removed number.

A sum of money becomes Rs. 800 in 2 years and Rs. 920 in 3 years at simple interest. Find the principal.

A shopkeeper allows a discount of 10% on the marked price and still gains 20%. Find the marked price if the cost price is Rs. 450.

If the ratio of two numbers is 3:5 and their sum is 64, find the numbers.

A and B together can do a piece of work in 12 days. A alone can do it in 18 days. In how many days can B alone complete it?

The speed of a boat in still water is 10 km/h, and the speed of the stream is 4 km/h. Find the time taken to travel 24 km downstream.

The sum of three consecutive even numbers is 84. Find the numbers.

A person covers 60 km at 20 km/h and another 60 km at 30 km/h. Find his average speed.

A can finish a work in 15 days and B in 20 days. They work together for 5 days. How much of the work is left?

The population of a town increases by 10% every year. If the present population is 10,000, what will it be after 2 years?

If selling price is double the cost price, find the profit percentage.

A sum of Rs. 5000 is borrowed at 10% compound interest per annum. Find the amount after 2 years.

Two pipes can fill a tank in 15 min and 20 min respectively. A third pipe can empty it in 30 min. How long will it take to fill the tank if all three pipes are opened together?

A card is drawn from a pack of 52 cards. Find the probability that it is a red king.

The difference between the simple and compound interest on Rs. 2500 for 2 years at 10% p.a. is Rs. 2.5. Verify the result.

If the cost of 12 pens is equal to that of 8 pencils, find the ratio of the cost of a pen to that of a pencil.

The area of a circle is 154 cm². Find its radius. (Take π = 22/7)

If 3A = 2B = 4C, find the ratio A : B : C.

What is the output of this code? public class Test1 { public static void main(String[] args) { try { System.out.println("Opening file..."); int result = 10 / 0; System.out.println("Reading file..."); } catch (ArithmeticException e) { System.out.println("Division by zero error"); } finally { System.out.println("Closing file..."); } } }

What is the output of the following code? String s1 = "Java"; String s2 = new String("Java"); s2 = s2.intern(); System.out.println(s1 == s2);

Predict the output of the following code: public class Test3 { public static void main(String[] args) { StringBuilder sb1 = new StringBuilder("Hello"); StringBuilder sb2 = new StringBuilder("Hello"); System.out.println(sb1.equals(sb2)); } }

What is the output of the following code? public class Test4 { public static void main(String[] args) { String str = "hello world"; String[] parts = str.split(" "); System.out.println(parts.length); } }

Which method can be used to get the length of an array in Java?

What is the output of the following code? outer: for (int i = 1; i <= 3; i++) { for (int j = 1; j <= 3; j++) { if (i == 2 && j == 2) break outer; System.out.print(i + "" + j + " "); } }

Which statement about threads in Java is correct?

What is the output of the following code? class MyThread extends Thread { public void run() { System.out.print("Running "); } } public class ThreadTest1 { public static void main(String[] args) { MyThread t = new MyThread(); t.start(); System.out.print("Main "); } }

What is the output of the following code? public class Test5 { public static void main(String[] args) { int[] arr = new int[5]; System.out.println(arr[2]); } }

What is the output of the following code? public class Test6 { public static void main(String[] args) { int x = 10; int y = ++x * x--; System.out.println(y); }}

31.  The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function. 

/* Link list node */

struct node

{

    int data;

    struct node* next;

};

/* head_ref is a double pointer which points to head (or start) pointer

  of linked list */

static void reverse(struct node** head_ref)

{

    struct node* prev   = NULL;

    struct node* current = *head_ref;

    struct node* next;

    while (current != NULL)

    {

        next  = current->next; 

        current->next = prev;  

        prev = current;

        current = next;

    }

    /*MISSING STATEMENT HERE*/

}

What is the output of following function in which start is pointing to the first node of the following linked list 1->2->3->4->5->6 ? void fun(struct node* start) { if(start == NULL) return; printf("%d ", start->data); if(start->next!= NULL ) fun(start->next->next); printf("%d ", start->data); }

The following C function takes a simply-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank. Choose the correct alternative that contain the correct pseudocode for the blank line.

Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest?

Consider the function f defined below. struct item { int data; struct item * next; }; int f(struct item *p) { return ( (p == NULL) || (p->next == NULL) || ((p->data <= p->next->data) && f(p->next)) ); }

A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p point such that both the operations enQueue and deQueue can be performed in constant time?

Is it possible to create a doubly linked list using only one pointer with every node?

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?

Which of the following is an application of XOR-linked lists?

Consider the following function to traverse a linked list. void traverse(struct Node *head) { while (head->next != NULL) { printf("%d ", head->data); head = head->next; } } Which of the following is FALSE about above function?

In a doubly linked list, the number of pointers affected for an insertion operation will be

Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation can not be implemented in O(1) time?

If every node u in G is adjacent to every other node v in G, A graph is said to be

In a balance binary tree the height of two sub trees of every node can not differ by more than

In a Heap tree

Breadth first search uses __________ as an auxiliary structure to hold nodes for future processing.

Prims algorithm is based on ____________ method

The minimum number of interchanges needed to convert the array 89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70 into a heap with the maximum element at the root is

Which of the following is a valid heap ?

Given a disjoint-set forest with N elements, what is the maximum height of the trees in the forest after M union operations if union by rank and path compression techniques are used?

Which of the following is not true?

The following code snippet is the function to insert a string in a trie. Find the missing line. void insert(char *str) { TrieNode *node = root; for (int i = 0; i < length; i++) { int index = str[i] - 'a'; if (node->children[index] == NULL) node->children[index] = (TrieNode *)malloc(sizeof(TrieNode)); } node->isEndOfWord = 1; }

Which data structure is used to perform level-order traversal on a binary tree?

What is the minimum number of queues required for implementing a stack?

Which data structure is used to check a palindrome?

What is the advantage of external hashing over open addressing?

What is the complexity of searching in direct addressing?

What is the maximum depth of a tree with n strings of length m?