shiksha

• Aug 28th, 2011

Yes each entry in a link list is called node and this node consist of two parts-info, and next add.

Rajan Patekar

 Profile Answers by Rajan Patekar Questions by Rajan Patekar

• Aug 12th, 2011

True

Answer Question  Select Best Answer

ashok reddy chenikala

• Aug 31st, 2011

Declaration means just identify the datatype and some memory allocation. If we print the value it gives garbage value.

Definition means declaration and assign some value to that variable. i.e. definition = declaration + initialization.

jontyrodes

 Profile Answers by jontyrodes Questions by jontyrodes

• May 9th, 2008

Definitionint * ii is definitionsince we can store a address without allocating memory*i is definition since we can assign *i = 4 ;Definitionchar *cc is definition since it can store a address of a ch...

Answer Question  Select Best Answer

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

 Profile Answers by Rahul_Sharma Questions by 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).

Answer Question  Select Best Answer

Among arrays and linked list, which one is easiest to imlement and why?

mohd tauhid

• Sep 10th, 2011

1. in the array memory is allocated at the compile time so advance knowledge of size of the array is needed. the second thing about array is it need continues memory block and third thing is it is a e...

Answer Question  Select Best Answer

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..:)

Rajan Patekar

 Profile Answers by Rajan Patekar Questions by Rajan Patekar

• Aug 12th, 2011

A.input-restricted queue.

Answer Question  Select Best Answer

Define data type NodeCD, declare 100 variables of CD1 & access data?

shraisy

 Profile Answers by shraisy Questions by 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 !

Answer Question  Select Best Answer

Raaakesh

 Profile Answers by Raaakesh Questions by Raaakesh

• Sep 26th, 2011

Yes, but a try{..} block cant end with more than one finally {..} block.

Answer Question  Select Best Answer

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.

Code
 

sonia_mehta

 Profile Answers by sonia_mehta Questions by sonia_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......

Answer Question  Select Best Answer

saifan

• Oct 25th, 2011

Is it as simple as,

function int CalculateCube(input argNumber)
{
return argNumber*argNumber*argNumber;
}

Answer Question  Select Best Answer

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

 Profile Answers by rohini.nitd Questions by 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.

Answer Question  Select Best Answer

Pooja Negi

• Nov 14th, 2011

The root node of b-tree has (k-1) keys where k=order of tree where as any other node except root node has min {ceiling value of(k/2)} so the ans will be 6

BAADAL

• Sep 6th, 2011

IN B tree non leaf node say p can have m -1 keys where m is the no of sub tree of p and all leaf node can have n-1 key where n is the order of the tree.

Answer Question  Select Best Answer

Why macro cannot be used in place of inline function?

Sastry

• Feb 22nd, 2012

Inline functions doesnt pass the control to the function, its actually replaced at the place where it is called. Like #define, But when Macro is called it passes the control to the macro block. which actually takes some CPU cycles.

Answer Question  Select Best Answer

snyder

 Profile Answers by snyder Questions by 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...

Answer Question  Select Best Answer

The process of transforming 1 bit pattern into another is called ______________

snyder

 Profile Answers by snyder Questions by snyder

• Feb 29th, 2012

It is called conditioning. This question is actually related to electronics and you can find it in "Telecommunication Networks".

Rajan Patekar

 Profile Answers by Rajan Patekar Questions by Rajan Patekar

• Aug 12th, 2011

Type casting.

Answer Question  Select Best Answer

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

 Profile Answers by snyder Questions by 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.

Answer Question  Select Best Answer

can you please explain the oops concepts with example program? like in which place data abstraction is used?

snyder

 Profile Answers by snyder Questions by 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...

Answer Question  Select Best Answer

Data structures provide many positive aspects like minimum disk-space efficiency, proper data management but at cost of complexity. What is your opinion?

snyder

 Profile Answers by snyder Questions by 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

 Profile Answers by Rajan Patekar Questions by 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.

Answer Question  Select Best Answer

Is double link list a linear data structure? If Yes, Why?If No, Why?

snyder

 Profile Answers by snyder Questions by 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

 Profile Answers by snyder Questions by 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.

Answer Question  Select Best Answer

What is forest data structure? How is it useful?

snyder

 Profile Answers by snyder Questions by 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 . . .

Answer Question  Select Best Answer

Skill/Topic: QueueA) The back of the queue is calculated by using the following formula:back = (back+1) % size

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Mar 26th, 2012

Back = (back+1) % size is the formula to calculate the back of the queue.

Answer Question  Select Best Answer