SCHEME OF INSTRUCTION AND EVALUATION II SEMESTER OF III YEAR OF 4-YEAR B.TECH. DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING

Transcription

1 SCHEME OF INSTRUCTION AND EVALUATION II SEMESTER OF III YEAR OF 4-YEAR B.TECH. DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING Course Number MH321 Name of the Course Management, Economics and Accountancy Periods of Instruction per week Lectures Tutorials Practicals External Evaluation Time (Hrs) Evaluation Scheme Max. Marks Internal Evaluation Time (Hrs) Max. Marks Total Marks CS320 Algorithm Analysis and Design CS323 Software Engineering CS322 Language Processors EC3211 Communication Systems EI327 Microprocessors and Interfacing CS3212 Language Processors Laboratory EI329 Microprocessors and Interfacing Laboratory Total

2 MH321 MANAGEMENT, ECONOMICS AND ACCOUNTANCY Course: III/IV B.Tech, II Semester Theory: 3 Periods/week Branch: Common to all branches ECONOMICS UNIT-I (9) Economics: Meaning, definition, Scope: Micro and Macro. Assumptions and Methods. Usefulness: Factors of Production: Meaning and definition. Characteristics of Land Labour, Capital and entrepreneurship. Division of Labour: Advantages and Disadvantages. Formation of Capital. Forms of Business Organization: Sole Propritaryship, Partnership Concern, Cooperative Societies Joint Stock Company. Types of Partners, Types of Joint Stock Companies. Merits and Demerits. MANAGEMENT UNIT-II (9) Management: Meaning and Definition. Scope of Management: -Principles of Management. Scientific Management: Definition, Characteristics and Criticism. Functions of Management: Planning: Definition and Process. Organizing Definition of Organization: Characteristics and types. Principles of Organization. Departmentation: Meaning and fundamentals of Departmentation. Centralization and Decentralization: Definition: features, Merits, and Demerits. Communication: Process of Communication, Channels, Media, and Barries. UNIT-III (9) Staffing : Meaning and functions of Personnel Management. Coordination: Definition, How to achieve effective coordination. Controlling: Definition and Process. ACCOUNTANCY UNIT-IV (9) Double Entry Book-Keeping: Definition. Journalization of Transactions. Ledger Posting and Balancing. Preparation of Trail Balance. Preparation of Final Accounts: Trading Account, Profit and Loss Account and Balance Sheet(with simple adjustments). 1. Modern Economic Theory By K.K.ewett. 2. Principles and Practice of Management By L.M. Prasad. 3. Introduction to Accountancy by T.S.Grewal. 4. Business Organization and Management Y.K.Bushan.

3 CS320 ALGORITHM ANALYSIS AND DESIGN Course: III/IV B.Tech, II Semester Theory: 3 Periods/week Branch: Computer Science & Engineering Tutorial: 1 Period/week UNIT-I (9+3) Introduction: Algorithm analysis, Time complexity and Space complexity, Big O notation, Omega notation and Theta notation, Different mathematical approach s for solving time complexity of Algorithms. Divide and Conquer: General method, Merge sort, Quick sort, Strassens matrix multiplication. Sets and Disjoint Set Union: Introduction, Union and Find Operations. UNIT-II (9+3) Greedy Method: General method, Optimal storage on tapes, Knapsack problem, Minimum spanning tree, Job sequencing with deadlines. Dynamic Programming: Multistage graphs, All pairs shortest paths, Single source, shortest paths, General weights. UNIT-III (9+3) Dynamic Programming: Optimal binary search trees, String editing, 0/1 knapsack problem, Reliability design problem, Traveling sales person problem, Flow shop scheduling. Back tracking: General method, 8-Queen problems, Graph coloring problems. UNIT-IV (9+3) Branch and Bound: 0/1 knapsack problem, Traveling sales person problem Efficiency. NP-Hard and NP-Complete Problems: Basic Concepts: Nondeterministic Algorithms, The classes NP-Hard and NP-complete. NP-Hard Graph Problems: Clique Decision problem, Node Cover Decision Problem, Traveling Salesperson Decision Problem. NP-Hard Scheduling Problems: Scheduling Identical Processors, Flow Shop Scheduling. NP-Hard Code Generation Problems: Code generation With Common Subexpressions. PARM Algorithms: Introduction, Computational Model. Fundamental Techniques: Prefix computation, List Ranking. 1. E.Horowitz, S.Sahni & S.Rajasekaran Fundamentals of computer algorithms, Galgotia publications pvt Ltd, India, ISBN , Thomas H. Cormen, Chrles E. lesiserson & Ronald L. Rivest Introduction to algorithms, Prentice Hall, India, ISBN , 2001.

