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)
Which of the following query returns the average throughput for the most recent sessions? FROM sys.dm_cdc_log_scan_sessions WHERE session_id = 0 b) SELECT command_count/duration AS FROM sys.dm_cdc_log_scan_sessions WHERE session_id = 0 c) SELECT command_count/duration AS FROM sys.dm_cdc_log_scan_sesss WHERE session_id = 0 d) None of the mentioned
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 sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario. One or more of the following security violations can take place. 1) S can launch a birthday attack to replace m with a fraudulent message. 2) A third-party attacker can launch a birthday attack to replace m with a fraudulent message.  3) R can launch a birthday attack to replace m with a fraudulent message. Which of the following are possible security violations?
To obtain a list of all the functions defined under sys module, which of the following functions can be used? ) d) print(dir(sys))
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
A question and three statements labeled (I), (II), and (III) are given. You have to decide which statement(s) is/are sufficient to answer the question.  How many people are in the queue? Statements : I. A man is 3rd from the beginning of the queue. II. A man is 20th from the center of the queue. III. A man is 7th from the end and 17th from the beginning.
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?