INTRODUCTION TO COMPUTER SCIENCE II
- Module code: CS162
- Credits: 7.5
- Semester: 2
- Department: COMPUTER SCIENCE
Theoretical Computer Science; Languages: regular expressions, context-free grammars, recursive definitions; Automata: finite automata (deterministic and non-deterministic), conversion from grammars to automata, transition graphs, push-down automata; problem-solving: understanding and developing algorithms; Implementing algorithms to apply language definitions and to simulate automaton: iteration, nested iteration, arrays, multidimensional arrays, scope of variables, ststic methods, defining classes, creating objects, defining and calling instance methods and constructors, parament passing recursion, simple searching and sorting algorithms.
On successful completion of the module, students should be able to:
|Teaching & Learning methods|
Timetable under review
The Lectures timetable allows you to search by most courses that are offered by the University.
The Venues timetable allows you to search the timetable by venue.
The Departments timetable allows you to search the timetable by department.
The Students timetable is a personalised timetable. The student is required to login using their Student ID and Password.