DETAILED SYLLABUS

FOR

DISTANCE EDUCATION

B.SC IN INFORMATION TECHNOLOGY

BSIT

Course Name: BSc-ITDuration of Course: 3 Years Eligibility: 10+2 or equivalentLateral Entry: Candidate who has 10+2 with 1 year Diploma in Computer Application is eligible for Semester 3rd of B.Sc IT.Candidate who has 10th with 3 year polytechnic diploma in IT is eligible for Semester 3rd of B.Sc IT.

Semester 1st

CODE SUBJECTS CREDITS

BS11 Fundamentals of computers

4

BS12 Operating System 4BS13 Introduction to Digital

Electronics3

BS14 Database ManagementSystem

2

BS15 Basics of Internet and HTML

2

BS16 Database Managenent System '(Lab)and Basic of Internet and HTML (Lab)

2

BS 17 Indian Constitution & Ethics

2

Total Credits 19

Semester 2nd

Semester 3rd

CODE SUBJECTS CREDITS

BS31 Computer Graphics 3BS32 Web programming & java

sript2

BS33 Data Communication 2BS34 Object oriented

programming-C++3

BS35 Mathematics-I 2BS36 Object oriented

programming-C++ Lab and Web Programming & Java Script Lab

2

Total Credits 14

Semester 4th

Semester 5th

CODE Subjects Credits

BS21 Introduction to programming–C language

3

BS22 Computer Architecture 2BS23 RDBMS 3BS24 Digital Computer

Fundamentals2

BS25 Business Communication 2BSL-L2

C Programming Lab and RDBMS Lab

2

BS27 Environmental Studies 2Total Credits 16

CODE SUBJECTS CREDITS

BS41 Visual Programming 4BS42 Computer Networks 2BS43 Data structures using c++ 2BS44 Java programming 4BS45 Mathematics 2BS46 Data Structures Using C+

+Lab and Java programming

2

Total credits 24 14

CODE SUBJECTS CREDITS

BS51 Software Engineering 4BS52 Design Analysis and

Algorithm2

BS53 Advance Java Programming

4

BS54 Network Programming 2BS55 Mathematics III 2BS-L5 Algorithms Lab and

Advanced Java Programming Lab

2

Total Credits 16

Semester 6th

CODE SUBJECTS CREDITS

BS61 Unix Systems Programming

4

BS62 ASP.NET Programmingusing c#

2

BS63 VB.NET and XML 2BS64 Software Quality &

Testing4

BS-L6 Unix Systems Programming Lab and ASP.NET Programming Using C# Lab and VB.Net and XML Lab

2

BS65 Project 6Total Credits 20

FIRST SEMESTER

Detailed Syllabus

Semester: 1st

Subject: Fundamentals of computers

Code: BS11

Section A

Introduction, Objectives Introduction to computers and associated terms: Computer, Input devices output devices, CPU, Secondary Storage Devices, Hardware, Peripherals, Terminal, Port, Advantages of a computer. Computers and its history,

Section B

Data Representation: Binary System- BITS AND BYTES, Standard codes- ASCII and EBCDIC, Decimal to binary conversion, Binary to Decimal conversion, Binary arithmetic, octal system, Hexadecimal System.

Section C

MS – Office, Ms Word, MS – Excel, Power Point

SectionD

RDBMS Introduction, Fox Pro

Detailed Syllabus

Semester: 1st

Subject: Operating System

Code: BS12

SECTION A Introduction to operating System, its need and Operating system services, Definition, Early systems, Simple batch systems, Multiprogrammed batched systems, Time sharing systems, Personal computer systems, Real time systems.

SECTION B Process Management: Process concept, Process scheduling, Definition of context switching. CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms

SECTION CDeadlocks: Deadlock characterisation, Methods for handling deadlocks, Deadlock prevention, Deadlock avoidance, Deadlock detection and recovery. Memory Management: Logical versus Physical address space, Swapping, Contiguous allocation, Paging, Segmentation, Segmentation with paging. Virtual Memory: Demand paging, Performance of demand paging, Page replacement, Page replacement algorithms, Thrashing.

SECTION D File management: File system Structure, Allocation methods: Contiguous allocation, Linked allocation, Indexed allocation. Device Management: Disk structure, Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK.

Detailed Syllabus

Semester: 1st

Subject: Introduction to Digital Electronics

Code: BS13

Section A

Introduction Objectives, Principle of communication system, Types of communication system. Constructions and principles of operation of semiconductor diodes, transistors FET, MOS FETS. Analog Electronics: - Semiconductor Diode, Diode Circuits

Section B

Principle of digital communication, Layers of digital communication, Bandwidth, Information transfer rate, Signaling rate. Use of Diodes as rectifier, use of transistor 2-e BJT, FET, MOSFET as an amplifier,.

Section C

Advantags of digital communications, Number System and Codes, Logic Gates, Combinational Circuit, Sequential Circuits, Digital Logic Families, Programmable Logic Devices, D/A and A/D convectors.

Section D

Transistor at low frequencies, Transistor Biasing, Transistor at High Frequencies, Oscillator and as a switch, Introduction to magnetic material and their properties, Inductor characteristics, types of .inductor, their features and specifications, transformers, types of transformers

Detailed Syllabus

Semester: 1st

Subject: Database Management System

Code: BS14

SECTION ADatabase V/s File system, Architecture of DBMS, Data Independence (Logical,Physical) DBA and his responsibility, DBMS structure (DDL Compiler, Datamanager, File manager, Disk Manager, Query Processor)

SECTION BEntity, Entity Set, Attribute Types (Simple & Composite, Single & Multi value,Derived), Relationship Sets, Mapping cardinalities, Keys (Primary, Secondary,Candidate, Super, Alternate), ERDiagram,Hierarchical Model ,Relational Model,Network Model, Object oriented Model.SECTION CAnomalies in Design, Functional Dependency, Logical implications, Closure of FDSet, Canonical form, Full and Partial FD, Prime and Nonprimeattributes, 1NF,2NF,3NF,BCNF, Decompositions, lossless and Dependency preservingdecomposition.

SECTION DIntegrity rules (Entity integrity, Refrential Integrity) Union, Difference, Intersection,Cartesian product Division, Projection, Selection, Joins.Relational calculus, Type calculus Formulae, Domain calculus, SQL Basic dataretrieval, Data manipulation and table study comments, views, SQL queries.

Detailed Syllabus

Semester: 1st

Subject: Basics of Internet and HTML

Code: BS16

SECTION AClient Server Model, IP Addresses, IPv6, Internet Congestion, Telnet & RemoteLogin. FTP vs. TFTP, HTTP, ARCHIE & GOPHER. Newsgroup Terminology Model& Hierarchies, Three Tier Architecture.SECTION BDefinition of Networks, Types of Network, Topologies, PSTN, PSDN,VAN, ISDN,PDNs, Wide Area Network, Introduction to search engines (Mozila, Netscape)WWW, Email.SECTION CEncryption SchemesPrivate& Public Key Cryptography.SECTION DIntroduction to HTML, Tag, Types of Tags, Forms, Tables, Images insertion in webpage, Introduction about DMTL, CGI, Introduction to XML.

SECOND SEMESTER

Detailed Syllabus

Semester: 2nd

Subject: Introduction to programming –C languageCode: BS21

SECTION AConstants, variables, Keywords, Decision Control Structure (if. Ifelse,Nested ifelse,switch), Loop control Structures (While, Dowhile,for), Continue, break. Storageclasses (Automatic, Register, Static, External). Macro, Macros with arguments,macros versus functions.

SECTION BFunction Definition, Accessing function, function prototype, passing arguments tofunction (call by value, call by reference).

SECTION CProcessing as array, passing array tofunctions, multidimensionalarrays, string functions (Strlen (), strcpy(), strcat(),strcmp() etc.)

SECTION DPointer declaration, Passing Pointer to functions, Dynamic memory allocation,operations on pointers, Array of pointers Defining and processing of structures andunions, structures versus unions.

Detailed Syllabus

Semester: 2nd

Subject: Computer ArchitectureCode: BS23

SECTION ASystem buses: Computer components, Computer function, Interconnection,Interconnection Structures, Bus Interconnection, PCI

SECTION BInternal Memory: Computer Memory System Overview, Semiconductor MainMemory, Cache Memory, Advanced DRAM OrganisationInput/ Output: External Devices, Programmed I/O, Interrupt Driven I/O, DirectMemory Aceess, I/O Channels.

SECTION CComputer Arithmatic: The Arithmaticand Logical Unit (ALU), Integer Arithmetic,Floating Point Representation, Floating Point Arithmetic.The Control Unit: MicroOperations,Control Unit, Hardwired Implementation,Microprogrammed Controller, Basic Copncepts, Microinstructions, Sequencing,Microinstruction Execution.

SECTION DInstruction Sets: Characteristics and Function, Machine Instruction Characteristics,Types of Operands, Types of Operations, Addressing Modes and Formats, RegisterOrganisation, The Instruction Cycle, Instruction Pipelining. Basic AssemblyProgramming in 8086

