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
Description : The _stack can be 4-word memory addressed by 2 bits from an up/down counter known as the stack pointer: a. FIFO b. PIPO c. SISO d. LIFO
Last Answer : d. LIFO
Description : Stack words on: a. LILO b. LIFO c. FIFO d. None of these
Last Answer : b. LIFO
Description : In 8087, _______ many register stack are there? And of _____ registers. These registers are used as _________ stack. a) 7, 40 bit, FIFO. b) 8, 60 bit, LILO. c) 8, 80 bit, LIFO d) 7, 80 bit, FILO.
Last Answer : b) 8, 60 bit, LILO.
Description : Which stack is used in 8085? a) FIFO b) LIFO c) FILO
Last Answer : b) LIFO
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 : 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 : 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 : In 8279 Strobed input mode, the control line goes low. The data on return lines is strobed in the ____. a) FIFO byte by byte b) FILO byte by byte c) LIFO byte by byte d) LILO byte by byte.
Last Answer : a) FIFO byte by byte
Description : Which one out of the following is not an inventory valuation method? (a) FIFO (b) LIFO (c) Weighted Average (d) EOQ
Last Answer : (d) EOQ
Description : During a merger and acquisition transaction, the ability to find and use good comparable data for a valuation is relatively ____________. a) easy because each successful company within an industry ... depth, product diversity and access to lines of credit seldom match the company being valued
Last Answer : d) difficult because size differential, management depth, product diversity and access to lines of credit seldom match the company being valued
Description : If the two companies have different accounting policies in respect of the same item, then they make necessary changes to adopt.............. Accounting policies. (A)Lifo method (B)Fifo method (C)Weighted method (D)Uniform
Last Answer : (D)Uniform
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 : 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 : 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 : 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 : 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
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 : 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 : Which is used to store critical pieces of data during subroutines and interrupts: a. Stack b. Queue c. Accumulator d. Data register
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 : ……………. 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 : 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 : 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 : 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 : 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 : How the buckets are stored in predicate indexing? a) Lists b) Stack c) Hashes d) None of the mentioned
Last Answer : c) Hashes
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 : 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 : In LISP, the function returns t if is a CONS cell and nil otherwise ________ a) (cons ) b) (consp ) c) (eq ) d) (cous =)
Last Answer : b) (consp )
Description : ________ is/are the well known Expert System/s for medical diagnosis systems. a) MYSIN b) CADUCEUS c) DENDRAL d) SMH.PAL
Last Answer : a) MYSIN
Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost
Last Answer : c) Estimated cost of cheapest path from root to goal node
Description : A search algorithm takes _________ as an input and returns ________ as an output. a) Input, output b) Problem, solution c) Solution, problem d) Parameters, sequence of actions
Last Answer : b) Problem, solution
Description : An agent is composed of ________ a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program
Last Answer : d) Architecture and Program
Description : A series of Artificial Intelligence systems, developed by Pat Langley to explore the role of heuristics in scientific discovery is ________ a) RAMD b) BACON c) MIT d) DU
Last Answer : b) BACON
Description : Neuron can send ________ signal at a time. A. multiple B. one C. none D. any number of
Last Answer : B. one
Description : Each connection link in ANN is associated with ________ which has information about the input signal. A. neurons B. weights C. bias D. activation function
Last Answer : B. weights
Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above
Last Answer : B. Logic level
Description : Automated vehicle is an example of ______ a) Supervised learning b) Unsupervised learning c) Active learning d) Reinforcement learning
Last Answer : a) Supervised learning
Description : DFS is ______ efficient and BFS is __________ efficient. a) Space, Time b) Time, Space c) Time, Time d) Space, Space
Last Answer : a) Space, Time
Description : Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest
Last Answer : a) Shallowest
Description : Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost
Last Answer : c) Deepest
Description : The process of removing detail from a given state representation is called ______ a) Extraction b) Abstraction c) Information Retrieval d) Mining of data
Last Answer : b) Abstraction
Description : Automated vehicle is an example of ______. a) Supervised learning b) Unsupervised learning c) Active learning d) Reinforcement learning
Description : ______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned
Last Answer : c) Fuzzy Set