Scribd
Upload
6 views1 page

Alg Model Quest

The document outlines a model exam for the Computer Science and Engineering department at Dr. G.U. Pope College of Engineering, focusing on algorithms. It consists of three parts: Part A with 10 short answer questions, Part B with 6 detailed questions, and Part C with 1 comprehensive question, totaling 100 marks. The exam covers various topics including backtracking, NP-hard problems, and the N Queens problem.

Uploaded by

DAN ANGEL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views1 page

Alg Model Quest

The document outlines a model exam for the Computer Science and Engineering department at Dr. G.U. Pope College of Engineering, focusing on algorithms. It consists of three parts: Part A with 10 short answer questions, Part B with 6 detailed questions, and Part C with 1 comprehensive question, totaling 100 marks. The exam covers various topics including backtracking, NP-hard problems, and the N Queens problem.

Uploaded by

DAN ANGEL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

DR.G.U.

POPE COLLEGE OF ENGINEERING


POPE NAGAR, SAWYERPURAM
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Model exam
Sub with code: CS3401/Algorithm Class: II CSE
Staff Name:Mr.P. Daniel Raj Date:15-05-25
Time: FN Marks: 100 marks
PART-A(Answer all questions) 10x2=20marks

Q.N Questions BT Marks

1. Define Algorithm? R 2
2. State the principle of Backtracking”? U 2
3. What are the application of backtracking ? R 2
4. Define sum of subset sum problem.? A 2
5. Define complete graph? C 2
6. What are tractable and non tractable problem? R 2
7. Define NPhard and NP completness? U 2
8. Define Articulation point? R 2
9. Difference between explicit and implicit constraint.? A 2
10. What is extract and appromiximation algorithm? C 2

PART-B 5x13=65marks
Q.N Questions BT Marks
11 Explain in detail about the N Queens problem? U 13

12.. Explain in detail about approximation algorithm.? AP 13


13. Explain in detail about 3SAT,CNF problem? AP 13

14. Explain in detail about Hamltanian problem? E 13

15. Explain in detail about NP Hard and NP completeness ? AN 13


16. Explain in details about Asymptotic notation? E 13

PART-C 1x15=15marks

Q.N Questions BT Marks


11 Explain in detail about the 8 Queens problem? U 15

Total Marks : 100

Blooms Taxonomy:BT

Remembering Understanding Applying Analyzing Evaluating Creating


R U AP AN E C

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy