In linked list implementation of a queue, the important condition for a queue to be empty is?

How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

How many queues are needed to implement a stack. Consider the situation where no other data structure like arrays, linked list is available to you.

Which of the following is true about linked list implementation of queue?

Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.

What is the worst case time complexity of a sequence of n MultiDequeue() operations on an initially empty queue?

Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?

Let Q denote a queue containing sixteen numbers and S be an empty stack. Head(Q) returns the element at the head of the queue Q without removing it from Q. Similarly Top(S) returns the element at the top of S without removing it from S. Consider the algorithm given below.

The maximum possible number of iterations of the while loop in the algorithm is

Following is C like pseudo code of a function that takes a number as an argument, and uses a stack S to do processing.

What does the above function do in general?

The following postfix expression with single digit operands is evaluated using a stack:

Note that ^ is the exponentiation operator. The top two elements of the stack after the first * is evaluated are:

If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values

The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is

Consider the following operations performed on a stack of size 5 : Push (a); Pop() ; Push(b); Push(c); Pop(); Push(d); Pop();Pop(); Push (e) Which of the following statements is correct?

Which of the following is not an inherent application of stack?

If you're building a system for online voting where each vote is unique, but the order in which votes are cast doesn't matter, which interface would be the best pick?

When designing an application to manage a restaurant's waiting list where customers are served based on their arrival, which interface would be best suited?

What distinguishes the LinkedHashSet class from the HashSet class in the Java Collections framework?

If you need a data structure that can be accessed and modified by multiple threads safely, which class would you select?

When you need a resizable array with efficient random access, which class is the most relevant choice?

If you need a collection that ensures a first-in-first-out (FIFO) behavior, which interface would be the best fit?

Which interface ensures element order based on their natural ordering or by a provided comparator?

When designing a data structure that allows duplicates, maintains insertion order, and provides random access, which interface is the most suitable?

Which interface is best suited to represent a group of objects as a single unit?

What's the primary advantage of using the SortedSet Interface over the standard Set Interface?

Which of the following statements are true with respect to sets as objects of Hashset?

Which of the following statements are correct in relation to collections in Java?

Which of the following interfaces declares a core method that all collections will have?

Which of the following statements are correct with respect to a Map in Java?

Which of the following interfaces are not a part of the Java's Collection Framework?

Which of the following statements are correct with respect to a List in Java?

Which of the following interfaces must contain a unique element?

Which of the following method deletes all the elements from invoking (calling) collections?

Which of the following statements are true with respect to a stack?

Which of the following classes implement the Queue interface?

What is Collection in Java?

Which of these interface is not part of Java’s collection framework?

 What will be the output of the  Java program?

Which of these return type of hasNext() method of an iterator?

Which of these exceptions is thrown by remover() method?

Which of these methods deletes all the elements from invoking collection?

Which of these interface declares core method that all collections will have?

Which of these is an incorrect form of using method max() to obtain maximum element?

Which of these methods can convert an object into a List?

Which of these is true about unmodifiableCollection() method?

Which of these is static variable defined in Collections?

What implementation of Iterator can traverse a collection in both directions?

Which is faster and uses less memory?

What will be output of given code

Which interface does java.util.Hashtable implement?

You need to store elements in a collection that guarantees that no duplicates are stored and all elements can be accessed in natural order.

Which interface provides that capability?

You need to store elements in a collection that guarantees that no duplicates are stored and all elements can be accessed in natural order.

Which interface provides that capability?

Which collection class allows you to grow or shrink its size and provides indexed access to its elements, but whose methods are not synchronized?

The default capacity of a Vector is:

The Comparable interface contains which called?

Find the output

public class TreeMapTest {

public static void main(String args[]) {

Map<Integer, String> m = new TreeMap<Integer, String>();

m.put(11, "audi");

m.put(null, null);

m.put(11, "bmw");

m.put(null, "ferrari");

System.out.println(m.size());

System.out.println(m);

}

public class MyClass {

public static void main(String args[]) {

Map<String, String> hashMap = new HashMap<String, String>();

hashMap.put(new String("a"), "audi");

hashMap.put(new String("a"), "ferrari");

System.out.println(hashMap);

}

}

Deque and Queue are derived from

What will be output of given code

Which is best suited to a multi-threaded environment?

TreeMap implements?

Which of these is synchronized?

TreeMap

How can you sort given HashMap on basis of values

What does Collections.sort internally uses when number of elements are less than 7?

What does Collections.sort internally uses when number of elements are greater than 7?

In linked list implementation of a queue, where does a new element be inserted?

In linked list implementation of a queue, the important condition for a queue to be empty is?

In a circular queue, how do you increment the rear end of the queue?

Which is the application of a queue?

If REAR, FRONT are the queue variables, then identify correct statement while inserting a value

Time complexity of enqueue is

Number of queues required to implement a stack is

A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index

In linked list implementation of a queue, where does a new element be inserted?

In linked list implementation of a queue, from where is the item deleted?

Let the following circular queue can accommodate maximum six elements with the following data

front = 2 rear = 4

queue = _______; L, M, N, ___, ___

What will happen after ADD O operation takes place?

What is the reason for using a "circular queue" instead of a regular one?

One difference between a queue and a stack is:

If the numbers 5, 10, 3, 42 are enqueued onto a queue in that order, what does dequeue return?

The essential condition which is checked before insertion in a linked queue is?

A queue of characters currently contained A,B,C,D What would be the contents of queue after the following operationDELETE, ADD W, ADD X, DELETE, ADD Y.

If front=rear ,then the queue is?

Insertion operation is done at only one end and

deletion operation is done at both the ends

Deletion operation is done at only one end and insertion

operation is done at both the ends