UNT | University of North Texas

Main menu

Farhad Shahrokhi

Title
Professor
Department
Computer Science and Engineering
College
College of Engineering

Education

PhD, Western Michigan University, 1988.
Major: Mathematics - graph algorithms/The Maximum Concurrent Flow Problem
MS, Western Michigan University, 1983.
Major: Computer Science
MS, Western Michigan University, 1981.
Major: Operations Research
BS, Aryamehr University of Technology, 1976.
Major: Electrical Engineering

Current Scheduled Teaching*

CSCE 3110.002, Data Structures and Algorithms, Spring 1 2019
CSCE 3110.024, Data Structures and Algorithms, Spring 1 2019
CSCE 5170.001, Graph Theory, Spring 1 2019
CSCE 3110.001, Data Structures and Algorithms, Fall 1 2018 Syllabus
CSCE 4890.704, Directed Study, Fall 1 2018
CSCE 5934.704, Directed Study, Fall 1 2018

* Texas Education Code 51.974 (HB 2504) requires each institution of higher education to make available to the public, a syllabus for undergraduate lecture courses offered for credit by the institution.

Previous Scheduled Teaching*

CSCE 4110.001, Algorithms, Spring 2018 Syllabus SPOT
CSCE 5170.001, Graph Theory, Spring 2018
CSCE 4110.001, Algorithms, Fall 2017 Syllabus SPOT
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2017
CSCE 4110.001, Algorithms, Spring 2017 Syllabus SPOT
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2017
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2016
CSCE 5150.002, Analysis of Computer Algorithms, Fall 2016
CSCE 5170.001, Graph Theory, Summer 10W 2016
CSCE 4110.001, Algorithms, Spring 2016 Syllabus SPOT
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2016 Syllabus
CSCE 4110.001, Algorithms, Fall 2015 Syllabus SPOT
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2015
CSCE 5170.001, Graph Theory, Summer 10W 2015
CSCE 4110.001, Algorithms, Spring 2015 Syllabus
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2015
CSCE 4110.001, Algorithms, Fall 2014 Syllabus
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2014
CSCE 5150.021, Analysis of Computer Algorithms, Summer 10W 2014
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2014
CSCE 3110.001, Data Structures and Algorithms, Spring 2014 Syllabus
CSCE 4110.001, Algorithms, Fall 2013 Syllabus
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2013
CSCE 5150.021, Analysis of Computer Algorithms, Summer 10W 2013
CSCE 4890.704, Directed Study, Summer 10W 2013
CSCE 4110.001, Algorithms, Spring 2013 Syllabus
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2013
CSCE 6933.003, Advanced Topics in Computer Science and Engineering, Fall 2012
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2012
CSCE 4110.001, Algorithms, Spring 2012 Syllabus
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2012
CSCE 6940.704, Individual Research, Spring 2012
CSCE 4110.001, Algorithms, Fall 2011 Syllabus
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2011
CSCE 5934.704, Directed Study, Fall 2011
CSCE 6940.704, Individual Research, Fall 2011
CSCE 6933.004, Advanced Topics in Computer Science and Engineering, Spring 2011
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2011
CSCE 6900.704, Special Problems, Spring 2011
CSCE 4110.002, Algorithms, Fall 2010 Syllabus
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2010
CSCE 6900.704, Special Problems, Fall 2010
CSCE 4110.002, Algorithms, Spring 2010
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2010
CSCE 3110.002, Data Structures and Algorithms, Spring 2010
CSCE 6900.704, Special Problems, Spring 2010
CSCE 4110.002, Algorithms, Fall 2009
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2009
CSCE 5950.704, Master's Thesis, Fall 2009
CSCE 4110.021, Algorithms, Summer 10W 2009
CSCE 4110.002, Algorithms, Spring 2009
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2009
CSCE 5950.704, Master's Thesis, Spring 2009
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2008
CSCE 3110.002, Data Structures and Algorithms, Fall 2008
CSCE 5950.704, Master's Thesis, Fall 2008
CSCE 5150.001, Analysis of Computer Algorithms, Spring 2008
CSCE 4890.704, Directed Study, Spring 2008
CSCE 5170.001, Graph Theory, Spring 2008
CSCE 5950.704, Master's Thesis, Spring 2008
CSCE 4110.001, Algorithms, Fall 2007
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2007
CSCE 3110.002, Data Structures and Algorithms, Fall 2007
CSCE 5950.704, Master's Thesis, Fall 2007
CSCE 4110.002, Algorithms, Spring 2007
CSCE 5150.002, Analysis of Computer Algorithms, Spring 2007
CSCE 4890.704, Directed Study, Spring 2007
CSCE 6900.704, Special Problems, Spring 2007
CSCE 4110.001, Algorithms, Fall 2006
CSCE 3110.001, Data Structures and Algorithms, Fall 2006
CSCE 3110.021, Data Structures and Algorithms, Summer 10W 2006
CSCE 4890.704, Directed Study, Summer 10W 2006
CSCE 5150.002, Analysis of Computer Algorithms, Spring 2006
CSCE 5170.001, Graph Theory, Spring 2006
CSCE 4940.704, Special Computer Application Problem, Spring 2006
CSCE 5150.001, Analysis of Computer Algorithms, Fall 2005
CSCE 3110.005, Data Structures and Algorithms, Fall 2005
CSCI 4450.021, Algorithm Analysis and Complexity Theory, Summer 10W 2005
CSCI 3400.002, Data Structures, Spring 2005
CSCI 5370.002, Graph Theory for Computer Scientists, Spring 2005
CSCI 6330.002, Advanced Topics in Computer Science, Fall 2004
CSCI 3400.003, Data Structures, Fall 2004

* Texas Education Code 51.974 (HB 2504) requires each institution of higher education to make available to the public, a syllabus for undergraduate lecture courses offered for credit by the institution.

,
Overall
Summative Rating
1
Challenge and
Engagement Index
2
Response Rate
0
out of 5
0
out of 7
%
of
students responded
A Challenge and Engagement Index of "n/a" means
there were not enough student responses to calculate a score.
  • 1 Overall Summative Rating (median):
    This rating represents the combined responses of students to the four global summative items and is presented to provide an overall index of the class’s quality. Overall summative statements include the following (response options include a Likert scale ranging from 5 = Excellent, 3 = Good, and 1= Very poor):
    • The course as a whole was
    • The course content was
    • The instructor’s contribution to the course was
    • The instructor’s effectiveness in teaching the subject matter was
  • 2 Challenge and Engagement Index:
    This rating combines student responses to several SPOT items relating to how academically challenging students found the course to be and how engaged they were. Challenge and Engagement Index items include the following (response options include a Likert scale ranging from 7 = Much higher, 4 = Average, and 1 = Much lower):
    • Do you expect your grade in this course to be
    • The intellectual challenge presented was
    • The amount of effort you put into this course was
    • The amount of effort to succeed in this course was
    • Your involvement in course (doing assignments, attending classes, etc.) was
CLOSE