Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
NOIDA
&
INFORMATION TECHNOLOGY (IT) (Effective from the Academic Session: 2013-14)
SCHEME OF EVALUATION OF B. TECH SECOND YEAR (COMMON TO CSE AND IT) SEMESTER III Periods S.N O. 1 Subject Code AS-306/ HU-301 Subjects Technical Writing/ Introduction to Human Behaviour (Including Human Sociology and Psychology) Mathematics-III /Basics of System Modelling and Simulation Sensor & Instrumentation Data Structures Digital Design Discrete Structures Human Values and Professional Ethics General Proficiency
18/20 5/ 6 8
L 3
T 0
P 0
30 20 50
100
150
3 4 5 6 7 8
3 3 3 3 2
1 1 1 1 1
2 2 2 2 0
20 10 30 20 20 20 10 10 10 10 10 30 30 30 20
15 15 15 15 50
30 30 30 30 -
TA =10 (5 for teachers assessment plus 5 for attendance) TA=20 (10 for teachers assessment plus 10 for attendance) P= 15(4marks for practical exam. 4marks viva. 4marks for lab. records and 3 marks for quiz). P= 30(10marks for practical exam. 10marks viva. 5marks for lab. records and 5 marks for quiz).
Note: AU-301/AU-401 may be offered in both the Semesters. A student has to clear this subject in second year or in any semester after second year.
SEMESTER IV Periods S.N O 1 Subject Code HU-401/ AS-406 Subjects Introduction to Human Behaviour (Including Human Sociology and Psychology)/ Technical Writing Basics of System Modelling and Simulation/ Mathematics-III Computer Organization Data Base Management Systems Object Oriented Programming with C++ Theory of Computation Human Values and Professional Ethics General Proficiency
20 /18 6/5 8
L 3
T 0
P 0
30 20 50
100
150
3 4 5 6 7 8
3 3 3 3 2
1 1 1 1 1
2 2 2 2 0
20 10 30 20 10 30 20 10 30 20 10 30 10 10 20
15 15 15 15 50
30 30 30 30 -
TA =10 (5 for teachers assessment plus 5 for attendance) TA=20 (10 for teachers assessment plus 10 for attendance) P= 15(4marks for practical exam. 4marks viva. 4marks for lab. records and 3 marks for quiz) P= 30(10marks for practical exam. 10marks viva. 5marks for lab. records and 5 marks for quiz).
SEMESTER III
(COMMON TO CSE AND IT)
4. The course has to be taught in small batches so as to give individual attention to students both, in the process of learning to write as well as participation in conferences, seminars, workshops and project presentations. 5. The Books suggested have portions of Technical Communication in each and as such the same be treated as base texts. Expansion of the parts be undertaken with the help of relevant matter through internet. Infact, the students be encouraged to enhance their technical writing skills by self learning. Unit - I CommunicationNature and process. Channels of CommunicationDown ward, upward and horizontal Communication. Networks and Barriers to Communication. Technical CommunicationDefinition, Oral and written Technical Communication. Importance and Need for Technical Communication Nature of Technical Communication-Aspects and Forms of Technical Communication Technical Communication Skills-Listening, Speaking, Reading and Writing (Improving these with comprehensions). Unit -II Techniques of Writing, Selection of words and phrases in technical writing. Difference between Technical Writing and General Writing. Abstract and specific words Sentence structure, Requisites of sentence construction. Paragraph Length and structure Jargons and Clich. Unit -III Scientific Article Writing. Synopsis Writing, Project writing and Dissertation /Thesis Writing. Report Writing- meaning, significance, structure and style. Different type of Reports-routine reports and annual reports. Project Reports Sample Reports Technical Articles-nature, significance and types. Journal Articles and Conference Papers. Unit -IV Technical Note Making Mechanics and Note Writing Techniques. Technical Proposals- meaning, structure, types and significance. Types of Proposals Review and Research Articles. Elements of Technical Articles. Unit -V Meetings-Preparation of Agenda, participation, chairing and writing minutes of meetings. Conferences, Seminars, Technical Presentations and Workshops. Video Conferencing, technical description of engineering objects/produces and processes. Slogan Writing, Speech advertising.
CV Writing, difference between Biodata, CV and Resume. Types of resume and tips for resume writing. Text Books & References 1. 2. 3. 4. 5. 6. M Ashraf Rizvi, Effective Technical communication, Tata Mc Graw Hill Education Pvt. Ltd., 2012. Kavita Tyagi, Padma Misra, Basic Technical Communication, PHI Learning Pvt. Ltd, 2012. Sangeeta Sharma, Binod Mishra, Communication Skills for Engineers and Scientist, PHI Learning Pvt Ltd, 2012. Felicity O Dell & Michael Mc Carthy, Englsih Collocations in Advanced Use. Cambridge University Press 2010. Raymond Murphy. Essential English Grammar. Cambridge University Press. Sharon J. Gerson & Steven M. Gerson. Technical Writing, Eighth Impression, 2013, Pearson Education, Inc.
Performance & Evaluation System The students shall write two internal sessional tests as for other subjects besides the end-semester written exams. The internal sessionals will have a weightage of 20 marks and the end-semester theory examination shall carry 80 marks making the subject of Technical Writing worth 100 marks. Assignments are to be given to reinforce the concepts and ensure total understanding of technical writing. Suggested web-links: http://www.ego4u.com/ http://www.english4today.com/ http://www.learnamericanenglishonline.com/ http://learnenglish.britishcouncil.org/en/ http://www.englisch-hilfen.de/en/ http://www.englishclub.com/ http://www.englishlearning.com/ http://learningenglish.voanews.com/ http://www.usingenglish.com/dictionary.html http://www.mindtools.com/pages/article/newCS_99.http
HUMAN BEHAVIOUR
(Including Human Sociology and Psychology) HU-301/HU-401
Objective of the Course: The course intends to impart knowledge and learning of different aspects of human behaviour especially in the organisational context that directs human behaviour. This has special significance to the professionals as these aspects of human behaviour needs to be accounted for while taking a decision with respect to enhancement of human productivity. UNIT-I Concept, Nature, Characteristics, Conceptual Foundations and Importance, Roles & Skills of Human Capital. Humans Knowing Behaviour- Approaches to understand Cognitive, Behaviouristic & Social Cognitive behaviour, Pro-social Behaviour Nature and
Determinants (Standard Behaviour, Altruism, Empathy).
UNIT-II Perception and Attribution: Concept, Nature, Process, Importance. Management and Behavioural Applications of Perception. Attitude: Concept, Process and Importance, Attitude Measurement. Attitudes and Workforce Diversity. Personality: Concept, Nature, Types and Theories of Personality Shaping, Personality Attitude and Job Satisfaction. Learning: Concept and Theories of Learning. UNIT -III Motivation: Meaning, Maslows, Herzberg, McClellands Theories of Motivation, Leadership: Style and Theories of Leadership-Trait, Behavioural and Situational Theories, Conflict Management: Conflict: Concept, Sources, Types, Classification of Conflict Intra, Individual, Interpersonal, Intergroup and Organisational, Resolution of Conflict. UNIT -IV Group Dynamics: Types of Group and their development stages, concept, status, norms size and cohesiveness. Power and Politics: Concept, Sources of Power, Distinction between Power, Authority and Influence, Approaches to Power, Political Implications of Power: Dysfunctional Uses of Power. References: 1. Newstrom John W. - Organizational Behaviour: Human Behaviour at Work (Tata Mc Graw Hill, 2. Luthans Fred - Organizational Behaviour (Tata Mc Graw Hill, 10th edition)
3. Mc Shane L. Steven, Glinow Mary Ann Von & Sharma Radha R. - Organizational Behaviour (Tata Mc Graw Hill) 4. Robbins Stephen P. - Organizational Behaviour (Pearson Education) 5. Hersey Paul, Blanchard, Kenneth H and Johnson Dewey E. - Management of Organisational Behaviour: 6. Greenberg Jerald and Baron Robert A. - Behaviour In Organisations: Understanding and Managing the Human Side of Work (Prentice Hall of India) 7. Laurie J. Mullins 8. Ian Brooks : Essentials of Organizational Behaviour, Pearson Learning : Organizational Behaviour, Pearson Learning
AS-301A/AS-401A:ENGINEERING MATHEMATICS-III Group A (AEI, EE, EN, EC, IC, CS, IT, etc.) Prerequisites: AS-101 & AS-201 L T P 3 1 0
Analytic functions, Cauchy-Riemann equations . Conformal mapping (for linear transformation) . Cauchys theorem , Cauchy integral formula. Power Series, Taylor series, Laurent series . Zeros, Singularities, Poles. Residue theorem , Evaluation of real integrals of the type
2
f ( x ) dx .
Text Books:
1.Peter ONeil :Advance Engineering Mathematics, Cengage Learning 2. S.S. Sastry: Introductory Mathods of Numerical Analysis, Prentice-Hall of India Pvt.Ltd. 3. V. Krishna Murthy, V.P.Mainra, & J.L.Arora: An Introduction to Linear Algebra, Affiliated East-West Press Pvt.Ltd. 4. B.V.Ramana: Higher Engineering Mathematics, Tata McGraw Hill Publishing Co. Ltd. 5. S.R.K. Iyenger, R.K. Jain, Mathematical Methods, Second Edition, Narosa Publishing House.
Reference Books:
1. Erwin Kreyszig: Advance Engineering Mathematics,Wiley India. 2. H.K.Dass : Higher Engineering Mathematics,S.Chand & Co.Ltd. 3. Michael Greenberg: Advance Engineering Mathematics, Pearson. 4. B.S.Grewal: Numerical Methods in Engg. & Science, Khanna Publisher. 5. Gilbert Strang: Linear Algebra and its application , Cengage Learning.
Course Objectives:
1. To present concepts of computer modelling and simulation to various natural, manmade, social and engineering systems. 2. The course will provide experience of modelling & simulation specifically suited to engineering systems to show how it can help in the analysis, design, performance evaluation, operational behaviour and assessment of performance & efficiency with respect to specific goals.
Learning Outcomes:
1. Understand the modelling concepts & types of models used to represent different classes of real world systems. 2. Applying various mathematical concepts & techniques to define physical, natural & social systems. 3. Applying concepts of computer simulation for types of inputs, system models, output behaviour and performance estimation. 4. Understand how to evaluate, validate & verify models of simple systems. 5. Understand how complex and heterogeneous systems can be simplified and modelled for a specific task and thus understand the limitations of modelling & simulation.
Course Content: Unit -I: Introduction to System Modelling & Simulation: (7 lectures)
Need & use of Simulation, system models, advantages & limitations of models, simplified representation of complex & large systems, Principals & Steps in creating system models, capturing system environment, components of systems and selection of appropriate modelling techniques & simulation methodologies; relationships between selected models & simulation techniques.
List of experiments:
1. Simulation of Scheduling Algorithms: CPU Scheduling Techniques: FCFS, SJF, & Priority Scheduling, Using Queuing Theory 2. Simulation of Disk Scheduling Algorithms. 3. Modelling Multiplexers & Concentrators and applying queuing theory concepts to determine operational performance parameters. 4. Simulation of System Reliability of any given system and determine its reliability and average failure rate based on the given component reliability. 5. Modelling of Traffic based on given statistics of Traffic Density & vehicle heterogeneity. 6. Telephone Exchange Modelling & Call rate & Call drop estimation based on exchange capacity. 7. Congestion Modelling & Analysing the impact of congestion control algorithms in Mobile systems/ Computer networks/ Assembly Line operations.
Note: Students shall perform practicals in tutorial periods using Sci Lab which is freely downloadable from http://www.scilab.org/products/scilab http://www.scilab.in/
Text Books 1. DVS Murthy Transducers and Instrumentation, PHI 2nd Edition 2013 2. D Patranabis Sensors and Transducers PHI 2nd Edition 2013. 3. Ranjan CS (et.al) Instrumentation and Device Systems PHI. Reference Books 1. Arun K. Ghosh Introduction to measurements and Instrumentation, PHI, 4th Edition 2012. 2. A.D. Helfrick and W.D. cooper Modern Electronic Instrumentation & Measurement Techniques. PHI 2001 3. DAVID A. BELL Electronic Instrumentation & measurement 3rd Edition 2013, Oxford University Press. 4. Hermann K.P. Neubert, Instrument Transducers 2nd Edition 2012, Oxford University Press. Web Resource: NPTEL course. EE-305P 1. Study of Potentiometric Displacement Sensor. 2. Study of LVDT sensor 3. Study of Thermocouple & RTD sensors. 4. Frequency measurement of supply voltage 5. Study of Ultrasonic Flow Sensor 6. Study of ADC & DAC 7. Study of Proximity Sensors. 8. Acquisition of various sensors Output using USB DAQ. 9. Study of Active Low Pass Filter. 10. Study of Strain Gauges.
L:T:P ::3:1:2
Prerequisite: Students should be familiar with procedural language like C and concepts of mathematics Objective: To make students understand specification, representation, and implementation of data types and data structures, basic techniques of algorithm analysis, recursive methods, applications of Data Structures. Course Outcome: On completion of this course, student should be able to1. Understand abstract data types 2. Understand and use arrays and link lists for various operations like insert, delete, append and concatenate etc. 3. Understand applications of link lists like polynomial addition and multiplication etc. 4. Understand operations on Stacks, Trees, AVL Trees, B-Trees and B+-Trees etc. 5. Understand representation of graphs and their traversal; concept of Minimum Spanning Tree etc. 6. Understand various sorting and searching algorithms with their time complexities. 7. Understand concept of garbage collection and compaction. Unit I Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations: Big-Oh, Time-Space trade-off. Abstract Data Types (ADT). Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column Major Order, Application of arrays, Sparse Matrices and their representations. Stacks: Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Recursion, Tower of Hanoi Problem, Simulating Recursion, Principles of recursion, Tail recursion, Removal of recursion Unit II Queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array implementation of queues in C, Dequeue and Priority Queue. Linked lists: Array Implementation and Dynamic Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial Representation and Addition, Generalized Linked List. Linked implementation of stack, queues, Dequeue and Priority Queue.
Unit III
Searching : Sequential search, Binary Search Sorting: Comparison and Analysis Internal Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort, Radix Sort, Practical consideration for Internal Sorting
Hashing: Hash Function, Collision Resolution Strategies Storage Management: Garbage Collection and Compaction. Unit IV Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation and Dynamic Representation, Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Array and Linked Representation of Binary trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Threaded Binary trees, Traversing Threaded Binary trees, Huffman algorithm.
Search Trees: Binary Search Trees(BST), Insertion and Deletion in BST, Complexity of Search Algorithm, AVL trees, Introduction to m-way Search Trees, B Trees & B+ Trees.
Unit V Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices, Adjacency List, Adjacency Multi list, Graph Traversal : Depth First Search and Breadth First Search, Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Transistive Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm, Introduction to Activity Networks Text Books: 1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein Data Structures Using C and C++ , Pearson Education. 2. Horowitz and Sahani, Fundamentals of Data Structures, Galgotia Publication. References: 1. Jean Paul Trembley and Paul G. Sorenson, An Introduction to Data Structures with applications, McGraw Hill. 2. R. Kruse et al, Data Structures and Program Design in C, Pearson Education. 3. Seymour Lipschutz, Data Structures with C Schaums Outline Series, TMH. 4. G A V Pai, Data Structures and Algorithms, TMH. Web References 1. http://www.nptel.iitm.ac.in/video.php?subjectId=106102064 2. http://www.cs.auckland.ac.nz/~jmor159/PLDS210/ppt/index.html 3. http://www.informatics.sussex.ac.uk/courses/dats/dats.html 4. http://www.cs.umd.edu/~mount/420/Lects/420lects.pdf
Week Week-1
Lecture 3 Arrays: Ordered List, Linear and Multidimensional Arrays, Representations of Array Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C, Queues- Create, Add, Delete, Full and Empty, Circular queues,
Week-2
Operations on Array: Traversal, Insertion, Deletion Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Recursion, Tower of Hanoi Problem, Array Implementation and Dynamic Implementation of Singly Linked Lists, Circularly Linked List,
Text-1 chapter-1
Week-3
Text-1 chapter-2
Application of arrays, Sparse Matrices and their and overview: Basic Terminology representations Simulating Recursion, Principles of recursion, Tail recursion, Removal of recursion
Text-1 chapter-1
Text-1 chapter-2
Lab Meeting Array Operations and Stack Operations using array Week -3 Application of stack: Evaluation of Expression
Text-1 chapter-3
Week-4
Text-1 chapter-4
Text-1 chapter-4
Text-1 chapter-4
Week-5
Week-6
Week-7
Linked implementation of stack, queues, Dequeue and Priority Queue. Quick Sort
Text-1 chapter-4
Text-1 chapter-4
Text-1 chapter-7
Text-1 chapter-6 Text-2 chapter 7 Text-1 chapter-6, Text-2 chapter 7 Text-2 chapter 9
Week-8
Week-9
Radix Sort, Practical consideration for Internal Sorting Trees: Basic terminology, Binary Trees, Binary
Text-1 chapter-6 text-2 chapter 7 Text-1 chapter 6 Text-2 chapter 9 Text-1 chapter-5
Hash Function, Collision Resolution Strategies Tree Representation: Array Representation and Dynamic Representation,
Heap Sort
Sorting
Storage Management: Garbage Collection and Compaction. Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Array and Linked Representation of Binary trees, Huffman algorithm.
Sorting
Text-1 chapter-5
Text-1 chapter-5
Binary Tree
Week-10
Week-11
Week-12
Tree Traversal algorithms: Inorder, Preorder and Postorder, Binary Search Trees(BST), Insertion and Deletion in BST, Complexity of Search Algorithm B Trees & B+ Trees.
Text-1 chapter-5
Text-1 chapter-5
Threaded Binary trees, Traversing Threaded Binary trees Binary Search Trees(BST), Insertion and Deletion in BST, Complexity of Search Algorithm Graphs: Terminology, Sequential and
Text-1 chapter-5
Text-1 chapter-5
Tree traversal
Text-1 chapter-5
Reference-3 chapter 7
chapter 7 Week-13 Graph Traversal : Depth First Search and Breadth First Search Transistive Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm Text-1 chapter-8
linked, Applications Connected Component, Spanning Trees, Transistive Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm
Week-14
Text-1 chapter-8
Text-1 chapter-8
List, Adjacency Multi list, Minimum Cost Spanning Trees: Prims and Kruskal algorithm Introduction to Activity Networks
Text-1 chapter-8
Implementation of Stack, Queue, Circular Queue, List using Dynamic memory Allocation. Implementation of Tree Structures, Binary Tree, Tree Traversal, Binary Search Tree, Insertion and Deletion in BST. Implementation of Searching and Sorting Algorithms. Graph Implementation, BFS, DFS, Min. cost spanning tree, shortest path algorithm.
L:T:P ::3:1:2
This course is intended to provide the students with a comprehensive understanding of the fundamentals of digital logic circuits. Students should be able to analyze, design, and implement combinational and sequential circuits. Course Pre requisites: There are no definite prerequisites. However, an understanding of Boolean algebra will be useful. Course Contents: Unit Topic
Text Book / Topics
Lectures
I a)
Binary ,Octal and Hexadecimal Numbers Number base conversions Complement of numbers Signed Binary Numbers Binary Codes
Boolean Algebra And Logic Gates: Basic Theorems and properties of Boolean Algebra Boolean Functions Canonical and Standard Forms Other Logic Operations Digital Logic Gates Gate-level minimization:
b)
2.4 2.5 2.6 2.7 2.8 3.2,3.3,3.4 3.5 3.6 3.7,3.8 3.9 3.10
c)
K- map method( up to five variable) POS simplification, 4 Dont care conditions NAND and NOR implementation, Other Two Level implementations Ex-OR Function QuineMc-Clusky method (Tabular method). 5 Combinational Logic : Analysis and Design Combinational circuits, Analysis procedure, design procedure
Binary adder-subtractor, Decimal adder Binary multiplier, Magnitude comparator Decoders, Encoders Multiplexers, Demultiplexers
II
4.1 to 4.4 8 4.1,4.2 4.3,4.4 4.5 4.6 4.7 4.8 4.9,4.10 4.11
III
IV
Asynchronous Sequential Logic : Analysis and Design Asynchronous sequential logic Analysis procedure
Circuit with latches Design procedure, Reduction of State and Flow tables Race free state assignment, Hazards Design Example
V a)
b)
Text Book: 1. Digital Design, M. Morris Mano and M. D. Ciletti, 5th Edition, Pearson Education Reference Books: 1. Fundamentals of Logic Design, Charles H. Roth, Jr., 5th Edition, Brooks/Cole, a division of Thomson, 2004.
2. 2. "Digital Principles and Application", D P Leach, A P Malvino and Goutam Saha, 7th Edition, TMH
3. 3. "Digital Design - Principles and Practices" , J F Wakerly, 4th Edition, Pearson Education
Course Outcome: On successful completion of this course, students will be able to:
Understand various number systems and perform number conversions between different number systems Gain the knowledge of logic gates (AND, OR, NAND, NOR, XOR, XNOR) Understand Boolean algebra and use it in representing, analyzing, and designing digital logic circuits. Use K-maps and Tabular Method to minimize and optimize two-level logic functions up to 5 variables. Design a combinational logic circuit from given specifications Analyze a given combinational circuits , developing a truth table and Boolean expression Design simple sequential logic circuit from given specifications. Analyze the behaviour of a given sequential circuit, producing an appropriate state table and state diagrams. Understand the basics of: ROM, RAM, PROM, PLA, PAL, etc.
Lab.EC- 302 P
Course Objective: This lab course focuses on design and implementation of combinatorial logic and sequential logic digital circuits. Students will design, construct, test and troubleshoot digital circuits of both combinational and sequential types in the lab. Course Pre requisites: This course has no prerequisites. The co-requisite course for this lab is EC-302 (Digital Design). Course Content:
ExpNo .
Experiment
Objective
Expected Outcome
1.
1. To study and understand To get familiarized with pinconfiguration of different types nomenclature, pin-configuration, and data sheets of 74 series TTL ICs. of 74 series TTL ICs. 2. To verify and interpret truth tables for AND, OR, NOT, NAND, NOR Exclusive OR and Exclusive NOR Gates. To get familiarized with the Different Portions of the datasheet for a Digital IC and using the datasheet to gather relevant information to utilize the IC as a Component in another Digital Logic Circuit.
2.
1. To realize a given logic functions with the help of universal gateNAND Gate 2. To realize a given logic functions with the help of universal gate-NOR Gate 3. To realize an XOR and XNOR gate using minimum number of NAND gates.
To be able to use NAND or NOR gates for the implementation of any other gate and also for the realization of any given Boolean function
3.
1. To design and implement Half Adder and Half Subtractor using logic gates.
Should be able to understand Binary addition/subtraction by noting down the output readings of sum/difference and the
Subtractors
2. To design and implement Full Adder and Full Subtractor using logic gates 3. To design and implement 4- bit binary Adder/ Subtractor . Using IC 7483 4. To design and implement BCD adder using IC 7483
carry/borrow bit for different combinations of inputs. Should be able to understand the difference between BCD and Binary addition
1. To design and implement BCD to excess-3( and vice versa) code converters using logic gates. 2. To design and implement Binary to gray (and vice versa code converters) using logic gates.
Should be able to understand and implement code-conversion process using basic logic gates
1. To design and implement 2 bit Magnitude Comparator using logic gates. 2. To design and implement 8- bit Magnitude Comparator using IC 7485.
To understand the process of comparing two 2-bit numbers using logic gates To be able to understand, and use Equivalence Function for implementing Magnitude comparators. To get familiarized with Magnitude Comparator IC To understand and verify the concept of adding even and odd parity in the transmitted data To understand and verify the concept of checking even and odd parity in the received data To be able to understand and verify the concepts of encoding and de-coding using basic logic gates To get familiarized with the ICs used as encoder/decoder To be able to understand and verify the concepts of data multiplexing and demultiplexing using basic logic gates
1. To design and implement 4 to 2 encoder using logic gates. 2. To design and implement 3 to 8 decoder using logic gates 3. To study and test IC7445 and IC74147.
1. To design and implement 4:1 Multiplexer using logic gates. 2. To design and implement 1:4 De-
multiplexer using logic gates 3. To study and test IC74150 and IC 74154 9. Design and implementation of shift registers 1. To design and implement 4-bit SISO, SIPO, PISO and PIPO shift registers using Flip- flops. 2. To design and implement 8- bit Shift left/shift right register using flip-flops 10. Design and implementation of Synchronous and Asynchronous Counters 1. To design and implement 3-bit synchronous up/down counter. 2. To implement and verify 3-bit asynchronous up/down counter. 3.To design and implement synchronous /asynchronous MOD counters.
To get familiarized with the use of decoder IC as demultiplexer. To be able to understand and verify the concepts of Serial in-serial out, Serial in-parallel out, Parallel in- parallel out and Parallel in- serial out shift register operations
To be able to design and verify the up/down counting using synchronous/ ripple counters To understand the concept of Modulus and implement a synchronous/asynchronous counter for any given Modulus using minimum number of Flip-flops.
MINI PROJECT 11. Mini Project in Digital Design To design, implement and verify a mini project using easily attainable parts Students will acquire the ability to make links across different areas of knowledge and to generate, develop and evaluate ideas and information so as to apply these skills to the project task. Students will acquire collaborative skills through working in a team to achieve common goals.
Course Outcome: The students are expected to acquire basic troubleshooting skills necessary for the design and analysis of digital circuits. References: 1. Digital Design, M. Morris Mano and M. D. Ciletti, 5th Edition, Pearson Education 2. Fundamentals of Logic Design, Charles H. Roth, Jr., 5th Edition, Brooks/Cole, a division of Thomson, 2004. 3. Virtual Lab Website http://www.vlab.co.in/, http://www.digital.iitkgp.ernet.in/dec/index.php
L:T:P ::3:1:2
Objective: Introduce propositional and predicate logic, Introduce the basics of integer theory, counting principles, Introduce and work with important discrete data structures such as sets, relations, sequences, and discrete functions.
Course Outcome: On completion of this course, student should be able to1. Understand the concepts of Set Theory, Relations, Functions, Groups, Abelian Groups, Rings and Fields. 2. Understand the concepts of Propositional Logic, Predicate Calculus and Quantifiers; and how to check validity of statements. 3. Understand the concepts of Recurrence Relation and method to solve the Recurrence Relation using Generating Function. 4. Understand the basic concepts of Graph Theory. UNIT -I: Basic Structures- Sets, Functions and Relations Set Theory: Introduction to the theory of sets; combination of sets; multisets; ordered pairs, power sets; finite and infinite sets; principle of inclusion and exclusion; proofs of some general identities on sets. Relations: definitions and properties of relations; relation composition; representations of relations by binary matrices and digraphs; operations on relations. closure of relations; reflexive, symmetric and transitive closures. Warshall's algorithm to compute transitive closure of a relation; equivalence relations and equivalence classes, partial order sets, combination of partial order sets, Hasse diagram. definition, properties of lattices bounded, complemented, modular and complete lattice. Functions: definition, classification of functions, operations on functions. UNIT -II Techniques of Counting, Induction and recurrence Relation Recurrence Relation: Recursive definition of functions, Recursive algorithms, Method of solving recurrences. Counting: Introduction, Counting Techniques, Pigeonhole Principle, Permutation and Combinations. Induction: Mathematical induction, Variants of induction. UNIT -III Algebric Structures Algebraic Structures: Definition, Groups, types:Semi Groups,Monoid Group,Abelian group, properties of groups, Subgroups and order, Cyclic Groups, Cosets, Lagranges theorem, Normal Subgroups, Permutation and Symmetric groups, Group Homomorphisms, Definition and elementary properties of Rings and Fields, Integers Modulo n. UNIT -IV Logic Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps, Logic gates, Digital circuits and Boolean algebra. Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability, Contradiction, Algebra of proposition, Theory of Inference. Predicate Logic: First order predicate, well formed formula of predicate, quantifiers, Inference theory of predicate logic.
UNIT -V Graphs and Trees Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph coloring. Trees : Definition, Binary tree, applications of trees, Binary tree traversal, Binary search tree, spanning trees. Textbook: 1. Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill, 2006. 2. Babu Ram et.al., Discrete Mathematics, Pearson Education. References: 1. C.L. Liu, Elements of Discrete Mathematics, 2nd Edition, McGraw Hill, 1985. 2. Jean Paul Trembley, R Manohar, Discrete Mathematical Structures with Application to Computer Science, McGraw-Hill, Inc. New York, NY, 1975. 3. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004. 4. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000. 5. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004. Web References 1. nptel.iitm.ac.in/video.php?subjectId=106106094 2. http://www.cs.virginia.edu/~asb/teaching/cs202-spring07/slides.html 3. www.abstractmath.org/MM/dm.pdf.
Week Week-1
Lecture 1 introduction to the theory of sets; combination of sets; multisets; ordered pairs, power sets; finite and infinite Operations on relations. closure of relations; reflexive, symmetric and transitive closures. definition, properties of lattices bounded, complemented, modular and complete lattice.
Lecture2 principle of inclusion and exclusion; proofs of some general identities on sets; selected problems from each topic Warshall's algorithm to compute transitive closure of a relation; equivalence relations and equivalence classes Functions: definition, classification of functions, operations on functions
Lecture 3 Relations: definitions and properties of relations; relation composition; representations of relations by binary matrices and digraphs; Partial order sets, combination of partial order sets, Hasse diagram.
Week-2
Text-1 chapter 7
Text-1 chapter 7
Text-1 chapter 7
Lab Experiment-2
Week-3
Text-1 chapter 7
Text-1 chapter 7
Text-1 chapter 2
Lab Experiment-3
Week-4
Recursive algorithms
Method of recurrences.
solving
Growth of functions.
Week-5
Pigeonhole Principle, Permutation and Combinations Definition, Groups, types:Semi Groups,Monoid Group
Introduction to induction
Week-6
Text-1 chapter 4
Text-1 Chapter 11, Text2 Chapter 10 Text-1 Chapter 11, Text2 Chapter 10 Text-1 Chapter 11, Text2 Chapter 10 Text-1 chapter10
Lab Experiment-6
Week-7
Cyclic Cosets,
Groups,
Text-1 Chapter 11, Text-2 Chapter 10 Text-1 Chapter 11, Text-2 Chapter 10 Text-1 chapter10
Normal Subgroups,
Lab Experiment7
Week-8
Group Homomorphisms
Integers Modulo n
Lab Experiment-8
Week-9
Text-1 chapter-10
Simplification of Boolean Functions, Karnaugh maps, Logic gates, Digital circuits and Boolean algebra
Lab Experiment-9
Week10
Text-1 chapter-1
Text-1 chapter-1
Text-1 chapter-1
Lab Experiment10
Week11
First order predicate, well formed formula of predicate Graph:Definition and terminology
Text-1 chapter-1
quantifiers
Text-1 chapter-1
of
Text-1 chapter-1
Week12
Text-1 chapter-8
Representation graphs
of
Text-1 chapter-8
Multigraphs, graphs
Bipartite
Text-1 chapter-8
Week13
Planar graphs, Isomorphism and Homeomorphism of graphs Definition, Binary tree, applications of trees
Text-1 chapter-8
Text-1 chapter-8
Graph coloring.
Text-1 chapter-8
Week14
Text-1 chapter-9
Text-1 chapter-9
tree,
Text-1 chapter-9
Lab Experiment14
LAB. CS-302P:
NOTE: More programs can be added to the list 1. Assume that the universal set U is finite. Given subsets A and B of U, write a program using bit strings to find the following a. b. A B c. A B d. A B e. A B 2. Implement sets which includes simulation of following operations on set a. Subset b. Union c. Intersection d. Cartesian product e. Membership f. Difference g. Power set h. Symmetric difference i. Set Cardinality 3. Using the matrix representation of binary relations on a finite set, write programs to a. Determine whether the relation is reflexive b. Determine whether the relation is symmetric c. Determine whether the relation is transitive d. Find the matrix representing intersection of two relations e. Find the matrix representing the union of two relations 4. Write a program to find the matrix representing the transitive closure using the Warshalls algorithm. 5. Write a code to check whether a function is one to one. 6. Write recursive function to find a. successor of a number b. predecessor of a number
c. Ackermanns function for natural numbers m and n. 7. Write programs using recursion for each of the following. Also formulate and solve recurrences for them. a. Greatest Common Divisor of two numbers b. Linear Search c. Binary Search 8. Given a positive integer n and a nonnegative integer not exceeding n, write a program to find the number of r-permutations and r-combinations of a set with n elements 9. Given a positive integer n, write a program to list all the combinations of the set {1,2,3..., n} 10. Write functions to simulatea. AND b. OR c. NOT d. XOR e. NAND f. NOR 11. Write functions to implement the logical expressionsa. p AND (p OR q ) b. NOT p OR q c. (p AND q) OR ( NOT p AND NOT q ) 12. Write a program to simulate K-map to simplify the 3 variable Boolean expression 13. Write a program for binary tree traversal 14. Write a program for graph traversal a. DFS b. BFS
SEMESTER IV
SYLLABI OF HU-401, AS-406, AS-401A, AS-402, AND AU-401 HAVE ALREADY BEEN INCLUDED IN THIRD SEMESTER
L:T:P ::3:1:2
Course Objectives: Objective of this course is to have a thorough understanding of the basic structure and operation of a digital computer, to study the different ways of communicating with I/O devices and standard I/O interfaces and to study the hierarchical memory system including cache memories and virtual memory. The Subject discusses in detail the operation of the arithmetic unit including the algorithms & implementation of fixed-point and floating-point addition, subtraction, multiplication & division. Pre-requisites: Binary number System and Boolean algebra. Gates and flip flops. Combinational and sequential logic UNIT-I Introduction: - Review of digital logic and gates, Design of adder and subtractor using gates & K-MAP, functioning of multiplexer, de-multiplexer, flip-flop. Arithmetic for Computer:- Introduction to number system, negative numbers, addition & subtraction, logical operation, constructing and A.L.U., multiplications & division, floating point arithmetic. UNIT-II Processor Design:- Processor organization, Processor Level, information representation, instruction format, Addressing modes (Implied Mode, Immediate mode, register indirect mode, auto increment or Auto decrement mode, direct addressing mode, indirect addressing mode, relative addressing mode, index addressing mode), instruction types. UNIT-III Control Design: - Basic Concepts, Hardwired Control, Control memory address sequencing, micro instruction interpretation, CPU control unit, basic concepts of micro programmed control, micro program sequencer for a control memory, micro instruction formats. UNIT-IV Memory Organization:- Classification memories, Memory Hierarchy, Optimization of memory hierarchy, Virtual Memory, Dynamic Address Translation Scheme addressing scheme for main memory, segmented memory system, paged segment memory, memory management policies, High speed memories, characteristics of cache memory, Cache memory organization, Block replacement policies, interleaved memories, associated memories. UNIT-V System Organization: - Bus arbitration, Programmed I/O (IO addressing, IO instruction), DMA (Types & procedures), interrupts (procedure, interrupt selection, vectored interrupts), Concurrency Control, System management.
Text Books: 1. Computer Architecture and Organization, By John P. Hayes, Me Graw Hill. References: 2. Computer organization and design, by John L. Hennessy 7 David A. Petterson, Morgan Kaufman. 3. Computer System Architecture, by M. Morris Mano, PHI Web Resourses: http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-KANPUR/CompArchitecture/page1.htm
Week Lecture 1 Chapter Lecture2
Design of adder and subtractor using gates & K-MAP Addition & subtraction, logical operation, constructing and A.L.U. Floating point arithmetic. Processor Level
Chapter
Lecture 3
Functioning of multiplexer, demultiplexer, flipflop
Chapter
Lab Meeting Study of Breadboard Based Lab Study of Simulator Based Lab
Week-1
Week-2
4.1 T1
Multiplications
4.1 T1
Week-3 Week-4
4.1 T1 3.1 T1
4.3 T1 2.3 T1
Revision and Discussion Information Representation Addressing Mode Revision and Discussion Micro instruction interpretation Micro program sequencer for a control memory Revision and Discussion Optimization of memory hierarchy Memory management policies
3.2 T1
Week-5 Week-6
3.3 T1 3.3 T1
Addressing Mode Revision and Discussion Hardwired Control Basic concepts of micro programmed control Revision and Discussion Memory Hierarchy
3.3 T1 -
3.3 T1 -
Week-7
Basic Concepts
5.1T1
5.1T1
5.2T1 5.2T1
Week-8
5.2T1
5.2T1
Week-9
5.2T1
Week-10
Classification memories
6.1T1
6.2T1
6.2T1
Week-11
Virtual Memory, Dynamic Address Translation Scheme addressing scheme for main memory High speed memories, characteristics of cache memory Bus arbitration
6.2T1
6.2T1
6.2T1
Week-12
6.3T1
Cache memory organization, Block replacement policies Programmed I/O (IO addressing, IO
6.3T1
6.3T1
Lab10
Week-13
7.1T1
7.2.T1
7.2.T1
Lab11
instruction)
Week-14
7.2.T1
Concurrency Control
7.3.T1
System management
7.3.T1
Lab11
Lab. CS-401P 1. Breadboard implementation of flip flops SR, JK, T and D flip flop And verify their characteristic table. 2. Experiments with clocked flip-flops 3. Design of Counters 4. Breadboard implementation of Counters and Shift Registers. 5. Implementation of arithmetic algorithms. 6. Breadboard implementation of Half/Full Adder and Half/Full Subtractor. 7. Breadboard implementation of Half/Full Adder. 8. Breadboard implementation of 7-segment display. 9. Ripple Carry Adder:( 4 bit ripple carry adder) Using Simulator 10. Carry-look-ahead adder:(4 bit carry lookahead adder) Using Simulator 11. Carry-Save-ahead adder:(4 bit carry lookahead adder) Using Simulator 12. Booth's Multiplier: (Objective of 4 bit Booth's multiplier) Using Simulator Course Plan
Topic 1.Introduction: - Review of digital logic gates, Design of adder and subtractor using gates &K-MAP, functioning of multiplexer, de-multiplexer, flip-flop. Arithmetic for Computer:-Introduction to number system, negative numbers, addition &subtraction, logical operation, constructing and A.L.U., multiplications & division, floatingpoint arithmetic. 2.Processor Design:- Processor organisation, Processor Level, information representation,instruction format, Addressing modes (Implied Mode, Immediate mode, register indirectmode, auto increment or Auto decrement mode, direct addressing mode, indirectaddressing mode, relative addressing mode, index addressing mode), instruction types. 3. Control Design: - Control memory address sequencing, micro instruction interpretation,CPU control unit, basic concepts of micro programmed control, micro program sequencerfor a control memory, micro instruction formats. 4.Memory Organization:- Classification memories, Memory Hierarchy, Optimization ofmemory hierarchy, Virtual Memory, Dynamic Address Translation Scheme addressingscheme for main memory, segmented memory system, paged segment memory, memorymanagement policies, High speed memories, characteristics of cache memory, Cachememory organisation, Block replacement policies, interleaved memories, associatedmemories. 5. System Organization: - Bus arbitration, Programmed I/O (IO addressing, IO instruction),DMA (Types & procedures), interrupts (procedure, interrupt selection, vectored interrupts),Concurrency Control, System management. Reference John P. Hayes Hour 8 Hr
John P. Hayes
8 Hr
John P. Hayes
8 Hr
John P. Hayes
8 Hr
John P. Hayes
8 Hr
L:T:P ::3:1:2
Objective: The main objective of this course is to provide students with the background to design, implement, and use database management systems. A variety of topics will be covered that are important for modern databases in order to prepare the students for real life applications of databases. Prerequisite: Basic Concepts of Algebra Unit-I [Text Book 1 and 2] (8 Hours) Introduction: An overview of database management system, Database System vs. File System, Database System Concept and Architecture, Data Models, Schema And Instances, Data Independence And Database Language And Interfaces, Overall Database Structure. Data modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, Candidate Key, Primary Key, Foreign Key, Generalization, Specialization, Aggregation, Attributes Inheritance, reduction of an ER diagrams to tables, relationship of higher degree. Unit-II [Text Book 1] (8 Hours) Relational data Model and Language: Relational data model concepts, Codds Rule, Integrity Constraints, Entity Integrity, Referential Integrity, Keys constraints, Domain constraints, Relational Algebra and Relational Calculus. Introduction on SQL: SQL data type and literals. Types of SQL commands: DDL commands (Create, Alter and Drop), DML commands (Insert, Update and Delete), SQL operators and their procedure. Tables, Views and Indexes. Queries and Sub Queries. Aggregate Functions. Joins, Unions, Intersection, Minus. Unit-III [Text Book 1 and 2] (8 Hours) Overview of PL/SQL, Cursors, Triggers, and Procedures. Data Base Design & Normalization: Functional Dependencies, Inference Rules, Normal Forms, First, Second, Third Normal Forms, BCNF, Inclusion Dependence, Loss Less Join Decompositions, Normalization Using FD, MVD And Fourth Normal Forms, JD and Fifth Normal Forms, Alternative Approaches to Database Design. Unit-IV [Text Book 2] (8 Hours) Transaction Processing Concept: Transaction System, Recoverability, Recovery From Transaction Failures, Log Based Recovery, Checkpoints, Shadow Paging, Cascading Rollback, ARIES, Testing of Serializability, Serializability of Schedules, Conflict & View Serializable Schedule. Introduction to Distributed Database, Multimedia Database and Object-Oriented Database. Unit-V [Text Book 3] (8 Hours) Concurrency Control Techniques: Concurrency Control, Locking Techniques for concurrency control, Two-phase locking protocol, Deadlock Handling, Time stamping protocols for concurrency control, Thomas write rule, validation based protocol, multiple granularities, Multi version schemes, Recovery with concurrent transaction. Overview of Big Data Text Books 1. Korth, Silberschatz, Sudarshan, Database Concepts, 6th Edition, McGraw Hill Pub. 2. Elmasri, Navathe, Fundamentals of Database Systems, 6th Edition, Addison Wesley. 3. Ramkrishnan, Gehrke, Database Management System, 3rd Edition, McGraw Hill
Reference Books 1. Date C J, An Introduction to Database Systems, Addision Wesley 2. ONeil, Databases, Elsevier Pub. 3. Leon & Leon, Database Management Systems, Vikas Publishing House 4. Bipin C. Desai, An Introduction to Database Systems, Gagotia Publications 5. Majumdar & Bhattacharya, Database Management System, TMH Web References 1. NPTEL Material at http://nptel.iitm.ac.in/video.php?subjectId=106106093 2. ISTE Workshop on DBMS, Video Lectures and Content available at http://www.it.iitb.ac.in/nmeict/eVideos/DBMSMAIN/content/content.htm l Lab. CS-402P Write the queries for Data Definition and Data Manipulation Language. 1. Write syntax for creating the following tables: STUDENT (Roll_No, Name, Branch, Year, Section, Hostel, F_name, Address) BOOK (Book_id, Title, Author, Publisher, Cost, Copies) TRANSACTION (Roll_No, Book_Id, Date_Issue, Date_Return, Fine) Add Primary Key and Foreign key to appropriate attributes in the above mentioned tables. Add a constraint on Book table for accepting value in Copies attribute not less than 0. 2. Write SQL command to add a new field DOB in the STUDENT table. 3. Write SQL command to drop Fine column from TRANSACTION table. 4. Insert at least 5 records in each table. 5. Update title of books from Database Management Systems to DBMS. 6. Delete all entries from the Hostel column of STUDENT table. 7. Write SQL Queries for the following: (a) To display the details of all students (b) Display the records of (a) in ascending order of Roll_No. (c) To display all Networking Books in the Library (d) To display those books which have Computer word in their title (like Computer Fundamentals, Computer Graphics etc.) (e) To display all the books which have been issued so far (f) To display the books which have not been issued so far (g) To display all the students of 4th year CSE branch who are staying in Hostel (h) To display the students names who have not returned the books issued to them. (i) To display the student names who have been issued DBMS book by Korth. (j) To display the students who have not issued any book so far. (k) To display the students who have been issued at least one book. (l) To display the title of the second costliest book. (m) To display the students who have not returned the book more than 6 weeks. (n) To display the student names along with all the books issued to them.
(o) To display the students of IV year from CSE branch who have been issued Graphics book(s) for more than 15 days, which have not been returned. 8. Create view to access the students details only from 4th year of CSE branch. 9. Create an index on Title column of BOOK Table. 10. Write PL/SQL program to display the name of the student of 4th year in CSE branch whose Roll_No is 1005. 11. Write appropriate programme in PL/SQL for restricting user to enter the data in BOOK table on Sunday and also beyond the working hours (say after 5 PM). 12. Write PL/SQL program to display 5 costliest books in the library. Lecture Plan Unit No.
I
Lect. No.
1 2 3
Lecture Contents
Database System Concept & Architecture. Data Model Schema & Instances. Database System Versus File Processing System. Data Independence Database Language, DDL & DML Statements. E-R Model Concept, Notation for E-R Model. Mapping Constraints & Concepts of Keys. Generalization & Aggregation. Extended E-R Model. DDL & DML Statements Using Constraints. Relational data model concept, Constraints Key. Relational Algebra & calculus, Tuple. Characteristics of SQL & PL/SQL, Types of SQL Commands & Operators, Tables, Views & Indexes Assertions, Cursors Triggers Queries & sub Queries. Joins, Unions, Minus.
Reference
Korth, Silberschatz, Sudarshan, Database Concepts, McGraw Hill
4 5 6 7 8 II 9 10 11 12
13 14 15 16
III
17 18 19 20 21 22 23 24
Functional Dependencies Closure Set, Canonical Form, Key Decomposition, Anomalies & Normalization. Normal Forms based on Functional Dependency Normal Forms based on Functional Dependency Normalization using MVD& JD. Normal Forms based using MVD& JD. Alternative Approaches to Database Design. Transaction System. Testing of Serializability. Serializability of Schedules. Recoverability, Recovery from Transaction Failure. Checkpoints, Log Based Recovery Shadow Paging, ARIES. Distributed Database Multimedia Database, Object-Oriented Database. Concurrency Control Techniques. Locking based Techniques, 2PL, Deadlock Timestamp-Ordering Protocol. Validation Based Protocol. Multiple Granularities. Multi-version Time stamp Ordering Protocol. Recovery with concurrent transaction Introduction to Big Data
IV
25 26 27 28 29 30 31 32
33 34 35 36 37 38 39 40
L:T:P ::3:1:2
Students should be familiar with the basic discipline and the idea behind each of the main programming paradigms. OBJECTIVES The objectives of this course are: To understand and express the essential and interesting features of an application in the complex real world, an object-oriented model is built around. Familiarize with the development artifacts of object oriented systems. Understand the principals of objects encapsulation, inheritance, and polymorphism that form the foundation for object-oriented systems development. Familiarize with object oriented programming environment. The programming language specified is C++ that is one of the standard programming languages used in the industry and also forms the base of all object oriented languages. Introduction to the basic concepts of object oriented modeling. To be familiar with the Unified Modeling Language (UML).It is an objectoriented language for specifying, visualizing, constructing, and documenting the artifacts of software systems, as well as for business modeling.
LEARNING OUTCOME Develop an understanding of Object Oriented Systems. Develop hands on expertise in C++. Unit I Object Modeling: structured approach versus Object Oriented Approach, Objects and classes, links and association, generalization and inheritance, aggregation, abstract class, multiple inheritance, metadata, candidate keys, constraints. (Text Book 2-chpt3, 4, 5, Text Book 1-chpt 1, 2,3) Dynamic Modeling: Events and states, operations, nested state diagrams and concurrency, advanced dynamic modeling concepts, a sample dynamic model. (Text Book 1-CH 5) Unit II Functional Modeling: Data flow diagram, specifying operations, constraints, a sample functional model. OMT (object modeling techniques) methodologies, examples and case studies to demonstrate methodologies, comparison of methodologies: OMT with SA/SD, JSD. (Text Book 1-chpt 6, Text Book 2-chpt 16) Modeling with UML: UML terminology, Introduction of Things, Relationships and Diagrams of UML. (Ref. Book 1 chpt 9)(Text Book 1-chpt 5)
Unit III Introduction: History of C++, Advantage, Need, C++ Program Structure. Classes and objects: Class and Objects Creation, Constructors and Destructors, Access Specifiers, Inline Functions, Default Function Arguments, Static keyword, Function overloading Arrays as Class Member. Arrays of Object. String. The Standard C++ String Class. Operator Overloading: Overloading Unary Operators. Overloading. Binary Operators. (Text Book3 CH-7) Unit -IV Friend Functions, Friend Classes, Pointers and Class Objects: This Pointer, Pointers to objects, Memory Management: New and Delete, Garbage collection Inheritance: Concepts, Access Modifiers, Inheritance Types. Polymorphism Concepts: Virtual methods, Compile time Polymorphism, Run time Polymorphism. (Text book 3, Text Book4) Unit -V Managing Console I/O operations: C++ stream classes, Managing unformatted and formatted Console I/O operations, Managing output with manipulations Streams and File I/O File streams, Streams with file handling, String streams, Built-in streams. Templates and Exceptions: Function Templates, Class Templates, Exceptions, throw () and catch (), The Standard Template Library: Introduction Algorithms, Sequence Containers, Iteators, Specialized Iteators, Associative Containers, Storing User- Defined Object, Function Objects. (Text Book 3, Text Book 4) Text Books: 1. James Rumbaugh etal, Object Oriented Modeling and Design, PHI 2. Ivar Jacobson etal, Object Oriented Software Engineering: A Use Case Driven Approach, Pearson Education 3. E. Balagurusamy, Object Oriented Programming with C++, TMH 4. Robert Lafore, Object Oriented Programming in C++, Techmedia Publication. References: 1. Atul Kahate, Object Oriented Analysis & Design, TMH. 2. Yogesh Singh, Ruchika Malhotra,Object Oriented Software Engineering, PHI. 3. Herbert Sehlidt, The Complete Reference c++, TMH. 4. Schaum's Outline of Programming with C++, TMH.
Web References:
http://nptel.iitm.ac.in/courses/Webcoursecontents/IIScBANG/System%20Analysis%20and%20Design/pdf/PPTs/mod9.p df
Week
Lecture 1
Chapter
Lecture2
Chapter
Lecture 3
Chapter
Week-1
Text Book2 Ch-1,2 Text Book2 Ch-1,2 Text Book 1CH 1,2,3 Text Book 2chpt3, 4 Text Book1CH 5
aggregation, class
abstract
Week-2
multiple inheritance,
metadata, candidate keys, constraints advanced dynamic modelling concepts Specifying operations, constraints, a sample functional model. Examples and case studies to demonstrate methodologi es, comparison of methodologi es: OMT with SA/SD, JSD.
Text Book1CH 5
Week-3
Sample model.
dynamic
Week-4
Week-5
Examples and case studies to demonstrate methodologies , comparison of methodologies : OMT with SA/SD, JSD.
Ref. Book1 CH 9
Case Studies
Week-6
Ch-9 Ref:Book1
Case Studies
Week-7
and
Week-8
Text CH-7
Book4
Class
Inline functions, Static Keyword, Arrays of objects Overloadin g and Friend Keyword
Week-9
Book3
Overloading. Operators
Binary
Book3
Book4
Book4
Week-10
Text CH-9
Book3
Text CH-9.
Book3
Week -11
Inheritance Types.
Text CH-8
Book3
Polymorphism Concepts: Virtual methods, Compile time Polymorphism, Run time Polymorphism . Streams and File I/O File streams, Streams with file handling, String streams, Built-in streams
Week-13
Templates and Exceptions: Function Templates, Class Templates, Exceptions, throw () and catch (), Sequence Containers, Iteators, specialized iteators
Week-14
Lab CS-403P Assignments, Case Studies and Programs on the following are to be done in the lab
Use Case Diagram Sequence Diagram Advanced dynamic modeling concepts State chart Diagram
Creating Classes, Constructors ,Destructors & Access Specifier Inline functions, Static Keyword, Arrays of objects Overloading and Friend Functions Pointers and memory management Inheritance Polymorphism and File Handling Templates and Exception Handling
CS-404:Theory of Computation
Prerequisite: Discrete Structures.
L:T:P ::3:1:2
Objective: Introduce concepts in automata theory and theory of computation, Identify different formal language classes and their relationships, Design grammars and recognizers for different formal languages, Prove or disprove theorems in automata theory using its properties , Determine the decidability and intractability of computational problems. Learning Outcome: On completion of this course, student should be able to1. 2. 3. 4. 5. 6. 7. 8.
Understand formal languages, grammars, automata and their relationships. Able to design Finite Automata (FA) and understand the equivalence of DFA and NFA and Regular Language. Able to construct the equivalent DFA with the minimum number of states. Determine whether a given language is regular (by constructing an automaton or with the pumping lemma). Clean a given grammar and transform a CFG into a normal form. Design PDA for given CFL. Construct a PDA for a given context free grammar, and vice versa. Construct a Turing machine for given language. Understand the concept of Undecidability.
Unit I Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph, Transition table, Language of DFA, Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata, Distinguishing one string from other, Myhill-Nerode Theorem . Unit II Regular expression (RE) , Definition, Operators of regular expression and therr precedence, Algebraic laws for Regular expressions, Kleens Theorem, Regular expression to FA, DFA to Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for regular Languages. Application of Pumping Lemma, Closure properties of Regular Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA. Unit III Chomsky Hierarchy of Grammars: Type0, 1, 2 and 3 Grammars. Context free grammar (CFG) and Context Free Languages (CFL): Definition, Examples, Derivation , Derivation trees, Ambiguity in Grammar, Inherent ambiguity, Ambiguous to Unambiguous CFG, Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure properties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and Membership, Pumping lemma for CFLs,
Unit IV Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA Unit V (8 Hours) Turing machines (TM): Basic model, definition and representation, Instantaneous Description, Language acceptance by TM, TM as Computer of Integer Functions, Variants of Turing Machine, Universal TM, Churchs Thesis, Recursive and Recursively Enumerable Languages, Enumeration Computability : Concepts, Introduction to complexity theory, Introduction Undecidability, Halting Problem, Post Correspondence Problem(PCP), Modified PCP to
Text Books: 1. John E Hopcroft, Rajeev Motwani, Jeffrey D Ullman, Introduction to Automata Theory, Languages and Computation, Pearson Education 2. Peter Linz, An Introduction to formal language and automata, Third edition, Narosa Publication. References: 1. Kamala Krithivasan, Rama R, Introduction to Formal Languages, Automata Theory and Computation, Pearson Education 2. Martin J. C., Introduction to Languages and Theory of Computations, TMH 3. Papadimitrou, C. and Lewis, C.L., Elements of the Theory of Computation, PHI 4. K.L.P. Mishra and N.Chandrasekaran, Theory of Computer Science : Automata, Languages and Computation, PHI 5. Cohen D. I. A., Introduction to Computer theory, John Wiley & Sons 3. John E Hopcroft, Jeffrey D Ullman, Introduction to Automata Theory, Languages and Computation, Narosa Publication. 6. Web References 1. www.nptel.iitm.ac.in/courses/106106049/ 2. http://infolab.stanford.edu/~ullman/ialc.html 3. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-045jautomata-computability-and-complexity-spring-2011/lecture-notes/
Week
Lecture 1
Chapter
Lecture2
Chapter
Lecture 3
Chapter
Lab Meeting
Week-1
Text-2Chapter-1
Deterministic finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph, Transition table,
Text-1Chapter-2
Text1Chapter-2
Lab Experiment-1
Week-2
Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA
Text1Chapter-2
Text-1Chapter-2
of and
Text-1Chapter-2
Lab Experiment-2
Week-3
Reference 6 Chapter-3
Regular expression (RE), Definition, Operators of regular expression and their precedence, Regular Languages, Pumping Lemma for regular Languages. Application of Pumping Lemma,
Text-1chapter-3
Lab Experiment-3
Week-4 Algebraic laws for Regular expressions, Kleens Theorem Week-5 Closure properties Regular Languages,
Text-1chapter-4
Lab Experiment-4
of
of
Text-1chapter 4
Reference 1
Lab Experiment-5
Week-6
Reference-1
Context free grammar (CFG) and Context Free Languages (CFL): Definition, Examples,
Text-2chapter-5
Text-2chapter-5
Lab Experiment-6
Week-7
Ambiguity in Grammar, Inherent ambiguity, Ambiguous to Unambiguous CFG Normal GNF Form-
Text-2cahpter-5
Simplification of CFGs
Text-2chapter-6
Text-2chapter-6
Lab Experiment-7
Week-8
Closure properties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and Membership
Text-2chapter-8
Text-2chapter-8
Lab Experiment-8
Week-9
Push Down Automata (PDA): Description and definition, Acceptance empty stack by
Text-1chapter-6
Instantaneous Description
Text-1chapter-6
Text-1chapter-6
Lab Experiment-9
Week-10
Text-1chapter-6
Deterministic PDA
Text-1chapter-6
Text-1chapter-6
Week-11
PDA to CFG
Text-1chapter-6
Reference 5-chapter21
Turing machines (TM): Basic model, definition and representation, Instantaneous Description,
TM as Computer of Integer Functions
Text-1chapter-8
Week-12
TM as accepter
Text-1chapter-8
Language TM,
acceptance
by
Text-1chapter-8
Text-1chapter-8
Week-13
Text-2chapter-10
Turing
Text-1chapter-9
and
Text-1chapter-9
Week-14
Text-1chapter-9
Halting Problem
Text-1chapter-9
Text-1chapter-9
Lab Experiment14
Lab. CS-404P
NOTE: More programs can be added to the list
1. Write a C program to generate strings up to length 15 with the indivisible symbols like {0,1}, {a, b}, {+,-}. 2. Write a C program which reads a program written in any programming language and then perform lexical analysis. The output of program should contain the tokens i.e. classification as identifier, special symbol, delimiter, operator, keyword or string. It should also display the number of identifiers, special symbol, delimiter, operator, keyword, strings and statements.
3. Write a C program to check whether a given grammar is type-0, type-1, type-2 or type-3. 4. Write a C program to convert NFA to DFA 5. Write a C program to convert NFA with epsilon moves to NFA 6. Write a C program that accepts any Context Free Grammar (use appropriate data structure to store CFG) and then print it in the proper format.
7. Write a program to remove NULL productions from a given CFG 8. Write a program to remove UNIT productions from a given CFG 9. Write a program to remove useless symbols from a given CFG 10. Write a C program to convert CFG to CNF 11. Write a C program to convert CFG to GNF 12. Write a program for recognition of a given string using CKY algorithm. Use a subprogram for generation of string (*) of various length. (Length u to 8 and * of 0,1). 13. Write a C program to convert PDA to CFG 14. Write a C program to convert CFG to PDA