………… is not the component of data structure. A) Operations B) Storage Structures C) Algorithms D) None of above

………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
by

1 Answer

Answer :

D) None of above
by

Related questions

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.

The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending

Description : The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending

Last Answer : B) Disk scheduling

Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product. (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Description : Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used ... and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Last Answer : (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.

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

Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Last Answer : d) Heap sort

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 a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively (A) 236 and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Description : Consider a disk queue with request for input/output to block on cylinders  98, 183, 37, 122, 14, 124, 65, 67  in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208 

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1 The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Description : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is :  1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Last Answer : (B) 10 and 7

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance

Description : Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance

Last Answer : (B) clarity, elegance, efficiency

Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Description : Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Last Answer : (D) All of the above

Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Description : Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Last Answer : (C) Radix sort

Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Description : Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Last Answer : Answer: 2

DML is provided for (A) Description of logical structure of database. (B) Addition of new structures in the database system. (C) Manipulation & processing of database. (D) Definition of physical structure of database system.

Description : DML is provided for (A) Description of logical structure of database. (B) Addition of new structures in the database system. (C) Manipulation & processing of database. (D) Definition of physical structure of database system.

Last Answer : C) Manipulation & processing of database.

The software ................. of a program or a computing system is the structure or structures of the system, which comprise software components, the externally visible properties of those components, and the relationships among them. (A) Design (B) Architecture (C) Process (D) Requirement

Description : The software ................. of a program or a computing system is the structure or structures of the system, which comprise software components, the externally visible properties of those components, and the relationships among them. (A) Design (B) Architecture (C) Process (D) Requirement

Last Answer : (B) Architecture

Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation? (A) Circular linked list (B) Doubly linked list (C) Linked list (D) Dequeue

Description : Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation? (A) Circular linked list (B) Doubly linked list (C) Linked list (D) Dequeue

Last Answer :  (B) Doubly linked list 

Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B) Object-oriented databases store computational instructions in the same place as the data. (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases. (D) Object-oriented databases store more types of data than relational databases and access that data faster.

Description : Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B ... Object-oriented databases store more types of data than relational databases and access that data faster.

Last Answer : (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases.

Which of the following is not the part of ADT description? A) Data B) Operations C) Both of the above D) None of the above

Description : Which of the following is not the part of ADT description? A) Data B) Operations C) Both of the above D) None of the above

Last Answer : D) None of the above

Which of the following is true about the characteristics of abstract data types? i) It exports a type. ii) It exports a set of operations A) True, False B) False, True C) True, True D) False, False

Description : Which of the following is true about the characteristics of abstract data types? i) It exports a type. ii) It exports a set of operations A) True, False B) False, True C) True, True D) False, False

Last Answer : C) True, True

Cryptography includes the __________to securely and consistently prevent or delay unauthorized access to sensitive information and enable verifiability of every component in a communication: a) Protocols b) Algorithms c) Strategies d) All of the Above

Description : Cryptography includes the __________to securely and consistently prevent or delay unauthorized access to sensitive information and enable verifiability of every component in a communication: a) Protocols b) Algorithms c) Strategies d) All of the Above

Last Answer : d) All of the Above

Cryptography includes the __________to securely and consistently prevent or delay unauthorized access to sensitive information and enable verifiability of every component in a communication: a) Protocols b) Algorithms c) Strategies d) All of the Above e) None of These

Description : Cryptography includes the __________to securely and consistently prevent or delay unauthorized access to sensitive information and enable verifiability of every component in a communication: a) Protocols b) Algorithms c) Strategies d) All of the Above e) None of These

Last Answer : d) All of the Above

The data Flow Diagram is the basic component of …………… system A) Conceptual B) Logical C) Physical

Description : The data Flow Diagram is the basic component of …………… system A) Conceptual B) Logical C) Physical

Last Answer : A) Conceptual

Data items grouped together for storage purposes are called a A) record B) title C) list D) string

