Scribd
Upload
93 views2 pages

Design and Analysis of Algorithm

This document is a test paper for the course Design and Analysis of Algorithms. It contains two parts: Part A contains 10 short answer questions worth 2 marks each on topics related to algorithms such as notation, efficiency, problem types, trees, graphs, and complexity. Part B contains two longer answer questions worth 15 marks each, one asking to explain asymptotic notations and properties, and the other asking to describe algorithmic problem solving fundamentals and calculate time and space complexity of factorial. It also provides instructions to answer all questions and gives details of the course, date, time, and faculty administering the test.

Uploaded by

athirayan
Copyright
© © All Rights Reserved
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
93 views2 pages

Design and Analysis of Algorithm

This document is a test paper for the course Design and Analysis of Algorithms. It contains two parts: Part A contains 10 short answer questions worth 2 marks each on topics related to algorithms such as notation, efficiency, problem types, trees, graphs, and complexity. Part B contains two longer answer questions worth 15 marks each, one asking to explain asymptotic notations and properties, and the other asking to describe algorithmic problem solving fundamentals and calculate time and space complexity of factorial. It also provides instructions to answer all questions and gives details of the course, date, time, and faculty administering the test.

Uploaded by

athirayan
Copyright
© © All Rights Reserved
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/ 2

Pandian Saraswathi Yadav Engineering College, Arasanoor-630561

Department of Computer Science and Engineering


Course: B.E- Computer Science and Engineering
Cycle Test No
:I
Max. Marks : 50
Date
: 14.02.2015
Time
: 9.10-10.50
Sub Code & Subject : CS6402 Design and Analysis of Algorithm
Year & Sem
: II & 04
Name of the Faculty : K.RajaSekaran
Note: Answer all the questions
Part A: (10 x 2 =20)
1.Write about Notion of Algorithm.

2.Differentiate Time Efficiency and Space Efficiency.


3.List out the Important Problem Types?

4. Define Tree of Recursive call.


5.Define Graph.
6.Write the efficiency of linear search algorithm.
7.Solve the recurrence Relation: x(n)=x(n-1)+5 for n>1, x(1)=0
8.List out the brute force application.
9.Define closest pair program
10.Define Brute Force.
Part B: (2 x 15 =30)

11.Explain about Asymptotic Notations and its properties?


(15)
(or)
12.a) How to measure the Fundamentals of Algorithmic Problem Solving

(8)
b) Calculate Time and Space complexity for Factorial of given number.

13.Write an Algorithm and Sort 50,30,10,90,80,20,40,70 using quick sort


(15)

(7)

(or)
14.Explain about Exhaustive search and its types of problem.

Faculty Incharge

HOD/CSE

(15)

Principal

You might also like