|
|
Course Title: Discrete Structure
Course No. : M.ICT. Ed Nature of course: Theoretical Level: M.Ed. Credit Hour: 3 hours Semester: First Teaching Hour: 75 hours
1. Course Description
The student will gain knowledge in discrete mathematics and finite state automata in an algorithmic approach. It helps the target student in gaining fundamental and conceptual clarity in the area of Logic, Reasoning, Algorithms, Recurrence Relation, Graph Theory, and Theory of Automata. 2. General Objectives The general objectives of this course are as follows:
Note: The figure in the parenthesis indicate approximate number of
periods allocated for respective units.
3 Instructional Techniques The instructional techniques for this course are divided into two groups. First group consists of general instructional techniques applicable to most of the units. The second group consists of specific instructional techniques applicable to specific units. 4.1 General Techniques
Unit Activity and instructional techniques Teaching Hours (75) Note: Specific Instructional Techniques may or may not require for each of the units mentioned in course outline. 4 Evaluation 4.1 Internal Evaluation 30% Internal evaluation will be conducted by course teacher based on following activities: 1) Attendance 4 points 2) Participation in learning activities 6 points 3) First assignment/midterm exam 10 points 4) Second assignment/assessment (1 or two) 10 points Total 30 points Note: First assignment/assessment might be mid-term exam + assigns or book review or article review or first term paper on specific issue/topic, mid-term exam or unit test and quiz etc according to nature of course. Second assignment/assessment might be project work, case study, seminar, survey/field study and individual/group report writing, term paper based on secondary data or review of literature and documents etc. First and second assignment/assessment may include one or two types of assessment. For instance, one home assignment/book/article review + mid-term exam or only mid-term exam. In the second assessment may include only one project work/term paper or two type of assignment according to nature of the course. 4.2 External Evaluation (Final Examination) 70% Examination Division, office of the Dean, Faculty of Education will conduct final examination at the end of semester (proposed). 1) Objective type question (Multiple choice 11x11) 11 points 2) Short answer questions (5 questions x 7 points) 35 points 3) Long answer questions (2 questions x 12 points) 24 points Total 70 points 5 Recommended books and reading materials (including relevant published articles in national and international journals) 1. Kenth Rosen, Discrete Mathematical Structures with Applications to Computer Science, WCB/ McGraw Hill 2. G. Birkhoff, T.C. Bartee, Modern Applied Algebra, CBS Publishers. 3. R. Johnsonbaugh, Discrete Mathematics, Prentice Hall Inc. 4. G.Chartand, B.R.Oller Mann, Applied and Algorithmic Graph Theory, McGraw Hill. 5. Joe L. Mott, Abrahan Kandel, and Theodore P. Baker, Discrete Mathematics for Computer Scientists and Mathematicians, Prentice-Hall of India. |