Scribd Logo
Upload

Welcome to Scribd!

  • 162 views

    Assignment 1 DSA

    Uploaded by

    Shehryar Saqib
    The document provides information about Assignment-1 for the course CS-250: Data Structures and Algorithms at NUST SEECS. It outlines two tasks - [1] developing a C++ program to convert infix to postfix expressions using appropriate data structures and algorithms, and [2] writing an overview of fundamentals of data structures and algorithms in context of the tasks. It also provides the course learning outcomes, graded items, marking rubric and submission guidelines for the assignment report.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Assignment 1 DSA

    Uploaded by

    Shehryar Saqib
    162 views2 pages
    The document provides information about Assignment-1 for the course CS-250: Data Structures and Algorithms at NUST SEECS. It outlines two tasks - [1] developing a C++ program to convert infix to postfix expressions using appropriate data structures and algorithms, and [2] writing an overview of fundamentals of data structures and algorithms in context of the tasks. It also provides the course learning outcomes, graded items, marking rubric and submission guidelines for the assignment report.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document provides information about Assignment-1 for the course CS-250: Data Structures and Algorithms at NUST SEECS. It outlines two tasks - [1] developing a C++ program to convert infix to postfix expressions using appropriate data structures and algorithms, and [2] writing an overview of fundamentals of data structures and algorithms in context of the tasks. It also provides the course learning outcomes, graded items, marking rubric and submission guidelines for the assignment report.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    162 views2 pages

    Assignment 1 DSA

    Uploaded by

    Shehryar Saqib
    The document provides information about Assignment-1 for the course CS-250: Data Structures and Algorithms at NUST SEECS. It outlines two tasks - [1] developing a C++ program to convert infix to postfix expressions using appropriate data structures and algorithms, and [2] writing an overview of fundamentals of data structures and algorithms in context of the tasks. It also provides the course learning outcomes, graded items, marking rubric and submission guidelines for the assignment report.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    National University of Sciences & Technology (NUST)

    School of Electrical Engineering and Computer Science (SEECS)


    Department of Computing

    Assignment-1: Fall 2021

    CS-250: Data Structures and Algorithms (3+1)


    BESE-11B
    Due Date: 31st October 2021
    Individual Assignment

    Note: You will upload your submission on LMS

    Course Learning Outcomes (CLOs)


    CLO-1: Understand the fundamentals of data structures and algorithms
    CLO-2: Apply Data Structures and Algorithms to solve complex engineering problems.
    CLO-3: Use appropriate Data Structures and Algorithms to design solutions
    CLO-4: Investigate and evaluate various algorithms based on accuracy, time complexity, and memory
    requirements.

    Graded Items / CLOs Mapping


    CLOs CLO3 CLO1
    Total Marks Q#1 Q#2
    40 Marks 30 Marks 10 Marks
    TASK 1: Use appropriate Data Structures and Algorithms to design solutions
    Use an appropriate data structure to develop a C++ program which can convert an infix expression
    to corresponding postfix expression. Your program should have the capability to identify if the
    infix expression is invalid. You are required to demonstrate the functionality of your program by
    requesting the user for an input expression. All input expressions must include five different
    operators (+, -, /, *, ^).

    TASK 2: Understand the fundamentals of data structures and algorithms


    In your own words, write an overview to demonstrate your understanding of fundamentals of data
    structures and algorithms in context of given task.

    SUBMISSION GUIDELINES
    You need to present your findings and understanding in a report format. You can use code snippets
    and output snippets to demonstrate your understanding section-wise/ step-wise. Appropriate
    explanation should be provided along with supporting figures and results. You should use table of
    contents and include captions and figure numbers for all figures included. You need to provide
    your complete code at the end of the report.

    Marking Rubric

    T1 30 Marks: 21 Marks: 6 Marks: Zero Marks:


    All Most Work is not Work is not
    specifications specifications satisfactory, presentable and
    are met, and are met, and however a does not qualify
    demonstrated in demonstrated. reasonable as a reasonable
    the report with However, there attempt is made. attempt.
    appropriate is room for
    explanation. improvement in
    This section presentation and
    should be well completeness.
    presented to earn
    10 marks.
    T2 10 Marks: 7 Marks: 3 Marks: Zero Marks:
    All Most Work is not Work is not
    specifications specifications satisfactory, presentable and
    are met, and are met, and however a does not qualify
    demonstrated in demonstrated. reasonable as a reasonable
    the report with However, there attempt is made. attempt.
    appropriate is room for
    explanation. improvement in
    This section presentation and
    should be well completeness.
    presented to earn
    10 marks.

    You might also like