GENERAL AND ACADEMIC BRANCH – I ‘J’ SECTION O R D … · · 2010-02-02Lab T ot al I Se m es...

UNIVERSITY OF CALICUT

(Abstract)

B.Sc. programme in Information Technology - under Choice based Credit Semester System - Scheme and

Syllabus – implemented with effect from 2009 admission onwards – approved – Orders issued.

-------------------------------------------------------------------------------------------------------------------------------

GENERAL AND ACADEMIC BRANCH – I ‘J’ SECTION

No. GA I/J1/2471/06 Dated, Calicut University. P.O., 29.06.2009. -------------------------------------------------------------------------------------------------------------------------------

Read: 1. U.O.No.GAI/J2/3601/08 Vol.II dated 19.06.2009.

2. Minutes of the meeting of the Board of Studies in Computer Science

and Applications held on 02.05.2009.

3. Item No.2 (xxii) of the minutes of the meeting of Faculty of

Science held on 05.05.2009.

4. Item No.II-A-23 of the minutes of meeting of the Academic Council of

14.05.2009.

O R D E R

Choice based Credit Semester System and Grading has been introduced for UG

curriculum in all affiliated colleges under this University with effect from 2009 admission

onwards and the Regulations for the same implemented vide paper cited 1st above.

As per paper read as (2) above, the Board of Studies has resolved to approve the scheme

and Syllabus of B.Sc. programme in Information Technology under Choice based Credit

Semester System.

As per paper read as (3) & (4) above, the Faculty of Science at its meeting held on

05.05.2009 endorsed the minutes of Board of Studies and the Academic Council held on

14.05.2009 approved the same.

Sanction has therefore been accorded to implement the Scheme and Syllabus of B.Sc.

programme in Information Technology under Choice based Credit Semester System in this

University with effect from 2009 admission onwards.

Orders are issued accordingly. Scheme and Syllabus appended.

Sd/-

DEPUTY REGISTRAR (G&A I)

For REGISTRAR. To

The Principals of all affiliated Colleges

offering B.Sc. programme in Information Technology.

Copy to: C.E, EX Sn, EGI, DR, B.Sc

System Administrator (with a request to

upload in University website), Tabulation Sn.,

Enquiry/G&A-I F.Sn./SF/DF/FC.

Forwarded/By Order

SECTION OFFICER

UNIVERSITY OF CALICUTUNIVERSITY OF CALICUTUNIVERSITY OF CALICUTUNIVERSITY OF CALICUT

B.Sc (IT) ProgrammeB.Sc (IT) ProgrammeB.Sc (IT) ProgrammeB.Sc (IT) Programme

Syllabi for Core/Open CoursesSyllabi for Core/Open CoursesSyllabi for Core/Open CoursesSyllabi for Core/Open Courses

Programme Structure

Total Courses: 37

Total Credits: 120

Se

m

es

te

r

Cours

e No

Course Code Course Title

Contact Hours

Credit

s Th

eo

ry

Lab

T

ot

al

I

Se

m

es

te

r

1 IT1A01 Communication Skills in English 5 0 5 4

2 IT1A02 Critical Reasoning, Writing And Presentation 4 0 4 4

3 IT1A03 Literature in Malayalam /Hindi/Other Indian/World

Languages other than English 4 0 4 4

4 IT1B01 Programming in C 2 0 2 2

5 IT1B02 Programming Language C Lab-I 0 2 2 --

6 IT1C01 Mathematics I 4 0 4 3

7 IT1C02

Optional Complimentary I

or

Optional Complimentary with Lab

4

2

0

or

2

4

4

3

3

Total (7 Courses)

20

II

Se

m

es

te

r

8 IT2A04 Reading Literature In English 5 0 5 4

9 IT2A05 Reading Prose 4 0 4 4

10 IT2A06 Communication Skills in Languages other than English 4 0 4 4

11 IT2B03 Computer Graphics & Animation 3 2 5 3

12 IT2C03 Probability & Statistics 3 0 3 3

13 IT2C04

Optional Complimentary I

or

Optional Complimentary with Lab

4

2

0

or

2

4

4

3

3

Total (7 Courses)

25

21

III

Se

m

es

te

r

14 IT3A07 History And Philosophy of science 4 0 4 4

15 IT3A08 Basics of Business Management 4 0 4 4

16 IT3B04 Theory of Computation 4 0 4 3

