Program: B.Tech Semester: Fourth Course: Discrete Mathematical Structures Course Code: 3.251 Course Objective: Simplify and evaluate basic logic statements including compound statements, implications, inverses, converses, and contrapositives using truth tables and the properties of logic. Express a logic sentence in terms of predicates, quantifiers, and logical connectives Determine the domain and range of a discrete or non-discrete function, graph functions, identify one-to-one functions, perform the composition of functions, find and/or graph the inverse of a function, and apply the properties of functions to application problems. Describe binary relations between two sets; determine if a binary relation is reflexive, symmetric, or transitive or is an equivalence relation; combine relations using set operations and composition. Unit I: Algebra of Logic and Boolean Algebra: Introduction; Proposition & Statements; Compound statements; Logical operation; Equivalence and Implication; Duality Law; Predicates and Quantifiers. Mathematical Induction. Boolean Algebra: Introduction; Duality Principle; Boolean Function; Application of Boolean Algebra; Logic Gates and Circuits; Boolean Expression. Unit II: Relation and Function: Introduction; Composition and Types of Relation; Closures of Relations, Equivalence Relation; Partial Ordering Relations; Functions Types of Function Mathematical Function, Exponential and Logarithmic Functions. Unit III: Graphs: Introduction to Graphs, Graph Terminology and Representation, Path, Cycle and Connectivity; Sub graphs, Types of graphs, Euler and Hamiltonian Graphs, Shortest Path Problem. Introduction of Tree, Spanning Trees, Minimum Spanning trees. Unit IV: Algebraic Structure: Binary, Properties of Binary Operations; Group; Semigroup and Monoid; Abelian Group; Product of Groups; Subgroup; Permutation Group; Normal Subgroup. Suggested Readings: 1. Discrete Mathematics and its application with Combinatorics and Graph theory By Kennath H. Rosen. 2. Discrete Mathematics By Lieu and Mahapatra 3. Discrete Mathematics with Graph Theory and Combinatorics By T. VeeraRanjan. 4. Discrete Mathematics By Schaum’s series. 5. Discrete Mathematics by Chandrashekhar and Umaparvathi. L T P C 3 0 0 3
15
Embed
Program: B.Tech Fourth L T P C Discrete Mathematical ... · Program: B.Tech Semester: Fourth L Course: Discrete Mathematical Structures Course Code: 3.251 Course Objective: Simplify
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Simplify and evaluate basic logic statements including compound statements, implications, inverses, converses, and contrapositives using truth tables and the properties of logic.
Express a logic sentence in terms of predicates, quantifiers, and logical connectives
Determine the domain and range of a discrete or non-discrete function, graph functions, identify one-to-one functions, perform the composition of functions, find and/or graph the inverse of a function, and apply the properties of functions to application problems.
Describe binary relations between two sets; determine if a binary relation is reflexive, symmetric, or transitive or is an equivalence relation; combine relations using set operations and composition.
Unit I: Algebra of Logic and Boolean Algebra: Introduction; Proposition & Statements; Compound
statements; Logical operation; Equivalence and Implication; Duality Law; Predicates and Quantifiers.
Application of Boolean Algebra; Logic Gates and Circuits; Boolean Expression.
Unit II: Relation and Function: Introduction; Composition and Types of Relation; Closures of Relations, Equivalence Relation; Partial Ordering Relations; Functions Types of Function Mathematical Function, Exponential and Logarithmic Functions.
Unit III: Graphs: Introduction to Graphs, Graph Terminology and Representation, Path, Cycle and Connectivity; Sub graphs, Types of graphs, Euler and Hamiltonian Graphs, Shortest Path Problem. Introduction of Tree, Spanning Trees, Minimum Spanning trees.
Unit IV: Algebraic Structure: Binary, Properties of Binary Operations; Group; Semigroup and Monoid;
Abelian Group; Product of Groups; Subgroup; Permutation Group; Normal Subgroup.
Suggested Readings:
1. Discrete Mathematics and its application with Combinatorics and Graph theory By Kennath H. Rosen.
2. Discrete Mathematics By Lieu and Mahapatra 3. Discrete Mathematics with Graph Theory and Combinatorics By T. VeeraRanjan. 4. Discrete Mathematics By Schaum’s series. 5. Discrete Mathematics by Chandrashekhar and Umaparvathi.
To have a thorough understanding of the basic structure and operation of a digital computer.
To discuss in detail the operation of the arithmetic unit including the algorithms &implementation of fixed-point and floating-point addition, subtraction, multiplication &division.
To study in detail the different types of control and the concept of pipelining.
To study the hierarchical memory system including cache memories and virtual memory.
Unit I: Design Methodology: System Design System Representation, Design Process, the Gate level. The
The Processor Level Processor- level Components, Processor-level Design.
Unit II: Processor Basics: CPU Organization Fundamentals, Additional Floating-Point Numbers Data Representation Basic Format, Fixed-Point Numbers, Floating-Point Numbers Instruction Sets Instruction Formats and Types . Datapath Design: Fixed-Point Arithmetic Addition, Subtraction, Multiplication and Division Arithmetic Logic Units Combinational ALUs, Sequential ALUs.
Unit III: Control Design: Basic Concepts Introduction, Hardwired Control Micro programmed Basic Concepts, Multiplier Control Unit Control Pipeline Control Instruction Pipeline, Arithmetic Pipeline .Memory Organization: Memory Technology Memory Device Characteristics, Random Access Memories, Serial Access Memories Memory Systems Multilevel Memories, Address Translation, Memory Allocation Cache Main Features, Address Mapping.
Unit IV: System Organization: Communication Methods Basic concepts Bus Control System ControlDMA
and Interrupts. Advanced Topics: Pipeline Processing, Parallel Processing.
Suggested Readings:
1. Hayes, J.P., “Computer Architecture and Organization”, 3rd McGraw-Hill, London,2000
2. Mano, M.M., “Computer System Architecture” , Prentice Hall of India, New Delhi, 1995
3. Heuring V.P., et. al., “ Computer System Design and Architecture”, Addision WesleyIndian
Cover issues related to the definition, creation and usage of classes, objects and methods.
Discuss the principles of inheritance and polymorphism and demonstrate though problem analysis assignments how they relate to the design of methods, abstract classes and interfaces.
Provide the foundation of good programming skills by discussing keys issues to the design of object-oriented software, including programming design patterns, automatic documentation techniques and programming testing.
Cover the basics of creating APIs as well as allow students to explore the Java Abstract Programming Interface (API) and Java Collection Framework through programming assignments.
Unit I: Introduction: Introduction to OOP, Objects and classes, Characteristics of OOP, Difference between
OOP and Procedure oriented programming. Introduction to Java Programming, Features of Java, Applications and Applets, JDK, Source File Structure.
Unit II: Java language fundamentals: Building blocks of Java, Data Types, Variable declaration, Wrapper
classes, Operators and Assignment, Control Structures, Arrays, Strings, String Buffer class.
Unit III: Java as an OOP Language : Defining classes, Modifiers, Packages, Interfaces, Exception
Handling, Exception hierarchy, Constructors and methods of Throw able class, Unchecked and
Checked Exceptions, Handling Exceptions in Java, Exception and Inheritance, Throwing user
defined exceptions, Redirecting and re-throwing exceptions. Unit IV: Multithreading : Overview of threading, Creating threads, Thread Life-cycle, Thread priorities and
Thread scheduling, Thread synchronization, Daemon Threads, Thread groups, Communication of
Threads
Applets,Java Applications versus Java Application, Applet Life cycle, working with Applets, The
HTML APPLET Tag, java. Applet package AWT, Basic classes in AWT, Drawing with Graphics
Class, Class hierarchy of AWT.
Suggested Readings:
1. Krishna P. R., Object Oriented Programming through JAVA, 1st Edition, Universities Press, 2008
2. C. Horstmann,G. Cornell - Core Java 2 Vol I & Vol II ; Pearson Education , New Delhi. 3. Balagurusamy -Programming in Java, 2nd Edition; Tata McGraw Hill Publication; New Delhi.
Unit IV: Relational Database Design: Atomic domains & first normal form, Decomposition using
functional dependencies, Functional dependency theory, Decomposition using functional dependencies, Decomposition using multi valued dependencies, more normal forms. Query
Processing: Measure of Query Cost, Selection Operation, Evaluation of Expressions.
Understand, analyze and apply common SQL statements including DDL, DML and DCL statements to perform different operations.
Design different views of tables for different users and to apply embedded and nested queries.
Design and implement a database for a given problem according to well known design principles that balance data retrieval performance with data consistency.
Creating a Table
CREATE TABLE <tableName> (<list of attributes and their types>);
Creating a Table with a Primary Key
CREATE TABLE <tableName> (<attribute_name><type> PRIMARY KEY,); CREATE TABLE <tableName> (<attrs and their types>, PRIMARY KEY (<attribute1>, <attribute2>));
Inserting Tuples
INSERT INTO <tableName> VALUES (<list of values for attributes, in order>);
Deleting Tuples
DELETE FROM <tableName> [where <condition>];
Updating Column values
UPDATE <tableName> SET <columnName = value>;
Getting the Value of a Relation
SELECT * FROM <tableName>; SELECT Column1, column2, … from <tableName>;
Modifying the structure of Tables
Adding New Columns: ALTER TABLE <tableName> ADD(<newColumnName><dataType(size)>, …); Modifying Existing Columns: ALTER TABLE <tableName> MODIFY(<ColumnName><newDataType(newSize)>, …);
L T P C
0 0 2 1
Restrictions:
Changing the name of table
Changing the name of the column
Decreasing the size of a column
Getting Rid of Your Tables and attributes
DROP TABLE <tableName>; ALTER TABLE <table name> DROP (<attribute>)
Getting Information about Your Database
SELECT TABLE_NAME FROM USER_TABLES; To recall the attributes of a table DESCRIBE <tableName>;
Quitting sqlplus
quit; Creating, Updating and Querying the Tables. Create the students table: students hostel INTEGER, cpi NUMERIC(3,2) ); Run the following queries : SQL> SELECT * FROM students; SQL> SELECT rollno FROM students; SQL> SELECT rollno, name FROM students WHERE cgpa > 9.00; Updates/deletes: SQL> UPDATE students SET cgpa = 9.46 WHERE rollno = '99305018'; SQL> DELETE students WHERE rollno = '99305018'; Runnings batch of queries : - Use Note Pad to create a file having extension as .sql. - Write queries in the file. Queries should end with a semicolon - Execute
RollNo Name HostelNoSize cgpa
‘99305017’ ‘Sai Sundar’ 11 7.23
‘99305018 ‘Shyam Sundar’ 11 9.23
‘99305019’ ‘Ram Sundar’ 12 8.32
SQL> start <filename> Multitable queries: CREATE TABLE course ( courseno CHARACTER(8), coursename VARCHAR(30)); CREATE TABLE registered ( rollno CHARACTER(8), courseno CHARACTER(8)); To add fields interactively ... insert appropriate data into each table [Use: insert into course values (‘&courseno’, ‘&coursename’);] Query to find all course numbers with students from Hostel 11 SELECT courseno FROM students, registered WHERE students.rollno = registered.rollno AND students.hostel = 11 (Course numbers may appear multiple times: use SELECT DISTINCT instead of SELECT to get them only once.) Try some more queries: -- course numbers with some students with cgpa < 6 -- rollnumbers of all students registered for course CS317
Program: B.Tech Semester: Fourth Course: Operating System Course Code: 3.256
Course Objective:
Describe how computing resources (such as CPU and memory) are managed by the operating system, describe the basic principles used in the design of modern operating systems.
Compare and contrast the common algorithms used for both pre-emptive and non-pre-emptive
scheduling of tasks in operating systems, such a priority, performance comparison, and fair-share
schemes. Contrast kernel and user mode in an operating system
Evaluate and report appropriate design choices when solving real-world problems
Analyze the key trade-offs between multiple approaches to operating system design.
Unit I: Introduction to Operating System: Computer System Overview - Basic Elements, Instruction
Execution, Interrupts, Memory Hierarchy, Cache Memory, Direct Memory Access, Multiprocessor.
Operating system overview - objectives and functions, Evolution of Operating System Process:
Introduction, Process States and life Cycle, Process Control Block. Process Relationship:
Competition, Cooperation, Processes vs. Threads, Types of Threads.
Unit II: Scheduling: Introduction, Scheduler: Long Term, Mid Term and Short Term, Scheduling Algorithm:
FCFS, SRTN, RR, ED and MLQ.
Process Synchronization: Need, Critical Section (CS) Problem – General Structure of a typical
Process, Solution to CS Problem, Mutual Exclusion, Semaphores, Monitors, Readers/Writers
problem.
Unit III: Deadlocks: Prevention, Avoidance, Detection & Recovery.
1. WAP in C to display your name five times by using for loop.
2. WAP in C to display your name five times by using do while loop.
3. WAP in C to display your name five times by using while loop.
4. WAP in C to take two integer from user and swap their values without taking third variable.
5. WAP in C to produce Fibonacci series up to n numbers.
6. WAP in C to simulate the CPU scheduling algorithm: FCFS.
7. WAP in C to simulate the CPU scheduling algorithm: SJF.
8. WAP in C to simulate the CPU scheduling algorithm: RR.
9. WAP in C to simulate the CPU scheduling algorithm: Priority Based.
10. WAP to accept n-number of process id with their respective priority. Order the process according
to their decreasing priority and display the same.
Other: Installation of Operating System
L T P C
0 0 2 1
Program: B.Tech Semester: Fourth Course: Digital Electronics Course Code: 6.255
Course Objective:
Describe how computing resources (such as CPU and memory) are managed by the operating system, describe the basic principles used in the design of modern operating systems.
Compare and contrast the common algorithms used for both pre-emptive and non-pre-emptive
scheduling of tasks in operating systems, such a priority, performance comparison, and fair-share
schemes. Contrast kernel and user mode in an operating system
Evaluate and report appropriate design choices when solving real-world problems
Analyze the key trade-offs between multiple approaches to operating system design.
Unit I: Number Systems and Codes: Introduction, Decimal Number Systems, Binary Number Systems,
Signed Binary Numbers, Double precision numbers, Floating Point Numbers, Octal Number
Systems, Hexadecimal Number Systems, Other Number Systems, Binary Codes for the Decimal
Meaning, Importance, Relation between Stress and Performance, Managing Stress {Elimination of Stressors, Development of Resiliency, Coping Mechanism},Strategy{Delegation of work and Team work} Stage Fear / Overcoming fear and Shame
Unit IV: Negotiation Skills
Effective Verbal Communication , Listening & Speaking , Rapport building , Problem solving Decision
Making , Dealing with Difficult situation
Suggested Readings:
1. R.M.Onkar.Managing Career by Discovering Your Personality:A Pragmatic Perspective of soft
Skills;S.Chand Publishing
2. S.S.Khanka. Organisational Behaviour{Text and cases};S.Chand Publishing
L T P C
2 0 0 2
Program: B.Tech Semester: Fourth Course: Life skills II Course Code: 40B.151
Course Objective: To impart basic skills of Professional Communication in English through intensive
practice to the Students, so as to enable them to function confidently & effectively in that Language in the Professional Sphere of their life. The student must have some basic command of English so that the Student must be able to:
At the end of the course the student should become a good communicator not only in the organization but in day today life also. Should know and learn the dynamics of external and internal communication.
Use some 2000 (at least 1500) general-purpose words of English to express himself/herself in writing & 1500 such words to talk about day-to-day events & experiences of life.
Understand slowly-delivered spoken material in Standard Indian English, and
Speak reasonably clearly (if not fluently) on routine matters with his fellow Students, with proper word stress, intonation pattern, accent and perfect articulation.
Should have command over the language. WRITING SKILLS Unit I: Letter Writing
Business/official Letters
Letter Writing Skills
Planning of the Letter
Letter Writing Process
Form & Structure
Essentials of Letter Writing
Types of Professional Letters: letter of enquiry, letter of placing order, information seeking
letter, letter of claim & complaint, information giving letter, letter of acceptance, letter of
rejection
UNIT II: Professional Writing
Job Application, introduction, layout & format (specimen)
D O letter
Resume & Job Application
Covering Letter
Editorial Letter
Writing Mails & SMS (E-Language)
Notice, Memo, Circular & Minutes Writing.
Social Letters (letters to friends/relatives etc.)
Monippally, Matthukutty. M. 2001. Business Communication Strategies. 11th Reprint. Tata
McGraw-Hill. New Delhi
Swets, Paul. W. 1983. The Art of Talking So That People Will Listen: Getting Through to Family, Friends and Business Associates. Prentice Hall Press. New York
Lewis, Norman. 1991. Word Power Made Easy. Pocket Books
Sen , Leena .Communication Skills ; Eastern Economy Edition
Ghanekar , Dr. Anjali . Essentials of Business Communication Skills ; Everest Publishing House
David Green . Contemporary English Grammar, Structure & Composition ; MacMillan