0% found this document useful (0 votes)
2 views

Unit 19 Data Structures - 2023

The document outlines an assignment for a Level 4 course on Data Structures and Algorithms at the International School of Management & Technology in Nepal. It details the tasks required for students to demonstrate their understanding of abstract data types, data structures, and algorithms, including design specifications, implementation, and analysis. The assignment emphasizes the importance of original work, proper referencing, and adherence to submission guidelines to avoid plagiarism.

Uploaded by

Subash Rijal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

Unit 19 Data Structures - 2023

The document outlines an assignment for a Level 4 course on Data Structures and Algorithms at the International School of Management & Technology in Nepal. It details the tasks required for students to demonstrate their understanding of abstract data types, data structures, and algorithms, including design specifications, implementation, and analysis. The assignment emphasizes the importance of original work, proper referencing, and adherence to submission guidelines to avoid plagiarism.

Uploaded by

Subash Rijal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

INTERNATIONAL SCHOOL OF

MANAGEMENT & TECHNOLOGY


NEPAL

FACULTY OF COMPUTING
UNIT TITLE Unit 30: Unit 19: Data Structures & Algorithms
UNIT CODE D/615/1649 LEVEL 4 (Core)
STUDENT NAME CREDIT VALUE 15
ASSIGNMENT Census Data Management
WORD COUNT
TITLE System
ASSESSOR Rahul Kumar I.V.
ASSIGNMENT
ASSIGNMENT
30/07/2023 SUBMISSION 20/09/2023
ISSUE DATE
DATE
ORIGINAL ASSIGNMENT
1
SUBMISSION NO.

ASSESSMENT CRITERIA TO BE ASSESSED IN THIS ASSIGNMENT


(Identify all criteria to be assessed in this assignment)

Assignment Criteria P1 P2 P3 P4 P5 P6 P7
Achieved
Distinction
Merit Criteria
Criteria
Assignment Criteria M1 M2 M3 M4 M5 D1 D2 D3 D4
Achieved

Important:
● Read the plagiarism notice and requirements at Page 5
● Accepted Sources: Research Papers (Journal Articles, Conference Proceedings, Thesis),
Text Books, Governmental Data, Websites (only a registered organization, an educational
institution, government agency)
● Information taken from unreliable sources will not be accepted
● Must follow Harvard Reference Style
● Assignment must be submitted through the Plagiarism Detection Tool

1|Page
Assignment Submission Format

Each student has to submit their assignment as guided in the assignment brief. The students are
guided what sort of information is to produce to meet the criteria targeted. You are required to
make use of headings, paragraphs and subsections as appropriate, and all work must be supported
with research and referenced using the Harvard referencing system.

Unit Learning Outcomes

● LO1 Examine abstract data types, concrete data structures and algorithms.
● LO2 Specify abstract data types and algorithms in a formal notation.
● LO3 Implement complex data structures and algorithms.
● LO4 Assess the effectiveness of data structures and algorithms.

Scenario 1

iConnect Pvt Ltd is a software company that works on projects based on machine learning,
artificial intelligence, IOT (internet of Things) etc. The company has recently submitted proposal
to accomplish the government project associated with census data management through web and
mobile application. Central Bureau of Statistics (CBS) is a government organization which
conduct census in Nepal.

Before handing the project, the CBS needs to know the company understands on how different
data structures are used and manipulated and wants to know if company is able to integrate best
and optimized algorithms so as to develop efficient and accurate applications.

You are one of the software engineers working in this company. Now you are assigned the
responsibility to prepare this document to show your company understands on use of different
ADTs, different sorting and searching algorithms, their applications and efficiency. Prepare the
document based on following four parts which includes different sub tasks.

2|Page
Assignment Task – Part 1

Part 1: You will need to prepare a written document which demonstrates


the followings

 Create a design specification for data structures explaining the valid operations that
can be carried out on the structures and determine the operations of a memory stack
and show how it is used to implement function calls in a computer.
 Illustrate, with an example, a concrete data structure for a First In First out (FIFO)
queue and compare the performance of two sorting algorithms. Further, produce an
analysis of the operation of the two network shortest path algorithms providing an
example of each.

Assignment Task – Part 2


Part 2: Write an article based on the following key aspects which will be published in an IT
magazine.
 Using an imperative definition, specify the abstract data type for a software stack.
 Examine the advantages of encapsulation and information hiding when using an