Detailed Syllabus

Semester: 2nd

Subject: RDBMSCode: BS24

Section A

Basic concepts: Introduction, Data base users Data models, Schema and Instances: DBMS Architecture and Data Independence, database language , Dta modeling using E – R MODEL.

Relational Model: Relational model concepts, Relational model constraints, Update operations on relations. The relational Algebra.

Section B

SQL- A Relational; Database Language, Database Design: Informal Design guidance for Relational Scheme, Functional Dependencies, Normal Form Based on Primary Keys. Boyce – Codd Normal Form, Multi valued Dependencies and Forth Normal Form, The database Design Process.

Query Processing: Basic Algorithms for Executing query operations, Using heuristics in Query optimization.

Section C

Concurrency Control: Concepts, Locking Techniques for concurrency, Control Concurrency control based on Time stamp ordering, multi version concurrency Techniques.

Section D

Distributed Database: Concepts, Overview of Client Server Architecture, Data Fragmentation Replication and Allocation Technique for Design Query processing in Distributed Database.

Detailed Syllabus

Semester: 2nd

Subject: Digital Computer Fundamentals Code: BS26

SECTION A

Introduction to computers – computer generations – evaluation of computers – characteristics of

computers – types of computers – classification of computers.

Bits-bytes & words: 1’s complement-2’s complement.

SECTION B

Types of connections, components of computers-types of languages-Number system: binary, octal,

hexa decimal, decimal. Memory Organisations: Types of memory. Input/output devices.(Keywords, etc)

storage devices .

SECTION CHardware, Software, System software: Types of Software, translators-compilers, interpreters and

assemblers-Operating system: Functions of OS-storage management-I/O management.

SECTION DApplication software: Types of programming language-Packages: Data base management system-spread

sheets-word processing-software development steps.

Detailed Syllabus

Semester: 2nd

Subject: Business Communication

Code: BS27

SECTION ABasic Skills :Listening,Speaking, Reading & Writing.A Practical study of Grammatical Rules (Noun, Pronoun, Adjectives, Verb, Adverb)Tenses :Typesof Tenses

SECTION BIdioms & Phrases,Confused works :Paronyms,HomonymsSynonyms, General Abbreviations,One word Substitution

SECTION CSimple present, progressive & present perfect, Simple past, progressive & Pastperfect, Indication of Futurity, the passive ( Present & Past, Present & Past Perfect).Reported Speech :(I) Declarative Sentences (II) Imperative(III) Interrogative (Question) (IV) Active, Passive(V) Preposition (VI) Articles

SECTION DWriting Skills :ParagraphWriting, Composition Writing, Report Writing, Application & Letter Writing,Essay Writing.

THIRD SEMESTER

Detailed Syllabus

Semester: 3rd

Subject: Computer Graphics

Code: BS31

SECTION AInput Output device Keyboard,Touch Panel, Light pens, Graphic tablets, Joysticks,Touch balls, Image scanner, Mouse.Handy copy device :Zeroimpact and Non impact printers, Dot matrix, Laser printer,Inkjet printer, Dectrostate, flatted and drum platters.

SECTION BVideo display devices :Cathodray tube, Resistance, Resolution, aspect ratiovertical and horizontal, colour CRT monitors, Direct view storage tube, Flat paneldisplays, LCD, virtual reality, Faster scan system, random scan system.Memory device :Memory(RAM,ROM), CD, Floppy Disk, Magnetic tapes, Magneticdisks.

SECTION CScan conversion algorithm for line (DDA, Bresenham’s algorithm) midpoint circle,ellipse, twodimensionalgraphics, Geometric transformation (translation, scaling,relation).Threedimensionalgraphics: Geometrictransformation (translation, scaling,rotation) 2D& 3Dviewing transformation and clipping.

SECTION DVisible Surface Detection: Back face Detection, Depth Buffer method, ABuffermethod, Scan Line method, and Depthsorting

method. Viewing pipeline, viewingcoordinates, projections, dipping.

Detailed Syllabus

Semester: 3rd

Subject: Web Programming & Java Script

Code: BS32

Section A

Introduction to the Internet, creating a WebPages, cascading style sheets, Attributes, lists and tables, images, links and multimedia,

Section B

WebPages design and layout , Introduction to programming and java script, objects and variables, functions and parameters,

Section C

forms and interactive server, performing calculations, increasing the interactivity , Loops and Arrays, Strings, Dates and cookies ,

Section D

Custom objects: creating and searching a database, JavaScript with frames and windows.

Detailed Syllabus

Semester: 3rd

Subject: Web Programming & Java Script

