course structure - gmrit.org

Department of Information Technology

B.Tech (IT)

COURSE STRUCTURE (Applicable for 2012 and 2013 admitted batches)

B.Tech: 3rd Semester

Code Course Theory Practical Credits

HS 2404 Managerial Economics and Financial Analysis

3+1* - 4

IT 2401 Data Structures 3+1* - 4

ECE 2406 Digital Logic Design 3+1* - 4

CSE 2404 Discrete Structures and Graph Theory

3+1* - 4

IT 2402 Object Oriented Programming through JAVA

3+1* - 4

IT 2203 Data Structures Lab - 3 2

IT 2204 Object Oriented Programming through JAVA Lab

- 3 2

Total 20 6 24

B.Tech 4th Semester

Code Course Theory Practical Credits MATH 2405

Probability and Statistics 3+1* - 4

CSE 2403 Computer Organization 3+1* - 4

IT 2405 Database Management Systems 3+1* - 4

IT 2406 Design Analysis and Algorithms 3+1* - 4

CSE 2407 Operating Systems 3+1* - 4

IT 2207 Database Management Systems Lab - 3 2

IT 2208 Design and Analysis of Algorithms Lab - 3 2 Total 20 6 24

*Tutorial


B.Tech (IT) - 3rdSemester

SYLLABUS MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS

(Applicable for 2012 and 2013 admitted batches) B.Tech (IT)- 3rd Semester Course code: HS 2404

L T P C 3 1 0 4

OBJECTIVES:

• To familiarize the responsibilities that managerial economist should possess.

• To understand the concept of demand, elasticity of demand and demand forecasting.

• To familiarize the basic concepts in production theory and cost-output relationship.

• To understand different methods of pricing and factors affecting pricing policy. • To understand critical evaluation of each of the forms of business organization

• To know the various methods available for evaluating investment proposals

• To analyze the vital role of national income in the economic theory

• To identify the objectives of preparing final accounts and list the various statements which comprise final

accounts of business entity

• To appreciate the utility of ratio analysis as a tool for financial analysis

• To identify transactions which involve changes in funds and explain the purpose and utility of funds flow

statement

OUTCOMES:

At the end of the course the learners will be able to

• Explain the application of Managerial Economics in various aspects of decision making.

• List determinant factors of Elasticity of Demand and carry out Demand Forecasting.

• Discuss the production functions and outline concepts of cost functions.

• Outline classification of markets and Contrast price determination in various market situations.

• Understand the things that are important to them in order to start the business organization.

• Understand the key elements of the capital budgeting and evaluating investment proposals.

• List the basic requirements and formats of financial statements.

• Appreciate analysis and interpretation of Financial Statement through ratios.

UNIT – I: 14 Hrs

Introduction to Managerial Economics & Demand Analysis:

Definition of Managerial Economics, Characteristics and Scope – Managerial Economics and its relation

with other subjects- Basic economic tools in Managerial Economics –Role and Responsibilities of

Managerial Economist.

Demand Analysis: Meaning- Demand distinctions- Demand determinants- Law of Demand and its

exceptions.

Elasticity of Demand & Demand Forecasting:

Definition -Types of Elasticity of demand - Measurement of price elasticity of demand: Total outlay

method, Point method and Arc method- Significance of Elasticity of Demand.

Demand Forecasting: Meaning - Factors governing demand forecasting - Methods of demand forecasting

(survey of buyers’ Intentions, Delphi method, Collective opinion, Analysis of Time series and Trend

projections, Economic Indicators, Controlled experiments and Judgmental approach).

UNIT – II: 16 Hrs

Theory of Production, Cost Analysis, Market Structures & Pricing Policies:

Production Function- Isoquants and Isocosts, MRTS, Law of variable proportions- Law of returns to scale-

Least Cost Combination of Inputs, Cobb-Douglas Production function - Economies and Diseconomies of

Scale.

Cost Analysis: Cost concepts, Opportunity cost, Fixed Vs Variable costs, Explicit costs Vs. Implicit costs,

Out of pocket costs vs. Imputed costs.-Determination of Break-Even Point (simple problems) - Managerial

Significance and limitations of BEP.

Market Structures and Pricing Policies:

Market structures: Types of different competitive situations - Price-Output determination in perfect

competition, Monopoly, Monopolistic competition and Oligopoly both the long run and short run.

Pricing Policies: Methods of Pricing: Marginal Cost Pricing, Limit Pricing, Market Skimming Pricing,

Penetration Pricing, Bundling Pricing, and Peak Load Pricing.

UNIT – III: 13 Hrs

Types of Business Organizations & Capital Management:

Types of business organizations: Features and evaluation of Sole Proprietorship, Partnership, Joint Stock

Company, State/Public Enterprises and their types.

Introduction to business cycles: National income - concept and measurement- Meaning of Inflation –

Phases and Features of business cycles.

Capital Management and Investment Decisions:

Significance of Capital – Capital Management – Working Capital – Need for capital budgeting – Capital

