UNIVERSITY OF CALICUT

Transcription

1 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., Read: 1. U.O.No.GAI/J2/3601/08 Vol.II dated Minutes of the meeting of the Board of Studies in Computer Science and Applications held on Item No.2 (xxii) of the minutes of the meeting of Faculty of Science held on Item No.II-A-23 of the minutes of meeting of the Academic Council of 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 1 st 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 endorsed the minutes of Board of Studies and the Academic Council held on 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. To Sd/- DEPUTY REGISTRAR (G&A I) For REGISTRAR. 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

2 UNIVERSITY OF CALICUT B.Sc (IT) Programme Syllabi 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 Th eo ry Lab T ot al Credit s 1 IT1A01 Communication Skills in English IT1A02 Critical Reasoning, Writing And Presentation I Se m es te r 3 IT1A03 Literature in Malayalam /Hindi/Other Indian/World Languages other than English IT1B01 Programming in C IT1B02 Programming Language C Lab-I IT1C01 Mathematics I

3 Optional Complimentary I IT1C02 or or Optional Complimentary with Lab Total (7 Courses) 20 8 IT2A04 Reading Literature In English II Se m es te r 9 IT2A05 Reading Prose IT2A06 Communication Skills in Languages other than English IT2B03 Computer Graphics & Animation

4 12 IT2C03 Probability & Statistics Optional Complimentary I IT2C04 or or Optional Complimentary with Lab Total (7 Courses) IT3A07 History And Philosophy of science IT3A08 Basics of Business Management III Se m es te r 16 IT3B04 Theory of Computation IT3B05 Data structures and Algorithams IT3C05 Discrete Mathematics & Number Theory IT3C06 Micro Controllers and Integrated Circuits Total (6 Courses) 25 20

5 20 IT4A09 Basic Numerical Skills IT4A10 Entrepreneurship Development IT4B06 OOPS & C IV Se m es te r 23 IT4B07 Programming Laboratory Data structures using C IT4C07 Numerical Methods & Operation Research IT4C08 Digital Signal Processing Total (6 Courses) IT5B08 Data Communication IT5B09 Software Engineering V Se m es te r 28 IT5B10 Data Base Management System IT5B11 Programming in Java IT5D01 Choose one course from Open Course I IT5B12 Mini Project Work _ Total (7 Courses) VI Se m es te r 32 IT6B13 Computer Networks & Administration IT6B14 Operating Systems

6 34 IT6B15 Mobile Computing IT6B16.NET Technology IT6D02 Choose one course from Open Course II IT6B17 Project Work Total (7 Courses) 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) Six Short Answer Questions to be answered in one or two sentences

7 Six Short Essays to be answered in 50 words each. Only four questions (best four) will be considered for weightage = Three Long Essays to be answered in 100 words each. Only two questions (best two) will be considered for weightage = 8 35 Total Weightage 27

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

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

10 IT2B03: COMPUTER GRAPHICS & ANIMATION Course Number: 11 Contact Hours: 3 T + 2 L Number of Credits: 4 Number of Contact Hours: 55 Hrs 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

11 1. D.Hearn & M.P.Becker, Computer graphics ; 2 nd Ed., Prentice Hall India Foley Vandam & Hughes, Computer Graphics ; Addision Wesly 3. Angel Edward., Interactive Computer Graphics A Top-down Approach with OpenGL,Addison-Wesley Newmann W and Sproull R.F., Principles of Interactive Computer Graphics, McGraw-Hill, 1980

12 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. 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. Pushdown Automata: Basic definitions, Acceptance by pda, Pushdown automata and context free languages. Unit V: (12 Hours)

13 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,3 rd Edition, Prentice Hall, H.R.Lewis and C.H.Papadimitriou, Elements of the Theory of Computation, Prentice Hall of India, Linz: P. An Introduction to Formal Languages and Automata, Narosa, Hoporoft J.E.and Ullman J.D., Introduction to Automata Theory Languages and Computation, Narosa, 1981

