-
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.
-
The hashString() member function is called by other member functions of the Hashtable class whenever a function needs to convert a ________________.
Skill/Topic: Hash TableA) a hash number key to a keyB) key to a hash number keyC) a key to an IndexExplanation: The hashString() member function is another function called by other member functions of the Hashtable class whenever a function needs to convert a key to a hash number key. The hashString() function requires one argument, a char pointer to the key that is being hashed. The hash number that...
rasheed
- Feb 14th, 2013
C) a key to an Index
Sandhya.Kishan
- May 21st, 2012
The hashString() member function is called by other member functions of the Hashtable class whenever a function needs to convert a key to hash number key.
-
How to reverse all the no using a single link list?
csabill
- Nov 2nd, 2006
void reverse() { Node < T > *currentNode = head, *nextNode = currentNode->next; while(nextNode) { Node < T > *newNextNode = nextNode->next; nextNode->next = currentNode; cur...
f2003062
- Oct 30th, 2006
A quite different way..! but same as the previous logic written by Rohit..!struct linkedlist { int x; struct linkedlist* next;}*head;Assume that "head" contains some nos ...example: 1->2->3->4...
-
-
What is nonvolatile memory?
manishmodgil
- Dec 28th, 2007
On the contrary the volatile memory is the one which get washed off when power is swithched off eg. RAM.
Rani
- Oct 4th, 2007
It is a type of computer memory which retains stored information even when the power is off. Also known as secondary memory. Eg. of such devices are flash drives, hard disk etc.
-
Data structures questions
I had following question paper for data structures on 29th Oct, 2007. There were total 10 questions in the engineering paper to be done in 1 hr. I remember only 9 of those:1. A binary search tree was given. Tell the 4th smallest value in it.2. An infix expression was given. Draw a binary tree and write it in prefix/postfix notation.3. A stack has to be implemented. Following methods are given: PUSH[value]...
manishmodgil
- Dec 28th, 2007
First Question's Ans :Create a FIFO list of 4 digits.start from the root of the BST and keep on insrting the nodes in the FIFO till either there is no left subtree of the BST is left and the FIFO ...
-
Data Structures declared as Volatile and Const
What does it mean when a data structure is declared volatile?
What does it mean when a data structure is declared Const?pvsola
- Apr 3rd, 2008
Volatile - you are asking compiler to not to optimise the data structure as well as to reload to CPU registers whenever it is in use. Not a good idea for Data structure, will waste lot of CPU time in loading long data structures.
as_hmr
- Mar 11th, 2008
If we declare a data structure const means after declration that data structure is read only.Declaring a data structure Volatile is a order to compiler not to perform optimization on that data structure.
-
What are the advantages of a database approach compared to a flat file system?
kranth.pothuganti
- Sep 15th, 2009
There are many advantages with database approach compared to a flat file system. Some of them are: 1) It's not possible to implement relationships between files in filesystem.2) Controlled redundancy...
gurjot911
- Mar 5th, 2009
A flat file is a kind of approach to a database system. I think the question should have been advantages of relational system on a flat file system.In that case it would be straight forward as a relat...
-
Dynamic Inserting and Deleting
Which data structure is used for inserting and deleting dynamically?
stealth
- Mar 2nd, 2010
Dynamic insertion and deletion works well with Lists (like a doubly linked list)(also mentioned in the previous answer)The problem gets incremented this way;Insertion at a particular location; should ...
PPreksha
- Dec 15th, 2009
Linked lists are best suited for Dynamic insertion and deletion.. as an element can be added at any point in the list with O(1).
-
Hierarchical Relationship Between Elements
To represent hierarchical relationship between elements, which data structure is not suitable?a. Dequeb. Priorityc. Treed. All of above
Piyush Verma
- Mar 26th, 2010
Both tree and priority has hierarchical relationship because there is parent child relationship in tree and in priority based higher priority element goes to high level.Dequeue has no hierarchy because traversal is possible in both direction.
saqibja
- Mar 1st, 2010
Only tree has the notion of parent child relationship, other data structures listed here do not have that.
-
Lint
What is Lint a) a compiler b) a interactive debuggerc) a cinterpreter d) a tool for analysing C++ program
sanket.ashu
- Jun 28th, 2010
Lint is a computer programming tool that performs the lexical and syntactic portions of the compilation with substantial additional checks, noting when variables had been used before being set, when t...
-
Array vs Linklist
List out the differences between an array and a linklist data structure.
KS111
- Jun 21st, 2010
1. The allocation of array elements in memory is contiguous. Each element in a Linked list can be placed anywhere in the memory.2. Once defined, array size cannot be modified. In a linked list size ca...
rumesh.cse
- Jun 10th, 2010
In liknked list insertion and deletion can be done anywhere in the structure, since the previous and next elements in the structures are linked to each other.Whereas in arrays, there is no link betwee...
-
How to find the loop in singly linked list
If we are having the singly linked list then last node of the list is linked with middle (or) any node in the list then it causes the loop then how to find the loop with less time complexity
Rahul_Sharma
- Sep 4th, 2011
Method 1.check the node pointed to by the outer loop, with every node of the inner loop. Method2. Have a visited flag in each node of the linked list. Flag it as visited when you reach the node. When...
prasanjeet
- Aug 25th, 2011
Take 2 pointers (say p & q) pointing to the start of the list. Increment p by one and q by 2 till p and q points to the same node (in case of loop) or one of them reaches the end (in case of no loop).
-
Stack using two queues
write a code how to implement stack using two queues?
and vice versa ?ptmich
- May 28th, 2012
"c 1.queue_t q0; 2.queue_t q1; 3. 4.void stack_push(void *t) { 5. // At any given time one queue will be empty 6. queue_t *curr = (q0.isEmpty() ? q1 : q0); 7. 8. curr.push(t);...
ilushka
- Nov 4th, 2011
something like this:"c queue_t q0; queue_t q1; void stack_push(void *t) { // At any given time one queue will be empty queue_t *curr = (q0.size() ? q0 : q1); curr.push(t); ...
-
C Program to replication of string
Write a c program to implement the replication of string which will be given as a command line argument?
If C =2, what would be the appropriate value of n0 to show that n² +9n is O( n²)?
Select one:
4
None of the above
5
10
We toss a coin until a head appears. What is the expected number of coin tosses?
Select one:
4
1
0.5
2
Ans