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

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

1 Answer

Answer :

(B) Binary Tree 
by

Related questions

___ 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

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

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

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

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

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

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

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

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

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

bit stands for (A) binary information term (B) binary digit (C) binary tree (D) Bivariate Theory

Description : bit stands for (A) binary information term (B) binary digit (C) binary tree (D) Bivariate Theory

Last Answer : (B) binary digit

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.

If the binary equivalent of the decimal number 48 is 110000, then the binary equivalent of the decimal number 51 is given by (A) 110011 (B) 110010 (C) 110001 (D) 110100

Description : If the binary equivalent of the decimal number 48 is 110000, then the binary equivalent of the decimal number 51 is given by (A) 110011 (B) 110010 (C) 110001 (D) 110100 

Last Answer : Answer: A

Which one of the following represents the binary equivalent of the decimal number 25? (A) 11011 (B) 10101 (C) 01101 (D) 11001

Description : Which one of the following represents the binary equivalent of the decimal number 25? (A) 11011 (B) 10101 (C) 01101 (D) 11001

Last Answer : Answer: D

Symbols A-Fare used in which one of the following? (A) Binary number system (B) Decimal number system (C) Hexadecimal number system (D) Octal number system

Description : Symbols A-Fare used in which one of the following? (A) Binary number system (B) Decimal number system (C) Hexadecimal number system (D) Octal number system

Last Answer : (C) Hexadecimal number system

Binary equivalent of decimal number 35 is (A) 100011 (B) 110001 (C) 110101 (D) 101011

Description : Binary equivalent of decimal number 35 is (A) 100011 (B) 110001 (C) 110101 (D) 101011

Last Answer : Answer: A

Which one of the following represent the binary equivalent of the decimal number 23 ? (A) 01011 (B) 10111 (C) 10011 (D) None of the above

Description : Which one of the following represent the binary equivalent of the decimal number 23 ? (A) 01011 (B) 10111 (C) 10011 (D) None of the above

Last Answer : (B) 10111 

A dialogue between a human-being and a computer programme that occurs simultaneously in various forms is described as: (A) man-machine speak (B) binary chat (C) digital talk (D) interactivity

Description : A dialogue between a human-being and a computer programme that occurs simultaneously in various forms is described as: (A) man-machine speak (B) binary chat (C) digital talk (D) interactivity

Last Answer : Answer: D In computers, interactivity is the dialog that occurs between a human being (or po ssibly another live creature) and a computer program. (Programs that run without immediate user ... are also interactive, but in a more constrained way (offering fewer options for user interaction).

In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search

Description : In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search

Last Answer : A) Linear search

Telephone is an example of (A) linear communication (B) non-linear communication (C) circular (D) mechanised

Description : Telephone is an example of (A) linear communication (B) non-linear communication (C) circular (D) mechanised 

Last Answer : (A) linear communication

The importance of the correlation co-efficient lies in the fact that: (A) There is a linear relationship between the correlated variables. (B) It is one of the most valid measure of statistics. (C) It allows one to determine the degree or strength of the association be tween two variables. (D) It is a non-parametric method of statistical analysis.

Description : The importance of the correlation co-efficient lies in the fact that: (A) There is a linear relationship between the correlated variables. (B) It is one of the most valid measure of statistics. ... of the association be tween two variables. (D) It is a non-parametric method of statistical analysis.

Last Answer : (C) It allows one to determine the degree or strength of the association be tween two variables.

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 stake machine pushes operands on a stack and evaluates binary operators by a pcs (i.e pop/compute/store)

Description : A stake machine pushes operands on a stack and evaluates binary operators by a pcs (i.e pop/compute/store) where the top two operands are popped computation is performed and the result is pushed onto stack. ... 1 pcs instructions (c) 4 push and 1 pcs instructions (d) 5 push and 2 pcs instructions 

Last Answer : A stake machine pushes operands on a stack and evaluates binary operators by a pcs (i.e pop/compute/store) where the top two operands are popped computation is performed and the result is pushed onto stack. ... 1 pcs instructions (c) 4 push and 1 pcs instructions (d) 5 push and 2 pcs instructions 

What is the difference between array data structure and raw data structure?

Description : What is the difference between array data structure and raw data structure?

Last Answer : Data typing is static, but weakly enforced

State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Last Answer : D) True, True

