SOBAN SINGH JEENA University, Almora,

Uttarakhand
B.Sc (IT), PROFESSIONAL COURSE
w.e.f Session 2022-2023
 SYLLABUS FOR B.Sc IT w.e.f Session 2022-2023

Year Semester Paper Code Title of Paper Internal External Total

BSCIT 101 Information Technology and Communications 30 70 100

BSCIT 102 Programming in C 30 70 100

BSCIT 103 Elementary Mathematics 30 70 100

I
BSCIT 104 Communicative English 30 70 100
First year

BSCIT 105 Lab: Practical (C) 30 70 100

BSCIT 201 Data Structures 30 70 100

BSCIT 202 Object Oriented Programming with C++ 30 70 100

BSCIT 203 Discrete Mathematics 30 70 100

II
BSCIT 204 Operating System 30 70 100

BSCIT 205 Lab: Practical (C++) 30 70 100

BSCIT 301 Introduction to Database System 30 70 100

BSCIT 302 Digital Electronics 30 70 100

30 70 100
III BSCIT 303 Digital Communication and Network
30 70 100
BSCIT 304 Organizational Behavior
30 70 100
BSCIT 305 Lab: Practical (DBMS)
Second Year

30 70 100
BSCIT 401 Computer Based Numerical Techniques
30 70 100
BSCIT 402 Programming with Python
30 70 100
BSCIT 403 Network Security & Communication
IV BSCIT 404 E- Commerce 30 70 100

30 70 100
BSCIT 405 Lab: Practical (Python)
Students must appear in exam of the Compulsory Paper of "Environmental Sciences" in the 4th
Environment
Science Semester.

30 70 100
BSCIT 501 Software Engineering
30 70 100
BSCIT 502 Programming in Java

V BSCIT 503 Wireless Computing 30 70 100

BSCIT 504 Data Analysis, Designing & Algorithm 30 70 100

Third year

BSCIT 505 Lab: Practical (JAVA) 30 70 100

30 70 100
BSCIT 601 Artificial Intelligence
Cloud Computing 30 70 100
BSCIT 602

VI BSCIT 603 Web Technology 30 70 100

30 70 100
BSCIT 604 Minor Project

BSCIT 605 Lab: Web Technology 30 70 100

 B.Sc IT

COURSE NUMBER : B.Sc IT -101

NAME OF COURSE : Information Technology & Communications

CREDIT HOURS : 5(4-1-0)

UNIT 1
Fundamentals of Computers-Classification of Computers Input & Output Devices,
limitations generation, overview of Computer Hardware & Software Memory.

UNIT 2
Operating system, Types of Operating System with examples, Single user (MS-
DOS) and Multiuser (UNIX), Functions of Operating System, Internal external
command, Introduction to Windows GUI & CUI.

UNIT 3
INFORMATION CONCEPT & PROCESSING – Definition of information,
need for information, quality information, value of information, categories and
levels of information.

UNIT 4
PROGRAMMING LANGUAGE CLASSIFICATION-Computer
languages, generation of languages, translators-interpreters, compilers,
assemblers.

UNIT 5
INFORMATION TECHNOLOGY APPLICATION -Scientific business,
education and entertainment application, industry automation, weather
forecasting, media for data transmission, types of networking, client server
architecture.

REFERENCE BOOKS-

1. Introduction to information technology, ITL education solution limited,

personal education.
2. Introduction to computer science, ITL Education solution limited. Personal
education.
3. Foundation of information technology by D S Yadav . New age publication
ltd.
4. Introduction to computer by peter Norton TMH. Publication ltd
 COURSE NUMBER : B.Sc IT -102

NAME OF COURSE : Programming in C

CREDIT HOURS : 5(4-1-0)

UNIT 1
C Fundamental
Character set, identifiers and keywords, data types, constants, variables and
arrays, declarations, operators and expressions, library functions, statements,
symbolic constants, preprocessor directives, formatted input, output, basic
data types, type conversion, data type modifiers, expressions and operators,
precedence of C operators, Flow Charts.