budgeting decisions - Methods of Capital Budgeting: Payback Method, Accounting Rate of Return (ARR),

Internal Rate of Return (IRR) and Net Present Value Method (simple problems)

UNIT – IV: 17 Hrs

Introduction to Financial Accounting & Analysis of Financial Statements:

Introduction to Double-entry system, Journal, Ledger, Trial-Balance, Final Accounts (with simple

adjustments) - Limitations of Financial Statements.

Interpretation and analysis of Financial Statements:

Ratio Analysis – Liquidity ratios, Profitability ratios and solvency ratios – Preparation of changes in working

capital statement and fund flow statement (with simple problems).

Text Books:

1. N. Appa Rao. & P. Vijaya Kumar: Managerial Economics and Financial Analysis, Cengage

Publications, New Delhi, 2011.

2. A. R. Aryasri - Managerial Economics and Financial Analysis, TMH 2011.

3. J.V.Prabhakar Rao: Managerial Economics and Financial Analysis, Maruthi Publications, 2011.

References:

1. R.L.Varshney, K.L.Maheswari – Managerial Economics, Sultan Chand & Sons, New Delhi.

2. Suma damodaran- Managerial Economics, Oxford 2011

3. S.A. Siddiqui & A.S. Siddiqui, Managerial Economics and Financial Analysis, New Age

International Publishers, 2011.

4. S.N. Maheswari, S.K.Maheswari – Financial Accounting, Vikas Publishing House.

5. M. Pandey – Financial Management, Vikas Publishing House



SYLLABUS (Applicable for 2012 and 2013 admitted batches)

Course Title: DATA STRUCTURES Course Code: IT 2401

L T P C 3 1 0 4

Course Objectives: The course content enables students to: • Understand various data structures and their importance in algorithm design.

• Implement the linear data structures stack and queue using array. • Implement various forms of linked-lists. • Implement various Hashing techniques using appropriate data structures. • Demonstrate different Binary Tree Traversals. • Demonstrate Binary Search Tree operations. • Understand the advantages of height balanced trees. • Implement graphs using either adjacency matrix or adjacency list. Course Outcomes: At the end of the course students are able to: • Create and manage data structures for developing real world applications. • Use algorithms and data structures in well-written modular code in an adequate and optimal way. • Apply the data structure array for various list processing operations such as searching and sorting. • Decide to use array or linked-list for solving a given problem. • Differentiate between linear and non-linear data structures. • Use appropriate Data Structure for implementation of various algorithms in subsequent course of the

study. UNIT – I 16 Hrs Data Structures and their importance in algorithm design: linear and non-linear data structures Searching: Linear search and Binary Search Sorting: Selection sort, bubble sort, insertion sort Stacks: Basic operations, Implementation using array, Applications – Recursion, Infix to postfix conversion Queues: Basic operations, Linear queue, Circular Queue, implementation using array UNIT – II 14Hrs Linked Lists: Basic operations, singly linked lists, doubly and circular linked lists Hashing: Hashing Functions, Open hashing (chaining), closed hashing (open addressing – linear probing, quadratic probing, double hashing), rehashing UNIT-III 16Hrs Trees: Binary Trees, Terminology, Representation of Binary Trees using arrays and linked lists, Binary tree traversals, Creation of binary tree from in-order, pre-order and post-order traversals Binary Search Trees: Searching, Insertion and deletion in BST Heaps: Max-heap/ Min-heap, insertions and deletions, Heap sort

UNIT-IV 14Hrs Balanced Trees: AVL trees, Height of AVL Tree, Balancing AVL tree by rotations, insertions and deletions B-Trees: B-Tree of order M, insertions and deletions Graphs: Graph Traversals (BFS & DFS) Text Books:

1. Fundamentals of Data Structures in C, Horowitz, Sahni and Anderson Freed , 2nd edition , Universities Press

2. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, Pearson Education Reference Books:

1. Data Structures using C, A.S.Tanenbaum, Y. Langsam and M.J. Augenstein, Pearson Education 2. Data Structures with C, Seymour Lipschutz, McGraw Hill 3. Classic Data Structures, Debasis Samanta, 2nd Edition, PHI




Course Title: DIGITAL LOGIC DESIGN Course Code: ECE 2406

L T P C 3 1 0 4 Course objectives: Students undergoing this course are expected to: • Understand the different number system, its conversions and binary arithmetic. • Know the fundamentals of Boolean algebra and theorems, Karnaugh maps including the minimization

of logic functions to SOP or POS form. • Analysis of logic circuits and optimization techniques to minimize gate count, signals, IC count, or time

delay. • Strengthen the principles of logic design and use of simple memory devices, flip-flops, and sequential

circuits. • Fortify the documentation standards for logic designs, standard sequential devices, including counters

