Answer Posted / sanjeev kumar

In computer science, an abstract data type (ADT) is a
mathematical model for a certain class of data structures
that have similar behavior; or for certain data types of
one or more programming languages that have similar
semantics. An abstract data type is defined indirectly,
only by the operations that may be performed on it and by
mathematical constraints on the effects (and possibly cost)
of those operations.[1]

For example, an abstract stack data structure could be
defined by three operations: push, that inserts some data
item onto the structure, pop, that extracts an item from it
(with the constraint that each pop always returns the most
recently pushed item that has not been popped yet), and
peek, that allows data on top of the structure to be
examined without removal. When analyzing the efficiency of
algorithms that use stacks, one may also specify that all
operations take the same time no matter how many items have
been pushed into the stack, and that the stack uses a
constant amount of storage for each element.

Define indegree of a graph?

1075

---

Is arraylist faster than array?

904

---

What is Another name of Dynamically allocating memory.

979

---

Explain the principle of quicksort. What is its complexity?

1054

---

Give the example of validating the parenthesis of expression using stack.

1031

---

Write an algorithm that counts number of nodes in the circular linked list

913

---

What is binary tree and its properties?

862

---

How do you solve a selection sort?

883

---

Why quicksort is faster than merge sort?

900

---

When should structures be passed by values or by reference?

1024

---

Describe stack operation.

968

---

Why is it called bubble sort?

888

---

an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).

908

---

What is unmodifiable list?

953

---

Tell me about circular linked list?

931

---