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

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

1 Answer

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”
by
selected

Related questions

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

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

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

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

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 

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

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

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

Stack words on: a. LILO b. LIFO c. FIFO d. None of these

Description : Stack words on: a. LILO b. LIFO c. FIFO d. None of these

Last Answer : b. LIFO

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.

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.

Which stack is used in 8085? a) FIFO b) LIFO c) FILO

Description : Which stack is used in 8085? a) FIFO b) LIFO c) FILO

Last Answer : b) LIFO

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

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

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

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.

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

Muller Breslau's principle for obtaining influence lines is applicable to (i) Trusses (ii) Statically determinate beams and frames (iii) Statically indeterminate structures, the material of which is elastic and follows Hooke's law (iv) Any statically indeterminate structure The correct answer is (A) (i), (ii) and (iii) (B) (i), (ii) and (iv) (C) (i) and (ii) (D) Only (i)

Description : Muller Breslau's principle for obtaining influence lines is applicable to (i) Trusses (ii) Statically determinate beams and frames (iii) Statically indeterminate structures, the material of which is elastic and follows Hooke's law (iv ... B) (i), (ii) and (iv) (C) (i) and (ii) (D) Only (i)

Last Answer : (A) (i), (ii) and (iii)

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

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.

Computer follows a simple principle called GIGO which means: 1) Garbage in garbage out 2) Garbage input good output 3) Good input good output 4) Greater instructions greater output

Description : Computer follows a simple principle called GIGO which means: 1) Garbage in garbage out 2) Garbage input good output 3) Good input good output 4) Greater instructions greater output

Last Answer : 1) Garbage in garbage out

Which of the following memories uses a MOS capacitor as its memory cell? A. SRAM B. DRAM C. ROM D. FIFO

Description : Which of the following memories uses a MOS capacitor as its memory cell? A. SRAM B. DRAM C. ROM D. FIFO

Last Answer : B. DRAM

FIFO scheduling is: a) Preemptive Scheduling b) Non Preemptive Scheduling c) Deadline Scheduling d) None of The Above

Description : FIFO scheduling is: a) Preemptive Scheduling b) Non Preemptive Scheduling c) Deadline Scheduling d) None of The Above

Last Answer : b) Non Preemptive Scheduling

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.

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

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 uses the same ratios b) easy because public stock price fluctuation is not sufficient or erratic enough to make a difference c) difficult because book value is adjusted in small companies as FIFO is the method of choice and in public companies’ book value is static due to LIFO d) difficult because size differential, management depth, product diversity and access to lines of credit seldom match the company being valued

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

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

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

Propulsion of rocket follows from the (A) Newton's second law of motion (B) Newton's third law of motion (C) Law of projectiles (D) Archimedes principle

Description : Propulsion of rocket follows from the (A) Newton's second law of motion (B) Newton's third law of motion (C) Law of projectiles (D) Archimedes principle

Last Answer : Option B

A balloon lifting in air follows the following principle (A) Law of gravitation (B) Archimedes principle (C) Principle of buoyancy (D) All of the above

Description : A balloon lifting in air follows the following principle (A) Law of gravitation (B) Archimedes principle (C) Principle of buoyancy (D) All of the above

Last Answer : Answer: Option D

Computer follows a simple principle called GIGO which means?

Description : Computer follows a simple principle called GIGO which means?

Last Answer : Garbage In Garbage Out

Light traveling in optical fiber follows which of the following principles. ∙ a. Huygen’s principle ∙ b. Reflection theory ∙ c. Light theory ∙ d. Snell’s law

Description : Light traveling in optical fiber follows which of the following principles. ∙ a. Huygen’s principle ∙ b. Reflection theory ∙ c. Light theory ∙ d. Snell’s law

Last Answer : d. Snell’s law

Valuation of stock in accounting follows the principle of cost price or ____ which ever is lower. a) Market Price b) Average Price c) Net realizable Value d) None of these.

Description : Valuation of stock in accounting follows the principle of cost price or ____ which ever is lower. a) Market Price b) Average Price c) Net realizable Value d) None of these.

Last Answer : c) Net realizable Value

What is the full form of 'FIFO' ? -How To ?

Description : What is the full form of 'FIFO' ? -How To ?

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

What does FIFO means?

Description : What does FIFO means?

Last Answer : What is the answer ?

What dose The letter FIFO refer to?

Description : What dose The letter FIFO refer to?

Last Answer : What is the answer ?

Define what is FIFO?

Description : Define what is FIFO?

Last Answer : In C programming, there is a data structure known as a queue. In this structure, data is stored and accessed using FIFO format, or /First-In-First-Out/. A queue represents a line wherein the first data that was stored will be the first one that is accessible as well.

In 8279, the keyboard entries are debounced and stored in an _________, that is further accessed by the CPU to read the key codes. a) 8-bit FIFO b) 8-byte FIFO c) 16 byte FIFO d) 16 bit FIFO

Description : In 8279, the keyboard entries are debounced and stored in an _________, that is further accessed by the CPU to read the key codes. a) 8-bit FIFO b) 8-byte FIFO c) 16 byte FIFO d) 16 bit FIFO

Last Answer : b) 8-byte FIFO

Calculate the value of closing stock from the following according to FIFO 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 Issues: 2nd January, 2014: 30 units 18th January, 2014: 150 units (a) Rs. 765 (b) Rs. 805 (c) Rs. 786 (d) Rs. 700

Description : Calculate the value of closing stock from the following according to FIFO 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 : (a) Rs. 765

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

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

Last Answer : (b) provide highest value of closing stock and profit

Which one out of the following is not an inventory valuation method? (a) FIFO (b) LIFO (c) Weighted Average (d) EOQ

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

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

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

A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6

Description : A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main ... replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6

Last Answer : (C) 9 and 8

Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it facilitates putting some set of processes into memory and a choice is made from that. IV. Because it does not allow to adjust the set of in-core processes. Which of the following is true ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Description : Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it ... ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Last Answer : (D) I and III

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Description : Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Last Answer : (D) 9, 10