Answer Posted / prashant gupta

#include<stdio.h>
#include<conio.h>

void main()
{
int i,j,t;
int a[7]={5,7,8,1,4,2,9}; // You can use any length

for(i=0;i<6;i++)
{
for(j=i+1;j<6;j++)
{
if(a[i]>a[j])
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
printf("The Sorted Array is = %d",a[i]);

getch();
}

Are collections thread safe?

788

---

What is the default size of arraylist?

904

---

Define circular list?

923

---

what is the difference between dynamic as well as non - dynamic data structures.

901

---

Write a program to reverse a single linked list.

897

---

What is a hashers run?

842

---

List some applications of multilinked structures?

835

---

What does enum do?

859

---

Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.

829

---

Two linked lists are given, find out the sum of them without altering the linked list?

917

---

How to search binary in a sorted array?

797

---

an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].

933

---

For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.

1231

---

Is hashmap a data structure?

936

---

What does each entry in the link list called?

852

---