Course: Title: Data Structure and MIS Course No: ICT. Ed.404
Nature of the course: Theory +Practical Level: Bridge Course for M. ICTEd. Module: III |
Full marks: (50T + 50 P) Pass marks: 20T+25P Total periods: 80 Time per period: 1 Hrs. |
- Course Description
The management information system deals with the introduction to information system, different basic components of information system, idea of conceptual and detailed system design, implementation, evaluation, and maintenance of information system, application of database management, design and implementation of management information system, process for system design methodology, and finally the basic concepts of internet and intranet. The course in data structure and algorithm lays out the principles data structuring, use of stack, queue, list, linked lists, recursion, trees, sorting, searching, graphs and their implementations. This course also deals with the comparison of different algorithms. - General Objectives
The general objectives of this course are as follows:- to introduce the knowledge of computer based information systems,
- To enable the students in applying knowledge of computer based information system,
- to help designing and setting up complex information system to the student,
- to provide fundamental knowledge on date structure designing and implementation for storing information,
- to provide the knowledge of various algorithms used in computer science.
- to introduce the knowledge of computer based information systems,
- Specific Objectives and Contents
Specific Objectives | Contents |
Unit I: Introduction to Information System(5) | |
|
1.1 Definition 1.2 Sources and types of IS 1.3 Manual and Computer based IS 1.4 Planning and Design 1.5 Feasibility Assessment 1.6 Implementation |
Unit II: Basic components of Information system(5) | |
| 2.1 Hardware 2.2 Multi-Protocol Networks 2.3 Communication media 2.4 Standard User Interface 2.5 Markup Languages |
Unit III: Conceptual and Detailed System Design(4) | |
| 3.1 Definition of Problems 3.2 Constraints 3.3 Alternative Design |
Unit IV: Implementation, Evaluation, and Maintenance of IS(5) | |
• Explain the implementation, control, and maintenance of information system. |
4.1 Implementation Alternatives 4.2 Plan for Implementation 4.3 Evaluation of implemented system 4.4 Control and Maintenance |
Unit V: Parts of Information System(5) | |
• Implement the database concept in the design of information system. |
5.1 Database Management System 5.2 Management Information System 5.3 Automation Process 5.4 Geographical Information System |
Unit VI: Management of Information system(5) | |
• Elaborate the design and implementation of management information system |
6.1 MIS Planning 6.2 Design, and Implementation |
Unit VII: System Design Methodology (4) | |
• Explain and implement the steps in the design |
7.1 Check list methodology 7.2 Process Oriented Methodology 7.3 Application Generation 7.4 Structured Design |
Unit VIII: Internet and Intranet (5) | |
• Demonstrate the uses of internet system and addressing techniques. |
8.1 Internet versus Intranet 8.2 TCP/IP standard 8.3 E-mail, Internet and external 8.4 SMTP/POP, WWW and Hypermedia 8.5 Proxy servers and their configuration 8.6 Resource sharing 8.7 IP addressing, routing and sub-netting |
Unit IX: Introduction to Data Structure (4) | |
• Mention the basics of data structure. |
9.1 Concept of data structure 9.2 Abstract date type 9.3 Implementation of data structure |
Unit X: The Stack(4) | |
• Use of stack and its implementation. |
10.1 Definition 10.2 Stack as an ADT 10.3 POP and PUSH operation 10.4 Stack application: Evaluation of Infix Postfix and prefix expressions |
Unit XI: Queue (4) | |
• Explain and implement queue. |
11.1 Definition 11.2 Queue as an ADT 11.3 Primitive operations in queue: Linear and circular queue and their application 11.4 Enqueue and Dequeue 11.5 Priority queue. |
Unit XII: List (5) | |
• Explain and implement list. |
12.1 Definition 12.2 Static and dynamic list structure 12.3 Array implementation of lists 12.4 Queues as list |
Unit XIII: Linked lists (5) | |
• Understand and implement linked list. |
13.1 Definition and link list as an ADT 13.2 Dynamic implementation 13.3 Basic operations in `linked list: node insertion deletion, insertion and deletion after and before nodes linked stacks and Queues 13.4 Doubly linked lists and its advantages |
Unit XIV: Recursion (4) | |
• Explain and implement recursive process with reference to Tower-of- Hanoi problem. | 14.1 Principle of recursion 14.2 Comparison between recursion and iteration, recursion example 14.3 TOH and Fibonacci sequence 14.4 Applications of recursion 14.5 Search tree |
Unit XV: Trees (5) | |
• Explain the concept and implementation of tree structure. |
15.1 Concept and definitions 15.2 Basic operation in binary tree 15.3 Tree search and insertion /deletions binary tree traversals (preorder , post order and in order ) tree height level and depth 15.4 Balanced trees : AVL balanced trees , Balancing algorithm 15.5 The Huffman algorithm 15.6 Game tree, B- Tree |
Unit XVI: Sorting (5) | |
• Identify different sorting algorithm and implement it. |
16.1 Internal and external sort 16.2 Insertion and selection sort 16.3 Exchange sort Bubble and quick sort Merge and Radix sort Shall sort , Binary sort, Heap sort as priority queue 16.4 Efficiency of sorting big ‘O’ notation |
Unit XVII: Searching (5) | |
• Identify different searching algorithm and implement it. |
17.1 Search technique essential of search 17.2 Sequential search binary search, tree search general search tree 17.3 Hashing : Hash function and hash tables 17.4 Collision resolution technique 17.5 Efficiency comparisons of different search technique |
Unit XVIII: Graphs (5) | |
• Represent and implement graphs. |
18.1 Representation and applications 18.2 Graphs as an ADT 18.3 Transitive closure 18.4 Wars hall’s Algorithm 18.5 Graphs types, Graphs traversal and spanning forests 18.6 Kruskal ‘s and Round Robin algorithms 18.7 Shortest-path algorithm: Greedy algorithm , Dijkstra’s Algorithm |
Unit XIX: Algorithms (4) | |
• Explain different types of algorithms and demonstrate its applications. |
19.1 Deterministic and non-deterministic algorithm 19.2 Divide and conquer algorithm 19.3 Series and Parallel algorithm 19.4 Heuristic and Approximate algorithm |
Part II: Practical
3.Laboratory WorkThe laboratory exercises shall include projects on designing of Information system using Object oriented methodology. Case study shall be included. The data structure and algorithms should include following laboratory exercises based on C or C++:
4.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 Instructional Techniques
3.Laboratory WorkThe laboratory exercises shall include projects on designing of Information system using Object oriented methodology. Case study shall be included. The data structure and algorithms should include following laboratory exercises based on C or C++:
- Implementations of stack.
- Implementations of linear and circular queues.
- Solutions of TOH and Fibonacci Recursion.
- Implementation of linked list: singly and double linked.
- Implementation of trees : AVL tree Balancing of ALV
- Implementation of merge sort.
- Implementation of search: sequential tree and binary.
- Implementation of Graphs: Graph traversals.
- Implementation of hashing.
- Implementation of heap.
4.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 Instructional Techniques
- Providing the reading materials to the students to familiarize the units.
- Lecture, question-answer, discussion, brainstorming, practical, and buzz session.
4.2 Specific Instructional Techniques
Unit I
5.1 Evaluation of Theory Part: Students will be evaluated on the basis of the class test during academic session, classroom participation, presentation of the reports and other practical activities. The scores obtained will be used for feedback purposes. The students will be evaluated through the annual examination held by the Office of the Controller of Examinations on the basis of objective questions, short and long questions. The types and number of questions to be asked in the annual examination is mentioned below:
The performance of the students will be assessed through practical examination. The practical examination will be conducted within the campus by external and internal examiners. Marks distribution for the practical examination is given as follows.
Time required = 2 Hours 6. Recommended Books and ReferencesRecommended Books
Kanter, J. (2004). Managing with Information System", Fourth edition, New Delhi: Prentice Hall of India Limited.(For Units I to IV, and VI to VII) Rajaraman, V. (1998). Analysis and design of Information Systems", New Delhi: Prentice Hall of India.(For Units V) Baluja, G. S. (2003). Data structure Through C, A Practical Approach", New Delhi: DhanpatRai& Co..(For Units IX to XIX) References Langsam, Y., Augenstein, M and Tanenbaum, A. (2005). Data Structures using C and C++ , New Delhi: Prentice Hall India. Rowe,G. (2006). Introduction to Data Structure and Algroithms with C and C++ , New Delhi: Prentice Hall India. |
|