You are on page 1of 22

6th Semester

Course Title Course Code Computer Network CE601 Lecture Practical Course Credit Tutorial Total Course Objective
    To understand how a computer network functions. To understand detail working of protocols at data link layer, network layer and transport layer. To get basic knowledge of functions of various application layer protocols. To learn how to configure networking on linux operating systems. Labs should be focused on configuring static routing, FTP, SSH, proxy server, apache server, NFS, Samba Server, DNS, Mail server etc on Linux Operating System.

: 04 : 01 : 00 : 05

Detailed Syllabus
Sr. No. Name of chapter & details Hours Allotted

Section – I Introduction: 1 Data Communications, Networks: Distributed Processing, Network Criteria, Physical Structures, Network Models, Categories of Networks, Internetworks, Internet: it’s history and present status, Protocols and Standards, Applications of Computer Networks Network Models: 2 Layered Tasks, OSI Model, TCP/IP Protocol Suite, Addressing. 03 03

Physical Layer : Study of Basic Terminologies of Analog and digital transmission: Amplitude, phase, wavelength, bandwidth, bit rate, bit length, attenuation, distortion, noise. Data Rate Limits: Nyquist and Shannon’s Criteria. Performance: Throughput, Latency, Bandwidth-delay product, Jitter. Multiplexing: Frequency Division Multiplexing, Time Division Multiplexing. Transmission Media: Guided Media, Unguided Media. Switching: Circuit-switching, Packet Switching and Virtual Circuits. Telephone Network, Dial-Up Modems, Digital Subscriber Line. Data Link Layer: 4 Error Correction and Detection: Introduction, Block Coding, Linear Block Codes, Cyclic Codes, Checksum. Data Link Control: Framing, Flow and Error Control, Protocols for Noiseless and Noisy Channels, HDLC, Point-to-Point Protocol Section – II Medium Access Control and Ethernet: Random Access: CSMA, CSMA/CD,CSMA/CA. Controlled Access: Reservation, Polling and Token Passing. Channelization: FDMA, TDMA and CDMA. Ethernet: IEEE standards, Standard Ethernet, Bridged Ethernet, Switched Ethernet, Full-Duplex Ethernet, Fast Ethernet, Gigabit Ethernet Connecting LANs: 7 Connecting Devices: Passive Hubs, Repeaters, Active Hubs, Bridges, Twolayer and Thee Layer Switches, Routers, Gateway. Backbone Networks, Virtual LANs. Network Layer: Logical Addressing: IPv4 Addresses, IPv6 Addresses. Internet Protocol: Internetworking, Packet formats of IPv4 and IPv6, Comparison between IPv4 and IPv6, Transition from IPv4 to IPv6. Overview of network Layer Protocols: ARP, RARP, ICMP, IGMP. Delivery, Forwarding and Routing: Delivery, Forwarding, Unicast Routing Protocols. 02 12

3

10

6

06

8

10

Transport Layer Protocols: 9 Process to Process Delivery, UDP : Well-known ports of UDP, UDP Header, Checksum, UDP Operation. TCP: TCP Services, TCP Features, TCP Segments, TCP Connection Establishment and Release, Flow Control, Error Control and Congestion Control. Application Layer: 10 Brief study of various application layer protocols: DNS, TELNET,FTP, SMTP, POP, IMAP, HTTP, SNMP. 02 08

Instructional Method and Pedagogy    Lectures will be conducted with the aid of multi-media projector, black board, or model. Assignments based on course content will be given to the students at the end of each unit/topic and will be evaluated at regular interval. The course includes tutorials, where students have an opportunity to practice the examples for the concepts being taught in lectures.

Students Learning Outcomes
At the end of this course, students will be able:

 

To learn how packet transfer takes place from source to destination. To learn How LANs and Internet work.

Text books  Behrouz A Forouzan, Data Communication and Networking, Fourth Edition, TMH.

Reference Books  Andrew S Tannenbaum, Computer Networks, Fourth Edition, PHI.  Behrouz A Forouzan, TCP/IP Protocol Suite, Third Edition,TMH.  Peterson & Davie, Computer Networks – A systems approach, Third Edition,Morgan Kaufmann  Ross & Kurose, Computer Networking: A top-down approach, Third Edition Pearson Education  Keshav, An engineering approach to computer networking, First Edition, Pearson Eduction. Additional Resources  NPTEL Lecture Series

Course Title Course Code

.NET Technologies CE602 Lecture Practical : 04 : 01 : 00 : 05

Course Credit Tutorial Total Course Objective
The objectives of the course are..  To learn about development of dynamic professional .net applications.  To learn about object oriented programming concepts using C# language.  To learn to build console and window based applications.

Detailed Syllabus
Sr. No. Name of chapter & details Hours Allotted

Section – I Introduction 1 .net Architecture – CLS – CLR – Intermediate Language – Jitters Assemblies - .net Framework classes Core C# 2 Fundamentals – Variables – Data Types – Flow Control – Enumerators – Namespaces – Preprocessor Directives – Arrays Object Oriented Programming with C# 3 Classes – Objects – Inheritance – Interfaces – Generics – Operators and Casts Section – II 4 Explore C# Delegates – Lambdas - Events – String – Regular Expressions – Collection – LINQ – Reflection – Exceptions 10 10 13 05

5

Window Programming

08

Basics – Controls - Menus and Context Menus - MenuStrip ToolbarStrip - Graphics and GDI - SDI and MDI Applications – Dialogbox
6 ADO.Net Architecture – Dataset – DataAdapter – Command – DataReader – Data bound Controls 10

Instructional Method and Pedagogy    Lectures will be conducted with the aid of multi-media projector, black board, or model. Assignments based on course content will be given to the students at the end of each unit/topic and will be evaluated at regular interval. The course includes tutorials, where students have an opportunity to practice the examples for the concepts being taught in lectures.

Students Learning Outcomes
At the end of this course, the students will be able to:  Design and develop professional console and window based .net applications.

Text books    Beginning C# 2010, Wrox Publication Professional C# 2010, Wrox Publication Professional C# 2012 and .net 4.5, Wrox Publication

Additional Resources
  http://www.w3schools.com http://www.msdn.microsoft.com

Course Title Course Code

Design and Analysis of Algorithms CE603 Lecture Practical : 04 : 01 : 00 : 05

Course Credit Tutorial Total Course Objective
 To introduce the basic concepts of algorithm analysis.  To introduce the design paradigms for algorithm design.  To introduce the basic complexity theory.

Detailed Syllabus
Sr. No. Name of chapter & details Hours Allotted

Section – I Introduction: Introduction: What is an Algorithm?, Fundamentals of Algorithmic Problem Solving, Important Problem Types, Fundamental Data Structures, Correctness of Algorithm, RAM Model, Analysis of algorithm. Mathematical Analysis of Non-recursive Algorithm - Mathematical Analysis of Recursive Algorithm - Example: Fibonacci Numbers, Sum of 1 to N, etc. Growth of Functions: 2 Introduction - Notion of Algorithm - Fundamentals of Algorithmic Solving , Asymptotic Notation, Bounding Functions, Operations on O-Notations, Analysis of Algorithms 3 Bubble Sort, Insertion Sort, Selection Sort, Linear Search, Binary Search, Bucket Sort, Maximum and minimum 06 04

1

05

Recurrences: 4 Introduction, Homogeneous Recurrence, Inhomogeneous Recurrence, Change of variable, substitution methods, Range Transformation, Recurrence Tree. Divide & Conquer 5 Introduction, Multiplication of two large integers, Merge Sort, Quick Sort, Strassen’s Matrix Multiplication Section – II Greedy Methods 6 Introduction, Characteristics, Basic structure of greedy algorithm, Knapsack problem, activity selection problem, task scheduling algorithm. Dynamic Programming 7 Introduction, LCS, Knapsack (0/1 & Fractional), Chain Matrix Multiplication, Activity Selection Problem Elementary Graph algorithms 8 Introduction to Graph, Graph Representation Techniques, Operation on Graph (BFS, DFS), Minimum Spanning Tree (Kruskal, Prims), Single source shortest path algorithms, All pair shortest path algorithm, Backtracking: General Method – 8 Queens problem. P and NP Class, some NP – complete problems. 10 08 06 06 07

9

04

Instructional Method and Pedagogy    Lectures will be conducted with the aid of multi-media projector, black board, or model. Assignments based on course content will be given to the students at the end of each unit/topic and will be evaluated at regular interval. The course includes tutorials, where students have an opportunity to practice the examples for the concepts being taught in lectures.

