EXPERIMENTS

1. Write an algorithm and program to perform matrix multiplication of two n * n matrices on the 2-D
mesh SIMD model.
2. Write an algorithm and program to perform matrix multiplication of two n * n matrices on
Hypercube SIMD Model
3. Write an algorithm and program for Block oriented Matrix Multiplication on multiprocessor
system
4. Study of Scalability for Single board Multi-board, multi-core, multiprocessor using Simulator
5. Study of various computer Architecture (MIPS, Power etc.) using simulator.
6. Study of Memory and system controllers, Interrupt and DMA controllers using simulator.

Textbooks
1. Hennessey and Patterson, Computer Architecture: A quantitative Approach, Morgan Kaufman.
2. Kai Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability,
McGraw-Hill.
3. SIMA, Advanced Computer Architectures, Addison-Wesley.
Reference books
1. H.S. Stone, High-performance Computer Architecture, 3rd edition, Addison-Wesley, 1993.
2. Patterson, D. A. and Hennessy, J. L., Computer Organization and Design: The Hardware/
Software Interface, Morgan Kaufmann, 1998.

BCS-30 SEMINAR
Course category : Audit Course (AC)
Pre-requisite Subject : NIL
Contact hours/week : Lecture : 0, Tutorial : 0 , Practical: 6
Number of Credits : 3
Course Assessment : Continuous assessment through quality of material, presentation,
methods quality & extent of external response of question asked and
participation in other seminars (attendance)
Course Outcomes : The students are expected to be able to demonstrate the
following knowledge, skills and attitudes after completing this
course

1. To expose students to the 'real' working environment and get acquainted with the
organization structure, business operations and administrative functions.
2. Students will demonstrate the ability to distinguish opinions and beliefs from
researched claims and evidence and recognize that kinds of evidence will vary from
subject to subject.
3. Students will demonstrate the ability to evaluate, credit, and synthesize sources.

43
BCS-31 PRINCIPLE OF COMPILER DESIGN
Course Category : Department Core (DC)
Pre-requisite Subject : NIL
Contact Hours/Week : Lecture : 3, Tutorial : 1 , Practical: 2
Number of Credits : 5
Course Assessment : Continuous assessment through tutorials, attendance, home
Methods assignments, quizzes, practical work, record, viva voce and
Three Minor tests and One Major Theory & Practical
Examination
Course Outcomes : The students are expected to be able to demonstrate the
following knowledge, skills and attitudes after completing this
course.

1. Define the phases of a typical compiler, including the front--‐ and back--‐ end.
2. Identify tokens of a typical high--‐level programming language; define regular
expressions for tokens and design; implement a lexical analyzer using a typical scanner
generator.
3. Explain the role of a parser in a compiler and relate the yield of a parse tree to a grammar
derivation; design and implement a parser using a typical parser generator.
4. Apply an algorithm for a top--‐down or a bottom--‐up parser construction; construct a
parser for a small context--‐free grammar.
5. Explain the role of a semantic analyzer and type checking; create a syntax--‐directed
definition and an annotated parse tree; describe the purpose of a syntax tree.
6. Explain the role of different types of runtime environments and memory organization for
implementation of typical programming languages.
7. Describe the purpose of translating to intermediate code in the compilation process.
8. Design and implement an intermediate code generator based on given code patterns

Topics Covered
UNIT-I
CompilerStructure:Analysis-SynthesisModelofCompilation,Various Phases of A Compiler, Tool 9
Based Approach to Compiler Construction Lexical Analysis: Interface with Input, Parser and
Symbol Table, Token, Lexeme and Patterns, Difficulties in Lexical Analysis, Error Reporting,
and Implementation. Regular Definition, Transition Diagrams, LEX.
UNIT-II
Syntax Analysis: Context Free Grammars, Ambiguity, Associativity, Precedence, Top Down 9
Parsing, Recursive Descent Parsing, Transformation on the Grammars, Predictive Parsing,
Bottom Up Parsing, Operator Precedence Grammars, LR Parsers (SLR, LALR, LR), YACC.

