DATA STRUCTURES:

1) A balanced binary search tree can be used but not a heap for storing set of I
ntegers, deletion of the smallest
element & Insertion of an element If It is not present in the set.
2) The goal of structured programming is to be able to Infer the flow of control
from the program text.
3) The best data structure to check weather an arithmetic expression has balance
d parenthesis is a stack.
4) int (*f)(int*) declare a pointer to a function that takes an Integer pointer
as argument & returns as Integer.
5) An Abstract Data Type (ADT) is a data type for which only the operations defi
ned on it can be used, but
none else.
6) A common property of logic programming languages & functional languages is th
at both are declarative.
7) Features of OOP are Abstraction, Encapsulation & Polymorphism in the presence
of Inheritance.
8) Requirements Capture= Domain Analysis, Design= Structural & Behavioral Modeli
ng, Implementation= Module
Development & Integration, Maintainance= Performance Tuning.

ALGORITHMS:
1) Level order traversal of a rooted tree can be done by starting from the root
& performing breadth first search.
2) The tightest ower bound on the no. of comparisons, in the worst case, for com
parison-based sorting is of the
order of nlogn.
3) Pairs of Inorder & postorder or preorder & Inorder can Identify a tree unique
ly.
4) A undirected graph G has n nodes. Its adJacency matrix is given by an nxn squ
are matrix whose graph G has
multiple distinct MST's, each of cost n-1.
5) The time complexity of computing the transitive closure of a binary relation
on a set of n elements is known
to be O(n power3).
6) To Implement DiJkstra's shortest path algo on unweighted graph so that it run
s in linear time, then data
structure to be used is Heap.
7) Heap sort is the place sorting algo needs the min no. of swaps.
8) Divide & conquer takes time theta (n log n). Merge sort algo has the lowest w
orst-case complexity.
9) Inorder = d b e a f c g, preorder = a b d e c f g, postorder = d e b f g c a.
10) In an unweighted & undirected connected graph, the shortest from the node S
to every other node is computed
most efficiently, in terms of time complexity, by performing a BFS startin
g from S. BFS= Breadth First Search.
11) Bellman-Ford Shortest Path Algo = Finds weather any negative weighted cycle
is reachable from the source.
12)