Poster summarizing course redesign activities for CS 146: Data Structures and Algorithms.https://scholarworks.sjsu.edu/davinci_itcr2014/1015/thumbnail.jp

Taylor, David

English

SJSU ScholarWorks

 “da Vinci Day” Recognizing Teaching Innovation at SJSU Innovative Teaching – Course Redesign project (ITCR) David Taylor Computer Science Department, College of Science Implementa)ons	  of	  advanced	  tree	  structures,	  priority	  queues,	  heaps,	  directed	  and	  undirected	  graphs.	  Advanced	  searching	  and	  sor)ng	  (radix	  sort,	  heapsort,	  mergesort,	  and	  quicksort).	  Design	  and	  analysis	  of	  data	  structures	  and	  algorithms.	  Divide-­‐and-­‐conquer,	  greedy,	  and	  dynamic	  programming	  algorithm	  design	  techniques.	  	  CS 146:  Data Structures and Algorithms Brief description of the course and its place in the curriculum Summary of course re-design activities The	  course	  has	  tradi)onally	  been	  taught	  with	  standard	  lectures	  during	  class,	  and	  homework	  as	  well	  as	  programming	  assignments	  for	  at-­‐home	  work.	  	  	  I	  plan	  to	  ﬂip	  up	  to	  half	  of	  the	  course	  content,	  recording	  lectures	  for	  students	  to	  watch	  at	  home,	  thus	  allowing	  them	  )me	  to	  complete	  programming	  assignments	  in	  class.	  	  Given	  the	  challenging	  nature	  of	  the	  material	  of	  this	  course,	  this	  new	  format	  should	  provide	  students	  with	  more,	  and	  more	  useful,	  opportuni)es	  to	  delve	  into	  the	  material	  more	  deeply	  and	  to	  seek	  assistance	  as	  needed.	  	  It	  should	  also	  provide	  beFer	  opportuni)es	  to	  the	  instructor	  to	  monitor	  student	  mastery	  of	  course	  materials	  and	  to	  intervene	  eﬀec)vely	  and	  in	  a	  )mely	  manner	  when	  students	  struggle.	  CS	  146	  is	  considered	  to	  be	  one	  of	  our	  department's	  main	  boFleneck	  courses.	  	  	  It	  is	  one	  of	  the	  ﬁrst	  courses	  our	  transfer	  students	  take,	  perhaps	  the	  ﬁrst	  course	  for	  our	  non-­‐transfers	  which	  has	  several	  (4)	  prerequisite	  courses,	  and	  it	  is	  a	  prerequisite	  course	  for	  most	  of	  our	  upper-­‐division	  courses.	  

CS 146: Data Structures and Algorithms Course Redesign

San Jose State University

 “da Vinci Day” Recognizing Teaching Innovation at SJSU 
Innovative Teaching – Course Redesign project (ITCR) 
David Taylor 
Computer Science Department, College of Science 
Implementa)ons	  of	  advanced	  tree	  
structures,	  priority	  queues,	  heaps,	  directed	  
and	  undirected	  graphs.	  Advanced	  
searching	  and	  sor)ng	  (radix	  sort,	  heapsort,	  
mergesort,	  and	  quicksort).	  Design	  and	  
analysis	  of	  data	  structures	  and	  algorithms.	  
Divide-­‐and-­‐conquer,	  greedy,	  and	  dynamic	  
programming	  algorithm	  design	  techniques.	  	  
CS 146:  Data Structures and 
Algorithms 
Brief description of the course 
and its place in the curriculum 
Summary of course re-design 
activities 
The	  course	  has	  tradi)onally	  been	  taught	  
with	  standard	  lectures	  during	  class,	  and	  
homework	  as	  well	  as	  programming	  
assignments	  for	  at-­‐home	  work.	  	  
	  
I	  plan	  to	  ﬂip	  up	  to	  half	  of	  the	  course	  
content,	  recording	  lectures	  for	  students	  to	  
watch	  at	  home,	  thus	  allowing	  them	  
)me	  to	  complete	  programming	  
assignments	  in	  class.	  
	  
Given	  the	  challenging	  nature	  of	  the	  
material	  of	  this	  course,	  this	  new	  format	  
should	  provide	  students	  with	  more,	  and	  
more	  useful,	  opportuni)es	  to	  delve	  into	  
the	  material	  more	  deeply	  and	  to	  seek	  
assistance	  as	  needed.	  	  It	  should	  also	  
provide	  beFer	  opportuni)es	  to	  the	  
instructor	  to	  monitor	  student	  mastery	  of	  
course	  materials	  and	  to	  intervene	  
eﬀec)vely	  and	  in	  a	  )mely	  manner	  when	  
students	  struggle.	  
CS	  146	  is	  considered	  to	  be	  one	  of	  our	  
department's	  main	  boFleneck	  courses.	  	  
	  
It	  is	  one	  of	  the	  ﬁrst	  courses	  our	  transfer	  
students	  take,	  perhaps	  the	  ﬁrst	  course	  for	  
our	  non-­‐transfers	  which	  has	  several	  (4)	  
prerequisite	  courses,	  and	  it	  is	  a	  
prerequisite	  course	  for	  most	  of	  our	  
upper-­‐division	  courses.	  


https://scholarworks.sjsu.edu/cgi/viewcontent.cgi?article=1015&amp;context=davinci_itcr2014

CS 146: Data Structures and Algorithms Course Redesign

Abstract

Similar works

Full text

Available Versions

SJSU ScholarWorks

San Jose State University