and registers. • Understand the logic design of programmable devices, including PLDs • Understand RAMS, and ROMS including its sequencing and control Course outcomes: After undergoing the course students will be able to: • Differentiate between analog and digital representations. • Convert a number from one number system to its equivalent in of the other Number system. • Understand the difference between BCD and straight binary. • Implement logic circuits using basic AND, OR and NOT gates. • Use De-Morgan’s theorem to simplify logic expressions. • Describe the concept of active LOW and active HIGH logic signals. • Use Boolean algebra and K-map as tool to simplify and design logic circuits. • Design simple logic circuits without the help of truth tables. • Construct and analyze the operation of flip-flop and troubleshoot various types of flip-flop circuits. • Understand the internal logic diagrams of Integrated circuits • Design various types of sequential circuits like counters, state machines etc

UNIT- I 15Hrs Number Systems and Boolean Algebra: Review of number systems, conversion of numbers from one radix to another radix, complement representation of negative numbers-binary arithmetic, 4-bit codes: BCD, Excess-3, Floating point representation(IEEE 754 Standard), Fixed point representation, Basic logic operations. Basic theorems and properties of Boolean Algebra, switching functions, Canonical and Standard forms-Algebraic simplification digital logic gates, universal gates and Multilevel NAND/NOR realizations, Generation of self dual functions. Gray code, error detection and error correction codes, parity checking even parity, odd parity, Hamming code

UNIT- II 15Hrs Boolean Function Minimization and Combinational Logic Circuits: Minimization of switching functions using K-Map up to 6-variables, Tabular minimization, minimal SOP and POS Realization, Problem solving using K-map such as code converters binary Multiplier. Half adder, Full adder, full subtractor, Ripple carry adder, Carry look ahead adder, Multiplexer, De-Multiplexer, Encoder, Priority encoder, Decoder, MUX Realization of switching functions Parity bit generator. UNIT- III 15Hrs PLDs and Sequential Circuits – I: Basic PLD’s-ROM, PROM, PLA, PAL, Realization of Switching functions using PLD’s, comparison of PROM, PLA, and PAL, Classification of sequential circuits (synchronous and asynchronous): basic flip-flops, truth tables and excitation tables (NAND RS latch, NOR RS latch, RS flip-flop, JK flip-flop, T flip-flop, D flip-flop with reset and clear terminals), Conversion of flip-flops. UNIT- IV 15Hrs Sequential Circuits – II And SM Charts: Design of registers, Buffer register, Control buffer register, Shift register, Bi-directional shift register, Universal shift register, Design of Asynchronous & Synchronous counters - Up, Down, Up down, Johnson counters, Ring counters, Finite state machine-capabilities and limitations, Mealy and Moore state machines, Mealy to Moore conversion and vice-versa, Derivation of the SM chart, Reduction of state tables and state assignment, Realization of SM Chart.

Text Books: 1. Digital Design – Morris Mano, 3rd Edition, PHI. 2. Fundamentals of Digital Logic with Verilog Design – Stephen Brown, Zvonko Vranesic, TMH. 3. Fundamentals of Logic Design – Charles H. Roth, 3rd Edition Thomson Publications. 4. Digital Design Principles & Practices – John F. Wakerly, 3rd Edition, PHI/ Pearson Education Asia

Reference Books: 1. Switching & Finite Automata theory – Zvi Kohavi, 2nd Edition TMH. 2. Modern Digital Electronics by RP Jain, TMH.




Course Title: DISCRETE STRUCTURES AND GRAPH THEORY Course Code: CSE 2404

L T P C 3 1 0 4

Course Objectives: The course content enables students to:

• Comprehend the structure of statements (and arguments) involving predicates and quantifiers. Students can able to apply logic on statements.

• Understand the applications of graph theory to various practical problems.

• Understand the basic properties of sets and relations. • Understand proofs of various properties in group theory.

• Know the concept of permutations and combinations. • Know how to solve a recursive problem.

Course Outcomes: At the end of the course students will be able to:

• Apply the concept of logical equivalence and its relationship to logic circuits and Boolean functions. • Use Concepts of graph theory to provide solutions for routing applications in computer networks. • Use concepts of functions for data retrieval in database applications.

• Apply concepts of counting and probability in data mining. • Apply the recurrence relation for analyzing recursive algorithms.

UNIT – I 16 Hrs Mathematical Logic: Statements and notations, Connectives, Well-formed formulas, Truth Tables, Tautology, Two-state Device and Statement logic, Equivalence implication, Normal forms. Predicates: Predicate logic, Free & Bound variables, Rules of inference, Consistency, Proof by contradiction. UNIT – II 14 Hrs Graph Theory: Representation of Graph, DFS, BFS, Planar Graphs, Chromatic Number, Graph Theory and Applications, Basic Concepts of Isomorphism and Sub graphs, Euler circuits, Hamiltonian graphs, Spanning Trees, Minimal spanning tree, UNIT-III 14 Hrs Set Theory: Basic concepts of set theory, Properties of binary Relations, Equivalence, Compatibility and partial ordering relations, Hasse diagram. Functions: Inverse Function, Composition of functions, Recursive Functions, Lattice and its Properties. Algebraic structures: Algebraic systems Examples and general properties, Semi groups and Monoids, Groups, Sub group

