LESSON PLAN. Name: Dr. Gaurav Sharma & Er. Shilpi. Discipline: Computer Science and Engineering. Semester: B.Tech 3 rd

Size: px

Start display at page:

Download "LESSON PLAN. Name: Dr. Gaurav Sharma & Er. Shilpi. Discipline: Computer Science and Engineering. Semester: B.Tech 3 rd"

Loren Kelly
5 years ago
Views:

1 Name: Dr. Gaurav Sharma & Er. Shilpi Discipline: Computer Science and Engineering Semester: B.Tech 3 rd LESSON PLAN Subject: DATA BASE MANAGEMENT SYSTEMS (CSE-205N) Lesson Plan Duration: 15 weeks (from July, 2018 to Dec, 2018) Work Load: Lectures-03 Tute -01 Practical -03 Week Theory Lecture Day Topic 1st 1st Concept & Overview of DBMS 2nd Data Models 3rd Database Languages, Database Administrator 2nd 4th Database Users 5th Three Schema architecture of DBMS 6th Basic concepts, Design Issues, Mapping Constraints of E-R model 3rd 7th Keys, Entity-Relationship Diagram, Weak Entity Sets 8th Extended E-R features 9th Revision of Unit-I 4th 10th Structure of relational Databases 11th Relational Algebra 12th Relational Calculus 5th 13th introduction to Views, updates on views 14th Concept of DDL, DML, DCL 15th Basic Structure, Set operations 6th 16th Aggregate Functions, Null Values, Domain Constraints 17th Referential Integrity Constraints, assertions, views 18th Nested Sub queries 7th 19th Database security application development using SQL 20th Stored procedures and triggers 21st Revision of Unit-II 8th 22nd Functional Dependencies 23rd Different anomalies in designing a Database 24th -do- 9th 25th Normalization using functional dependencies, 26th -do- 27th Decomposition, Boyce-Codd Normal Form, 3NF 10th 28th -do-

2 29th Normalization using multi-valued dependencies, 4NF, 5NF 30th -do- 11 th 31st Physical data structures, Query optimization: join algorithm 32nd statistics and cost base optimization 33rd Overview of Transaction processing, Concurrency control, Recovery Management 12 th 34th Transaction model properties, state serializability, lock base protocols, Two phase locking. 35th Revision of Unit-III 36th Issues and Models for Resilient Operation -Undo/Redo Logging 13 th 37th Protecting against Media Failures 38th Serial and Serializable Schedules 39th Conflict Serializability 14 th 40th Enforcing Serializability by Locks 41st Locking Systems with Several Lock Modes-Concurrency Control by Timestamps, validation. 42nd Serializability and Recoverability-View 15 th 43rd Serializability-Resolving 44th Deadlocks-Distributed Databases: Commit and Lock 45th Revision of Unit-IV Text Books; 1. Ramez Elmasri, Shamkant B. Navathe, Fundamentals of Database systems, Pearson 2. Korth, Silberschatz, Sudarshan: database concepts, MGH, Reference Books: 1. R. Ramakrishnan and J. Gehrks database management system; MGH, International edition, 2. 2 C. J. Date, data base systems: 7th edition, Addison Wesley, Pearson Education 3. Rini Chakrabarti, Advance database management systems, Wiley Dreamtech

3 Practical Week Practical day Topic 1 1 Write the queries for Data Definition Language (DDL) in RDBMS. Write the queries for Data Manipulation Language (DML) in RDBMS 2 2 Write the queries for Data Control Language (DCL) in RDBMS Write SQL queries using logical operations (=,,etc) 3 3 Write SQL queries using SQL operators Using two tables create a view which shall perform equi join and also create various views Using two tables create a view showing non equi join 4 4 Write SQL query using character, number, date and group functions 5 5 Write SQL queries for relational algebra 6 6 Write SQL queries for extracting data from more than one table 7 7 Write SQL queries for sub queries, nested queries 8 8 Write SQL Queries to implement ROLL BACK, COMMIT & CHECK POINTS 9 9 Create VIEWS, CURSORS and TR Write SQL queries for equi-join and different view formation Write SQL queries for non-equi join and view formation High level language extension with Cursors High level language extension with Triggers. To study the concept of Functions

4 12 12 To study the concept of Procedures Create a program to find area of a circle using a procedure and insert the values into a table Revision Revision Viva

5 LESSON PLAN Name: Discipline: Computer Science and Engineering Semester: B.Tech 3 rd Subject: DIGITAL ELECTRONICS LAB (ECE-213N) Lesson Plan Duration: 15 weeks (from July, 2018 to Dec, 2018) Work Load: Practical -03 Practical Week Practical day Topic 1 1 Familiarization with Digital Trainer Kit and associated equipment. 2 2 Study of TTL gates AND, OR, NOT, NAND, NOR, EX-OR, EX-NOR. 3 3 Design and realize a given function using K-Maps and verify its performance. 4 4 To verify the operation of Multiplexer and Demultiplexer. 5 5 To verify the operation of Comparator. 6 6 To verify the truth table of S-R, J-K, T, D Flip-flops. 7 7 To verify the operation of Bi-directional shift register. 8 8 To design and verify the operation of 3-bit asynchronous counter. 9 9 To design and verify the operation of asynchronous Up/down counter using J-K FFs To design and verify the operation of asynchronous Decade counter Study of TTL logic family characteristics.

6 12 12 Study of Encoder and Decoder. Study of BCD to 7 segment Decoder Revision Revision Viva TEXT BOOKS 1. Donald P. Leach and Albert Paul Malvino, Digital Principles and Applications, 8th Edition, TMH, 2003.M. 2. Morris Mano, Digital Design, 3rd Edition, Prentice Hall of India Pvt. Ltd., 2003 / Pearson Education (Singapore) Pvt. Ltd., New Delhi, REFERENCES 1. A.K. Maini, Digital Electronics, Wiley India 2. John F. Wakerly, Digital Design, Fourth Edition, Pearson/PHI, John. M Yarbrough, Digital Logic Applications and Design, Thomson Learning, S. Salivahanan and S. Arivazhagan, Digital Circuits and Design, 3rd Edition., Vikas Publishing House Pvt. Ltd, New Delhi, William H. Gothmann, Digital Electronics, 2nd Edition, PHI, Thomas L. Floyd, Digital Fundamentals, 8th Edition, Pearson Education Inc, New Delhi, Donald D. Givone, Digital Principles and Design, TMH, 2003.

7 LESSON PLAN Name: Discipline: Computer Science and Engineering Semester: B.Tech, 3 rd Semester Subject: DIGITAL ELECTRONICS (ECE-207N) Lesson Plan Duration: 15 weeks (from July, 2018 to Dec, 2018) Work Load: Lectures-03, Tute -01. Week Theory Lecture Day Topic 1st 1 st Minimization Techniques: Boolean postulates and laws 2 nd De-Morgan's Theorem, Principle of Duality, Boolean expression 3 rd Minimization of Boolean expressions, Minterm, Maxterm, Sum of Products (SOP) 2nd 4 th Product of Sums (POS)Binary, octal and hexadecimal arithmetics 5 th Karnaugh map Minimization - Don't care conditions 6 th Quine - McCluskey method of minimization 3rd 7 th Logic Gates: AND, OR, NOT, NAND, NOR, Exclusive-OR and Exclusive-NOR 8 th Implementations of Logic Functions using gates, NAND-NOR 9 th Implementations - Multi level gate implementations- Multi output gate implementations 4th 10 th TTL and CMOS Logic and their characteristics, Tristate gates. 11 th Revision of Unit-I 12 th Design procedure - Half adder, Full Adder 5th 13 th Half subtractor, Full subtractor 14 th Parallel binary adder 15 th Parallel binary Subtractor 6th 16 th Fast Adder, Carry Look Ahead adder 17 th Serial Adder/Subtractor, BCD adder 18 th Binary Multiplier, Binary Divider 7th 19 th Multiplexer/ De-multiplexer 20 th Decoder,Encoder 21 st Parity Checker, Parity Generators 8th 22 nd code converters, Magnitude Comparator 23 rd Revision of Unit-II 24 th Latches, Flip-flops - SR, JK 9th 25 th Flip-flops - D, T, Master-Slave - Characteristic table and equation

