DEPARTMENT OF COMPUTER SCIENCEARKANSAS STATE
UNIVERSITYJONESBORO,ARKANSAS
Overview of the Computer Science DepartmentFACULTY &
STAFFAdministration
DR. DEBRA INGRAMChair, Department of Mathematics &
Statistics, Department of Computer ScienceAssociate
[email protected]: 870-972-3090Office: Computer
Science & Mathematics, 104AMore Information >>
DR. HUNG-CHI SUAssociate Chair, Department of Computer
ScienceAssociate Professor of Computer [email protected]:
870-680-8119Office: Computer Science & Mathematics, 126More
Information >>
Faculty
JASON L CAUSEYInstructor of Computer
[email protected]: 870-680-8182Office: Computer
Science & Mathematics, 130More Information >>
DR. E. T. HAMMERANDAssociate Professor of Computer
[email protected]: 870-680-8109Office: Computer
Science & Mathematics, 125More Information >>
DR. XIUZHEN HUANGAssociate Professor of Computer
[email protected]: 870-680-8116Office: Computer Science
& Mathematics, 128More Information >>
DR. JEFF JENNESSAssociate Professor of Computer
[email protected]: 870-680-8117Office: Computer Science
& Mathematics, 132More Information >>
DR. HAI JIANGAssociate Professor of Computer
[email protected]: 870-680-8164Office: Computer Science
& Mathematics, 127More Information >>
JAKE QUALLSInstructor of Computer
[email protected]: 870-680-8121Office: Computer
Science & Mathematics, 122More Information >>
GIDGET SCRIVNERInstructor of Computer
[email protected]: 870-680-8134Office: Computer Science
& Mathematics, 129More Information >>
LIST OF COURSES OFFERED IN ASU COMPUTER SCIENCE GRADUATE
PROGRAMACCELERATED PRE-REQUISITE COURSES1. Exam will be conducted
on Friday after international student orientation program.2. Based
on your performance in the exam the pre-requisite courses will be
assigned to each student. Each student will be given a list of
courses in the following format: courses (Required/Not
Required/Recommended)3. Exam covers basic questions on C++
programing (Object Oriented Programing), Data Structures and
Algorithms and Discrete Mathematics , Computer Organization4.
Sample questions:a. Data Structures and Algorithmsi. Sorting
techniques (heap sort**,binary sort*,selection sort, quick sort,
bubble sort)ii. Searching (binary search, linear search, depth
first search, breadth first search)iii. Tree data structure (avl
tree**,binary search tree,m-way tree)iv. Linked lists v. Time
complexity for searching and sorting
b. Discrete mathematics i. Proof by induction, proof by
construction, proof by contradictionii. Basic Math definitionsc.
Computer organization:i. Definitions ( pipeline, cache, buffer,
memory types, instructions set)d. Operating systems:i. Basic
definitions ii. Round robin techniqueiii. Virtual memoryiv.
Multi-threading, memory managementv. Deadlockse. Programming
questionsi. Find the first and second highest of the give numbers
in first using sorting and searching techniquesii. Find the sum and
average of the number given by the user and stop the input on
(-1).5. Duration of exam:a. Max. 3 hours:6. Selection marksa.
Selection criteria is currently unknownb. Suggestionsi. Your
program does not need to be completely accurate.ii. Even it is
logically incorrect it should still be accurate in its syntaxiii.
When you are asked searching/sorting/tree linked lists/ related
questions, write about major roles not coding. The best option is
to describe them algorithmically. iv. Note. This is not JNTU type
of an exam or MCQs (Multiple Choice Questions) even if it is a
formula/single line explanation should be sufficient for that
particular question.v. Your percentile should remain high at all
times irrespective of the questions attempted.vi. Finally all the
best! Be cool, calm and composed. This is just to test your skills
in programming and your problem solving skillsCS 5012 Accelerated
Structured Programming2 CREDIT HOURSFirst course in programming,
emphasis on programming methodology, procedural abstraction, and
top down design. Introduction to string processing, file input and
output, recursion, and simple data structures. Cannot be used for
CS degree credit. Prerequisites: Permission of the Computer Science
faculty.CS 5022 Accelerated OOP and Fundamental Data Structures 2
CREDIT HOURSEmphasis on object-oriented programming techniques.
Introduction to abstract data types. Linked lists, stacks, queues
and binary trees. Searching and sorting techniques. Cannot be used
for CS degree credit. Prerequisites: Permission of the Computer
Science faculty.CS 5032 Algorithms and Advanced Data Structures 2
CREDIT HOURSAnalysis of data structures and associated algorithms.
Examination of advanced tree structures, heaps, hashing techniques,
and graph algorithms. Cannot be used for CS degree credit.
Prerequisites: Permission of the Computer Science faculty.
EXCLUSIVE GRADUATE COURSESCS 5113 Software Engineering
ITechniques of design, implementation, and automated tools, quality
assurance, metrics, and maintenance for large scale software
systems. Projects will provide team programming experience.
Prerequisites: CS 3113.CS 5123 Software Engineering IIContinuation
of Software Engineering I; the survey techniques for dealing with
large scale software systems begun there continues here. Projects
will provide team programming experience. Prerequisites: CS
5113.
CS 5133 CompilersTechniques for the construction of compilers.
BNF and EBNF representations. Lexical, syntactic and semantic
analysis. Top-down and bottom-up parsing. Construction of run-time
systems and symbol table routines. Code generation and
optimization. Automation tools. Prerequisite: CS 3113.CS 5213
Distributed ComputingStudy of client-server systems, distributed
databases, distributed transaction processing, and distributed
applications. Provides overview of recent trends in distributed
object technologies. Applications will be designed and constructed
using object software architectures. Prerequisites: CS 3113 Data
Structures.CS 5223 UNIX Systems ProgrammingSystem-level programming
in UNIX systems. Prerequisites: CS 3113.CS 5313 Computer
NetworksIssues and principles involved in the design of computer
networks using the OSI reference model as a framework.
Prerequisites: CS 3233.CS 5413 Computer Graphics IThe creation,
storage, and manipulation of models of objects and their pictures
via computer. Implementation of graphics routines beginning at the
device driver level and continuing with two and three-dimensional
techniques. Prerequisites: CS 3113.CS 5423 Computer Graphics
IIContinuation of Computer Graphics I. Techniques for generation of
realistic solid models are examined. Topics include hidden surface
removal, shading, shadowing, reflection, refraction, and color
theory. Prerequisites: CS 5413.CS 5433 Artificial
IntelligenceRepresentation of knowledge and introduction to a
functional programming language; search methods and control.
Typical applications of artificial intelligence. Prerequisites: CS
3113.CS 5543 Database SystemsTopics include major database models;
relational algebra; data independence and database normalization;
entity relationship model; security, integrity, recovery and
concurrency issues; physical organization of a database.
Prerequisites: CS 3113.CS 5713 Analysis of AlgorithmsThe analysis
of space and time requirements of algorithms. Worst-case and
average case studies. Greedy algorithms and divide and conquer
algorithms examined. Tractable and intractable algorithms surveyed.
Prerequisites: CS 3113 and MATH 2214.
CS 5723 Automata TheoryStudy formal languages and equivalent
models of computation. Finite state automata and regular
expressions. Push-down automata and context free grammars. Pumping
lemmas and closure properties. Turing Machines. Prerequisites: CS
3113.CS 5823 Scripting LanguagesExamination of scripting languages
compared to conventional programming languages and construction of
domain-specific solutions for common problems in GUI, networking,
and web programming. Prerequisites: CS 3113.CS 583V
InternshipSupervised work experience participating in application
system development in a business/manufacturing environment. Grade
earned will be pass or fail. Prerequisites: Permission of the
Computer Science faculty, CS 3363, and either CS 3113.CS 6213
Parallel ProcessingParallel processing and supercomputer
architecture with emphasis on efficient utilization of resources.
Prerequisites: CS 3223.CS 6313 Data SecurityMethods for protection,
security, and privacy of data; access controls, authentication,
cryptographic controls, information flow controls, security
kernels. Security of data in networks. Prerequisites: CS 3233.CS
6413 Solid ModelingExamination of advanced modeling techniques with
emphasis on radiosity. Techniques for rapid interactive display of
a complex three-dimensional environment will be developed.
Prerequisites: CS 5423 or permission of professor.CS 6423 Robotic
Software ControlStudy of robot manipulators from mathematical and
programmed control perspectives. Topics include kinematic
representation, manipulator positioning, velocity control, and
trajectory calculation. Prerequisites: permission of professor.CS
6433 Natural Language ProcessingData representations used in
programming computers to interpret and to generate natural language
text. Background from linguistics, theoretical computer science and
lexical analysis; structures and algorithms for syntactical
analysis, semantic analysis, and knowledge representation.CS 6513
Data Compression and IndexingCompressing, indexing and querying
large collections of text and image data. Prerequisites: CS 5123 or
CS 5713 or permission of instructor.CS 6713 Advanced Analysis of
AlgorithmsTheoretical space and time requirements for algorithms.
Prerequisites: CS 5713 or permission of professor.CS 6723
Computability TheoryTuring machines and equivalent models of
computation. The universal Turing machine and insolvability
results. Study of computable functions. Problem classification and
hierarchy. Prerequisites: CS 5723 or permission of professor.CS
6813 Seminar in Computer ScienceCurrent topics in Computer
Science.CS 6823 Special TopicsCurrent topics of interest to
graduate computer science students. (May be repeated for credit
with different subtitle.) Prerequisites: varies according to
topic.CS 688V Independent StudyCS 689V Thesis
Difficulty level graduation completion timeDifficulty: moderate
If you have been assigned pre-requisite courses, your time to
graduation is:a. 36 credit hours for graduation (18 credit hours
for 6000 level courses and 9 credit hour courses in core courses)b.
If you take 9 credit hours per semester it would take 21/2 years to
complete graduation (including pre requisite courses).
IF YOU NEED ANY ADDITIONAL INFORMATION ABOUT CS DEPT.FEEL FREE
TO ASK DR.HUNG CHI [email protected]