4 CS323 SOFTWARE ENGINEERING Course: III/IV B.Tech II Semester Theory: 3 Periods/week Branch: Computer Science & Engineering Tutorial: 1 Period/week UNIT-I (9+3) Software Engineering Concepts: The Evolving Role of Software-Software-The Changing Nature of Software-Legacy Software-Software Myths Software Engineering- A layered Technology- A Process Framework- The Capability Maturity Model Integration (CMMI) Process Models: The Waterfall Model-Incremental Process Models-Evolutionary Process Models-Specialized Process Models Software Engineering Practice: Software Engineering Practice-Communication Practices- Planning Practices-Modeling Practices-Construction Practice-Deployment Requirements Engineering: Requirements Engineering Tasks-Initiating the Requirements Engineering Process-Eliciting Requirements-Developing Use-Cases-Building the Analysis Model-Negotiating Requirements-Validating Requirements UNIT-II (9+3) Building The Analysis Model: Requirements Analysis-Analysis Modeling Approaches- Data Modeling Concepts-Object-Oriented Analysis-Scenario-Based Modeling-Flow- Oriented Modeling-Class-Based Modeling -Creating a Behavioral Model Design Engineering: Design within the Context of Software Engineering-Design Process and Design Quality-Design Concepts -The Design Model-Pattern based Software design Creating An Architectural Design: Software Architecture-Data Design-Architectural Styles and Patterns-Architectural Design-Assessing Alternative Architectural Designs-Mapping Data Flow into a Software Architecture Modeling Component-Level Design: Component-Designing Class-Based Components- Conducting Component-Level Design-Object Constraint Language-Designing Conventional Components UNIT-III (9+3) User Interface Design:The Golden Rules-User Interface Analysis and Design-Interface Analysis-Interface Design Steps-Design Evaluation

5 Testing Strategies:A Strategic Approach to Software Testing-Strategic Issues-Test Strategies for Conventional Software-Test Strategies for Object-Oriented Software- Validation Testing-System Testing-The Art of Debugging Testing Tactics: Software Testing Fundamentals-Black-Box and White-Box Testing-Basis Path Testing-Control Structure Testing-Object-Oriented Testing Methods-Testing Methods Applicable at the Class Level-Inter Class Test Case Design-Testing for Specialized Environment,Architectures, and Applications UNIT-IV (9+3) Product Metrics: Software Quality-A Framework for Product Metrics-Metrics for the Analysis Model-Metrics for the Design Model-Metrics for Source Code-Metrics for Testing- Metrics for Maintenance Project Management: The Management Spectrum-The People-The Product-The Process- The Project- The W5 HH Principle Metrics For Process And Projects: Metrics in the Process and Project Domains-Software Measurement-Metrics for Software Quality-Integrating Metrics within the Software Process Project Scheduling: Project Scheduling-Defining a Task Set for the Software Project- Defining a Task Networks -Scheduling -Earned Value Analysis 1. Roger S. Pressman, Software Engineering, Sixth Edition, McGraw-Hill, ISBN , IAN Sommerville, Software Engineering, Sixth Edition, Pearson Education, ISBN : X, Timothy C. Lethbridge and Robert Langaniere, Object-Oriented Software Engineering, Tata McGraw-Hill, ISBN X, 2004.