Students Learning Outcomes

At the end of this course, students will be able:

  

To analyze the different algorithms To design algorithm with different paradigm To implement algorithm in efficient manner.

Text books  Thomas H. Cormen, Charles E. Leiserson, R.L. Rivest.. Algorithms, Third Edition, Prentice Hall of India Publications, New-Delhi. Reference Books  Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++, Second Edition, Universities Press, 2007. (For Units II to V)  Bressard, Fundamentals of Algorithms, First Edition, PHI  Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman..The Design and Analysis of Computer Algorithms, First Edition, Pearson Education. Additional Resources  NPTEL Lecture Series

Course Title Course Code

Object Oriented Analysis & Design CE604 Lecture Practical : 04 : 01 : 00 : 05

Course Credit Tutorial Total Course Objective
The objectives of the course are:  To introduce object oriented modeling of software project development.  To learn various UML diagrams.

Detailed Syllabus
Sr. No. Name of chapter & details Hours Allotted

Section – I Introduction: 1 About Object Orientated Technology, Development and OO Modeling History. Modeling Concepts: 2 Modeling design Technique, Three models, Class Model, State model and Interaction model. Class Modeling: Object and class concepts, link and association, Generalization and 3 Inheritance, Advanced class modeling- aggregation, Abstract class metadata, constraints. State Modeling: 4 Event, state, Transition and conditions, state diagram, state diagram behavior, concurrency, Relation of Class and State models. 08 08 08 04

Section – II Interaction Modeling: 5 Use case Models, sequence models, activity models Analysis and Design: 6 Development Life cycle, Development stages, Domain Analysis-Domain class model, domain state model, domain interaction model, Iterating and analysis. Application Interaction model, Application class model, Application state Model, Adding operation. System Design: Estimating Performance, Making a reuse plan, breaking system into 7 subsystems ,identifying concurrency, allocation of subsystems, management of data storage, Handling Global resources, choosing a software control strategy, Handling boundary condition, common Architectural style. Class design: 8 Overview of class design ,designing algorithms, recursing downward, refactoring, design optimization, Adjustment of Inheritance, Reification of Behavior. 08 08 08 04

Instructional Method and Pedagogy:    Lectures will be conducted with the aid of multi-media projector, black board, or model. Assignments based on course content will be given to the students at the end of each unit/topic and will be evaluated at regular interval. The course includes tutorials, where students have an opportunity to practice the examples for the concepts being taught in lectures.

Students Learning Outcomes

On the completion of the course, students will be able:  To Perform object-oriented analysis and design.  To Follow a software development process using an OO software project.  To Use the widely adopted graphical modeling language - the Unified Modeling Language (UML) advance version.  To Manage complexity of artifacts; describe the problem and propose solution.  To Understand patterns and frameworks that can facilitate building more flexible and re-usable software components. Text book
 James Rambaugh, Object-Oriented Modeling and Design with UML, Second Edition, PHI

Reference Books
  Grady Booch, Object-Oriented Analysis and Design with Applications, Third Edition, Addison Wesley Simon Bennett, Object-Oriented Systems Analysis and Design Using UML, Second Edition,TMH

Craig Larman, Applying UML and Patterns: An Introduction to object-oriented Analysis, Design and Iterative Development, Third Edition, PHI

Additional Resources  http://virtual-labs.ac.in/cse08/  http://www.onlinevirtualtutor.com/2011/01/08/cs2353-object-oriented-analysisand- design-syllabus/  http://en.wikipedia.org/wiki/Object-oriented_analysis_and_design

Course Title Course Code

Mini Project CE605 Lecture Practical : 00 : 00 : 01 : 01

Course Credit Tutorial Total Course Objective
    To strengthen the concepts learned in course on .NET Technology To develop a project using the concepts learnt in .NET Technology. To learn Project Development Life Cycle. To learn how to work in team.

Detailed Syllabus
The students will select a project definition. The project should involve use of knowledge earned in .Net Technology course offered in the same semester. At the end of semester, they will submit completely running project.

Instructional Method and Pedagogy   During lab sessions, instructor will help the students in selecting the project topic. And continuously monitor their progress Students will present their work periodically during the semester.