Code: BS33

Detailed Syllabus

Semester: 3rd

Subject: Data Communication

Code: BS34

SECTION AComputer Networks, Network Hardware (Broadcast, P-P networks) Network Categorization-LAN, MAN, WAN. OSI & TCP/IP Reference Models, Transmission Media, Wireless Transmission, Cellular Radio, Communication satellitesSECTION B Data Link Layer design, Framing, Error control, Flow Control. Elementary Data Link protocols-Simplex Stop & Wait, Sliding Window Protocol. SECTION CMultiple Access Protocols-Aloha, Carrier Sense Multiple Access Protocols, IEEE Standards-802.3 & 802.5, Satellite networks, Routing Algorithms, General Principles of Congestion control. SECTION D Network Layer-The IP Protocol. Elements of Transport Protocols, TCP & UDP, Overview of Application Layer.

Detailed Syllabus

Semester: 3rd

Subject: Object Oriented Programming-C++

Code: BS35

SECTION AOOP paradigm, Advantage of OOP, Differentiate between functional programmingand OOP approach, characteristics of object oriented language object, Definition ofclass, object, Inheritance, Abstraction, Encapsulation, Dynamic Binding, Messagepassing, Polymorphism.

SECTION BIntroduction to C++, Identifier and Keywords, Constants, C++ operator, Typeconversion, Variable declaration, Statements, expression, conditional expression,Loop stricture (for, while, dowhile), break, continue statement.

SECTION CArray:Definitionof Array, Programming with single dimensional array, 2Darray,multidimensional array, function :Functiondeclaration, prototyping calling, Friendfunction, Inline function, Virtual function, call by value, call by reference.

SECTION DClasses, and object in C++, member function, Objects, nested classes, Inheritance,Function overloading, operator overloading virtual function, files stream, binary fileoperation, opening & closing file.

Detailed Syllabus

Semester: 3rd

Subject: Mathematics

Code: BS37

SECTION ASets and subsets, operations on sets.(union, Intersection, complement, Difference,Symmetric Difference) Cartesian products, Relations and Digraphs, Properties ofRelation, Equivalence relation, Transitive closure matrices, operations on matrices,determinants.

SECTION BPropositional and logical operations compound statements quantifiers, conditionalstatements, mathematical induction, permutation, and multiplication principle ofcounting. Combinations. Pigeonhole Principle.

SECTION CPoset, Extremal elements of poset, lattice Boolean algebras, groups, semigroups,product and quotients of groups and semi groups.,

SECTION D Graphs euler path & circuits,Hamiltonian path and circuits, Graph coloring, Trees, labeled trees, tree searching,Binary tree, Minimum spanning trees.

FOURTH SEMESTER

Detailed Syllabus

Semester: 4th

Subject: Visual Programming

Code: BS41

SECTION AIntroduction to Visual Basic: CreatingUser Interfaces with Windows CommonControls, Creating Menus for your Programs, Advance Design Features, Workingwith Collections, Creating Classes in a Program, Working with Active DataObjects(ADO).

SECTION BCreating Database Applications: AccessingData with Data ControlCommunicating with Other Programs: UsingActiveX Server, Creating ActiveXClient Applications

SECTION CExtending the Capabilities of Visual Basic: Declaringand using External Functions

SECTION DCreating ActiveX Control with Visual BasicIntegrating Visual Basic with the Internet: WritingInternet Application with VisualBasic

Detailed Syllabus

Semester: 4th

Subject: Computer Networks

Code: BS42

SECTION AUses of Computer Network, Network Hardware, Network Software, Goals andApplications of Computer networks, Computer Network Structure and Architecture.Reference Models: OSI Reference Model, TCP/IP reference Model, Comparison ofOSI and TCP Reference Model, Introduction to Novell Netware, ARPANET.

SECTION BLocal Area Network: IEEE standards 802 for LAN’s and MAN’s (802.2, 802.3, 802.4,802.5, 802.6). Bridges from 802.x to 802.y, transparent bridges, source routingbridges, remote bridges, comparison of 802 bridges, High speed LANs – FDDI, FastEthernet, HIPPI, Fibre channel, Satellite network Polling, ALOHA, FDM, TDM, CDM.

SECTION CThe Internet Protocol Introductionto Internetworking, The IP protocol, IPAddresses, Subnets, Internet Control Protocol, Interior and Exterior gateway routingprotocol., internet multicasting mobile IP, CIDR, IPv6.

SECTION DThe Transport Protocol – Elements of transport protocol, A simple transport protocol,TCPServicemodel, TCP protocol, Segment header, Connection management,