UNIT 2
Control statements
If, If-else, while, do-while, for, goto, switch, break, continue statements,
comma operator.

UNIT 3
Function and macros
Function prototypes, passing arguments to a function by value, recursion.
Storage classes macros, header files, types of function.

UNIT 4
Arrays
Defining- processing array, passing arrays to function, introduction to
multidimensional arrays, arrays and strings.

UNIT 5
Pointers and structures
Structures and unions, defining and processing a structure.

Reference Books-

1. The c programming language by Kernighan &Ritchie, PHI

2. Let us c by Yashawant kanetkar, BPB publication, New Delhi.
3. Computer & data processing with basic by Emdad H . Khan & Anil k. Sharma.
4. Programming in ANSI C Ram Kumar & Rakesh Agrawai tata Me Graw-hill publishing
company limited.
5. Mastering turbo c by stan Kelly – bottle, BPB Publication, New Delhi.
6. Programming in c by Dennis Ritchie , BPB Publication , New Delhi.
 COURSE NUMBER : B.Sc IT -103

NAME OF COURSE : Elementary Mathematics

CREDIT HOURS : 4(3-1-0)

UNIT 1
Permutation &combination binomial &simple problems based on it,
Binomial &simple problem, Logarithmic and Exponential series.

UNIT 2
Probability, Introduction to coordinated plane, Distance between two points..
Section formula i.e. co-ordinates of a division of straight line joining two
point, Equation of straight lines.

UNIT 3
Area of Triangle, Pair of straight line of the form ax, Circle different form of
Equation, Tangent to the circle condition of tangency.

UNIT 4
Parabola, Ellipse, Hyperbola.

UNIT 5
Basic two-dimensional geometry, Proportions, Analytic geometry, Negative
numbers.

Reference Books-

1. Higher Algebra by Hall & Knight.

2. Senior secondary school Mathematics by R.S. Agrawal.
3. Co-ordinate Geometry by Manjeet Singh.
 COURSE NUMBER : B.Sc IT -104

NAME OF COURSE : COMMUNICATIVE ENGLISH

CREDIT HOURS : 4(3-1-0)

Unit 1
English Grammar: Use of articles, preposition & tenses.

Unit 2
Communication: oral communication conversation of business letters.

Unit 3
Presentation skills: précis writing, presentation skills related to seminars and
conferences.

UNIT 4
Essay writing with different skills techniques.

UNIT 5
Pronunciation & transcription words.

Reference books-

1. Wrien, P.C.& Martin, H: “English grammar:&composition”, S. Chand

2. T. Seth. Agarwal “The art of English grammar & composition, Retan
Prekeshan, Agra.
3. Sinha K K “Business Communication”, Galgotia.
4. W.E.Allen “living English structure”
5. “Business Communication”, Irwin Mc Graw hill.
 COURSE NUMBER : B.Sc IT -201

NAME OF COURSE : DATA STRUCTURES

CREDIT HOURS : 5(4-1-0)

UNIT I
Basic Terminology, Data type, Data object, Need of Data Structure, Types of
Data Structure, Elementary Data Organization, Data Structure operations,
Algorithm Complexity and Time-Space trade-off.

UNIT II
Arrays, Single and Multidimensional Arrays, address calculation, application
of arrays, Linked list: Representation and implementation of Singly Linked
Lists, Header List, Traversing and Searching of Linked List, Overflow and
Underflow, Insertion and deletion to and from Linked Lists, Doubly linked
list.

UNIT III
Stacks: Array and linked representation and implementation of stack,
Operations on Stacks: Push & Pop, Applications o f stack: Conversion of
Infix, Prefix and Postfix Expressions.

UNIT IV
Recursion: Introduction, recursion in C, example of recursion, recursive
functions. Queues: Array and linked representation and implementation of
queues, Operations on Queue: Create, Insert, Delete, Full and Empty.
Circular queue, Deques, and Priority Queues.

UNIT V
Binary Tree, Binary search Tree, AVL tree Pre order, In order and Post
order. Sorting algorithms with efficiency- Bubble sort, Insertion sort, Merge
sort, Quick Sort, Heap Sort.

