LINKED LIST:
1. Which of the following data structure is linear?
a. Linked list b. Array
c. Queue d. All of above
2. Linked list is collection of
a. nodes b. Elements
c. Addresses d. None of above
3. Linked list always start with
a. Head b. Root
c. Top d. Front
4.The situation when in a linked list START=NULL is
a. underflow
b. overflow
c. housefull
d. saturated
5. In linked list each entry contain
a.Data
b.Link
c.Both data and link
d.none of above
6. Next link of each node consist
a. Data of next node
b. Address of next node
c. Both (a) and (b)
d. None of above
7.In linked list, the successive element
a. Must occupy contiguous locations in memory
b. Need not occupy contiguous space in memory
c. Must not occupy contiguous locations in any situation
d. None of the above
8.Link pointer variable in linked list contain address of the
a. Following node in the list
b. Current node in the list
c. First node in the list
d. None of the above
9.To create linked list created by
a. structureb.unionc.arrayd.Macro
10. Node created in linked list through
a. malloc() b. mcalloc()
c. alloc() d. None of these
11. Linked List allocates memory space in
a. Direct fashion b.Contiguous fashion
c.Random fashiond.Indexed fashion
12. Which are the types of linked list?
a. Single linked list b. Double linked list
c. Circular linked list d. All of above
13.Which is not dynamic memory allocation function?
(A) malloc(B) free
(C) alloc(D) calloc
Ans: C
Three dynamic memory allocation functions are: malloc, calloc and free
14.The function that allocates requested size of bytes and returns a pointer to the first
byte of the allocated space is -
(A) realloc(B) malloc
(C) calloc(D) none of the above
Ans: B
malloc allocates requested size of bytes and returns a pointer to the first byte of the
allocated space
15. The statement Head->Link->Link->Link=NULL terminates a linked list after
its.......node
a. 2nd b.4th c.5th d. 3rd
16.Which of the following statements is/are TRUE?
i) ADTs define how data is stored and manipulated.
ii) Every linked list has to have at least one external pointer.
iii) Recursive solutions may be easier to understand.
a. (i),(ii)and(iii) above b. Only(i)change
c. Only (ii) aboved.Only (iii) above
17.Suppose cursor refers to a node in a linked list, what statement changes cursor so that
it refers to the next node?
a. Cursor++ b. Cursor=link
c. Cursor+=link d. Cursor=Cursor->link
18. Consider the following the two statement and choose the correct option:
i. According to access strategies linked list is a linear one
ii. According to storage linked list is a non-linear one
a. (i) is true but(ii) is false
b.(i) is false but (ii) is true
c. Both (i) and(ii) are true
d. Both (i) and(ii) are false
19.A "linked list" always contains elements that can be described as
a.Redundant b. Recursive
c. Bidirectional d. Self-referential
20.When we organize our data as an ordered list, what is the time complexity of
inserting/deleting a data item to/from the list?
a.O(length_of_list*length_of_list)
b. O(length_of_list)
c. O(log(length_of_list * length_of_list))
d. O(1)
21.For the ease of searching in a linked list, the linked list be created in
a. Descending order b. Ascending order
c. Without underflow condition
d. Any order
22.What is the linked list that contains a variablewhose value is the address of the
location of the other node in the list?
a. Integer b. Float
c. char d.Pointer
23.What is the output of the following function when it is called?
void disp( node *first )
if( first->next )
{
{
printf("%4d", first->data);
disp( first->next );
}
}
a.Display the data of next node always in the list
b.Display the data of all nodes of the list
c.Does not execute
d.Display the data of the first node only
24.The direct or random access of element is not possible in
a. Array b. String
c. Linked list d. Both (a) and (b) above
25.Null pointer is used to define
i. End of linked list
ii. Empty pointer field of a structure
iii. The linked list is empty
a. Only (i) above b. Only (ii) above
c. Only (iii)aboved. All of above
26. A technique which collects all deleted spaces onto free storage list is called
a. Static memory allocation b. Garbage collection
c. Calloc d. Dynamic memory aloocation
27.malloc() returns pointer to
a. Integer b. Structure c. character d. Boolean
SINGLE LINKED LIST
28. Which linked list only moves in forward direction?
a. Single linked list b. Double linked list
c. Nested linked list d. All of above
29 . Pointer name which is used in SLL?
a. Next pointer b. Previous pointer
c. Middle pointer d. None of above
30 . Long form of SLL
a. Single linked list b. Signal linked list
c. Sample linked list d. singe linked list
31. Each node of SLL contain only
a. Data and next pointer b. Data and previous pointer
c. Data and index of data d. None of above
32. Can we point previous element in SLL
a. Yes b. No
33. Which is disadvantage of SLL?
a. Can’t point last element b. Can’t point next element
c. Can’t point previous element d. None of these
34. First node in linked list is known as
a. Index b. Head c. Root d. None of these
35. Next field in node of SLL containing
a. Data value b. Address of next element
c. Data of next element d. None of these
36. Next pointer of first node in SLL point to
a. NULL b. Address of next element
c. Data of next element d. None of these
37. Next pointer of last node in SLL point to
a. NULL b. Address of next element
c. Data of next element d. None of these
38. To access elements of linked list we start from
a. Head b. Last node
c. Middle node d. None of these
39. Can we travel from last node to first node in SLL?
a. Yes b. No
40. Which operation cannot perform with single SLL?
a. Addition b. Deletion
c. Insertion d. Searching
41. Can we delete the head node from single Linked List
a. True b.False
42.Node of SLL can be design using
a. Array b. Tree c. Structure d. None of these
43. First field in each node of single linked list is……
a. Next Address b. Data
c. Previous address d. index of data
44. We can empty SLL by making………..
a. Head=NULL b. Head=p
c. Last_node=NULL d. None of these
45. To display elements of linked list always start from
a. Head node b. Last node
c. Middle node d. None of these
46. Which of the following is two way list?
a. grounded header list
b. circular header list
c. linked list with header and trailer nodes
d. none of above
DOUBLE LINKED LIST
47. We can traverse in bothdirection
a. Singular Linked Listb. Circular Linked List
c. Doubly Linked Listd. Tree Linked List
48.The application of Linked List
a.Add two characters
b. Add two large numbers
c. Add two Strings
d.Add two very small numbers
49.Can we delete the head node from Doubly Linked List
a. True b.False
50 .In Doubly Linked List each node contains
a. No address partb. One address part
c.Two address partd. Three address part
51. Advantage of Linked List over array
a. Linked List occupies less memory
b. Linked List can be stored on disk
c. Deletion of nodes is easier than arrays
d. Linked List is easy to maintain
52 . Which of the following statement is false?
a. Arrays are dense lists and static data structure
b. Data elements in linked list need not be stored in adjacent space in memory
c. Pointers store the next data element of a list
d. Linked lists are a collection of the nodes that contain information part and next pointer
53. A linear collection of data elements where the linear node is given by means of
pointer is Called.
a.Linked List
b.node list
c.Primitive list
d.none of these
54. Which of the following operations is performed more efficiently by doubly linked list
than
by singly linked list?
a. Deleting a node whose location in given
b. Searching of an unsorted list for a given item
c. Inverting a node after the node with given location
d. Traversing a list to process each node
55. The time required to delete a node x from a doubly linked list having n nodes is
a.O(n) b.O(log n)
c.O(1)d.O(n log n)
56. Which of the following are true regardless of the implementation?
a.sizeof(int)is not less than sizeof(long)
b. sizeof(double)is not less than sizeof(float)
c. sizeof(int)is not less than sizeof(unsigned)
d.both (2) and (3)
57. To delete a node at the beginning of the list, the location of the list is modified as the
address of the.
a. Second element in the list
b. first element in the list
c. last element in the list
d. Middle element in the list
58. in the linked list representation of the stacks, the top of the stack is represented by,
a.the last node
b. any of the nodes
c.first nodes
59. a doubly linked list facilitate list traversals in
a.Any direction b. Circular direction
c. One direction d. either direction
60. How many pointers are required to create a DLL?
a. One b. Two
c. Three d. Four
61. Long form of DLL
a. Double linked list b. Doable linked list
c. Dias linked list d. None of these
62. To delete last node in DLL
a. Make previous link of last node equal to NULL
b.Make next link of last node equal to NULL
c.Make next link of second last node equal to NULL
d. None of these
63.Linked lists are suitable for which of the following problems ?
a.Insertion sort b.Binary search
c.Radix sort d.Polynomial manipulation.
64.In comparison with sequential representation ,the computing time required for
manipulating the lists is,
a.Lessb.Morec.Equal
65. Having the address of the node to be deleted in doubly linked list,the node can be
deleted.
a. Without traversing the list
b. Only after traversing the list from the head
c. Only after traversing the list from the tail
d. (b) or (c) above
CIRCULAR LINKED LIST
66 .A linked list in which the last node points to the first is called a
a.Doubly linked list
b.Circular linked list
c.Single linked list
d.Generalized linked list
67.In Circular Link List
a. Head node contains the address of tail node
b. Tail node contains the address of the head
c. Head node contains the address of the middle node
d. Tail node contains the address of the middle node
68. Long form of CLL
a. Circular linked list
b. Circus linked list
c. Circuit linked list
d. None of these
69. CLL is a form of
a.Doubly linked listb.Circular linked list
c.Single linked listd.Generalized linked list
70.Advantage of CLL over SLL
a. Can travel from last node to first node
b. Cannot travel from last node to first node
c. Can travel from middle node to first node
d. None of these
71.. Each node structure of CLL is same as
a. SLL b. DLL
c. QLL d. ALL
72. ……………… data structure can be implemented using Circular linked list
a. Stack b. Queue
c. Tree d. Graph
POLYNOMIALS USING LINKED LIST
73. Polynomial is one of the applications of
a. Linked list b. Array
c. Stack d. Structure
74. A polynomial can be
a. Order list of non-zero terms
b. Order list of zero terms
c. Array of non-zero terms
d. None of these
75. Each term of polynomial contains
a. Power and coefficient
b. Index and data value
c. Power and index
d. Data and coefficient
76 .Polynodes using linked list consists of three field’s representation
a.coefficient,exponential and link
b.coefficient ,data item and the link
c.Previous item link ,data link and next item link
77 . Polynomial can perform basic operations
a. Addition of two polynomials
b. Multiplication of two polynomials
c. Evaluation of polynomials
d. All of above
78. We add two terms of polynomials when
a. Power is same b. Coefficient is same
c. Both (a) and (b) d. None of these
79. Linked list data structure usage offers considerable saving in
a. Computational time
b. Space utilization
c.Computational time as well as Space utilization
d. None of these
80. When two terms are add then
a. Only power added
b. Only coefficient added
c. Both (a) and (b)
d. None of these
81.How many fields are required by a node to represent the polynomials in computer
memory using linked list?
a. Two field b. Three field
c. More than three field
d. One is enough
Generalized LINKED LIST
82 .Consider a linked list of n element which is pointed by an external pointer. What is the
time taken to delete the element which is successorof the element pointed to by a given
pointer ?
a. O(1) b. O(log2n)
c. O(n) d.O(nlog2n)
82. A linear collection of data element the linear node is given by mean of pointer is
called
a. Linked list b. Node list
c. Primitive list d. None of these
84. Given 2 sorted list of size'm' and 'n' respectively.Number of comparison needed in the
worst case by the merge sort alogrithm will be
a. mn b. Max(m,n)
c. Min(m,n) d. m+n-1
