Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)
A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing addFront and addRear? (Assume ‘m’ to be the size of the stack and ‘n’ to be the number of elements)
Consider a standard circular queue ‘q’ implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q[1], .... q[10]. The front and rear pointers are initialized to point at q[2]. In which position will the ninth element be added ?
What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue
A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let enqueue be implemented by inserting a new node at the head, and dequeue be implemented by deletion of a node from the tail. Which one of the following is the time complexity of the most time-efficient implementation of enqueue and dequeue, respectively, for this data structure?
Which of the following statements are true?
Statement I Big data refers to no precise quantity, but generally refers to data in the range of Petabytes and Exabyte, i.e. billions to trillions of records, all from various sources. Big data is generated much faster. than traditional data in much larger quantities.
Statement II Big data interests industries because they are able to learn more patterns and curious variances than smaller data sets, with the capability to provide valuable insights into consumer behaviour, weather systems, financial market activity, or other phenomena.
Statement III Various departments and product lines use various applications within most organisations and store data in separate datasets. These separate databases may contain similar data, but data from one data base to another is not always consistent. This is called data silo.
Q.(1-4): Answer the questions on the basis of the information given below. * F,G and H are insurance companies , Q,R,S and T are private detectives .Each detective works for at least one of the insurance companies. * Q always works for F and at least one of the other companies. Some of the time G employs only one of these detectives,' the rest of the time it employs exactly two of them. *F and H each employ exactly two of these detectives all the time. If R works for H only, and if S works for G and H only, T works for--
Statements followed by some conclusions are given below. Statements:  A. Ravi works more than Meera, who works 8 hours per day. B. Yuvi works 9 hours per day, which is 1 hour less than Ravi. Conclusions: I. Ravi works 8 hours. II. Yuvi and Ravi per day both works more than Meera. Find which of the given conclusions logically follow from the given statements.  A. Only conclusion I follows. B. Only conclusion II follows. C. Both I and II follow. D. Neither I nor II follows.
Five people L, M, N, O and P are standing in a queue. N is standing between L and P. L is just behind M and M is second in the queue. Who is fourth in the queue?
Five people P, Q, R, S and T are standing in a queue. R is standing between P and T. P is just behind Q and Q is second in the queue. Who is second last in the queue?