17 IT3B05 Data structures and Algorithams 5 0 5 3

18 IT3C05 Discrete Mathematics & Number Theory 4 0 4 3

19 IT3C06 Micro Controllers and Integrated Circuits

4

0

4

3

Total (6 Courses)

25 20

IV

Se

m

es

te

r

20 IT4A09 Basic Numerical Skills 4 0 4 4

21 IT4A10 Entrepreneurship Development 4 0 4 4

22 IT4B06 OOPS & C++

4 0 4 3

23 IT4B07 Programming Laboratory – Data structures using C++

0 5 5 3

24 IT4C07 Numerical Methods & Operation Research 4 0 4 3

25 IT4C08 Digital Signal Processing 4 0 4 3

Total (6 Courses)

25 20

V

Se

m

es

te

r

26 IT5B08 Data Communication 4 0 4 3

27 IT5B09 Software Engineering 4 0 4 3

28 IT5B10 Data Base Management System 4 0 4 4

29 IT5B11 Programming in Java 3 2 5 3

30 IT5D01 Choose one course from Open Course I 3 2 5 3

31 IT5B12 Mini Project Work 0 3 3 _

Total (7 Courses) 25 16

VI

Se

m

es

te

r

32 IT6B13 Computer Networks & Administration 3 0 3 3

33 IT6B14 Operating

Systems 3 0 3 3

34 IT6B15 Mobile Computing 3 0 3 3

35 IT6B16 .NET Technology 4 0 4 3

36 IT6D02 Choose one course from Open Course II 3 2 5 3

37 IT6B17 Project Work 0 5 5 8

Total (7 Courses) 25 23

Total 37 Courses and 120 Credits

Open Course - I

IT5D01A – Web Programming

IT5D01B– .Software Testing

IT5D01C– Grid Computing

IT5D01D– Stimulation in Modeling

Open Course - II

IT6D02A – Cryptography and Networks Security

IT6D02B– Linux Administration

IT6D02C– Image Processing

Question Paper Scheme

Type of Questions Question Numbers Weightage

Twenty multiple choice objective questions

(4 choices for each question)

1 - 4 1

5 - 8 1

9 - 12 1

13 - 16 1

17 - 20 1

Six Short Answer Questions to be answered in one or two sentences 21 1

22 1

23 1

24 1

25 1

26 1

Six Short Essays to be answered in 50 words each. Only four questions (best four) will

be considered for weightage.

27

4×2 = 8

28

29

30

31

32

Three Long Essays to be answered in 100 words each. Only two questions (best two)

will be considered for weightage.

33

2×4 = 8 34

35

Total Weightage 27

IT1B01: PROGRAMMING IN C

Course Number: 4

Contact Hours: 2 T

Number of Credits: 2

Number of Contact Hours: 55 Hrs

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”.

IT2B03: COMPUTER GRAPHICS & ANIMATION

Course Number: 11

Contact Hours: 3 T + 2 L



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

IT3B04: THEORY OF COMPUTATION

Course Number: 16

Contact Hours: 4T

Number of Credits:3

Number of Contact Hours: 55Hrs

Unit – 1: (11 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.


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.


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. Pushdown

Automata: Basic definitions, Acceptance by pda, Pushdown automata and context – free

languages.


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.

REFERENCES

1. KLP Mishra & N Chandrasekaran, “Theory of Computer Science”,3rd

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

IT3B05: DATA STRUCTURES & ALGORITHMS

Course Number: 17

Contact Hours: 5 T




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.


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 :( 13Hours)

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.


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.


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.

IT4B06: OBJECT ORIENTED PROGRAMMING & C++

Course Number: 22

Contact Hours: 4 T




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.


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.


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.


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.


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++”, 19th

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

IT4B07: PROGRAMMING LABORATORY

DATA STRUCTURES USING C++

Course Number: 23

Contact Hours: 5 L

Number of Credits:3

MENU DRIVEN C++ PROGRAMS USING CLASS

1. Data structure operation using Array and Linked list

2. Stack and Queue using Array and Linked list.

3. Dequeue using Array and Linked list.

4. Polynomial Operations on Two Polynomials: Addition, Subtraction, Multiplication

using Arrays and Linked lists.

5. String operations

6. Stack Application: Expression evaluation.

7. Sorted linked list

8. Doubly linked list.

9. Circular linked list and Circular Doubly linked list.

10. Operator Overloading: +,-,+=,-=,>>,<<.

11. Sorting: Bubble, Insertion, Selection, Quick, Merge, Heap

12. Searching : Linear, Binary

13. Binary Search Tree

14. 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

IT5B08: DATA COMMUNICATION

Course Number: 26

Contact Hours: 4 T




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


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: (12Hours)

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)


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

