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

1 Answer

Answer :

Stack

Related questions

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 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 : 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 : ___ mode of addressing is a form of implied addressing: a. Stack b. Array Cc. Queue d. ‘Binary

Last Answer : a. Stack

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 : 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

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 : 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 : 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

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 : 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 : 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

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 : ……………. 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 : 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 : 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

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 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 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 : What is the full form of 'LIFO' ? -How To ?

Last Answer : The full form of 'LIFO' is Last In First Out

Description : What is the full form of LIFO ?

Last Answer : The full form of LIFO Last In First Out.

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 : Calculate the value of closing stock from the following according to LIFO method: 1st January, 2014: Opening balance: 50 units @ Rs. 4 Receipts: 5th January, 2014: 100 units @ Rs. 5 12th January, 2014: 200 units @ Rs. 4.50 ... , 2014: 150 units (a) Rs. 765 (b) Rs. 805 (c) Rs. 786 (d) Rs. 700

Last Answer : (b) Rs. 805

Description : In case of rising prices (inflation), LIFO will: (a) provide lowest value of closing stock and profit (b) provide highest value of closing stock and profit (c) provide highest value ... but lowest value of profit (d) provide highest value of profit but lowest value of closing stock

Last Answer : (a) provide lowest value of closing stock and profit

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 : Find out who is not the inventor of transistors among following names A) John Burdeen B) William Shockley C) Walter Brattain D) Lee de Forest

Last Answer : Answer : D

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

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 : What is the difference between array data structure and raw data structure?

Last Answer : Data typing is static, but weakly enforced

Description : To accept 100 different values into the array we require A) Loop B) If condition C) Function D) Structure

Last Answer : A) Loop

Description : Solids may be considered to be either crystalline noncrystalline. The basic difference between them is that a crystal, in contrast to a noncrystal: w) has a sharp melting point x) has an irregular array of atoms y) exhibits double refraction z) has a completely regular atomic or molecular structure

Last Answer : ANSWER: Z -- HAS A COMPLETELY REGULAR ATOMIC OR MOLECULAR STRUCTURE

Description : Which of the following cannot be passed to a function in C++? (1) Constant (2) Structure (3) Array (4) Header file

Last Answer : Answer: 4

Description : Platelets have a wide array of functions in inflammation. Which of the following are among these? a. Synthesis and release of vasoactive eicosanoids b. Release of chemotactic factors c. ... coating of bacterial and tumor cells d. Increase of vascular permeability e. Phagocytosis of bacteria

Last Answer : Answer: a, b, c, d Platelets are anucleated cells derived from megakaryocytes in the bone marrow. Their central role in hemostasis is well known. Platelets possess a wide ... primitive precursor inflammatory cell. Platelets serve primarily as an amplifier or modulator of the inflammatory response

Description : This refers to an area in the memory used for temporary storage of information on the basis of “Last in First out”. A. Core B. Register C. Flag D. Stack

Last Answer : D. Stack

Description : An area in the memory used for temporary storage of information, on “Last in First out” basis. A. Core B. Register C. Flag D. Stack

Last Answer : D. Stack

Description : By defining the _ __ register as last in first out stack the sequence can handle nested subroutines: a. S b. J ce. R d. T

Last Answer : ce. R

Description : Stack is also called as A) Last in first out B) First in last out C) Last in last out D) First in first out

Last Answer : A) Last in first out

Description : First made but last gone. Always at the bottom of the stack. What am I? -Riddles

Last Answer : The First Pancake.

Description : Mr. Dutta owns a Textile Company and he has a tie up with Advertising Agencies ABC ltd. and ABC advertises Mr. Dutta’s Companies’ Products. Identify the concept. a. Delegation b. De Centralization c. Out sourcing d. Division of work

Last Answer : c. Out sourcing

Description : Identify the DBMS among the following. (1) MS-Access (2) MS-Power Point (3) PL/SQL (4) MS-Excel

Last Answer : PL/SQL

Description : A Winchester disk is a: a) Disk Stack b) Removable Disk c) Flexible Disk d) None of The Above

Last Answer : a) Disk Stack