14 IT3B05: DATA STRUCTURES & ALGORITHMS Course Number: 17 Contact Hours: 5 T Number of Credits: 3 Number of Contact Hours: 55 Hrs 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 :( 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. 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.

15 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, E.Horowitz, S Sahni & D Mehta, Fundamentals of Data Structures in C++,1 st Edition, Galgotia, S Sahni, Data Structures, Algorithms, and Applications in C++, International Edition, McGraw Hill, Wirth N, Algorithms + Data Structures = Programs, Prentice Hall International, 2001.

16 Course Number: 22 Contact Hours: 4 T IT4B06: OBJECT ORIENTED PROGRAMMING & C++ Number of Credits: 3 Number of Contact Hours: 55 Hrs Unit 1: (9 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)

17 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, E Balaguruswami, Object Oriented Programming with C++, 2 nd Edition, TataMcGraw-Hill, Stanly B lippman, The C++ Primer,Addison Wesly 4. Cohoon & Davidson, C++ Program Design, Tata McGraw-Hill

18 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

19 14. Prepare list of students details using linked list data structure. REFERENCES 1. Seymour Lipschutz, Theory and Problems of Data Structures, International Edition, E.Horowitz, S Sahni & D Mehta, Fundamentals of Data Structures in C++,1 st Edition, Galgotia, Yashavant P.Kanetker, Data Structures Through C++, 1 st Edition, BPB Publications, K R Venugopa, Ravikumar, T Ravisankar, Mastering C++, 19 th Reprint, TataMcGraw-Hill, E Balaguruswami, Object Oriented Programming with C++, 2 nd Edition, TataMcGraw-Hill, 2002

20 IT5B08: DATA COMMUNICATION Course Number: 26 Contact Hours: 4 T Number of Credits: 3 Number of Contact Hours: 55 Hrs Unit 1: (10 Hours) Evolution of modern communication system-pstn-isdn-analog and digital signalscommon 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: (11 Hours) Overview-Network transmission media-connecting network devices-common physical topology-connecting a simple network-controlling data transmission-iso and OSI modelseven 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) Unit V: (12 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

21 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 Course Number: 27 IT5B09: SOFTWARE ENGINEERING Contact Hours: 4 T Number of Credits: 3 Number of Contact Hours: 55 Hrs Unit 1: (10 Hours) Introduction to software engineering computer based system engineering project management activities, project planning, activity organization, project scheduling. Unit II: (11 Hours) Requirements engineering requirements analysis system models requirements definition and specification software prototyping formal specification algebra specification model based specification. Unit III: (12 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.

22 Unit 1V: (12 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 1. Ian Sommerville, Software Engineering, 6/e, Pearson Education Asia, R.S.Pressman, Software Engineering, 4/e, MacGraw Hill, P.Jalote, An Integrated Approach to Software Engineering, Narosa, 1993

23 IT5B10: DATA BASE MANAGEMENT SYSTEMS Course Number: 28 Contact Hours: 4 T Number of Credits: 4 Number of Contact Hours: 55 Hrs 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 : (11 Hours) Distributed Databases and Client Sever Architecture: Concept, Transparency, Types of distributed databases, Distributed query processing. Object oriented databases: Object

24 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, 4 th Edition, Pearson Education, H.F. Korth, A Silberschatz and S. Sudarasan, Database System Concepts, Computer Science Series, McGraw-Hill, C.J.Date, An Introduction to Data Base Systems, Volume L Addison Wesley, Reading, MA, Database Management And Design Hansen & Hansen Prentice Hall of India.

25 IT5B11: PROGRAMMING IN JAVA Course Number: 29 Contact Hours: 3T + 2L Number of Credits: 3 Number of Contact Hours: 55 Hrs Unit 1: (11 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

26 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

27 IT5B12: MINI PROJECT Course Number: 31 Contact Hours: 3 L Number of Credits: 0 Group project: A group contains at most three students.

28 Course Number: 32 Contact Hours: 3 T IT6B13: COMPUTER NETWORKS & ADMINISTRATION Number of Credits: 3 Number of Contact Hours: 55 Hrs Unit 1: (9 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, 3 rd Edition, PHI W.R.Stevens. Unix Network Programming PHI 1998

29 3. J.Martin. TCP/IP Networking Architecture, Administration and programming Prentice Hall D.E.Comer. Internetworking with TCP/IP. Vol 1, Vol. 2, Vol. 3, Principles, Protocols and architecture PHI Feit TCP/IP. Mc Graw Hill Stevens TCP/IP Illustrated Vol.1-3 Addison Wesley 1998

30 IT6B14: OPERATING SYSTEM Course Number: 33 Contact Hours: 3 T Number of Credits: 3 NUMBER OF CONTACT HOURS: 55 HRS 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: (11 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: (12 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.

31 Unit V: (12 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

32 IT6B15: MOBILE COMPUTING Course Number: 34 Contact Hours: 3 T Number of Credits: 3 Number of Contact Hours: 55 Hrs 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 , Architecture, Services, MAC, Physical layer, IEEE a b 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, William Stallings, Wireless Communications and Networks, PHI/Pearson Education, 2002.

33 3. Kaveh Pahlavan, Prasanth Krishnamoorthy, Principles of Wireless Networks, PHI/Pearson Education, Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, Principles of Mobile Computing, Springer, New York, Hazysztof Wesolowshi, Mobile Communication Systems, John Wiley and Sons Ltd, 2002.

34 IT5B16:.NET TECHNOLOGY Course Number:35 Contact Hours: 4 T Number of Credits: 3 Number of Contact Hours: 55 Hrs 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: (11 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)

35 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 Richard Anderson, Professional ASP.NET, Wrox Press Ltd. 7..NET Framework Essentials. 3 rd Edition (O Reilly) 8. Sams, Teach yourself ASP, Lupez

36 IT6B17: PROJECT Course Number: 37 Contact Hours: 5 L Number of Credits: 8 Individual project