Data Structures Interview Questions

In c++, if the pointer object characterized like a type of char ,int or float in array. So the pointer address contains the 2 bytes address.

Actually a pointer is just a address holder so its size is always that of an int data type,what ever may be the type of pointer.In a 16-bit compiler,its 2 bytes and in 32-bit compiler,its 4 bytes(ie depeds on sizeof(int))

C) a key to an Index

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.

14 is answer

ans will be 14. you can check. #include<iostream> using namespace std; int main() {     int a[]={ 8, 22, 7, 9, 31, 19, 5, 13 };int counter=0;     for(int i=0;i<...

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

all pointers are the same size, they only differ on the platform and the amount memory you are trying to address. for example, on an 8051 platform it's 3 bytes, on an intel it's 32 or 64 bits wide.

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

Top of stack

B) Front of the linked list i.e top

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

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

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.

"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 = ...

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;
}
 

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.

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

A class which implements an interface implements its methods.When we obtain a reference to a ResultSet then we are getting an instance of a class that implements the ResultSet interface.Hence class provides concrete implementations of all of the ResultSet methods.

Some kind of information regarding the type is obviously required. If there is no way of determining it from the context (i.e., the previous node in the list somehow specifies the type), it must be st...

Sounds like a simple binary search to me. For 100 floors, you would need at most 7 marbles to reach an answer. More generally, with n floors, you would need ceiling(Log2(n+1)) marbles. If the floors ...

Fuzzy logic system relays on all Crisp binary data, ambiguous data and on decision makers.

The data members of the hashtable class stored in the priVATe access specifier as members can be used by the class itself or by friends.It ensure data integrity.If the members are declared as private then only mamber functions can assign and retrive values.

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

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

"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);...

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

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,...

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.

To increase the efficiency of the linkedliss class and to allow easy manipulations on the linked list we should enhance the functionality of the class.

True, the removenodeat() function removes a node by using the nodes index and not by the the reference to the node in memory.