Tutorial 1: DC CIRCUIT ANALYSIS UEEN1043 Object-Oriented Concept and Programming Techniques 2019 Assignment #1 In this assignment, you must demonstrate problem solving using top-down design and the...

1 answer below »
Copy and Paste Your Assignment Here


Tutorial 1: DC CIRCUIT ANALYSIS UEEN1043 Object-Oriented Concept and Programming Techniques 2019 Assignment #1 In this assignment, you must demonstrate problem solving using top-down design and the use of methods of the built-in objects in Python, namely list and dict, to automatically schedule the timetables for one batch of students from 3E, EC, and ET programmes at UTAR. The outcomes of your solution are 14 timetables for each programme; i.e. a total of 42 CSV files with each file describing a timetable for one week for a programme. The output files should be named as [programme name]_[W#n].csv where programme name is either 3E, EC, ET while n is the number between 1 to 14 representing different weeks of the trimester; e.g. 3E_W#3.csv is the timetable of week #3 for 3E programme. The format of the CSV file is described in timetable_example.csv. Each slot in the CSV file, except the header and row index, is either empty or filled with the name of the course along with the classroom number being scheduled. The input files are the course structure for three different programmes; i.e. course.3e, course.ec, course.et. The input files include the number of students for the particular course structure, unit code and name of the courses, and the number of hours for lectures and practicals; e.g. 14x3L means that the unit takes 14 weeks to deliver with 3 hours each week; e.g. 2x3P means that the unit includes 2 weeks of practicals with each practical taking 3 hours. Please note that some of the courses do not have practicals. So, each row can have either 3 or 4 columns in the order of unit code, unit name, lecture hours, and practical hours (optional). Restrictions in the timetable scheduling with which you must comply in your solution: 1. Every 3-hour lecture in the course structure should be split into two sessions with one is 2-hour while the other one is 1-hour. 2. Every 2-hour lecture in the course structure should be a 2-hour session. 3. Two lecture sessions of the same course cannot be scheduled on the same day. 4. All lab sessions are scheduled 3 hours continuously. 5. Only one lab session can be scheduled in one day. A lab session can be scheduled on the same day with a lecture session of the same course. 6. If the course requires two lab sessions throughout the trimester, the lab must be scheduled on week 3 and 7 or week 4 and 8 (for alternate week). 7. If the course requires three lab sessions throughout the trimester, the lab must be scheduled on week 3, 7 and 11 or week 4, 8 and 12 (for alternate week). 8. All the scheduling must not exceed the maximum pax allowed by the venues. Time clashing is not allowed unless the students involved are totally not the same. 9. There are only three classrooms available for lectures; i.e. a) KB201 (90 pax), b) KB301 (60 pax), c) KB401 (30 pax). 10. There are only three laboratories available for practicals; i.e. a) KB601 (30 pax, for UEEA3423 only) b) KB610 (30 pax, for UEEA2663 only) c) KB605 (30pax, for UEEA2283, UEET3573, UEEN3433 only) UNIVERSITI TUNKU ABDUL RAHMAN page 1 UEEN1043 Object-Oriented Concept and Programming Techniques 2019 11. There are five schedulable days a week and a lecture/lab session can not be scheduled before 9am and must end by 4pm. All lecture or lab sessions start at hour mark, including Friday, to simplify your programming. Marking scheme: (Total 20 marks) 1. Demonstrate problem solving using top-down design. (2 marks) 2. Demonstrate modular programming technique. (2 marks) 3. Demonstrate correct use of file opening and processing techniques. (2 marks) 4. Demonstrate effective use of list and dict. (3 marks) 5. Solution can run to completion without error messages. (2 marks, given that the solution is not a dummy execution) 6. Output filenames and the contents conform with the naming format and the value format respectively. (2 marks) 7. Solution produces a viable timetable scheduling for all three programmes; e.g. no time clashing while fulfilling all the aforementioned scheduling criteria. (4 marks) 8. If your solution can guarantee that there is an one-hour gap between every two sessions (they can be either lecture or lab in any orders). (2 marks) 9. With clear and sufficient comments in the program to explain your design. (1 mark) Note that the given inputs do not follow the actually UTAR current structures accurately. You are not allowed to change the format of any inputs for your convenience as the marking will feed different contents using the same input format to your solution. Also, you should not assume any other inputs from the keyboard or files unless otherwise specified later. Submission  The deadline is 6pm on 29th March 2019 (Friday)  NO LATE submission is accepted.  One submission for one group is sufficient.  Do NOT submit input files.  Only submit your solution in Python by emailing them to [email protected] with email subject equal to ◦ UEEN1043 2019 A1 G[group number] ◦ e.g. UEEN1043 2019 A1 G[13] for group #13.  Your Python file should follow the naming format below: ◦ G[group number]_A1.py ◦ e.g. G[13]_A1.py for group #13.  Failure to conform to the naming format above will result in 10% deduction of your total mark. UNIVERSITI TUNKU ABDUL RAHMAN page 2 mailto:[email protected] https://en.wiktionary.org/wiki/schedulable
Answered Same DayMar 26, 2021UEEN1043