8 26 th Application table 27 th Edge triggering, Level Triggering 10th 28 th Asynchronous Ripple or serial counter, Asynchronous Up/Down counter 29 th Synchronous counters, Synchronous Up/Down counters, Programmable counters 30 th Design of Synchronous counters: state diagram, State table, State minimization 11 th 31 st State assignment, Excitation table and maps-circuit implementation 32 nd Modulo-n counter 33 rd 555 Timer 12 th 34 th Registers - shift registers, Universal shift registers, Shift register counters 35 th Ring counter, Shift counters, Sequence generators 36 th Revision of Unit-III 13 th 37 th Classification of memories - ROM: ROM organization, PROM, EPROM, EEPROM, EAPROM 38 th RAM: - RAM organization - Write operation, Read operation, Memory cycle 39 th Timing wave forms, Memory decoding, memory expansion 14 th 40 th Static RAM Cell, Bipolar RAM cell, MOSFET 41 st RAM cell structure, Dynamic RAM cell Structure 42 nd Programmable Logic Devices - Programmable Logic Array (PLA) Programmable Array Logic (PAL) 15 th 43 rd Implementation of PLA, PAL using ROM 44 th Introduction to Field Programmable Gate Arrays (FPGA) 45 th Revision of Unit-IV TEXT BOOKS 1. Donald P. Leach and Albert Paul Malvino, Digital Principles and Applications, 8th Edition, TMH, 2003.M. 2. Morris Mano, Digital Design, 3rd Edition, Prentice Hall of India Pvt. Ltd., 2003 / Pearson Education (Singapore) Pvt. Ltd., New Delhi, REFERENCES 1. A.K. Maini, Digital Electronics, Wiley India 2. John F. Wakerly, Digital Design, Fourth Edition, Pearson/PHI, John. M Yarbrough, Digital Logic. 3. Applications and Design, Thomson Learning, S. Salivahanan and S. Arivazhagan, Digital Circuits and Design, 3rd Edition., Vikas Publishing House Pvt. Ltd. New Delhi, 2006

9 5. William H. Gothmann, Digital Electronics, 2nd Edition, PHI, Thomas L. Floyd, Digital Fundamentals, 8th Edition, Pearson Education Inc, New Delhi, Donald D. Givone, Digital Principles and Design, TMH, 2003.

10 LESSON PLAN Name: Discipline: Computer Science and Engineering Semester: B.Tech 3 rd Semester Subject: DIS (CSE-201N) Lesson Plan Duration: 15 weeks (from July, 2018 to Dec, 2018) Work Load: Lectures-03, Tute -01, Week Theory Lecture Day Topic 1st 1st Set Theory & Logic: Fundamentals - Sets and subsets 2nd Venn Diagrams, Operations on sets 3rd Laws of Set Theory, 2nd 4th Power Sets and Products 5th Partition of sets, The Principle of Inclusion- Exclusion 6th Logic : Propositions and Logical operations, Truth tables 3rd 7th -do- 8th Equivalence, Implications, Laws of Logic 9th Normal forms, Predicates and. 4th 10th quantifiers, Mathematical Induction 11th Revision of Unit-I 12th Relations, diagraphs and lattices: Product sets and partitions 5th 13th relations and diagraphs 14th -do- 15th paths in relations and diagraphs 6th 16th properties of relations 17th equivalence and partially ordered relations 18th -do- 7th 19th computer representation of relations and diagraphs 20th manipulation of relations 21st Transitive closure and Warshall s algorithm 8th 22nd Posets and Hasse Diagrams, Lattice 23rd Revision of Unit-II 24th Functions and Combinatorics: Definitions and types of functions: injective 9th 25th -do- 26th 27th subjective and bijective Composition, identity and inverse

11 10th 28th -do- 29th Review of Permutation and combination-mathematical Induction 30th -do- 11 th 31st Pigeon hole principle 32nd Principle of inclusion and exclusion 33rd Generating function-recurrence relations 12 th 34th -do- 35th Revision of Unit-III 36 th Algebraic structures with one binary operation - semi groups, monoids and groups 13 th 37 th -do- 38th Product and quotient of algebraic structures 39th Isomorphism 14 th 40th homomorphism 41st automorphism 42nd Cyclic groups, Normal sub group 15 th 43rd codes and group codes 44th Ring homomorphism and Isomorphism 45th Revision of Unit-IV Books: Elements of Discrete Mathematics C.L Liu, 1985, Reprinted 2000, McGraw Hill Discrete mathematical structures by B Kolman RC Busby, S Ross PHI Pvt. Ltd. Reference: Discrete Mathematical Structures with Applications to Computer Science, by Tremblay J.P, and Manohar R., McGraw Hill Book Company, 1975, International Edition, Discrete and Combinatorial mathematics ", Ralph P., Grimaldi, Addison- Wesley Publishing Company, Reprinted in Discrete Mathematics and its Applications ", Kenneth H.Rosen, McGraw Hill Book Company,