Description : Data items grouped together for storage purposes are called a A) record B) title C) list D) string

Last Answer : A) record

…………… is a way to bind the data and its associated functions together which allows the data and functions to be hidden. A) Structure B) Class C) Enum D) Both A and B

Description : …………… is a way to bind the data and its associated functions together which allows the data and functions to be hidden. A) Structure B) Class C) Enum D) Both A and B

Last Answer : B) Class

A structure brings together a group of A) items of the same data type B) related data items and variables C) integers with user defined names D) floating points with user defined names

Description : A structure brings together a group of A) items of the same data type B) related data items and variables C) integers with user defined names D) floating points with user defined names

Last Answer : B) related data items and variables

Which if the following is/are the levels of implementation of data structure A) Abstract level B) Application level C) Implementation level D) All of the above

Description : Which if the following is/are the levels of implementation of data structure A) Abstract level B) Application level C) Implementation level D) All of the above

Last Answer : D) All of the above

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.

Superficially the term “object-oriented”, means that, we organize software as a (A) collection of continuous objects that incorporates both data structure and behaviour. (B) collection of discrete objects that incorporates both discrete structure and behaviour. (C) collection of discrete objects that incorporates both data structure and behaviour. (D) collection of objects that incorporates both discrete data structure and behaviour.

Description : Superficially the term object-oriented , means that, we organize software as a (A) collection of continuous objects that incorporates both data structure and behaviour. (B) collection of ... and behaviour. (D) collection of objects that incorporates both discrete data structure and behaviour.

Last Answer : (C) collection of discrete objects that incorporates both data structure and behaviour.

What are the operations that can be performed on Files?

Description : What are the operations that can be performed on Files?

Last Answer : Ans: Following operations can be performed on files1. Creation of a file of a specific type. 2. Reading/processing a file. 3. Append/add information to a file. 4. Modify/edit data in a file. 5. Delete items in a file. 6. Update the file.

Explain the basic operations of a computer.

Description : Explain the basic operations of a computer. 

Last Answer :  Input Operation:  A computer works in the light of instructions (input) given to it.  Input is given by a user using keyboard or mouse.  The input is stored in memory for further processing. ... on the monitor or print it on paper. Results can also be saved on hard disk for future use. 

State true or false. i) comparisons precede logical operations in java ii) assignment operations succeed increment operations iii) arithmetic operations succeed comparisons iv) x precede + A) i-true, ii-true, iii-false, iv-true B) i-true, ii-false, iii-true, iv-false C) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Description : State true or false. i) comparisons precede logical operations in java ii) assignment operations succeed increment operations iii) arithmetic operations succeed comparisons iv) x precede + A) i-true, ii-true, iii-false, ... false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Last Answer : A) i-true, ii-true, iii-false, iv-true

Which of the following operations can be performed by using FTP. i) Connect to a remote host ii) Select directory iii) Define the transfer mode iv) List file available A) i, and ii only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii and iv

Description : Which of the following operations can be performed by using FTP. i) Connect to a remote host ii) Select directory iii) Define the transfer mode iv) List file available A) i, and ii only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii and iv

Last Answer : C) ii, iii and iv only

Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Description : Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Last Answer : b) Selection sort

Which of the following statement(s) is(are) true? I. Two successive translations are additive. II. Two successive rotations are additive. III. Two successive scaling operations are multiplicative. (A) I and II (B) I and III (C) II and III (D) All the above.

Description : Which of the following statement(s) is(are) true? I. Two successive translations are additive. II. Two successive rotations are additive. III. Two successive scaling operations are multiplicative. (A) I and II (B) I and III (C) II and III (D) All the above.

Last Answer : (D) All the above.

A byte addressable computer has a memory capacity of 2 m Kbytes and can perform 2 n operations. An instruction involving 3 operands and one operator needs a maximum of (A) 3m bits (B) m + n bits (C) 3m + n bits (D) 3m + n + 30 bits