Recommended Books:
1. Data Structures- Seymour Lipschutz
2. Data Structures using C and C++- Tanenbaum
 COURSE NUMBER : B.Sc IT -202

NAME OF COURSE : Object Oriented Programming with C++

CREDIT HOURS : 5(4-1-0)

Unit I: Principles of Object Oriented Programming: Procedure Oriented

Programming – OOP Paradigm- Basic concepts of OOP-Benefits of OOP-
Object Oriented Language Applications of OOP.

Unit II: Classes and Objects. Constructors and Destructors. Constructors -

Parameterized, Multiple Constructors-constructors with default arguments.

Unit-III: Operator overloading and Type Conversions, Inheritance:

Extending classes. Pointers, virtual functions and polymorphism, Managing
console I/O Operations:

Unit-IV: C++ streams-C++ stream classes-Unformatted I/O Operations-

Formatted console I/O Operations.

Unit-V: Templates, Exception Handling.

Reference Books:
1. Parasons D., Object Oriented Programming with C++ , BPB Publication.
2. Steven C. Lawlor, The Art of Programming Computer Science with C++ ,
Vikas Publication.
3. Schildt Herbert, C++: The Complete Reference , Tata McGraw Hill.
4. Tony Gaddis, Watters, Muganda, Object-Oriented Programming in C++ ,
Dreamtech.
 COURSE NUMBER : B.Sc IT -203

NAME OF COURSE : Discrete Mathematics

CREDIT HOURS : 4(3-1-0)

Unit - I Propositional Calculus: Propositions, Truth tables, Logical

Equivalence, Logical implications, Algebra of propositions, Conditional
propositions.

Unit - II Boolean algebra and Circuits: Boolean Expression, Logic Gates,

Logic Circuits, Boolean Functions, Sum of Product and Product of Sum
Forms, Canonical Forms, Simplification of functions using K-Map.

Unit - III Set Theory: Basic concepts of Set theory, some operations on sets,
Venn diagram, Basic Set identities, Cartesian product. Relation: Definition,
Types of relation, Pictorial representation of relation, Composition of
Relation.

Unit - IV Combinatorics: Fundamental principles, Permutation and

Combination, Recurrence Relation.

Unit - V Graphs and Trees: Introduction to graphs, Graph terminology,

Application of Graphs, Finite and Infinite graphs, Incidence and Degree,
Isolated vertex, Pendent Vertex, and Null graph.

Reference Books:
1. Liu C.L., Elements of Discrete Mathematics, TMH.
2. Neville Dean, Essence of Discrete Mathematics , Prentice Hall.
3. Kenneth H. Rosen, Discrete Mathematics and Its Applications , McGraw
Hill.
4. Richard Johnsonbaugh, Discrete Mathematics , Macmillan.
 COURSE NUMBER : B.Sc IT -204

NAME OF COURSE : OPERATING SYSTEM

CREDIT HOURS : 5(4-1-0)

UNIT 1
Operating System: definition, simple batch system, Time sharing system,
Real time system, storage Hierarchy, operating system service, System Calls.
UNIT 2
Process: Process concept, process Scheduling, operating on process, co -
operating process.
UNIT 3
CPU: Scheduling concepts, Scheduling algorithms, process synchronization,
critical section problem, synchronization hardware, semaphores, Two Level
Scheduling.
UNIT 4
Deadlocks: deadlock characterization, deadlock prevention, avoidance
detection and recovery.
UNIT 5
Storage management, Resident monitor, Logical versus physical address
space, swapping and segmentation.

Reference Books-
1. Silberschatz galvin :Operating System Concepts
2. Tanenbaum A.S. :Modern Operating system, (PHI) 1998
3. Growley :Operating system a design Approach
 COURSE NUMBER : B.Sc IT -301

NAME OF COURSE : Introduction to Database Systems

CREDIT HOURS : 5(4-1-0)

UNIT 1

DBMS Definition – Characteristics of DBMS – Application and advantages

of DBMS– Instances – Schemas and Database States – Three Levels of
Architecture – Data Independence – DBMS languages– Data Dictionary–
Database Users– Data Administrators.