Students Learning Outcomes
  Students will have depth knowledge of .NET Technologies and Project Development Process. Ability to work in team would be developed.

Text books/Reference Books  No specific book recommended.

Course Title Course Code

Mainframes CE800 (Elective – I) Lectures Practical : 04 : 01 : 00 :05

Course Credit Tutorial Total Course Objective
To learn about basic of Mainframes technology. The course covers introduction to mainframes, COBOL programming, DB2 database and JCL (Job Control Language).

Detailed Syllabus
Sr. No. Name of chapter & details Hours Allotted

Section – I Evolution of Mainframe hardware: 1 Overview of Computer Architecture -Classification of Computers - micro, mini, mainframes and super computer - Mainframe computer - key features benefits - Evolution of Mainframes - Different hardware systems Mainframes OS and Terminology: 2 Operating systems on mainframes, Batch processing vs. online processing mainframe operating system. - evolution - concepts of Address space, Buffer management - Virtual storage - paging - swapping - Dataset management in mainframes z/OS and its features: Z-operating system (Z/OS) - Virtual storage - Paging process - storage Managers - Program execution modes - Address space - Multiple virtual system(MVS) , MVS address space, Z/OS address space - Dataset sequential and partial dataset - Direct access storage device(DASD) -Access methods - Record formats - Introduction to virtual storage access methods(VSAM) - Catalog – VTOC 06 05

3

08

Introduction to JCL: 4 Introduction to Job Control language - Job processing - structure of JCL statements - Various statements in JCL - JOB statement - EXEC statement DD statement - JCL procedures and IBM utility programs. Section – II COBOL Programming – I: Introduction – History, evolution and Features, COBOL program Structure, steps in executing COBOL. Language Fundamentals – Divisions, sections, paragraphs, sections, sentences and statements, character set, literals, words, figurative constants, rules for forming user defined words, COBOL coding sheet. Data division – Data names, level numbers, PIC and VALUE clause, REDEIFNES, RENAMES and USAGE clause. Procedure Division – Input / Output verbs, INITIALIZE verb, data movement verbs, arithmetic verbs, sequence control verbs. COBOL Programming – II File processing – Field, physical / logical records, file, file organization (sequential, indexed and relative) and access mode, FILE-CONTROL paragraph, FILE SECTION, file operations.File handling verbs – OPEN, READ, WRITE, REWRITE, CLOSE.Table processing – Definition, declaration, accessing elements, subscript and index, SET statement, SEARCH verb, SEARCH ALL verb, comparison. Miscellaneous verbs – COPY, CALL, SORT, MERGE, STRING, UNSTRING verbs. DB2 Programming: Introduction to DB2 – System Service component, Database Service component, Locking Service component, Distributed Data Facility Services component, Stored Procedure component, catalogs and optimizer. DB2 Objects and Data Types - DB2 Objects Hierarchy, Storage groups, Database, Table space, Table, Index, Clustered index, Synonyms and aliases, Views, Data Types. DB2 SQL programming – Types of SQL statements, DCL, DDL, DML, SPUFI utility.Embedded SQL programming – Host variable, DECLGEN utility, SQLCA, single/multiple row manipulation, cursors, scrollable cursors. 09

5

07

6

07

7

14

Instructional Method and Pedagogy    Lectures will be conducted with the aid of multi-media projector, black board, or model. Assignments based on course content will be given to the students at the end of each unit/topic and will be evaluated at regular interval. The course includes tutorials, where students have an opportunity to practice the examples for the concepts being taught in lectures.

Students Learning Outcomes
At the end of this course, students will be able:

   Books    

To understand concepts of Mainframes technology. To write COBOL programs and create DB2 databases To Use JCL to execute COBOL programs.

Zikopoulus and Melnyk, Complete Reference DB2, First Edition, TMH Publications Stern and Stern, Structured Cobol Programming, Eighth Edition, Wiley Publications Raul Menendez ,Murach’s OS/390 and Z/OS JCL, 2002, Murach. MVS JCL Reference: Available at : http://uits.arizona.edu/sites/default/files/JCLref17_0.pdf, as on 28/06/2013 [developed by IBM]

Other Resources  Selected Videos and Slides about Mainframes, JCL,COBOL and DB2 will be provided during class-room teaching.

