-
The destroyList() member function deletes the contents of the linked list and ________________.
Skill/Topic: Linked ListA) does not delete the linked list itselfB) delete the linked list itselfC) adds the linked list itselfD) None of the aboveExplanation: The destructor is a member function called when the instance of the LinkedList class is deleted using the delete operator. In the example shown next, the destructor contains one statement that calls the destroyList() member function.The destroyList()...
Prabhakar
- Dec 20th, 2006
(B).
-
The destructor is responsible for allocating all the memory that was allocated for the linked list.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: The destructor is responsible for de-allocating all the memory that was allocated for the linked list.
samiksc
- Jan 20th, 2006
The destructor is responsible for de-allocating all the memory that was allocated to linked list nodes -- but not for the memory allocated by any pointer variables in the nodes. The nodes destructor is responsible for freeing all memory allocated by its pointer members.
-
Linked list C++ application is organized into three files.They are _____, ______ and _____.
Skill/Topic: Linked ListA) header file , source code file , application fileExplanation: The first file is the header file that contains the definition of the NODE structure and the LinkedList class definition. The second file is a source code file containing the implementation of member functions of the LinkedList class. The last file is the application file that contains code that creates and uses...
samiksc
- Jan 23rd, 2006
The answer is actually a linked list app CAN BE organized into a header file, source file and main application file. It can be organized in different ways also like declaration, definition can be comb...
-
A stack-linked list is a data structure that uses a ______ to create a stack.
Skill/Topic: Stacks using Linked ListA) Linked ListB) QueueC) Doubly linked list
uttama
- Feb 13th, 2007
Ans to this question is: Linked-list because, queue can be only implemented by FIFO! and doublly link list is used for both ends! hence linked list is correct option!
-
LinkedList.h file is the header file that contains the definition of the Node structure and the definition of the LinkedList class.
Skill/Topic: Stacks using Linked ListA) TrueB) False
Venkateswara Rao
- Sep 5th, 2006
True
-
The size of a queue linked list can change during runtime?
Skill/Topic: Queues Using Linked ListsA) TrueB) False
-
The size of an array queue can change during runtime?
Skill/Topic: Queues Using Linked ListsA) TrueB) FalseExplanation: The size of an array queue is set at compile time and cannot change at runtime
Sandhya
- Sep 5th, 2006
False, size won't change. It is fixed.
-
New nodes are added to the _____ of the queue.
Skill/Topic: Queues Using Linked ListsA) frontB) backC) middleExplanation: New nodes are added to the back of the queue.
Ganesh Ashtekar
- Jun 13th, 2006
Answer: B) Back
-
Parent Node is also called as _____ Node.
Skill/Topic: TreeA) MainB) RootC) BranchD) Stem
-
Data Structures Link Conversion
How do you convert doubly linked list to single without using structures?
piyushbeli
- Apr 13th, 2009
Saynode{infonode lptr,rptr}main{node p;p=start;q=p->rptr;while(p!=Null){q->lptr=Null;p=q;q=p->rptr;}}
rama.sit07
- Nov 1st, 2008
Suppose you are given doubly linked list with starting adress as p, then program for converting doubly linked list into singly list is (this is not a program just an algorithm)?node structure is defi...
-
Boolean Expression
The boolean expression X + XY equals 1. X + Y2. Y + YX3. XY + YX4. None of these
rohini.nitd
- Aug 17th, 2009
X+XY=X(1+Y)from boolean properties we know that 1+Y=Yso X+XY=Xnone of these is answer.
-
Why would you use a structure?
Skill/Topic: Variables and PointersA) You use a structure to access parts of a dataB) You use a structure to group together related data.C) You use a structure to declare an instance of data groupExplanation: Structure is used to group all related data together
-
The symbol * is also called as _________________.
Skill/Topic: Variables and PointersA) pointer dereferencing operatorExplanation: (sometimes called as dereferencing operator)
warisha
- Mar 18th, 2006
the symbol " *" is also called as "indirection operator".
-
Elements of an array are stored _______ in memory.
Skill/Topic: ArrayA) PeriodicalB) SequentiallyC) ParallelyD) None of the aboveExplanation: Elements of an array are stored sequentially in memory. For example,First, create an array called letters and assign characters to it, as shown here: char letters[3];letters[0] = 'C';letters[1] = 'B';letters[2] = 'A';In this, each letter appears one after the other in memory. This is because these values are...
bahwesh
- Feb 21st, 2006
basically elements are stored in contineous memory lacations, but as per need we can also store them in chunks of memory. by making use of link list. various other techniques can also be used
-
The dequeue process removes data from the front of the queue.
Skill/Topic: QueueA) TrueB) False
Masthan vali
- Aug 12th, 2006
DQ means double ended queue. we can remove the data from any end of the Queue.
-
Link list does not have any advantage when compared to an Array.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: A linked list can grow and shrink in size dynamically at runtime, whereas an array is set to a fixed size at compile time.
manishmodgil
- Dec 28th, 2007
FALSEAdvantages of linked list :1. Insertion and deletion are less costly.2. Dynamic addition of new elements is possible.3. Sorting is less costly.
Vikram.N
- Sep 3rd, 2007
False: In linked list, items can be inserted anywhere with O(1), while in an array you need to shift certain elements, i.e O(n). Same applies to deletion. Also every node can contain multiple values.
-
The benefit of using a stack-linked list is that the number of nodes on the stack can increase or decrease as needed while the program runs.
Skill/Topic: Stacks using Linked ListA) TrueB) False
manisha.somavanshi
- Dec 17th, 2007
If we use stack as an array there is limitation of size. but if we use stack as linked list we can dynamically store elements on the stack.
Pushpa
- Nov 7th, 2007
True
-
Why does the StackLinkedList class inherit the LinkedList class?
Skill/Topic: Stacks using Linked ListA) StackLinkedList class uses different attributes and member functions of the LinkedList class.B) StackLinkedList class uses same attributes and member functions of the LinkedList class.
Softwaredeveloper
- Mar 27th, 2010
The StackLinkedList class inherits the LinkedList class because the StackLinkedList class uses attributes and member functions of the LinkedList class
abhirup_ju
- Jan 21st, 2008
Actually the stack class does not inherit linked list class. If inheritence exists then insertbefore() , insertafter(), insertstposition(), deletenode().... these functions will be available in the st...
-
Conceptually, a linked list queue is the same as a queue built using an array.
Skill/Topic: Queues Using Linked ListsA) TrueB) FalseExplanation: Conceptually, a linked list queue is the same as a queue built using an array. Both store data. Both place data at the front of the queue and remove data from the front of the queue
ptmich
- May 28th, 2012
A FIFO (first in, first out) structure means data is added to the back of the queue and removed from the front of the queue. A first in first out structure is equivalent to last in last out structure,...
Sandhya.Kishan
- May 15th, 2012
A queue built using array is same as a linked list queue because both insert the data in the front and delete the data from front of the queue,i.e,both follow fifo data structure.
-
The insertNodeAt() function can place a node at the front or back of a linked list if you pass the appropriate index to this function.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False
Renuka Nagambika Nagambika Puvvadi
- Aug 19th, 2021
True
Sandhya.Kishan
- May 15th, 2012
True,insertnodeat() function specifies the index where to insert the new node in the linked list.
Data Structures Interview Questions
Ans