6 CS322 LANGUAGE PROCESSORS Course : III/IV B. Tech II Semester Theory : 3 periods/week Branch : Computer Science & Engineering Tutorial :1 period/week UNIT-I (9+3) Introduction to Compiling : Compilers, Analysis of the source program, The phases of a compiler, Cousins of the compiler, Concepts of Loaders,Linkers,The grouping of phases, Compiler writing tools. Lexical Analysis: The role of the lexical analyzer, Input buffering, Specification of tokens, Recognition of tokens, A Language for specifying lexical Analyzers, Finite automata, Design of a lexical analyzer, Optimization of DFA-based pattern matchers. UNIT-II (9+3) Syntax Analysis : The role of a the parser, Context-free grammars, Writing a grammar, Topdown parsing, Bottom-up parsing, Operator Precedence parsing, LR parsers, Using ambiguous grammars, Parser generators. Syntax Directed Translation : Syntax-directed definitions, Construction of syntax trees, Bottom-up evaluation of S-attributed definitions, L-attributed definitions, Top-Down translation, Bottom-up evaluation of inherited attributes, Space for attribute values at compile time, Analysis of syntax-directed definitions. UNIT-III (9+3) Type Checking: Type systems, Specification of a simple type checker,equivalence of type expressions, Type Conversions. Runtime Environments : Source language issues, Storage organization, Storage-allocation strategies, Symbol tables, Language facilities for dynamic storage allocation, Dynamic storage allocation techniques. Intermediate Code Generation: Intermediate languages, Declarations, Assignment statements, Boolean Expressions, Back patching. UNIT-IV (9+3) Code Generation: Issues in the design of a code generator, The target machine, Runtime storage management, Basic blocks and flow graphs, Next-use information, A simple code generator, Register allocation and assignment, The dag representation of basic blocks, Peephole optimization, Generating code from dags, Code-generation algorithm. Code Optimization: Introduction, The principal sources of optimization, Optimization of basic blocks, Loops in flow graphs, Introduction to global data-flow analysis, Code-improving transformations. 1. Alfred V.Aho, Ravi Sethi and Jeffry D. Ullman, Compiler Principles, Techniques and Tools,16 th Indian Reprint, Pearson Education Asia, ISBN No X., D.M.Dhamdere, Compiler Construction, 2 nd edition, Mac Mellon India Ltd, ISBN No ,1997.

7 EC3211 COMMUNICATION SYSTEMS Course: III/IV B.Tech II Semester Theory: 3 Periods/week Branch: Computer Science & Engineering Tutorial: 1 period/week UNIT I (9+3) Spectral Analysis: Fourier series and Fourier transform, Fourier transform of power and periodic signals and their properties. Hibbert Transform energy and power signals, power spectral density. Amplitude Modulation: AM, DSB SC, SSB, VSB, their spectra, generation and detection techniques, power relations. Frequency Modulation: Frequency and Phase Modulations, Narrow Band, Wide Band, FM generation and detection techniques. UNIT II (9+3) Sampling theorem, Flat Top Sampling, Natural Sampling, Quantization, Quantization error, pulse code modulation, S/N Ratio, Differential PCM, Delta Modulation, Adaptive Delta Modulation, Inter Symbol Interference, Pulse Amplitude Modulation (PAM), TDM, FDM. UNIT III (9+3) Data transmission Techniques: ASK, FSK, PSK, QPSK, DPSK generation and detection techniques. Introduction to Information Theory; Information, Entropy, Channel capacity, Hartly Shannon Law, Band Width and Signal to Noise ratio trade off, Fano-shannon algorithm, discrete memory less system, Huffman coding. UNIT IV (9+3) Multiplexing and Multiple access: TDMA, FDMA, CSMA, Aloha, Slotted Aloha, CDMA, GIS. Introduction to Mobile and Cellular Communications. 1. Simon Haykins, Communication Systems, PHI. 2. Jeorgy Kennedy, Electronic Communication Systems, TMGH. 3. B. P.Latha, Weily Estren, Communication Systems.

