Scribd
Upload
19 views1 page

Data Structure and Algorithm Assignment/01 - Implementation of Stacks

The document provides instructions for an assignment on implementing stacks using a linked list and converting an infix expression to postfix. Students are instructed to submit their code and are warned against plagiarism. The assignment is worth 20 marks and contains two questions.

Uploaded by

Khurram Shahzad
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
19 views1 page

Data Structure and Algorithm Assignment/01 - Implementation of Stacks

The document provides instructions for an assignment on implementing stacks using a linked list and converting an infix expression to postfix. Students are instructed to submit their code and are warned against plagiarism. The assignment is worth 20 marks and contains two questions.

Uploaded by

Khurram Shahzad
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

Data Structure and Algorithm

Assignment/01– Implementation of Stacks


Course Code: CSC2033 Course Title: Data Structures and Algorithm
Class/Section: SECTION-02 Semester: 4
Instructor: Alina Murad Deadline: 18 April 2022
th

Student Roll #: Student Name:

Obtained Maximum 20
Marks: Marks:

Note 1: Plagiarism is strictly forbidden. Copies will end up in a zero mark.


Note 2: Submit the soft form of code in google classrooms
Also, Submit in hard copy format. This is an individual effort.
Question CLO Marks
Q1 Implement Stacks using a singly linked list 1 (10)
Q2 Convert the following infix expression to a postfix expression 2 (10)
K+L-M*N+(O^P)*W/U/V*T+Q

You might also like