It's UWAweek 10 (1st semester, week 2)


This forum is provided to promote discussion amongst students enrolled in CITS2002 Systems Programming.
Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.
Displaying selected article
Showing 1 of 1168 articles.
Currently 2 other people reading this forum.

 UWA week 40 (2nd semester, week 10) ↓
SVG not supported

Login to reply

4:56pm Thu 5th Oct, Christopher M.

> Hi, at first time, I stored the files information by reading different directories. For example there are 2 directories provided by command line, and the I allocate two chunck of memories to store information of files included in the directory. > However, when doing the step "identify exit only or files with same filenames", I found it is difficult to search by filename (especially when have 2+ directories) > So, I was wondering can I store files in a hash table( inspired by lecture 19), which is an array of list, each list have the files with same filenames and same relative location. > And because I am not yet doing recursive (-r) option, so I am not sure, this structure is easy for recursion, becuase in recursion situation (not figure out yet) how to identify the files in same relative location. Thank you.
You may choose any data-structures, or a combination of data-structures, that you wish. I really don't know what "two chunck of memories" means, but there's no need to explain.

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  5:07AM Sep 06 2023
Privacy policy