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

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

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

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

Relationship between transfer function and homogeneous solution

kirankumartana

• Jul 1st, 2013

It is the ratio of laplace transform(input to out put) of any system with out changing time domain

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

What is the difference between User Stories and a Use Case

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

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

Answer Question  Select Best Answer

Please, can anybody answer me that when to use getInstance() and which class having getInstance(),I could not find that method in class Class also.

RITENDRA

• Nov 1st, 2012

getInstance() method is written inside a class to access the instance of the class from other class. Basically, this is used to ensure that only one instance of the particular class has been created....

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) YesB) NoExplanation: Integers are usually used, but you can modify the data type of the data in the definition of the node to change the kind of data stored in the linked list.

real

• Oct 18th, 2012

When we are using structure variable then i will say yes!

Code
struct node{
int info;
string name;
float average;
node *node;
};

Rahul Goyal

• Jul 20th, 2012

Link list is a data structure not a property of integers...
so, the data the it store can be anything like a class object or structure object etc.

Answer Question  Select Best 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

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) If an invalid index is passed, the function terminates without further processing. [Explanation] Functions that use an index value always determine if the index passed to them is valid before using the index value . If an invalid index is received, the

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Jul 25th, 2012

If the user passes in an invalid index, the program will cause an assertion error. While this is useful to indicate to the user that something went wrong, so they can deal with it as appropriate.

Answer Question  Select Best Answer

Design an iterative algorithm to traverse a binary tree represented in two dimensional matrix

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Jul 16th, 2012

A binary tree can be traversed using only one dimensional array. InOrder_TreeTraversal() { prev = null; current = root; next = null; while( current != null ) { if(prev == current.parent) { prev = cu...

Answer Question  Select Best Answer