Best-First search can be implemented using the following data structure A : Queue B : Stack C : Priority Queue D : Circular Queue

Best-First search can be implemented using the following data
structure
A : Queue
B : Stack
C : Priority Queue
D : Circular Queue
by

1 Answer

Answer :

C : Priority Queue
by

Related questions

Best-First search can be implemented using the following data structure A : Queue B : Stack C : Priority Queue D : Circular Queue

Description : Best-First search can be implemented using the following data structure A : Queue B : Stack C : Priority Queue D : Circular Queue

Last Answer : C : Priority Queue

Best-First search can be implemented using the following data structure A : Queue B : Stack C : Priority Queue D : Circular Queue

Description : Best-First search can be implemented using the following data structure A : Queue B : Stack C : Priority Queue D : Circular Queue

Last Answer : A : Queue

Best-First search can be implemented using the following data structure A : Queue B : Stack C : Priority Queue D : Circular Queue

Description : Best-First search can be implemented using the following data structure A : Queue B : Stack C : Priority Queue D : Circular Queue

Last Answer : C : Priority Queue

Best-First search can be implemented using the following data structure. a) Queue b) Stack c) Priority Queue d) Circular Queue

Description : Best-First search can be implemented using the following data structure. a) Queue b) Stack c) Priority Queue d) Circular Queue

Last Answer : c) Priority Queue

Consider the following statements : S1: A queue can be implemented using two stacks. S2: A stack can be implemented using two queues. Which of the following is correct ? (A) S1 is correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) Both S1 and S2 are correct. (D) Both S1 and S2 are not correct.

Description : Consider the following statements : S1: A queue can be implemented using two stacks. S2: A stack can be implemented using two queues. Which of the following is correct ? (A) S1 is correct and S2 is not correct. ( ... S2 is correct. (C) Both S1 and S2 are correct. (D) Both S1 and S2 are not correct.

Last Answer : (C) Both S1 and S2 are correct.

LIFO is ______ where as FIFO is ________ a) Stack, Queue b) Queue, Stack c) Priority Queue, Stack d) Stack. Priority Queue

Description : LIFO is ______ where as FIFO is ________ a) Stack, Queue b) Queue, Stack c) Priority Queue, Stack d) Stack. Priority Queue

Last Answer : a) Stack, Queue

A data structure that follows the FIFO principle. a) Queue b) LL c) Stack d) Union

Description : A data structure that follows the FIFO principle. a) Queue b) LL c) Stack d) Union

Last Answer : Answer: c Explanation: The answer is Stack. A stack follows the FIFO principle. FIFO stands for First In First Out This set of Tricky Computer Fundamentals Questions and Answers focuses on “Flowcharting Rules”

Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue may be complex structures that are ordered on one or several fields. Which of the following is correct? (A) Both S1 and S2 are incorrect. (B) S1 is correct and S2 is incorrect. (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.

Description : Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue ... . (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.

Last Answer : (D) Both S1 and S2 are correct.

Identify the LIFO (Last In First Out) structure among the following: (1) Stack (2) Queue (3) De-queue (4) Array

Description : Identify the LIFO (Last In First Out) structure among the following: (1) Stack (2) Queue (3) De-queue (4) Array

Last Answer : Stack

Which of the following is not the type of queue? A) Ordinary queue B) Single ended queue C) Circular queue D) Priority queue

Description : Which of the following is not the type of queue? A) Ordinary queue B) Single ended queue C) Circular queue D) Priority queue

Last Answer : B) Single ended queue

Which one of the following is not a linear data structure? (A) Array (B) Binary Tree (C) Queue (D) Stack

Description : Which one of the following is not a linear data structure? (A) Array (B) Binary Tree (C) Queue (D) Stack

Last Answer : (B) Binary Tree 

Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

Description : Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

Last Answer : b) Breadth-first search

To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Description : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Last Answer : d) Planning Graphs

A system wherein items are added from one and removed from the other end. a) Stack b) Queue c) Linked List d) Array

Description : A system wherein items are added from one and removed from the other end. a) Stack b) Queue c) Linked List d) Array