8 EI327 MICROPROCESSORS AND INTERFACING Course: III/IV B.Tech II Semester Theory: 3 Periods/week Branch: Common to CSE,IT Tutorial: 1 Period/week UNIT-I (9+3) 8086 ARCHITECTURE Introduction: Evolution of Microprocessors Functional block diagram, Register organization, addressing, Bus structure, Physical and logical addressing, Instruction Set, Address modes. UNIT-II (9+3) Assembly Language programming : Assembler directives, simple programming of 8086, Implementation of structures, time-delays, strings, procedures, Macros, Pin configuration, Min/Max modes, Timing diagrams. UNIT-III (9+3) INTERFACING : Interfacing concepts, detailed study of interfacing devices 8255, 8257, 8254 and Interfacing of switches, key boards, LEDs, 7 segment display units, CRT interface, floppy disk Interface, stepper motor interface. ADC, DAC interfacing. UNIT-IV (9+3) Serial communication standards, RS232, IEEE 488 BUS, 20mA current loop, 8251, USART, Prototyping and trouble shooting, Software debugging tools, Microprocessors development systems. (MDS) 1. MICROPROCESSOR and interfacing By D.V.Hall. (TMGH). 2. MICROPROCESSOR PROGRAMMING AND INTERFACING with PC By Kenneth Ayala. 3. Micro computer systems: The 8086 family, architecture, Programming & Design Ynchangliu, glen. A. Gibson, PHI. 4. Advanced Microprocessors Brey Pearson

9 CS3212 LANGUAGE PROCESSORS LABORATORY Course : III/IV B.Tech II Semester Laboratory: 3 periods/week Branch : Computer Science & Engineering External Examination: 3 Hours External Evaluation: 50 Internal Examination: 2 Hours Internal Evaluation: 25 List of Experiments 1. Programs using Lex Tool a) Lex specification to skip comments in a file b) Lex specification to print two digit numbers in words. c) Lex specification to check the validity of given date. d) Lex specification to convert given octal number into decimal equivalent. 2. Programs using Yacc Tool a) Yacc specification to find sentence validity. b) Yacc specification to evaluate expressions using precedence. c) Yacc specification to convert binary numbers to decimal numbers d) Yacc specification to check the validity of given date. 3. Program to find all meaningful words and generate the tokens for the given input program. 4. Implementing Symbol Table for given HLL. 5. Implementing simple shift reduce parser Implementing SLR parser. 7. Implementing Canonical LR Parser. 8. Implementing LALR Parser. 9. Write a program in suitable high level language to carryout lexical analysis of an input program in HLL. 10. Write a parser using C for any input HLL program for which lexical analysis has been carried out. 11. Write a program to generate machine code for restricted programming expressions. 12. Experiments on code optimization of programming expressions.

10 EI329 MICROPROCESSORS AND INTERFACING LABORATORY Course: III/IV B.Tech. II Semester Laboratory: 3 Hrs / week Branch: Common to CSE, IT External Examination: 3 Hours External Evaluation: 50 Internal Examination: 2 Hours Internal Evaluation: 20 LIST OF EXPERIMENTS 1. Study of 8086 kits. 2. Sum, Average, multiplication 3. Sorting in a) Ascending order b) Descending order. 4. Code conversions. a) BCD to Binary b) Binary to BCD. c) Binary to ASCII d) ASCII to Binary. 5. String Manipulations 6. Generation of time delays Counters. INTERFACING EXPERIMENTS 7. Wave form generation using DAC Modules. a) Square wave b) Saw tooth c) Triangular. 8. LED/LCD interfacing. 9. Traffic controller. 10. ADC interfacing.