APPENDIX I IDENTIFICATION OF THE COURSE FOR...
Transcript of APPENDIX I IDENTIFICATION OF THE COURSE FOR...
217
APPENDIX I
IDENTIFICATION OF THE COURSE FOR MASTER OF
COMPUTER APPLICATIONS FOR DEVELOPING WEB
BASED LEARNING MATERIALS (WBLMs)
(Data collected is for research purpose and will be kept confidential)
PART - A
Personal Profile
1. Name :
Sex :
Age :
Name & Address of the
Institution where Employed :
2. Highest Academic Qualification :
Tick in the appropriate box & write your Area of Specialisation against each.
Area of Specialisation
Ph.D.
M.Phil
M.E
M.C.A
Any other (please specify)
218
3. Teaching experience
Type of Institution No. of years
Engineering college
Arts & Science College
Any other (please
specify)
Total
PART - B
Some courses in the curriculum of Master of Computer Applications
are listed below. State whether the students are required to learn the concepts
in these courses for further learning.
Course Name of the Courses Response
Yes No
A Design and Analysis of Algorithms
B Data Structures
C System Software
D Database Management System
E Computer Graphics
From among the list of courses above indicate the suitability to deliver
on a Web Based Learning Environment. Assign the rank of 1 to the one
which is more suitable and rank 5 for least suitable course to be delivered
on Web.
219
Courses Rank Order A
B
C
DE
(Note for the data collector: Part-C of the Questionnaire has to be administered after
collecting the response for part A & Part B from the respondents)
RANK ORDER
A. Design and Analysis of Algorithms
S.No. Basic Concepts / Principles Rank Order
1.
Brute Force (Selection sort, Bubble sort, Sequential search & String matching, Closest-pair & Convex-Hull Problem, Exhaustive search)
2.Divide and Conquer (Merge sort, Quick sort, Binary search)
3.
Dynamic Programming (Binomial coefficient, Warshall’s & Floyd’s algorithm, Optimal binary search tree, Knapsack problem)
4.Greedy Technique (Prim’s Algorithm, Kruskal’s Algorithm, Huff trees)
5.Backtracking (N-Queens problem, Hamiltonian circuit problem, Sub-set sum problem)
6.Branch and Bound (Assignment problem, Knapsack problem, Travelling salesman problem)
High
Low
Difficulty Level
220
B. Data Structures
S.No. Basic Concepts / Principles Rank Order
1. Stack and Queue (Representation, List)
2.Binary Tree (Operations, Node representation, Implicit array representation, Huffman algorithm)
3.Sorting and Searching ( Exchange sorts, Insertion sorts, Merge & Radix sort, tree searching, Hashing)
4.Graph (Representation, Transitive closure, Warshall’s algorithm, Shortest path algorithm)
5.Flow problem, Dijkstra’s algorithm, Graph traversals
6.Storage Management (Linked list representation)
C. System Software
S.No. Basic Concepts / Principles Rank Order
1. Machine Structure
2.Assembler (Machine dependent and machine independent assembler features)
3.Loader (Machine dependent and machine independent assembler features)
4.Linker (Design, implementation and MS-Dos linker)
5.Macroprocessor (Design options, implementation)
6.Compliers (Design phases, system software tools, text editor, interactive debugging system)
Hig
h
Low
Difficulty Level
High
Low
Difficulty Level
221
D. Database Management System (DBMS)
S.No. Basic Concepts / Principles RankOrder
1. Embedded SQL 2. Concurrent Execution
3.
Concurrency Control (Lock-Based Protocol, Granting of locks, Two phase locking protocol, implementation of locking, Graph based protocols)
4. Query by example
5.Relational Database Design (1NF, 2NF, 3NF, 4NF, Boyce-codd Normal form)
6.Evaluation of Expression (Materialization, Pipelining)
E. Computer Graphics
S.No. Basic Concepts / Principles RankOrder
1. Bresenham’s Algorithms ( Line, Circle, Ellipse)
2. Cohen Sutherland Clipping Algorithm 3. Line and Text Clipping Algorithms
4. 2 Dimensional ( Translation, Scaling and Rotation Algorithms)
5. 3 Dimensional ( Translation, Scaling and Rotation Algorithms)
6. Color Models
High
Low
Difficulty Level
High
Low
Difficulty Level
222
IDENTIFICATION OF THE COURSE FOR MASTER OF
COMPUTER APPLICATIONS FOR DEVELOPING WEB BASED
LEARNING MATERIALS (WBLMs)
(Data collected is for research purpose and will be kept confidential)
PART - A
Demographic Profile
1. Name :
Sex :
Age :
Name & Address of the
Institution where Studying :
2. Year / Semester of Study :
3. Specialization in Undergraduate
Programme :
223
PART – B
IDENTIFICATION OF COURSES
Some courses in the curriculum of Master of Computer
Applications are listed below. Indicate the suitability of the courses to be
delivered on a Web Based Learning Environment. Assign the rank of 1 to
the one which is more suitable and rank 5 for the least suitable course to
be delivered on Web.
Course Name of the Courses RankOrder
A Design and Analysis of Algorithms B Data Structures
C System Software
D Database Management System E Computer Graphics
F Any Other Course (Please Specify):_____________(Note for the data collector: Part-C of the Questionnaire has to be
administered after collecting the response for part A & Part B from the
respondents)
224
PART C
IDENTIFICATION OF CONCEPTS IN THE
COURSES RANK ORDER
A. Design and Analysis of Algorithms
S.No. Basic Concepts / Principles Rank Order
1.
Brute Force (Selection sort, Bubble sort, Sequential search & String matching, Closest-pair & Convex-Hull Problem, Exhaustive search)
2.Divide and Conquer (Merge sort, Quick sort, Binary search)
3.
Dynamic Programming (Binomial coefficient, Warshall’s & Floyd’s algorithm, Optimal binary search tree, Knapsack problem)
4.Greedy Technique (Prim’s Algorithm, Kruskal’s Algorithm, Huff trees)
5.Backtracking (N-Queens problem, Hamiltonian circuit problem, Sub-set sum problem)
6.Branch and Bound (Assignment problem, Knapsack problem, Travelling salesman problem)
High
Low
Difficulty Level
225
B. Data Structures
S.No. Basic Concepts / Principles Rank Order
1. Stack and Queue (Representation, List)
2.Binary Tree (Operations, Node representation, Implicit array representation, Huffman algorithm)
3.Sorting and Searching (Exchange sorts, Insertion sorts, Merge & Radix sort, tree searching, Hashing)
4.Graph (Representation, Transitive closure, Warshall’s algorithm, Shortest path algorithm)
5.Flow problem, Dijkstra’s algorithm, Graph traversals
6.Storage Management (Linked list representation)
C. System Software
S.No. Basic Concepts / Principles Rank Order
1. Machine Structure
2.Assembler (Machine dependent and machine independent assembler features)
3.Loader (Machine dependent and machine independent assembler features)
4.Linker (Design, implementation and MS-Dos linker)
5.Macroprocessor (Design options, implementation)
6.Compliers (Design phases, system software tools, text editor, interactive debugging system)
High
Low
Difficulty Level
High
Low
Difficulty Level
226
D. Database Management System (DBMS)
S.No. Basic Concepts / Principles RankOrder
1. Embedded SQL 2. Concurrent Execution
3.
Concurrency Control (Lock-Based Protocol, Granting of locks, Two phase locking protocol, implementation of locking, Graph based protocols)
4. Query by example
5.Relational Database Design (1NF, 2NF, 3NF, 4NF, Boyce-codd Normal form)
6.Evaluation of Expression (Materialization, Pipelining)
E. Computer Graphics
S.No. Basic Concepts / Principles RankOrder
1.Bresenham’s Algorithms (Line, Circle, Ellipse)
2. Cohen Sutherland Clipping Algorithm
3. Line and Text Clipping Algorithms
4.2 Dimensional (Translation, Scaling and Rotation Algorithms)
5.3 Dimensional (Translation, Scaling and Rotation Algorithms)
6. Color Models
High
Low
Difficulty Level
High
Low
Difficulty Level
227
APPENDIX II
QUESTIONNAIRE FOR IDENTIFYING ISSUES
OF e-LEARNING
1. What is e-Learning? (From your own point of view, in 3 to 4 lines).
It is NOT WHY do you want to learn through e-Mode but HOW do
you learn through e-Mode).
Note: Please put a tick mark as per your choice, in any one of the
appropriate boxes.
S.No. Question 1 2 31 To what extent have you surfed
through e-Contents of similar subjects?
Many Times (> 5 times)
Few Times (3–5 times)
Not much (<3 times)
2 What is your desirable Time-Duration (TD) for comfortable learning from e-Content module at one spell of instance?
TD > 15 Minutes.
TD: 3-15 Minutes.
TD < 3 Minutes.
3 How much volume of Animated Graphics (AG), do you think is necessary for effective e-Learning?
AG > 50% AG:10% - 50%
AG < 10%
4 To what extent e-content of one subject need to be represented?
In Smaller episodes of Concepts
In separate Units of Subject
Entire subject in one lot
5 To what extent e-content of each segment of a subject need to be represented?
Must be represented in
small Independent
Segments
Can be represented in
Grouped Segments
Need not be split into independent
segments
6 Do you think small independent segments need to be sequenced
Yes, Very much
May be Need not be
228
S.No. Question 1 2 3logically?
7 Do you think interactive questions are needed?
Very much needed
To some extent needed
Not much needed
8 To what extent do you prefer basic concepts stressed?
Must be highly concept oriented
No specific choice
Must be informative and need not stress
on concepts 9 Do you agree - presentations
should indulge in longer mental retention
Yes, I agree To some extent I don’t think so
10 To what extent Real World Problems need to be included?
Very high extent
To some extent Not much
11 To what extent Numerical exercises need to be included?
Very much To some degree
Not much
12 To what extent Critical/Analytical ability tests need to be included?
Very high extent
To some extent Not much
13 Do you feel instructional process of your chosen subject content of NPTEL is very clear?
Very clear To some extent Not very clear
14 To what extent do you think Large figures with specifications would be appealing?
With many figures
With fairly enough figures
Figures should be minimal
15 Do you prefer User friendly menus for each specific navigation component?
Highly preferred for
each navigation
When moderately
present
Only for essentially required
navigation 16 To what extent video
presentations need to be incorporated?
In large proportion
To moderate levels
Videos should be minimized
17 To what extent concept/topic need to be introduced for every episode?
Detailed Introduction
needed
Brief Introduction is
enough
Only the main title need to be
Introduced 18 Do you want to be informed on
pre-requisite topics for each topic? Must for every
topic Indication only for main topics
No need
You are: You are from:
229
APPENDIX III
POST-TEST
(VALIDATION OF INSTRUCTIONAL APPROACH)
AIM
1. To validate the proposed Instructional Approach.
2. To assess the effectiveness of e-contents for ‘Computer
Graphics’.
3. To assess the effectiveness of three components viz.,
“Reusable Objects”, “Cognitive Structures” and “Motivation
through Real World Task” of the Approach.
Questions
7. Instruction through modular approach of e-content delivery on
‘Computer Graphics’ is more effective than Non-modular
approach?
8. Concept that has “Real World Situation” has motivated me to learn
that topic further.
9. Indication of pre-requisite topics has linked me well with Topic of
interest.
10. Demonstration through appropriate media is appealing.
11. Integrating with critical thinking question has created eagerness to
learn more.
12. Instruction on Concept through small modular approach is
effective.