UNIT-IV 16 Hrs Elementary Combinatorics: Basis of counting, Permutations & Combinations with repetitions, Constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, the principles of Inclusion–Exclusion, Pigeon hole principle and its application. Recurrence Relation: Generating Functions, Function of Sequences, Calculating Coefficient of generating function, Recurrence relations, Solving recurrence relation by substitution and Generating functions. Text Books: 1. Discrete Mathematical Structures with applications to computer science Tremblay J.P. & P.Manohar, TMH 2. Discrete Mathematics for Computer Scientists & Mathematicians, J.L. Mott, A. Kandel, T.P. Baker, Prentice Hall. Reference Books: 1. Discrete Mathematics with Applications, Thomas Koshy, Elsevier 2. Discrete Mathematical structures Theory and application-Malik & Sen 3. Graph theory with applications to engineering and computer science, by Narsingh Deo –PHI 4. Elements of Discrete Mathematics - A Computer Oriented Approach, C. L. Liu, D. P. Mohapatra , 3rd Edition , TMH.


B.Tech (IT)- 3rd Semester


Course Title: OBJECT ORIENTED PROGRAMMING THROUGH J AVA Course Code: IT 2402 L T P C 3 1 0 4 Course Objectives: The course content enables students to:

• Understand fundamentals of object-oriented concepts through Java. • Understand how java achieves platform independence using concept of bytecode. • Extend existing code and develop new application to demonstrate code reusability • Keep the related class of code together to create a package and import the same for future application

development. • Implement multiple inheritances using interface concept. • Explore concepts of concurrent programming by using multi threading. • Handle runtime errors through exception handling mechanism. • Provide graphical user interface for their application programs. • Write applications that handle user interactions through various peripheral devices.


• Know the concepts of classes, objects, members of a class and the relationships among them • Implement Applications using Packages • Handle runtime errors using Exceptions handling mechanism. • Develop application for concurrent processing using Thread concepts • Design interactive applications for use on internet. • Design applets that take user response through various peripheral devices such as mouse and

keyboard by event handling mechanism

UNIT- I 14Hrs Introduction to Java: Overview of Object Oriented Programming principles, Importance of Java to the Internet, Bytecode, Methods, classes and instances. Data types, arrays, control statements, simple java program. Classes and Objects – constructors, methods, access control, this keyword, overloading methods and constructors, garbage collection. UNIT-II 14Hrs Inheritance: Hierarchical abstractions, Base class and subclass, subtype, substitutability, forms of inheritance-specialization, specification, construction, extension, limitation, combination. Benefits of inheritance, super keyword, final keyword with inheritance, polymorphism, abstract classes. Packages: Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages, Member access rules. Interface: Defining an interface, differences between classes and interfaces, implementing interface, variables in interface and extending interfaces.

UNIT- III 16Hrs Exception handling: Concepts and benefits of exception handling, exception hierarchy, usage of try, catch, throw, throws and finally, built-in and User Defined Exceptions, Multithreading: Definition thread, thread life cycle, creating threads, synchronizing threads, daemon threads. UNIT IV 16 Hrs Applets: Concepts of Applets, differences between applets and applications, life cycle of an applet, types of applets, creating applets, passing parameters to applets, The AWT class hierarchy, user interface components- labels, button, Text components. Event Handling: Events, Delegation event model, handling mouse and keyboard events, Adapter classes, inner classes. Compare basic AWT components with swing components. More user interface components - canvas, scrollbars, check box, choices, lists panels – scrollpane, dialogs, menubar, layout manager types. Text Books:

1. Java: The complete reference, Herbert schildt, 7th Edition, TMH. 2. An Introduction to Object-Oriented Programming by Timothy A Budd, 3rd Edition ,Addison Wesley

Longman Reference Books:

1. Java: How to Program, Dietal & Dietal, 8th Edition, PHI 2. Programming with Java A Primer, E.Balaguruswamy Tata McGraw Hill Companies 3. Core Java 2, Vol 1, Fundamentals by Cay. S.Horstmann and Gary Cornell, 7th Edition, Pearson

Education. 4. BIG JAVA Compatible with Java 5 & 6, Cay Horstmann , 3rd Edition , Wiley Publishers.




Course Title: DATA STRUCTURES LAB Course Code: IT 2203

L T P C 0 0 3 2

Implement the following experiments:

1. Write programs to perform Linear search and Binary search for a Key value in a given list.

2. Implement any two sorting techniques using an appropriate data structure

3. Implement Stacks and Queues using arrays

4. Implement Singly Linked Lists.

5. Implement Doubly Linked Lists

6. Implement Stacks and Queues using linked lists

7. Implement Open Hashing (Chaining) and Closed Hashing (Linear Probing) using appropriate

data structures

8. Write a program to demonstrate different Binary Tree Traversals.

9. Write a program to demonstrate BST operations

10. Write a program to demonstrate AVL tree operations

11. Write a program to demonstrate Heap operations

12. Write a program to demonstrate different Graph Traversals