IT5B09: SOFTWARE ENGINEERING

Course Number: 27

Contact Hours: 4 T




Introduction to software engineering – computer based system engineering – project

management – activities, project planning, activity organization, project scheduling.


Requirements engineering – requirements analysis – system models – requirements definition

and specification – software prototyping – formal specification – algebra specification – model –

based specification.


Software design-architectural design – object oriented design – function oriented design

– real – time systems design – user interface design – software reliability – programming

for reliability – software reuse.


Verification and validation – defect testing – static verification – managing people –

software cost estimation – quality management – process improvement.


CASE classification – integrated CASE – the CASE life cycle – CASE workbenches –

programming workbenches – meta – CASE workbenches – software engineering

environments.

REFERENCES

1. Ian Sommerville, Software Engineering, 6/e, Pearson Education Asia, 2001.

2. R.S.Pressman, Software Engineering, 4/e, MacGraw Hill, 1997.

3. P.Jalote, An Integrated Approach to Software Engineering, Narosa, 1993

IT5B10: DATA BASE MANAGEMENT SYSTEMS

Course Number: 28

Contact Hours: 4 T




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.


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 : (11 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

1. R Elmasri, S B Navathe, D V L N Somayajulu, S K Gupta, “Fundamentals of

Database Systems”, 4th

Edition, Pearson Education, 2007.

2. H.F. Korth, A Silberschatz and S. Sudarasan, “Database System Concepts”,

Computer Science Series, McGraw-Hill, 1997

3. C.J.Date, “An Introduction to Data Base Systems,” Volume L Addison Wesley,

Reading, MA, 1990

4. Database Management And Design – Hansen & Hansen – Prentice Hall of India.

IT5B11: PROGRAMMING IN JAVA

Course Number: 29

Contact Hours: 3T + 2L




Fundamentals of Object Oriented Programming. Evolution : Features, Environment, JFC.

Constants, Variables & Data Types.


Operators and Expressions. Decision Making : Branching, Looping


Classes, Objects and Methods. Arrays, Strings and Vectors. Interfaces. Packages. Multi

threaded Programming. Exceptions.

Unit – 1V:(10 Hours)

Applet Programming. Graphic Programming.


Managing Input/Output files. Java Collection. JDBC. Concepts of J2EE

REFERENCES

1. E. Balaguruswami, “ Programming with Java a Primer”, 3rd

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

IT5B12: MINI PROJECT

Course Number: 31

Contact Hours: 3 L


Group project: A group contains at most three students.

IT6B13: COMPUTER NETWORKS & ADMINISTRATION

Course Number: 32

Contact Hours: 3 T




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

IT6B14: OPERATING SYSTEM

Course Number: 33

Contact Hours: 3 T


NUMBER OF CONTACT HOURS: 55 HRS


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.


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


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.


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.


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

IT6B15: MOBILE COMPUTING

Course Number: 34

Contact Hours: 3 T



UNIT I: (11 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.

IT5B16: .NET TECHNOLOGY

Course Number:35

Contact Hours: 4 T




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.


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


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.


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.


Using Trace in Microsoft ASP.NET Pages: Overview of Tracing. Trace information. Page-

Level Trace. Application, Level Trace.

REFERENCES

5. G.Buczek, “ ASP.NET Developers Guide”, TMH 2002

6. Richard Anderson, “Professional ASP.NET”, Wrox Press Ltd.

7. “.NET Framework Essentials”. 3rd

Edition (O’Reilly)

8. Sams, “ Teach yourself ASP”, Lupez

IT6B17: PROJECT

Course Number: 37

Contact Hours: 5 L


Individual project

GENERAL AND ACADEMIC BRANCH – I ‘J’ SECTION O R D … · · 2010-02-02Lab T ot al I Se m es...

Documents

Transcript of GENERAL AND ACADEMIC BRANCH – I ‘J’ SECTION O R D … · · 2010-02-02Lab T ot al I Se m es...