Courses-Level-1G – Department of Computer Science, Faculty of Science, University of Jaffna

CSC101G3: Foundations of Computer Science

Course Code	CSC101G3
Course Title	Foundations of Computer Science
Academic Credits	03 (45 Hours of lectures and tutorials)
Prerequisite/s	None
Objectives:	Provide logical and mathematical foundations of computer science and illustrate the use of formal languages in computer science.
ILOs:	Describe the fundamentals of mathematical and logical aspects Outline the concepts of programming Illustrate the use of formal languages in computer science Explain basic computer network organisation
Contents:	Fundamental organisation of computer hardware and software: Motherboard, I/O Peripherals, Expansion slots and cards, application software, arithmetic-logic unit, registers, central processing unit, memory, storage devices Theoretical foundations of sets: Basic notation, representations and examples, membership and subsets, operations on sets, cartesian products, power sets, cardinality, infinite sets Introduction to relations and functions: Domain and range of a relation, one-to-one, one-to-many, many-to-one, inverse, reflexive, symmetric, transitive relations, into, onto, one-one, Bijective functions. Concepts of flowcharts and algorithms Introduction to propositional and predicate logic: Propositions, quantifiers, predicates, arguments Boolean algebra and logic gates: Combinatorial circuits, Boolean functions, Karnaugh map Number systems and their representations: Representation of integers and floating-point numbers in signed-magnitude and two’s-complements Trees, Graphs and their applications: Graphs, representation of graphs, paths and circuits, planar graph, Binary trees, decision trees, tree traversal, spanning trees Automata, grammars and languages: Finite state machines, languages and grammars, language recognition, Turing machines Introduction to computer networks: Network topologies, transmission media and network devices, ISO OSI stack, IP addressing
Teaching Methods:	Use of chalkboard, Vocabulary drills, Flowcharts, Recitation oral questions, Timelines, Photographs, Tutorial discussions
Evaluation Criteria:	In-course Assessments —————–30% End-of-course Examination ————70%
Recommended Readings:	B. A. Forouzan, Foundations of Computer Science, 3rd Ed., 2014. P. Norton, Introduction to Computers, 7th Ed., Tata McGraw Hill Education, 2011. R. L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics: Foundation for Computer Science, 2nd Ed., Addison-Wesley Professional, 1994.

CSC102G3: Computer Programming I

Course Code	CSC102G3
Course Title	Computer Programming I
Academic Credits	03 (135 hours of Practical and Assignments)
Prerequisite/s	None
Objectives:	Provide fundamentals of programming concepts in Java and introduce the concepts of object-oriented programming
ILOs:	Demonstrate fundamental programming concepts Identify classes, objects, members of a class and relationships among them needed for a specific problem Solve variety of computational problems Write programs using fundamental concepts of object-oriented programming
Contents:	Interaction with a computer: Graphical user interface, command line interface, files and folders, using text editors / IDEs, programming principles Program development in Java: Programming principles, Edit-Compile-Run cycle, basic components of a Java program, syntax and semantics, data types, variables and constants, expressions, built-in classes Introduction to Object-Oriented Programming: Classes and objects, fields and methods, arguments and parameters, constructors, class and instance data values Control Flow: Sequence, selection, repetition, explicit control-flow statements Arrays and Collections: 1D & 2D Arrays, arrays of objects, for-each loop, passing arrays to methods, searching and sorting in arrays Concepts of recursion and backtracking: Recursion concepts, examples using recursion, recursion vs. iteration, recursive backtracking Implementing standard algorithms: String matching, counting coins, Knapsack problem, Huffman coding, activity-selection, scheduling problem Inheritance and Polymorphism: Principles of Inheritance, member accessibility, inheritance over accessibility, principles of polymorphism and polymorphic constructors/methods
Teaching Methods:	Laboratory experiments, Supervised study, Practical records, Tutorial discussions
Evaluation Criteria:	In-course Assessments Assessment on practical records ———————- 10% End-of-First Semester Practical Assessment ——— 30% End-of-Second Semester Practical examination ——— 60%
Recommended Readings:	C. T. Wu, An Introduction to Object-Oriented Programming with Java, 5th Ed., McGraw-Hill Education, 2009. P. Deitel and H. Deitel, Java How to Program, 9th Ed., Pearson Education, Inc., 2012. H. Schildt, Java: The Complete Reference, 9th Ed., McGraw-Hill Osborne Media, 2014.

CSC103G2: Multimedia Technologies

