TCS Questions

1. What is a spanning Tree?

A spanning tree is a tree associated with a network. All the nodes of the graph appear on
the tree once. A minimum spanning tree is a spanning tree organized so that the total edge
weight between nodes is minimized.

2. What is Brute Force algorithm?

Algorithm used to search the contents by comparing each element of array is called Brute
Force algorithm.

3. What are the different types of traversing?

The different types of traversing are:
Pre-order traversal-yields prefix from of expression.
In-order traversal-yields infix form of expression.
Post-order traversal-yields postfix from of expression.

4. Can you list out the areas in which data structures are applied extensively?
Compiler Design, Operating System, Database Management System, Statistical analysis
package, Numerical Analysis, Graphics, Artificial Intelligence, Simulation

5. What is Doubly link list?

 A doubly linked list is a linked data structure that consists of a set of sequentially linked
records called nodes. Each node contains two fields, called links, that are references to the
previous and to the next node in the sequence of nodes. The beginning and ending nodes'
previous and next links, respectively, point to some kind of terminator, typically a sentinel
node or null, to facilitate traversal of the list. If there is only one sentinel node, then the list
is circularly linked via the sentinel node. It can be conceptualized as two singly linked lists
formed from the same data items, but in opposite sequential orders.

6. Difference between delete and delete[]?    

The keyword delete is used to destroy the single variable memory created dynamically
which is pointed by single pointer variable.
Eg: int *r=new(int)
the memory pointed by r can be deleted by delete r.
delete [] is used to destroy array of memory pointed by single pointer variable.
Eg:int *r=new(int a[10])
The memory pointed by r can be deleted by delete []r.

7. Write a Binary Search program.

int binarySearch(int arr[],int size, int item) {
int left, right, middle;
left = 0;
right = size-1;
while(left <= right)
{
middle = ((left + right)/2);
if(item == arr[middle])
{
return(middle);
}
if(item > arr[middle])
{
left = middle+1;
}
else
{
right = middle-1;
}
}
return(-1); }

8. What is the difference between realloc() and free()?

The free subroutine frees a block of memory previously allocated by the malloc subroutine.
Undefined results occur if the Pointer parameter is not a valid pointer. If the Pointer
parameter is a null value, no action will occur. The realloc subroutine changes the size of the
block of memory pointed to by the Pointer parameter to the number of bytes specified by
the Size parameter and returns a new pointer to the block. The pointer specified by the
Pointer parameter must have been created with the malloc, calloc, or realloc subroutines
and not been deallocated with the free or realloc subroutines. Undefined results occur if the
Pointer parameter is not a valid pointer.

9. What is the difference between an array and a list?

i) Array is collection of homogeneous elements. List is collection of heterogeneous
elements.
ii) For Array memory allocated is static and continuous. For List memory allocated is
dynamic and Random.
iii) Array: User need not have to keep in track of next memory allocation. List: User has
to keep in Track of next location where memory is allocated.
 iv) Array uses direct access of stored members, list uses sequential access for members.

10. What is mean by d-queue?

D-queue stands for double ended queue. It is a abstract data structure that implements
a queue for which elements can be added to front or rear and the elements can be
removed from the rear or front. It is also called head-tail linked list

Infosys Questions

1. What do you mean by Stack unwinding?

It is a process during exception handling when the destructor is called for all local
objects between the place where the exception was thrown and where it is caught.

2. Structural difference between bitmap and b-tree index ?

Btree: It is made of branch nodes and leaf nodes. Branch nodes holds prefix key value
along with the link to the leaf node. The leaf node in turn contains the indexed value
and rowed.
Bitmap: It simply consists of bits for every single distinct value. It uses a string of bits to
quickly locate rows in a table. Used to index low cardinality columns.

3. Tell how to check whether a linked list is circular.

Create two pointers, each set to the start of the list. Update each as follows:
while (pointer1) {
pointer1 = pointer1->next;
pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next;
if (pointer1 == pointer2) {
print ("circular\n");
}
}

4. How can u increase the heap size in the memory?

If heap size set too low then you will get "out of memory" errors. If you set it too high
then your system will hang or you will suffer poor performance because parts of the jvm
will be swapped in and out of memory. A rule of thumb is that you should not set this
parameter larger than about 80% of your free physical memory. On Windows XP
machines you can determine your free physical memory from the Performance tab of
the Task Manager application.
Boosting the heap size parameter will allow you to read in larger file-based projects. It
will also improve the performance of the database back-end since more memory is
 available for caching.In Java Set the maximum heap size, using the -Xmx command-line
option, to a value that allows the application to run with 70% occupancy of the Java
heap.The Java heap occupancy often varies over time as the load applied to the
application varies. For applications where occupancy varies, set the maximum Java heap
size so that there is 70% occupancy at the highest point, and set the minimum heap size,
using the -Xms command line option, so that the Java heap is 40% occupied at its lowest
memory usage. If these values are set, the Java memory management algortihms can
modify the heap size over time according to the application load, while maintaining
usage in the optimal area of between 40% and 70% occupancy.

5. Why is it difficult to store linked list in an array?

Both Arrays and Linked List can be used to store linear data of similar types.
Linked list provide dynamic size while the size of array is fixed, So we must know the
upper limit on the number of elements in advance.
Linked lists have following drawbacks:
1) Random access is not allowed. We have to access elements sequentially starting from
the first node. So we cannot do binary search with linked lists.
2) Extra memory space for a pointer is required with each element of the list.
3) Arrays have better cache locality that can make a pretty big difference in
performance.

6. Memory Allocation in C/C++

calloc() allocates a memory area, the length will be the product of its parameters(it has
two parameters). calloc fills the memory with ZERO's and returns a pointer to first byte.
If it fails to locate enough space it returns a NULL pointer.
malloc() allocates a memory area, length will be value entered as parameter.(it has one
parameter). It does not initializes memory area
free() used to free the allocated memory(allocated through calloc and malloc), in other
words, this used release the allocated memory
new also used to allocate memory on heap and initialize the memory using constructor
delete also used release memory allocated by new operator

7. What is AVL tree?

Avl tree is self binary tree in which balancing factor lie between the -1 to 1.It is also
known as self balancing tree.

8. How do you find out if a linked-list has an end? (i.e. the list is not a cycle)
 You can find out by using 2 pointers. One of them goes 2 nodes each time. The second
one goes at 1 nodes each time. If there is a cycle, the one that goes 2 nodes each time
will eventually meet the one that goes slower. If that is the case, then you will know the
linked-list is a cycle.

9. What is the easiest sorting method to use?

The answer is the standard library function qsort(). It's the easiest sort by far for several
reasons:
It is already written.
It is already debugged.
It has been optimized as much as possible (usually).
Void qsort(void *buf, size_t num, size_t size, int (*comp)(const void *ele1, const void
*ele2));

10. How can I search for data in a linked list?

Unfortunately, the only way to search a linked list is with a linear search, because the
only way a linked list's members can be accessed is sequentially. Sometimes it is quicker
to take the data from a linked list and store it in a different data structure so that
searches can be more efficient.