ADT.
 Discuss the view that imperative ADTs are a basis for object orientation and, with
justification, state whether you agree.

Assignment Task – Part 3

Part 3: Prepare a formal written report that includes the following:


 Demonstrate the implementation of a complex ADT and algorithm in an
executable programming language to solve a well-defined problem and also include
error handling and report test results. Here explain different approaches to handle the
error including exception handling. Provide a program implementing try, catch and
finally block with different results after executing that program.
 Demonstrate how the implementation of an ADT/algorithm solves a well-defined
problem and critically evaluate complexity of an implemented ADT/algorithm.
 Discuss how asymptotic analysis can be used to assess the effectiveness of an
algorithm. Here you need to explain what asymptotic analysis of an algorithm is and
how it can be used to find effectiveness of an algorithm and determine two ways in
which the efficiency of an algorithm can be measured, illustrating your answer with an
example.
 Interpret what a trade-off is when specifying an ADT using an example to support
your answer.

3|Page
 Write concluding remarks that evaluates three benefits of using implementation
independent data structures.

Learning and Assessment Criteria

Pass Merit Distinction


LO1 Examine abstract data types, concrete data structures and
algorithms
P1 Create a design specification M1 Illustrate, with an example, D1 Analyse the operation,
for data structures explaining a concrete data structure for a using illustrations, of two
the valid operations that can be First In First out (FIFO) queue. network shortest path
carried out on the structures. algorithms, providing an
M2 Compare the performance of example of each.
P2 Determine the operations of two sorting algorithms.
a memory stack and how it is
used to implement function calls
in a computer.

LO2 Specify abstract data types and algorithms in a formal


notation
P3 Using an imperative M3 Examine the advantages of D2 Discuss the view that
definition, specify the abstract encapsulation and information imperative ADTs are a
data type for a software stack. hiding when using an ADT. basis for object orientation
and, with justification,
state whether you agree

LO3 Implement complex data structures and algorithms


P4 Implement a complex ADT M4 Demonstrate how the D3 Critically evaluate the
and algorithm in an executable implementation of an complexity of an
programming language to solve ADT/algorithm solves a well- implemented
a well-defined problem. defined problem. ADT/algorithm.

P5 Implement error handling


and report test results.

LO4 Assess the effectiveness of data structures and algorithms


P6 Discuss how asymptotic M5 Interpret what a trade-off is D4 Evaluate three benefits
analysis can be used to assess when specifying an ADT using of using implementation
the effectiveness of an an example to support your independent data
algorithm. answer. structures.

P7 Determine two ways in


which the efficiency of an

4|Page
algorithm can be measured,
illustrating your answer with an
example.

Grades Achieved

Note: Refer the unit details provided in your handbook when responding all the tasks above.
Make sure that you have understood and developed your response that matches the highlighted
key words in each task.

Plagiarism Notice

You are remined that there exist Academic Misconduct Policy and Regulation concerning
Cheating and Plagiarism.

Extracts from the Policy:

Section 3.4.1: Allowing others to do assignments / Copying others assignment is an offence


Section 3.4.2: Plagiarism, using the views, opinion or insights / paraphrasing of another person’s
original phraseology without acknowledgement
Requirements

 It should be the student’s own work – Plagiarism is unacceptable.


 Clarity of expression and structure are important features.
 Your work should be submitted as a well presented, word-processed document with
headers and footers, and headings and subheadings.
 You are expected to undertake research on this subject using books from the Library, and
resources available on the Internet.
 Any sources of information should be listed as references at the end of your document
and these sources should be referenced within the text of your document using Harvard
Referencing Style.
 Your report should be illustrated with screen-prints, images, tables, charts and/or
graphics.
 All assignments must be typed in Times New Roman, font size 12, 11/2 spacing.

5|Page
The center policy is that you must submit your work within due date to achieve “Merit”
and “Distinction”. Late submission automatically eliminates your chance of achieving
“Merit and Distinction”. Also, 80% attendance is required to validate this assignment.

I declare that all the work submitted for this assignment is my own work and I understand that if
any part of the work submitted for this assignment is found to be plagiarised, none of the work
submitted will be allowed to count towards the assessment of the assignment.

Assignment Prepared By Signature Date

Sudeep Bhandari April 20, 2023

Brief Checked By Signature Date

Dhruba Babu Joshi April 25, 2023

6|Page

You might also like