Transmission policy, Congestion control, timer management, UDP.

Detailed Syllabus

Semester: 4th

Subject: Data Structure Using C++

Code: BS43

Section A: Arrays, Pointers and Structures

Introduction, Definition and concept of an Array, Array Used in ‘C’ Language, Single – Dimensional Arrays (One Dimensional Array) , Two Dimensional Arrays. [Matrix], Pointers, Declaring a pointer variable, Pointer Operators, Pointers and Arrays , Pointers used in function, Pointers used in an Array, Structures, Declaration of structure , Initialization of structure , Processing of Structure, Structure used with an Array

Overview of Data Structures

Introduction, What is a Data Structure? , Definition of data structure , The Abstract Level, The Application Level , Implementation Level, Data Types and Structured Data Type, Common Structures , Abstract Data Types , Properties of Abstract Data Type Generic Abstract Data Types, Programming with Abstract Data Types, Pre and Post Conditions, Preconditions, Post conditions, Checking Pre & Post Conditions , Implementation Checks Preconditions Linear Data Structure, The Array Data Structure , Using an Array and Lists as a Data Structure, Elementary Data Structures , What the application needs ?, Implementation methods, Non Linear , Data Structures – Trees, Binary Tree, Hash Tables

Section B: Overview of Stack

Introduction, Operations of Stack, Insert / Push operation, Delete/pop operation, Display, Stack implementation using arrays, Applications of stack, Stacks using structures. Sample C programs to represents the Stack Implementation

Overview of Queues

Introduction, Queues and its Operations ,Different types of queues, Ordinary queue Disadvantage of ordinary queue, Double ended queue (Deque), Circular queue Sample C programs to represents the Queue Implementation:

Section C: Linked Lists

Introduction, Linear list, Linked list, Typical basic linked-list operations, Singly-Linked Lists, Circular singly linked list, Insert a node at the front end , Insert a node at the rear end, Delete a node from the front end , Delete a node from the rear end , Doubly linked lists, Insert a node at the front end , Insert a node at the rear end, Delete a node from the front end

Trees

Introduction , Overview of Tree Concept , Binary tree, Strictly binary tree, Complete binary tree, Almost complete binary tree, Storage representation of a binary tree, Various operations on binary trees using linked representation, Insertion Operation Traversals, Binary search tree (BST), Insertion Operation, Searching , Other operations , find maximum value in a tree BST, To find minimum value in a BST , Height of tree , Count nodes in a tree, Count leaves in a tree, Delete a node from the tree

Section D: Graphs

Introduction, Overview of Graphs, Adjacency lists & Adjacency Matrix , Adjacency lists, Adjacency Matrix, Depth – First Traversal, Breadth – First Traversal, Spanning Trees

Searching Methods

Introduction, Basics Searching Techniques, Self Assessment Questions , Algorithmic Notation Sequential Search [Linear search] , Binary Search , Illustration of C Programmes

Sorting Methods

Introduction, Overview of Sorting Methods, How do you sort? , Evaluating a Sorting Algorithms, Stability on Sorting algorithm, Internal Sorting, Insertion Sort , Bubble Sort, Selection Sort , Shell Sort, Quick Sort , Tree Sort External Sorts, Merge Sort, 2-Way Merge Sort .

Detailed Syllabus

Semester: 4th

Subject: Java Programming

Code: BS45

SECTION AIntroduction to Java: Features of Java, difference between Java and C++, data types, variables, arrays, operatorsarithmetic, bitwise, relational, Boolean, various control statements.

SECTION BIntroduction to Classes: Class fundamentals, declaring objects, methods, constructors, garbage collection, passing parameters to methods, recursion, access control, static, final and finally method, Array One dimensional array, Two Dimensional array multidimensional arrays, Function, Functions Overloading.

SECTION C

Inheritance, super, multilevel hierarchy, abstract methods and classes. Packages and interfaces, importing packages, exception handling. Exception types, try, catch, finally, throw and throws, creating exception subclasses. Multithread programming, thread priorities, synchronization, messaging, creating multiple threads, inter thread communication.

SECTION DInput/Output, streams, reading and writing console input/output, reading and writing files, applet fundamentals. Networking, socket overview, client/server, reserved sockets, proxy servers, Internet addressing, Java and the Net, TCP/IP client sockets. An introduction to AWT, GUI graphics, fonts, colours.

Detailed Syllabus

Semester: 4th

Subject: Mathematics

Code: BS47

Section A: Sets relations and functions

Sets, relations, functions, intervals, functions of real variable, different functions

Mathematical induction

