Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ? (A) Insertion at the front of the linked list. (B) Insertion at the end of the linked list. (C) Deletion of the front node of the linked list. (D) Deletion of the last node of the linked list.

Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ? (A) Insertion at the front of the linked list. (B) Insertion at the end of the linked list. (C) Deletion of the front node of the linked list. (D) Deletion of the last node of the linked list.
by

1 Answer

Answer :

(D) Deletion of the last node of the linked list. 
by

Related questions

If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of the pointers change (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Description : If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of ... (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Last Answer : (C) Only rear pointer changes

………………. is not an operation performed on linear list Get More Mcqs from http://www.siteforinfotech.com/p/mcqs.html a) Insertion b) Deletion c) Retrieval d) Traversal A) only a,b and c B) only a and b C) All of the above D) None of the above

Description : ………………. is not an operation performed on linear list Get More Mcqs from http://www.siteforinfotech.com/p/mcqs.html a) Insertion b) Deletion c) Retrieval d) Traversal A) only a,b and c B) only a and b C) All of the above D) None of the above

Last Answer : D) None of the above

In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Description : In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Last Answer : (B) Linked

……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal

Description : ……… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal

Last Answer : D) Traversal

Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? (1) Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) (2) Insertion-O(1), Deletion-O(1), Maximum-O(n), Minimum-O(n) (3) Insertion-O(n), Deletion-O(n), Maximum-O(1), Minimum-O(1) (4) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

Description : Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? (1) Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) (2) Insertion-O(1), ... (1), Minimum-O(1) (4) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

Last Answer : Answer: 3

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Description : Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Last Answer : (C) (n-1)/2

The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Description : The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Last Answer : Answer: All

In Unix operating system, special files are used to : (A) buffer data received in its input from where a process reads (B) provide a mechanism to map physical device to file names (C) store list of file names plus pointers associated with i-nodes (D) store information entered by a user application program or utility program

Description : In Unix operating system, special files are used to : (A) buffer data received in its input from where a process reads (B) provide a mechanism to map physical device to file names (C ... pointers associated with i-nodes (D) store information entered by a user application program or utility program

Last Answer : (B) provide a mechanism to map physical device to file names 

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 

Post-transcriptional modification of hnRNA involves all of the following except (A) Addition of 7-methylguanosine triphosphate cap (B) Addition of polyadenylate tail (C) Insertion of nucleotides (D) Deletion of introns

Description : Post-transcriptional modification of hnRNA involves all of the following except (A) Addition of 7-methylguanosine triphosphate cap (B) Addition of polyadenylate tail (C) Insertion of nucleotides (D) Deletion of introns

Last Answer : Answer : C

Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning? (A) I (B) HI (C) CHI (D) GHI

Description : Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning?  (A) I (B) HI (C) CHI (D) GHI

Last Answer : (B) HI

What does the following declaration mean ? int (*ptr) [10]; (A) ptr is an array of pointers of 10 integers. (B) ptr is a pointer to an array of 10 integers. (C) ptr is an array of 10 integers. (D) none of the above.

Description : What does the following declaration mean ? int (*ptr) [10]; (A) ptr is an array of pointers of 10 integers. (B) ptr is a pointer to an array of 10 integers. (C) ptr is an array of 10 integers. (D) none of the above.

Last Answer : (B) ptr is a pointer to an array of 10 integers.

What does the following expression means ? char *(*(* a[N]) ( )) ( ); (A) a pointer to a function returning array of n pointers to function returning character pointers. (B) a function return array of N pointers to functions returning pointers to characters (C) an array of n pointers to function returning pointers to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters.

Description : What does the following expression means ? char *(*(* a[N]) ( )) ( ); (A) a pointer to a function returning array of n pointers to function returning character pointers. (B) a ... to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters.

Last Answer : Answer: A,B,C,D

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 information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B) An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data. (C) Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.

Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks. 

Last Answer : (C) Each i-node is 256-bytes long.

Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list. A) i-only B) ii-only C) Both i and ii D) None of both

Description : Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first ... linked list. A) i-only B) ii-only C) Both i and ii D) None of both

Last Answer : C) Both i and ii

For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Description : For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page ... fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Last Answer : (C) √2xz 