Last Answer : Answer: b Explanation: In a queue, the items are inserted from the rear end and deleted from the front end

Which is used to store critical pieces of data during subroutines and interrupts: a. Stack b. Queue c. Accumulator d. Data register

Description : Which is used to store critical pieces of data during subroutines and interrupts: a. Stack b. Queue c. Accumulator d. Data register

Last Answer : a. Stack

………… is very useful in situation when data have to stored and then retrieved in reverse order. A) Stack B) Queue C) List D) Link list

Description : ………… is very useful in situation when data have to stored and then retrieved in reverse order. A) Stack B) Queue C) List D) Link list

Last Answer : A) Stack

The processor uses the stack to keep track of where the items are stored on it this by using the: a. Stack pointer register b. Queue pointer register c. Both a & b d. None of these

Description : The processor uses the stack to keep track of where the items are stored on it this by using the: a. Stack pointer register b. Queue pointer register c. Both a & b d. None of these

Last Answer : a. Stack pointer register

If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of the pointers change (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Description : If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of ... (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Last Answer : (C) Only rear pointer changes

When subroutine is called contents of program counter is location address of __ instruction following call instruction is stored on _ __and program execution is transferred to __ address. a. Non executable, pointer and subroutine b. Executable, Stack and Main program Cc. Executable, Queue and Subroutine d. Executable, Stack and Subroutine

Description : When subroutine is called contents of program counter is location address of __ instruction following call instruction is stored on _ __and program execution is transferred to __ address. a. Non ... , Stack and Main program Cc. Executable, Queue and Subroutine d. Executable, Stack and Subroutine

Last Answer : d. Executable, Stack and Subroutine

___ mode of addressing is a form of implied addressing: a. Stack b. Array Cc. Queue d. ‘Binary

Description : ___ mode of addressing is a form of implied addressing: a. Stack b. Array Cc. Queue d. ‘Binary

Last Answer : a. Stack

The subprogram finish the return instruction recovers the return address from the: a. Queue b. Stack c. Program counter d. Pointer

Description : The subprogram finish the return instruction recovers the return address from the: a. Queue b. Stack c. Program counter d. Pointer

Last Answer : b. Stack

……………. Is a pile in which items are added at one end and removed from the other. A) Stack B) Queue C) List D) None of the above

Description : ……………. Is a pile in which items are added at one end and removed from the other. A) Stack B) Queue C) List D) None of the above

Last Answer : B) Queue

The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ................... (1) A (2) B (3) F (4) G

Description : The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed ... The popped item is ................... (1) A (2) B (3) F (4) G

Last Answer : Answer: 2

In a circular queue the value of r will be .. A) r=r+1 B) r=(r+1)% [QUEUE_SIZE – 1] C) r=(r+1)% QUEUE_SIZE D) r=(r-1)% QUEUE_SIZE

Description : In a circular queue the value of r will be .. A) r=r+1 B) r=(r+1)% [QUEUE_SIZE – 1] C) r=(r+1)% QUEUE_SIZE D) r=(r-1)% QUEUE_SIZE

Last Answer : C) r=(r+1)% QUEUE_SIZE

Which data structure conveniently used to implement BFS? a) Stacks b) Queues c) Priority Queues d) All of the mentioned

Description : Which data structure conveniently used to implement BFS? a) Stacks b) Queues c) Priority Queues d) All of the mentioned

Last Answer : b) Queues

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (A) OS maintains only scheduling and accounting information for each thread. (B) OS maintains only CPU registers for each thread. (C) OS does not maintain a separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack

Description : The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack

Last Answer : (C) Scheduling parameters

what does the term keyword prominence refer to?A. It refers to the importance attached to getting the right keyword density.  B.It refers to the fact that the keywords in bold font are given priority by the search engines.  C.It refers to the fact that the importance of choosing high traffic keywords leads to the best return on investment.  D.It refers to the fact that the keywords placed in important parts of a webpage are given priority by the search engines