progressions , principle of mathematical induction , summation of series using and arithmetico-geometric series , summation of series by the method of differences and partial fractions ,

Section B: Combinatorics

Principles of counting, generating functions, partitions and compositions, orderings, principle of inclusion and exclusion8

Recurrences and integer functions

Recurrence relation, applications of recurrences, generating function, and integer functions

Section C: Partially ordered sets and lattices

Relation matrices, partial ordered sets, lattices, duality, modular and distributive lattices

Semi groups, monoids and groups

Semigroups, monodies, groups, permutation groups

Section D: Rings, fields and vector spaces

Rings and integral domains, fields, vector spaces

Propositional calculus and logical quantifiers

Logical inference, propositions and tautologies, predicates, logical quantification of

Propositions

FIFTH SEMESTER

Detailed Syllabus

Semester: 5th

Subject: Software Engineering

Code: BS51

SECTION AIntroduction to Software Engineering: Software myths, Definitions and Goals ofsoftware engineering, Comparison with traditional Engineering disciplines, Softwaremyths.Software development: Phases, Error distribution, Effort distribution, S/Wdevelopment life cycle: Waterfall and prototype models, RAD, Spiral model ofdevelopment.

SECTION BPlanning a software project: Team structure (Democratic, Chief programmes andHierarchical). Software requirement specification: Characteristics & Components of aSRS. Problem Analysis: Structuring Information, DFD’s & Data dictionary.

SECTION CSoftware Design: Design objectives and principles, Design concepts Abstraction,Information hiding, Concurrency, Structure: Module level concepts: Coupling,Cohesion. Structured design methodology.

SECTION DCoding: Programming practicesTopdown and Bottom up, Structured programming,Programming style, Internal documentation.Testing and Testing Fundamentals: Error, Fault, Failure, Reliability, Levels of testing,Test case & Testing criteria, unit testing, functional testing, system testing, useracceptance testing, a and b testing.

Detailed Syllabus

Semester: 5th

Subject: Design Analysis & Algorithm

Code: BS52

Section A Elementary Algorithms

Introduction, Notation for expressing algorithms, Role and Notation for comments, Example of an Algorithm, Problems and Instances, Characteristics of an Algorithm , Building Blocks of Algorithms, Procedure and Recursion, Recursion, Outline of Algorithmics, Specification Methods for algorithms.

Mathematical Functions & Notations

Introduction, Functions & Notations, Modular Arithmetic / Mod function, Mathematical Expectation in average case analysis, Mathematical Expectation , Concept of Efficiency of an Algorithm, Well known Asymptotic Functions & Notations, The Notation, The Notation , The Notation , The Notation , Analysis of Algorithms – Simple Examples, Analysis of First – Averages, Well known Sorting Algorithms, Divide and Conquer Technique, Recursive Constructs, Average – Case and Amortized Analysis, Sorting in Linear Time, Medians and Order Statistics.

Section B Elementary Data

Introduction, Stacks and queues, Linked lists, Hash tables, Collision resolution by chaining, Binary Search Trees, Red-Black Trees, Rotations, Insertion, Augmenting Data s, Determining the rank of an element, Maintaining subtree sizes, How to augment a data, Divide-and- Conquer, Integer Multiplication, Binary Search, Sorting, Quick Sort, Matrix Multiplication, Splay tree, Zig Step.

B – Trees

Introduction, Properties of B – Trees, The height of a B – Tree, Binomial trees, Binomial Heaps, Fibonacci Heaps, Data s for Disjoint Sets.

Section C Graph Algorithms

Introduction, NIM/Marienbad Game, Traversing Trees, Depth-First Search, Breadth-First Search, Best First Search & Minimax Principle, Topological Sort.

Dynamic Programming

Introduction, The Problem of Making Change, The Principle of Optimality, Chained Matrix Multiplication, Matrix Multiplication using Dynamic Programming.

Greedy Techniques

Introduction, Some Examples, Formalization of Greedy Technique, Minimum Spanning Tree, Prim‘s Algorithm, Kruskal‘s Algorithm, Djikstra‘s Algorithm.

Section D Models f or Executing Algorithms –: FA

Introduction, Regular Expressions, Regular Languages, Finite Automata

Models for Executing Algorithms – II : PDFA & CFG

Introduction, Formal Language & Grammar, Chomsky Classification for Grammar, Context

Free Grammar (CFG), Pushdown Automata (PDA).

Models for Executing Algorithms – III: TM

Introduction, Prelude to Formal Definition, Turing Machine: Formal Definition and Examples, Instantaneous Description and Transition Diagrams, Some Formal Definitions Observations, Turing Machine as a Computer of Functions.