44
UNIT-III
Syntax Directed Definitions: Inherited and Synthesized Attributes, Dependency Graph, 9
Evaluation Order, Bottom Up and Top Down Evaluation Of Attributes, L- and S-Attributed
Definitions.
Type Checking: Type System, Type Expressions, Structural and Name Equivalence of Types,
Type Conversion, Overloaded Functions and Operators, Polymorphic Functions.
Intermediate Code Generation: Intermediate Representations, Translation of Declarations,
Assignments Intermediate Code Generation For Control Flow, Boolean Expressions and
Procedure Calls, Implementation Issues.
UNIT-IV
Symbol Table Management, Runtime Environments, Source Language Issues, Storage 9
Organization, Storage Allocation Strategies, Access to Non-Local Names, Parameter Passing.
Code Optimization, Peephole Optimization, Source of Optimizations, Optimization of Basic
Blocks, Loops, Global Dataflow Analysis, Introduction to Code Generation.

EXPERIMENTS
1. Write a program using Lex to calculate the number of characters, number of words and the number
of lines present in the given text file as input.
2. Write a program using Lex to implement the set of regular expression and indicates the acceptance
of a given string for a particular regular expression.
3. Write a C program to implement the conversion of regular expression to non-deterministic finite
automation
4. Write a program using Yacc to check whether a string belong to the given grammar or not.
5. Write a C program to compute FIRST and FOLLOW of the non-terminals of given grammar.
6. Write a C program to check the given grammar is Left recursive and remove Left recursion.
7. Write Syntax Directed Translation actions using Yacc to generate Parse Tree for the grammar for
arithmetic expressions.
8. Write Syntax Directed Translation actions using Yacc to translate arithmetic expressions into Post-
fix form.
9. Write Syntax Directed Translation actions using Yacc to translate arithmetic expressions into three
address code.

Textbooks
1. A.V. Aho, M.S. Lam, R. Sethi, and J.D. Ullman, Compilers: Principles, Techniques, and Tools,
Pearson Education, 2007 (second ed.).
2. K.D. Cooper, and L. Torczon, Engineering a Compiler, Elsevier, 2004.
Reference books
1. AW Appel, J Palsberg, Modern Compiler Implementation in JAVA, Cambridge University
Press, 2002
2. AW Appel, M Ginsburg, Modern Compiler Implementation in C, Cambridge University Press.

45
BCS-32 ARTIFICIAL INTELLIGENCE
Course Category : Department Core (DC)
Pre-requisite Subject : NIL
Contact Hours/Week : Lecture : 3, Tutorial : 1 , Practical: 2
Number of Credits : 5
Course Assessment : Continuous assessment through tutorials, attendance, home
Methods assignments, quizzes, practical work, record, viva voce and
Three Minor tests and One Major Theory & Practical
Examination
Course Outcomes : The students are expected to be able to demonstrate the
following knowledge, skills and attitudes after completing this
course.

1. The intelligent agents--software or hardware entities that perform useful tasks with
some degree of autonomy.
2. An understanding of the basic areas of artificial intelligence including problem
solving, knowledge representation, reasoning, decision making, planning, perception
and action, and learning -- and their applications (e.g., data mining, information
retrieval)
3. Design and implement key components of intelligent agents of moderate complexity in
JAVA and /or Lisp or Prolog and evaluate their performance.
4. Develop familiarity with current research problems, research methods, and the
research literature in AI

Topics Covered
UNIT-I
Artificial Intelligence Introduction, Intelligent Agents, Solving Problems by Searching Beyond 9
Classical Search Adversarial Search Constraint Satisfaction Problems
UNIT-II
Knowledge and Reasoning Logical Agents First-Order Logic Inference in First-Order Logic 9
Classical Planning and Acting in the Real World Knowledge Representation Uncertain
Knowledge and Reasoning Quantifying Uncertainty Probabilistic Reasoning Probabilistic
Reasoning over Time 16 Making Simple Decisions Making Complex Decisions
UNIT-III
Planning and Acting in the Real World Definition of Classical Planning Algorithms for Planning 9
as State-Space Search Planning Graphs Classical planning as Boolean Satisfiability
Representing temporal and resource constraints Planning and Acting in Nondeterministic
Domains. Knowledge Representation Acting under Uncertainty Probabilistic Reasoning Time
and Uncertainty Learning from Examples Knowledge in Learning Probabilistic Models
Reinforcement Learning
UNIT-IV

46
Forms of Learning Supervised Learning, Decision Trees Evaluating and Choosing the Best 9
Hypothesis A Logical Formulation of Learning Statistical Learning with Complete Data Natural
Language Processing Communicating, Perceiving, and Acting Natural Language Processing
Natural Language for Communication Perception Robotics

