Atal Bihari Vajpayee Vishwavidyalaya III semester Syllabus
BCS-301 INTERNET TECHNOLOGIES
Core Course: 05 Marks: 100 Total Credit: 06 Course Outcome: At the end of course, Students will be able to
● Understand the basic concepts of Internet programming and protocols used.
● Create applications using HTML, CSS and Java Script.
● Learn different type of Internet applications.
● Understand fundamental tools and technologies for web design.
● Specify design rules in constructing web pages and sites.
● Understand how Web pages are designed and created.
UNIT-I
Internet Basics: What is web, Web page, website, Internet browsers, WWW, HTTP, search engine, URL, Hypertext, ISP, Web server, Tools for web site creation.
UNIT-II
Introduction to Web Design: Introduction to hypertext markup language (html),Document type definition, creating web pages, Headings, Paragraphs, lists, hyperlinks, tables, web forms, Input Types, Input Attributes, inserting images, frames, hosting options and domain name registration.
UNIT-III
CSS: Introduction, Syntax, measurement units, colors, Backgrounds, Font, Text, position, Align, Images, Link, Table, List, Padding, Cursor, Rounded corner, Borders, Multi Background
UNIT-IV
Java Script: Overview, syntax, Enabling Java script, Variables, Operators, Decision control statement: If-else, Switch Case; Looping statement: while loop, for loop, forin Loop JavaScript functions, events, Cookies, Page Redirect, Dialog Boxes, Page printing, Error handling, Validation, Debugging, Image Map,
UNIT-V
Internet Applications: WWW, Telnet, FTP, e-mail, Social networks, search engines,Video Conferencing, e-Commerce, m-Commerce,VOIP, blogs.
TEXT/REFERENCE BOOKS:
1. “Internet and Internet Engineering”, Daniel Minoli, TMH (Latest Edition)
2. “Java Script”, Gosslin, Vikas (Latest Edition)
3. “HTML The Definite Guide”, Chuck musiano& Bill Kenndy, O Reilly (Latest Edition)
4. “Dynamic HTML”, Joseph Schmuller, BPB, 2000
BCS-302 COMPUTER NETWORK
Core Course: 06 Marks: 100 Total Credit: 06 Course Outcome: At the end of course, Students will be able to
Understand the basic computer network technology.
Understand and explain Data Communications System and its components.
Identify the different types of network topologies and protocols.
Understand the layers of the OSI model and TCP/IP.
Expose wireless and wired LANs.
UNIT-I
Overview of Data Communication and Networking:
Data Communications: components, data representation, direction of data flow (simplex, half duplex, full duplex);
Networks: distributed processing, network criteria, physical structure (type of connection, topology), categories of network (LAN, MAN, WAN), Protocols and standards;
Reference Models: OSI & TCP/IP reference model comparative study.
UNIT-II
Physical Layer:
Analog & Digital Transmission: Transmission Impairments, Data Rates Limits, Digital to Digital Conversion, Line coding Scheme,
Analog to Digital Conversion: PCM, PAM, Delta Modulation, Transmission Modes, Parallel, Serials Asynchronous and Synchronous Communication
Digital to Analog Conversion: ASK, FSK, PSK, QPSK Constellation Diagram, QAM Analog to
Analog Conversion: AM, FM, PM, Bandwidth Utilization, Multiplexing: FDM, WDM and TDM, Switching Circuits.
Transmission Media: Guided Media: Twisted Pair, Coaxial and Fiber Optic, Unguided Media: Wireless, Radio Waves, Microwaves and Infrared.
UNIT-III
Data Link Layer:
Flow Control: Protocols: Stop & wait ARQ, Go-Back- N ARQ, Selective repeat ARQ, HDLC;
Medium Access Sub Layer: Point to point protocol, LCP, NCP, FDDI, token bus, token ring;
Multiple Access Protocols: Pure ALOHA, Slotted ALOHA, CSMA, CSMA/CD, FDMA, TDMA, CDMA; Traditional Ethernet, Fast Ethernet.
UNIT-IV
Network Layer:
Internetworking Devices: Repeaters, Hubs, Bridges, Switches, Router, Gateway;
Addressing: Internet address, classful address, subnetting, classless address
Routing: Techniques, static vs. dynamic routing, and routing table for classful address
Routing Algorithms: shortest path algorithm, flooding, distance vector routing, linkstate routing.
Protocols: ARP, RARP, IP, ICMP, IPV6; Unicast and multicast routing protocols.
UNIT-V
Transport Layer and Application Layer:
Process To Process Delivery : UDP, TCP; Congestion control algorithm: Leaky bucket algorithm, Token bucket algorithm, choke packets; Quality of service: techniques to improve QoS; DNS, SMTP, SNMP, FTP, HTTP, Firewalls. 36
Modern Topics: Wireless LAN: IEEE 802.11; Introduction to blue-tooth, VLAN’s, Cellular telephony & Satellite network.
TEXTBOOKS:
1. “Data Communications and Networking”, B. A. Forouzan, TMH, (Latest Edition)
2. “Computer Networks”, A. S. Tanenbaum, 4th Edition, Pearson Education/PHI
3. “Data and Computer Communications”, W. Stallings, 5th Edition, PHI/ Pearson Education
REFERENCE BOOKS:
1. “Computer Networking -A top down approach featuring the internet”, Kurose and Rose, Pearson Education
2. “Communication Networks”, Walrand, TMH (Latest Edition)
3. “Internetworking with TCP/IP, vol. 1, 2, 3”, Daglous E. Comer, 4th Edition Pearson Education/PH
BCS-303 DATA STRUCTURE
Core Course: 07 Marks: 100 Total Credit: 04 Course Outcome: At the end of course, Students will be able to
Use different types of data structures, operations and algorithms.
Implement appropriate sorting/searching technique for any given problem.
Use stack, Queue, Lists, Trees and Graphs in problem solving.
Find suitable data structure during application development/Problem Solving.
UNIT-I
Data Types: primitive, non-primitive data types, ADT, Data structure, Linear and nonlinear data structure.
Arrays: Definition and their types, Allocation methods, Address calculations.
Linked List: Definitions, Types with operations (INSERT, DELETE, TRAVERSE).(Insertion/Delete operation includes – insertion before a given element, insertion after a given element, insertion at given position, insertion in sorted linked list).
UNIT-II
Stacks: Definition, Operations PUSH, POP, Implementations using array and linked list, Applications of stack: Infix, Prefix, Postfix representation and conversion using stack, Postfix expression evaluation using stack.
Queues:Introduction, Types of Queues: Priority Queue, Circular queue, Double Ended Queue, operations (INSERT, DELETE), implementation using array and linked list, Applications
UNIT-III
Trees: Definition of trees and their types, Binary trees, Properties of Binary trees and Implementation operation (Insertion, deletion, searching and traversal algorithm: preorder, post order, in-order traversal), Binary Search Trees, AVL Trees, B tree, B+ tree.
UNIT-IV
Sorting: Types of sorting, Sequential Sort, Insertion Sort, Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Radix sort. Searching: Linear search, Binary search, Hashing.
UNIT-V
Graph: Definition of Graph and their types, Graph Traversal – Breadth first Traversal, Depth first Traversal, Shortest path Algorithm, spanning tree, Minimum Spanning tree, Kruskal and prims algorithms.
TEXT/REFERENCE BOOKS:
1. “Data structures using C”, Tanenbaum, PHI, 1996.
2. “Fundamentals of Data Structures”, Horowitz and Sahani, Computer Science Press, 1978
3. “Data structures and Algorithms”, Aefred V. Aho, John E. Joperoft and J.E. Ullman.
4. “An Introduction to Data Structures with Applications”, Jean Paul Trembley and Paul Sorenson, TMH,International Student Edition, 1985.
5. “Data Structures and Program Design in C”, R. Kurse, Leung &Tondo, 2nd Edition, PHI publication
BCS-304 Data Structure Lab
Core Course: 07 (P) Marks: 100 Total Credit: 02 Course Outcome: At the end of course, Students will be able to
Design, develop, implement, analyze and evaluation/testing of Asymptotic performance of algorithms.
Select appropriate data structures needed to be applied on a specified problem definition.
Implement operations like searching, insertion, and deletion, traversing mechanism etc. on various data structures.
Describe stack, queue and linked list operation.
Implement appropriate sorting/searching technique for given problem.
List of Experiments:
1. Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions.
2. WAP using templates to sort a list of elements. Give user the option to perform sorting using Insertion sort, Bubble sort or Selection sort.
3. Implement Linked List and Include functions for insertion, deletion and search of a number, reverse the list and concatenate two linked lists.
4. Implement Doubly Linked List. Include functions for insertion, deletion and search of a number, reverse the list.
5. Implement Circular Linked List. Include functions for insertion, deletion and search of a number, reverse the list.
6. Perform Stack operations using Linked List implementation.
7. Perform Stack operations using Array implementation.
8. Perform Queues operations using Circular Array implementation.
11. WAP to calculate factorial and to compute the factorial of a given no. (i)using recursion, (ii) using iteration
12. (ii) WAP to display Fibonacci series (i)using recursion, (ii) using iteration
13. WAP to calculate GCD of 2 number (i) with recursion (ii) without recursion
14. WAP to create a Binary Search Tree and include following operations in tree:
(a) Insertion (Recursive and Iterative Implementation)
(b) Deletion by copying
(c) Deletion by Merging
(d) Search a no. in BST
(e) Display its preorder, postorder and inorder traversals Recursively
(f) Display its preorder, postorder and inorder traversals Iteratively.
Note: List of programs may be changed by the concern teacher
BCS-305 HTML PROGRAMMING
Skill Enhancement Course SEC: 01 Marks: 100 Total Credit: 02 Course Outcome: At the end of course, Students will be able to
Adapt HTML syntax and semantics to build web pages.
Construct and visually format tables and forms using HTML and CSS.
Illustrate the Semantic Structure of HTML and CSS.
Learn how to combine basic HTML elements to create Web pages.
Understand how to use HTML tags and tag attributes to control a Web page’s appearance.
Learn how to use tables and frames as navigational aids on a Web site.
UNIT-I
HTML Basics: HTML Introduction, HTML History, HTML Versions, HTML Elements, Attributes, HTML Headings, Paragraphs, HTML Formatting, Fonts, Styles, HTML Links, Images, Tables.
UNIT-II
HTML Elements: HTML Lists, Forms, Frames, HTML Colors, Color names, Color values, HTML Quick List. Introduction to HTML5, HTML5 - New standard for HTML, XHTML, The HTML DOM, How Did HTML5 Get Started, Rules for HTML5, New Features, Some of the most interesting new features in HTML5, Browser Support, New Elements in HTML5, New Markup Elements, New Media Elements, The Canvas Element, New Form Elements, New Input Type Attribute Values, Video on the Web, Video Formats, How It Works, All
UNIT-III
HTML5 - Audio and Canvas: Audio on the Web, Audio Formats, How It Works, All Attributes, Canvas, Create a Canvas Element, Draw With JavaScript, Understanding Coordinates, More Canvas Examples, HTML5 Web Storage, Storing Data on the Client, The localStorage Object, The sessionStorage Object.
UNIT-IV
HTML5 - Input Types: HTML5 New Input Types, Browser Support, Input Type – email, Input Type – url, Input Type – number, Input Type – range, Input Type - Date Pickers, Input Type – search, Input Type – color.
UNIT-V
HTML5 Form Elements and Attribute: HTML5 New Form Elements, Browser Support, data list Element, keygen Element, output Element, HTML5 Form Attributes, HTML5 New Form Attributes, Browser Support, autocomplete Attribute, autofocus Attribute, form Attribute, Form Override Attributes, height and width Attributes, st Attribute, min, max and step Attributes, multiple Attribute, novalidate Attribute, pattern Attribute, placeholder Attribute, required Attribute: HTML5 Tag Reference, HTML5 Global Attributes, HTML5 Event Attributes, Global Event Attributes, Window Event Attributes, Form Events, Keyboard Events, Mouse Events, Media Events.
TEXT/REFERENCE BOOKS:
1.VirginiaDeBolt,Integrated HTML and CSSA Smarter, Faster Way to LearnWiley/ Sybex, 2006
2. Cassidy Williams, Camryn Williams Introduction to HTMLand CSS, O'Reilly, 2015
BCS-306 OPERATION RESEARCH
General Elective GE: 03 Marks: 100 Total Credit: 06 Course Outcome: At the end of course, Students will be able to
Formulate and solve mathematical model (linear programming problem) for a physical situations like production, distribution of goods and economics.
Solve the problem of transporting the products from origins to destinations with least transportation cost. Convert and solve the practical situations into non-linear programming problem.
Identify the resources required for a project and generate a plan and work schedule
Understand the theoretical workings of the simple method for linear programming and perform iterations of it by hand.
UNIT-I
Introduction to Operation Research: Introduction and History, Definition and concept, Characteristics or significant features of Operations research, General methods for solving Operations Research Models, Phases of Operations Research methods, Scope, Shortcomings, Applications, Techniques.
UNIT-II
Linear Programming: Introduction, Salient features of linear programming (Terminology), Advantages, Limitations, Applications, Formulation of linear programming model, Simplex method.
UNIT-III
Transportation Problems: Introduction, North West Corner Method, Vogel’s Approximation Method, Optimality test: Stepping stone method and MODI method.
UNIT-IV
Assignment Models: Introduction, mathematical formulation of the problem, Hungarian method, Sample Problems, Special cases in assignment.
UNIT-V
Sequencing Problems: Introduction, general sequencing formula, Processing n jobs through two machines, Processing n jobs through three machines, Processing n jobs through m machines.
TEXT BOOKS:
1. Manohar Mahajan, “Operations Research”, Dhanpat Rai &Co., 2013.
2. P. SankaraIyer, “Operations Research”, Tata McGraw-Hill, 2008.
3. A.M. Natarajan, P. Balasubramani, A. Tamilarasi, “Operations Research”, Pearson Education, 2005.
REFERENCE BOOKS:
1. J K Sharma., “Operations Research Theory & Applications , 3e”, Macmillan India Ltd, 2007.
2. P. K. Gupta and D. S. Hira, “Operations Research”, S. Chand & co., 2007.
3. J K Sharma., “Operations Research, Problems and Solutions, 3e”, Macmillan India Ltd. 4. N.V.S. Raju, “Operations Research”, HI-TECH, 2002
BCS-307 E-COMMERCE
General Elective GE: 03 Marks: 100 Total Credit: 06 Course Outcome: At the end of course, Students will be able to
Analyze the impact of E-commerce on business models and strategy
Describe Internet trading relationships including Business to Consumer, Business-to
Business, Intra-organizational.
Describe the infrastructure for E-commerce.
Discuss legal issues and privacy in E-Commerce.
Define and analyze the principles of E-commerce and basics of World Wide Web.
Define and analyze the concept of E-banking, electronic payment system.
UNIT-I
Introduction to Electronic commerce: WhatisE-Commerce(IntroductionAnd Definition),MainactivitiesE-Commerce,GoalsofEcommerce,TechnicalComponentsofE-Commerce,FunctionsofEcommerce,AdvantagesanddisadvantagesofE-Commerce,Scopeof E-Commerce, Electronic CommerceApplications,ElectronicCommerceand Electronic Business(C2C)(C2G,G2G, B2G,B2P, B2A, P2P,B2A, C2A,B2B,B2C)
UNIT-II
Internet and WWW: Evolution of Internet, Domain Names and Internet, Organization (.edu,.com,.mil,.gov,.netetc.),TypesofNetwork,InternetService. Provider,WorldWideWeb,Internet&Extranet,RoleofInternetinB2BApplication,buildingownwe bsite,Cost, Time, Reach, Registering aDomain Name, Web promotion, Target email,Banner, Exchange, Shopping Bots.
UNIT-III
Electronic Data Exchange: Introduction, Concepts of EDI and Limitation, Applications of EDI, Disadvantages of EDI, EDImodel,Electronic Payment System: Introduction, Types of ElectronicPayment System, Payment Types, ValueExchangeSystem, Credit Card System, ElectronicFund Transfer, Paperless bill, ModernPayment Cash, ElectronicCash.
UNIT-IV
PlanningforElectronicCommerce PlanningElectronicCommerceinitiates, Linking objectives to business strategies, Measuring cost objectives, Comparingbenefits to Costs, Strategies for developing electroniccommerceweb sites.
UNIT-V
Internet Marketing ThePROSand CONSofonlineshopping, The cons ofonline shopping,JustifyingInternet business, Internet marketingtechniques, TheE-cycleof Internet marketing, Personalization ecommerce
TEXT/REFERENCE BOOKS:
1. G.S.V.Murthy, E-Commerce Concepts,Models,Strategies-:-HimalayaPublishingHouse, 2011.
2.Kamlesh K Bajaj and Debjani Nag, E-Commerce, 2005.
3. GrayP. Schneider,Electronic commerce,International Student Edition, 2011.
4. Henrychan, Raymondlee, Tharamdillon, Elizabethchang.
5. E-Commerce, Fundamentals And Applications, Wiley Student Edition, 2011