12 Lesson Plan Name of the Faculty: Nidhi Seth,Meenakshi Discipline: CSE Semester: 3rd Subject: Data Structures, CSE-203N Lession Plan Duration: 15 weeks Work Load (Lecture/Practical) per week (In hours): Lectures-03 Week Theory Practical Lecture Day Topic (Including Assignment/Test) Practical Day Topic Data Types, Built in and User Defined Data Structures, Applications of Write a program for Linear 1 Data Structure serach methods. Algorithm Analysis, Worst, Best Write a program for Binary 1 2 and Average Case Analysis serach methods. 1 Notations of Space and Time 3 Complexity, Arrays, One Dimensional Arrays Comparison Between Linear & Binary search 4 Two Dimensional Arrays and Multi-Dimensional Arrays, Sparse Matrices Write a program for insertion sort. 2 5 Storage 2 Class 3 6 Basics of Recursion, Searching from array using Linear Search Algorithm Write a program for selection sort. 7 Binary Searching Algorithm Write a program bubble sort. 8 Sorting of array using Selection sort 3 Sorting of array using Selection Write a program to implement sort Stack and its operation 9 10 Sorting of array using Insertion sort,selection Sort

13 4 11 Bubble, Radix Sort Algorithm 4 12 Revision of Sorting and Searching. Write a program for quick sort Stacks: Definition, Implement ation of Stacks and Its Operations (Push,Pop) Evaluation of Infix, prefix and Postfix Expression, 5 Interconversion of Infix Expression, Prefix and Post- 15 Fix Expression DO----- Write a program for merge sort Implementatio n of Merge Sort Quick Sort Algorithm 6 Write a program to implement Queue and its operation

14 Revision of Stack and its Application. 19, 7 7 Queues: Definition, Sequential Implementation of Linear Queues and Its 20 Operations Circular Queue and Its 21 Implementation Priority Queues and Its Implementation Applications of queues 8 24 Revision of Queue. Write a program to implement Circular Queue and its operation. Write a program to implement singly linked list for the following operations: Create, Display,. Write a program to implement singly linked list for the following operations: searching, Write a program to implement singly linked list for the following operation:, traversing and deletion Linked Lists: Dynamic Implementations, Need of Dynamic Data Structures, Single Link List and Its Dynamic Implementation 9 Write a program to implement doubly linked list for the following operations: Create, Display. Write a program to implement doubly linked list for the following operations: inserting, counting, search Traversing, Insertion, Operations on Single Link Lists. Deletion Operations on Single Link Lists Comparison between Static and Dynamic Implementation of Linked List. Dynamic Implementation Write a program to implement doubly linked list for the following operations: Deletion, Display

15 of Stacks and Queues. 31 Circular Link Lists and Doubly Link List, Dynamic Implementation of Primitive Operations on Doubly Linked Lists. 11 Dynamic Implementation of Primitive Operations on 33 Circular Link List Trees: Definition, Basic Terminology, Binary Tree, 36 External and Internal Nodes Write a program to implement circular linked list for the following operations: Create, Display, inserting, Write a program to implement circular linked list for the following operations:counting, searching, traversing 37 Static Implementation of a Binary Tree Dynamic Implementation of a Binary Tree, Primitive Operations on Binary Trees Binary Tree Traversals: Per- Order, InOrder 13 Write a program to implement circular linked list for the following operations: traversing and deletion Write a program to implement 40 Binary Tree Traversals: Post- Order Traversals insertion, and traversing in B tree Representation of Infix, Post- Fix and Prefix Expressions using Trees Introduction to Binary Search Trees: B trees, B+ trees, AVL Trees, Threaded Binary trees 43 Balanced Multi-way search trees, Implementation of Heap Sort Algorithm. Graphs: Basic Terminology, Definition of Undirected & Directed Graphs, Memory Representation of Graphs, Graph Traversals Algorithms: Breadth First and Depth First Minimum-Spanning Trees 15 Write a program to implement

16 45 Warshal Algorithm, deletion and traversing in B tree

17 Lesson Plan Name of the Faculty: Discipline: CSE Semester: 3 rd Subject: FOM(HS-201N) Lession Plan Duration: 15 weeks (from July 2018 to Dec, 2018) Work Load (Lecture/Practical) per week (In hours): Lectures-03 Week Theory Practical Lecture Day Topic (Including Assignment/Test) Practical Day Topic Meaning, Definition, nature, importance & 1 Functions of Management 2 Management as Art, Science& Profession 1 1 Business Objectives Management as social System Concepts of management-administration, Development of Management Thought- Scientific management Administrative Theory of Management Bureaucratic Organization Behavioral approach (Neo Classical Theory) 8 9 Human Relations Movement; Behavioral Science approach 3 10 Modern approach to management Systems approach 4 11 Business Environment Modern approach to management contingency approach. Planning: nature, purpose and functions,, planning process 5 14 types of plans 5 15 Strategies and Policies:

