Skill/Topic: TreeA) number of nodes on the treeB) number of levels of a treeC) Number of branches

sivanesh.a

 Profile Answers by sivanesh.a Questions by sivanesh.a

• Feb 6th, 2007

Ans B.

mohammad nasim

 Profile Answers by mohammad nasim Questions by mohammad nasim

• Mar 17th, 2006

LEVEL+1

Answer Question  Select Best Answer

mswaroop

 Profile Answers by mswaroop Questions by mswaroop

• Sep 5th, 2007

Suppose we read a sentence using scanf e.g. "My name is ABC" in a string.Printing this string using a printf statement prints "My".Go for another successive scanf.It...

Answer Question  Select Best Answer

kranth.pothuganti

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

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

Answer Question  Select Best Answer

What is the equivalent pointer expression for referring the same element a[i][j][k][l]

KS111

 Profile Answers by KS111 Questions by KS111

• Jun 21st, 2010

Similar to what Shekhar has already mentioned, with a small correction:To print the value of a[i][j][k][l], we need to use *(*(*(*(a+i) + j) + k) + l).Explanation:Let us first take a simple example of...

sachindra.shekhar

 Profile Answers by sachindra.shekhar Questions by sachindra.shekhar

• May 6th, 2010

It should bea[i][j][k][l]   => *(*(*(a+i) + j) + k) + l

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
algo like this.......
 
for(i=0;i<n;i++)
{
 for(j=0;j<n;j++)
 {
   result[i][j]=a[i][j]+b[i][j]+c[i][j]+...........................z[i][j];
 }
}
 

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

Skill/Topic: Queues Using Linked ListsA) The QueueLinkedList class inherits the LinkedList class because the LinkedList class contains data members and function members that are necessary to manage the linked list that is used for the queue.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 14th, 2012

True,as the linkedlist class contains the functions and data members which are used to manage the linked list which is used for the queues,hence queuelinkedlist class inherit the linkedlist class.

Answer Question  Select Best Answer

If you have one million named objects and you want to store them in a data structure that lets you insert new objects quickly and search for an object by name quickly, what data structure should you use?

Read Best Answer

Editorial / Best Answer

hrshksh  

 Profile Answers by hrshksh Questions by hrshksh

• Member Since May-2010 | May 9th, 2010

---

It depends on the amount of primary memory one has for the process. If we can store 1 million records in primary memory, then we can very well take a hash table with a consistent hashing scheme for avoiding collisions. It will take O(1). 

In most cases however this is not possible. In circumtances like this, there are two ways:

B Trees or Extensible Hashing both of them have interesting time complexities.

ptmich

 Profile Answers by ptmich Questions by ptmich

• May 28th, 2012

You can use a hash table or an array of objects You can use an array of objects because you already know that you need to store a specified number of objects, also you can store and access objects qu...

hrshksh

 Profile Answers by hrshksh Questions by hrshksh

• May 9th, 2010

It depends on the amount of primary memory one has for the process. If we can store 1 million records in primary memory, then we can very well take a hash table with a consistent hashing scheme for av...

Improve Answer

rjshkr

• Sep 28th, 2012

"c NODE insert(NODE head,int data,int pos) { NODE temp,new,prev = NULL; int i=1; new = (NODE)malloc(sizeof(struct node)); new->info = data; if(head == NULL) { new->link = ...

Rahul goyal

• Jul 20th, 2012

Code
//let the structure name be stud
void insert_pos(stud *head, pos)
{
  stud s,*t;
 s.input(); //accept the data
 t=head;
pos--;
while(t!=NULL && pos)
{
  t=t->next;
   pos--;
}
s->next=t->next;
t->next=s;
}
 

Answer Question  Select Best Answer

mahesh

• Jun 17th, 2013

get two pointer to head of the list. then increment one pointer by two nodes and other by one node. if list is circular at some point both pointers will be pointing to same node. else u will encounter...

Answer Question  Select Best Answer

Explain what are linear data structure & non-linear data structure?

Lovelyn Rose

• Jul 2nd, 2013

In a linear data structures, if we traverse from an element, we can strictly reach only one other element. In a non-linear data structure, traversing from an element can lead lead to more than one element.

Sweetu

• Aug 13th, 2011

Linear data structure: A linear data structure traverses the data elements sequentially, in which only one data element can directly be reached. Ex: Arrays, Linked Lists Non-Linear data structure: Ev...

Answer Question  Select Best Answer

Niyas Ibrahim

• Sep 2nd, 2013

Use of pointer is to store a memory address.since any location in the memory have same type(characters or digits) of memory address, size is same for all pointer types.

jignesh

• Dec 29th, 2012

Size of void pointer or size of character pointer are same because both variable contain address or we can say memory location

Answer Question  Select Best Answer

ankitschopra

 Profile Answers by ankitschopra Questions by ankitschopra

• Nov 3rd, 2013

In Queue Insertion can only take place in the end. Since we have pointer to front and rear, We only require one step to insert at the rear.

Shahnawaz

• Sep 2nd, 2013

O(1). Insert element at rear.

Answer Question  Select Best Answer

Hi.
This a class Employee containes eid and ename are datamembers. when these employee class objects are stored in arrary list
i want to remove eid containes 100 and 1000
plz replay to me

gourab

• Mar 14th, 2014

Use varray or nestet table to store the array list.
the if want to remove use DELETE(n) method to specify the element to remove from the list.

Answer Question  Select Best Answer