0% found this document useful (0 votes)
2 views3 pages

Co2 At2

This document outlines Assessment Tool 2 for the Data Structures for Computer Graphics course at Saveetha School of Engineering. It includes scenario-based questions focusing on array operations, linked lists, and stack/queue applications, with a total weightage of 10% of the Continuous Internal Assessment. The assessment consists of three questions that require students to implement algorithms and data structures in C code.

Uploaded by

aaswinkking3686
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views3 pages

Co2 At2

This document outlines Assessment Tool 2 for the Data Structures for Computer Graphics course at Saveetha School of Engineering. It includes scenario-based questions focusing on array operations, linked lists, and stack/queue applications, with a total weightage of 10% of the Continuous Internal Assessment. The assessment consists of three questions that require students to implement algorithms and data structures in C code.

Uploaded by

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

SIMATS ENGINEERING (SAVEETHA SCHOOL OF ENGINEERING)

Department of Computer Science and Engineering

ASSESSMENT TOOL 2 – Scenario Based Problems​

Data Structures for Computer Graphics


Course Code: CSA0367 Course Title:

Assessment Tool 2– Scenario Based


CO Assessed: CO2 – Imitation (BL3, BL4) Assessment:
Questions

Weightage: 10% of CIA Total Marks: 100

ADT array, Operations on arrays, Searching Algorithms, Linear Search, Binary


Search, Suffix Arrays & LCP Arrays ADT, Linked List, Stack, Queue,
CO1 Statement: Applications.

Student Name: Reg. No.:

Section / Batch: Date:

Section / Topic Focus Q Nos Marks


ADT array, Operations on arrays, Searching
Algorithms, Linear Search, Binary Search,
Array ADT, Linear & Binary 1 40
Search Algorithm

Suffix Arrays & LCP Arrays ADT, Linked List


Linked List
2 40

Stack, Queue, Applications.


Application of Stack, Queue 3 30

GRAND TOTAL: 100 Marks


Annexure A – Scenario Based Assessment

Q1) Assume you are in a library, and books are arranged alphabetically by title on long shelves. You want to find a
book titled “Data Structures”. Instead of checking books one by one, you go to the middle of the shelf. Look at the
book title: If it comes before “Data Structures” then Move to the ght half. If it comes after “Data Structures” then Move
to the left half. Again, go to the middle of the selected section. Repeat until you find the book. Implement this scenario
using C code..

Q2) Deepak is a college student who spends his leisure time browsing Facebook on his laptop. As he navigates
through different posts, Facebook allows him to move forward to new posts and backward to previously viewed posts,
similar to a browsing history. Design and implement a Doubly Linked List to simulate Deepak’s Facebook browsing
behavior with the following operations: Visit a New Post -When Deepak clicks on a new post, it is added to the list. If
he had previously gone back and then visits a new post, all forward history should be deleted. Go Back Deepak can
move to the previous post (if available). Go Forward Deepak can move to the next post (if available). Display Current
Post Show the details of the post Deepak is currently viewing. Display Full Browsing History Display all visited posts
from the beginning to the end.

Q3) A student is using a calculator to evaluate mathematical expressions. The calculator cannot directly understand infix
expressions (like we normally write), so it converts them into postfix notation before evaluation. The student enters the
expression: (A + B) × (C - D) The calculator internally converts it into postfix form to evaluate efficiently using a stack.
Perform this operation.

Rubrics for Calculation


Criteria Weighta Level 4 – Level 3 – Level 2 – Level 1 –
ge Exemplary Proficien Developin Beginnin
t g g

Clearly
understands Basic Poor
Good
Understanding of the problem understanding; understanding or
20 understanding
Problem Context and accurately some misinterpretation
with minor gaps
identifies all requirements of the problem
requirements unclear

Accurately Applies relevant Applies basic Fails to apply


Application
30 applies concepts concepts with appropriate
of Concepts
appropriate correctly with limited concepts
concepts to solve minor errors accuracy
complex problems
Logical, Mostly Basic approach
Problem-Solving Illogical or unclear
20 well-structured, logical with some
Approach approach
and efficient approach with inconsistencies
approach minor gaps
Completely
Incorrect
correct Mostly correct Partially
Accuracy of Solution 20 or
solution with with minor errors correct solution
incomplete
proper
solution
justification

Clear,
Understandable Poorly presented
well-organized, Limited clarity
Clarity 10 with minor clarity and difficult to
and properly and explanation
issues understand
explained solution

Faculty In-charge Course Coordinator Program Director

Signature: ​ Signature: ​ Signature: ​


Date: ​ Date: ​ Date: ​

You might also like