EXPERIMENTS
1. Write the program to solve the water jug problem using production rule set.
2. Write the program to solve the water jug problem using A* ALGORITHM.
3. Write the program to solve the 8 puzzle problem using A* ALGORITHM.
4. Write the program to solve the salesman problem using A* ALGORITHM.
5. Write the program to solve the farmer transfer three belonging form one side of the river to
other side using AO* ALGORITHM.
6. Write the program to solve the DISEASE problem using Bayesian reasoning.
7. Write the program to solve the Object finding problem using Bayesian reasoning.
8. Write the program to solve the Object finding problem using D S theory
9. Write the program to solve the Decision Trees Evaluating.
10. Write the program for walk, drive, take the bus, take a cab, and fly problem using mean end
analysis.

Textbooks
1. S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”, Second Edition, Pearson
Education, 2012
Reference books
2. David Poole, Alan Mackworth, Randy Goebel, Computational Intelligence: a logical approach,
Oxford University Press, 2012.
3. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problem solving”,
Fourth Edition, Pearson Education, 2012
4. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers, 1998

BCS-33 WEB TECHNOLOGIES

Course Category : Department Core (DC)
Pre-requisite Subject : NIL
Contact Hours/Week : Lecture : 3, Tutorial : 1 , Practical: 2
Number of Credits : 5
Course Assessment : Continuous assessment through tutorials, attendance, home
Methods assignments, quizzes, practical work, record, viva voce and
Three Minor tests and One Major Theory & Practical
Examination
Course Outcomes : The students are expected to be able to demonstrate the
following knowledge, skills and attitudes after completing this
course.

47
1. Identify common design mistakes when creating a web based application.
2. Discuss the process of editing a web page using text editors and web page editors
3. Cover commonly used HTML tags and discuss how this knowledge is important to a
web designer
4. Demonstrate an understanding of basic CSS, XML, JAVA Script, JSP, ASP.NET and
PHP

Topics Covered
UNIT-I
Introduction to WWW- World Wide Web, WWW Architecture, Web Search Engines, Web 9
Crawling, Web Indexing, Web Searching, Search Engines Optimization and Limitations, Web
Mining: Web Content Mining, Web Structure Mining, Web Usage Mining
UNIT-II
Markup Language Basics: SGML, HTML, CSS And XML 9
SGML: Standard Generalized Markup Language (SGML) -Structures, Elements, Content
Models, DTD, Attributes Entities.
HTML: Designing Web Pages With HTML-Use Of Tags, Hyperlinks, URLs, Tables, Text
Formatting, Graphics & Multimedia, Imagemap, Frames and Forms in Web Pages.
CSS: Use of Cascading Style Sheet in Web Pages.
XML: Extensible Markup Language (XML): Introduction using User-Defined Tags in Web
Pages, Displaying XML Contents, XML Dtds, Use of XSL
UNIT-III
Client-Side Scripting using JAVA Script 9
JAVA script Overview; Constants, Variables, Operators, Expressions & Statements; User-
Defined & Built-in Functions; Client-Side Form Validation; Using Properties and Methods of
Built-in Objects
UNIT-IV
Server-Side Scripting Using JSP, ASP.NET And PHP 9
JSP :Introduction to JSP, JSP Architecture, JSP Directives, JSP Scripting Elements, Default
Objects in JSP, JSP Actions, JSP with Beans and JSP with Database, Error Handling in JSP,
Session Tracking Techniques in JSP, Introduction to Custom Tags.
ASP.NET : ASP.Net Coding Modules, ASP.NET Page Directives, Page Events and Page Life
Cycle , Postback and Crosspage Posting ASP.NET Server Controls , HTML Controls,
Validation Controls, Building Databases .
PHP(Hypertext Preprocessor)-Introduction, Syntax, Variables, Strings, Operators, If- Else,
Loop, Switch, Array, Function, Form ,Mail, File Upload, Session, Error, Exception, Filter, PHP-
ODBC

EXPERIMENTS
1. Create a HTML static web page which shows the use of different tags in that.
2. Insert an image and create a link such that clicking on image takes user to other page.
3. Prepare a sample code to illustrate three types of lists in HTML.
4. Use tables to provide layout to your HTML page describing your university infrastructure

