BCA Syllabus
BCA Syllabus
Mangalayatan University
Beswan, Aligarh – 202145
2022-25
1
Ist Semester
Course Code: A040102T L T P C
Course Name: Communicative English 2 0 0 2
Unit I Communication:
Introduction, Definition, Nature and Scope of Communication, Importance and Purpose of
Communication, Process of Communication; Encoder and Decoder, Message, Types of
Communication; Verbal and Non-Verbal Communication Personal Appearance, Gestures,
Postures, Facial Expression, Eye Contacts, Body Language (Kinesics), Time language, Silence
Inter and Intra Personal Communication.
Books Recommended:
1. You can win, Shiv Khera, Macmillan Publishers, India
2. Listening Skills: Year1/2 and P2/3 Bk.3, Graeme Beals, Jean Edwards, Prim-Ed
Publishi
ng
3. A Practical Course for developing speaking skills in English, Gangal J. K., PHI
4. A Practical Course for developing writing skills in English, Gangal J. K., PHI
5. Little Red Book: Modern Writings Skills, Terry O Brien, Rupa Publications
2
Course Code: A040102T L T P C
Course Name: Communicative English 2 0 0 2
Unit I Communication:
Introduction, Definition, Nature and Scope of Communication, Importance and Purpose of
Communication, Process of Communication; Encoder and Decoder, Message, Types of
Communication; Verbal and Non-Verbal Communication Personal Appearance, Gestures,
Postures, Facial Expression, Eye Contacts, Body Language (Kinesics), Time language, Silence
Inter and Intra Personal Communication.
Books Recommended:
1. You can win, Shiv Khera, Macmillan Publishers, India
2. Listening Skills: Year1/2 and P2/3 Bk.3, Graeme Beals, Jean Edwards, Prim-Ed
Publishi
ng
3. A Practical Course for developing speaking skills in English, Gangal J. K., PHI
4. A Practical Course for developing writing skills in English, Gangal J. K., PHI
5. Little Red Book: Modern Writings Skills, Terry O Brien, Rupa Publications
3
Paper Code: B-030103T L T P C
Paper Name: Applied Mathematics-I 3 1 0 4
Course Outcomes:
S.No. Course Outcomes (COs) Cognitive Level
1. Recall limits continuity & differentiation. Remember
2. Describe various theorems of calculus. Remember
3. Recall proper and improper integrals. Remember
4. Compute multiple integrals. Understand
5. Interpret vector calculus. Understand
Unit-III:Integral Calculus
Riemann integral, fundamental theorem of integral calculus, applications of definite integrals,
improper integrals, beta and gamma functions.
Books Recommended
1. Dass, H.K; Introduction to Engg. Mathematics, Vol-I, S.Chand
2. Bali, N. P.; Engg. Mathematics Vol-I, Laxmi Publication
3. Grewal, BS; Engg. mathematics Vol-I, Khanna Publication
4. Vashishtha, A.R.; Engg. Mathematics Vol-I, PragatiPrakashan
4
Paper Code: B-030103T L T P C
Paper: Applied Mathematics-I 3 1 0 4
Books Recommended
1. Dass, H.K; Introduction to Engg. Mathematics, Vol-I, S.Chand
2. Bali, N. P.; Engg. Mathematics Vol-I, Laxmi Publication
3. Grewal, BS; Engg. mathematics Vol-I, Khanna Publication
4. Vashishtha, A.R.; Engg. Mathematics Vol-I, PragatiPrakashan
5
Paper Code: B070101T L T P C
Paper: Problem Solving using Computer 3 1 0 4
Course outcomes:
S. Course Outcomes (COs) Cognitive Level
No.
1. Understand hardware components of computer system such as Understand
memory system organization, input/output devices, aware of software
components of computer system, and windows operating system
concepts.
2. Develops basic understanding of computers, the concept of algorithm Understand
and algorithmic thinking.
3. Develops the ability to analyze a problem, develop an algorithm to Apply
solve it.
4. Develops the use of the Python programming language to implement Analyze
various algorithms, and
5. Develops the basic concepts and terminology of programming in Create
general.
Suggested Readings:
1. P. K. Sinha & Priti Sinha , “Computer Fundamentals”, BPB Publications, 2007.
2. Dr. Anita Goel, Computer Fundamentals, Pearson Education, 2010.
3. T. Budd, Exploring Python, TMH, 1st Ed, 2011
6
4. Python Tutorial/Documentation www.python.or 2010
5. Allen Downey, Jeffrey Elkner, Chris Meyers , How to think like a computer scientist :
learning with Python , Freely available online.2012
6. Rober Sedgewick, K Wayne -Introduction to Programming in Python: An
interdisciplinary Approach" Pearson India
7
Paper Code: B070101T L T P C
Paper: Problem Solving using Computer 3 1 0 4
Course outcomes:
S. Course Outcomes (COs) Mapping
No.
1. Understand hardware components of computer system such as Employability/Skill
memory system organization, input/output devices, aware of software Development
components of computer system, and windows operating system
concepts.
2. Develops basic understanding of computers, the concept of algorithm Employability/Skill
and algorithmic thinking. Development
3. Develops the ability to analyze a problem, develop an algorithm to Skill Development
solve it.
4. Develops the use of the Python programming language to implement Skill Development
various algorithms, and
5. Develops the basic concepts and terminology of programming in Skill Development
general.
Suggested Readings:
1. P. K. Sinha & Priti Sinha , “Computer Fundamentals”, BPB Publications, 2007.
2. Dr. Anita Goel, Computer Fundamentals, Pearson Education, 2010.
3. T. Budd, Exploring Python, TMH, 1st Ed, 2011
4. Python Tutorial/Documentation www.python.or 2010
8
5. Allen Downey, Jeffrey Elkner, Chris Meyers , How to think like a computer scientist :
learning with Python , Freely available online.2012
6. Rober Sedgewick, K Wayne -Introduction to Programming in Python: An
interdisciplinary Approach" Pearson India
9
Course Code:H-000101T Course Title: Food and Nutrition
L-T-P-C: 2-0-0-2
Unit Topics
10
Paper Code: B070103T L T P C
Paper: Logical Organisation of Computers 3 1 0 4
1. M. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India Pvt. Ltd.
2. V. Rajaraman, T. Radhakrishnan, An Introduction to Digital Computer Design, Prentice
Hall of India Pvt. Ltd.
3. Andrew S. Tanenbaum, Structured Computer Organization, Prentice Hall of India Pvt.
Ltd.
4. Nicholas Carter, Schaum‟s Outlines Computer Architecture, Tata McGraw-Hill
11
Paper Code: B070103T L T P C
Paper: Logical Organisation of Computers 3 1 0 4
1. M. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India Pvt. Ltd.
2. V. Rajaraman, T. Radhakrishnan, An Introduction to Digital Computer Design, Prentice
Hall of India Pvt. Ltd.
3. Andrew S. Tanenbaum, Structured Computer Organization, Prentice Hall of India Pvt.
Ltd.
4. Nicholas Carter, Schaum‟s Outlines Computer Architecture, Tata McGraw-Hill
12
Paper Code: B070102P L T P C
Paper: Software Lab using Python 0 0 4 2
4. Apply To learn and know the concepts of file handling, exception Skill Development
handling.
5. Adapt To learn and know the concepts of database connectivity. Skill Development
13
5. WAP to calculate the mass m in a chemical reaction. The mass m (in gms) disintegrates
according to the formula m=60/(t+2), where t is the time in hours. Sketch a graph for t vs.
m, where t>=0.
6. A population of 1000 bacteria is introduced into a nutrient medium. The population p
grows as follows:
P(t) = (15000(1+t))/(15+ e)
where the time t is measured in hours. WAP to determine the size of the population at
given time t and plot a graph for P vs t for the specified time interval.
7. Input initial velocity and acceleration, and plot the following graphs depicting equations
of motion:
I. velocity wrt time (v=u+at)
II. distance wrt time ( s=u*t+0.5*a*t*t)
III. distance wrt velocity ( s=(v*v-u*u)/2*a )
Suggested Readings:
1. Allen B. Downey, “Think Python: How to Think Like a Computer Scientist”, 2nd
edition, Updated for Python 3, Shroff/O‟Reilly Publishers, 2016
(http://greenteapress.com/wp/thinkpython/)
2. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and
updated for Python 3.2, Network Theory Ltd., 2011.
3. Charles Dierbach, “Introduction to Computer Science using Python: A Computational
Problem-Solving Focus, Wiley India Edition, 2013.
4. John V Guttag, “Introduction to Computation and Programming Using Python‟‟,
Revised and expanded Edition, MIT Press , 2013
5. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE Learning,
2012.
14
Paper Code: B-070103P L T P C
Paper: Logical Organisation of Computers Lab 0 0 0 2
List of Experiments:-
1. Study and Bread Board Realization of Logic Gates. K-Map, Flip-Flop equation,
realization of characteristic and excitation table of various Flip Flops.
15
IInd Semester
Self-Study:
The self-study contents will be declared at the commencement of semester. Around 10% of the
questions will be asked from self-study contents.
16
Paper Code: MAL-1201 L T P C
Paper Name: Applied Mathematics-II 3 0 0 3
Books Recommended
1. Dass, H.K; Introduction to Engg. Mathematics, Vol-I, S.Chand
2. Bali, N. P.; Engg. Mathematics Vol-II, Laxmi Publication
3. Grewal, B.S; Engg. mathematics Vol-II, Khanna Publication
17
Paper Code: MAL-1201 L T P C
Paper Name: Applied Mathematics-II 3 0 0 3
Books Recommended
1. Dass, H.K; Introduction to Engg. Mathematics, Vol-I, S.Chand
2. Bali, N. P.; Engg. Mathematics Vol-II, Laxmi Publication
3. Grewal, B.S; Engg. mathematics Vol-II, Khanna Publication
18
Paper Code: B070203T L T P C
Paper: Management Information System 3 1 0 4
19
Paper Code: B070203T L T P C
Paper: Management Information System 3 1 0 4
Course outcomes focused on employability/ entrepreneurship/ skill development
S. No. Course Outcomes (COs) Mapping
1. Relate the basic concepts and technologies used in the field of Employability/Skill
management information systems;. Development
2. Compare the processes of developing and implementing information Employability/Skill
systems. Development
3. Outline the role of the ethical, social, and security issues of information Employability/Skill
systems. Development
4. Translate the role of information systems in organizations, the strategic Employability/Skill
management processes,with the implications for the management. Development
5. Apply the understanding of how various information systems like Employability/Skill
DBMS work together to accomplish the information objectives of an Development
organization.
UNIT-I: Introduction
Database System Concepts, File system vs. database system, Database system architecture, Data
models and their types, Data base scheme and instances, Data independence, Database
Languages and Interfaces.
UNIT-II: Data Modeling Concepts: ER model concepts: Notations for ER diagram, Extended
E-R diagram, Extended E-R model, E-R model design issues, constraints, and keys:Weak entity
set strong entity set, Relationships of higher degree. Relational model concepts: code rules,
constraints, Relational Algebra operations, Extended relational algebra operations, Relational
Calculus, Tuple and Domain relational calculus.
Suggested Readings:
1. Henry F. Korth and Abraham Silberschatz, "Database System Concepts," Second Edition,
McGraw Hill, 1991.
2. AtulKahate, "Introduction to Database Management Systems," Pearson India, 2004.
3. Raghu Ramakrishnan and Johannes Gehrike, "Database Management Systems," Third
McGraw Hill, Edition, 2003.
4. R. Elmasri, S.B. Navathe Database Systems Models, Languages, Design and application
Programming, 6 Edition, Pearson Education,2013.
5. Silberschatz, H.F. Korth, S. Sudarshan, Database System Concepts 6th Edition, McGraw
Hill, 2010.
6. C.J Date " An Introduction to Database Systems", Addison Wesley
21
Paper Code: B070201P L T P C
Paper: Database Management System Lab 0 0 4 2
List of Experiments
1. Creation of databases and execution of SQL queries.
2. Creation of Tables using MySQL: Data types, Creating Tables (along with Primary and
Foreign keys), Altering Tables and Dropping Tables.
3. Practicing DML commands- Insert, Select, Update, Delete.
4. Practicing Queries using ANY, ALL, IN, EXISTS, NOT, EXISTS, UNION,
INTERSECT, and CONSTRAINTS, etc.
5. Practice Queries using COUNT, SUM, AVG, MAX, MIN, GROUP BY, HAVING,
VIEWS Creation and Dropping.
6. Use of COMMIT, ROLLBACK and SAVEPOINT.
7. Practicing on Triggers - creation of trigger, Insertion using trigger, Deletion using
trigger, Updating using trigger.
8. To remove the redundancies and anomalies in the above relational
tables, Normalize up to Third Normal Form.
23
32. A Hostel Management System for a University requires a computerized system to
automize its operations that support the following activities:
⮚ Registration for UG/PG students
⮚ Hostel Rooms Allocation
⮚ Hostel Warden
⮚ Hostel Mess
⮚ Basic amenities in the room
⮚ Hostel community room maintenance
⮚ Maintenance/complaints handling (lights, fans, taps, electricity, stair-case lighting
etc.,)
⮚ Query support
⮚ Report generation
Perform the following tasks:
a. Using any of the drawing tools like smartdraw, dia, visio, conceptdraw etc. or else
by your own hand, draw the complete ER diagram for the above event
management system by identifying the entities, relationships, cardinality and key
constraints. Follow proper conventions.
b. (Create database to support/accommodate all the functionalities referred above.
Perform Normalization till required NF and prepare Normalized tables.
c. Using MySQL, implement by designing various forms to support the above
modules
d. Report generation should include the expenditure statement for list of students
along with room-nos., reports of expenditure in hostel-mess, expenditure incurred
in hostel maintenance etc.
Note: The instructors should design detailed experiments based on above suggested experiments.
MySQL may be used
Suggested Readings:
1. Paul DuBois, “MySQL Cookbook: Solutions for Database Developers
and Administrators,” Third Edition, O'Reilly Media, 2014.
2. Frank M. Kromann, “Beginning PHP and MySQL: From Novice to Professional,”
Fifth Edition, Apress, 2018.
3. Joel Murach and Ray Harris, “Murach‟s PHP and MySQL,” First Edition, Mike Murach
& Associates, 2010.
4. Luke Welling, Laura Thomson, “PHP and MySQL Web Development,” Fourth Edition,
Addison-Wesley, 2008.
24
Paper Code: B070202T L T P C
Paper: C- Programming 3 1 0 4
Introduction to „C‟ Language, Pre Processor, Program Element (Token, Keyword, Data Type,
Variable, Delimiter, Identifiers, Constant, Library Function, Conversion Specifies, Operators).
Program control statement: Sequential Statement, Decision Statement and looping statement.
Array (One Dimensional, Two Dimensional, Multi Dimensional), Array of Character, Sting
Manipulation using Library Function, Function (Call by Value, Call by Reference, Recursion),
Different Storage Classes.
User Defined Data Types (Structure, Union and Enumeration), Pointers in 'C', Pointer
Arithmetic, Pointer Comparison, Pointer to Array, Pointer to Structure, Pointer to Function,
Pointer to Pointer, Dynamic Memory Allocation, Type Def.
25
Paper Code: B070202P L T P C
Paper: C - Programming Lab 0 0 2 2
Course Outcomes:
S. No. Course Outcomes (COs) Cognitive Level
1. Use and handle the various office based tasks. Knowledge
2. Write, debug and run a sample program in C Understand
3. Differentiate the variables and constants and understand how Understand
decision making statements are written.
4. Understand and use the basic programming constructs of C and Apply
learn C data types, memory allocation/de-allocations, functions
and pointers.
5. Create a simple real life applications using C. Apply
26
IIIrd Semester
Unit-I: Introduction
Operating system and functions, Classification of Operating systems: Batch, Interactive, Time
sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multithreaded
Systems, Operating System Structure, System Components, Operating System Services,
Kernels, Monolithic and Microkernel Systems.
Unit-II: Process Management
Process Concept, Process States, Process Synchronization, Critical Section, Mutual
Exclusion, Classical Synchronization Problems, Process Scheduling, Process States, Process
Transitions, Scheduling Algorithms Interprocess Communication, Threads and their
management, Security Issues.
Unit-III: CPU Scheduling
Scheduling Concepts, Techniques of Scheduling, Preemptive and Non- Preemptive
Scheduling: First-Come-First-Serve, Shortest Request Next, Highest Response Ration Next,
Round Robin, Least Complete Next, Shortest Time to Go, Long, Medium, Short Scheduling,
Priority Scheduling. Deadlock: System model, Deadlock characterization, Prevention,
Avoidance and detection, Recovery from deadlock.
Suggested Readings:
1. Andrew S. Tanenbaum and Herbert Bos,"Modern Operating Systems," Fourth Edition,
Pearson, 2014.
27
2. Abraham Silberschatz, Greg Gagne, and Peter B. Galvin, "Operating System
Concepts," Tenth Edition, Wiley, 2018.
3. William Stallings, "Operating Systems: Internals and Design Principles," Seventh
Edition, Prentice Hall, 2011.
4. Dhanjay Dhamdhere, "Operating Systems," First Edition, McGraw-Hill, 2008
5. Milan Milankovic "Operating systems, Concepts and Design" McGraw Hill
28
Paper Code: B070302T L T P C
Paper: Analysis of Algorithm and Data Structures 3 1 0 4
Unit-I: Introduction
Basic Design and Analysis techniques of algorithms, time and space complexity, Correctness
of Algorithm, Algorithm Design Techniques: Iterative techniques, Divide and Conquer,
Dynamic Programming, Greedy Algorithms. Sorting Techniques: Elementary sorting
techniques-Bubble Sort, Insertion Sort, Merge Sort, Advanced Sorting techniques-Heap Sort,
Quick Sort, Sorting in Linear Time- Bucket Sort, Radix Sort and Count Sort
Linear and Binary search, Medians & Order Statistics. Arrays: Single and Multi-dimensional
Arrays, Sparse Matrices;
Unit – III: Stacks and Queues : Implementing stack using array and linked list, Prefix, Infix
and Postfix expressions, Utility and conversion of these expressions from one to another;
Array and Linked representation of Queue, De-queue, Priority Queues
Singly, Doubly and Circular Lists, representation of Stack and Queue as Linked Lists.
Suggested Readings:
1. Cormen T.H., Leiserson Charles E., Rivest Ronald L., Stein Clifford, Introduction to
Algorithms, PHI Learning Pvt. Ltd., 2009, 3rd Edition.
2. Basse Sara & A.V. Gelder, Computer Algorithm: Introduction to Design and
Analysis, Pearson, 2000, 3rd Edition.
3. Drozdek Adam, "Data Structures and algorithm in C++", Cengage Learning, 2012,
Third Edition.
4. Tenenbaum Aaron M., Augenstein Moshe J., Langsam Yedidyah, "Data Structures
Using C and C++, PHI, 2009, Second edition.
5. Kruse Robert L., "Data Structures and Program Design in C++", Pearson.
29
Paper Code: B070303T L T P C
Paper: Object Oriented Programming using C++ 3 1 0 4
30
Paper Code :MAL-2102 L T P C
Paper: Computer Based Numeric Methods 3 1 0 4
31
Paper Code: L T P C
Paper Name: Accounts with Tally 3 1 0 4
Unit-I:
Unit-II:
Unit-III:
Unit-IV
Books Recommended:
32
Paper Code: B070302P L T P C
Paper: Operating Systems Lab 0 0 4 2
Suggested Readings:
1. Sumitabh Das, “Your Unix/Linux: The Ultimate Guide,” McGraw Hill, 2012.
2. Richard Blum and Christine Bresnahan, “Linux Command Line and Shell Scripting
Bible,” Wiley, 2015.
3. Stroustrup, Bjarne, Programming: Principles and Practice Using C++, Addison
nd
Wesley, USA, 2014, 2 ed.
4. E Balagurusamy, Object Oriented Programming with C++, McGraw Hill Education
th
(India) Pvt. Ltd., India, 2013, 6 ed.
33
Paper Code: B070303P L T P C
Paper: Algorithm and Data Structures with C++ Lab 0 0 4 2
3. Write a program that uses stack operations to convert a given infix expression into its
postfix Equivalent, implement the stack using an array.
7. Write program for implementing the following sorting methods to arrange a list of
integers in ascending order:
a) Insertion sort b) Merge sort
8. Write program for implementing the following sorting methods to arrange a list of
integers in ascending order:
a) Quick sort
34
b) Selection sort
9. Write program to implement Insertion Sort (The program should report the number of
comparisons)
10. Write program implement Merge Sort(The program should report the number of
comparisons)
11. Write program implement Heap Sort (The program should report the number of
comparisons)
12. Write program implement Randomized Quick sort (The program should report the
number of comparisons)
13. Write program for creation and traversal of Binary Search Tree.
35
IVth Semester
Instruction pipelines, pipeline performance, super scalar processing, Pipelining, RISC & CISC
.Programming the Basic Computer: Instruction formats,addressing modes, instruction codes,
assembly language
Suggested Readings:
36
Paper Code: B070402T L T P C
Paper: Web Technology 3 1 0 4
37
Paper Code: B070403T L T P C
Paper Name: Software Engineering 3 1 0 4
38
Books Recommended/Suggested Reading:
1. Software Engineering A practitioner‟s Approach, Roger S. Pressman, Seventh Edition
McGraw-Hill International Edition.
2. Fundamentals of Software Engineering, Rajib Mall, Third Edition, PHI.
3. Software Engineering, Ian Sommerville, Ninth edition, Pearson education
4. The Software Engineering: A Primer, Waman S Jawadekar, Tata McGraw-Hill, 2008
5. Software Engineering, A Precise Approach, PankajJalote, Wiley India,2010.
6. The Software Engineering, Principles, and Practices, Deepak Jain, Oxford University Press.
7. Software Engineering1: Abstraction and modeling, Diner Bjorner, Springer International
edition, 2006.
8. A. Leon and M. Leon, Fundamentals of Software Engineering, Vikas Publication.
39
Paper Code: MAL-2201 L T P C
Paper Name: Discrete Mathematics 3 1 0 4
S. No. Course Outcomes (COs) Cognitive Level
1. Classify out operations on various discrete structures such as Analyzing
sets, functions, relations, and sequences
2. Demonstrate problems using Counting techniques, Understand
Permutation and Combination, Recursion and generating
functions.
3. Apply algorithms and use of graphs and trees as tools to Applying
visualize and simplify Problems.
4. Apply algorithms and use of graphs and trees as tools to Applying
visualize and simplify Problems.
5. Determine K-Maps and Truth Tables to construct and verify Evaluating
correctness of a Boolean expression.
Unit-IV: Graphs
Graphs:Simple graph, multi graph, graph terminology, representation of graphs, Bipartite, Regular,
Planar and connected graphs, connected components in a graph, Euler graphs, Hamiltonian path and
circuits, Graph coloring, isomorphism and Homomorphism of graphs. Tree: Definition, Labeled
Trees, Undirected Trees, Spanning trees, Minimal Spanning Trees, Prims and Kruskal Algorithm.
Unit-V: Basic Structure and Algebraic Structure
Basic Structure: Sets, set operations, function, recursive functions Algebraic Structures: Definition,
Semigroup, Monoids, Groups, Subgroups and order, Cyclic Groups, Cosets, Lagrange's theorem,
Normal Subgroups, Permutation and Symmetric groups, Group Homomorphisms, Definition and
elementary properties of Rings and Fields.
Books Recommended/Suggested Reading:
1. Discrete Mathematical Structures, Kolman, Busby & Ross : PHI, 5th Edition, 2006.
2. Elements of Discrete Maths, C.L. Liu : Tata McGraw Hill, 2nd edition,2001.
3. Discrete Mathematics and Its Applications: By Kenneth H Rosen, McGraw Hill, Sept.2007.
4. J. P. Tremblay, R. Manohar:Discrete Mathematical Structures with Applications to
Computer Science, McGraw Hill Pub, 1975.
5. Narsing Deo: Graph Theory and Applications
40
Paper Code: B070402P L T P C
Paper Name: Computer System Architecture Lab 0 0 4 2
IR DR AC AR PC FGI FGO S I E
0 15 0 15 0 15 011 011 1 Bit 1 Bit 1 Bit 1 bit 1
Bit
41
ADD_I 3xxx SNA E008
BSA_I Bxxx
ISZ_I Dxxx
42
0 2 3 4 15
Opcode I Address
a. The instruction format contains a 3-bit opcode, a 1-bit addressing mode and a
12-bit address. There are only two addressing modes, I = 0 (direct addressing)
and I = 1 (indirect addressing).
b. Create a new register I of 1 bit.
c. Create two new microinstructions as follows :
i. Check the opcode of instruction to determine type of instruction (Memory
Reference/Register Reference/Input-Output) and then jump accordingly.
ii. Check the I bit to determine the addressing mode and then jump accordingly.
43
Paper Code: B070403P L T P C
Paper: Software Engineering Lab 0 0 2 2
List of Experiments:
1. Develop Flow-Charts to understand basic problem solving technique by the help of Raptor
tool.
3. Develop DFD model (level-0, level-1 DFD and Data dictionary) of the project.
44
Paper Code: B070404P L T P C
Paper: Seminar/ Presentation 0 0 2 1
Seminar Presentation: Students are required to give seminar presentations on various topics related
to IS, IT and/or recent developments in the field of IS & IT. The topics for seminar presentation need
to be approved by the Teacher in- charge/Lab Teachers.
45
Vth Semester
46
1. Aho A. Ravi Sethi and D Ullman. Compilers – Principles Techniques and Tools, Addison
Wesley, 2006.
2. D. M.Dhamdhare, System Programming and Operating Systems,Tata McGraw Hill &
Company, 1996.
3. Kenneth Louden,” Compiler Construction”, Cengage Learning.
4. Charles Fischer and Ricard LeBlanc,” Crafting a Compiler with C”, Pearson Education.
47
Paper Code: B070504T L T P C
Paper Name: Core Java 3 1 0 4
S. No. Course Outcomes (COs) Cognitive Level
Unit-I: Introduction
A simple Java Application, a simple Java Applet , Brief History of Java, Special Features of Java,
Data Type & Operators in Java, Arrays, Objects, the Assignment Statement, Arithmetic
Operators, Relational and Logical Operators in Java, control Structures. Introducing classes, objects
and methods: defining a class, adding variables and methods, creating objects, constructors,
Finalizers, Classes inside classes: composition
Unit-V: Internetworking
Datagrams, fragmentation – Routing-Flooding, Distance vector routing, Link state routing.
Concepts of congestion control-leaky bucket algorithm. Process to Process delivery - TCP, UDP,
Application Layer -DNS, Remote login, file transfer protocol (FTP).
Course outcomes: After the completion of the course the students will be able to:
Unit-IV: Cryptographic Protocols-I: Arbitrated and Adjudicated Protocol, One- Way Hash
function, Cryptographic Protocols-II: Public key cryptography, Digital Signature, Digital
Watermarking Technique: Characteristics and Types. Security Policies, Why Policies should
be developed, WWW policies, Email Security policies, Policy Review Process-Corporate
policies- Sample Security Policies. copyright laws, patent laws, software license.
Unit-V: Cyber Laws I: Information Security Standards, IT act 2000 Provisions, Introduction
to digital laws, Cyber Laws II: cyber laws, intellectual property rights, patent laws, software
license.
Suggested Readings:
1. Michael E. Whitman and Herbert J. Mattord, "Principles of Information Security," Sixth
Edition, Cengage Learning, 2017.
2. Douglas J. Landoll, "Information Security Policies, Procedure, and Standards: A
Practitioner's Reference," CRC Press, 2016.
3. Harold F. Tipton, and Micki Krause, "Hand book of information security management,"
Sixth Edition, Archtech Publication, 2007.
4. William Stallings, "Cryptography and Network Security: Principles and Practice," Sixth
Edition, Pearson, 2014.
Paper Code: B070507T L T P C
Paper Name: Soft Computing 3 1 0 4
Suggested Readings:
1. S. Rajsekaran& G.A. VijayalakshmiPai, “Neural Networks,Fuzzy Logic and Genetic
Algorithm:Synthesis and Applications” Prentice Hall of India,2003
2. Anderson, James, “Introduction to Neural Networks”, PHI Publication, Delhi, India
3. N.P.Padhy,”Artificial Intelligence and Intelligent Systems” Oxford University Press, USA,
2005.
4. Simon Haykin,”Neural Networks and Learning Machines ”Prentice Hall of India, 2005,
Third Edition.
Paper Code: B070508T L T P C
Paper Name: Android Programming 3 1 0 4
Suggested Readings:
1. Android: A Programming Guide by J.F. DiMarzio
2. Hello, Android: Introducing Google's Mobile Development Platform by Ed Burnett
3. Programming android by Zigurd Mednieks
4. Android User Interface Design: Turning Ideas and Sketches into Beautifully Designed Apps
byIan G. Clifton
5. Android Developer Fundamental Course by Google.
Semester –VI
Unit-1
Unit-II
Unit-III
Unit-IV
Unit-V
References
1.
2.
3.
4.
5.
Semester –VI
Unit-1
The .Net framework: Introduction, The Origin of .Net Technology, Common Language Runtime
(CLR), Common Type System (CTS), Common Language Specification (CLS), Microsoft
Intermediate Language (MSIL), Just-In –Time Compilation, Framework Base Classes.
Unit-II
C -Sharp Language (C#): Introduction, Data Types, Identifiers, Variables, Constants, Literals,
Array and Strings, Object and Classes, Inheritance and Polymorphism, Operator Overloading,
Interfaces, Delegates and Events. Type conversion.
Unit-III
C# Using Libraries: Namespace- System, Input-Output, Multi-Threading, Networking and sockets,
Managing Console I/O Operations, Windows Forms, Error Handling.
Unit-IV
Advanced Features Using C#: Web Services, Window Services, Asp.net Web Form Controls,
ADO.Net. Distributed Application in C#, Unsafe Mode, Graphical Device interface with C#.
Unit-V
.Net Assemblies and Attribute: .Net Assemblies features and structure, private and share
assemblies, Built-In attribute and custom attribute. Introduction about generic.
References
1. Wiley,” Beginning Visual C# 2008”,Wrox
2. Fergal Grimes,” Microsoft .Net for Programmers”. (SPI)
3. Balagurusamy,” Programming with C#”, (TMH)
4. Mark Michaelis, “Essential C# 3.0: For .NET Framework 3.5, 2/e, Pearson Education
5. Shibi Parikkar, “ C# with .Net Frame Work” , Firewall Media.
Paper Code: B-070602T L T P C
Paper Name: Artificial Intelligence 3 1 0 4
UNIT-I:
Introduction to artificial intelligence: Introduction , history, intelligent systems, foundations of AI,
applications, tic-tac-tie game playing, development of AI languages, current trends in AI, Problem
solving: state-space search and control strategies: Introduction, general problem solving,
characteristics of problem, exhaustive searches, heuristic search techniques, iterative- deepening a*,
constraint satisfaction
UNIT-II:
Problem reduction and game playing: Introduction, problem reduction, game playing, alpha- beta
pruning, two-player perfect information games, Logic concepts: Introduction, propositional
calculus, proportional logic, natural deduction system, axiomatic system, semantic tableau s ystem in
proportional logic, resolution refutation in proportional logic, predicate logic
UNIT-III:
Knowledge representation: Introduction, approaches to knowledge representation, knowledge
representation using semantic network, extended semantic networks for KR, knowledge
representation using frames, advanced knowledge representation techniques: Introduction,
conceptual dependency theory, script structure, cyc theory, case grammars, semantic web, Expert
system and applications: Introduction phases in building expert systems, expert system versus
traditional systems, rule-based expert systems blackboard systems truth maintenance systems,
application of expert systems, list of shells and tools
UNIT-IV:
Uncertainty measure: probability theory: Introduction, probability theory, Bayesian belief
networks, certainty factor theory, dempster-shafer theory , Fuzzy sets and fuzzy logic: Introduction,
fuzzy sets, fuzzy set operations, types of membership functions, multi valued logic, fuzzy logic,
linguistic variables and hedges, fuzzy propositions, inference rules for fuzzy propositions, fuzzy
systems.
UNIT-V:
Machine learning paradigms: Introduction, machine learning systems, supervised and
unsupervised learnings, inductive learning, deductive learning, clustering, support vector
machines, case based reasoning and learning, Artificial neural networks: Introduction, artificial
networks, single layer feed forward networks, multi layered forward networks, design issues of
artificial neural networks
Text Books:
1. Artificial Intelligence- Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach, 2nd ed, Stuart Russel, Peter Norvig, PEA
3. Artificial Intelligence- 3rd ed, Rich, Kevin Knight, Shiv Shankar B Nair, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI
Reference Books:
1. Artificial intelligence, structures and Strategies for Complex problem solving, 5th ed, George
F Lugar, PEA
2. Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer
3. Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier
Paper Code: B-070603T L T P C
Paper Name: E-Commerce 3 1 0 4
Reference :-
UNIT-1:
Introduction to Data mining, types of Data, Data Quality, Data Processing, Measures of
Similarity and Dissimilarity, Exploring Data: Data Set, Summary Statistics, Visualization, OLAP
and multi dimensional data analysis.
UNIT-II:
Classification: Basic Concepts, Decision Trees and model evaluation: General approach for solving
a classification problem, Decision Tree induction, Model over fitting: due to presence of noise, due
to lack of representation samples, Evaluating the performance of classifier. Nearest Neighborhood
classifier, Bayesian Classifier, Support vector Machines: Linear SVM, Separable and Non
Separable case.
UNIT-III:
Association Analysis: Problem Definition, Frequent Item-set generation, rule generation,
compact representation of frequent item sets, FP-Growth Algorithms. Handling Categorical,
Continuous attributes, Concept hierarchy, Sequential, Sub graph patterns
UNIT-IV:
Clustering: Over view, K-means, Agglomerative Hierarchical clustering, DBSCAN, Cluster
evaluation: overview, Unsupervised Cluster Evaluation using cohesion and separation, using
proximity matrix, Scalable Clustering algorithm
UNIT-V:
Web data mining: Introduction, Web terminology and characteristics, Web content mining, Web
usage mining, web structure mining, Search Engines: Characteristics, Functionality, Architecture,
Ranking of WebPages, Enterprise search
TEXTBOOKS:
1. Introduction to Data Mining: Pang-Ning tan, Michael Steinbach, Vipin kumar, Addision-
Wesley.
2. Introduction to Da ta Mining with Case Studies: GK Gupta: Prentice Hall.
REFERENCEBOOKS:
1. Data Mining: Introductory and Advanced Topics, Margaret H Dunham, Pearson, 2008.
2. Fundamentals of data warehouses, 2/e, Jarke, Lenzerini, Vassiliou, Vassiliadis, Springer.
3. Data Mining Theory and Practice, Soman, Diwakar, Ajay, PHI, 2006.
4. Data Mining, Concepts and Techniques, 2/e, Jiawei Han, Micheline Kamber, Elsevier, 2006.
Paper Code: B070604R L T P C
Paper Name: Research Project-II 0 0 0 3
1. Objectives of the Project
• To facilitate the student to independently formulate and solve a social,
philosophical, commercial, or technological problem and present the results in
written and oral form.
• To render students to the real life problems.
• To provide opportunities to students to interact with people and present them
confidently.
2. Types of Project
The students are expected to work on:
(1) Application Oriented Project or (2) Research Oriented Project.
However, it is not mandatory for a student to work on a real-life project. The student can
formulate a project problem with the help of his Guide and submit the project proposal of
the same. Approval of the project proposal is mandatory. If approved, the student can
commence working on it, and complete it. It is upon the student to carry the same project
of V semester to VI semester OR choose a new project for VI semester. Use the latest
versions of the software packages for the development of the project.
3. Software and Broad Ideas of Application
List of experiments:
1. Write a console application that obtains four int values from the user and displays the
product.
2. If you have two integers stored in variables var1 and var2, what Boolean test can you
perform to see if one or the other (but not both) is greater than 10?
3. Write a console application that places double quotation marks around each word in a string
.
4. Write an application that receives the following information from a set of students: Student
Id: Student Name: Course Name: Date of Birth: The application should also display the
information of all the students once the data is Entered. Implement this using an Array of
Structures.
5. Create a project that calculates the total of fat, carbohydrate and protein. Allow the user to
enter into text boxes. The grams of fat, grams of carbohydrate and grams of protein. Each
gram of fat is 9 calories and protein or carbohydrate is 4 calories. Display the total calories
of the current food item in a label. Use to other labels to display and accumulated some of
calories and the count of items entered. The form food have 3 text boxes for the user to enter
the grams for each category include label next to each text box indicating what the user is
enter.
6. Write a program for Arithmetic Calculator using Windows Application.
7. Implement Windows Form based application using controls like menus, dialog and tool tip,
dropdown, radio and selection button etc.
8. Implement Master Form with Windows application.
9. Implement Overloading and Overriding, constructor and Destructor.
10. Write a program for events and Delegates.
11. Implement concepts of Inheritance, visual inheritance and Interface in windows application.
12. Implement printing of GDI+ with windows application.
13. Use Dataset, Data Reader, XML Reader & Data Sources (SQL, Object & XML) with Any
Windows or Web Application.
14. Use Data Controls like Data List, Grid View, Detail View, Repeater and List Bound Control
15. Implement web application using ASP.NET with web controls.
16. Write a code for web application to provide input validations using Input Valuators.
17. Create a Web application that illustrates the use of themes and master pages with
Site-Map.
18. Create a Web Application in ASP.NET using various CSS
19. Implement the concept of state management in a web application.
20. Implement code in ASP.NET that creates and consumes Web service by any web
application.
Semester-VIII
UNIT-I:
Directory Services and JNDI: Naming and Directory Services, Using JNDI, Java and LDAP,
LDAP operations, Searching an LDAP Server
UNIT-II:
Distributed Computing Using RMI: RMI Architecture, Locating Remote Objects and Developing
Applications with RMI, Parameter passing in RMI, RMI firewalls and HTTP
UNIT-III
Java Beans: Introduction to Java Beans, Advantages of Java Beans, BDK Introspection, Using
Bound properties, Bean Info Interface, Constrained properties Persistence, Customizes, Java
Beans API, Introduction to EJB‟s, EJB Architecture and Design: EJB Container and its
services, Working with EJBs, Design of the EJB Tier
UNIT-IV:
Web Servers and Servlets: Tomcat web server, Introduction to Servlets: Lifecycle of a Servlet,
JSDK, The Servlet API, The javax.servlet Package, Reading Servlet parameters, Reading.
Initialization parameters. The javax.servlet HTTP package, Handling Http Request & Responses,
Using Cookies-Session Tracking, Security Issues
UNIT V:
Database Access: Database Programming using JDBC, Studying Javax.sql.*package, J2EE and
Web Services: Web Service Technologies (SOAP, WSDL, and UDDI), Developing Web
services, making Services smarter.
Text Books:
1. Professional Java Server Programming, J2EE 1.3 edition, APRESS publications (Units
1,2,4,8)
2. The complete Reference Java 8th Edition by Patrick Naughton and Herbert Schildt. TMH
(Units 3,5,6,7)
Reference Books:
1. Programming world wide web-Sebesta, Pearson
2. Core SERVLETS ANDJAVASERVER PAGES VOLUME 1: CORE TECHNOLOGIES
By Marty Hall and Larry Brown Pearson
3. Internet and World Wide Web – How to program by Dietel and Nieto PHI/Pearson
Education Asia
4. Murach‟s beginning JAVA JDK 5, Murach, SPD
5. An Introduction to web Design and Programming –Wang-Thomson
6. Web Applications Technologies Concepts-Knuckles,John Wiley
7. Web Warrior Guide to Web Programmming-Bai/Ekedaw-Thomas
8. Beginning Web Programming-Jon Duckett WROX
Paper Code: B-070702T L T P C
Paper Name: Advanced DBMS 3 1 0 4
UNIT-I:
Advanced database concept, Enhanced Data Model for Advanced Applications: Object Oriented
Database, Object Relational Database and Extended Relational Systems, Active database concept
and Triggers-ECA model, Temporal Database concept. Distributed Database Management:
Distributed DBMS feature and needs; Reference Architecture, levels of distribution transparency,
replication, and Distributed database design, Distributed Query Processing and Optimization,
Distributed Transaction Modeling. Concurrency control-2 phase locks, Management of Distributed
transactions-2 phase unit protocols. Heterogeneous database- federated database, Client server
databases, SQL server, open database connectivity, Client server Architecture its relationship to
distributed databases.
UNIT-II:
Data mining concepts, Data warehouse and data marts. Types of transaction processing system:
Decision Support System: Aspect of decision support, Database design for decision support. Online
analytical processing; Online transaction processing. Deductive Databases: Introduction and
deductive database system, Data log and Recursion, Evaluation of Data log program, Recursive
queries with negation, Deductive object oriented database, Application of deductive database
system Parallel Databases: Parallel architectures, shared nothing/shared disk/shared memory based
architectures, Data partitioning, Intraoperator parallelism, pipelining, Design of Parallel Databases,
and Parallel Query Evaluation.
UNIT-III:
Database on the World Wide Web, Mobile databases: Mobile Computing architecture,
Characteristics of mobile environments, Data management issues. Genome databases Management:
Biological Sciences & Genetics, Characteristic of Biological data, Existing Biological
databases, Knowledge base system, Expert database system, Modeling concepts
UNIT-IV:
Image and Multimedia Databases: Modeling and Storage of Image and Multimedia Data, Data
Structures – R-tree, k-d tree, Quad trees, Content Based Retrieval: Color Histograms, Textures, etc.,
Image Features, Spatial and Topological Relationships, Multimedia Data Formats, Video Data
Model, Audio & Handwritten Data, Geographic Information Systems (GIS). WEB Database:
Accessing Databases through WEB, WEB Servers, XML Databases, Commercial Systems – Oracle.
References:
BOOKS:
1. R. Ramakrishnan, “Database Management Systems”, 1998, McGraw Hill International
Editions
2. Elmagarmid.A.K. “Database transaction models for advanced applications”, Morgan
Kaufman.
3. Transaction Processing, Concepts and Techniques, J. Gray and A. Reuter, Morgan
Kauffman..
4. S. Abiteboul, R. hull and V. Vianu, “Foundations of Databases”, 1995, Addison – Wesley
Publishing Co., Reading Massachusetts.
5. W. Kim, “Modern Database Systems”, 1995, ACM Press, Addison – Wesley.
6. D. Maier, “The Theory of Relational Databases”, 1993, Computer Science Press, Rockville,
Maryland
7. A Silberschatz, H.F Korth, Sudersan “Database System Concepts” –, MGH Publication.
8. Raghurama Krishnan “Database Systems” TMH
Paper Code: B-070703T L T P C
Paper Name: Cloud Computing 3 1 0 4
UNIT I:
Introduction: Network centric computing, Network centric content, peer-to –peer systems, cloud
computing delivery models and services, Ethical issues, Vulnerabilities, Major challenges for cloud
computing. Parallel and Distributed Systems: introduction, architecture, distributed systems,
communication protocols, logical clocks, message delivery rules, concurrency, and model
concurrency with Petri Nets.
UNIT II:
Cloud Infrastructure: At Amazon, The Google Perspective, Microsoft Windows Azure, Open
Source Software Platforms, Cloud storage diversity, Inter cloud, energy use and ecological
impact, responsibility sharing, user experience, Software licensing, Cloud Computing : Applications
and Paradigms: Challenges for cloud, existing cloud applications and new opportunities,
architectural styles, workflows, The Zookeeper, The Map Reduce Program model, HPC on cloud,
biological research
UNIT III:
Cloud Resource virtualization: Virtualization, layering and virtualization, virtual machine
monitors, virtual machines, virtualization- full and para, performance and security isolation,
hardware support for virtualization, Case Study: Xen, vBlades, Cloud Resource Management and
Scheduling: Policies and Mechanisms, Applications of control theory to task scheduling, Stability of
a two-level resource allocation architecture, feedback control based on dynamic thresholds,
coordination, resource bundling, scheduling algorithms, fair queuing, start time fair queuing, cloud
scheduling subject to deadlines, Scheduling Map Reduce applications, Resource management and
dynamic application scaling
UNIT IV:
Storage Systems: Evolution of storage technology, storage models, file systems and database,
distributed file systems, general parallel file systems. Google file system. Apache Hadoop, Big
Table, Megastore (text book 1), Amazon Simple Storage Service(S3) (Text book 2), Cloud
Security: Cloud security risks, security – a top concern for cloud users, privacy and privacy impact
assessment, trust, OS security, Virtual machine security, Security risks
UNIT V:
Cloud Application Development: Amazon Web Services : EC2 – instances, connecting clients,
security rules, launching, usage of S3 in Java, Installing Simple Notification Service on Ubuntu
10.04, Installing Hadoop on Eclipse, Cloud based simulation of a Distributed trust algorithm, Cloud
service for adaptive data streaming ( Text Book 1), Google: Google App Engine, Google Web
Toolkit (Text Book 2), Microsoft: Azure Services Platform, Windows live, Exchange Online,
Share Point Services, Microsoft Dynamics CRM (Text Book 2)
Text Books:
1. Cloud Computing, Theory and Practice, Dan C Marinescu, MK Elsevier
2. Cloud Computing, A Practical Approach, Anthony T Velte, Toby J Velte, Robert
Elsenpeter, TMH
Reference book:
1. Mastering Cloud Computing, Foundations and Application Programming, Raj Kumar
Buyya, Christen vecctiola, S Tammarai selvi, TMH
Paper Code: B-070704T L T P C
Paper Name: HUMAN COMPUTER INTERFACE 3 1 0 4
UNIT I:
Introduction : Importance of user Interface – definition, importance of 8 good design. Benefits of
good design. A brief history of Screen design. The graphical user interface – popularity of graphics,
the concept of direct manipulation, graphical system, Characteristics, Web user – Interface
popularity, characteristics- Principles of user interface
UNIT II:
Design process: Human interaction with computers, importance of 8 human characteristics human
consideration, Human interaction speeds, understanding business junctions. III Screen Designing :
Design goals – Screen
UNIT III:
Screen Designing : Design goals – Screen planning and purpose, 8 organizing screen elements,
ordering of screen data and content – screen navigation and flow – Visually pleasing composition –
amount of information – focus and emphasis – presentation information simply and meaningfully –
information retrieval on web – statistical graphics – Technological consideration in interface
design.
UNIT IV:
Windows : New and Navigation schemes selection of window, 8 selection of devices based and
screen based controls. Components – text and messages, Icons and increases – Multimedia,
colors,uses problems, choosing colors
UNIT V:
Software tools : Specification methods, interface – Building Tools. 8 Interaction Devices –
Keyboard and function keys – pointing devices – speech recognition digitization and generation –
image and video displays – drivers.
Text books:
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale Human Computer Interaction, 3rd Edition
Prentice Hall, 2004.
2. Jonathan Lazar Jinjuan Heidi Feng, Harry Hochheiser, Research Methods in HumanComputer
Interaction, Wiley, 2010.
3. Ben Shneiderman and Catherine Plaisant Designing the User Interface: Strategies for Effective
Human-Computer Interaction (5th Edition, pp. 672, ISBN 0- 321-53735-1, March 2009), Reading,
MA: Addison-Wesley Publishing Co.
Paper Code: B-070701P L T P C
Paper Name: Advanced Java Lab 0 0 4 4
Learning Outcome
CO1: Demonstrate their ability to apply database concepts to design any application of their
choice.
CO2: Develop solutions by adhering to coding standards using any front end and back end
tools.
OBJECTIVES:
The aim of the mini project is that the student has to understand the real time software development
environment. The student should gain a thorough knowledge in the problem, he/she has selected and
the language / software, he/she is using.
Project planning:
BCA Major Project is an involved exercise, which has to be planned well in advance. The topic
should be chosen in the beginning of final year itself. Related reading training and discussions of
first internal project viva voce should be completed in the first term of final year.
I Selection of the project work
Project work could be of three types.
a) Developing solution for real life problem
In this case a requirement for developing a computer-based solution already exists and the different
stages of system development life cycle is to be implemented successfully. Examples are accounting
software for particular organization, computerization of administrative function of an organization,
web based commerce etc.
b) System Software Project
Projects based on system level implementation.
b) Research level project
These are projects which involve research and development and may not be as a structured and clear
cut as in the above case. This type of projects provides more challenging opportunities to students.
II Selection of team
To meet the stated objectives, it is imperative that major project is done through a individual effort. .
III Selection of Tools
No restrictions shall be placed on the students in the choice of platform/tools/languages to be
utilized for their project work, though open source is strongly recommended, wherever possible. No
value shall be placed on the use of tools in the evaluation of the project.
Paper Code: B-070705T
Paper Name: Departmental Elective Course-I
3 Analyze
Explain Machine Learning concepts, classifications of
Machine Learning
4 Analyze
Describe Supervised Learning
concepts.
5 Knowledge, Understand
Describe unsupervised learning concepts and dimensionality
reduction techniques.
UNIT I:
INTRODUCTION : Introduction to machine learning- Linear models (SVMs and Perceptrons,
logistic regression)- Intro to Neural Nets: What a shallow network computes- Training a network:
loss functions, back propagation and stochastic gradient descent- Neural networks as universal
function approximates
UNIT II:
DEEP NETWORKS : History of Deep Learning- A Probabilistic Theory of Deep Learning-
Backpropagation and regularization, batch normalization- VC Dimension and Neural Nets-Deep Vs
Shallow Networks-Convolutional Networks- Generative Adversarial Networks (GAN),
Semisupervised Learning
UNIT III:
DIMENTIONALITY REDUCTION : Linear (PCA, LDA) and manifolds, metric learning - Auto
encoders and dimensionality reduction in networks - Introduction to Convnet - Architectures –
AlexNet, VGG, Inception, ResNet - Training a Convnet: weights initialization, batch
normalization, hyperparameter optimization
UNIT IV:
OPTIMIZATION AND GENERALIZATION : Optimization in deep learning– Non-convex
optimization for deep networks- Stochastic Optimization Generalization in neural networks- Spatial
Transformer Networks- Recurrent networks, LSTM - Recurrent Neural Network Language
Models- Word-Level RNNs & Deep Reinforcement Learning - Computational & Artificial
Neuroscience
UNIT V:
CASE STUDY AND APPLICATIONS : Imagenet- Detection-Audio WaveNet-Natural Language
Processing Word2Vec - Joint Detection-Bioinformatics- Face Recognition- Scene Understanding-
Gathering Image Captions
Text books:
1. Cosma Rohilla Shalizi, Advanced Data Analysis from an Elementary Point of View, 2015.
2. Deng & Yu, Deep Learning: Methods and Applications, Now Publishers, 2013.
3. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, MIT Press, 2016.
4. Michael Nielsen, Neural Networks and Deep Learning, Determination Press, 2015.
Paper Code: B-070506T L T P C
Paper Name: DEEP LEARNING 3 1 0 4
3 Skill development
Explain Machine Learning concepts, classifications of
Machine Learning
4 Skill development,
Describe Supervised Learning entrepreneurship
concepts.
5 Skill development,
Describe unsupervised learning concepts and dimensionality entrepreneurship
reduction techniques.
UNIT I:
INTRODUCTION : Introduction to machine learning- Linear models (SVMs and Perceptrons,
logistic regression)- Intro to Neural Nets: What a shallow network computes- Training a network:
loss functions, back propagation and stochastic gradient descent- Neural networks as universal
function approximates
UNIT II:
DEEP NETWORKS : History of Deep Learning- A Probabilistic Theory of Deep Learning-
Backpropagation and regularization, batch normalization- VC Dimension and Neural Nets-Deep Vs
Shallow Networks-Convolutional Networks- Generative Adversarial Networks (GAN),
Semisupervised Learning
UNIT III:
DIMENTIONALITY REDUCTION : Linear (PCA, LDA) and manifolds, metric learning - Auto
encoders and dimensionality reduction in networks - Introduction to Convnet - Architectures –
AlexNet, VGG, Inception, ResNet - Training a Convnet: weights initialization, batch
normalization, hyperparameter optimization
Text books:
1. Cosma Rohilla Shalizi, Advanced Data Analysis from an Elementary Point of View, 2015.
2. Deng & Yu, Deep Learning: Methods and Applications, Now Publishers, 2013.
3. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, MIT Press, 2016.
4. Michael Nielsen, Neural Networks and Deep Learning, Determination Press, 2015.
Paper Code: B-070507T L T P C
Paper Name: Parallel Programming with MPI 3 1 0 4
Unit-I
Introduction to Parallel Computing; Motivating Parallelism, Scope of Parallel Computing; Parallel
Programming; Platforms : Implicit parallelism, Limitation of Memory System Performance,
Dichotomy of Parallel Computing Platforms, Physical Organization of Parallel Platforms,
Communication Costs of Parallel Machines, Routing Mechanism for Interconnection Networks,
Impact of Process-processor Mapping and Mapping Techniques.
Unit-II
Principles of Parallel Algorithm Design : Preliminaries, Decomposition Techniques,
Characteristics of Tasks and Interactions, Mapping Techniques for Load Balancing,
Methods for containing interaction Overheads, parallel Algorithm Models. Analytical.
Unit-III
Modelling of Parallel Programs : Sources of Overhead in Parallel Programs, Performance metrics
for parallel systems, the effect of Granularity on Performance, Scalability of Parallel
Systems, minimum Executuion time and minimum cost-optional Execution Time, Asymptotic
Analysis of Parallel Programs, other Scalability Metrics.
Unit-IV
Basic Communication Operations: One-to-All Broadcast and All-to-One Reduction, All-to- All
Broadcast and Reduction, Scatter and Gather, All-to-All Personalized Communication, Circular
Shift.
Unit-V
Introduction to MPI Principles of Message - Passing Programming, The Building Blocks (Send
and Receive Operations), MPI (the Message Passing Interface), Collective
Communication and Computation Operations, Examples of Matrix - Matrix multiplication, One
dimensional Matrix Vector Multiplication using MPI.
Text Books:
1. AnanthGrama, George Karypis, VipinKumar, AnshulGupta, ―Introduction to
Parallel Computing‖, 2nd Edition, 2004, Pearson Education, Inc. New Delhi.
2. Michael J. Quinn, ―Parallel Computing: Theory and Practice‖, 1994, McGraw-Hill
Education (India), New Delhi.
Reference Books:
1. Calvin Lin, Larry Snyder, ―Principles of Parallel Programming‖, 1st Edition, 2009,
Pearson Education, Inc. New Delhi.
2. Michael J. Quinn, ―Parallel Programming in C with MPI and OpenMP‖, 2004,
McGraw-Hill Education (India), New Delhi.
3. Barry Wilkinson, ―Parallel Programming: Techniques and Applications Using
Networked Workstations and Parallel Computers‖, 2nd Edition, 2005, Pearson
Education, Inc. New Delhi.
4. Yves Robert, Henri Casanova, Armand Legrand, ―Parallel Algorithms‖, 1st Edition,
2009, CRC Press. ISBN-13:9781584889458.
5. Harry F. Jordan, Gita Alagband, ―Fundamentals of Parallel Processing‖, first
Edition, 2003, PHI Learning Pvt. Ltd. New Delhi.
Unit-I
Introduction to Parallel Computing; Motivating Parallelism, Scope of Parallel Computing; Parallel
Programming; Platforms : Implicit parallelism, Limitation of Memory System Performance,
Dichotomy of Parallel Computing Platforms, Physical Organization of Parallel Platforms,
Communication Costs of Parallel Machines, Routing Mechanism for Interconnection Networks,
Impact of Process-processor Mapping and Mapping Techniques.
Unit-II
Principles of Parallel Algorithm Design : Preliminaries, Decomposition Techniques,
Characteristics of Tasks and Interactions, Mapping Techniques for Load Balancing,
Methods for containing interaction Overheads, parallel Algorithm Models. Analytical.
Unit-III
Modelling of Parallel Programs : Sources of Overhead in Parallel Programs, Performance metrics
for parallel systems, the effect of Granularity on Performance, Scalability of Parallel
Systems, minimum Executuion time and minimum cost-optional Execution Time, Asymptotic
Analysis of Parallel Programs, other Scalability Metrics.
Unit-IV
Basic Communication Operations: One-to-All Broadcast and All-to-One Reduction, All-to- All
Broadcast and Reduction, Scatter and Gather, All-to-All Personalized Communication, Circular
Shift.
Unit-V
Introduction to MPI Principles of Message - Passing Programming, The Building Blocks (Send
and Receive Operations), MPI (the Message Passing Interface), Collective
Communication and Computation Operations, Examples of Matrix - Matrix multiplication, One
dimensional Matrix Vector Multiplication using MPI.
Text Books:
1. AnanthGrama, George Karypis, VipinKumar, AnshulGupta, ―Introduction to
Parallel Computing‖, 2nd Edition, 2004, Pearson Education, Inc. New Delhi.
2. Michael J. Quinn, ―Parallel Computing: Theory and Practice‖, 1994, McGraw-Hill
Education (India), New Delhi.
Reference Books:
1. Calvin Lin, Larry Snyder, ―Principles of Parallel Programming‖, 1st Edition, 2009,
Pearson Education, Inc. New Delhi.
2. Michael J. Quinn, ―Parallel Programming in C with MPI and OpenMP‖, 2004,
McGraw-Hill Education (India), New Delhi.
3. Barry Wilkinson, ―Parallel Programming: Techniques and Applications Using
Networked Workstations and Parallel Computers‖, 2nd Edition, 2005, Pearson
Education, Inc. New Delhi.
4. Yves Robert, Henri Casanova, Armand Legrand, ―Parallel Algorithms‖, 1st Edition,
2009, CRC Press. ISBN-13:9781584889458.
5. Harry F. Jordan, Gita Alagband, ―Fundamentals of Parallel Processing‖, first
Edition, 2003, PHI Learning Pvt. Ltd. New Delhi.
UNIT-I:
INTRODUCTION – The Origins of Digital Image Processing – Application of Digital Image
Processing – Fundamental Steps in Digital Image Processing – Component of Image Processing
System FUNDAMENTALS: Image Acquisition Using a Single Sensor – Image Acquisition
Using Sensor Arrays
UNIT-II:
IMAGE SAMPLING AND QUANTIZATION: Basic concepts-Representing Digital Images –
Spatial and Grey Level Resolution-Aliasing &more patterns – Zooming and Shrinking Digital
Images. BASIC RELATIONSHIPS BETWEEN PIXELS: Neighbors of a Pixel – Adjacency,
Connectivity, Regions and Boundaries – Distance Measures, Image Operations on a Pixel Basis
UNIT-III:
COLOR IMAGE PROCESSING: Fundamentals-color models: RGB color model-CMY and
CMYK color model-HIS model-Color Image smoothing &color Image sharping. IMAGE
ENHANCEMENT IN SPATIAL DOMAIN: Gray Level Transformation – Image Negatives –
Log Transformations –Piecewise-Linear transformation function- Enhancement Using
Arithmetic/Logic Operations – Image Subtraction – Image Averaging
UNIT-IV:
IMAGE COMPRESSION: Fundamentals-Coding Redundancy – Inter pixel Redundancy –
PsychoVisual Redundancy – Image Compression Models – The Source Encoder and Decoder –
The Channel Encoder and Decoder
UNIT-V:
IMAGE SEGMENTATION: Detection of Discontinuities Point Detection – Line Detection – Edge
Detection. REPRESENTATION OF IMAGES: Chain Codes – Polygonal Approximation –
Signatures – Boundary Segments – Skeletons
Text Books:
1. ―Digital Image Processing‖ – Second Edition – Rafael C.Gonzalez and Richar E.Woods
Reference Books:
1. Anil K.Jain, ―Fundamentals of Digital Image Processing‖, PHI, 1995.
2. Sid Ahme M.A, ―Image Processing‖, McGraw Hill Inc, 1995
3. Gonzalaz R and Wintz P., ―Digital Image Processing‖, Addison Wesley, 2nd Ed, 1987
Unit I
Introduction to Big Data Platform – Challenges of Conventional Systems – Intelligent data
analysis – Nature of Data – Analytic Processes and Tools – Analysis Vs Reporting – Modern Data
Analytic Tools – Statistical Concepts: Sampling Distributions – Re-Sampling – Statistical
Inference –Prediction Error.
Unit II
Regression Modeling – Multivariate Analysis – Bayesian Methods –Bayesian Paradigm –
Bayesian Modeling – Inference and Bayesian Networks – Support Vector and Kernel Methods –
Analysis of Time Series: Linear Systems Analysis – Nonlinear Dynamics – Rule Induction –
Fuzzy Logic: Extracting Fuzzy Models from Data – Fuzzy Decision Trees.
Unit III
Search by simulated Annealing – Stochastic, Adaptive search by Evaluation – Evaluation
strategies – Genetic Algorithm – Genetic Programming – Visualization – Classification of Visual
Data Analysis Techniques – Data Types – Visualization Techniques – Interaction techniques –
Specific Visual data analysis Techniques.
Unit IV
Introduction To Streams Concepts – Stream Data Model and Architecture – Stream Computing –
Sampling Data in a Stream – Filtering Streams – Counting Distinct Elements in a Stream –
Estimating Moments – Counting Oneness in a Window – Decaying Window – Real- time analytics
Platform(RTAP) Applications – Case Studies – Real-Time Sentiment Analysis, Stock Market
Predictions.
Unit V
MapReduce –Hadoop, Hive, MapR – Sharding –NoSQL Databases – S3 – Hadoop Distributed
File Systems – Case Study – Preventing Private Information Inference Attacks on Social Networks
– Grand Challenge: Applying Regulatory Science and Big Data to Improve Medical Device
Innovation.
Reference Book:
1. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge
University Press, 2012.
2. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams
with Advanced Analytics”, John Wiley & sons, 2012.
3. Pete Warden, “Big Data Glossary”, O‟Reilly, 2011.
4. Raymond Heatherly, Murat Kantarcioglu and Bhavani Thuraisingham, “Preventing Private
Information Inference Attacks on Social Networks” IEEE Transaction on Knowledge & Data
Engg., Vol 25, No.8, Aug. 2013.
5. R. N. Prasad and Seema Acharya “Fundamentals of Business Analytics,” John Wiley &
Sons, 2011.
2 Design efficient algorithms for mining the data from large Skill development
volumes.
3 Model a framework for Human Activity Recognition. Skill development
4 Analyze the big data for useful business applications. Skill development,
entrepreneurship
5 Implement search methods and Visualization. Skill development,
entrepreneurship
Unit I
Introduction to Big Data Platform – Challenges of Conventional Systems – Intelligent data analysis –
Nature of Data – Analytic Processes and Tools – Analysis Vs Reporting – Modern Data Analytic
Tools – Statistical Concepts: Sampling Distributions – Re-Sampling – Statistical Inference –
Prediction Error.
Unit II
Regression Modeling – Multivariate Analysis – Bayesian Methods –Bayesian Paradigm – Bayesian
Modeling – Inference and Bayesian Networks – Support Vector and Kernel Methods – Analysis of
Time Series: Linear Systems Analysis – Nonlinear Dynamics – Rule Induction – Fuzzy Logic:
Extracting Fuzzy Models from Data – Fuzzy Decision Trees.
Unit III
Search by simulated Annealing – Stochastic, Adaptive search by Evaluation – Evaluation strategies –
Genetic Algorithm – Genetic Programming – Visualization – Classification of Visual Data Analysis
Techniques – Data Types – Visualization Techniques – Interaction techniques – Specific Visual data
analysis Techniques.
Unit IV
Introduction To Streams Concepts – Stream Data Model and Architecture – Stream Computing –
Sampling Data in a Stream – Filtering Streams – Counting Distinct Elements in a Stream –
Estimating Moments – Counting Oneness in a Window – Decaying Window – Real- time analytics
Platform(RTAP) Applications – Case Studies – Real-Time Sentiment Analysis, Stock Market
Predictions.
Unit V
MapReduce –Hadoop, Hive, MapR – Sharding –NoSQL Databases – S3 – Hadoop Distributed File
Systems – Case Study – Preventing Private Information Inference Attacks on Social Networks –
Grand Challenge: Applying Regulatory Science and Big Data to Improve Medical Device
Innovation.
Reference Book:
1. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge
University Press, 2012.
2. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with
Advanced Analytics”, John Wiley & sons, 2012.
3. Pete Warden, “Big Data Glossary”, O‟Reilly, 2011.
4. Raymond Heatherly, Murat Kantarcioglu and Bhavani Thuraisingham, “Preventing Private
Information Inference Attacks on Social Networks” IEEE Transaction on Knowledge & Data Engg.,
Vol 25, No.8, Aug. 2013.
Semester-VIII
UNIT-I:
Introduction to Python, use IDLE to develop programs, Basic coding skills, working with data
types and variables, working with numeric data, working with string data, Python functions,
Boolean expressions, selection structure, iteration structure, working with lists, work with a list of
lists, work with tuples, work with dates and times, get started with dictionaries
UNIT-II:
Classes in Python: OOPS Concepts, Classes and objects , Classes in Python, Constructors,
Data hiding, Creating Classes, Instance Methods, Special Methods, Class Variables, Inheritance,
Polymorphism, Type Identification, Custom Exception Classes, Iterators, generators and decorators.
UNIT-III:
I/O and Error Handling In Python :Introduction, Data Streams, Creating Your Own Data Streams,
Access Modes, Writing Data to a File, Reading Data From a File, Additional File Methods,
Handling IO Exceptions, Errors, Run Time Errors, The Exception Model, Exception Hierarchy,
Handling Multiple Exceptions, Working with Directories.
UNIT-IV:
An Introduction to relational databases: SQL statements for data manipulation, Using SQLite
Manager to work with a database, Using Python to work with a database, Creating a GUI that
handles an event, working with components.
UNIT-V:
Implement Machine Learning algorthims:Usage of Numpy for numerical Data,Usage of Pandas
for Data Analysis, Matplotlib for Python plotting, Seaborn for Statical plots, interactive Dynamic
visualizations, SciKit for Machine learning.
TEXT BOOKS
1. Michael Urban and Joel Murach, Python Programming, Shroff/Murach, 2016
2. Haltermanpython
3. Mark Lutz, Programming Python, O`Reilly, 4th Edition, 2010
ONLINE RESOURCES:
https://www.w3schools.com/python
https://docs.python.org/3/tutorial/index.html
https://www.python-course.eu/advanced_topics.php
UNIT-I:
Introduction to Network Programming: OSI model, Unix standards, TCP and UDP & TCP
connection establishment and Format, Buffer sizes and limitation, standard internet services,
Protocol usage by common internet application.
UNIT-II:
TCP client server: Introduction, TCP Echo server functions, Normal startup, terminate and signal
handling server process termination, Crashing and Rebooting of server host shutdown of server
host.
UNIT-III:
Sockets: Address structures, value – result arguments, Byte ordering and manipulation function and
related functions Elementary TCP sockets – Socket, connect, bind, listen, accept, fork and exec
function, concurrent servers. Close function and related function.I/O Multiplexing and socket
options: I/O Models, select function, Batch input, shutdown function, poll function, TCP Echo
server, getsockopt and setsockopt functions. Socket states, Generic socket option IPV6 socket
option ICMPV6 socket option IPV6 socket option and TCP socket options.
UNIT-IV:
Elementary UDP sockets: Introduction UDP Echo server function, lost datagram, summary of
UDP example, Lack of flow control with UDP, determining outgoing interface with UDP.
Elementary name and Address conversions: DNS, gethost by Name function, Resolver option,
Function and IPV6 support, uname function, other networking information.
UNIT-V:
IPC : Introduction, File and record locking, Pipes, FIFOs streams and messages, Name spaces,
system IPC, Message queues, Semaphores. Remote Login: Terminal line disciplines, Pseudo-
Terminals, Terminal modes, Control Terminals, rlogin Overview, RPC Transparency Issues.
TEXTBOOK:
1. UNIX Network Programming, Vol. I, SocketsAPI, 2nd Edition. - W.Richard Stevens, Pearson
Edn. Asia.
2. UNIX Network Programming, 1st Edition, - W.Richard Stevens. PHI.
Unit I
WIRELESS COMMUNICATION FUNDAMENTALS – Wireless transmission – Frequencies
for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations –
Spread Spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks.
Unit II
TELECOMMUNICATION SYSTEMS :GSM – Mobile Services - System Architecture – Radio
Interface - Protocols – Localization and Calling – Handover – Security – GPRS
Unit III
WIRELESS NETWORKS :Wireless LAN - IEEE 802.11 Standards – Architecture – Services -
HIPERLAN – Ad Hoc Network – Bluetooth
Unit IV
NETWORK LAYER :Mobile IP – Dynamic Host Configuration Protocol – Routing – DSDV –
DSR – AODV – ZRP – ODMR.
Unit V
TRANSPORT AND APPLICATION LAYERS :TCP over Wireless Networks - Indirect TCP-
Snooping TCP- Mobile TCP- Fast retransmit / Fast Recovery – Transmission / Timeout Freezing –
Selective Retransmission- Transaction Oriented TCP – WAP – WAP Architecture – WDP – WTLS
– WTP – WSP – WML – WML Script – WAE - WTA.
Text Book:
Unit-1
System definition and components, stochastic activities, continuous and discrete systems, system
modeling, types of models, static and dynamic physical models, static and dynamic mathematical
models, full corporate model, types of system study.
Unit-II
System simulation, why & when to simulate, nature and techniques of simulation, comparison of
simulation and analytical methods, types of system simulation, real time simulation, hybrid
simulation , simulation of pure-pursuit problem, single-server queuing system and an inventory
problem, Monte-Carlo simulation, Distributed Lag models, Cobweb model.
Unit-III
Simulation of continuous systems, analog vs. digital Simulation, Simulation of water reservoir
system, Simulation of a servo system, simulation of an autopilot,Discrete system simulation, fixed
time-step vs. even to even model, generation of randomnumbers, test for randomness, Monte-Carlo
computation vs. stochastic simulation.
Unit-IV
System dynamics, exponential growth models, exponential decay models, modified exponential
growth models, logistic curves, generalization of growth models, system dynamic diagrams
Introduction to SIMSCRIPT: Program, system concepts, origination, and statements, defining the
telephone system model.
Unit-V
Simulation of PERT Networks, critical path computation, uncertainties in activity duration ,
resource allocation and consideration.
Simulation languages and software, continuous and discrete simulation languages, expression
based languages, object oriented simulation, general purpose vs. application - oriented simulation
packages, CSMP-III, MODSIM-III.
References
1. Geoftrey Gordon, “ System Simulation”, PHI
2. Jerry Banks, John S. C Barry L. Nelson David M. Nicol, “Discrete Event System
Simulation”, Pearson Education
3. V P Singh, “System Modeling and simulation”, New Age International.
4. Averill M. Law, W. David Kelton, “System Modeling and simulation and Analysis”,
TMH
1. Write a shell script that accepts a file name, starting and ending line numbers as arguments
and displays all the lines between the given line numbers.
2. Write a shell script that deletes all lines containing a specified word in one or more files
supplied as arguments to it.
3. Write a shell script that displays a list of all the files in the current directory to which the
user has read, write and execute permissions.
4. Write a shell script that receives any number of file names as arguments checks if every
argument supplied is a file or a directory and reports accordingly. Whenever the argument
is a file, the number of lines on it is also reported.
5. Write a shell script that accepts a list of file names as its arguments, counts and reports the
occurrence of each word that is present in the first argument file on other argument files.
6. Write a shell script that accepts any number of arguments and prints them in the reverse
order.
7. Write a shell script that determines the period for which a specified user is working on the
system.
9. Write an interactive file-handling shell program- Let it offer the user the choice of copying,
removing or linking files. Once the user has made a choice, have the program ask him for
the necessary information such as the file name, new name and so on.
14. Write a shell script that counts the number of lines and words present in a given file.