Description : what does the term keyword prominence refer to? A. It refers to the importance attached to getting the right keyword density.  B.It refers to the fact that the keywords in bold font are ... fact that the keywords placed in important parts of a webpage are given priority by the search engines

Last Answer : D.It refers to the fact that the keywords placed in important parts of a webpage are given priority by the search engines

Which of the following computer implemented binary numbers, perform calculations using electronics and implemented separate computation and memory for the first time? A) Mark I B) ABC C) Z3 D) None of above

Description : Which of the following computer implemented binary numbers, perform calculations using electronics and implemented separate computation and memory for the first time? A) Mark I B) ABC C) Z3 D) None of above

Last Answer : Answer : B

Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Description : Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Last Answer : b) Depth-first search

................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Description : ................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search

Last Answer : (C) Alpha-beta pruning procedure

A technique used by codes to convert an analog signal into a digital bit stream is known as A) Pulse code modulation B) Pulse stretcher C) Query processing D) Queue management

Description : A technique used by codes to convert an analog signal into a digital bit stream is known as A) Pulse code modulation B) Pulse stretcher C) Query processing D) Queue management

Last Answer : Answer : A

The structure of the stack is _______ type structure: a. First in last out b. Last in last out c. Both a & b d. None of these

Description : The structure of the stack is _______ type structure: a. First in last out b. Last in last out c. Both a & b d. None of these

Last Answer : a. First in last out

____ is a data-centric middleware standard for device-to-device and machine-to-machine communication. A. Data Distribution Serviced (DDS) B. Advance Message Queuing Protocol (AMQP) C. Extensible Messaging and Presence Protocol (XMPP) D. Message Queue Telemetry Transport (MQTT)

Description : ____ is a data-centric middleware standard for device-to-device and machine-to-machine communication. A. Data Distribution Serviced (DDS) B. Advance Message Queuing Protocol (AMQP) C. Extensible Messaging and Presence Protocol (XMPP) D. Message Queue Telemetry Transport (MQTT)

Last Answer : A. Data Distribution Serviced (DDS) 

Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively (A) 236 and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Description : Consider a disk queue with request for input/output to block on cylinders  98, 183, 37, 122, 14, 124, 65, 67  in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208 

Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Description : Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction ... . The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Last Answer : (2) 173

Explain Inter-process Communication (IPC) using mailbox/queue.

Description : Explain Inter-process Communication (IPC) using mailbox/queue.

Last Answer : Inter-process communication using mailbox: Mailbox is the Interprocess communication mechanism. A process puts a data message for another process in the mailbox. Mailbox is also called as message exchange. ... a message. In mailbox IPC the sender need not to know the name of the receiver.

Programs are executed on the basis of a priority number in a A) Batch processing system B) Multiprogramming C) Time sharing D) None of these

Description : Programs are executed on the basis of a priority number in a A) Batch processing system B) Multiprogramming C) Time sharing D) None of these

Last Answer : Answer : B

Programs are executed on the basis of a priority number in a: a) Batch processing system b) Multi-Programming c) Time sharing d) Real Time e) None of these

Description : Programs are executed on the basis of a priority number in a: a) Batch processing system b) Multi-Programming c) Time sharing d) Real Time e) None of these

Last Answer : a) Batch processing system

Programs are execuated on the basis of a priority number in a- 1) Batch Processing System 2) Multiprogramming 3) Time sharing 4) None of these

Description : Programs are execuated on the basis of a priority number in a- 1) Batch Processing System 2) Multiprogramming 3) Time sharing 4) None of these

Last Answer : 2) Multiprogramming

Programs are execuated on the basis of a priority number in a 1 Batch Processing System 2 Multiprogramming 3 Time sharing 4 None of these

Description : Programs are execuated on the basis of a priority number in a 1 Batch Processing System 2 Multiprogramming 3 Time sharing 4 None of these

Last Answer : 2 Multiprogramming

When collecting evidence, you should always try to proceed from a. Least volatile to most volatile evidence b. Most volatile to least volatile evidence c. All evidence at same priority d. Least then medium then most volatile evidence

