basic datastructures, Data Structure & Algorithms

sample infosys campusconnect questions
Posted Date: 8/31/2012 7:29:48 AM | Location : United States







Related Discussions:- basic datastructures, Assignment Help, Ask Question on basic datastructures, Get Answer, Expert's Help, basic datastructures Discussions

Write discussion on basic datastructures
Your posts are moderated
Related Questions
Which sorting algorithm is easily adaptable to singly linked lists? Simple Insertion sor t is easily adabtable to singly linked list.

The data structure needed for Breadth First Traversal on a graph is Queue

A B-tree of minimum degree t can maximum pointers in a node T pointers in a node.

State in detail about the Integer Carrier set of the Integer ADT is the set {..., -2, -1, 0, 1, 2, ...}, and  operations on these values are addition, multiplication, subtrac


The  total  of  time  needed  by  an algorithm to run to its completion is termed as time complexity. The asymptotic running time of an algorithm is given in terms of functions. Th

This unit discussed about data structure called Arrays. The easiest form of array is a one-dimensional array which may be described as a finite ordered set of homogeneous elements

Program segment for the deletion of any element from the queue delmq(i)  /* Delete any element from queue i */ { int i,x; if ( front[i] == rear[i]) printf("Queue is

List various problem solving techniques. There are two techniques:- 1.  Top down 2.  Bottom- up

Best - Fit Method: - This method obtains the smallest free block whose  size is greater than or equal to get such a block by traversing the whole free list follows.