Algorithmically Unsolvable Problems

Introduction, Decidable and Undecidable Problems, The Halting Problem, Reduction to Another Undecidable Problem, Undecidability of Post Correspondence Problem, Undecidable Problems for Context Free Languages, Other Undecidable Problems.

Complexity of Algorithms

Introduction, Objectives, Notations for the Growth Rates of Functions, Classification of Problems, Reduction, NP-Complete and NP-Hard Problems, Establishing NP-Completeness of Problems

Detailed Syllabus

Semester: 5th

Subject: Advance Java Programming

Code: BS54

SECTION A Remote Method Invocation: Introduction,Need, Overview of RMI, Limitations: Implementations of Interfaces: Server Implementations, Client Implementation.SECTION B Packages used in RMI: Architecture of RMI SECTION B Java Beans:, Introduction, Using the Beanbox, Creating JavaBean Components; Reflection and Introspection; Manipulating Events in the Beanbox; The Beaninfo Interface; Bean Cutomization; Bean Persisitence. SECTION C Java Servelets: Servelet Overview; Java Web Server; The cycle of a Servelet; Server Side Include; JDBC in Servelets; Applet Servelet communication; Session Tracking; Inter Servelet Communications.

Detailed Syllabus

Semester: 5th

Subject: Network Programming

Code: BS56

SECTION A Introduction to networking and Internet protocols via programming and hands-on labs. SECTION B

TCP/IP protocol architecture; user datagram protocol (UDP); multicasting; transmission control protocol (TCP); standard Internet services, and protocol usage by common Internet applications. Sockets programming; client/server; peer-to-peer; Internet addressing; TCP sockets;

SECTION C UDP sockets; raw sockets. Multithreading and exception handling. Finger, DNS, HTTP, and ping clients and servers. Routers and architectures, routing protocols.SECTION D

Router and switch configurations, Internet operating systems. Internetwork setup, network topology, wireless internetworking. Network protocol analyzers; traffic generation.

Detailed Syllabus

Semester: 5th

Subject: Mathematics-3

Code: BS57

SECTION ASolution of transcendental equation: Bisection method, Regular falsi method, NewtonRaphson method, and secant method.System of simultaneously nonlinearand alegebric equation: Gameseliminationmethod, Guass seidel alternative method, Gauss Jordan’s method, Jacobbi’sIteration.

SECTION BOperation, E, , , Algebric properties of E and , Relation between operators,differences table, Forward Difference, Backward Difference, Central differencefactorial Notation, Divided Differences, Langrange’s Interpolation formula for unequalintervals.

SECTION CNumerical Integration: Thetrapezoidal rule, Simpson’s 1/3 rule, Simpson’s 3/8waddle’s rule.Numerical Relation of ordinary differential equation: Euler’s method, Taylor’s series,

and Rungekuttamethod.

SECTION CIntroduction to statistics: Scopeof statistics, Mean, Mode, Median, StandardDeviation, and Variance.Correlation, Karl’s person coefficient, Rank correlation Numerical based on fitting ofregression lines (using least square method)

SIXTH SEMESTER

Detailed Syllabus

Semester: 6th

Subject: Unix System Programming

Code: BS61

SECTION A : Overview of UNIX/Linux

Objectives, Introduction to Operating System, Brief History of UNIX, Architecture of the Linux Operating System, Logging into (and out of) UNIX Systems, Changing your password, General format of UNIX commands

Unix File System

UNIX File system, Typical UNIX Directory Structure, Directory and File Handling Commands, Making Hard and Soft (Symbolic) Links, Specifying multiple filenames, Quotes, File and Directory Permissions, Inspecting File Content, Finding Files, Finding Text in Files, Sorting files, Advanced Text File Processing, File Compression and Backup, Handling Removable Media (e.g. floppy disks)

SECTION B Processes in Unix

Process, Foreground and Background processes, controlling a process

Standard Input and Output

Pipes, Redirecting input and output

SECTION CUnix System Utilities

Connecting to Remote Machines, Network routing utilities, Remote File Transfer, Other Internet-related utilities, User Information and Communication, Printer Control, Email Utilities, Target Directed Compilation, Version control with CVS, C/C++ compilation utilities, Manual Pages

Unix Editors

Introduction to vi, Basic Text Input and Navigation in vi, Moving and Copying Text in vi, Searching for and Replacing Text in vi, Other Useful vi Commands, Quick reference for vi, Introduction to emacs, Basic Text Input and Navigation in emacs, Moving and Copying Text in emacs, Searching for and Replacing Text in emacs, Other Useful emacs Commands, Quick reference for emacs, Other UNIX editors

