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
Last Answer : A : 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
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
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
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.
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.
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
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”
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
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
Description : Identify the LIFO (Last In First Out) structure among the following: (1) Stack (2) Queue (3) De-queue (4) Array
Last Answer : Stack
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
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
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
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
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
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
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
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
Description : ___ mode of addressing is a form of implied addressing: a. Stack b. Array Cc. Queue d. ‘Binary
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
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
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
Description : Strong Artificial Intelligence is __________ 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 ... through the use of mental models implemented on a computer d) all of the mentioned
Last Answer : a) the embodiment of human intellectual capabilities within a computer
Description : Weak AI is 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 ... faculties through the use of mental models implemented on a computer. d. All of the above
Last Answer : c. the study of mental faculties through the use of mental models implemented on a computer
Description : Artificial intelligence is___________ 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 ... models implemented on a computer D. All of the above E. None of the above
Last Answer : D. All of the above
Description : Strong AI is__________ 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 ... mental models implemented on a computer D. All of the above E. None of the above
Last Answer : A. The embodiment of human intellectual capabilities within a computer.
Description : Weak AI is____________ 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 ... mental models implemented on a computer D. All of the above E. None of the above
Last Answer : C. The study of mental faculties through the use of mental models implemented on a computer
Description : How the buckets are stored in predicate indexing? a) Lists b) Stack c) Hashes d) None of the mentioned
Last Answer : c) Hashes
Description : The action ‘STACK(A, B)’ of a robot arm specify to _______________ a) Place block B on Block A b) Place blocks A, B on the table in that order c) Place blocks B, A on the table in that order d) Place block A on block B
Last Answer : d) Place block A on block B
Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False
Last Answer : 1) Intersection Search
Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned
Last Answer : d) All of the mentioned
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
Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned
Last Answer : c) Planning graph algorithm
Description : Which of the following elements constitutes the frame structure? a) Facts or Data b) Procedures and default values c) Frame names d) Frame reference in hierarchy
Last Answer : a) Facts or Data
Description : What is the frame? a) A way of representing knowledge b) Data Structure c) Data Type d) None of the mentioned
Last Answer : a) A way of representing knowledge
Description : What are Semantic Networks? a) A way of representing knowledge b) Data Structure c) Data Type d) None of the mentioned
Description : Which of the following is an advantage of using an expert system development tool? a) imposed structure b) knowledge engineering assistance c) rapid prototyping d) all of the mentioned
Last Answer : d) all of the mentioned
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.
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
Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search
Last Answer : b) The entire tree so far been generated must be stored in BFS
Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search
Last Answer : b) Hidden markov model
Description : Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned
Last Answer : b) Least commitment
Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search
Last Answer : a) Forward state-space search
Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm
Last Answer : d) Unify algorithm
Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned
Last Answer : a) Depth-first search algorithm
Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned