|
|
Course Title: MIS, Data Structure and Recent Technologies
Course No: ICTED 322 Full marks: 75 + 25 Nature of Course: Theory and Practical Pass marks: 35% + 40% Period per week: 6 + 3 150per year 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. It also introduces the concept of computer science teaching methodology. General Objectives
|
SN | Objectives | Contents | Period | Testing Strategies | Reference | Evaluation |
1 | -Understand basic of information system and Planning. |
Introduction to Information System | 8hr |
-Practical -Discussion | Kanter Chap 1 |
-Short question -Multiplechoice |
2 | -Identify and understand different hardware and communication system. used in the information |
system. Basic components of Information system | 8 hr |
Practical -Lecture -Practical -Discussion -Group work | Kanter Chap 2 |
-Short question -Long question -Multiple choice |
3 | -Define a problem and constraints. |
Conceptual and Detailed System Design | 5Hr |
-Lecture -Practical -Discussion -Group work | Kanter Chap 4, 6 |
-Short
question -Long question -Multiple choice |
4 | -Implementation, control, and maintenance of information system. |
Implementation, Evaluation, and Maintenance of IS | 7hr |
-Lecture -Practical -Discussion -Group work | Kanter Chap 7 | -Short
question -Long question -Multiple choice |
5. | -Implement the database concept in the design of information system. ' | Parts of Information System | 7hr |
-Lecture -Discussion -Group work | Rajaraman Chap 13 |
-Short
question -Long question -Multiple choice |
6. | -Design and implementation of management information system | Management of Information system | 7hr |
-Lecture -Practical -Discussion -Group work | Kanter Chap 9 | -Short
question
-Multiple choice |
7. | -Understand and implement the steps in the design | System Design MethodologyB> Check list methodology, Process Oriented Methodology, Application Generation, Structured Design. | 9hr | -Lecture -Practical -Discussion -Group work | Kanter Chap 7 | -Short
question -Long question -Multiple choice |
8. | -Get familiarization of internet system and addressing techniques. |
Internet and Intranet Internet versus Intranet, TCP/IP standard, E-mail, Internet and external, SMTP/POP, WWW and Hypermedia, Proxy servers and their configuration, Resource sharing, IP addressing, routing and sub-netting. | 8hr |
-Lecture -Discussion -Group work | Internet |
-Short
question -Long question -Multiple choice |
9. | -Understand the basics of data structure. | Introduction to Data Structure Concept of data structure, Abstract date type Implementation of data structure. | 4hr | -Lecture -Practical -Discussion -Group work | Baluja Chap 1 | -Short
question -Long question -Multiple choice |
10. | -Use of stack and its implementation. | The Stack Definition, Stack as an ADT, POP and PUSH operation, Stack application: Evaluation of Infix Postfix and prefix expressions. | 6hr | -Lecture -Practical -Discussion -Group work | Baluja Chap 4 | -Short
question -Long question -Multiple choice |
11. | -Understand and implement queue. | Queue Definition, Queue as an ADT, Primitive operations in queue Linear and circular queue and their application, Enqueue and Dequeue, Priority queue. | 6hr | -Lecture -Practical -Discussion -Group work | Baluja Chap 5 | -Short
question -Long question -Multiple choice |
12. | -Understand and implement list. |
List Definition , static and dynamic list structure , array implementation of lists, Queues as list. | 7hr |
-Practical -Discussion -Group work | Baluja Chap 6 | -Short
question -Long question -Multiple choice |
13. | -Understand and implement linked list. |
Linked lists Definition and link list as an ADT, Dynamic implementation, basic operations in `linked list: node insertion deletion, insertion and deletion after and before nodes linked stacks and Queues, Doubly linked lists and its advantages. | 7hr |
-Practical -Discussion -Group work | Baluja Chap 6 | -Short
question -Long question -Multiple choice |
14. | -Understand and implement recursive process with reference to Tower-of- Hanoi problem. |
Recursion Principle of recursion, Comparison between recursion and iteration, recursion example, TOH and Fibonacci sequence, Applications of recursion, Search tree. | 6hr |
-Practical -Discussion -Group work | Baluja Chap 2 | -Short
question -Long question -Multiple choice |
15. | -Understand the concept and implementation of tree structure. |
Trees Concept and definitions, basic operation in binary tree, tree search and insertion /deletions binary tree traversals (preorder , post order and in order ) tree height level and depth , balanced trees : AVL balanced trees , Balancing algorithm, The Huffman algorithm , Game tree, B- Tree. | 7hr |
-Practical -Discussion -Group work | Baluja Chap 7 | -Short
question -Long question -Multiple choice |
16. | -Identify different sorting algorithm and implement it. |
Sorting Internal and external sort, Insertion and selection sort, Exchange sort Bubble and quick sort Merge and Radix sort Shall sort , Binary sort, Heap sort as priority queue Efficiency of sorting big ‘O’ notation. | 7hr |
-Practical -Discussion -Group work | Baluja Chap 8 | -Short
question -Long question -Multiple choice |
17. | -Identify different searching algorithm and implement it. |
Searching Search technique essential of search, Sequential search binary search, tree search General search, Tree search , General search tree , Hashing : Hash function and hash tables , collision resolution technique , Efficiency comparisons of different search technique. | 7hr |
-Practical -Discussion -Group work | Baluja Chap 8 | -Short
question -Long question -Multiple choice |
18. | -Represent and implement graphs. |
Graphs Representation and applications, Graphs as an ADT , Transitive closure, Wars hall’s algorithm , Graphs types, Graphs traversal and spanning forests, Kruskal ‘s and Round Robin algorithms, Shortest-path algorithm , Greedy algorithm , Dijkstra’s Algorithm | 7hr |
-Practical -Discussion -Group work | Baluja Chap 9 | -Short
question -Long question -Multiple choice |
19. | -Understand different types of algorithms and demonstrate its applications. |
Algorithms Deterministic and no-deterministic algorithm, Divide and conquer algorithm, Series and Parallel algorithm, Heuristic and Approximate algorithm | 5hr |
-Practical -Discussion -Group work | Internet | -Short
question -Long question -Multiple choice |
20. | -Get familiar with multimedia techniques and its applications. |
Multimedia Introduction to Multimedia, Component of Multimedia: Text, Graphics, Audio, Video and Animation, Application of Multimedia | 8hr |
-Practical -Discussion -Group work | Ralf Chap 1, 2, 17 | -Short
question -Long question -Multiple choice |
21. | -State artificial intelligence techniques and perform its applications. |
Artificial Intelligence Concept of AI, Component of AI, Uses of AI, Ethical Aspect of AI | 6hr |
-Practical -Discussion -Group work | Russel chap 1 | -Short
question -Long question -Multiple choice |
22. | -Identify contemporary technology and perform its applications. |
Contemporary Technology e- Business, e-Learning, e-Governances, e-Medicine, Virtual Reality, Robotics | 8hr |
-Practical -Discussion -Group work | Internet | -Short
question -Long question -Multiple choice |
Laboratory:
The 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++:
Text Book:
|