## DSA 2018

Group A Group B Q.no 11

Q.no 12

Q.no 13 Q.no 14

## DSA 2019 Makeup

Group B Q.No 11.

Q.no 12

Q.n0 13 Q.no 14 Q.no 15

## DSA 2019

Group B Q.No 11

Q.No 12

Q.no 13 Q.no 14

Q.no 15 The topological sorting for a directed acyclic graph is the linear ordering of vertices. For every edge U-V of a directed graph, the vertex u will come before vertex v in the ordering. Topological sorting is only possible on DAG. […]

## DSA Pre board Solution

Asian School of Management and Technology How queue can be considered as an ADT? An ADT is a set of value, well defined set of properties of values and set of operation needed for the processing of these values. A queue can be expressed as an ADT as : Values: order list and item. Properties: […]

## Unit-4 Recursion

Recursion is a process by which a function calls itself repeatedly, until some specified condition has been satisfied. In order to solve a problem recursively, two conditions must be satisfied. First, the problemÂ  must be written in a recursive form, and second, the problem statement must include a stopping condition. Factorial Program using loop in […]

## Unit-5 Binary Trees

Binary tree AVL Tree Heap

## Array

Sorting an Array Ordering data in an increasing or decreasing fashion. 1) Sort: Sorting an index array in ascending order. <?php \$num=array(2,5,3,4,1); sort(\$num); \$length=count(\$num); for(\$i=0;\$i<\$length;\$i++) { echo \$num[\$i]; echo “<br>”; } ?> 2) rsort: Sorting an index array in descending order. <?php \$num=array(2,5,3,4,1); rsort(\$num); \$length=count(\$num); for(\$i=0;\$i<\$length;\$i++) { echo \$num[\$i]; echo “<br>”; } ?> 3) asort: […]