Description : A byte addressable computer has a memory capacity of 2 m Kbytes and can perform 2 n operations. An instruction involving 3 operands and one operator needs a maximum of (A) 3m bits (B) m + n bits (C) 3m + n bits (D) 3m + n + 30 bits

Last Answer : (D) 3m + n + 30 bits

Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are equivalent. (A) I and II are correct. (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Description : Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are ... (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Last Answer : (D) Only I is correct.

To determine the efficiency of an algorithm the time factor is measured by: (A) Counting micro seconds (B) Counting number of key operations (C) Counting number of statements (D) Counting kilobytes of algorithm

Description : To determine the efficiency of an algorithm the time factor is measured by: (A) Counting micro seconds (B) Counting number of key operations (C) Counting number of statements (D) Counting kilobytes of algorithm

Last Answer : (B) Counting number of key operations

Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. (C) that exchanges inner loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Description : Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. ... loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Last Answer : (A) that avoids tests at every iteration of the loop

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

Consider the following operations performed on a stack of size 5: Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e); Which of the following statements is correct? (A) Underflow occurs (B) Stack operations are performed smoothly (C) Overflow occurs (D) None of the above

Description : Consider the following operations performed on a stack of size 5: Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e); Which of the following statements is correct? (A) Underflow occurs (B) Stack operations are performed smoothly (C) Overflow occurs (D) None of the above

Last Answer : (B) Stack operations are performed smoothly

compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction? (A) Replace P + P by 2 * P or Replace 3 + 4 by 7. (B) Replace P * 32 by P<<5 (C) Replace P * 0 by 0 (D) Replace (P<<4) – P by P * 15

Description : compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction? (A) Replace P + ... * P or Replace 3 + 4 by 7. (B) Replace P * 32 by P

Last Answer : (B) Replace P * 32 by P

Which of the following logic operations is performed by the following given combinational circuit ? Image (A) EXCLUSIVE-OR (B) EXCLUSIVE-NOR (C) NAND (D) NOR

Description : Which of the following logic operations is performed by the following given combinational circuit ?  (A) EXCLUSIVE-OR (B) EXCLUSIVE-NOR (C) NAND (D) NOR

Last Answer : (A) EXCLUSIVE-OR

Which of the following is the most efficient to perform arithmetic operations on the numbers? (A) Sign-magnitude (B) 1’s complement (C) 2’s complement (D) 9’s complement

Description : Which of the following is the most efficient to perform arithmetic operations on the numbers? (A) Sign-magnitude (B) 1’s complement (C) 2’s complement (D) 9’s complement

Last Answer : (C) 2’s complement

Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Last Answer : (2) O(log n) 

The secondary storage devices can only store data but they cannot perform A) Arithmetic Operation B) Logic operation C) Fetch operations D) Either of the above

Description : The secondary storage devices can only store data but they cannot perform A) Arithmetic Operation B) Logic operation C) Fetch operations D) Either of the above

Last Answer : Answer : D

Actual data processing operations are performed in the arithmetic logic section, but not in the “. Storage section of a processor unit a. Primary b. Accumulator c. Buffer d. Secondary

Description : Actual data processing operations are performed in the arithmetic logic section, but not in the “. Storage section of a processor unit a. Primary b. Accumulator c. Buffer d. Secondary

Last Answer : Primary

The secondary storage devices can only store data but they cannot perform a. Arithmetic Operation b. Logic operation c. Fetch operations d. Either of the above

Description : The secondary storage devices can only store data but they cannot perform a. Arithmetic Operation b. Logic operation c. Fetch operations d. Either of the above

Last Answer : Either of the above

In HDFS, reliability of storing data was maintained by a) Block Operations b) Block Replication c) Block Storage d) All the above

Description : In HDFS, reliability of storing data was maintained by a) Block Operations b) Block Replication c) Block Storage d) All the above

Last Answer : Block Replication