B.Tech (IT)- 3rd Semester


Course Title: OBJECT ORIENTED PROGRAMMING THROUGH J AVA LAB

Course code: IT 2204

L T P C 0 0 3 2 Implement the following experiments:

Use JDK 1.5 or above on any platform e.g. Windows or Unix.

1. Write a Java program to demonstrate String handling methods.

2. Write a Java program for sorting a given list using inheritance concept.

3. Write a Java program for creating one base class for student personal details and inherit those details into

the sub class of student Educational details to display complete student information.

4. Write a Java program to implement matrix operations using multidimensional arrays

5. Write a Java program that illustrates runtime polymorphism

6. Write a Java program, to demonstrate tokenizing given string/text using StringTokenizer class

7. Write a Java program to create a package which has classes and methods to read Student Admission

details.

8. Write a Java program to define and handle Exceptions in the implementation of Program3.(also make use

of throw, throws).

9. Write a Java program to create multiple threads for different calculator operations.

10. Write an Applet to draw various geometrical shapes

11. Write a Java program for handling mouse events.

12. Write a Java Program to design a Job Application/ Student Admission Form.

13. Write a Java program that works as a simple Calculator.


B.Tech (IT)- 4thSemester


Course Title: PROBABILITY and STATISTICS Cour se Code: MATH 2405

L T P C 3 1 0 4 Course objectives : Students undergoing this course are expected to:

• Solve problems related to conditional and joint probability • Solve problems based on density functions and cumulative density functions • Solve problems on mean , variance and standard deviations of random signals • To transform random variables in one domain to other • Solve problems on joint and conditional distribution functions • Solve problems on Different density functions and cumulative distribution functions • Understand different noise sources for noise estimation • Plot and study power spectral density and system response • Learn the importance of Random variables. • Learn different mathematical models of queuing theory

• Learn about Poisson distribution. • Learn hypothesis concepts such as one tail and two tail tests. • Learn various statistical quality control methods.

• Learn concept of regression. Course outcomes : After undergoing the course, Students will be able to understand

• Solve problems related to conditional and joint probability for information theory and coding • Solve problems on density functions and cumulative density functions which is useful in probability

of error estimations in digital communication systems • calculate mean and variance of the random signal using probability density function and MGF which

are useful in stastical signal processing, Bio medical processing etc • Able to transform of random variables in one domain to another domain for statical signal

processing, Bio medical processing • Identify the signals stationary or non stationary useful for biomedical signal processing • Find the auto correlation and cross correlation of any two similar random signals in signal

processing and communication • Understand the different noise sources for noise estimation in noisy signals in signal processing and

communication • Find the relationship between power density spectrum and auto correlation in Radar signal

processing tracking and target detection

• Students are able to apply Baye’s theorem for applications related to classification.

• Students can apply the concept of Random variables in various optimization techniques like PSO,CSO,Ant Colony Optimization.

• Apply the knowledge of Poisson distribution in various applications like Image Processing,Data Mining etc.

• Students can apply models of queuing theory for analysis and design of service process for which there is contention of shared resources.

• Students able to apply the knowledge of statistical methods in various applications like Data Distribution etc.

• Students can apply the knowledge of regression in prediction where unknown values can be predicted from known values.

UNIT-I 15 Hrs Probability: Sample space and events – Probability – The axioms of probability – Some Elementary theorems - Conditional probability – Baye’s theorem. Random variables – Discrete and continuous Distributions and properties –joint probability Distribution function and properties. UNIT-II 15 Hrs Poisson,Exponential and Normal distribution – related properties Queuing Theory: Pure Birth and Death Process M/M/1 Model and Simple Problems.

UNIT-III 15 Hrs Sampling distribution: Populations and samples - Sampling distributions of mean (known and unknown). Test of Hypothesis– Type I and Type II errors. One tail and two-tail tests. –Hypothesis concerning one and two means- Hypothesis concerning one and two Proportions-Maximum error and interval estimation of means and proportions. Tests of significance – Student’s t-test, F-test, Chi-square test for independence of attributes. UNIT-IV 15 Hrs Statistical Quality Control methods-Methods of preparing Control charts-X-bar,p and R-charts-Correlation-Pearson’s correlation coefficient and Spearman’s Rank correlation and Regression-curve fitting, regression lines Text Books: 1. Engineering Mathematics by B.V.Ramana, TMH-publications. 2. Probability & Statistics, T. K. V. Iyengar, B. Krishna Gandhi and Others, S. Chand & Company. 3. A text book of Probability & Statistics, Murugesan and Gurusamy, Anuradha Publications References: 1. Probability & Statistics, Arnold O. Allen, Academic Press. 2. Probability & Statistics for Engineers, Miller and John E. Freund, Prentice Hall of India. 3. A text book of Probability & Statistics, Shahnaz Bathul, V. G. S. Book Links.


B.Tech (IT) – 4th Semester


Course Title: COMPUTER ORGANIZATION Course Code: CSE 2403

L T P C 3 1 0 4