Which one of the following array represents a binary max-heap? (A) [26, 13, 17, 14, 11, 9, 15] (B) [26, 15, 14, 17, 11, 9, 13] (C) [26, 15, 17, 14, 11, 9, 13] (D) [26, 15, 13, 14, 11, 9, 17]

Description : Which one of the following array represents a binary max-heap? (A) [26, 13, 17, 14, 11, 9, 15] (B) [26, 15, 14, 17, 11, 9, 13] (C) [26, 15, 17, 14, 11, 9, 13] (D) [26, 15, 13, 14, 11, 9, 17]

Last Answer : (C) [26, 15, 17, 14, 11, 9, 13]

Another name for 1-D arrays. a) Linear arrays b) Lists c) Horizontal array d) Vertical array

Description : Another name for 1-D arrays. a) Linear arrays b) Lists c) Horizontal array d) Vertical array

Last Answer : Answer: a Explanation: Linear arrays are the 1-Dimensional arrays wherein only one row is present and the items are inserted

Which technique is used for main memory array design: a. Linear decoding b. Fully decoding c. Both A and B d. None of these

Description : Which technique is used for main memory array design: a. Linear decoding b. Fully decoding c. Both A and B d. None of these

Last Answer : c. Both A and B

The average case occurs in the Linear Search Algorithm when: (A) The item to be searched is in some where middle of the Array (B) The item to be searched is not in the array (C) The item to be searched is in the last of the array (D) The item to be searched is either in the last or not in the array

Description : The average case occurs in the Linear Search Algorithm when: (A) The item to be searched is in some where middle of the Array (B) The item to be searched is not in the array (C) The item to be searched is in the last of the array (D) The item to be searched is either in the last or not in the array

Last Answer : (A) The item to be searched is in some where middle of the Array

What do communicated words carry in a classroom situation ? (A) Inspiration, controversy and introspection (B) Diversion, criticism and irrationality (C) Insipidity, irrationality, and non-acceptance (D) Power, structure and tradition

Description : What do communicated words carry in a classroom situation ? (A) Inspiration, controversy and introspection (B) Diversion, criticism and irrationality (C) Insipidity, irrationality, and non-acceptance (D) Power, structure and tradition

Last Answer : (D) Power, structure and tradition

A Cluster of propositions with a structure that exhibits some inference is called (A) An inference (B) An argument (C) An explanation (D) A valid argument

Description : A Cluster of propositions with a structure that exhibits some inference is called (A) An inference (B) An argument (C) An explanation (D) A valid argument

Last Answer : Answer: B

Public communication tends to occur within a more (A) complex structure (B) political structure (C) convenient structure (D) formal structure

Description : Public communication tends to occur within a more (A) complex structure (B) political structure (C) convenient structure (D) formal structure 

Last Answer : (D) formal structure

Structure of logical argument is based on: (A) Formal validity (B) Material truth (C) Linguistic expression (D) Aptness of examples

Description : Structure of logical argument is based on: (A) Formal validity (B) Material truth (C) Linguistic expression (D) Aptness of examples

Last Answer : (A) Formal validity

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

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

Pick out the correct statement. (A) Higher hold up of the solid in the rotary dryer results in better exposure of the solids to the gas (B) The 'Hatta number' is important in problems involving gas absorption without chemical reaction (C) For a non-reacting binary mixture of ideal gases, the partial pressure distribution of both components is linear in the case of steady state equimolal counter-diffusion (D) Total reflux in case of distillation operation requires infinite number of plates for a binary system separation

Description : Pick out the correct statement. (A) Higher hold up of the solid in the rotary dryer results in better exposure of the solids to the gas (B) The 'Hatta number' is ... reflux in case of distillation operation requires infinite number of plates for a binary system separation

Last Answer : (C) For a non-reacting binary mixture of ideal gases, the partial pressure distribution of both components is linear in the case of steady state equimolal counter-diffusion

Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. a. t + 1 b. t c. t - 2 d. t / 2

Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. a. t + 1 b. t c. t - 2 d. t / 2

Last Answer : b. t

What is the difference between linear and binary search?

Description : What is the difference between linear and binary search?

Last Answer : A: Linear search does not require the array to be sorted, whereas, binary search requires that the array be sorted. Linear search checks for the search item in a linear fashion from the beginning cell till the end, ... tell what is control variable in your loop. So if your loop is for(int i = 1; i

Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2

Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2

Last Answer : (2) t 

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

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

Last Answer : A) Loop