Test Mode
Reading Mode
Right = 0
Wrong = 0
for
while
do -while
all of the above
for
while
do-while
all of the above
DML
DDL
View
Integrity constraing
Where
select
From
Distint
where, having
having, where
Group by, having
Group by, where
The left child is always lesser than its parent
The right child is always greater than its parent
The left and right sub-should also be binary search trees
Either the left of the right sub- tree should be be binary search tree but not both.
"Box obhj -new BOx();"
Box obj=new Box;"
obj=new Box();"
new Box obj;"
method overding
method overloading
method hiding
method duplication
Kernel
file manager
Directly
NOS
"return-type function name (argument type;)"
"return-type function -name (argument type){}"
"return -type (argument type ) function-name"
"return-type {} function -name"
"Overflow "
"Crash"
"Underflow"
"User flow"
When the list has only a few elements
When performing a single earch in an unordered list
Used all the time
When list has only a few elements and when performing a single search in an underdone ist
"Lightly connected"
"Strongly connected"
" Weakly connected"
" Loosely connected"
Brute Force technique"
Divide and Conquer"
Greedy algorithm"
Dynamic programming"
"char name [10]."
"int name [10];"
"float name [10];
"double name [10];
Promotion
Download Our Mobile Apps
