0% found this document useful (0 votes)
5 views6 pages

CEN 364 - Group Assignment Text Editor

The document outlines a group assignment for a Data Structures and Algorithms course, focusing on developing a text editor application named TCSEditor using linked lists in C++, Java, or similar languages. The assignment aims to enhance students' understanding of algorithms and data structures while requiring them to implement various text editing commands. Submission guidelines, evaluation criteria, and rules regarding collaboration and plagiarism are also detailed.

Uploaded by

ileemmanuel549
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)
5 views6 pages

CEN 364 - Group Assignment Text Editor

The document outlines a group assignment for a Data Structures and Algorithms course, focusing on developing a text editor application named TCSEditor using linked lists in C++, Java, or similar languages. The assignment aims to enhance students' understanding of algorithms and data structures while requiring them to implement various text editing commands. Submission guidelines, evaluation criteria, and rules regarding collaboration and plagiarism are also detailed.

Uploaded by

ileemmanuel549
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
You are on page 1/ 6

CEN 364 ● Data Structures & Algorithm

Department: Computer Engineering


Commence Date: 8th July 2025 (Week 6) Group
Deadline Date: 8th August 2025 (Week 12) Assignment
Examiner: Dr. Sibe & Eme E. S. J 20%
Contact Number: 08037396140
E-mail: [email protected]

ASSIGNMENT TITLE

 Text Editor

OBJECTIVE

The objective of this Group Assignment is for students:

 To help students in understanding of algorithms in data structures.


 To help students to apply the algorithms in real data using C++ or Java.
 To help students to analyse storing algorithm and using lists.

EXPECTED OUTCOME

 Students are expected to enhance their knowledge in the data structure of programming
by using the different structures and algorithms.
 Students are expected to know about the features of various useful algorithms and use
them in their programming skills.

ASSIGNMENT DESCRIPTION

You are required to develop a console application using any programming language that you
are familiar to store user’s information using linked lists. This application should be a simple
text editor named TCSEditor which supports txt files. It should have features and the following
commands:

a) Load: loads a text file in format txt for editing. This command should be followed by
the path that the file is located on your computer’s memory. In this module your
application should be capable to store all string pieces in separated nodes of link lists.
Ex. Load C:\myassignment\textfile.txt
b) Display: Display the stored information in linked list.
c) Insert: Insert new data in certain part of the text.

the value “Hello” inside.

d) Save: save the changes into the original txt file.


e) Delete: delete certain word from the text.

f) Copy: copy a node’s content into the clipboard.


g) Cut: cut a node and put it on the clipboard.
h) Paste: paste from the clipboard into a specific point of a document.
i) Replace: replace a text string with another throughout a document.
j) Exit: exit from the program.
k) Help: get help information.
Important Note: Make sure that for all of the functions above you defined a command in
your command line. A command system with numbers as input values is NOT acceptable
and the text command should be recognized by your system.

REPORT STRUCTURE
In the hardcopy of this assignment, you have to write according to the following structure:
1. Cover Page
2. Result
 Explanation of your algorithm to approach the solution.
 Findings, sample testing and conclusion
3. Source code
 Print ALL your coding (Explain details as comments)
4. A copy of marking sheet MUST be included in last page of your report.
SUBMISSION INFORMATION
 Submission deadline is on Friday 8th July 2025 Week 12.
 Plagiarism will be marked as ZERO for all group members.
 This assignment is a group assignment consists of maximum FIVE (5) students (no
bargaining. If you are Six (6) you should divide in two groups of two).
 Students are required to submit the report in hardcopy and the softcopy in CD. The
assignment will not be marked if both of softcopy and hardcopy have not been
submitted.
 Student can use C, C++ or Java or any other language that supports pointers and linked-
lists.
 Student is NOT ALLOWED to use Lined-list library from internal C or Java library or
third party library. Student is free to develop their own linked-list library or use an open
source linked-list class (Student should study and understand the open source code and
be able to explain that.)
 Student who submits this assignment after the deadline date stated above will be
penalized.
 Print out the source code by using Arial font style, size of 10 and space by 1.
 You must submit the work with an assignment cover page and bind together as
submission.
 Your presentation will be within your class on Week 12.
 Each group member will be asked to present the project individually.
 The project report should clearly show the contribution of each group member.

BONUS MARK
 Group assignments with extra complex commands such as SELECT-MAX or
SELECT-GROUP BY or etc. would be awarded at least 2 mark bonus (Would be
different based on complexity of commands from 2 to 4 for each extra command).
SPECIFIC INFORMATION
 This Assignment is a group work and it contributes 20% to your total marks.
 In this assignment students in a group would receive maximum 15% for their code and
5% for their presentation. The presentation mark will NOT be the same among a group.
RULES AND REGULATIONS
 You are NOT allowed to work together to get a detailed solution, to copy a solution, or
to give away a solution other than your group
 Do NOT let other members see your solution.
 Do NOT e-mail your solution to anyone other than the lecturer.
 If someone cheats by using your work both groups will receive ZERO marks.
 If you don’t have any group member, you should finish the whole assignment
individually. Please keep in mind that doing a group assignment individually will not
be considered as an advantage for you.
 There would not be a valid reason if you could not finish projects goal due to lack of
time or doing a group assignment individually.
 If you don’t have a group member because of late registration of any other reason it
would not mean that you would be exception.
 Your group member list should be submitted to your lecturer latest by week 7.
 Make sure that you choose right group members and the tasks are properly divided
among group members.
 If your group member does not effectively engaged in project you would not be able to
change your group or put him/her out. In this case do not complain to your lecturer and
you better focus on finding a solution and make him/her cooperate with group in
development process.
 If any individual member cannot explain the whole assignment code, not only he would
not get the presentation mark but also can lose up to 12% of the development part.
GROUP MEMBERS
Data Structure Group Assignment
Hereby we confirm that we are aware and accept the assignment’s regulation, rules and mark
deduction criteria.
S/N Student Name ID Signature
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Marking Scheme

Data Structure Group Assignment

S/N Student Name ID Assignment Presentation Total / 20


/15 /5

S/N Criteria Marks


Part 1-Documentation
1 Presentation, Preparation, Formatting /5 /5 /5 /5 /5 /5 /5 /5 /5 /5
Part 2-Technical
1 Proper Linked-List class /2 /2 /2 /2 /2 /2 /2 /2 /2 /2
2 Command line /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
3 Load /2 /2 /2 /2 /2 /2 /2 /2 /2 /2
4 Display /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
5 Insert /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
6 Save /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
7 Delete /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
8 Copy /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
9 Cut /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
10 Paste /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
11 Replace /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
12 Exit /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
13 Help /1 /1 /1 /1 /1 /1 /1 /1 /1 /1
TOTAL /20 /20 /20 /20 /20 /20 /20 /20 /20 /20

You might also like