Assignment Topics for DAA

1 Kruskals algorithm

2 Prims algorithm

3 Dijkstras algorithm

4 Five colour theorem

5 Six colour theorem

6 Max-flow Min-cut theorem

7 Characterization of planar graphs

8 Depth first search

9 Breadth first search

10 Connected components search algorithm

11 Np problems
12 Multiple stacks (H&S)

13 Circular list representation of polynomials (H&S)

14 Double ended queues

15 How fast can we sort? (H&S)

16 Priority queues

17 Recursion types (Dromey)

18 Radix sort

19 Multilist structures

20 Evaluation of postfix expressions (H&S)

21 Dynamic storage management; first fit algorithm (H&S)

22 Heap adjust algorithm

23 Linked representation of sparse matrices

095001 ADITI PRASAD Alternate proof of Eulers theorem

Show that a complete graph Kn

can be expressed as the union of
095003 AKANCHA GUPTA
(theorem 1.2.23, page 26;
West, 2ed)
095005 AKASH GUPTA Kruskals algorithm

H-free and triangle free graphs

095020 ANURADHA VERMA
(page 41; West 2ed)
095031 DEEKSHA SAXENA Prims algorithm

095034 DISHA SHARMA Dijkstras algorithm

Theorem 2.1.13, Jordan, (page

095037 DOLLY (D/o SRI BHAGWAN DA
72; West 2ed)
Thorem 2.1.14 (page 72; West
095038 DOLLY (D/o SRI JAIVEER JA
2ed)
095040 GEETA YADAV Five colour theorem

095063 MAHIMA SINGH (D/o SRI GOP Max-flow Min-cut theorem

Characterization of planar graphs

095064 MANEESHA KUMARI
(page 246; West 2ed)
Theorem 6.1.14, (page 238; West
095069 NEELIMA SACHWANI
2ed)
Induction traps with examples
095071 NEHA TYAGI
(page 42; West 2ed)
095077 POOJA AGRAWAL Dominating Sets

Interval graph (page 195; West

095078 POOJA NAGPAL
2ed)
Berges theorem on 2-switch;
095079 PRATIBHA BHADAURIYA (Theorem 1.3.33, page 47; West
2ed)
Theorem 6.1.16, (page 239; West
095087 PRIYANSHI
2ed)
Proposition 2.1.7 (page 70; West
095088 PRIYANSHU
2ed)
095089 PUNEET KUMAR YADAV Depth first search

095096 REKHA YADAV Breadth first search

Connected components search

095103 SAKSHI ARORA
algorithm
095105 SANJANA KAUSHAL Outer planar graphs

Graceful labelling (page 87; West

095109 SATVIKA THAPAR
2ed)
095118 SHIV PRATAP SINGH Six colour theorem

Theorem 2.2.26 (page 90; West

095137 UMANGIKA JOHRI 2ed) Proof of correctness of
Algorithm to determine Euler ckt.
095145 VISHAL BASARYA
 GD Topics Name Dat
e

1 Linked stack (H&S) Deepika S 19.1

1

2 Linked queue (H&S) Priya 19.1

Pathak 1

3 Multiple stacks (H&S) Dinesh V 19.1

1

4 Circular list representation of polynomials (H&S) Richa Singh 19.1

1

5 Circular linked lists and some procedures on them Chaudhary 20.1

(H&S) R 1

6 Generalised lists (H&S) Gunjan 20.1

Sharma 1

7 Binary tree representation of propositional formula and Yadvendra 20.1

their evaluation (H&S) S 1

8 Binary Tree representation of trees (H&S) Dau 20.1

Upadhyay 1

9 Fibonacci search (H&S) Priyanka 21.1

Goel 1

1 Double ended queues V 21.1

0 Kushwaha 1

1 Bin sorting Priya Ahuja 21.1

1 1

1 Stacks and recursive procedures; Elimination of tail Pallav 21.1

2 recursion Sinha 1

1 Recursive merge sort (H&S) Alwin 22.1

3 Gupta 1

1 Heap adjust algorithm (H&S) Rakhi 22.1

4 Chawla 1

1 Linked representation of sparse matrices (H&S) Payal 22.1

5 Sharma 1

1 Sorting on several keys (H&S) S 22.1

6 Srivastava 1

1 How fast can we sort? (H&S) Taruna 23.1

7 1

1 Shellsort H Oberoi 23.1

8 1

1 The tree collapsing rule to speed up finds (H&S) G Awasthi 23.1

9 1

2 Priority queues Richa Singh 23.1

0 1

2 Recursion types (Dromey) Deepak V 24.1

1 1

2 Radix sort Akhil 24.1

2 Bansal 1

2 Multilist structures Deepak G 24.1

3 1

2 Evaluation of postfix expressions (H&S) Sukhbir 24.1

4 Singh 1

2 Dynamic storage management; first fit algorithm Ankur 26.1

5 (H&S) Mohan 1

2 Storage devices (H&S) Prashant S 26.1

6 1
GD Topics Name Date

Linked stack Vipul Tyagi 18.1

1

Linked queue Arti 18.1

1

Multiple stacks Kumar Subodh 18.1

1

Circular list representation of polynomials Nija Kaura 20.1

1

Concatenation of two circular linked lists Shival Kulshreshtha 20.1

1

Generalised lists Anita Agarwal 20.1

1

Binary tree representation of propositional formula Prashant Saxena 21.1

and their evaluation 1

Binary Tree representation of trees Gurmeet Kaur 21.1

1

Fibonacci search Arohi Saxena 21.1

1

Double ended queues Apeksha Singh 23.1

1

Merge sort algorithms Abhishek Singhal 23.1

1

Merge sort algorithms Abhishek Agarwal 23.1

1

Recursive merge sort Deepika Ahuja 24.1

1

Heap adjust algorithm Visheshank Shukla 24.1

1

Linked representation of sparse matrices Payal Sharma 24.1

1

General rules for running time calculations Akansha Trivedi 25.1

1

Logarithms in the running time: Binary search GM Priya 25.1

example 1

Shellsort Alok Dubey 25.1

 1

The tree collapsing rule to speed up finds Ashutosh Chaubey 27.1

1

Priority queues: Introduction Vibhuti Varshney 27.1

1

Recursion types Ritu Srivastava 27.1

1