48
5. Use frames such that page is divided into 3 frames 20% on left to show contents of pages, 60%
in center to show body of page, remaining on right to show remarks.
6. Create a simple form that will show all the INPUT METHODS available in HTML.
7. Create a sample code to illustrate the Embedded, External and Inline style sheets for your web
page.
8. Write down simple JAVA Script using timeout such that image will be changed after every 1
ms at a specified position.
9. Design a registration form and validate its field by using JAVA script.
10. Write an XML example of given tree that demonstrates the creation of user-designed tags and
display it in a browser.
11. college, employee, fname, lname, joindate, bdate, age, salary (with atleast 3 elements)
12. Write a program in XML for creation of DTD which specifies a particular set of rules.
13. Create a bean student with attributes (first name, last name, age, class). In another JSP page
display the bean values using <jsp:usebean>.
14. Write a program to use JDBC connectivity program for maintaining database by sending
queries through JSP Page.
15. Use ad-rotator to change advertisements on client side request.(ASP.NET)
16. Implement Session tracking using user authentication in ASP.NET.
17. Write a PHP script to create a database Student DB.
18. Write a PHP program to store page views count in SESSION, to increment the count on each
refresh, and to show the count on web page.

Textbooks
1. Uttam K. Roy, Web Technologies, 1/e, Oxford University Press, USA
2. M. Srinivasan, Web Technology: Theory and Practice, Pearson Education India
3. Deitel, Deitel and Nieto, Internet and Worldwide Web - How to Program, 5th Edition, PHI,
2011.
4. Ralph Moseley & M. T. Savaliya , Developing Web Application- Second Edition, Wiley
5. Miller/Kirst, Web Programming Step by Step, Stepp, 2nd edition, 2009
6. Ullman , PHP for the Web: Visual Quick Start Guide, Pearson Education, 4th edition, 201
7. www.w3c.org
8. www.w3schools.com
Readings:
Various journal and conference articles, research reports, and book excerpts as appropriate
Reference books
1. Ivan Bayross , Web Enabled Commercial Application Development Using HTML, DHTML,
JAVA Script, Perl & CGI, BPB Publication, 2005
2. Hans Bergsten, JAVA Server Pages, O‟Reilly.

BCS-34 COMPUTER NETWORKS

Course Category : Department Core (DC)
Pre-requisite Subject : NIL
Contact Hours/Week : Lecture : 3, Tutorial : 1 , Practical: 2

49
Number of Credits : 5
Course Assessment : Continuous assessment through tutorials, attendance, home
Methods assignments, quizzes, practical work, record, viva voce and
Three Minor tests and One Major Theory & Practical
Examination
Course Outcomes : The students are expected to be able to demonstrate the
following knowledge, skills and attitudes after completing
this course

1. Understand the concepts of communication architecture and protocols

2. Identify different types of communication mediums and techniques
3. Define and identify different types of multiplexing, data encoding, modulation, and
switching techniques
4. Illustrate different standards of Local Area Network in terms of technologies and
hardware used
5. Illustrate network addressing and analysis techniques
6. Understand the Wide Area Network technologies
7. Understand the network routing concepts
8. Understand the internetworking concepts and architectures
9. Understand the TCP/IP protocols and design architectures

Topics Covered
UNIT-I
Introductory Concepts: Goals and Applications of Networks, Network Structure and 9
Architecture, OSI Reference Model, Services, Networks Topology, Physical Layer-
Transmission, Switching Methods, LAN Inter Connection Devices, Integrated Services Digital
Networks.
UNIT-II
Medium Access Sub Layer: Channel Allocations, LAN Protocols, ALOHA Protocols- Pure 9
ALOHA, Slotted ALOHA, Carrier Sense Multiple Access Protocols, CSMA with Collision
Detection, Collision Free Protocols, IEEE Standards, Ethernet, FDDI, Data Link Layer- Basic
Design Issues, Error Correction & Detection Algorithms, Elementary Data Link Layer
Protocols, Sliding Window Protocols, Error Handling, High Level Data Link Control
UNIT-III
Network Layer: Packet Switched Networks – IP – ARP – RARP –DHCP – ICMP – Queuing 9
Discipline – Routing Algorithms, Congestion Control Algorithms, Internetworking, TCP/IP
Protocol, IP Addresses, Ipv4 and Ipv6.
UNIT-IV
Transport Layer: Design Issues, Connection Management, Internet Transport Protocol (UDP), 9
Transmission Control Protocol. (TCP) -Adaptive Retransmission Congestion Control