CSC104G2: Design of Algorithms

CSC111GC3: Foundations of Computer Science

Course Code	CSC111GC3
Course Title	Foundations of Computer Science
Academic Credits	03 (45 Hours of lectures and tutorials)
Prerequisite/s	None
Objectives:	Describe the fundamentals of Mathematical and Logical aspects. Outline the concepts of programming. Illustrate the use of formal languages in Computer Science. Explain basic computer network organisation.
Contents:	Fundamental organisation of computer hardware and software: Motherboard, I/O Peripherals, Expansion slots and cards, Application software, Arithmetic-logic unit, Registers, Central processing unit, Memory, Storage devices. Theoretical foundations of sets: Basic notation, representations and examples, membership and subsets, operations on sets, Cartesian products, Power sets, cardinality, infinite sets. Introduction to relations and functions: Domain and range of a relation, one-to-one, one-to-many, many-to-one, inverse, reflexive, symmetric, transitive relations. Into, Onto, One-one, Bijective functions. Concepts of Flowcharts and Algorithms Introduction to Propositional and Predicate Logic: Propositions, quantifiers, predicates, Proofs. Boolean Algebra and Logic Gates: Combinatorial Circuits, Boolean Functions, Karnaugh map and Applications. Number systems and their representations: Representation of integers and floating-point numbers in sign-magnitude and twos-complements. Trees, Graphs and their applications: Graphs, representation of graphs, paths and circuits, planar graph, Binary trees, decision trees, tree traversal, spanning trees. Automata, Grammars and Languages: Finite state machines, Languages and Grammars, Language Recognition, Turing Machines. Introduction to Computer Networks: Network topologies, transmission media and network devices, ISO OSI stack, IP addressing.
Assessment/ Evaluation Details:	In-course Assessments —————–30% End-of-course Examination ————70%
Recommended Readings:	Behrouz A. Forouzan, Foundations of Computer Science, 2013 Peter Norton, Introduction to Computers (7e), Tata McGraw Hill Education Private Limited, 2011. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics: Foundation for Computer Science(2e), Addison-Wesley Professional, 1994

CSC112GC3: Computer Programming I

Course Code	CSC112GC3
Course Title	Computer Programming I
Academic Credits	03 (135 Hours of practical and assignments)
Prerequisite/s	None
Objectives:	Convert scientific problems into computational frameworks Use a high-level programming language for problem solving Recognise the process of writing, testing and debugging a program Express competence and confidence in computational problem solving
Contents:	Familiarise with a personal computer: Graphical user interface, Command line interface, files and folders, using an editor, programming principles. Programming concepts: Sequential, selection (single-selection, double-selection, repetition) and repetition (counter-controlled repetition, sentinel-controlled repetition, and nested-control statements). String manipulation: substring, concatenating strings, equality of strings, finding index of character or a substring, reversing. Declaring and creating arrays, examples using arrays, multidimensional arrays. Develop small programs using methods and functions: Computing the average of a list of numbers, finding the min, max, and mode in a list, approximating the square root of a number, or finding the greatest common divisor. Introduction to data structures: Trees, stack, queue, linked lists, graphs. Searching and Sorting techniques: Linear search, binary search, bubble sort, selection sort, insertion sort, divide-and-conquer technique, merge sort, quick sort Concepts of recursion and backtracking: recursion concepts, examples using recursion: factorial, Fibonacci series, towers of Hanoi, recursion vs. iteration, recursive backtracking. Web development using HTML, CSS and JavaScript: Applets for drawing a string, executing an applet in a web browser, loading and playing audio clips.CSS development Develop small programs using GUI components and graphics: Using dialog boxes, creating simple drawings (rectangles, ovals, and arcs), colors and filled shapes, displaying text and images.
Assessment/ Evaluation Details:	Continuous assessment on practical records———————————30% Two mid-semester examinations (each of two hours duration)————-30% Two end-of-semester examinations (each of three hours duration)———40%
Recommended Readings:	P. Deitel and H. Deitel. Java how to program (9e), Pearson Education, Inc., 2012 Herbert Schildt, Java: The Complete Reference (9e), McGraw-Hill Osborne Media, 2014 http://docs.oracle.com/javase/7/docs/api/

CSC113GC2: Data Structures and Algorithms I

CSC101GC2 : Foundations of Computer Science

CSC102GC2 : Object Oriented Programming

CSC104GC2 : Practical Computing I

CSC105GC2 : Computer Networks and Internet Computing