Description : When collecting evidence, you should always try to proceed from a. Least volatile to most volatile evidence b. Most volatile to least volatile evidence c. All evidence at same priority d. Least then medium then most volatile evidence

Last Answer : b. Most volatile to least volatile evidence

Under which Act are the KYC norms implemented? A. SEBI Act 1992 B. Foreign Contribution and Regulation Act, 1976 C. Prevention of Money laundering Act 2002 D. Banking Regulation Act, 1949 E. Both (C) and (D)

Description : Under which Act are the KYC norms implemented? A. SEBI Act 1992 B. Foreign Contribution and Regulation Act, 1976 C. Prevention of Money laundering Act 2002 D. Banking Regulation Act, 1949 E. Both (C) and (D)

Last Answer : C. Prevention of Money laundering Act 2002 Explanation: KYC guidelines/instructions are issued under under Prevention of Money laundering Act PMLA, 2002.

Which among the following is correct: a) A firewall is a system designed to prevent unauthorized access to or from a private network. b) Firewalls can be implemented in both hardware and software or a combination of both. c) Both of Above d) None of these

Description : Which among the following is correct: a) A firewall is a system designed to prevent unauthorized access to or from a private network. b) Firewalls can be implemented in both hardware and software or a combination of both. c) Both of Above d) None of these

Last Answer : c) Both of Above

Weak AI is ⮚ a set of computer programs that produce output that would be considered to reflect intelligence if it were generated by humans. ⮚ the study of mental faculties through the use of mental models implemented on a computer. ⮚ the embodiment of human intellectual capabilities within a computer. ⮚ All of the above

Description : Weak AI is ⮚ a set of computer programs that produce output that would be considered to reflect intelligence if it were generated by humans. ⮚ the study of mental faculties through the use ... a computer. ⮚ the embodiment of human intellectual capabilities within a computer. ⮚ All of the above

Last Answer : ⮚ the study of mental faculties through the use of mental models implemented on a computer.

Multiplexing in a time division multiplexer occurs based upon A. the position of a frame within the group of frames B. the positioning of data within a frame C. the priority assigned to a connected device D. the activity of a connected device

Description : Multiplexing in a time division multiplexer occurs based upon A. the position of a frame within the group of frames B. the positioning of data within a frame C. the priority assigned to a connected device D. the activity of a connected device

Last Answer : B. the positioning of data within a frame

Data Link Control Protocol (HDLC) is implemented at the ……… A. Data link layer B. Network layer C. transport layer D. Physical layer

Description : Data Link Control Protocol (HDLC) is implemented at the ……… A. Data link layer B. Network layer C. transport layer D. Physical layer

Last Answer : A. receive sliding window.

What are the drawbacks for Layers? a) It is often necessary to pass data through many layers, which can slow performance significantly b) Layers support information hiding c) Multi-layered programs can be hard to debug because operations tend to be implemented through a series of calls across layers d) None of the mentioned

Description : What are the drawbacks for Layers? a) It is often necessary to pass data through many layers, which can slow performance significantly b) Layers support information hiding c) Multi-layered programs ... tend to be implemented through a series of calls across layers d) None of the mentioned

Last Answer : Multi-layered programs can be hard to debug because operations tend to be implemented through a series of calls across layers

What is Data Abstraction? How is it implemented in Java?

Description : What is Data Abstraction? How is it implemented in Java?

Last Answer : A: Act of representing only essential features without including its background details is called Abstraction. Data Abstraction can also be defined as the process of hiding the implementation details and showing ... Java, it is implemented by the use of interfaces or by making the class abstract.

What is Weak AI? a) the embodiment of human intellectual capabilities within a computer b) a set of computer programs that produce output that would be considered to reflect intelligence if it were generated by humans c) the study of mental faculties using mental models implemented on a computer d) all of the mentioned

Description : What is Weak AI? a) the embodiment of human intellectual capabilities within a computer b) a set of computer programs that produce output that would be considered to reflect intelligence if it ... the study of mental faculties using mental models implemented on a computer d) all of the mentioned

Last Answer : c) the study of mental faculties using mental models implemented on a computer