Skip to main content

Survey Results



Course Survey Results


Nodar   Sitchinava   ICS643, Spring 2022

Campus: University of Hawaii at Manoa Course: ICS 643 - Advanced Parallel Algorithms
Department:   Information& Computer Sciences Crn (Section):   89277 (001)    


1.   The instructor treated students with respect.

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
5.0 3 0.0   0(0%) 0(0%) 0(0%) 0(0%) 3(100%)
2.   The instructor demonstrated knowledge of the course content.

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
5.0 3 0.0   0(0%) 0(0%) 0(0%) 0(0%) 3(100%)
3.   This course challenged me intellectually.

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
5.0 3 0.0   0(0%) 0(0%) 0(0%) 0(0%) 3(100%)
4.   The instructor both sets high standards and helps students achieve them.

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
5.0 3 0.0   0(0%) 0(0%) 0(0%) 0(0%) 3(100%)
5.   The instructor was available for consultation.

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
5.0 3 0.0   0(0%) 0(0%) 0(0%) 0(0%) 3(100%)
6.   Considering everything, how would you rate this COURSE?

Mean N-Size Std Dev   Very Poor (1)  Poor (2)  Average (3)  Good (4)  Excellent (5) 
5.0 3 0.0   0(0%) 0(0%) 0(0%) 0(0%) 3(100%)
7.   What was the format of this class? online synchronous (class scheduled for particular days and times) online asynchronous (class conducted online - no scheduled class meeting)

Mean N-Size Std Dev   Online Synchronous ()  Online Asynchronous ()  In Person ()  Hybrid: In Person and Online Synchronous ()  Hybrid: In Person and Online Asynchronous ()  Hybrid: Online Synchronous and Asynchronous ()  Other () 
0.0 3 0.0   3(100%) 0(0%) 0(0%) 0(0%) 0(0%) 0(0%) 0(0%)

8.   If you answered 'Other' for the question above, please specify.

9.   The course is highly recommended if it were taught by this instructor

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
5.0 3 0.0   0(0%) 0(0%) 0(0%) 0(0%) 3(100%)
10.   The teaching-learning strategies used in the course encouraged active class participation

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
5.0 3 0.0   0(0%) 0(0%) 0(0%) 0(0%) 3(100%)
11.   The instructor was consistently well-prepared and organized for class

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
5.0 3 0.0   0(0%) 0(0%) 0(0%) 0(0%) 3(100%)
12.   The instructor seems to enjoy teaching

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
4.67 3 0.58   0(0%) 0(0%) 0(0%) 1(33%) 2(67%)
13.   The instructor was enthusiastic about the course material

Mean N-Size Std Dev   Strongly Disagree (1)  Disagree (2)  Neutral (3)  Agree (4)  Strongly Agree (5) 
4.67 3 0.58   0(0%) 0(0%) 0(0%) 1(33%) 2(67%)

14.   What changes would you make in the lectures?
/
N/A
I would move to at least having and sharing prepared slides for each class rather than hand written notes. The hand written notes are easier to follow in class, but if you need to come back to a topic after the class, slides are more helpful. (particularly definition and theorem slides, I occasionally forgot if we had proved a theorem in class or not)


15.   Which aspects of the course were most valuable?
Intuition in parallel algorithms theory, core applications and real-world application, fundamentals (complexity, proofs)
Working on hw that build on top of the lectures was very helpful because it enhanced my understanding on the materials.
The in class theorems/proofs and the out of class homework where the most valuable.


16.   Which aspects of the course were least valuable?
It is hard to find a least valuable part, possibly the time spent on writing the algorithms them selves during class.


17.   What advice would you give to students, who might be taking this course in the future?
Revisit your undergrad algorithms and math courses (calculus, discrete structures, graph theory) Expect a lot of theory and deep thinking
The professor is always ready to help you, so take advantage of the office hour.
This is a math class disguised as a CS class. If you have taken some mathematical proofs classes (such as any analysis class) you will do fine. If not, results may vary.


18.   Other comments:
One of the best and most challenging graduate courses you can take at UH
Over all quite a fun class. I would have preferred if we worked in the fork join model and/or had a simulator for the algorithms, but this was fun too.