Scribd Logo
Upload

Welcome to Scribd!

  • Daa Cse 5TH Sem

    Uploaded by

    Dr. Mohd Shahid
    4 views1 page
    This document outlines the questions for a 2nd sessional test on the design and analysis of algorithms. It is divided into two units. For unit 3, students can choose between explaining the m-coloring problem or the branch and bound strategy for the traveling salesman problem. For unit 4, students can explain the classifications of problems as P, NP, NP-hard and NP-complete, or explain NP scheduling problems. The test has one compulsory question and one question from each unit, and all questions are equally weighted towards the maximum marks of 15.

    Original Description:

    Original Title

    DAA CSE 5TH SEM

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines the questions for a 2nd sessional test on the design and analysis of algorithms. It is divided into two units. For unit 3, students can choose between explaining the m-coloring problem or the branch and bound strategy for the traveling salesman problem. For unit 4, students can explain the classifications of problems as P, NP, NP-hard and NP-complete, or explain NP scheduling problems. The test has one compulsory question and one question from each unit, and all questions are equally weighted towards the maximum marks of 15.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    4 views1 page

    Daa Cse 5TH Sem

    Uploaded by

    Dr. Mohd Shahid
    This document outlines the questions for a 2nd sessional test on the design and analysis of algorithms. It is divided into two units. For unit 3, students can choose between explaining the m-coloring problem or the branch and bound strategy for the traveling salesman problem. For unit 4, students can explain the classifications of problems as P, NP, NP-hard and NP-complete, or explain NP scheduling problems. The test has one compulsory question and one question from each unit, and all questions are equally weighted towards the maximum marks of 15.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    B. Tech.

    (CSE, Semester- 5)
    Design and Analysis of Algorithms (PCC-CSE-307-G)
    Allowed Time: 1 Hour 2nd Sessional Test Max. Marks: 15
    Note: Q.1 is Compulsory. Attempt any one question from each unit. All questions carry equal marks.
    Q.1(a) What is N-Queen problem?
    (b) Differentiate between Decision and Optimization Problem.
    (c) Differentiate between Backtracking and Branch & Bound technique.
    (d) What is Sum of Subset problem?
    Unit-3
    Q.2) Explain m-coloring problem for n= 3 and m= 3 and also draw the state space tree.
    Q.3) Explain Branch and Bound strategy to solve Travelling Salesman Problem (TSP) for the given graph. Also draw
    state space tree that is generated

    Unit-4
    Q.4) Explain P, NP, NP Hard and NP complete Problems.
    Q.5) Explain NP Scheduling problems.

    B. Tech. (CSE, Semester- 5)


    Design and Analysis of Algorithms (PCC-CSE-307-G)
    Allowed Time: 1 Hour 2nd Sessional Test Max. Marks: 15
    Note: Q.1 is Compulsory. Attempt any one question from each unit. All questions carry equal marks.
    Q.1(a) What is N-Queen problem?
    (b) Differentiate between Decision and Optimization Problem.
    (c) Differentiate between Backtracking and Branch & Bound technique.
    (d) What is Sum of Subset problem?
    Unit-3
    Q.2) Explain m-coloring problem for n= 3 and m= 3 and also draw the state space tree.
    Q.3) Explain Branch and Bound strategy to solve Travelling Salesman Problem (TSP) for the given graph. Also draw
    state space tree that is generated

    Unit-4
    Q.4) Explain P, NP, NP Hard and NP complete Problems.
    Q.5) Explain NP Scheduling problems.

    B. Tech. (CSE, Semester- 5)


    Design and Analysis of Algorithms (PCC-CSE-307-G)
    Allowed Time: 1 Hour 2nd Sessional Test Max. Marks: 15
    Note: Q.1 is Compulsory. Attempt any one question from each unit. All questions carry equal marks.
    Q.1(a) What is N-Queen problem?
    (b) Differentiate between Decision and Optimization Problem.
    (c) Differentiate between Backtracking and Branch & Bound technique.
    (d) What is Sum of Subset problem?
    Unit-3
    Q.2) Explain m-coloring problem for n= 3 and m= 3 and also draw the state space tree.
    Q.3) Explain Branch and Bound strategy to solve Travelling Salesman Problem (TSP) for the given graph.
    Also draw state space tree that is generated.

    Unit-4
    Q.4) Explain P, NP, NP Hard and NP complete Problems.
    Q.5) Explain NP Scheduling problems.

    You might also like