Answer To: Tutorial 1: DC CIRCUIT ANALYSIS UEEN1043 Object-Oriented Concept and Programming Techniques 2019...

Pritam answered on Mar 28 2021
137 Votes
import csv
programmes = ['3E', 'EC', 'ET']
slots = [ '09:00-10:00', '10:00-11:00', '11:00-12:00', '12:00-13:00', '13:00-14:00', '14:00-15:00', '15:00-16:00' ]
rooms = {}
courses = {}
timetable = {}
progCourses = {}
rooms['KB201'] = [ 90, [], [] ]
rooms['KB301'] = [ 60, [], [] ]
rooms['KB401'] = [ 30, [], [] ]
rooms['KB601'] = [ 30
, [], [] ]
rooms['KB610'] = [ 30, [], [] ]
rooms['KB605'] = [ 30, [], [] ]
# read input files for each programme, and fill in the dictionary of courses accordingly
for program in programmes:
progCourses[program] = []
filename = 'course.' + program.lower()
with open(filename, 'r') as readFile:
lines = csv.reader(readFile, delimiter=',')
#readFile.readline()
line_count = 0
for line in lines:

if line_count == 0:
print('Reading input file for ' + line[0] + ' programme, which has ' + line[1] + ' ...')
noOfStudents = int(line[1].split()[0])

else:
courseCode = line[0]
progCourses[program].append(courseCode)
if courseCode in courses:
courses[courseCode][1] += noOfStudents
courses[courseCode][2].append(program)
else:
courseName = line[1]
temp = line[2].split('x')
lecWeeks = int(temp[0])
lecHours = int(temp[1][:-1])
courses[courseCode] = [ courseName, noOfStudents, [program], '', '', lecWeeks, lecHours, 0, 0, [] ]
if len(line) == 4:
temp = line[3].split('x')
labWeeks = int(temp[0])
labHours = int(temp[1][:-1])
courses[courseCode][7] = labWeeks
courses[courseCode][8] = labHours

line_count += 1

readFile.close()

# allocation of rooms for both lectures and lab sessions
for courseCode in courses:

if courses[courseCode][1] > 60:
courses[courseCode][3] = 'KB201'
rooms['KB201'][1].append(courseCode)
elif courses[courseCode][1] > 30:
courses[courseCode][3] = 'KB301'
rooms['KB301'][1].append(courseCode)
else:
courses[courseCode][3] = 'KB401'
rooms['KB401'][1].append(courseCode)

if courseCode == 'UEEA3423' and courses[courseCode][7] != 0:
courses[courseCode][4] = 'KB601'
rooms['KB601'][1].append(courseCode)
elif courseCode == 'UEEA2663' and courses[courseCode][7] != 0:
courses[courseCode][4] = 'KB610'
rooms['KB610'][1].append(courseCode)
elif courses[courseCode][7] != 0:
courses[courseCode][4] = 'KB605'
rooms['KB605'][1].append(courseCode)
# generation of timetables and CSV files for each programme
for program in programmes:
# generation of timetables
timetable[program] = [ [ [ '' for i in range(7) ] for j in range(5) ] for k in range(15) ]

maxHour = [0 for i in range(5)]

progCourses[program].sort(key = lambda x : (len(courses[x][2]), courses[x][6], x), reverse = True)
#print(progCourses[program])

for courseCode in progCourses[program]:
#print(courseCode)

...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here