CSC103GC2 : Computer Networks and Internet Computing

Course Code	CSC103G2
Course Title	Multimedia Technologies
Academic Credits	2 (30 hours of Lectures and Tutorials)
Prerequisite/s	None
Objectives:	Provide in-depth knowledge in technologies to develop multimedia-based contents
ILOs:	Explain the fundamental principles of multimedia Demonstrate compression techniques used in multimedia Discuss theories behind the multimedia components Design contents using multimedia technologies
Contents:	Introduction: Uses of multimedia, interaction technologies, multimedia hardware and devices Compression techniques in multimedia: compression basics, lossless and lossy compression techniques Text in multimedia: Visual representation of text, digital representation of characters Fundamentals of colours, colour models and dithering Fundamentals of images: characteristics of images, image file formats, and image compression standards Digital audio: sound processing, representation of audio files Fundamentals of video and animation: analogue and digital video standards, video processing, video compression standards and file formats, basics of animation Designing multimedia contents: Development phases, multimedia authoring and tools, multimedia in the internet
Teaching Methods:	Lectures, recitation of oral questions, use of chalkboard and multimedia presentations
Evaluation Criteria:	In-course Assessments ——————- 30% End-of-course Examination ————— 70%
Recommended Readings:	Z.N. Li and M.S. Drew, “Fundamentals of Multimedia”, 2nd Ed., 2014. A. Banerji; A. M. Ghosh, “Multimedia technologies”, 2010. T.M. Savage and K.E. Vogel, “An Introduction to Digital Multimedia”, 2nd Ed., 2013.

Course Code	CSC104G2
Course Title	Design of Algorithms
Academic Credits	2 (30 hours of Lectures and Tutorials)
Prerequisite/s	None
Objectives:	Provide in-depth knowledge in different algorithmic approaches for problem solving
ILOs:	Demonstrate familiarity of various algorithm design techniques and their applications Use different strategies to analyse the performance of algorithms Apply different algorithmic approaches and concepts for solving computational problems
Contents:	Algorithm Analysis: Informal comparison of algorithm efficiency, best, expected, and worst case behaviors, time and space trade-offs in algorithms, Asymptotic analysis (big O, little o, big Ω and big Θ notations) Problem-solving strategies: Iterative and recursive algorithms Brute-force and Greedy methods: Concepts of Brute-force and Greedy methods, applications of Brute-force and Greedy methods for solving problems (String matching, counting coins, Knapsack problem, Huffman Coding, Activity-selection, Scheduling problems) Searching and sorting in arrays and their complexities: Linear search, binary search, selection sort, insertion sort, bubble sort
Teaching Methods:	Lectures, class discussions, textbook assignments, laboratory practical
Evaluation Criteria:	In-course Assessments ——————- 30% End-of-course Examination ————— 70%
Recommended Readings:	T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, 3rd Ed., MIT Press, 2009. R. Sedgewick and K. Wayne, Algorithms, 4th Ed., Addison Wesley Publishers, 2011.

Course Code	CSC113GC2
Course Title	Data Structures and Algorithms I
Academic Credits	02 (30 hours of lectures and tutorials)
Prerequisite/s	None
Objectives:	Explain fundamental data structures Choose appropriate data structures for problem solving Recall sorting and searching algorithms Demonstrate different algorithmic approaches for problem solving
Contents:	Introduction to scientific and engineering basis for comparing algorithms: Differences among best, expected, and worst case behaviors of an algorithm. Asymptotic Analysis of Algorithms: Asymptotic analysis of upper and expected complexity bounds, Empirical measurements of performance, Time and space trade-offs in algorithms. Data structures: Array, Stack, Queue, Linked List, Graphs and Trees. Algorithm design strategies: Iterative and recursive algorithms, Brute-force algorithms, Greedy algorithms, Divide-and-conquer, Recursive backtracking. Searching and Sorting algorithms, and their complexities.
Assessment/ Evaluation Details:	In-course Assessments —————–30% End-of-course Examination ————70%
Recommended Readings:	Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein. Introduction to Algorithms, Third Ed., MIT Press, 2009, ISBN: 978-0262033848. Robert Sedgewick and Kevin Wayne, Algorithms, 4th Ed., Addison Wesley Publishers, 2011, ISBN-13: 978-0321573513.

Level – 1G

Discontinued Course units from Academic Year 2016/2017

Discontinued Course units from Academic Year 2013/2014

Discontinued Course unit from Academic Year 2010/2011