Scribd
Upload
79 views1 page

Lovely Professional University Home Work: #2 School: LIE-LEET

This document contains a home work assignment from Lovely Professional University for the course CSE408. The assignment has two parts with multiple questions. Part A contains questions about feasible solutions to a knapsack problem, writing pseudo code for quicksort, and an algorithm for insertion sort. Part B asks about applications of binary search, to implement merge sort on a data set, and compare depth first search and breadth first search in relation to divide and conquer strategies. The assignment is due on February 21, 2011 and has a maximum of 18 marks.

Uploaded by

Sunny Lubana
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
79 views1 page

Lovely Professional University Home Work: #2 School: LIE-LEET

This document contains a home work assignment from Lovely Professional University for the course CSE408. The assignment has two parts with multiple questions. Part A contains questions about feasible solutions to a knapsack problem, writing pseudo code for quicksort, and an algorithm for insertion sort. Part B asks about applications of binary search, to implement merge sort on a data set, and compare depth first search and breadth first search in relation to divide and conquer strategies. The assignment is due on February 21, 2011 and has a maximum of 18 marks.

Uploaded by

Sunny Lubana
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

LOVELY PROFESSIONAL UNIVERSITY

HOME WORK: #2

School: LIE-LEET Department: CSE/IT

Name of the faculty member: Usha Mittal Course No: CSE408

Class: 4th Section: H18T1

Max. Marks: 18 DOA: 11/02/2011 DOS: 21/02/2011

PART A

Q1: What are the four feasible solutions for


n=3,m=20,(p1,p2,p3)=(25,24,15),(w1,w2,w3)=18,15,10).

Q2. Write a pseudo code for a divide and conquer algorithm for
Sorting array using quick sort. Explain with an
example

Q3. Write an algorithm to sort a set of N natural numbers using insertion sort.

PART B

Q4. In which application of computer science the binary search algorithm will be more
efficient rather than linear search algorithm.

Q5. Sort the following set of elements using merge sort .


12,24,8,71,4,23,6,89,56

Q6. Compare and contrast the depth first search and birth first search. How do they fit
in to the decrease and conquer strategies.

You might also like