Course Title Course Code

Theory of Computation CE801 (Elective-I)

Lecture Practical Course Credit Tutorial Total Course Objective

: 04 : 00 : 01 : 05

Computers play such an important part in our lives that formulating a “theory of computation” threatens to be a huge project. To narrow it down, we adopt an approach that seems a little old-fashioned in its simplicity but still allows us to think systematically about what computers do. Here is the way we will think about a computer: It receives some input, in the form of a string of characters; it performs some sort of “computation”; and it gives us some output. This course examines models of computation and the associated languages, from the most elementary to the most general.

Detailed Syllabus
Sr. No. Name of chapter & details Hours Allotted

Section – I Mathematical Tools and Techniques: 1 Logic and Proofs, Sets, Functions and Equivalence Relations, Languages, Recursive Definitions, Mathematical Induction 05

Finite Automata: 2 Definition of Finite Automata, Deterministic Finite Automata, Accepting the Union, Intersection, or Difference of Two Languages, Pumping lemma, Minimizing the Number of States in a Finite Automaton. Regular Expression, Non-determinism and Kleen’s theorem: 3 Regular Languages and Regular Expressions, Definition of Non-deterministic Finite Automata, Non-deterministic Finite Automata, NFA to DFA, Definition of /\-NFA, Kleen’s theorem, /\-NFA to DFA. CFG (Context Free Grammar): 4 Introduction To CFG, CFG: definition and example, Union and Concatenation of CFG, Derivations Of Trees And Ambiguity, Normal Forms And Simplified Forms. Section – II Pushdown Automata: 5 Introduction To PDA, Definition and Example, Deterministic Pushdown Automata, PDA from a Given CFG, CFG from a Given PDA, Parsing. Context-Free and Non-Context-Free Languages: 6 Introduction To CFL, The Pumping Lemma for Context-Free Languages, Intersections and Complements of CFLs, Decision Problems Involving Context-Free Languages Turing Machines: A General Model of Computation, Definition Of Turing 7 Machine, Turing Machines as Language Acceptors, Variations Of Tm, Non Deterministic Tm, Universal Tm and Church Turning Thesis, Recursively Enumerable and Recursive Language. Computable Functions, Undecidable Problems: 8 Primitive Recursive Functions, Quantification, Minimalization, and μ Recursive Functions, Gödel Numbering, Undecidable Problem, Reductions and the Halting Problem, Post’s Correspondence Problem 06 08 06 08 07 08 08

Instructional Method and Pedagogy


 

Lectures will be conducted with the aid of multi-media projector, black board, or model. Assignments based on course content will be given to the students at the end of each unit/topic and will be evaluated at regular interval. The course includes tutorials, where students have an opportunity to practice the examples for the concepts being taught in lectures

Students Learning Outcomes At the end of the course students will have knowledge of:  Theory and application of finite state machines and Context free grammar.  Different powerful computing models such as Push-down automata, Turing Machine and its applications.  Decidable and undecidable problems. Text book  John C. Martin, Introduction to Languages and Theory Of Computation, Fourth Edition, MGH. Reference Books  Hopcroft, Motwani, Automata Theory,Languages and Computation, Third Edition, Pearson Education  Rajendra Kumar,Theory of automata, Languages and computation, Third Edition, McGraHill  Bernard Moret,The Theory of Computation, First Edition, Pearson Education Additional Resources  NPTEL Lecture Series

Course Title Course Code

Mobile Computing CE802 (Elective-I) Lecture Practical : 04 : 01 : 00 : 05

Course Credit Tutorial Total Course Objective
  To learn working of Cellular technologies, Wireless LAN, Ad hoc and Sensor Networks. To learn android application development.

Detailed Syllabus
Sr. No. Name of chapter & details Hours Allotted

