8:22 PM
Classroom Pedagogy
Network Security
Artificial Intelligence in Education
Discrete Mathematics
Teaching Mathematics
Showing posts with label 7th sem. Show all posts
Showing posts with label 7th sem. Show all posts
8:28 AM
Bikal Shrestha
7th sem
Unit I: Math and Math Education (3)
1.1 Mathematics
and mathematics education
1.2 Nature of
mathematics and mathematics education
1.3 Difference
between mathematics and mathematics education
Unit II: Different Learning Theories (5)
2.1 Cognitive
theories of learning mathematics:
• Piaget’s
learning theory
• Bruner’s
learning theory
• Gagne’s
learning theory
2.2 Implications of
different learning theories.
Unit III: Formulation of Instructional Objectives (8)
3.1.Introduction to goals and objectives
3.2Instructional objectives and their classification based on Bloom`s taxonomy
3.3Writing instructional objectives
Unit IV: Instructional Planning (8 )
4.1 Introduction
4.2Types of planning
4.3 Importance of planning
4.4 Preparing
different types of plans
• Annual
Plan
• Unit Plan
• Lesson
Plan
Unit V: Instructional Strategies (10)
5.1Problems of instruction in mathematics
• Understanding,
• Assimilation,
• Permanence
• Tansfer
5.2 Different teaching methods used under different
instructional strategies in mathematics classroom
• Lecture
• Laboratory
• Inductive
• Deductive
• Analytic
• Deductive
• Problem
solving
• Guided
discovery
• Project
method
Unit VI: Evaluation (6)
6.1Traditional vs alternative assessment
• Formative
assessment
• Challenges
of formative assessment
• Suggestions
for improvement of formative assessment.
• Summative
assessment and its use
6.2 Measurement and evaluation
• Meaning
• Types
• Comparison
6.3Different types of tests
• Achievement
test
• Diagnostic
test
Unit VII: Teaching Selected topics of different branches of
mathematics (8)
• Arithmetic
• Algebra
• Geometry
- 8:28 AM
- Bikal Shrestha
- 7th sem
Unit- I Relations and Digraph (9 hrs)
1.1 Product
set and partitions
1.2 Binary
relations and its types
1.3 Different
methods representing
relations.
• Relation
as an order pairs
• Relations
as matrix
• Relations
as directed graphs
• Relations
as an arrow diagram
•
Relations as graph
1.4 Properties of relations:
• Reflexive,
•
Symmetric
•
Asymmetric
• Transitive
•
Equivalence relation
• Partial
order relations
1.5 Boolean
matrix representation of
Relations
• Boolean
matrix operation
• Boolean
products
1.6 Composition
of two relations
1.7 Operation
on relations
1.8 Transitive
closure and Warshall’s
algorithm
Unit II Counting and Combinatories ( 7 hrs)
2.1.Introduction
2.2 Basic principles of counting
• Sum rule
principle
• Product
rule principle
2.3 Permutation of n- different objects
2.4
Combination
2.5 The pigeonhole principle
2.6 The extended pigeonhole principle
Unit III The Fundamental Algorithms, and Matrices (9 hrs)
3.1
Algorithms
3.2 Complexity
of algorithm
• Time
complexity
• Understanding
the Complexity of algorithm.
3.3 Searching
algorithm:
• Linear
search
• Binary
search
3.4 Sorting
• Bubble
sort
• Insertion
sort
3.5 Matrices
• Matrix
arithmetic
• Transpose
of matrix
• Power of
matrices
Unit- IV Recursion on Sequence and Series (8 hrs)
4.1 Introduction
4.2 Sequence and summations
• Arithmetic
progression
• Geometric
progression
• Harmonic
progression
• Relations
and properties
• Recurrence
relations
• Use of
series on summation notation
4.3 Solutions for
recursive relations
4.4 Recursive algorithm, recursion and iteration, the merge
sort.
4.5 Recursively
defined functions
Unit : V Special Types of Functions (6 hrs)
5.1 Floor and ceiling function
5.2 Characteristics functions
5.3 Integer value functions
5.4 Remainder function: modular arithmetic
5.5 Factorial function
Unit- VI Geometric
Transformation ( 9 hrs)
6.1 Geometric properties of plane linear
transformation
6.2 Isometric
transformation
• Reflection
• Translation
• Half turn
• Rotation
• Glide
Reflection
6.3 Non isometric transformation
• Dilation
• Stretch
• Shear
6.4 Matrix representation of isometric and
non- isometric transformations
- 8:27 AM
- Bikal Shrestha
- 7th sem
Unit I: Introduction to AI (10)
1.1 Introduction
to Artificial Intelligence
1.2 Brief
history of AI,
1.3 Applications
of Artificial Intelligence,
1.4 Definition
and importance of Knowledge,
1.5 Learning
Agent and it’s performance measure
1.6 Problems
Definition, Real life problems and well-defined problem
Unit II: Search Techniques (20)
1.1 Uninformed
search techniques: depth first search, breadth first search, depth limit
search, Iterative deepening search,
1.2 Heuristics
search techniques: Greedy Best first search, A* search, Hill Climbing, Game
playing, Adversarial search techniques-mini-max procedure, alpha beta pruning
Unit III: Knowledge, Reasoning and Planning (20)
3.1 Formal
logic-connectives: truth tables, syntax, semantics, tautology, validity,
well-formed-formula,
3.1 Propositional
Logic, Inference with PL: Resolution, Backward Chaining and Forward Chaining,
3.1 First
Order Predicate Logic(FOPL), quantification,
inference with FOPL: By converting into PL (Existential and universal
instantiation), Directly with FOPL (unification and lifting, resolution
Backward chaining, Forward Chaining),
3.1 Rule based
deduction system,
3.1 Statistical
Reasoning-Probability and Bayes' theorem and causal networks, reasoning in
belief network
Unit IV: Structured Knowledge Representation (10)
4.1 Representations
and Mappings,
4.2 Approaches
to Knowledge Representation, Issues in Knowledge Representation,
4.3 Semantic
nets, frames,
4.4 conceptual
dependencies and scripts
Unit V: Application of AI system in education (20)
5.1 Expert
Systems (Architecture, Expert system development process),
5.2 Application
of Expert system in education
5.3 Neural
Network (Mathematical model, get realization, Network structure)
5.4 Application
of Neural Network in education
5.5 Natural
Language Processing (Steps of NLP, parsing)
5.6 Application
of NLP in education
5.7 Basic
Concepts of Machine Learning and Visioning
5.8 Application
of Machine Learning in education
- 8:25 AM
- Bikal Shrestha
- 7th sem
1. Introduction
1.1 Computer
Security Concept
1.2 The OSI
Security Architecture
1.3 Security
Attacks
1.4 Security
Services
1.5 Security
Mechanism
1.6 A Model
for Network Security
1.7 Classical
cryptography
2. Symmetric
Encryption and message Confidentiality
2.1 Symmetric
Encryption Principles
2.2 Symmetric
Block Encryption Algorithms
2.3 Cipher
Block Modes of Operations
3. Public-Key
Cryptography and Message Digest
3.1 Secure
Hash functions
3.2 Message
Digest(MD)
3.3 Public-Key
Cryptography Principles
3.4 Public-Key
Cryptography Algorithms
3.5 Digital
Signatures
4. Network
Security Applications
4.1 Public-Key
Infrastructure
4.2 Transport
Layer Security: SSL, HTTPs, Secure Shell(SSH)
4.3 Wireless
Security: WEP, WAP, WPA2
4.4 E-Mail
Security: PGP, S/MIME
4.5 IP
Security
5. System
Security
5.1 Intruders
5.2 Malicious
Software
5.3 Firewall
6. Network
management Security
6.1 Basic
Concept of SNMP
6.2 SNMPv1
6.3 SNMPv3
- 8:23 AM
- Bikal Shrestha
- 7th sem
Unit 1:
Introduction to Pedagogy (5)
1.1
Meaning
of pedagogy
1.2
Behaviorist,
cognitivist, constructivist theories of learning
1.3
Teacher
centered and student centered
1.4
Inclusive
methods
Unit 2: Teacher, Learners and Classroom (7)
2.1 Teacher
2.1.1 Qualities of a
good teacher
2.1.2 Teacher in
interactive classroom
2.2 Learners
2.2.1 Learning style
2.2.2 Diversity
2.3 Classroom
ecology
2.3.1 Concept:
physical and non-physical aspects
2.3.2 Seating
arrangement
2.3.3 Classroom
display
2.3.4 Class
organization: Subject, Grade, Multi-grade multi-level (MGML)
Unit 3: Instructional planning (4)
3.1 Need for plan
and lesson structuring: preparatory, delivery and consolidation
3.2 Types of
plans – Annual, unit and daily
3.3 Individualized
education plan
Unit 4: Teacher Centered Methods (5 )
4.1 Direct
instruction
4.2 Concept teaching
4.3 Presenting and
explaining
4.4 Preparation
of sample lesson plan
Unit 5: Student Centered methods (20)
5.1 Learner
engaged learning category
5.1.1 Concept
5.1.2 Strategies:
Brainstorming, Think Pair Share, Directed Reading Activity, Prediction from
Terms, Direct Listening Thinking Activity, Text Coding, Know Want to Learn Know
– KWL, What? So what? Now what?, Verbalized Learning, Learning Stations
5.2 Cooperative
learning category
5.2.1 Concept
5.2.2 Strategies:
Paired Reading Paired Summarizing, Reciprocal Teaching, Read Summarize
Question, Jigsaw, One Stay Others Stray, Mix Freeze Pair, Pens in the Middle,
Pyramid Learning, Paragraph Expert, Student Teams-Achievement Division (STAD)
5.3 Problem-based
Learning category
5.3.1 Concept
5.3.2 Strategies:
Identify Define Explore Act Look (IDEAL), Defining Understanding Planning
Evaluating (DUPE), I-Search, Socratic Questioning
Unit 6: Review and Reflection (7)
6.1 Concept
6.2 Strategies:
Question Answer pair, Classify Categorize Organize, Relay, Guess Who?, Two
Truths and A Lie, Snowballing, Question ball and Run to the Board
6.3 Reflective
approaches
Subscribe to:
Posts (Atom)