-
-
Define datastructure?
yogitag
- Mar 5th, 2012
Data Structure is the way of organizing data as per the requirement and defining few operations that can be operated on it
snyder
- Feb 27th, 2012
Data Structure is way of organizing data in memory so as to use it in an efficient manner and is best suited for the algorithm to be implemented.
-
-
-
The front of the stack in a stack-linked list ______________.
Skill/Topic: Stacks using Linked ListA) Back of the linked listB) Front of the linked listC) Middle of the Linked listD) None of the above
Jennny
- May 10th, 2017
Back of the linked list
-
Data Structure for one million named objects
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- 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
- 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
- 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...
-
Linear Type Data Structure
Which of the following data structure is linear type?a. Stringsb. Listsc. Queuesd. All of above
-
Each entry in a link list is called a node TRUE or FALSE ?
shiksha
- Aug 28th, 2011
Yes each entry in a link list is called node and this node consist of two parts-info, and next add.
-
-
_____________ Memory is Volatile.
Skill/Topic: Memory, Abstract Data Types, and AddressesA) CacheB) Random AccessC) VirtualD) MainExplanation: Random Access Memory is also called a Main Memory. It is called a Volatile memory because; instructions and data contained in main memory are lost once the computer is powered down.
-
-
Double Link List
Is double link list a linear data structure? If Yes, Why?If No, Why?
snyder
- Mar 13th, 2012
If every element in a DS has almost two adjacent neighbors then it is called a linear DS. . . Hence doubly linked list is a linear DS
snyder
- Mar 7th, 2012
To check if a DS is linear or not just do a simple test . . . check if the data elements of the given DS can be accessed in a sequential manner, if it can, then its a linear DS.
A doubly linked list can be accessed in a sequential manner, hence it is a linear linked list. -
What is a Register?
Skill/Topic: Memory, Abstract Data Types, and AddressesA) A register is a small amount of memory within the CPU that is used to temporarily store instructions and data.Explanation: Random Access Memory is also called a Main Memory. It is called a Volatile memory because; instructions and data contained in main memory are lost once the computer is powered down.
chitraadevi
- Jun 1st, 2008
Register is a storage area.which is represented by the amount of flip flops.
deepak
- Aug 24th, 2007
Register basically a group of flip flop . flip flop is the single bit storage cell or it is the smallest memory? cell .so register is no of flip flop arranged in sequence, if there is 5 flip flop then register is called 5 bit register .
-
What are the various kinds of sorting techniques? Which is has least worst case?
These are some sorting techs,bubble sortquick sortinsertion sortselection sortmerge sortheap sorttell me any more sorting is found..... ad which is best....
akshay
- Aug 25th, 2011
BUBBLE SORT:
Code- BUBBLE SORT:
- #include<iostream.h>
- #include<string.h>
- #include<math.h>
- #include<stdlib.h>
- "Enter number of elements:""Enter no's: ""Sorted list is:"
vinod148
- Oct 23rd, 2009
HEAP sort is the best algorithmO(n log n) time for best, avg and worst caseO(1) spacelet me know if any other sorting algorithm present if that exceeds the limit i gave
Without using /,% and * operators. write a function to divide a number by 3.
Alok Mishra
- Aug 4th, 2011
"c #include #include void main() { int i,n; float m,j=0; clrscr(); printf("enter the no"); scanf("%d",&n); if(n==1) { m=0.3333; printf("%f",m); } if(n==2) { m=0....
Satish Anjaneyappa
- Apr 8th, 2011
Int quoitent=-1, rem=0;int number;while(number>=0){ rem=number; quoitent +=1; //quoitent= quoitent+1; number -=3; //number=number-3;}
If C =1, what would be the appropriate value of n0 to show that n² +9n is O( n²)?
Select one:
None of the above
5
4
10
How is memory reserved using a declaration statement?
Skill/Topic: Variables and PointersA) Memory is reserved by using a data type in a declaration statement.Explanation: The form of a declaration statement varies depending on the programming language you use. For example, here is a declaration statement for C, C++, and Java:int myVariable;
as_hmr
- Mar 11th, 2008
Just to add on.in Cint i; // it is both declaratoin and definationextern int i; // this is only declaration
manishmodgil
- Dec 28th, 2007
In C if we write int a; this statement does both viz. declaration and definition. It first created a variable named a and then defines it be of type int and allocated memory. Although we have not spec...
A linked list index is ____ that represents the position of a node in a linked list.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) An IntegerB) a variableC) a characterD) a boolean
Marbles and Floors
You have a 100-story building and a couple of marbles. You must identify thelowest floor for which a marble will break if you drop it from this floor. How fastcan you find this floor if you are given an infinite supply of marbles? What if youhave only two marbles?
Read Best Answer
Ans