-
The insertNodeAt() function places a new node at a specific location in the linked list.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False
Sandhya.Kishan
- Mar 26th, 2012
True , 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.
-
The hasNext() function determines if there is another entry in the hashtable based on the current state of the iterator.
Skill/Topic: Hash TableA) TrueB) False
Sandhya.Kishan
- Mar 26th, 2012
True,the hasnext() function determines if there is another entry in the hashtable based on the current state of the iterator.
-
DeleteNode() function requires the _____ of the data element of the node that is being removed.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) referenceB) valueC) declarationD) variable
Sandhya.Kishan
- Mar 26th, 2012
DeleteNode() function requires the value of data element of the node that is being removed.
-
In an array queue, data is stored in an _____ element.
Skill/Topic: Queues Using Linked ListsA) NodeB) linked listC) arrayD) constructorExplanation: In an array queue, data is stored in an array element. In a linked list queue, data is stored in a node of a linked list
-
What is the formula used to calculate the back of the queue?
Skill/Topic: QueueA) The back of the queue is calculated by using the following formula:back = (back+1) % size
Sandhya.Kishan
- Mar 26th, 2012
Back = (back+1) % size is the formula to calculate the back of the queue.
-
Forest Data Structure
What is forest data structure? How is it useful?
snyder
- Mar 13th, 2012
A forest is an undirected graph which is composed of connected components in which each and every component can be represented as a tree. . . however i don't know its use exclusively . . .
-
Double Link List
Is double link list a linear data structure? If Yes, Why?If No, Why?
snyder
- Mar 13th, 2012
If every element in a DS has almost two adjacent neighbors then it is called a linear DS. . . Hence doubly linked list is a linear DS
snyder
- Mar 7th, 2012
To check if a DS is linear or not just do a simple test . . . check if the data elements of the given DS can be accessed in a sequential manner, if it can, then its a linear DS.
A doubly linked list can be accessed in a sequential manner, hence it is a linear linked list. -
Data Structure
Data structures provide many positive aspects like minimum disk-space efficiency, proper data management but at cost of complexity. What is your opinion?
snyder
- Mar 10th, 2012
Although you have to deal with the complexity but you curb many problems that the users may experience. For eg. imagine how much data is stored in the servers of facebook. . .its massive . . .and ye...
Rajan Patekar
- Aug 12th, 2011
Complexity is at the user side in understanding not for the compiler.
data structure is a way of organising and using the memory effectively and efficiently. -
Where data abstraction used ?
can you please explain the oops concepts with example program? like in which place data abstraction is used?
snyder
- Mar 7th, 2012
Abstraction is a concept in which the complexity of the system is hidden from the user and the user interacts with the system via interfaces. the simplest example of this concept is ur computer or l...
-
Define datastructure?
yogitag
- Mar 5th, 2012
Data Structure is the way of organizing data as per the requirement and defining few operations that can be operated on it
snyder
- Feb 27th, 2012
Data Structure is way of organizing data in memory so as to use it in an efficient manner and is best suited for the algorithm to be implemented.
-
Bit Transformation
The process of transforming 1 bit pattern into another is called ______________
snyder
- Feb 29th, 2012
It is called conditioning. This question is actually related to electronics and you can find it in "Telecommunication Networks".
-
What are the advantages and disadvantages of non linear data structure ?
snyder
- Feb 27th, 2012
Advantage The basic and the only (in my opinion) advantage is that various algorithms such as searching algorithms are optimized using non linear data structure. When time complexity is compared, the...
-
Macro Usage
Why macro cannot be used in place of inline function?
-
-
What is the difference bitween NULL AND VOID pointer?
Gaurav bisht
- Nov 9th, 2011
NULL pointer means- it points to nothing
whereas,void pointer refers to the fact that the pointer has no data type declared with it and it can be used to point variable of any data-type-int,float,etc..
ex-int*(void_ptr)rohini.nitd
- Aug 17th, 2009
NULL pointer says that it is not pointing to any object, but a VOID pointer says that it can point to any object.
-
-
Time Complexity of Adding Three Matrices
What is the time complexity of adding three matrices of size NXN cell-by-cell?
Manish Yadav
- Oct 15th, 2011
Time Complexity of Adding Three Matrices because there is only two loop are needed for adding the matrix so complexity will be o(n^2), there is no effect for increase the number of matrix. it will be same for n number of matrix.
Codesonia_mehta
- Jul 6th, 2010
Program looks like......for(i=0;i<n;i++){ for(j=0;j<n;j++) { result[i][j]=a[i][j]+b[i][j]+c[i][j]; }}loop will execute n*n times...and 2 add operations..if 1 add op takes 'c' time, thentotal time= 2*c*n*nthus, time complexity= n*n......
-
Can a class have more than one finally block ?
-
Programming in C
Define data type NodeCD, declare 100 variables of CD1 & access data?
shraisy
- Sep 20th, 2011
Code- span style="font-style: italic;">//defining node// declaring 100 variables of type structure// to access
- {
- scanf("%d""%d
- , arr[i]);
- }
- please correct me if wrong !
Deletions at Both the Ends
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.a. Input-restricted dequeb. Output-restricted dequec. Priority queuesd. None of above
Shilpa chavare
- Sep 12th, 2011
Your qtn itself has the answer.. wen insertion is restricted to one end, then it obviously has to be input restricted dequeue..:)
Ans