• Understand how a computer system performs tasks by executing different micro-operations.

• Understand the basic organization of Computer system and its operation.

• Understand the instruction formats with different addressing modes, used by the CPU for instruction

processing.

• Know how control unit generates signals for carrying out instruction execution.

• Understand and analyze how the CPU performs basic arithmetic operations.

• Understand the organization of the memory system and its effect on performance of the computer.

• Understand how data transfer takes place among the various peripherals in the computer system.

• Know the different forms of concurrent processing and its effect on execution speed of the computer.

Course Outcomes: At the end of the course students are able to: • Know the different components of the computer system, their functions and their interconnections. • Know the various instruction formats that the processor follows.

• How the control unit generates control signals to execute a particular instruction.

• Understand how the memory system can be suitably designed to improve the performance of the

computer.

• Know how high speed computers can be designed by using the pipelining and multiprocessor

concepts.

UNIT – I 16Hrs Computer Function and Register Transfer Languages: Computer types, Functional units, Register transfer language. Register transfer, Bus and memory transfers Micro-Operations: Arithmetic micro-operations, Logic micro-operations, Shift micro- operations, Arithmetic logic shift unit Basic Computer Organization and Design: Instruction codes, Computer registers, Computer instructions, Timing and Control, Instruction cycle, Memory-Reference instructions, Register-Reference instruction, Input-Output instruction, Interrupts, Design of basic computer UNIT – II 14Hrs

Central Processing Unit: Stack organization, Instruction formats, Addressing modes, Data Transfer and manipulation, Program control, reduced instruction set computer, Complex instruction set computer Control Unit Design: Hardwired control unit design, Micro-programmed Control unit design, Control memory, Address sequencing, Micro-program example UNIT-III 16Hrs Computer Arithmetic: Fixed point representation, Floating point representation, Addition and subtraction, Multiplication algorithms, Division algorithms, Floating point arithmetic operations The Memory System: Memory hierarchy, Semiconductor RAM memories, Read-only memories, Cache memories, Performance considerations, Secondary storage, Virtual memories UNIT-IV 14Hrs Input-Output Organization: Peripheral devices, Input-Output interface, Asynchronous data transfer, Modes of transfer, Priority interrupt, Direct memory access, Input-Output processor (IOP) Pipeline and Vector Processing: Parallel processing, Pipelining, Arithmetic pipeline, Instruction pipeline, Vector processing, Multiprocessors-loosely coupled and tightly coupled Text Books: 1. Computer Organization by Carl Hamacher, ZvonksVranesic, SafeaZaky, 5th Edition,

McGraw Hill 2. Computer Systems Architecture by M.Moris Mano, 3rd Edition, Pearson/PHI Reference Books: 1. Computer Organization and Architecture – William Stallings 6th Edition, Pearson/PHI 2. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition PHI/Pearson 3. Fundamentals of Computer Organization and Design, - Sivarama Dandamudi Springer Int. Edition




Course Title: DATABASE MANAGEMENT SYSTEMS Course Code: IT 2405

L T P C 3 1 0 4


• Understand the differences between File system and DBMS, Data Models and database system structure.

• Know how to use the integrity constraints over the relations and expressive power of Algebra and calculus

• Learn the query language features which are the core of SQL’s DML, Join operations and Triggers. • Learn normalization procedure to eliminate the redundancy in the databases • know the concept of the transaction management which is the foundation for concurrent execution and

recovery from the system failure in a DBMS • Learn the recovery techniques for managing the database effectively and avoid the data lose. • Know how to arrange the records in a file when the file is stored on the external storage.

Course Outcomes:At the end of the course students will be able to:

• Identify and define the data models needed to design a database • Create conceptual and logical database design for Large enterprises

• Apply Integrity constrains over the relations • Apply normalization process on existing database for eliminating redundancy • Apply the recovery techniques for managing the database effectively to avoid the data lose

UNIT I 15Hrs

Introduction to DBMS: Database System Applications, database System Vs file System, View of Data, Data Abstraction, Instances and Schemas, data models, the ER Model, Relational Model, Network model, Hierarchy model. Database Languages: DDL, DML, DCL. DBMS architecture.

Database Design: Introduction to database design, ER Model, Additional features of ER Model, Conceptual Design with the ER Model, Conceptual design for large enterprises.

UNIT II 15Hrs

Introduction to the Relational Model: Integrity constraints, Relational Algebra, Selection and projection set operations, renaming, Joins, Division, Relational calculus: Tuple relational Calculus , Views.

SQL Queries: Form of Basic SQL Query, Introduction to Nested Queries ,Correlated Nested Queries ,Set Comparison Operators, Aggregative Operators – NULL values ,Outer Join, Logical connectivity’s , AND, OR and NOT , Triggers.

UNIT III 15Hrs

Schema refinement: Problems Caused by redundancy, Decompositions, Functional dependency, FIRST, SECOND, THIRD Normal forms – BCNF, Multi valued Dependencies – FOURTH Normal Form.

