Archive for data structures
You are browsing the archives of data structures.
You are browsing the archives of data structures.
/*initialising the arrray*/
#include<stdio.h>
#include<conio.h>
void main()
{
int a[10],i;
clrscr();
printf("Enter the array");
for(i = 0;i <=9;i ++)
{
scanf("%d",&a[i]);
}
printf("The entered array is");
for(i = 0;i <=9; i++)
{
printf("%d\n",a[i]);
[...]
Q. What are Vector, Hashtable, LinkedList and Enumeration?
Ans: Vector : The Vector class provides the capability to implement a growable array of objects.
Hashtable : The Hashtable class implements a Hashtable data structure. A Hashtable indexes and stores
objects in a dictionary using hash codes as the object’s keys. Hash codes are integer values that identify
objects.
LinkedList: Removing [...]