12. THEORY EXAMINATION AND STRUCTURE OF QUESTION PAPERS
Each university theory paper is of 70 marks and of 3 hours duration.
There will be Two sections- Section I and Section II.
In Section I there will be SIX questions, each of 10 marks, of which FOUR are to be answered.
In Section II there will be Three questions, each of 15 marks, of which TWO are to be answered.
The questions in Section II are of applied nature such as writing programs, case analysis, problem solving, data analysis and interpretations etc.
The paper must cover entire syllabus.
13. PRACTICAL EXAMINATION
There are two practical papers for 50 marks in each semester and one practical paper of 100 in semesters I and III. Each practical examination is of 3 hours duration. For 50 marks paper 15 marks and for 100 marks paper 30 marks are reserved for internal evaluation. University appointed examination panel will conduct the practical examination of 35 marks or 70 marks as the case may be. However marks will be reported to the university out of 50 or 100 at the end of Practical Examinations. University will appoint the examiners including one internal teacher and one external and internal examiner will be the chairman of the panel.
14. For papers J030107, J030114, J030221, J030226 and J030331 respective institutes shall conduct examinations out of 50 marks and submit to the University along with other Internal marks at least one weak before the commencement of theory examinations.
15. Minor Software Project
Students in groups of 3 or 4 have to select a problem and develop software. Based on the work done a project report is written in the prescribed format under the guidance of an internal faculty. The project will be evaluated by the University appointed panel of two examiners including one internal and one external for 70 marks. Guide shall evaluate work based on continuous progress for 30 marks. Marks will be reported only out of 100 by combining marks out of 30 given by guide and marks out of 70 obtained at the university examination after completion of viva examination. Students should demonstrate the system on-line at the time of project viva.
16. Major Software Project
Every student has to undergo a 100 days industrial training during Semester VI. Students have to select a topic in consent with Industry guide and develop software. A report of the work done shall be prepared and submitted for evaluation. The project report will be evaluated by a University appointed panel of two examiners including one internal and one external. A letter grade of A or B will be awarded to indicate pass and F to indicate fail
Note: For major software projects in semester VI; there will be one panel of examiners for 30 students.
17. Subject wise Syllabus
SEMESTER-I
Subject Code
|
J030101
|
Title
|
Basic Software Development Skills
|
Work Load Per Week
|
L:3 T:1 Lab:0
|
Examinations
|
Internal: 30 University: 70
|
Objectives
|
The main objective of this paper is to emphasize that Systems Thinking and Abstract Thinking are fundamental to efficient and effective software development. So the conventional 'Fundamentals of Information Technology' topics are taught to provide new perspective which is expected to be maintained in all other papers also.
|
Learning Outcomes
|
At the end of the course, a student should
(a) be able to visualize problems as systems and analyze problems carefully, (b) have knowledge about common hardware and software systems that help in software development, (c) have basic knowledge required for all other courses.
|
Pre-requisites
|
XII Level Mathematics
|
Text Book(s)
|
Presently, there is no book which embodies the spirit and simplicity of this course. The faculty from all institutes will jointly prepare unit-wise study material which would be used as a text book.
|
Syllabus
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
1
|
Systems Concepts
|
Definition of a System, Elements of system, Characteristics of a System, Types of Systems
|
Hand Out
|
2
|
Task Performing Systems (TPS)
|
Components of TPS, DoS Model, Windows Model, Unix Model, LAN Model
|
Hand Out
|
3
|
Hardware System
|
Block Diagram, Analysis of CPU
|
Hand Out
|
4
|
|
Analysis of Internal Memory
|
Hand Out
|
5
|
|
Analysis of Arithmetic Logic Unit,
Input Devices, Output Devices and
Control Unit
|
Hand Out
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
6
|
|
Analysis of Firmware
|
Hand Out
|
7
|
Operating Systems
|
Definition of O.S.,Functions of Operating Systems, Types and examples of Operating Systems
User Interface of Windows
|
Hand Out
|
8
|
Data Communication and Networking
|
Introduction, Data communication Process, Communication concepts
|
|
9
|
Communication Types, Data transmission Medias
|
|
10
|
Types of Network: LAN,WAN,MAN,
Topologies of LAN
|
|
11
|
Components Of LAN: Media, NIC, NOS, Bridges, HUB, Routers, Brouters, Switch, Repeaters, Gateways, Modem
|
|
12
|
Communication Protocols, Roles of communication Protocol, layered protocols.
|
|
13
|
Communication Processors: Multiplexers, Concentrators, Front End Processors.
|
|
14
|
Asynchronous & Synchronous Transmission, Switching Techniques.
|
|
15
|
Client/Server Computing
|
|
16
|
Application Software
|
Word Processors
|
Hand Out
|
17
|
|
Spread Sheets
|
Hand Out
|
18
|
|
Data Base Management Systems
|
Hand Out
|
19
|
Presentation Managers
|
Hand Out
|
20
|
Internet Systems
|
Hand Out
|
21
|
CAD Systems, Expert Systems
|
Hand Out
|
22
|
Abstraction
|
Definition and Goals of Abstraction, Major Types of Abstraction- Problem Abstraction, Procedure Abstraction, Data Abstraction, and Program Abstraction
|
Hand Out
|
23
|
Problem Abstraction
|
Definition of the terms Problem and Problem Abstraction, Examples of Problem Abstraction
|
Hand Out
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
24
|
Procedure Abstraction
|
Top-Down Approach to Problem Solving, Definition of Procedure and Procedure Abstraction, Examples
|
Hand Out
|
25
|
Data Abstraction
|
Nature and Types of Data, Internal and External Representations of Data, Bits and Bytes, Examples
Representation of Non-numeric Data- ASCII, Unicode. Examples
|
Hand Out
|
26
|
Number Representations
|
Representation of Non-negative Integers, radix-r representation, conversion from radix-r to radix-s
|
Hand Out
|
27
|
Addition and Subtraction of
Radix-r Integers, Error Detection
|
Hand Out
|
28
|
Multiplication of Radix-r Integers
Division of Radix-r Integers, Computing the remainder
|
Hand Out
|
29
|
|
BCD Representation and Arithmetic
|
Hand Out
|
30
|
Representation of Integers
|
Sign-Magnitude forms and Arithmetic r-1th and r th complement forms, Arithmetic in r th complement form
|
Hand Out
|
31
|
Representation of Rationals
|
Definition of Rational Numbers, Rational Arithmetic
|
Hand Out
|
32
|
Representation of Real Numbers
|
Mantissa and Fraction form, Exponent form, Normalization, IEEE 745 form, concept of precision
|
Hand Out
|
33
|
|
Addition and Subtraction of Floats
Multiplication and Division of Floats
|
Hand Out
|
34
|
|
Errors in Floating Point Arithmetic
|
Hand Out
|
35
|
Representation of Strings
|
Definition of String, Counted String Representation, Null Terminated Strings
|
Hand Out
|
36
|
|
String Manipulation
|
Hand Out
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
37
|
Introduction to Computer Languages
|
Computer Languages, Language Types, Definition of Program
Programs in Machine Language
|
Hand Out
|
38
|
Assembly Language, Programs in Assembly Language, Interpreters
|
Hand Out
|
39
|
Higher Level Languages, Major Paradigms-Procedure Oriented, Object Based, Object Oriented, Logic Based, Functional anguages, Examples
Compilers and Translation Process
|
Hand Out
|
40
|
Program Abstraction
|
Definition of Program Abstraction and concept of an algorithm
|
Hand Out
|
41
|
Algorithm Representation-Pseudo Code, Algorithm Representation- Flow Charts
|
Hand Out
|
42
|
Elementary Algorithms for Search, Sort, and Merge
|
Hand Out
|
43
|
Recursive Algorithms
|
Definition and Examples
|
Hand Out
|
44
|
Programming
|
Meaning of Programming, Concept of Modular Programming
|
Hand Out
|
45
|
Computer Maintenance
|
Introduction, Typical causes of System Failure & Disaster Recovery.
|
Pages
|
46
|
Computer Virus
|
Computer Viruses, Trojan Horse, Worms. Some reported viruses.
|
Pages
|
47
|
|
File infectors, Disk Infectors, Partition Infectors, Boot Infectors, Companion Viruses, CMOS Virus, and Hardware Virus.
|
Pages
|
48
|
Societal Impacts of Information Technology
|
Computer Privacy, Security & Integrity.
|
Pages
|
Subject Code
|
J030102
|
Title
|
Procedure Oriented Programming
|
Work Load Per Week
|
L:3 T:1 Lab:4
|
Examinations
|
Int: 30 Univ: 70
Practical Examination: 50
|
Objectives
|
This is a first course in programming. The objective of this paper is to teach the Programming Language C. However, the process of learning a computer language will also be emphasized. Emphasis is also on semantics and problem solving. Fundamental Data structures- Arrays, Linked Lists, Stacks , Queues, and their Applications will also be considered in this course.
|
Learning Outcomes
|
At the end of the course a student should be able (a) to write good programs in C, (b)Understand and use C libraries,
(c) Effectively use Arrays and Linked Lists, (d) Use Files in C programs
|
Pre-requisites
|
XII Level Mathematics
|
Text Book(s)
|
Any suitable books or Handout can be used
|
Syllabus
|
|
Lec.
Num.
|
Unit Title
|
Details
|
1
|
Learning a Computer Language
|
Natural Languages and Computer Languages- Symbols, Alphabet, Vocabulary and Reserved words, High level words and Identifiers, Sentences and Statements
|
2
|
|
Executable and Non-Executable Statements, Types of Executable Statements- Input Statements, Assignment and Arithmetic Statements, Control Statements- Sequential, Selection, Iteration Statements, Output Statements
|
3
|
|
Concepts of a Program and subprogram, Procedures and functions
|
4
|
|
Syntactic, Semantic, and Logical Errors in a program; Program Correctness- Verification and Validation, Concept of Test Data
|
5
|
Introduction to computer Language C
|
Concepts of Machine, Assembly, and Higher Level Languages, Origins of C
|
Share with your friends: |
