Cong Pu

Recursive algorithms. Intermediate methods of searching and sorting. Mathematical analysis of space and time complexity, worst case, and average case performance. Course previously offered as CS 3333.Prerequisite(s): CS 1113 with a grade of 'C' or better.

Storage, structures, data and information structures, list processing, trees and tree processing, graphs and graph processing, searching, and sorting. Previously offered as CS 4343 and CS 4344.Prerequisite(s): CS 2133, and CS 3653 or (MATH 3613 and MATH 4663), each with a grade of 'C' or better.

Graduate standing and approval of advisory committee. Independent research under the direction of a member of the graduate faculty. For students working toward a PhD degree.Offered for variable credit, 2-15 credit hours, maximum of 40 credit hours. Prerequisite(s): Graduate standing and approval of advisory committee.

Large scale embedded networks, deep-space networking, ubiquitous computing, optical networking, Next Generation Internet. May be repeated with change of topics.Offered for variable credit, 2-12 credit hours, maximum of 12 credit hours.Prerequisite(s): CS 5283 with a grade of 'C' or better; Graduate standing in Computer Science; consent of instructor.

Graduate standing and approval of advisory committee. Independent research under the direction of a member of the graduate faculty. For students working toward a PhD degree.Offered for variable credit, 2-15 credit hours, maximum of 40 credit hours. Prerequisite(s): Graduate standing and approval of advisory committee.

This course will expand the practical knowledge of cyber attacks and their defense technologies as applied to an industrial setting. The course covers the functions and purposes of the key elements used to analyze, create, secure, and protect an industrial cyber infrastructure from cyber threats and attacks. May not be used for degree credit with CS 5483.Prerequisite(s): CS 3443, CS 4243, and CS 4283, each with a grade of 'C' or better.

This course will expand the practical knowledge of cyber attacks and their defense technologies as applied to an industrial setting. The course covers the functions and purposes of the key elements used to analyze, create, secure, and protect an industrial cyber infrastructure from cyber threats and attacks. May not be used for degree credit with CS 4483.Prerequisite(s): CS 3443, CS 5243, and CS 5383.

Designed to allow students to study advanced topics not provided in existing courses.Offered for variable credit, 1-6 credit hours, maximum of 6 credit hours.Prerequisite(s): Consent of instructor.

Storage, structures, data and information structures, list processing, trees and tree processing, graphs and graph processing, searching, and sorting. Previously offered as CS 4343 and CS 4344.Prerequisite(s): CS 2133, and CS 3653 or (MATH 3613 and MATH 4663), each with a grade of 'C' or better.

Graduate standing and approval of advisory committee. Independent research under the direction of a member of the graduate faculty. For students working toward a PhD degree.Offered for variable credit, 2-15 credit hours, maximum of 40 credit hours. Prerequisite(s): Graduate standing and approval of advisory committee.

Recursive algorithms. Intermediate methods of searching and sorting. Mathematical analysis of space and time complexity, worst case, and average case performance. Course previously offered as CS 3333.Prerequisite(s): CS 1113 with a grade of 'C' or better.

Graduate standing and approval of advisory committee. Independent research under the direction of a member of the graduate faculty. For students working toward a PhD degree.Offered for variable credit, 2-15 credit hours, maximum of 40 credit hours. Prerequisite(s): Graduate standing and approval of advisory committee.

Large scale embedded networks, deep-space networking, ubiquitous computing, optical networking, Next Generation Internet. May be repeated with change of topics.Offered for variable credit, 2-12 credit hours, maximum of 12 credit hours.Prerequisite(s): CS 5283 with a grade of 'C' or better; Graduate standing in Computer Science; consent of instructor.

Designed to allow students to study advanced topics not provided in existing courses.Offered for variable credit, 1-6 credit hours, maximum of 6 credit hours.Prerequisite(s): Consent of instructor.

Roles and responsibilities of the agricultural education teacher; types of program offerings; steps of the teaching-learning process; place of agricultural education in relation to other educational programs in school systems.Offered for variable credit, 1-6 credit hours, maximum of 6 credit hours.Prerequisite(s): Consent of major professor.

Advanced topics and applications of computer science. Typical topics include operating systems, multiprocessor systems, programming systems or various mathematical and statistical packages. Designed to allow students to study topics not provided in existing courses.Offered for variable credit, 1-3 credit hours, maximum of 5 credit hours.Prerequisite(s): Honors Program participation, junior standing.

Designed to allow students to study advanced topics not provided in existing courses.Offered for variable credit, 1-6 credit hours, maximum of 6 credit hours.Prerequisite(s): Consent of instructor.

Large scale embedded networks, deep-space networking, ubiquitous computing, optical networking, Next Generation Internet. May be repeated with change of topics.Offered for variable credit, 2-12 credit hours, maximum of 12 credit hours.Prerequisite(s): CS 5283 with a grade of 'C' or better; Graduate standing in Computer Science; consent of instructor.

Storage, structures, data and information structures, list processing, trees and tree processing, graphs and graph processing, searching, and sorting. Previously offered as CS 4343 and CS 4344.Prerequisite(s): CS 2133 and CS 3653, each with a grade of 'C' or better.

Roles and responsibilities of the agricultural education teacher; types of program offerings; steps of the teaching-learning process; place of agricultural education in relation to other educational programs in school systems.Offered for variable credit, 1-6 credit hours, maximum of 6 credit hours.Prerequisite(s): Consent of major professor.

Designed to allow students to study advanced topics not provided in existing courses.Offered for variable credit, 1-6 credit hours, maximum of 6 credit hours.Prerequisite(s): Consent of instructor.

Recursive algorithms. Intermediate methods of searching and sorting. Mathematical analysis of space and time complexity, worst case, and average case performance. Course previously offered as CS 3333.Prerequisite(s): CS 1113 with a grade of 'C' or better.

Storage, structures, data and information structures, list processing, trees and tree processing, graphs and graph processing, searching, and sorting. Previously offered as CS 4343 and CS 4344.Prerequisite(s): CS 2133 and CS 3653, each with a grade of 'C' or better.

Designed to allow students to study advanced topics not provided in existing courses.Offered for variable credit, 1-6 credit hours, maximum of 6 credit hours.Prerequisite(s): Consent of instructor.

Storage, structures, data and information structures, list processing, trees and tree processing, graphs and graph processing, searching, and sorting. Previously offered as CS 4343 and CS 4344.Prerequisite(s): CS 2133 and CS 3653, each with a grade of 'C' or better.