18 6 Concept of Corporate Strategy 16 formulation of strategy, Types of strategies Management by objectives (MBO) 19 SWOT analysis 7 7 Types of policies, principles of 20 formulation of policies Organizing: nature, importance, process, organization structure: 21 Line and Staff organization Delegation of Authority and responsibility Centralization and Decentralization Decision Making Process, Decision Making Models Departmentalization: Concept and Types (Project and Matrix) 9 26 formal & informal organizations Staffing: concept, process, features; manpower planning Job Analysis: concept and process Training and development Application /Uses of job Analyses Application /Uses of job Analyses Recruitment and selection: concept, process, sources of recruitment; performance appraisal Directing: Communication- nature, process, formal and informal, barriers to Effective Communication Theories of motivation-maslow, 33 Herzberg, McGregor Leadership concept and theories, Managerial Grid, Situational Leadership. Transactional and 34 Transformational Leadership 11

19 Controlling: concept, process, types, barriers to controlling, controlling Techniques: budgetary control, Return on investment, Controlling: concept, process, types, barriers to controlling, controlling Techniques: budgetary control, Return on investment, Leadership concept and theories, Managerial Grid, Situational Leadership. Transactional and Transformational Leadership Controlling: concept, process, types, barriers to controlling, controlling Techniques: budgetary control, Return on investment, Controlling: concept, process, types, barriers to controlling, controlling Techniques: budgetary control, Return on investment, 40 Stress Management Concept of Corporate Social Responsibility (CSR) and business ethics Functional aspects of business: Conceptual framework of functional areas of management- Finance; Marketing and Human Resources 43 Financial Objectives, Decisions & Sources of Finance Human Resource Development & Functions 15 Marketing Mix & Scope of 45 marketing

20 LESSON PLAN Name: Monika Discipline: Computer Science and Engineering Semester: 3rd Subject: Programming Language Lesson Plan Duration: 15 weeks (from Aug, 2018 to Nov, 2018) Work Load: Lectures-03 Week Lecture Day 1st 2nd 3rd 4th 5th Topic A brief history, Characteristics of a good programming language, Programming language translators compiler & interpreters Elementary data types data objects, variable & constants data types, Specification & Declarations implementation of elementary data types, 6th type checking & type conversions, 7th 8th 9th 10th 11th Assignment & initialization, Numeric data types enumerations, Booleans & characters. Syntax & Semantics: Introduction, general problem of describing syntax, formal method of describing syntax, 12th attribute grammar 13th 14th 15th 16th 17th 18th 19th 20th dynamic semantic Structured data objects & data types specification & implementation of structured data types, Declaration & type checking of data structure,vector & arrays, records,character strings, variable size data structures, Union, pointer & programmer defined data objects, sets, files. Evolution of data type concept abstraction, encapsulation information hiding, Subprograms,type definitions, abstract data types, 21st Implicit & explicit sequence control, 22nd sequence control within statement 23rd Subprogram sequence control: simple call return, 24th 25th 26th 27th Local data & local referencing environment, recursive subprograms, Theory Exception & exception handlers, co routines, sequence control.

21 LESSON PLAN Name: Monika Discipline: Computer Science and Engineering Semester: 3rd Subject: Programming Language Lesson Plan Duration: 15 weeks (from Aug, 2018 to Nov, 2018) Work Load: Lectures-03 Week Lecture Day 28th 29th Theory Topic Concurrency subprogram level concurrency, synchronization through semaphores 30th monitors & message passing 31st 32nd 33rd 34th Names & referencing environment, block structure, Shared data: dynamic & static scope. Parameter & parameter transmission schemes. 35th static & dynamic scope, 36th Major run time elements requiring storage, 37th 38th 39th 40th 41st 42nd 43rd 44th 45th programmer and system controlled storage management & phases Stack based storage management variable & fixed size elements Static storage management Heap storage management Heap storage management Introduction to procedural, non-procedural structured logical, functional

Bachelor of Technology (Computer Science & Engineering) Scheme of Studies/Examination Semester III

S. No. Bachelor of Technology (Computer Science & Engineering) Scheme of Studies/Examination Semester III Course No. Subject L:T:P Hours/Week Examination Schedule (Marks) Duration of Exam (Hrs) Major Test