Transactions: Transaction State, ACID properties of transaction, serial schedule, parallel schedule, conflicts in concurrent Executions, Serializability, Recoverability, performance of locking, transaction support in SQL.

UNIT IV 15Hrs

Concurrency Control: Introduction to Lock Management, Lock Conversions, Dealing with Deadlocks, Specialized Locking Techniques, Concurrency without Locking. Crash Recovery: Introduction to ARIES, the Log, other recovery related structures, the Write-Ahead Log Protocol, Check pointing – recovering from a system. Data on External Storage: File Organization and Indexing, Cluster Indexes, Primary and Secondary Indexes, Index data Structures, Hash Based Indexing, Indexed Sequential Access Methods (ISAM), B+ Trees: A Dynamic Index Structure, Database Security: Threats and risks, Database access control, Types of privileges,

TEXT BOOKS :

1. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGrawHill 3rd Edition 2. Database System Concepts, Silberschatz, Korth, McGraw hill, 5th Edition. REFERENCES :

1. Database Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7th Edition. 2. Fundamentals of Database Systems, Elmasri & Navatha Pearson Education 3. Introduction to Database Systems, C.J.Date Pearson Education




Course Title: DESIGN ANALYSIS AND ALGORITHMS Course Code: IT 2406

L T P C 3 1 0 4

Course Objectives:The course content enables students to:

• To build a solid understanding in the area of fundamentals of algorithms. • To build a solution for complex problems recursively using divides and conquer approach. • To understand the concepts of disjoint sets and its application in field of data structure. • To apply greedy algorithm to find solution for optimal problems. • To Understand the basic idea of dynamic programming • To come with many solutions using searching methods checking with every alternatives. • To know that the branch and bound is a general optimization technique that can be applied where

advanced algorithm design techniques failed. • To know the polynomial and NP problems and its complexity. • To take advantage of a convenient methods to design applications on computer science and

engineering applications. •


• Analyze the algorithms for best and worst case performances • Demonstrate the ability to develop efficient and fast algorithms using divide and conquer design

method. • To apply the concepts of disjoint sets and its operations in field of data structure. • To find optimal solutions by applying various optimal problems using greedy algorithm. • To apply the dynamic programming method for solving complex problems with the help of divide

and conquer design method. • To apply the backtracking approaches to find various solutions for a given problem. • To apply the knowledge of branch and bound method to solve problems optimally where advanced

algorithm design techniques failed. • To distinguish the problems and its complexity as polynomial and NP problems. • To apply the knowledge of all designing methods to develop applications in computer science and

engineering.

UNIT I: 16 Hrs Introduction to Algorithm as Technology: Performance Analysis: - Space complexity, Time complexity. Amortized Analysis Growth of Functions: Asymptotic Notation- Big oh notation, Omega notation, Theta notation, little oh, little omega. Recurrences: The Master Method. Divide and conquer: General method, applications:-Fibonacci Search, Quick sort, Disjoint Sets: Disjoint operations, UNION-FIND Algorithms UNIT II: 16 Hrs Advanced Design and Analysis of Algorithm Techniques Greedy method: General method, applications:-Job sequencing with deadlines, Minimum cost spanning trees (Kruskal’s Algorithms), Single source shortest path problem (Dijkstra’s Algorithms), Optimal Merge Patterns (two way merge pattern). Dynamic Programming: General method, applications:-Matrix chain multiplication, 0/1 knapsack problem, all pairs shortest path problem. UNIT III: 14 Hrs Search space and optimization problem techniques Backtracking: General method, applications:-n-queen problem, sum of subsets problem Branch and Bound: General method, LC Branch and Bound solution & FIFO Branch and Bound solution. Applications: - Traveling sales person problem UNIT IV: 14 Hrs Introduction to NP Problems and computing algorithms NP-Hard and NP-Complete problems: Basic concepts, NP - Hard and NP Complete classes, Cook’s theorem. Number-Theoretic Algorithms: the Chinese remainder theorem, powers of an element Polynomials and FFT: Representations of polynomials, the Fast Fourier Transform (FFT) TEXT BOOKS : 1. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and Rajasekharam, Unversities Press. 2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L. Rivest, and C.Stein, PHI Pvt. Ltd./ Pearson Education REFERENCES : 1. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee, S.S.Tseng, R.C.Chang and T.Tsai, McGraw Hill. 2. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education. 3. Algorithms – Richard Johnson baugh and Marcus Schaefer, Pearson Education.




Course Title: OPERATING SYSTEMS Course Code: CSE 2407

L T P C 3 1 0 4 Course Objectives: The course content enables students to:

• Understand Objectives, Functions, Services of Operating Systems and Learn the Concepts of Process and Process Scheduling

• Understand issues related to Process Synchronization and focus on principles of Deadlock and related problems of Starvation

• Comprehend the mechanisms used in Memory Management and Virtual Memory. • Understand the concepts of File System and Disk Scheduling