Which of the statements give below is correct with respect to frameshift mutation a) a single nucleotide base change, insertion, or deletion of the genetic material b) Glutamine is replaced by valine c) Sickle cell anemia is an example d) insertions or deletions of a number of nucleotides in a DNA sequence that is not divisible by three.

Description : Which of the statements give below is correct with respect to frameshift mutation a) a single nucleotide base change, insertion, or deletion of the genetic material b) Glutamine is replaced by valine c) ... or deletions of a number of nucleotides in a DNA sequence that is not divisible by three.

Last Answer : d) insertions or deletions of a number of nucleotides in a DNA sequence that is not divisible by three.

Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation. A) push, pop B) pop, push

Description : Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation. A) push, pop B) pop, push

Last Answer : A) push, pop

A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Description : A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Last Answer : A) vertices, edges

A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1. A) Directed tree B) Undirected tree C) Dis-joint tree D) Direction oriented tree

Description : A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1. A) Directed tree B) Undirected tree C) Dis-joint tree D) Direction oriented tree

Last Answer : A) Directed tree

State true of false. i) A node is a parent if it has successor nodes. ii) A node is child node if out degree is one. A) True, True B) True, False C) False, True D) False, False

Description : State true of false. i) A node is a parent if it has successor nodes. ii) A node is child node if out degree is one. A) True, True B) True, False C) False, True D) False, False

Last Answer : B) True, False

State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes. A) True, True B) True, False C) False, True D) False, False

Description : State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, 259, 363, 364 (B) 3, 400, 388, 220, 267, 383, 382, 279, 364 (C) 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364

Description : Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, ... 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364 

Last Answer : (C) 926, 203, 912, 241, 913, 246, 364

The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A) Lists B) Linked Lists C) Trees D) Queues

Description : The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A) Lists B) Linked Lists C) Trees D) Queues

Last Answer : B) Linked Lists

Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two relationship types are linked by either Event-Precedent sequence or Condition-Precedent sequence (C) Conceptual model is not accurate representation of "Universe of interest". (D) Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Description : Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two ... Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's

Last Answer : (C) Conceptual model is not accurate representation of "Universe of interest".

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

Suppose list Example is [‘h’,’e’,’l’,’l’,’o’], what is len(list Example)? a) 5 b) 4 c) None d) Error

Description : Suppose list Example is [‘h’,’e’,’l’,’l’,’o’], what is len(list Example)? a) 5 b) 4 c) None d) Error

Last Answer : a) 5

In C++, the keyword void was used ……….. A) To specify the return type of function when it is not returning any value. B) To indicate an empty argument list to a function. C) To declare the generic pointers. D) All of the above.

Description : In C++, the keyword void was used ……….. A) To specify the return type of function when it is not returning any value. B) To indicate an empty argument list to a function. C) To declare the generic pointers. 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

The muscle attachment to the bone of lesser movement is called the muscle's: a) insertion b) head c) origin d) tail

Description : The muscle attachment to the bone of lesser movement is called the muscle's: a) insertion b) head c) origin d) tail

Last Answer : ANSWER: C -- ORIGIN

Introduction of foreign genes for improving genotype is Or Insertion or deletion of one or more new genes which are absent in an organism by artificia

Description : Introduction of foreign genes for improving genotype is Or Insertion or deletion of one or more new genes which are absent in an organism by artificia

Last Answer : Introduction of foreign genes for improving genotype is Or Insertion or deletion of one or more ... . vernalization C. genetic engineering D. eugenics

How many nucleotides would cause a frame shift mutation for insertion or deletion A. 6 B. 2 C. 3 D. 9?

Description : How many nucleotides would cause a frame shift mutation for insertion or deletion A. 6 B. 2 C. 3 D. 9?

Last Answer : Need answer

A point mutation results from (A) Substitution of a base (B) Insertion of a base (C) Deletion of a base (D) All of these

Description : A point mutation results from (A) Substitution of a base (B) Insertion of a base (C) Deletion of a base (D) All of these

Last Answer : Answer : A

The most likely lethal mutation is (A) Substitution of adenine for cytosine (B) Insertion of one nucleotide (C) Deletion of three nucleotides (D) Substitution of cytosine for guanine