Section – I Introduction: 1 History and applications of wireless communications. Signal Propagation modes: Path loss, multi-path propagation. Overview of Multiplexing: Space Division, Frequency Divison, Code Division and Time Division. Overview of Modulation: ASK,FSK,PSK. Overview of Spread Spectrum: DSSS, FHSS. Global System for Mobile Communication (GSM): 2 Mobile Services, System Architecture, Radio Interface, Protocols, Localization and calling, Handover, Security, CDMA v/s. GSM. General Packet Radio Service (GPRS): Main Features, GPRS Architecture: Roles of GGSN, SGSN, HLR, VLR. GPRS Mobile Station (MS).GPRS transmission plane, GPRS signaling plane, Data transfer between MS and SGSN. GPRS Protocols. GPRS Channels. Medium Access Control and Radio Link Control. Mobility management, Location Management. GPRS Routing, GPRS QoS. GPRS Security. 03 03

3

04

Wireless LAN: IEEE 802.11: System Architecture, Protocol Architecture, Physical Layer, MAC Layer, MAC Management, 802.11a, 802.11b. Bluetooth: Architecture, Radio Layer, Baseband Layer, Link Manager Protocol, L2CAP, Security Mobile IP: 5 Goals, assumptions and requirements. Entities and terminology. IP packet delivery. Agent Discovery. Registration. Tunneling and encapsulation. Optimizations. Reverse Tunneling. IP micro-mobility support Mobile Ad hoc Networks: Routing in ad hoc networks : AODV, DSDV, DSR. Mobile Transport Layer: 7 Overview of Traditional TCP and implications of mobility control. Improvement of TCP: Indirect TCP, Snoop TCP, Mobile TCP, Fast retransmit/fast recovery, Time-out freezing, Selective retransmission, Transaction-oriented TCP. Wireless Application Protocol: 8 Architecture, Wireless Datagram Protocol, Wireless Transport Layer Security, Wireless Transaction Protocol, Wireless Session Protocol, Wireless Application Development, Wireless Markup Language, WML Scripts, Wireless Telephony Applicaton, push architecture, Push/pull services Section – II 03 03 03

4

06

6

03

Getting started with Mobility 9 Mobility landscape, Mobile platforms, Mobile apps development, Overview of Android platform, setting up the mobile app development environment along with an emulator, a case study on Mobile app development Building blocks of mobile apps App user interface designing – mobile UI resources (Layout, UI elements, Draw-able, Menu), Activity- states and life cycle, interaction amongst activities. App functionality beyond user interface - Threads, Async task, Services – states and life cycle, Notifications, Broadcast receivers, Telephony and SMS APIs. Native data handling – on-device file I/O, shared preferences, mobile databases such as SQLite, and enterprise data access (via Internet/Intranet) 04

10

12

Sprucing up mobile apps 11 Graphics and animation – custom views, canvas, animation APIs, multimedia – audio/video playback and record, location awareness, and native hardware access (sensors such as accelerometer and gyroscope) Testing mobile apps 12 Debugging mobile apps, White box testing, Black box testing, and test automation of mobile apps, JUnit for Android, Robotium, MonkeyTalk Taking apps to Market 13 Versioning, signing and packaging mobile apps, distributing apps on mobile market place 02 04 06

Instructional Method and Pedagogy    Lectures will be conducted with the aid of multi-media projector, black board, or model. Assignments based on course content will be given to the students at the end of each unit/topic and will be evaluated at regular interval. The course includes tutorials, where students have an opportunity to practice the examples for the concepts being taught in lectures.

Students Learning Outcomes After learning this subject students will,  have knowledge about cellular networks, ad-hoc and sensor network protocols and standards.  have knowledge about different mobile operating systems.  Be able to develop applications using android. Text books  John schiller, Mobile Communications, Second Edition, Pearson Education.  Lauren Darcey, Teach Yourself Android Application Development in 24 hours, First Edition, Pearson. Reference Books

   

Reto Meier, Professional Android 2 Application Development, 2010, Wiley India Mark L Murphy, Beginning Android, 2009, Wiley India Pvt Ltd Saiyad Y. Hashimi, Pro Android, 2009, Apress Publications Kaveh Pahlavan, Principles of Wireless Networks – A unified approach, 2002, Prentice Hall  Asoke K. Telukder, Mobile Computing , Second Edition, TMH  Lauren Darcey and Shane Conder, Android Wireless Application Development, Second Edition, Pearson Education.  Barry Buard, Android Application Development all in one for Dummies, Wiley Publishers.

Additional Resources  http://developer.apple.com/library/ios/navigation/  http://dev.windowsphone.com/en-us/develop  http://www.oracle.com/technetwork/java/javame/index.html