UNIT 2

Data Models– types and their comparison– Entity Relationship Model–

Entity Types– Entity Sets– Attributes and its types– Keys– E-R Diagram–
Data Integrity– RDBMS.

UNIT 3

Relational Algebra (selection, projection, union, intersection, Cartesian

product, Different types of join Anomalies as a database: A consequences of
bad design– Normalization: 1NF, 2NF, 3NF, BCNF, 4NF 5NF.

UNIT 4

Introduction to SQL, DDL, DML, and DCL statements– Creating Tables–

Adding Constraints– Altering Tables, Update, Insert, Delete Tables &
various Form of SELECT.

UNIT 5

Introduction to Transaction management system.

References:
1. H. F. Korth & A. Silverschatz, Database Concepts, Tata McGraw Hill,
New Delhi
2. C. J. Date, Database Systems, Prentice Hall of India, New Delhi.
3. Ivan Bayross, SQL, PL/SQL, The programming language of Oracle.
 COURSE NUMBER : B.Sc IT -302

NAME OF COURSE : Digital Electronics

CREDIT HOURS : 5(4-1-0)

UNIT I
Number Systems – Decimal, Binary, Octal, Hexadecimal, 1‘s and 2‘s
complements, Codes – Binary, BCD, Excess 3, Gray, Alphanumeric codes,
Boolean theorems, Logic gates, Universal gates, Sum of products and
product of sums, Karnaugh map Minimization .

UNIT II
Design of Half and Full Adders, Half and Full Subtr actors, Binary Parallel
Adder Carry look ahead Adder, BCD Adder, Multiplexer, Demultiplexer,
Magnitude Comparator, Decoder, Encoder, Priority Encoder.

UNIT III
Flip flops – SR, JK, T, D, Master/Slave FF – operation and excitation tables,
Triggering of FF, Analysis and design of clocked sequential circuit.

UNIT IV
Design – Moore/Mealy models, state minimization, state assignment, circuit
implementation – Design of Counters- Ripple Counters, Ring Counters, Shift
registers, Universal Shift Register.

UNIT V
Stable and Unstable states, output specifications, cycles and races, state
reduction, race free assignments.

References:
1. John Wiley & Sons Ltd, The Atrium, Southern Gate, Chichester,
West Sussex PO19 8SQ, England
2. R.S Sedha, DE, Prentice Hall of India, New Delhi.
 COURSE NUMBER : B.Sc IT -303

NAME OF COURSE : Digital Communication and Network

CREDIT HOURS : 5(4-1-0)

UNIT 1. Introduction to Computer Networking: Use, advantages, structure of

the communication networks, analog to digital communication, Layered
Protocols, Network & the OSI Models.

UNIT 2. TCP/IP: and Internetworking: example of TCP/IP operations,

related protocols ports and sockets, Topology, Routers.

UNIT 3. The IP address structure, major features of IP, IP datagram, Major

IP services.

UNIT 4. IP source routing, value of the transport layer, Major features of

TCP, passive and active operation.

UNIT 5. Transmission control protocols (TCP), route discovery protocols,

examples of route discovery protocols, application layer protocols, IPv6,
Ethernet.

Reference Books-

1. Tanenbaum, A.S.: Computer Network, PHI-1985.

2. Martin J: Computer Network and Distributed processing, 1985.
3. Black: Computer Network; protocols, Standards and Interface PHI -1985.
4. Black: data Network; Concepts, Theory and practices, PHI.
 COURSE NUMBER : B.Sc IT -304

NAME OF COURSE : Organizational Behavior

CREDIT HOURS : 4(3-1-0)

UNIT 1.
Individual Differences at work: Personality, attitude and intelligence.

UNIT 2.
Motivation: Importance of motivation in work behavior approaches to
motivation, content theories, and process theories.
UNIT 3.
Job analysis and Design: Approaches, job enlargement, job design models.

UNIT 4.
Communication: Types, transaction analysis, Johari windows.

UNIT 5.
Training and Development: Training needs assessment, training techniques
and training evaluation.

Reference Books-
1. S.P. Robins, Organizational Behaviour Concepts, Controversies and
Application (8th Ed.) 2000.
2. N.K. Chadha, Human Resources Management 2000, Sai New Delhi
Printographers.
3. F. Luthans, Organizational Behaviour, Tata MeGraw Hill.
 COURSE NUMBER : B.Sc IT -401

NAME OF COURSE : Computer Based Numerical Techniques

CREDIT HOURS : 4(3-1-0)

UNIT 1.
Floating Point Arithmatic: Representation of Floating Point Numbers ,
Operation , Normalization, Pitfalls of floating point representation.

UNIT 2.
Iterative Methods: Zeros of single transcendental equation and Zeros of
polynomial using Bisection Method, Iteration Method, Regula- Falsi
Method.

UNIT 3.
Simulation Linear Equation: Solution of system of Linear equation, Gauss
Elimination direct method and pivoting.

UNIT 4.
Interpolation and approximation: Finite differences, Difference tables,
Polynomial Interpolation: Newton’s forward and backward formula, Central
Differences formulae: Gauss forward and backward formula.

UNIT 5.
Numerical Differentiation and Integration: Introduction, Numerical
Differentiation ,Numerical Integration, Trapezoidal rule, Simpon’s rule,
Boole’s Rule Euler Maclaurin formulas.

Reference Books-

1. Rajaraman V; : “Computer Oriented Numerical Methods” PHI

2. Gerald and Wheatley, “Applied Numerical Analysis” ,AW
3. Jain, Lyengar and Jain, Numerical Methods for Scientific and Engineering
Computation , New Ager Int.
4. Grewal B.S., “Numerical methods in Engeneering and Science. Khanna
Publishers”, Delhi.
 COURSE NUMBER : B.Sc IT -402

NAME OF COURSE : PROGRAMMING WITH PYTHON

CREDIT HOURS : 5(4-1-0)

UNIT I Features of Python, Writing Python Program, Executing a Python

Program Comments in Python, Doc strings, Variables, Datatypes in Python,
Built-in data types, Sequences in Python.

UNIT II Operators in Python Operator, Output statements, Input Statements,

Command Line Arguments, Control Statements: if Statement, if … else
Statement ,if … else if … else Statement, while Loop, for Loop, Infinite
Loops, Nested Loops, else Suite, break Statement,

UNIT III Functions: Defining a Function, Calling a Function, Returning

Results from a Function, Returning Multiple Values from a Fu nction,
Anonymous functions, Modules, Pass by Object Reference, Formal and
Actual Arguments, Positional Arguments, Keyword Arguments, Default
Arguments.

UNIT IV Introduction to Oops: Features of Object Oriented Programming

System (OOPS), Classes and Objects.

UNIT V Errors in a Python Program, Exceptions, Exception Handling, Types

of Exceptions, raising an exception, assert Statement, User-Defined
Exceptions.

References:-

1. Learning To Program With Python by Richard L. Halterman

2. Learning Python by Mark Lutz
 COURSE NUMBER : B.Sc IT -403

NAME OF COURSE : Network Security & Communication

CREDIT HOURS : 5(4-1-0)

UNIT I : Security trends – Legal, Ethical and Professional Aspects of Security, Need
for Security at Multiple levels, Security Policies – Model of network security.

UNIT II -Symmetric key cryptography :mathematics of symmetric key cryptography: Algebraic

structures – Modular arithmetic-Euclid‟s algorithm-Congruence and matrices – Groups, Rings,
Fields- Finite fields.

UNIT III- Public key cryptography :mathematics of asymmetric key cryptography: Primes –
Primarily Testing – Factorization – Euler‘s totient function, Fermat‘s and Euler‘s Theorem

UNIT IV - Message authentication and integrity :-Authentication requirement– Authentication function – MAC
Hash function – Security of hash function and MAC – SHA

UNIT V -Security practice and system security :Electronic Mail security – PGP,
S/MIME

References:
1. William Stallings, Cryptography and Network Security: Principles and
Practice, PHI 3rd Edition, 2006.
2. C K Shyamala, N Harini and Dr. T R Padmanabhan: Cryptography and
Network Security, Wiley India Pvt.Ltd
3. BehrouzA.Foruzan, Cryptography and Network Security, Tata McGraw
Hill 2007.
 COURSE NUMBER : B.Sc IT -404

NAME OF COURSE : E- Commerce

CREDIT HOURS : 5(4-1-0)

UNIT I :
What is E Commerce, Forces behind E Commerce, E Commerce Industry Framework , Brief History
of E Commerce.

UNIT II :
Network Infrastructure for E Commerce, Market forces behind I-way, Component of I- way.
Mobile Commerce.

UNIT III :
Introduction to Mobile Commerce, Mobile Computing Application, Wireless Application Protocols,
WAP Technology, Mobile information Devices.

UNIT IV :
Introduction to Web Security, Secured Electronic Transaction (SET), Client Server Network.
Encryption.

UNIT V :

World Wide Web & Security, Encryption, Transaction Security, Secret Key Encryption, Public Key
Encryption.

Reference Books-
1. Ravi Kalakota, Andrew Whinston , “frontiers of Electronic Commerce”,
Addision Wesley
2. Denial Amor “The E Business revolution”, Addison Wesley Sokol, “From
EDI to Electronic Commerce: A Business Initiative”. TMH
3.Bajaj Nag, “E Commerce : The Cutting Edge of Business”, TMH.
 COURSE NUMBER : B.Sc IT -501

NAME OF COURSE : Software Engineering

CREDIT HOURS : 5(4-1-0)

1. Introduction: Introduction to Software engineering, Importance of software evolving role of

software, Software Characteristics, Software Components, Software Applications, Software
Crisis, Software engineering problems, Software Development Life Cycle, Software Process.
2. Software Requirement Specification: Analysis, Principles, Water Fall Model, The
Incremental Model, Prototyping, Spiral Model, Role of management in software
development, Problem Analysis, COCOMO Model.
3. Software- Design: Design principles, problem partitioning, abstraction, to down and bottom
up-design, structured approach functional versus object oriented approach, design
specification and verification.
4. Coding: Top-Down and Bottom-Up programming, information hiding,
programming style and internal documentation.
5. Testing Principles: Levels of testing, functional testing test plane, test case
specification, Unit testing, Integration Testing.

Reference books-

1. Pressman, Roger S., “Software Engineering A Practitioner’s Approach Ed.

Boston: McGraw Hill, 2001.
2. Jalote, Pankaj, “Software Engineering Ed.2” New Delhi: Narosa 2002.
Schaum’s Series, “Software Engineering” TMH.
3. Ghezzi Carlo and Others “Fundamentals of Software Engineering” PHI.
Alexis, Leon and Mathews Leon, “Fundamentals of software Engg”.
Sommerville, Ian, “Software Engineering” AWL.
 COURSE NUMBER : B.Sc IT -502

NAME OF COURSE : Programming in Java

CREDIT HOURS : 5(4-1-0)

Unit I
Java Basics: History of Java, Java Buzzwords, comments, data types, variables, constants, scope
and life time of variables, operators, operator hierarchy, expressions, type conversion and
Casting, enumerated types, control, flow-block scope, conditional statements, loops break and
continue statements, simple java program, arrays, input and output, formatting output.
Unit II
Review of OOP concepts, encapsulation, inheritance, polymorphism, classes, objects,
constructors, methods, parameter passing, static fields and methods, access control, this
reference, overloading methods and constructors, recursion, garbage collection, building strings,
exploring string class, Enumerations.
Unit III
Inheritance: inheritance concept, benefits of inheritance, Super classes and Sub classes,
Member access rules, Inheritance hierarchies, super uses, preventing inheritance: final classes
and methods, casting, polymorphism- dynamic binding, method overriding, abstract classes and
methods, the Object class and its methods.
Unit IV
Interfaces: Interfaces vs. Abstract classes, defining an interface, implementing interfaces,
accessing implementations through interface references, extending interface, Uses of inner
classes, local inner classes, anonymous inner classes, static inner classes.
Unit V
Data structures creation and manipulation in java: Introduction to Java Collections, Overview of
Java Collection frame work, commonly used Collection classes- Array List.

Reference books-

1. Kathy Sierra, Bert Bates, Elisabeth Robson “JAVA Approach Ed. Boston: McGraw
Hill, 2001.
2. Herbert Schildt, New Delhi: Narosa 2002.Schaum’s Series, “JAVA” TMH.
 COURSE NUMBER : B.Sc IT -503

NAME OF COURSE : Wireless computing

CREDIT HOURS : 5(4-1-0)

Unit-I Historical Perspective of WC, Wireless Handheld Devices, Terminology,

Micro browsers, Introduction to WML – general layout basic tags and images,
Advantages and disadvantages of Wireless networking.
Unit-II Wireless Service Providers Mobile service providers How cell phones
works? WAP i- mode Messaging services- SMS,EMS,MMS,
Unit-III Wireless Networks, WLANS IEEE 802.11 standards HIPETLAN
Europeanalternative WWANs.
Unit-IV Wireless Communication Technologies, Radio Frequency (RF) Laser and
infrared WiFi,Bluetooth, Satellite Digital Cellular XHTML Mobile.
Unit-V Wireless Access Technologies FDMA, TDMA, CDMA Generational
technologies [2G,GSM, 2.5G, 3G, 4G].

References:

1. Data Dissemination in Wireless Coputing Environments, By Kian-Lee,

Tan , Beng Chin Ooi
2. Wireless Information Networks, By Kaveh Pahlavan, Allen H.Levesque
Wireless Home Networking for Dummies ,By Danny Brier, Pat Hurley
3. Edward Ferris Just Enough Wireless Computing, By Ian S.Hayes
4. Ad Hoc Wireless Networks : Architectures and Protocols By C. Siva Ram
Murthy, B. S. Manoj , Published Hall PTR, 2004
 COURSE NUMBER : B.Sc IT -504

NAME OF COURSE : Data Analysis, Designing & Algorithm

CREDIT HOURS : 5(4-1-0)

UNIT 1:
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important
Problem Types– Fundamentals of the Analysis of Algorithmic Efficiency –Asymptotic
Notations and their properties.

UNIT 2:
Brute Force – Computing an– String Matching – Closest-Pair and Convex-Hull
Problems -Exhaustive Search – Travelling Salesman Problem – Knapsack Problem –
Assignment problem. Divide and Conquer Methodology, Multiplication of Large
Integers – Closest-Pair and Convex – Hull Problems.

UNIT 3:
Dynamic programming – Principle of optimality – Coin changing problem, Computing a
Binomial Coefficient – Floyd‘s algorithm – Multi stage graph – Optimal Binary Search
Trees – Knapsack Problem and Memory functions

UNIT 4:
The Simplex Method – The Maximum-Flow Problem – Maximum Matching in Bipartite
Graphs, Stable marriage Problem, Prim‘s algorithm and Kruskal’s Algorithm – 0/1
Knapsack problem, Optimal Merge pattern – Huffman Trees.

UNIT 5:
Lower – Bound Arguments – P, NP NP- Complete and NP Hard Problems. Backtracking
– n-Queen problem – Hamiltonian Circuit Problem – Subset Sum Problem. Branch and
Bound – LIFO Search and FIFO search – Assignment problem – Knapsack Problem –
Travelling Salesman Problem –

References:

1. Data Structures and Algorithm Analysis in C Perfect Beginner's Guide

2014.
2. Algorithm in C, Harry. H. Chaudhary.
 COURSE NUMBER : B.Sc IT -601

NAME OF COURSE : Artificial Intelligence

CREDIT HOURS : 4(3-1-0)

Unit I Introduction: Intelligent Agents, Agents and environments, Good behaviour,

The nature of environments, structure of agents, Problem Solving, problem solving
agents.

Unit II Searching Technique: informed search and exploration, Informed search

strategies, heuristic function, local search algorithms and optimistic problems, local
search in continuous spaces.

Unit III Knowledge Representation: First order logic – representation revisited –

Syntax and semantics for first order logic –Using first order logic – Knowledge
engineering in first order logic

Unit IV Learning: Learning from observations - forms of learning - Inductive

learning - Learning decision trees- Ensemble learning - Knowledge in learning –
Logical formulation of learning – Explanation based learning – Learning using
relevant information – Inductive logic programming

Unit V Applications: Communication , Communication as action, Formal grammar

for a fragment of English, Syntactic analysis, Augmented grammars, Semantic
interpretation.

References:
1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern
Approach”, 2nd Edition, Pearson Education / Prentice Hall of India, 2004.
 COURSE NUMBER : B.Sc IT -602

NAME OF COURSE: Cloud Computing

CREDIT HOURS : 5(4-1-0)

UNIT 1: Cloud Computing: Distributed Computing - Overview, Introduction to

distributed computing, what is cloud computing? Properties & Characteristics,
Service models, Deployment models. Infrastructure as a Service (IaaS):
Introduction to IaaS, Resource Virtualization, Server, Storage, Network.

UNIT 2: Platform as a Service (PaaS): Introduction to PaaS, Cloud platform &

Management, Computation, Storage. Software as a Service (SaaS): Introduction to
SaaS, Web services, Web 2.0, Web OS. Cloud issues and challenges: Cloud
provider Lock-in, Security.

UNIT 3 Overview of data visualization and its importance. The importance of data
visualization, the relationships, comparisons, distribution, and composition of data.
Virtualization and cloud computing - Need of virtualization – cost, administration,
fast deployment, reduce infrastructure cost – limitations. Types of hardware
virtualization: Full virtualization - partial virtualization - para virtualization.

UNIT 4 Desktop virtualization: Software virtualization – Memory virtualization -

Storage virtualization – Data virtualization – Network virtualization.

UNIT 5 Introduction, Challenges while migrating to Cloud, Broad approaches to

migrating into the cloud- why migrate -deciding on cloud migration, the Seven-step
model of migration into a cloud, Migration Risks and Mitigation, Enterprise cloud
computing paradigm, relevant Deployment Models for Enterprise Cloud
Computing, Adoption and Consumption Strategies, issues for enterprise
applications on the cloud.

References:

1. Publications, 2006. Cloud Computing (Principles and Paradigms), Edited

by Rajkumar Buyya, James Broberg, Andrzej Goscinski, John Wiley & Sons,
Inc. 2011
2. Cloud computing a practical approach - Anthony T.Velte , Toby J. Velte
Robert Elsenpeter, TATA McGraw- Hill , New Delhi – 2010
 COURSE NUMBER : B.Sc IT -603

NAME OF COURSE: Web Technology

CREDIT HOURS : 5(4-1-0)

UNIT 1: History of the web, Growth of the web, Protocols governing the web, Introduction to cyber
laws in India. Introduction to International Cyber laws, Web project, Web tea, team dynamics.

UNIT 2: Communication Issues, the client, Multi-departmental and large scale websites, quality
Insurance and testing, technological advances and impact no web teams.

UNIT 3: HTML: Formatting, tags, links tables, frames, forms, comments in HTML, DHTML. Java
Script: Introduction, Documents, forms, Statements, Functions, Objects in Java scripts, events and
event handling, arrays, FORMS, Button, Checkboxes, Text fields and text areas.

UNIT 4: XML: Introduction, displaying an XML Document, Data interchanges with an XML
Document, Document type definition, Parsers using XML, Client-side usage, Server-side Usage.

UNIT 5: General overview of JavaScript, What is Java script, JavaScript history, Relation between
JavaScript and ECMA Script, Versions of JavaScript.

Reference-
1. Burdman, “Collaborative Web Development”, Addison Wesley.
2. Sharma & Sharma, “Developing E-Commerce Sites”, Addison Wesley.
3. Ivan Bayross, “Web Technologies Part II”, BPB Publications.
4. Shishir Gundavarma, “CGI Programming on the World Wide Web”, O‟Reilly & Associate.