50
Congestion Avoidance – QOS.
Application Layer: Domain Name System, Electronic Mail (Email), File Transfer Protocol,
Hyper Text Transfer Protocol, Introduction To Cryptography and Network Security.

EXPERIMENTS
1. To create scenario and study the performance of CSMA/CD protocol through simulation.
2. To create scenario and study the performance of token bus and token ring protocols through
simulation.
3. Implementation of Error detection and correction algorithms.
4. Implementation and study of 1-bit sliding window viz., stop and wait protocol.
5. Implementation and study of Go back-N protocol.
6. Implementation and study of selective repeat protocol.
7. To get the MAC or Physical address of the system using Address Resolution Protocol.
8. Implementation of distance vector routing algorithm.
9. Implementation of link state routing algorithm.
10. To write a client-server application for chat using TCP.
11. To write a C program to develop a DNS client server to resolve the given hostname.

Textbooks
1. Forouzan, Data Communication and Networking, TMH
th
2. A. S Tanenbaum, Computer Networks, 4 , Edition”, Pearson education
Reference books
1. W. Stallings , Data and Computer Communication , Macmillan Press
2. Comer , Computer Networks & Internet with Internet Applications, Pearson Education
3. Comer, Internetworking with TCP/IP, 6th Edition, PHI
4. W Stallings, Computer Networks with Internet Protocols, Pearson Education
5. W Stallings, Local and Metropolitan Area Networks, 6th edition, Pearson Education

BCS-35 SOFTWARE ENGINEERING

Course Category : Department Core (DC)
Pre-requisite Subject : NIL
Contact Hours/Week : Lecture : 3, Tutorial : 1 , Practical: 2
Number of Credits : 5
Course Assessment : Continuous assessment through tutorials, attendance, home
Methods assignments, quizzes, practical work, record, viva voce and
Three Minor tests and One Major Theory & Practical
Examination
Course Outcomes : The students are expected to be able to demonstrate the
following knowledge, skills and attitudes after completing this
course.

51
1. Enhance the Software Project Management skills.
2. Develop functioning software which benchmarks to the international standards.

Topics Covered
UNIT-I
Software Process– Introduction, S/W Engineering Paradigm , Life Cycle Models (Waterfall, 9
Incremental, Spiral, Evolutionary, Prototyping), Software Requirements –Functional And Non-
Functional–Software Document– Requirement Engineering Process–Feasibility Studies –
Software Prototyping–Prototyping in Software, Process–Data–Functional and Behavioral
Models– Structured Analysis And Data Dictionary.
UNIT-II
Basic Concept of Software Design, Architectural Design, Low Level Design: Modularization, 9
Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design
Strategies: Function Oriented Design, Object Oriented Design, Top-Down and Bottom-Up
Design. Software Measurement and Metrics: Various Size Oriented Measures: Halestead‟s
Software Science, Function Point (FP) Based Measures, Cyclomatic Complexity Measures:
Control Flow Graph.
UNIT-III
Software Testing – Taxonomy of S/W Testing Levels - Black Box Testing – Testing Boundary 9
Conditions – Structural Testing –– Regression Testing– S/W Testing Strategies, Unit Testing,
Integration Testing, Validation Testing, System Testing and Debugging.
UNIT-IV
Measures and Measurements – Zipf‟s Law, Software Cost Estimation – Function Point Models, 9
COCOMO Model. Delphi Method – Scheduling – Earned Value Analysis – Error Tracking –
Software Configuration Management – Program Evolution Dynamics – Software Maintenance –
Project Planning – Project Scheduling– Risk Management – Case Tools

EXPERIMENTS
1. Identifying the Requirements from Problem Statements
2. Estimation of Project Metrics
3. Modeling UML Use Case Diagrams and Capturing Use Case Scenarios
4. E-R Modeling from the Problem Statements
5. Identifying Domain Classes from the Problem Statements
6. State chart and Activity Modeling
7. Modeling UML Class Diagrams and Sequence diagrams
8. Modeling Data Flow Diagrams
9. Estimation of Test Coverage Metrics and Structural Complexity
10. Designing Test Suites

Textbooks
1. R. S. Pressman, "Software Engineering - A practitioners approach", 3rd Edition, McGraw Hill
International editions, 1992.
Reference books
1. IAN Sommerville, Software Engineering, Pearson Education Asia, VI Edition, 2000.

52