Order date : 29-06-2009
23
Transcript of Order date : 29-06-2009
UNIVERSITY OF CALICUT
FACULTY OF SCIENCE
Curriculum, Syllabi and Scheme of Examinations
for the
B.Sc INFORMATION TECHNOLOGY Degree Program
With effect from Academic Year 2009-2010
PROGRAM OBJECTIVE
There are two main objectives to the B.Sc Information Technology Program.
I. To make students as computer professionals, who can be directly employed or start
his/her own work as Web Designer, Database User, Programmer, Testing
professional, Designer of a System and Network implementer
II. To train students to a level where they can readily compete for seats for advanced
degree courses like MCA, MSc(CS), MSc(IT) and MBA etc
On completion of the B.Sc Information Technology Program, the student will:
•••• Have basic communicative skill in the English language
•••• Have environmental and civic awareness
•••• Communicative skills and literary sensibility in languages other than English
•••• Have sound knowledge of the theory behind the core subjects like, computer
architecture, operating systems, data structures, data bases, computer networks.
•••• Have sound skills in selected procedural and visual programming languages,
designing databases and managing them, software engineering and web-based
applications
•••• Be in a position to develop industrial applications
ELIGIBILITY
Candidate seeks admission to the B.Sc Information Technology Program should
have passed the Higher secondary/Technical higher secondary /Vocational Higher
secondary examinations of Govt. of Kerala or CBSE or ICSE or any other examinations
recognized as equivalent there to by the University of Calicut with Mathematics or
Computer Science or Computer Applications as one of the optional subjects.
DURATION OF THE PROGRAM
Duration of the program shall be 6 semesters. Each semester should have 90
instructional days with 5 hours of instruction per day 5-days a week system. The
University will conduct semester-end examination.
PROGRAM STRUCTURE
Contact
Hours
Se
mes
ter
C
o
u
rs
e
N
o
Courses Course
Code Course Title
T
h
e
o
r
y
L
a
b
T
o
t
a
l
Cr
ed
its
1 Common
Course - 1 IT1A01 Communication Skill in English 4 0 4 3
2 Common Course -
2 IT1A02
Critical reasoning , writing and
presentation 5 0 5 3
3 Common Course -
3 IT1A07
Communication Skill in
Languages other than English 5 0 5 4
4 Core
Course - 1 IT1B01 Programming in C 2 2 4 4
5 Complementary
Course - 1 IT1C01 Basic Electronics 3 0 3 3
6 Complementary
Course - 2 IT1C02
Digital Fundamentals
&Computer Organization 4 0 4 3
I
Se
mes
ter
Total (6 Courses) 25 20
7 Common
Course - 4 IT2A03 Reading literature in English 4 0 4 4
8 Common
Course - 5 IT2A04
Reading on Indian constitution
secularism and sustainable
environment
5 0 5 4
9 Common
Course - 6 IT2A09
Literature in Languages other
than English. 5 0 5 4
10 Core
Course - 2 IT2B02 Computer Graphics & Animation 3 1 4 4
11 Complementary
Course - 3 IT2C03 Probability & Statistics 3 0 3 3
12 Complementary
Course - 4 IT2C04 Microprocessor 3 1 4 3
II
Se
mes
ter
Total (6 Courses) 25 22
13 Common
Course - 7 IT3A06
History and Philosophy of
Science. 5 0 5 4
III
Se
mes
ter 14
Common
Course - 8 IT3A12 General Informatics 4 0 4 4
15 Core
Course - 3 IT3B03 Theory of Computation 4 0 4 3
16 Core
Course - 4 IT3B04 Data structures & Algorithms 4 0 4 3
17 Complementary
Course - 5 IT3C05
Discrete Mathematics & Number
theory 4 0 4 3
18 Complementary
Course - 6 IT3C06
Micro controllers & Integrated
Circuits 4 0 4 3
Total (6 Courses) 25 20
19 Common
Course - 9 IT4A13 Basic Numerical Skills 4 0 4 4
20 Common
Course - 10 IT4A14 Entrepreneurship Development 4 0 4 4
21 Core
Course - 5 IT4B05 OOP&C++ 4 0 4 3
22 Core
Course - 6 IT4B06
Programming
Laboratory –Data structures
using C++
0 5 5 3
23 Complementary
Course - 7 IT4C07 Numerical Methods & OR 4 0 4 3
24 Complementary
Course - 8 IT4C08 Digital Signal Processing 4 0 4 3
IV
Se
mes
ter
Total (6 Courses) 25 20
25 Core
Course - 7 IT5B07 Data communication 4 0 4 3
26 Core
Course - 8 IT5B08 Software Engineering 4 0 4 3
27 Core
Course - 9 IT5B09 DBMS 4 0 4 3
28 Core
Course - 10 IT5B10
Elective I:
A. Java
B. .Net technologies
C. Grid Computing
D. Simulation & Modeling
4 0 4 3
29 Core
Course - 11 IT5B11 Mini Project 0 4 4 --
30 Open
Course - 1 IT5D01
A. Web Programming
B. Electronic Documentation 3 2 5 4
V
Se
mes
ter
Total (6 Courses) 25 16
31 Core
Course - 12 IT6B12
Computer Networks &
Administration 4 0 4 3
VI
Se
mes
ter 32
Core
Course - 13 IT6B13 Operating System 4 0 4 3
33 Core
Course - 14 IT6B14
Elective II:
A. Mobile Computing
B. Data Warehousing
C. Software Testing
D. Distributed Computing
4 0 4 3
34 Core
Course - 15 IT6B15 Multimedia Technologies 4 0 4 3
35 Core
Course - 16 IT6B16 Project 0 5 5 7
36 Open
Course - 2 IT6B16E1
A. Cryptography & Network
Security
B. Linux Administration
C. Image Processing
D. Unified Modeling Language
4 0 4 3
Total (6 Courses) 25 22
IT1B01: PROGRAMMING IN C
Unit – I (10 Hours) Programming principles: Algorithms, Flow charts. Computer Language: Classification.
Program Concept: Source program, Compiling, Program execution, Object program.
Measures of program performance. C- Language Fundamentals: Tokens, Fundamental
data types, Precedence of evaluation.
Unit – II: (10 Hours) Flow of Control: Branching: If statement, If – else and Else – If constructs, nested if
statements, switch statements. Looping: for loops, while and do-while loops, nested
loops, break and continue statements.
Unit –III :(12 Hours) Arrays: Definition, One-dimensional arrays, Two-dimensional arrays, Initializing one and
two dimensional arrays. Strings: Declaring and initializing strings, Reading and writing
strings. Functions: Definition, Types of functions, Function prototyping, Arguments and
return values, Nesting of functions, Recursive functions, String functions. Scope and
Extent of Variables: Local and global variables, auto, static and register variables.
Unit – 1V: (12 Hours) Structures and Union: Definitions, Arrays of structures, Structures with in structures,
Structures and functions, sizeof() operator. Pointers: Definition, Pointers and structures,
Pointers and functions, Pointers and arrays, Operations on pointers.
Unit – V: (10 Hours) Input and output: Character I/O, Formatted I/O, print and scan functions. File: Defining
and opening a file, Closing a file, I/O operations on files, Error handling, Random access.
The preprocessors: #define, #include, #if, #undef, etc. Command line arguments.
Dynamic memory allocation.
REFERENCES 1. E Balaguruswamy, “ Programming in ANSIC”.
2. Kelley, A & Pohl, I;, “A Book on C”, Addison - Wesley
3. Venu Gopal K.R.&Prasad, S.R. “Programming with C”, Tata McGraw Hill
4. S.G.Kochen , “Programming in C”.
5. Kernigham and Ritchie, “C Language Reference”.
IT2B02: COMPUTER GRAPHICS & ANIMATION
Unit – I :( 10 Hours)
Video display device : Cathode ray tube, Raster scan displays, Random scan
displays. Raster scan systems, Random scan systems, Input devices, Graphics
softwares.
Unit – II :( 12 Hours) Output Primitives : Points & Lines, Line drawing Algorithms, Loading the frame buffer,
Circle & Ellipse generating Algorithms, Pixel addressing & Object geometry, Fill area
primitives , Character generation
Unit –III :( 10 Hours) 2-D Geometric Transformations : Basic Transformations , Matrix representation &
Homogeneous Coordinates, Composite Transformations, Other Transformations,
Transformations between Coordinate Systems, Raster methods for Transformations
Unit – 1V :( 12 Hours) 2- Dimensional Viewing : Viewing pipeline, Viewing Coordinate reference frame,
Window-to-view port coordinate transformation, Line clipping, Polygon Clipping, Curve
Clipping.
Unit – V :( 10 Hours) 3 -D Concepts : 3 -D display methods. 3-D Geometric & Modeling Transformations:
Translation, Rotation, Scaling, Other Transformations, Composite Transformations,
Modeling & Coordinate.
REFERENCES
1. D.Hearn & M.P.Becker , “Computer graphics”; 2 nd
Ed., Prentice Hall India-
1995
2. Foley Vandam & Hughes, “ Computer Graphics”; Addision Wesly
3. Angel Edward., “Interactive Computer Graphics – A Top-down Approach with
OpenGL” ,Addison-Wesley 1996.
4. Newmann W and Sproull R.F., Principles of Interactive Computer Graphics,
McGraw-Hill, 1980
IT3B03: THEORY OF COMPUTATION
Unit – 1: (12 Hours) Mathematical Preliminaries: Sets, Relations and Functions, Graphs and Trees, Strings
and their properties, Principle of induction. The Theory of Automata: Definition of an
automation, Description of a finite automation, Transition systems, Properties of
transition functions, Acceptability of a string by a finite automation, Nondeterministic
finite state machines, The Equivalence of DFA and NDF, Mealy and Moore Models,
Minimization of finite automata.
Unit – II: (10 Hours) Formal Languages: Basic definitions and examples, Chomsky classification of
Languages, Languages and their relation, Recursive and recursively enumerable sets,
Operations on languages, Languages and automata.
Unit –III: (10 Hours) Regular Sets and Regular Grammars: Regular expressions, Finite automata and regular
expressions, Pumping lemma for regular sets, Application of pumping lemma, Closure
properties of regular sets, Regular sets and regular grammars.
Unit – 1V: (12 Hours) Context -Free Languages: Context – free languages and derivation trees, Ambiguity in
context – free grammars, Simplification of context –free grammars, Normal forms for
context-free grammars, Pumping lemma for context – free languages, Decision
Algorithms for context – free languages. Pushdown Automata: Basic definitions,
Acceptance by pda, Pushdown automata and context – free languages, Parsing and
pushdown automata.
Unit – V: (12 Hours) Turing Machines and Linear Bounded Automata: Turing machine model, Representation
of Turing machines, Languages acceptability by Turing machines, Design of Turing
machines, Description of Turing machines, Techniques for TM construction, Variants of
Turing machines, The Model of Linear Bounded Automaton, Turing machines and Type
0 Grammars, Linear bounded automata and languages. Decidability and Recursively
Enumerable Languages: The definition of an algorithm, Decidability, Decidable
languages, Undecidable languages, Halting problem of Turing machine, The post
correspondence problem.
REFERENCES 1. KLP Mishra & N Chandrasekaran, “Theory of Computer Science”,3
rd Edition,
Prentice Hall,2007
2. H.R.Lewis and C.H.Papadimitriou, “Elements of the Theory of Computation”,
Prentice Hall of India, 1996.
3. Linz: P. An Introduction to Formal Languages and Automata, Narosa, 1998
4. Hoporoft J.E.and Ullman J.D., Introduction to Automata Theory Languages and
Computation, Narosa, 1981
IT3B04: DATA STRUCTURES & ALGORITHMS
Unit – 1: (10 Hours) Introduction: Elementary data organization, Data structures, Data structure operations,
Algorithmic notation, Control structures, Complexity of algorithms, String processing,
Structured approach in programming, Top-down design, Recursive procedures and
algorithms.
Unit – II: (10 Hours) Arrays, Records and Pointers: Linear arrays, Representation, Traversing, Inserting and
deleting, sorting and searching, Binary search. Multidimensional arrays, Pointers,
Records, Representation, Matrices, Sparse matrices, Sparse matrix operations
Unit –III :( 14 Hours) Linked Lists: Concept, Representation, Traversing, Inserting and deleting, Searching,
Types of linked lists (circular, doubly circular doubly), garbage collection. Stacks and
Queues: Definition, Fundamental operations on stacks, array representation, linked list
representation, polish notation, Applications of stack, Concepts of queues, dequeues and
priority queues.
Unit – 1V: (10 Hours) Tress: Basic terminology, Binary tree representation, Traversing binary trees, Traversing
algorithms using stack, Threads, Binary search tree, Operations; Heap: Storage
representation and manipulation of binary trees, Huffman’s algorithm, General trees.
Graphs: Concept, Representation, Operations.
Unit – V: (12 Hours) Sorting and Searching: Sorting types, Insertion sort, Selection sort, Merging, Merge sort,
quick sort, radix sort, bubble sort, heap sort; Searching: Binary search and linear search
comparison, Hashing.
.
REFERENCES 1. Seymour Lipschutz, “Theory and Problems of Data Structures”, International
Edition,1986
2. E.Horowitz, S Sahni & D Mehta,” Fundamentals of Data Structures in C++”,1st
Edition, Galgotia,2005
3. S Sahni, “Data Structures, Algorithms, and Applications in C++”, International
Edition, McGraw Hill, 2000.
4. Wirth N, “Algorithms + Data Structures = Programs”, Prentice Hall International,
2001.
IT4B05: OBJECT ORIENTED PROGRAMMING & C++
Unit – 1 :( 8 Hours) Object Oriented Paradigm: Evolution of programming paradigms, Structured verses
object –oriented development, Elements of OOP, Objects, Classes, Multiple views of the
same object, Encapsulation and data abstraction, Inheritance, Delegation, Polymorphism,
Message communication, Merits and demerits of OO methodology.
Unit – II: (12 Hours) Stream based I/O, Comments, iostream library, Scope resolution operator, Variable
declaration and definition, Runtime memory management. Data Types, Operators and
Expressions. Control Flow, Arrays and Strings.
Unit –III: (10 Hours) Modular Programming with Functions: Function components, Passing data to functions,
Function return data type, Library functions, Parameter passing, Return by reference,
Parameter passing, inline function, Function overloading, Function Templates, Arrays
and functions, Complete syntax of main(). Pointers and Runtime Binding. Classes and
Objects.
Unit – 1V: (12 Hours) Object Initialization and cleanup: Constructors, Parameterized constructors, Destructor,
Constructor overloading, Order of constructor and destructor, Dynamic initialization
through constructors, Constructors with dynamic operations, Copy constructors, Nested
classes. Dynamic Objects. Operator Overloading. Inheritance. Virtual Functions.
Unit – V: (12 Hours) Generic Programming with Templates, Stream Computation with Files, Exception
Handling, Standard Template Library, Object Oriented System Development.
REFERENCES 1. K R Venugopa, Ravikumar, T Ravisankar, “Mastering C++”, 19
th Reprint,
TataMcGraw-Hill, 2005.
2. E Balaguruswami, “Object Oriented Programming with C++”, 2nd
Edition,
TataMcGraw-Hill, 2002
3. Stanly B lippman , “The C++ Primer”,Addison Wesly
4. Cohoon & Davidson, “C++ Program Design”, Tata McGraw-Hill
IT4B06: PROGRAMMING LABORATORY
DATA STRUCTURES USING C++
MENU DRIVEN C++ PROGRAMS USING CLASS
•••• Data structure operation using Array and Linked list
•••• Stack and Queue using Array and Linked list.
•••• Dequeue using Array and Linked list.
•••• Polynomial Operations on Two Polynomials: Addition, Subtraction,
Multiplication using Arrays and Linked lists.
•••• String operations
•••• Stack Application: Expression evaluation.
•••• Sorted linked list
•••• Doubly linked list.
•••• Circular linked list and Circular Doubly linked list.
•••• Operator Overloading: +,-,+=,-=,>>,<<.
•••• Sorting: Bubble, Insertion, Selection, Quick, Merge, Heap
•••• Searching : Linear, Binary
•••• Binary Search Tree
•••• Prepare list of students details using linked list data structure
.
REFERENCES 1. Seymour Lipschutz, “Theory and Problems of Data Structures”, International
Edition,1986
2. E.Horowitz, S Sahni & D Mehta,” Fundamentals of Data Structures in
C++”,1st Edition, Galgotia,2005.
3. Yashavant P.Kanetker, “Data Structures Through C++”, 1st Edition, BPB
Publications, 2007
4. K R Venugopa, Ravikumar, T Ravisankar, “Mastering C++”, 19th Reprint,
TataMcGraw-Hill, 2005.
5. E Balaguruswami, “Object Oriented Programming with C++”, 2nd
Edition,
TataMcGraw-Hill, 2002
IT5B07: DATA COMMUNICATION
Unit – 1 :( 10 Hours) Evolution of modern communication system-PSTN-ISDN-Analog and digital signals-
common terminology-Voice channels-RS 232 serial communication-Data communication
equipments (DCE)-Data terminal equipments (DTE)-channel organization-Asynchronous
and synchronous protocols-Binary synchronous protocols (BSP)-Bit-oriented protocols
(BOP)-Modes of channel operation-simplex, half-duplex and full duplex-Modulation
Unit – II :( 10 Hours) Overview-Network transmission media-connecting network devices-common physical
topology-connecting a simple network-controlling data transmission-ISO and OSI model-
seven layers of OSI model-network communication through OSI model-standards and
open systems, TCP/IP Protocol suite.
Unit –III: (10 Hours) Client-server network OS-Peer-to-Peer network OS-Desktop OS-application software-
Internet working- Bridges and routers-Netware Internet working-protocols-IPX-RIP-
NLSP-service advertising protocols (SAP)-Netware core protocols(NCP)-Sequence of
packet exchange-Gate ways-Basic ideas of WAN, ATM, FDDI, X.25, FRAME
RELAY, ISDN AND SONET.
Unit – IV: (10 Hours) Introduction-POPI-POP3-Point-to-point protocols (PPP)-link control protocols (LCP)-
Network control protocols (NCP)-Simple mail transfer protocols (SMTP)
Unit – V: (10 Hours) Evolution-Services-Basic structure-Accessibility-Domain names-E0-mail-World wide
Web-Web browsers and server-Basic terminology-information retrieval-Archie-Gopher-
FTP-Telnet-Finger-Wais-Usenet news-Ping-Trace route-Nalookup- Search engines-
Yellow pages and directories-Web pages and HTML- Multimedia and communication-
Net meeting-ICQ-Powwow-Internet relay chat-Netiquette-Firewalls- Internet
management-Security-Intranet - Corporate on-line presentation of information.
REFERENCES 1. Leon-Garcia&Widjaja , “Communication Networks”, TataMcGraw-Hill
2. Andew S Tanenbaum, “Computer Networks”, Prentice Hall
3. Greenlaw & Hepp, “Fundamentals of the Internet and world wide Web”, Tata-
McGraw Hill.
4. B.Forouzan, Data Communication and Networking, Tata McGRaw Hill, 1998
IT5B08: SOFTWARE ENGINEERING
Unit – 1: (10 Hours) Introduction to software engineering – computer based system engineering – project
management – activities, project planning, activity organization, project scheduling.
Unit – II: (10 Hours) Requirements engineering – requirements analysis – system models – requirements
definition and specification – software prototyping – formal specification – algebra
specification – model – based specification.
Unit –III: (10 Hours) Software design-architectural design – object oriented design – function oriented design –
real – time systems design – user interface design – software reliability – programming
for reliability – software reuse.
Unit – 1V: (10 Hours) Verification and validation – defect testing – static verification – managing people –
software cost estimation – quality management – process improvement.
Unit – V: (10 Hours) CASE classification – integrated CASE – the CASE life cycle – CASE workbenches –
programming workbenches – meta – CASE workbenches – software engineering
environments.
REFERENCES III. Ian Sommerville, Software Engineering, 6/e, Pearson Education Asia, 2001.
IV. R.S.Pressman, Software Engineering, 4/e, MacGraw Hill, 1997.
V. P.Jalote, An Integrated Approach to Software Engineering, Narosa, 1993
IT5B09: DATA BASE MANAGEMENT SYSTEMS
Unit – 1: (12 Hours) Databases and Database Users: Characteristics of database approach, Actors behind the
scene, Workers behind the scene. Advantages of using the DBMS approach, Database
application, Disadvantages. Database System-Concepts and Architecture: Data Models,
Schema, and Instances, Three schema architecture and data Independence, Database
languages and interfaces, The database system environment, Centralized and client/server
architecture for DBMS, Classification of DBMS.
Unit – II: (10 Hours) Data Modeling using the E-R Model: Entity types, Entity sets, Attributes, and Keys,
Relationship types, Weak entity types, EER modeling. The Relational Data Model and
Relational Database Constraints. Relational algebra and Relational calculus
Unit –III : (12 Hours) Relational Commercial languages, Structured Query languages (SQL), Query by
example. Relational Database Design: Informal design guidelines for relation schema,
Functional dependencies, Normal forms, General definition of second and third normal
forms, BCNF, Properties of relational decompositions, Algorithms for relational database
schema design, Multi-valued dependencies and forth normal form, Join dependencies and
fifth normal form..
Unit – 1V : (10 Hours) Algorithms for Query Processing and Optimization. Transaction Processing Concept:
Introduction, Transaction and system concept, Characterizing schedules, Concurrency
control technique, Database recovery concept, Recovery Technique
Unit – V : (10 Hours) Distributed Databases and Client –Sever Architecture: Concept, Transparency, Types of
distributed databases, Distributed query processing. Object oriented databases: Object
structure, Class hierarchy, Multiple inheritance, Object identity, Physical organization,
Object oriented queries.
REFERENCES R Elmasri, S B Navathe, D V L N Somayajulu, S K Gupta, “Fundamentals of Database
Systems”, 4th Edition, Pearson Education, 2007.
H.F. Korth, A Silberschatz and S. Sudarasan, “Database System Concepts”, Computer
Science Series, McGraw-Hill, 1997
C.J.Date, “An Introduction to Data Base Systems,” Volume L Addison Wesley, Reading,
MA, 1990
Database Management And Design – Hansen & Hansen – Prentice Hall of India.
ELECTIVE-I
IT5B10A: JAVA
Unit – 1: (10 Hours) Fundamentals of Object Oriented Programming. Evolution : Features, Environment, JFC.
Constants, Variables & Data Types.
Unit – II: (12 Hours) Operators and Expressions. Decision Making : Branching, Looping
Unit –III: (12 Hours) Classes, Objects and Methods. Arrays, Strings and Vectors. Interfaces. Packages. Multi
threaded Programming. Exceptions.
Unit – 1V:(10 Hours) Applet Programming. Graphic Programming.
Unit – V: (10 Hours) Managing Input/Output files. Java Collection. JDBC. Concepts of J2EE
REFERENCES
1. E. Balaguruswami, “ Programming with Java a Primer”, 3
rd Edition, Tata
McGraw-Hill, 2008
2. Andy Harris, “ Java 2-Fast and Easy Web development”, Prentice-Hall
3. Peter Rossbach & Hendrisk Schereiber, “Java – Server And Servlets”, Person
Education
4. Vivek Sharma & Rajiv Sharma, “Developing E-commerce Sites” Person
Education
5. Matt J Crouch , “Web Programming Wuith ASP”, Person Education
ELECTIVE-I
IT5B10B: .NET TECHNOLOGY Unit – 1 :( 10 Hours) Basic of the net framework: .net architecture, Managed code, Assemblies, Execution of
assembler code, .net framework class library, common type system, common language
specification, interoperability with unmanaged code.
Unit – II: (12 Hours) Introducing ASP.NET: Creating Web Forms, Adding ASP.NET Code to a page Handling
page events, Discussion: ASP vs. ASP.NET: working model of architecture of server
controls, Add an HTML server control to a page, Access the properties and methods of
server controls in code, Add event handlers for page events, Use the IsPostback property
to handle postback forms, Using Web Controls: Web controls, using intrinsic Controls,
Using input Validation controls, selecting controls for Applications. Bind two controls
together
Unit –III: (12 Hours) Using Microsoft ADO.NET to Access Data: Overview of ADO.NET. Connecting to a
Data Source. Accessing Data with DataReaders. Binding to Extensible Markup
language (XML) Data.
Unit – 1V: (10 Hours) Separating Code from Content: Advantages of Partitioning as ASP.NET page. Creating
and Using Code-Behind. Creating and Using User Controls. Creating and Using
components.
Unit – V: (10 Hours) Using Trace in Microsoft ASP.NET Pages: Overview of Tracing. Trace information.
Page-Level Trace. Application, Level Trace.
REFERENCES E. G.Buczek, “ ASP.NET Developers Guide”, TMH 2002
F. Richard Anderson, “Professional ASP.NET”, Wrox Press Ltd.
G. “.NET Framework Essentials”. 3rd
Edition (O’Reilly)
H. Sams, “ Teach yourself ASP”, Lupez
T5B11: MINI PROJECT
Group project: A group contains at most three students.
IT6B12: COMPUTER NETWORKS & ADMINISTRATION
Unit – 1: (8 Hours) Introduction & TCP/IP : TCP/IP Architecture. Transport Layer : TCP, UDP and SCTP,
Port Numbers, Standard Internet Services, Protocol usage by Common Internet
application.
Unit – II : (10 Hours) Elementary Sockets : Sockets, TCP Sockets, TCP Client/Server.
Unit –III : (12 Hours) Elementary Sockets : UDP, SCTP, SCTP Client/Server. Domain Name System
Unit – 1V : (12 Hours) Advanced Sockets : Ipv4 & Ipv6 Interoperability, Advanced I/O functions
Unit – V : (12 Hours)
Advanced Sockets : Unix Domain Protocol, Nonblocking I/O, Routing Sockets, Key
management Sockets.
REFERENCES
1. W. R. Stevens, B Fenner, A.M. Rudoff ,“ UNIX Network Programming, The
Sockets Networking API”, 3rd
Edition, PHI 2007
2. W.R.Stevens. “Unix Network Programming” PHI 1998
3. J.Martin. “TCP/IP Networking – Architecture, Administration and programming”
Prentice Hall 1994
4. D.E.Comer. “Internetworking with TCP/IP. Vol 1, Vol. 2, Vol. 3, Principles,
Protocols and architecture PHI 2000
5. Feit “TCP/IP”. Mc Graw Hill 1996
6. Stevens “TCP/IP Illustrated” Vol.1-3 Addison Wesley 1998
IT6B13: OPERATING SYSTEM
Unit – 1: (10 Hours) Basic features of OS, I/O devices, Single user and multi-user OS, I/O utilities,
Multitasking OS, Various parts of OS, Loading of OS, Boot strapping, Different types
of OS, Shell, File system, Software tools, Program translation sequence, Compilers &
interpreters, Linkers, Loaders, Assemblers, Fundamentals of DOS and Windows.
Unit – II: (10 Hours) Process concept, Process scheduling, Types of schedulers, Scheduling and performance
criteria, Scheduling algorithms, Inter process communication and synchronization basic
concepts, Mutual exclusion, Semaphores, Critical section, Dead locks
Unit –III: (10 Hours) Single process monitor, Multi-programming with fixed partitions and dynamic partitions,
Paging, Hardware support for paging, Address translation by associative memory sharing
system, Segmentation, Virtual memory, Demand paging with virtual memory
management.
Unit – 1V: (10 Hours) File concept, Directories, Disk organization, Disk space management methods, Linked
list, Bit map, Disk allocation methods, Contiguous allocation, Non-contiguous allocation,
Disk scheduling, Different scheduling algorithms, File protection, Passwords access
groups.
Unit – V: (10 Hours) Case Study (Unix) : Basic commands, Permissions, Piping, Directory management, The
shell, Background process, File system, Terminals, Devises, Shell history, Vi editor,
Basic operations., Mail, Shell programming, Simple Network Management Protocols,
System calls, Sockets and IPC, System administration.
REFERENCES 1. Deitel, “Operating systems” , Addision Wesly
2. Andrew S Tanenbaum, “Operating Systems”, Prentice Hall
3. Vickery, “Unix Shell Programming”, Addison Wesly
ELECTIVE-II
IT6B14A: MOBILE COMPUTING
UNIT I: (10 Hours) Introduction: Wireless transmission, Frequencies for radio transmission, Signals,
Antennas, Signal Propagation, Multiplexing, Modulations, Spread spectrum, MAC,
SDMA, FDMA, TDMA, CDMA, Cellular Wireless Networks.
Unit II:(12 Hours) Telecommunication systems: GSM, GPRS, DECT, UMTS, IMT-2000, Satellite
Networks, Basics, Parameters and Configurations, Capacity Allocation, FAMA and
DAMA, Broadcast Systems, DAB, DVB.
Unit III: (12 Hours) Wireless LAN: IEEE 802.11, Architecture, Services, MAC, Physical layer, IEEE
802.11a - 802.11b standards, HIPERLAN, Blue Tooth.
Unit IV: (10 Hours) Mobile IP,Dynamic Host Configuration Protocol, Routing, DSDV, DSR, Alternative
Metrics.
Unit V: (10 Hours)
Traditional TCP, Classical TCP improvements, WAP, WAP 2.0.
REFERENCES
1. Jochen Schiller, “Mobile Communications”, 2/e,PHI/Pearson Education, 2003.
2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson
Education, 2002.
3. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”,
PHI/Pearson Education, 2003.
4. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober,
“Principles of Mobile Computing”, Springer, New York, 2003.
5. Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons
Ltd, 2002.
IT6B16: PROJECT
Individual project
FIRST SEMESTER COMPLIMENTARY
Suggested Course Title- ITICO2 Computer Fundamentals and organization
Semester-I
Credits-3
Prerequisite- Plus two level knowledge
Hours for Theory/Week-4Hrs
Total Working Hours-50 Hrs,
Unit I -10Hrs
Number systems- Non-positional number systems and positional number systems
(binary, octal and Hexadecimal), Converting from one number system to another-
decimal to a new base, converting to decimal from another bases, converting from base
other than ten to base other tan ten, short cut method for converting from binary to Octal,
octal to Binary, binary to Hexadecimal, and Hexadecimal to Binary, Computer Codes
(BCD, EBCDIC, ASCII), error detecting and correcting codes, parity bit, Hamming
Code, computer arithmetic ,importance of binary, Binary addition and subtraction.
Unit II –10 Hrs Boolean Algebra and Logic circuits- fundamental concepts of Boolean Algebra,
postulates, Principle of duality, theorems of Boolean Algebra, Boolean functions,
minimization, complement, canonicals forms, conversion between canonical forms.
Logic Gates. AND, OR, NOT, NAND, NOR, XOR and XNOR, logic circuits, converting
expression to logic circuit, universal NAND and NOR gates, Exclusive OR and
equivalence functions, Design of Combinational circuits (Half Adder, Subtract or and full
adder)
Unit III –10 Hrs Basic Computer Organization-input Unit, Output Unit, Storage Unit (Direct,
sequential and Random Access), CPU organization, Control Unit (micro programmed
and hardwired control), primary storage, memory hierarchy, storage locations and
addresses, storage capacity, bit, byte, nibble, RAM, ROM, PROM and EPROM, cache
memory, registers. Secondary storage devices (Magnetic tape, Hard disk and CD drive)
Unit IV –10 Hrs
I/O devices- Input Devices-identification and its use, keyboard, pointing
devices (mouse. Touch pad and track ball), Video digitizer, remote control,
joystick, magnetic stripes, scanner, digital camera, microphone, sensor, and MIDI
instruments, Output Devices- identification and its use, monitor, printer (laser, ink
jet, Dot-Matrix), plotter, speaker, control devices (lights, buzzers, robotic arms,
and motors
Unit V – 10 Hrs
Planning a Computer program- purpose of programming planning,
algorithm, flowchart- symbols, sample flowchart, advantages and limitations
Text book
1.Computer Fundamentals by P.K Sinha
Reference book
•••• An introduction to Digital Computer design by V. Rajaraman and T.
Radhakrishnan
•••• Computer fundamentals by B. Ram