Description : The most likely lethal mutation is (A) Substitution of adenine for cytosine (B) Insertion of one nucleotide (C) Deletion of three nucleotides (D) Substitution of cytosine for guanine

Last Answer : Answer : B

Under which of the following conditions there will be no change in the reading frame of following mRNA? 5’ AACAGCGGUGCUAUU 3’ (a) Deletion of GGU from 7th, 8th and 9th positions (b) Insertion of G at 5th position (c) Deletion of G from 5th position (d) Insertion of A and G at 4th and 5th position respectively

Description : Under which of the following conditions there will be no change in the reading frame of following mRNA? 5' AACAGCGGUGCUAUU 3' (a) Deletion of GGU from 7th, 8th and 9th positions (b) Insertion of G ... ) Deletion of G from 5th position (d) Insertion of A and G at 4th and 5th position respectively

Last Answer : (a) Deletion of GGU from 7th, 8th and 9th positions

Under which of the following conditions there will be no change in the reading frame of following mRNA? 5’ AACAGCGGUGCUAUU 3’ (a) Deletion of GGU from 7th, 8th and 9th positions (b) Insertion of G at 5th position (c) Deletion of G from 5th position (d) Insertion of A and G at 4th and 5th position respectively

Description : Under which of the following conditions there will be no change in the reading frame of following mRNA? 5' AACAGCGGUGCUAUU 3' (a) Deletion of GGU from 7th, 8th and 9th positions (b) Insertion of G ... ) Deletion of G from 5th position (d) Insertion of A and G at 4th and 5th position respectively

Last Answer : (a) Deletion of GGU from 7th, 8th and 9th positions

Which one of the following could NOT cause a change in the mRNA ―reading frame‖? a. Insertion Sequence b. Base-Pair Substitution c. Base Addition d. Base Deletion

Description : Which one of the following could NOT cause a change in the mRNA ―reading frame‖? a. Insertion Sequence b. Base-Pair Substitution c. Base Addition d. Base Deletion

Last Answer : b. Base-Pair Substitution

In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A) 0 and 1 B) 0 and -1 C) -1 and 0 D) 1 and 0

Description : In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A) 0 and 1 B) 0 and -1 C) -1 and 0 D) 1 and 0

Last Answer : B) 0 and -1

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : Select * From R Full Join S On R.B=S.B; SQ2 : Select * From R Inner Join S On R.B=S.B; The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by : (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

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.

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.

Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? (1) Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Description : Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by ... Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Last Answer : Answer: 4

Which of the following algorithm pays the least attention to the ordering of the elements in the input list? a) Insertion sort b) Selection sort c) Quick sort d) None

Description : Which of the following algorithm pays the least attention to the ordering of the elements in the input list? a) Insertion sort b) Selection sort c) Quick sort d) None

Last Answer : b) Selection sort

You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort

Description : You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort

Last Answer : (D) Insertion sort

Before measuring an unknown resistance with an ohmmeter, you should _____________. A. adjust the meter's pointers to mid-scale B. change the meter's batteries C. center the meter's pointer at infinity D. short the test leads and calibrate the meter

Description : Before measuring an unknown resistance with an ohmmeter, you should _____________. A. adjust the meter's pointers to mid-scale B. change the meter's batteries C. center the meter's pointer at infinity D. short the test leads and calibrate the meter

Last Answer : Answer: D

Which of the following statements is correct? (A) Every class containing abstract method must not be declared abstract. (B) Abstract class cannot be directly initiated with ‘new’ operator. (C) Abstract class cannot be initiated. (D) Abstract class contains definition of implementation.

Description : Which of the following statements is correct? (A) Every class containing abstract method must not be declared abstract. (B) Abstract class cannot be directly initiated with ‘new’ operator. (C) Abstract class cannot be initiated. (D) Abstract class contains definition of implementation.

Last Answer : Answer: B,C

Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ................ of the first data set. (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Description : Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent ... . (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Last Answer : (B) Data Redundancy

The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is (A) O(lg n) (B) O(n lg n) (C) O(n) (D) O(n2 )

Description : The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is (A) O(lg n) (B) O(n lg n) (C) O(n) (D) O(n2 ) 

Last Answer : (C) O(n)