• Understand the various concepts of process • Implement concurrency mechanisms • Implement Bankers Algorithms to handle deadlocks • Design and analyze mechanisms used in memory management • Develop processor scheduling, Paging technique Algorithms

UNIT – I 14 Hrs Operating Systems Overview: Introduction to Operating Systems, Operating System Structure, Operating System Operations, Operating System Services, System calls, Types of System Calls. Process Management: Introduction to Process, Process Scheduling, Operations on Processes, Inter Process Communication, Process Scheduling Criteria, and Scheduling Algorithms and its Evaluation. UNIT – II 16 Hrs Process Synchronization: Introduction to Process synchronization, The Critical-Section Problem, Peterson’s Solution, Synchronization Hardware, Semaphores, and Classical Problems of Synchronization using Semaphores Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock. UNIT-III 15 Hrs Memory Management: Introduction to Memory Management, Swapping, Contiguous Memory Allocation, Paging, Segmentation. Virtual Memory Management: Introduction to Virtual Memory Concept, Demand Paging, Copy on Write, Page Replacement Algorithms, Allocation of Frames, Thrashing.

UNIT-IV 15 Hrs File System: File Concept, Access Methods, Directory Structure, File System Structure, Allocation Methods, Free-Space Management. Secondary Storage Structure: Overview of Mass Storage Structure, Disk Structure, Disk Scheduling. Text Books: 1. Operating System Concepts - Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th Edition,

John Wiley 2. Operating Systems Internal and Design Principles, Stallings, 6th Edition–2005, Pearson education Reference Books: 1. Operating systems- A Concept based Approach-D.M.Dhamdhere, 2nd Edition, TMH 2. Operating System A Design Approach-Crowley, TMH. 3. Modern Operating Systems, Andrew S Tanenbaum, 3rd edition, PHI.




Course Title: DATABASE MANAGEMENT SYSTEMS LAB Cour se Code: IT 2207

L T P C 0 0 3 2

Implement the following experiments:

1. Execute Single line and Group functions for a table.

2. Implement Queries using GROUP BY & HAVINGclauses, set operators and set comparison operators.

3. a) Execute DCL commands

b) Creation and dropping of Views.

4. Create and manipulate various DB objects for a table.

5. a) Creation of simple PL/SQL program which includes declaration section, executable section

and exception –Handling section

b) Insert data into student table and use COMMIT, ROLLBACK and SAVEPOINT in PL/SQL

block.

6. Develop a program that includes the features of NESTED IF and CASE. The program can be extended

using the NULLIF and COALESCE functions.

7. Develop a Program using WHILE LOOPS, numeric FOR LOOPS, nested loops using ERROR Handling,

BUILT –IN Exceptions, User-defined Exceptions, RAISE- APPLICATION ERROR.

8. Develop a Program using creation of procedures, passing parameters IN and OUT of PROCEDURES.

9. Develop a Program using creation of stored functions, invoke functions in SQL Statements and write

complex functions.

10. Develop a Program using packages.

11. Write PL/SQL procedure for an application using cursors.

12. Create sample triggers and assertions




Course Title: DESIGN AND ANALYSIS OF ALGORITHMS LAB Course Code: IT 2208

L T P C 0 0 3 2 Course objectives : Students undergoing this course are expected to:

• To understand how asymptotic notation is used to provide a rough classification of algorithms, how a number of algorithms for fundamental problems in computer science and engineering work and compare with one another.

• Understand basic classes of algorithms, such as greedy algorithms, divide-and-conquer algorithms, branch-and-bound algorithms, and backtracking algorithms.

• Apply the algorithms and design techniques to solve problems. • Analyze the complexities of various problems in different domains.

Course outcomes : After undergoing the course, Students are able to

• To understand the methods for analyzing the efficiency and correctness of algorithms. • To analyze the running time of the basic algorithms for the classic problems in various domains. • To design algorithms using the dynamic programming, greedy method, Backtracking, Branch and

Bound strategy . • To choose appropriate algorithmic design techniques to present an algorithm that solves a given

problem. • To develop an efficient algorithms for the new problem with suitable designing techniques.

List of Experiments

1. Write a program to find the maximum element from an array. 2. Write a program to implement union and find algorithm. 3. Write a program to implement Binary Search 4. Write a program for sorting a given list of elements in ascending order using Quick sort. 5. Write a program to find minimum cost spanning tree using Prim’s algorithm 6. Write a program to find minimum cost spanning tree using Kruskal’s algorithm 7. Program to implement knapsack problem using greedy method. 8. Write a program to perform Matrix Chain Multiplication 9. To write a program to perform All pairs shortest path problem 10. Write a C program that uses dynamic programming algorithm to solve the optimal binary search

tree problem. 11. To write a program to solve ‘n’ Queens problem using Back Tracking Technique

12.Write a program to solve Traveling salesperson’s problem using Branch and Bound method

TEXT BOOKS :

1. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and Rajasekharam, Unversities Press. 2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L. Rivest, and C.Stein, PHI Pvt. Ltd./ Pearson Education

course structure - gmrit.org

Documents