SECTION D System Administration

The Superuser root, Shutdown and System Start-up, Adding Users, Controlling User Groups, Cron Jobs, Keeping Essential Processes Alive,

Shell programming

Shells and Shell Scripts, Shell Variables and the Environment, Simple Shell Scripting, user defined variable, Shell arguments and quotes, Shell standard input and output, Arithmetic in the shell, Shell positional parameters, Shell Conditional Tests, Invoking The Shell and executing a script, eval shell command, Shell Flow Control, Shell functions, Interrupt handling, capturing command output

Detailed Syllabus

Semester: 6th

Subject: ASP.NET Programming using C#

Code: BS63

SECTION A : Introduction to Web Applications and ASP .Net

Basics of .Net Framework, Types of .Net Namespaces, Basics of Web Application and Web Server Connections, Design time Interaction of Components, Web Application Development Cycle, Basics of ASP.Net, Advantages of ASP.Net, Evolution of ASP.Net, ASP.Net Objects, Requirements for ASP .Net Installation

SECTION BASP.Net Controls

ASP.Net Web Forms, Introduction to ASP.Net Server Controls, Handling Server Control Events, Using Custom Server Controls

Validating User Input

Basics of Validation Controls, Types of Validation Controls, Client Side Validation, Displaying Validation Errors, Working with Regular Expressions

SECTION C Concepts of Database Access and Database Handling

Introduction to Server-side Data, Accessing SQL Based Data, Binding SQL Data to Controls, Inserting Data in a SQL Database, Updating Data in a SQL Database, Deleting Data in a SQL Database, Accessing XML based Data

SECTION D: Introduction to Web Services

Web Services, Activities related to Web Service, UDDI

Building Web Services Using ASP.Net

ASP.Net Web Service, Building a simple Web Service, Trace Information categories, Debugging an Application, Caching

Detailed Syllabus

Semester: 6th

Subject: VB.NET and XML

Code: BS65

SECTION A: Introduction

Introduction to VB .Net, Features of VB .Net, .Net Framework and Class Library, Working with .Net FCL

The Visual Basic Dot Net Language – Operators, Conditions and Loops

VB .Net Data Types, Programming Constructs with Decision Statements, Programming Constructs with Loop Structure, Arrays

SECTION B: Implementing OOP Using VB .Net

Object Oriented Features, Procedures and Functions, Optional Arguments, Error Handling in Procedures

Advanced OOP with VB .Net

Introduction, Properties, Public and Private variables, Types of Properties, Polymorphisms, Inheritance, Method Overloading

SECTION C: Windows Form

Introduction to Class Libraries, Event and Event Handling, Winforms and GUI

Windows Forms – Basic and Advanced Concepts

Controls, Text Controls, Selection List Controls, VB .Net is overridden, Some Control with Examples

Error Handling in Windows Forms

Types of Validations, Types of Errors, Exceptions, Classified Runtime based Examples

SDI and MDI Applications

SDI and MDI Interfaces, Drawbacks of using SDI, Characteristics of MDI Components

SECTION D: Data Access with ADO .Net

Overview of Microsoft Database Access Technologies, ADO .Net, Creating a Database, ADO .Net Architecture, ADO .Net Class Libraries, Data bound Controls, Creating a Data Set Manually, Using XML Data

Developing Components in VB .Net

Fundamentals of Custom controls, COM, Associating Events with User Controls, Inheriting from existing winforms control and data from a control class

Detailed Syllabus

Semester: 6th

Subject: Software Quality & Testing

Code: BS67

SECTION A S/W Quality assurance: concept, Quality, Quality control, Quality Assurance, Cost of quality, SQA plan, verification and validation.

S/W Testing: Objectives, Principles, testability, Test case design, White Box Testing, Bases path Testing: Flow graph notation, Cyclomatic Complexity, Black Box testing: coverage criteria, Graph based testing, Equivalence partitioning, Boundary value Analysis, Mutation testing.

SECTION B Levels of testing, test cases and test criteria’s, Test oracles, Regression and stress testing, Testing Process: Test Plan, Test case specification, test case execution and analysis, System Testing: Recovery testing, security, Stress and performance testing, Debugging process.

SECTION C Object oriented Testing: Testing object-oriented analysis and object -oriented design models, strategies: Unit testing, integration testing, validation testing.

SECTION DS/W project Management: Management Spectrum, Team structure, process; S/W maintenance: maintenance activities, Documentation to facilitate maintenance; Reverse Engineering, Legacy systems, Y2K problem.