Scribd Logo
Upload

Welcome to Scribd!

  • Cos Course Outcome: Reg. No

    Uploaded by

    Manojis Manojis
    9 views1 page
    This document contains details of an internal examination for an Algorithms course, including: 1) The course outcomes being assessed are analyzing algorithm efficiency, applying graph algorithms, using techniques like divide-and-conquer for problem solving, and applying approximation and randomized algorithms. 2) The exam contains short answer and long answer questions assessing these outcomes, with topics like complexity analysis, searching, recurrence relations, string matching, and graph traversal. 3) The questions are graded according to Bloom's taxonomy and allocated marks for assessment of the course outcomes related to analyzing efficiency and applying graph algorithms.

    Original Description:

    Original Title

    Untitled

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains details of an internal examination for an Algorithms course, including: 1) The course outcomes being assessed are analyzing algorithm efficiency, applying graph algorithms, using techniques like divide-and-conquer for problem solving, and applying approximation and randomized algorithms. 2) The exam contains short answer and long answer questions assessing these outcomes, with topics like complexity analysis, searching, recurrence relations, string matching, and graph traversal. 3) The questions are graded according to Bloom's taxonomy and allocated marks for assessment of the course outcomes related to analyzing efficiency and applying graph algorithms.

    Copyright:

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

    Cos Course Outcome: Reg. No

    Uploaded by

    Manojis Manojis
    This document contains details of an internal examination for an Algorithms course, including: 1) The course outcomes being assessed are analyzing algorithm efficiency, applying graph algorithms, using techniques like divide-and-conquer for problem solving, and applying approximation and randomized algorithms. 2) The exam contains short answer and long answer questions assessing these outcomes, with topics like complexity analysis, searching, recurrence relations, string matching, and graph traversal. 3) The questions are graded according to Bloom's taxonomy and allocated marks for assessment of the course outcomes related to analyzing efficiency and applying graph algorithms.

    Copyright:

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

    Reg.

    No.
    LORD JEGANNATH COLLEGE OF ENGINEERING AND TECHNOLOGY
    Ramanathichanputhoor, KumarapuramThoopur, Kanyakumari District, Tamilnadu - 629402

    I INTERNAL EXAMINATION Date/Session : 23.03.2023/FN


    Sub. Code: CS3401 Max. Marks: 50
    Sub. Name : Algorithms Duration : 01:30 hours
    Department : Computer Science and Engineering Year /Branch : II CSE

    Course Outcomes for Assessment in this Internal Examination

    COs Course Outcome


    C213.1 Analyze the efficiency of algorithms using various frameworks
    Apply graph algorithms to solve problems and analyze their efficiency.
    C213.2
    C213.3 Make use of algorithm design techniques like divide and conquer, dynamic programming
    and greedy techniques to solve problems
    C213.4 Use the state space tree method for solving problems.
    C213.5 Solve problems using approximation algorithms and randomized algorithms

    Bloom
    Answer all the Questions
    Q.No. COs Taxonomy Marks
    PART-A ( 5 ×2=10 )
    Level
    1 Define time and space complexity? C213.1 Understanding 2

    2 What is searching? C213.1 Remembering 2


    3 Explain recurrence relation? C213.1 Remembering 2
    4 Define naïve string matching algorithm? C213.1 Remembering 2
    5 What is Graph traversal? C213.2 Remembering 2
    Bloom
    Answer all the Questions
    Q.No. COs Taxonomy Marks
    PART-B ( 13+13+14=40 )
    Level
    Describe in detail about Asymptotic C213.1 Understanding
    6 13
    notations?
    7 Explain briefly about Rabin karp algorithm? C213.1 Understanding 13
    8 Elaborate in detail about breadth first search? C213.2 Analyzing 14

    CO ASSESSMENT

    Marks in Marks in
    COs Total Marks
    Part-A Part-B
    C213.1 8 26 34
    C213.2 2 14 16

    Course Coordinator HOD/ECE IQAC In-Charge PRINCIPAL

    You might also like