Portfolio item number 1
Short description of portfolio item number 1
Posts by Collection
portfolio
Portfolio item number 2
Short description of portfolio item number 2
publications
Containerizing an eTextbook Infrastructure
Published in In the proceedings of Proceedings of the 5th Educational Data Mining in Computer Science Education, 2021, 2021
Recommended citation: Alexander Hicks, "Containerizing an eTextbook Infrastructure." In the proceedings of Proceedings of the 5th Educational Data Mining in Computer Science Education, 2021, 2021.
Integration and Implementation (Int) Cs 5604 F2020
Published in In the proceedings of CS 5604, 2021
Recommended citation: Alexander Hicks, "Integration and Implementation (Int) Cs 5604 F2020." In the proceedings of CS 5604, 2021.
Live Catalog of Smart Learning Objects for Computer Science Education
Published in In the proceedings of Sixth SPLICE Workshop, 2020, 2021
Recommended citation: Alexander Hicks, "Live Catalog of Smart Learning Objects for Computer Science Education." In the proceedings of Sixth SPLICE Workshop, 2020, 2021.
talks
Talk 1 on Relevant Topic in Your Field
Published:
This is a description of your talk, which is a markdown files that can be all markdown-ified like any other post. Yay markdown!
Conference Proceeding talk 3 on Relevant Topic in Your Field
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
teaching
CS 3704: Intermediate Software Engineering
Instructor of Record, Virginia Tech Computer Science, 2023
Explores the principles of software design in detail, with an emphasis on software engineering aspects. Includes exposure of software lifecycle activities including design, coding, testing, debugging, and maintenance, highlighting how design affects these activities. Peer reviews, designing for software reuse, CASE tools, and writing software to specifications are also covered.
CS 4104: Data and Algorithm Analysis
Instructor of Record, Virginia Tech Computer Science, 2024
Data structures and algorithms from an analytical perspective. Theoretical analysis of algorithm efficiency. Comparing algorithms with respect to space and run-time requirements. Analytical methods for describing theoretical and practical bounds on performance. Constraints affecting problem solvability.