shri vishnu engineering college for women :: · pdf file... bhimavaram department of...

Department of Information Technology: SVECW 1

SHRI VISHNU ENGINEERING COLLEGE FOR WOMEN :: BHIMAVARAM

DEPARTMENT OF INFORMATION TECHNOLOGY

Contents

S.No Subject Page No

1 DATA COMMUNICATION 2

2 PRINCIPLES OF PROGRAMMING LANGUAGES 6

3 OBJECT ORIENTED PROGRAMMING THROUGH JAVA 10

4 COMPUTER ORGANIZATION AND ARCHITECTURE 15

5 DATA BASE MANAGEMENT SYSTEMS 19

6 AUTOMATA THEORY & COMPILER DESIGN 23


COURSE : II Year B.Tech BRANCH : Information Technology

CLASS : II/II Sem. YEAR : 2013-14

SUBJECT : DATA COMMUNICATION

Syllabus

UNIT I : Fundamentals Of Data Communication: Data Communication Network Architecture, Protocols and standards, standards organizations for Data Communication, Layered Network Architecture, Open Systems Interconnection, Data Communication circuits, Serial and parallel Data Transmission, Data communications Circuit Arrangements, Data communications Networks. SIGNALS, NOISE, MODULATION, AND DEMODULATION : Signal Analysis, Electrical Noise and Signal-to-Noise Ratio, Analog Modulation Systems, Information Capacity, Bits, Bit Rate, Baud, and M-ary Encoding, Digital Modulation. UNIT II : Metallic Cable Transmission Media : Metallic Transmission Lines, Transverse Electromagnetic Waves, Characteristics of Electromagnetic Waves, Transmission Line Classifications, Metallic Transmission Line Types, Wave Propagation on Metallic Transmission Lines, Metallic Transmission Line losses . OPTICAL FIBER TRANSMISSION MEDIA : Advantages and Disadvantages of Optical Fiber Cables, Electromagnetic spectrum, Optical Fiber Communications System Block Diagram, Optical Fiber construction, The Physics of Light, Velocity of Propagation, Propagation of Light Through an Optical fiber Cable, Optical Fiber Modes and Classifications, Optical Fiber Comparison, Losses in Optical Fiber Cables. UNIT III : Digital Transmission : Pulse Modulation, Pulse code Modulation, Signal Voltage–to-Quantization Noise Voltage Ratio, Linear Versus Nonlinear PCM Codes, Companding, PCM Line Speed. Delta Modulation PCM Differential PCM. Multiplexing and Carriers : Time- Division Multiplexing, T1 Digital Carrier System, Digital Line Encoding, T Carrier systems, Statistical Time – Division Multiplexing, Frame Synchronization, Frequency- Division Multiplexing, Wavelength- Division Multiplexing. UNIT IV : Wirless Communications Systems : Electromagnetic Polarization, Rays and Wave fronts, Electromagnetic Radiation, Spherical Wave front and the Inverse Square Law, Wave Attenuation and Absorption, Optical Properties of Radio Waves, Terrestrial Propagation of Electromagnetic Waves, Skip Distance, Free-Space Path Loss, Microwave Communications Systems, Satellite Communications Systems. UNIT V : Telephone Instruments And Signals: The Subscriber Loop, Standard Telephone Set, Basic Telephone Call Procedures, Call Progress Tones and Signals, Cordless Telephones, Caller ID, Electronic Telephones, Paging systems. THE TELEPHONE CIRCUIT: The Local Subscriber Loop, Telephone Message-Channel Noise and Noise Weighting, Units of Powers Measurement, Transmission Parameters and Private-Line Circuits , Crosstalk. UNIT VI : Cellular Telephone Concepts And Systems: Mobile Telephone service, Cellular Telephone, Frequency Reuse, Interference, Cell Splitting, Sectoring, Segmentation and Dualization, Cellular System Topology, Roaming and handoff, Network Components, Call Processing.First Generation Analog Cellular Telephone, Personal Communications system, Second Generation Cellular Telephone Systems, Digital Cellular Telephone , Global System for Mobile Communications. UNIT VII: Data Communications Codes, Error Control, and Data Formats: Data Communications Character Codes, Bar Codes, Error Control, Error Detection, Error Correction, Character Synchronization. UNIT VIII: Data Communications Equipment:


Digital Service Unit and Channel Service Unit, Voice-Band Data Communication Modems, Bell Systems- Compatible Voice-Band Modems, Voice-Band Modern Block Diagram, Voice-Band Modem Classifications, Asynchronous Voice-Band Modems, Synchronous Voice-Band Modems, Modem Synchronization, ITU-T Voice- Band Modem and 56K Modems, Cable Modems. Course Objectives:

To discuss network component and introduce LAN, WAN, AND MAN concepts, and explain terminology associated with data communication

Course Outcomes:

Define a number of terms related to data communication

List the basic components of a network

Explain the difference between a LAN, WAN and MAN

PLAN:

S. No. No. of Hours

Date Topic(s) to be covered Reference

(Book with Page Numbers)

Remarks

UNIT I

1 1 Introduction To Data Communications And Networking: Standards Organizations for Data Communications

T-19

2 1 Layered Network Architecture T-29

3 1 Open Systems Interconnection T-31

4 1 Data Communications Circuits, Serial and parallel Data Transmission, Data communications Circuit Arrangements

T-37

5 1 Data communications Networks, Alternate Protocol Suites.

T-55

6 1 SIGNALS, NOISE, MODULATION, AND DEMODULATION : Signal Analysis, Electrical Noise and Signal-to-Noise Ratio

T-57

7 1 Analog Modulation Systems T-74

8 1 Information Capacity, Bits, Bit Rate, Baud T-77

9 2 M-ary Encoding, Digital Modulation T-78

UNIT-II

10 1 METALLIC CABLE TRANSMISSION MEDIA :Metallic Transmission Lines, Transverse Electromagnetic Waves

T-96

11 1 Characteristics of Electromagnetic Waves, Transmission Line Classifications

T-98

12 1 Metallic Transmission Line Types, Metallic Transmission Line Equivalent Circuit

T-101

13 1 Wave Propagation on Metallic Transmission Lines, Metallic Transmission Line Losses.

T-112

14 1 OPTICAL FIBER TRANSMISSION MEDIA :Advantages of Optical Fiber Cables, Disadvantages of Optical Fiber Cables

T-118

15 1 Electromagnetic spectrum, Optical Fiber Communications System Block Diagram,

T-120

16 1 Optical Fiber construction, The Physics of Light, Velocity of Propagation, Propagation

T-123


of Light Through an Optical fiber Cable

17 1 Optical Fiber Modes and Classifications, Optical Fiber Comparison

T-133

18 2 Losses in Optical Fiber Cables, Light

sources, Light Detectors, Lasers. T-137

UNIT-III

19 2 DIGITAL TRANSMISSION : Pulse Modulation, Pulse code Modulation

T-152

20 1 Dynamic Range, Signal Voltage –to-Quantization Noise Voltage Ration

T-160

21 1 Linear Versus Nonlinear PCM Codes, Companding, PCM Line Speed

T-163

22 1 Delta Modulation PCM and Differential PCM.

T-174

23 2 MULTIPLEXING AND T CARRIERS : Time- Division Multiplexing, T1 Digital Carrier System

T-177

24 2 North American Digital Multiplexing Hierarchy, Digital Line Encoding

T-185

25 1 T Carrier systems, European Time- Division Multiplexing

T-191

26 1 Statistical Time – Division Multiplexing, Frame Synchronization

T-196

27 2 Frequency- Division Multiplexing, Wavelength- Division Multiplexing, Synchronous Optical Network

T-199,T-203, T-207

UNIT-IV

28 1 Wireless communications systems : Electromagnetic Polarization, Rays and Wavefronts

T-210,T-211

29 2 Electromagnetic Radiation, Spherical Wavefront and the Inverse Square Law, wave Attenuation and Absorption

T- 212,213,124

30 1 Free-Space Path Loss, Microwave Communications Systems

T-223,224-228

31 2 Satellite Communications Systems. T- 228 to 238

UNIT-V

32 1 Telephone instruments and signals: The Subscriber Loop, Standard Telephone Set,

T-241

33 1 Basic Telephone Call Procedures, Call Progress Tones and Signals

T-246,247,248

34 1 Cordless Telephones, Caller ID T-256,257

35 1 Electronic Telephones, Paging systems. T-258,259

36 1 THE TELEPHONE CIRCUIT:The Local Subscriber Loop, Telephone Message-Channel Noise and Noise Weighting

T-262

37 1 Units of Powers Measurement, Transmission Parameters and Private-Line Circuits

T-268

38 1 Voice-Frequency Circuit Arrangements, Crosstalk

T-286, T-292

UNIT-VI


Additional Topics (Not included in Syllabus)

1) Problems after completion of each unit.

2) University Previous Question Papers will be discussed at the end of the Semester -- 4 hrs

TEXT BOOKS:

T1. Introduction to Data Communications and Networking, 3/e, Wayne Tomasi, PEA.

REFERENCE BOOKS:

R1. Data and computer Communications, 8/e, William Stallings, PHI.

R2. Data Communications and Networking, 4/e, Behrouz A Forouzan, TMH.

R3. Understanding Data Communications ,7/e, Gilbert Held, PEA

39 1 CELLULAR TELEPHONE SYSTEMS: First- Generation Analog Cellular Telephone

T-348

40 1 Personal Communications system, Second-Generation Cellular Telephone Systems

T-355

41 1 N-AMPS, Digital Cellular Telephone, Interim Standard

T- 358 to 374

42 1 North American Cellular and PCS Summary T-375

43 1 Global system for Mobile Communications, T-376

44 1 Personal Communications Satellite System. T-378

UNIT-VII

45 1 Data communications codes, error control, and data formats:Data Communications Character Codes, Bar Codes

T-386

46 1 Error Control, Error Detection, Error Correction

T-402 to 414

47 1 Character Synchronization T-416

UNIT-VIII

48 2 Data communications equipment : Digital Service Unit and Channel Service Unit,

T-467

49 2 Voice- Band Data Communication Modems, Bell Systems- Compatible Voice- Band Modems

T-469,470

50 2 Voice- Band Modern Block Diagram, Voice- Band Modem Classifications

T-471,472

51 2 Asynchronous Voice-Band Modems, Synchronous Voice-Band Modems, Modem Synchronization

T- 472 to 481

52 1 ITU-T Voice- Band Modem Specifications, 56K Modems

T-481 to 487

53 2 Modem Control: The AT Command Set, Cable Modems

T -487 to 490

54 2 Revision

Total No. of Hours - 68 24-7-14 25-7-14




SUBJECT : PRINCIPLES OF PROGRAMMING LANGUAGES

Syllabus

UNIT-I: Introduction: The Art of Language Design, Programming Language Spectrum, Why Study Programming

Languages? Compilation and Interpretation, Programming Environments, Overview of Compilation

Programming Language Syntax: Specifying Syntax: Regular Expressions and Context-Free Grammars, Scanning,

Parsing, Theoretical Foundations

UNIT-II: Names, Scopes, and Bindings:The Notion of Binding Time, Object Lifetime and Storage Management,

Scope Rules, Implementing Scope, The Meaning of Names within a Scope, The Binding of Referencing

Environments, Macro Expansion, Separate Compilation

UNIT-III: Semantic Analysis:The Role of the Semantic Analyzer, Attribute Grammars, Evaluating Attributes,

Action Routines, Space Management for Attributes, Decorating a Syntax Tree

UNIT-IV: Control Flow:

Expression Evaluation, Structured and Unstructured Flow, Sequencing, Selection, Iteration, Recursion, Non

determinacy

UNIT-V: Data Types:Type Systems, Type Checking, Records (Structures) and Variants (Unions), Arrays, Strings,

Sets, Pointers and Recursive Types, Lists, Files and Input/ Output, Equality Testing and Assignment

UNIT-VI: Subroutines and Control Abstraction:

Review of Stack Layout, Calling Sequences, Parameter Passing, Generic Subroutines and Modules, Exception

Handling, Co routines, Events

Concurrency: Concurrent Programming Fundamentals, Implementing Synchronization, Language-Level

Mechanisms, Message Passing ;Run-time Program Management: Late Binding of Machine Code,

Inspection/Introspection

UNIT-VII: Data Abstraction and Object Orientation:

Object-Oriented Programming, Encapsulation and Inheritance, Initialization and Finalization, Dynamic Method

Binding, Multiple Inheritance

UNIT-VIII: Functional Languages: Functional Programming Concepts, A Review/Overview of

Scheme, Evaluation Order Revisited, Higher-Order Functions, Theoretical Foundations

Logic Languages: Logic Programming Concepts, Prolog, Theoretical Foundations, Logic

Programming in Perspective

Prerequisites:

Familiarity with concepts of any programming Language


Course objectives:

The objective of this course is to teach the concepts various programming languages as well as making learners

to be familiar with programming concepts.

Course outcomes:

Upon completion of this course, students will be familiar about:

Fundamentals of Computer programming

Functional programming

Programming Fundamentals & Modular programming features

Programming Concepts like Data types, , control statements, Arrays, Functions, Pointers, User defined

data types in various languages

Concepts of logic programming

Learning Functional programming

Handling exception

Parameter passing in different languages

Concurrent programming concepts of different languages

Concept of grammar for syntax analysis

PLAN

S.No. No. of

Hrs. Date Topic(s) to be Planned

Reference (Books with

Page Numbers)

Remarks

UNIT-I

01 1 Introduction to PPL

02,03 2 Introduction: The Art of Language Design, Programming Language Spectrum

T1-722&10

04 1 Why Study Programming Languages? T1-14

05,06 2 Compilation and Interpretation, Programming

Environments, Overview of Compilation

T1-16, 24&25

07 1 Programming Language Syntax: Specifying Syntax:

Regular Expressions

T1-41&42

08,09 2 Context-Free Grammars, Scanning T1-46&51

10 1 Parsing, Theoretical Foundations T1-67

UNIT-II

11 1 Names, Scopes, and Bindings:The Notion of Binding

Time

T1-111&112

12 1 Object Lifetime and Storage Management T1-114

13 1 Scope Rules, Implementing Scope, The Meaning of

Names within a Scope

T1-121&144

14 1 The Binding of Referencing Environments T1-151

15 1 Macro Expansion, Separate Compilation T1-159

UNIT-III

16 1 Semantic Analysis:The Role of the Semantic

Analyzer

T1-175&176

17,18 2 Attribute Grammars, Evaluating Attributes T1-180&182

19 1 Action Routines T1-191


20 1 Space Management for Attributes T1-196

21 1 Decorating a Syntax Tree T1-197

UNIT-IV

22 1 Control Flow: Expression Evaluation T1-219&220

23 1 Structured and Unstructured Flow T1-241

24 1 Sequencing, Selection T1-246&247

25 1 Iteration, Recursion T1-256&270

26 1 Non determinacy

T1-277

UNIT-V

27 1 Data Types:Type Systems T1-289&290 28,29 2 Type Checking T1-303

30 1 Records (Structures) and Variants (Unions) T1-317

31 1 Arrays, Strings T1-325&342

32,33 2 Sets, Pointers and Recursive Types T1-344&345

34 1 Lists, Files and Input/ Output T1-364&367

35 1 Equality Testing and Assignment T1-368

UNIT-VI 36 1 Subroutines and Control Abstraction:

Review of Stack Layout, Calling Sequences

T1-

383,384&386

37 1 Parameter Passing T1-393

38 1 Generic Subroutines and Modules T1-410

39 1 Exception Handling T1-418

40,41 2 Co routines, Events T1-428&434

42

1 Concurrency: Concurrent Programming

Fundamentals

T1-586

43 1 Implementing Synchronization T1-603

44 1 Language-Level Mechanisms T1-619

45 1 Message Passing T1-637

46 1 Run-time Program Management: Late Binding of

Machine Code

T1-784

47 1 Inspection/Introspection T1-799

UNIT –VII

48 1 Data Abstraction and Object Orientation: Object-Oriented Programming

T1-449&451

49,50 2 Encapsulation and Inheritance T1-460

51 1 Initialization and Finalization T1-469

52 1 Dynamic Method Binding T1-478

53 1 Multiple Inheritance T1-491

UNIT-VIII

54 1 Functional Languages: Functional Programming Concepts

T1-507

55 1 A Review/Overview of Scheme

T1-509

56,57 2 Evaluation Order Revisited T1-521

58 1 Higher-Order Functions, Theoretical Foundations T1-530&534

59 1 Logic Languages: Logic Programming Concepts,

T1-546

60 1 Prolog T1-547

61 1 Theoretical Foundations T1-566

62 1 Logic Programming in Perspective T1-566


TEXT BOOKS:

1. Programming Language Pragmatics, 3/ e, Michael Scott, Elsevier, Morgan Kaufmann,2009

2. Concepts of Programming languages, Sebesta, 8/ e, PEA

REFERENCE BOOKS:

1. Programming Languages Design and Implementation , 4/e Pratt , Zelkowitz, PHI

2. Programming Languages ,Louden, 2 /e, Cengage,2003

3. Fundamentals of Programming languages, Horowitz, Galgotia




SUBJECT : OBJECT ORIENTED PROGRAMMING THROUGH JAVA

Syllabus

UNIT-I:

Basics of Object Oriented Programming(OOP) :- Need for oop paradigm, A way of viewing world –Agents,

responsibility, messages, methods, classes and instances, class hierarchies (Inheritance),method binding,

overriding and exceptions, summary of oop concepts, coping with complexity, abstraction mechanisms.

UNIT-II:

Java Basics - Data types, variables, scope and life time of variables, arrays, operators, expressions, control

statements, type conversion and casting, simple java program, classes and objects – concepts of classes,

objects, constructors, methods, access control, this keyword, garbage collection, overloading methods and

constructors, parameter passing, recursion, string handling.

UNIT-III:

Inheritance –Hierarchical abstractions, Base class object, subclass, subtype, substitutability, forms of

inheritance-specialization, specification, construction, extension, limitation, combination, benefits of

inheritance, costs of inheritance. Member access rules, super uses, using final with inheritance, polymorphism,

abstract classes.

UNIT-IV:

Packages and Interfaces :Defining, Creating and Accessing a Package, Understanding CLASSPATH,importing

packages, differences between classes and interfaces, defining an interface, implementing interface, applying

interfaces, variables in interface and extending interfaces.

UNIT-V:

Exception handling and multithreading -Concepts of exception handling, benefits of exception handling,

Termination or presumptive models, exception hierarchy, usage of try, catch, throw, throws and finally, built in

exceptions, creating own exception sub classes. Differences between multi threading and multitasking, thread

life cycle, creating threads, synchronizing threads, daemon threads, thread groups.

UNIT-VI:

Applets – Concepts of Applets, differences between applets and applications, life cycle of an applet, types of

applets, creating applets, passing parameters to applets, Apple to Applet communication, Secure applet.

UNIT-VII:

Event Handling : Events, Event sources, Event classes, Event Listeners, Delegation event model, handling

mouse and keyboard events, Adapter classes, inner classes. The AWT class hierarchy, user interface

components- labels, button, canvas, scrollbars, text components, check box, check box groups, choices, lists

panels – scrollpane, dialogs, menubar, graphics, layout manager – layout manager types – boarder, grid, flow,

card and grid bag.

UNIT-VIII:

Swing – Introduction, limitations of AWT, MVC architecture, components, containers, exploring swing-JApplet,

JFrame and JComponent, Icons and Labels, text fields, buttons – The JButton class, Check boxes,Radio buttons,

Combo boxes, Tabbed Panes, Scroll Panes, Trees, and Tables.

Prerequisites


Outlook on procedure oriented language like c.

Outlook on problem solving techniques

Course objective

1. Understand fundamentals of programming such as variables, conditional and iterative

execution, Java Buzz words methods, etc.

2. Understand fundamentals of object-oriented programming in Java, including defining

classes, invoking methods, using class libraries, etc.

3. Have the ability to write a computer program to solve specified problems.

4. Be able to use the Java SDK environment to create, debug and run simple Java programs

Course outcomes

After completion of the course the student should be able to gain the knowledge to implement object

oriented conspectus in java

Plan:

S.No. No. of

Hours Date Topic(s) to be covered


Page Numbers)

Remarks

UNIT – I – Basics of Object Oriented Programming T1-15

1 1 Importance of Subject: OOPS & Java, Need for OO Paradigm

T1-16,T1-105,T1-109

2 1 OOP Principles, Classes, Objects, Abstraction, Encapsulation

T1-111,T1-157,T1-16,T1-

171,T1-205

3 1 Methods, Instances, Inheritance, Polymorphism, Overriding and Exceptions

T1-15

UNIT – II – Java Basics

4 1 Java Overview, Java Buzzwords, Simple Java Program,

Compiling and running of simple Java program T1-10,T1-21

5 1 Tutorial

6 1 Data types, Variables, Operators T1-33

7 1 Scope and life time of variables, Expressions T1-42,T1-47

8 2 Control Statements, Methods T1-77,T1-111

9 1 Tutorial

10 1 Arrays T1-48

11 1 Type Conversion and Casting, Wrapper Classes T1-45,

12 1 Concepts of Classes and Objects, Declaring Classes

and Objects, Access Control T1- 105,T1-109,T1-138

13 1 Constructors, this, super, garbage collection T1-117,T1-120,T1-121

14 1 Tutorial

15 1 Overloading and Overriding of methods and

Constructors T1-127,T1-125

16 1 Parameter Passing, Recursion T1-130,T1-135

17 1 String Handling – String, StringBuffer T1-148

18 1 Practice Exercises


19 1 Tutorial

UNIT – III - Inheritance

20 1 Basic concepts, Member access rules T1-157,

21 1 Forms of Inheritance, Benefits of Inheritance T1-167

22 1 Method Overriding, Abstract classes, Usage of this, super keyword

T1-177,T1-157, T1-120

23 1 Dynamic method dispatch (Polymorphism), Using final with inheritance

T1-174,T1-180

24 1 Tutorial

UNIT – IV - Packages and Interfaces

25 1 Defining, Creating and Accessing a Package T1-183,T1-186

26 1 Understanding CLASSPATH, Importing Packages T1-184,T1-190

27 1 Differences between Classes and Interfaces, Defining an Interface, Implementing an Interface

T1-193,T1-194

28 1 Applying interfaces, variables in interface and extending interfaces

T1-197,T1-200,T1-202

29 1 Tutorial

29 1 Java.lang Package, Java.util Package

30 1 Java.io Package

31 1 Discuss Old Question Papers


33 1 Tutorial

UNIT –V - Exception Handling and Multithreading

34 1 Exception Handling and Multithreading: Concepts of Exception handling, Benefits of Exception Handling, Termination or Presumptive models

T1-205

35 1 Usage of try, catch, throw, throws and finally, Exception Hierarchy

T1-206

36 1 Built-in Exceptions, Creating own Exception sub classes.

T1-216,T1-217

37 1 Tutorial

38 1 Concepts of Multithreading, Differences between Multitasking and Multithreading.

T1-223

39 1 Thread life cycle, Creating Threads T1-228

40 1 Synchronization, thread priorities, inter thread communication

T1-238,T1-236,T1-242


41 1 Daemon threads, Thread groups T1-251,T1-252

42 1 Tutorial

UNIT –VI - Applets

43 1 Concepts of Applets, differences between applets

and applications. T1-296,

44 1 Life cycle of an applet, Types of applets. T1-620,

45 1 Creating applets, Passing parameters to applets. T1-630

46 1 Applet to Applet communication, Secure Applet T1-634

47 1 Tutorial

UNIT –VII – Event Handling

48 1 AWT Class Hierarchy, Concepts of Components, Containers- Panel, Window, Frame, Canvas.

T1-664,T1-666,T1-667

49 1 Buttons, Labels, Text Components T1-704,T1-719

50 1 Events, Event sources, Event classes, Event Listeners T1-638,T1-639

51 1 Delegation Event model, Handling Mouse, Keyboard , Window events

T1-653,T1-659

52 1 Adapter classes, inner classes T1-660,T1-662

53 Tutorial

54 1 Checkbox, Checkbox groups T1-709

55 1 Choice, Lists, Scrollbars, Menus, Graphics, Dialog T1-711,T1-

717,T1-737,T1-742

56 1 Layout Managers – Flow, Border, Grid T1-724,T1-725,T1-728

57 1 Layout Managers – Card, Grid Bag T1-730,T1-732

58 1 Tutorial

UNIT –VIII – Swing

59 1 Introduction, Limitations of AWT, MVC Architecture,

Components, Containers T1-859,T1-861

60 1 JApplet, JFrame and JComponent, Icons and Labels T1-862

61 1 Text Fields, Buttons, Checkboxes, Radio Buttons,

Combo boxes, Tabbed Panes, Scroll Panes. T1-881

62 1 Trees and Tables T1-900,T1-904

63 1 Tutorial


TEXT BOOKS

1. Java; the complete reference, 7/e, Herbert schildt, TMH. 2. Java: How to Program, 8/e, Dietel, Dietel, PHI

REFERENCES

1. Learn Object Oriented Programming using Java, Venkateswarlu, E V Prasad, S. Chand 2. Programming in Java 2, Dr. K Soma Sundaram, JAICO Publishing house 3. Object Oriented Programming through Java, P. Radha Krishna,University Press.






SUBJECT : COMPUTER ORGANIZATION AND ARCHITECTURE

Syllabus UNIT I: A Brief History of Computers: Von Neumann Machine, Designing for performance ,Evolution of Intel x86 Architecture, computer components, Computer functions, bus inter connection, PCI Configuration. ALU, 2’complemented multiplication(Booth’s Algorithm) and division, floating point Adders/ Subtracters. UNIT II: Machine Instruction set: Addressing Modes, 8086 addressing Modes, Instruction Formats, Processor Organization, register organization, instruction cycle UNIT III: Instruction pipelining: Pipelining Hazards, Dealing with Branches, 8086 Processor Family, Reduced Instruction Set Computers : Instruction Execution Characteristics, large Register Files, RISC Architecture UNIT IV: Processor Control Unit: Micro-Operations, Control of the Processor, 8085 Architecture , instruction set and assembly language programming, hardwired Implementation UNIT V: Micro Program Control: Micro Instruction Sequencing, Taxonomy of Micro Instructions, Micro Instruction Execution, Nanoprogramming. UNIT VI: Internal Memory: Semiconductor main memory, DRAM, SRAM, DRAM organization,Types of ROMs, cache memory principles ,Elements of cache Design, Cache organization, Magnetic disk, Physical characteristics of disk systems, compact disk, memory hierarchy, concepts of partitioning, paging, virtual memory, demand paging, and segmentation. UNIT VII: Input/ Output: External devices, I/O modules, I/o addressing, programmed I/O, Interrupt driven I/O, DMA, I/O channel and processors. UNIT VIII: Parallel Processing: Multiple Processors, Symmetric Multiprocessors, Cache Coherence, Concepts of Multithread and Approaches to explicit multi threading, Nonuniform Memory Access, Approaches to Vector Computation, Concepts of Multicore Computers, 8086 Multicore Organization Prerequisites Students should be familiar with the basic concepts of computer hardware and software. Beginners can study the key computer organization and architecture concepts.

Course Objective

Understand how a modern CPU works

Learn the fundamentals behind program execution

Review the historical development of computers and computer architectures.

Understand information representation, error detection/correction schemes and digital

logic.

Identify the basic components of computer organization and understand how they work

together.

Learn the format of instruction sets and the operation of the instruction cycle.


Survey the hierarchical internal and external memory organization strategies.

Recognize current superscalar microprocessor and multiprocessor models in today's market

Course Outcomes

At the end of the course a student will be able to:

Purse his study in advanced computer organization and architecture.

Be familiar with contemporary issues in computer organization and architecture

Plan

S.No No. of Hours.

Date Topic(s) to be Planned Reference (Books

with page numbers)

Remarks

UNIT-I(A Brief History of Computers)

1 2 Von Neumann Machine T1: 17-38 R1:19-21

2 1 Designing for performance T1: 38-44

3 2 Evolution of Intel x86 Architecture,

Computer Components

T1: 44-46

T1: 66-68

4 2 Computer functions, Bus inter connection T1: 68-83

T1: 83-94

5 1 PCI Configuration. T1: 95-104

6 2 ALU,2’complemented multiplication (Booth’s Algorithm) and division, floating point Adders/ Subtracters.

T1: 306-342

R1:367-402

7 1 Assignment-A1 Discussion PPT presentation

UNIT-II(Machine Instruction set)

8 2 Addressing Modes, 8086 addressing Modes T1: 401-413

R1:48-57

9 2 Instruction Formats T1: 413-426

10 2 Processor Organization, Register organization T1: 433-440

11 1 Instruction cycle T1: 440-444

12 1 Assignment-A2 discussion PPT presentation

UNIT-III(Instruction Pipelining)

13 2

Pipelining Hazards, Dealing with Branches

T1: 444-461

R1:453-478

14 2 8086 Processor Family T1: 461-469

15 2

Reduced Instruction Set Computers : Instruction Execution Characteristics

T1: 482-487

16 1 Large Register Files T1: 487-492

17 2 RISC Architecture T1: 494-500


UNIT-IV(Processor Control Unit)

19 1

Micro-Operations T1: 563-569

20 2 Control of the Processor,

8085 Architecture T1: 569-581


21 2 Instruction set and assembly language

programming,

T1: 426-428

R1:58-64

22 1 Hardwired Implementation

T1: 581-584

R1:425-444

23 1

Assignment-A4 discussion PPT presentation

UNIT-V(Micro Program Control)

24 2 Micro Instruction Sequencing T1: 596-602

R1:37-47

25 2

Taxonomy of Micro Instructions T1: 614-624

26 1

Micro Instruction Execution T1: 602-614

27 1

Nanoprogramming T1: 000

28 1

Assignment-A5 discussion PPT presentation

UNIT-VI(Internal Memory)

29 2 Semiconductor main memory, DRAM, SRAM,

DRAM organization,

T1: 159-168

T1: 173-179

30 1

Types of ROMs T1: 409-411

R1:309-313

31 2 Cache memory principles, Elements of cache

Design

T1: 118-121 T1:

121-140

32 1

Cache organization T1: 140-145

33 1 Magnetic disk, Physical characteristics of disk

systems T1: 185-194

34 1

Compact disk T1: 206-210

35 2 Memory hierarchy, Concepts of partitioning,

Paging, Virtual memory, Demand paging and Segmentation

T1: 277-288

R1:337-358


UNIT-VII(Input/ Output)

37 1 External devices, I/O Modules, I/O Addressing T1: 219-224

38 2 Programmed I/O T1: 224-228

39 1 Interrupt driven I/O T1: 228-236

R1:208-223

40 1 DMA T1: 236-242

R1:234-239

41 1 I/O channel and processors T1: 242-244


UNIT-VIII(Parallel Processing)

43 1 Multiple Processors, Symmetric

Multiprocessors T1: 630-640

44 1

Cache Coherence T1: 640-645


45 2 Concepts of Multithread and Approaches to explicit multi threading

T1: 646-653

46 1

Nonuniform Memory Access T1: 660-663

47 1 Approaches to Vector Computation, Concepts

of Multicore Computers T1: 664-676

48 2 8086 Multicore Organization T1: 694-699


50 Revision

TEXT BOOKS

T1. Computer Organization and Architecture, William Stalling, 8/e, PHI. REFERENCE BOOKS

1. Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky, 5/e, TMH. 2. Computer Systems Architecture and Organization, John D. Carpinelli, PEA 3. Computer Architecture and Organization,3/e, John P. Hayes, TMH




SUBJECT : DATA BASE MANAGEMENT SYSTEMS

Syllabus

UNIT I : Introduction: Data base System Applications, data base System VS file System, View of Data, Data Abstraction, nstances and Schemas, data Models, the ER Model, Relational Model ,Other Models,Database Languages : DDL, DML, database Access for applications Programs ,data base Users and Administrator ,Transaction Management ,data base System Structure , Storage Manager, the Query Processor UNIT II : History of Data base Systems: Data base design and ER diagrams, Beyond ER Design Entities, Attributes and Entity sets, Relationships and Relationship sets, Additional features of ER Model, Concept Design with the ER Model ,Conceptual Design for Large enterprises. UNIT III : Introduction to the Relational Model: Integrity Constraint Over relations , Enforcing Integrity constraints , Querying relational data, Logical data base Design , Introduction to Views , Destroying /altering Tables and Views. Relational Algebra: Selection and projection set operations , renaming, Joins , Division , Examples of Algebra overviews Relational calculus: Tuple relational Calculus UNIT IV : Form of Basic SQL Query: Examples of Basic SQL Queries, Introduction to Nested Queries ,Correlated Nested Queries Set ,Comparison Operators, Aggregative Operators, NULL values , Comparison using Null values, Logical connectivity’s, AND, OR and NOT, Impact on SQL Constructs , Outer Joins, Disallowing NULL values, Complex Integrity Constraints in SQL Triggers and Active Data bases. UNIT V : Schema Refinement : Problems Caused by redundancy, Decompositions , Problem related to decomposition , reasoning about FDS, FIRST, SECOND, THIRD Normal forms, BCNF ,Lossless join Decomposition, Dependency preserving Decomposition, Schema refinement in Data base Design, Multi valued Dependencies, FORTH Normal Form. UNIT VI : Transaction Concept: Transaction State- Implementation of Atomicity and Durability,Concurrent Executions, Serializability, Recoverability ,Implementation of Isolation, Testing for serializability, Failure classification,Storage,Recovery and Atomicity,Recovery algorithm. UNIT VII : Storage and Indexing : Data on External Storage , File Organization and Indexing, Cluster Indexes, Primary and Secondary Indexes , Index data Structures , Hash Based Indexing :Tree base Indexing ,Comparison of File Organizations ,Indexes and Performance Tuning. UNIT VIII : Tree Structured Indexing : Intuitions for tree Indexes, Indexed Sequential Access Methods (ISAM), B+ Trees: A Dynamic Index Structure.

Prerequisites:

Familiarity with the concepts of File Handling System.


Course Objectives:

The main objective of this course is to provide students with the background to design, implement, and use

database management systems . It also provides an introduction to the management of database systems.

The course emphasizes the understanding of the fundamentals of relational systems including data models,

database architectures, and database manipulations

Course Outcomes: Upon the completion of this course, students should:

Understand terms related to database design and management

Understand the objectives of data and information management

Understand the database development process

Understand the relational model and relational database management system

Assess data and information requirements

Construct conceptual data models

Develop logical data models

Evaluate the normality of a logical data model, and correct any anomalies

Understand database performance issues

Work as a valuable member of a database design and implementation team. Plan:

S.No. No. of

Hours Date Topic(s) to be Planned

Reference (Books

with page

numbers)

Remarks

UNIT – I

1 1 Introduction to Data, Database & DBMS T2-1

2 2 Database System applications, Database system VS file system

T2-1, T1-8

3 3 View of Data, Data abstraction T2-5

4 4 Instances and schemas T2-7

5 5 Data models, ER model, Relational model, other models

T2-8

6 6 Database languages- Data Definition Language, Data Manipulation Language

T2-9,10

7 7 Database access for application programs T2-13

8 8 Database users and administrator, transaction management

T2-26,22

9 9 Database system structure, storage manager, the query processor

T2-24

T2-20,21

10 10 Tutorial

UNIT – II

11 11 History of Data base Systems T2-28

12 12 Database design and ER diagrams, Beyond ER design entities

T1-26,27

13 13 Entities, Attributes and Entity sets T1-28


14 14 Relationships and relationship sets T1-29

15 15,16 Additional features of ER model T1-32

16 17 Conceptual Design with ER Model T1-40

17 18 Conceptual design for large enterprises T1-46

18 19 Tutorial

UNIT – III

19 20 Introduction to the Relational Model T1-59

20 21,22 Integrity constraint over relations, Enforcing integrity constraints

T1-63,69

21 23 Querying relational data T1-73

22 24,25 Logical database design T1-74

23 26 Introduction to views T1-86

24 27 Destroying/altering tables and views T1-91

25 28 Relational algebra, Selection and projection, set operations, renaming

T1-102,103,104 T1-106

26 29,30 Joins, Division, Examples of algebra T1-107,109,110

27 31 Relational calculus-Tuple relational calculus T1-116,117

28 32 Tutorial

UNIT – IV

29 33 Form of basic SQL query, Examples T1-133

30 34 SQL queries and examples T1-138

31 35 Introduction to nested queries, correlated nested queries.

T1-145,147

32 36 Set- Comparison operators, aggregate operators T1-148,151

33 37 NULL values, comparison using null values, logical connectivity-AND, OR and NOT

T1-162,163

34 38 Impact on SQL Constructs,Outer Joins, Disallowing NULL values

T1-163,164,165

35

39,40 Complex integrity constraints in SQL, triggers and Active databases

T1-165,168

36 41 PL/SQL T1-168

37 42 Tutorial

UNIT – V

38 43 Schema Refinement, problems caused by redundancy. Decompositions, problems related to decompositions.

T1-606,608,609

39 44.45 Reasoning about FDs, First, second and third normal forms

T1-611,612,617

40 46 BCNF T1-615


41 47 Lossless join decomposition, dependency preserving decomposition

T1-619,621

42 48 Schema refinement in Database design T1-629

43 49 Multi valued dependencies T1-634

44 50 Fourth Normal Form T1-636

45 51 Tutorial

UNIT – VI

46 52 Transaction concept, Transaction state T2-609,612

47 53 Implementation of atomicity and durability T2-615

48 54 Concurrent executions T2-617

49 55 Serializability, Recoverability T2-620,626

50 56 Implementation of isolation, Testing for serializability

T2-627,628

51 57 Failure Classification, Storage T2-683,684

52 58,59 Recovery and Atomicity T2-688

53 60 Recovery Algorithm T2-709

54 61 Tutorial

UNIT – VII

55 62 Data on External Storage, File Organization and Indexing

T1-274,275

56 63 Cluster Indexes, Primary and Secondary indexes. T1-277

57 64 Index data Structures, Hash Based Indexing, Tree

base Indexing T1-278,279,280

58 65 Comparison of File Organizations, Indexes and

Performance Tuning T1-282,291

59 66 Tutorial

UNIT-VIII

60 67 Intuitions for tree Indexes, Indexed Sequential Access Methods (ISAM)

T1-339,341

61 68,69 B+ Trees: A Dynamic Index Structure T1-344

62 70 Tutorial

TEXT BOOKS : T1. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGraw- Hill 3rd Edition T2. Data base System Concepts, Silberschatz, Korth, McGraw hill, V edition. REFERENCES : R1. Data base Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7th Edition. R2. Fundamentals of Database Systems, Elmasri Navrate Pearson Education R3. Introduction to Database Systems, C.J.Date Pearson Education




SUBJECT : AUTOMATA THEORY & COMPILER DESIGN

Syllabus

UNIT I: Formal Language and Regular Expressions: Languages, operations on languages, regular expressions (re), languages associated with (re), operations on (re), Identity rules for (re), Finite Automata: DFA, NFA, Conversion of regular expression to NFA, NFA to DFA. Applications of Finite Automata to lexical analysis, lex tools. UNIT II: Context Free grammars and parsing: Context free Grammars, Leftmost Derivations, Rightmost Derivations, Parse Trees, Ambiguity Grammars,Top-Down Parsing, Recursive Descent Parsers: LL(K) Parsers and LL(1) Parsers. UNIT III: Bottom up parsing: Rightmost Parsers: Shift Reduce Parser, Handles, Handle pruning, Creating LR (0) Parser, SLR (1) Parser, LR (1) & LALR (1) Parsers, Parser Hierarchy, Ambiguous Grammars, Yacc Programming Specifications. UNIT IV: Syntax Directed Translation: Definitions, construction of Syntax Trees, S-attributed and L-attributed grammars, Intermediate code generation, abstract syntax tree, translation of simple statements and control flow statements. UNIT V: Semantic Analysis: Semantic Errors, Chomsky hierarchy of languages and recognizers, Type checking, type conversions, equivalence of type expressions, Polymorphic functions, overloading of functions and operators. UNIT VI: Storage Organization: Storage language Issues, Storage Allocation, Storage Allocation Strategies, Scope, Access to Nonlocal Names, Parameter Passing, Dynamics Storage Allocation Techniques. UNIT VII: Code Optimization: Issues in the design of code optimization, Principal sources of optimization, optimization of basic blocks, Loop optimization, peephole optimization, flow graphs, Data flow analysis of flow graphs. UNIT VIII: Code Generation: Issues in the design of code Generation, Machine Dependent Code Generation, object code forms, generic code generation algorithm, Register allocation and assignment, DAG representation of basic Blocks, Generating code from DAGs. Prerequisites:

Must know the programming concepts, regular grammar and expressions. Course Objective:

Recognize the underlying formal models such as finite state automata, push-down automata and their connection to language definition through regular expressions and grammars.

Discuss the effectiveness of optimization.

Describe the steps and algorithms used by language translators.

Explain the impact of a separate compilation facility and the existence of program libraries on the compilation process.


Course Outcomes:

Understand how the design of a compiler requires most of the knowledge acquired during their study.

Develop a firm and enlightened grasp of concepts learned earlier in their study like higher level programming, assemblers, automata theory, and formal languages, languages, languages specifications, data structure and algorithms, operating systems.

Apply the ideas, the techniques, and the knowledge acquired for the purpose of other software design.

Working skills in theory and application of finite state machines, recursive descent, production rules, parsing, and language semantics.

Know about the powerful compiler generation tools, which are useful to the other non-compiler applications.

Plan:

S.No No of Hours

Date Topic(s) to be Planned


page numbers)

Remarks

UNIT - I

1 1 Languages, Strings Alphabets T2: 1-2

2 2 Operations on Languages and strings T1: 44-47

3 3 Regular expressions T1: 59-62

4 4 Finite Automata – DFA, NFA T1: 34-53

5 5 Conversion of regular expression to NFA T3: 159-162

6 6 NFA to DFA. T3: 152-154

7 7,8 Applications of Finite Automata to lexical analysis

T2: 45-46

8 9 Lex tools

UNIT – II

9 10 Context free grammars T3: 197-98

10 11 Derivation T3: 199-200

11 12 Parse trees T3: 201-202

12 13,14 Ambiguity in derivation trees T3: 203

13 15 LL(K) grammars and

T3: 222-225

14 16 LL(1) parsing

15 17 Recursive parser T3: 219

16 18 Predictive parser

T3:226-227

17 19 Non recursive predictive parser

UNIT – III

18 20 Bottom up parsing T3: 233-234


19 21 Handle pruning T3: 235

20 22 LR Grammar Parsing T3 : 241-251

21 23 SLR Parsing

T3: 252-255

22 24 CLR Parsing

23 25 LALR parsing T3: 266-274

24 26 parsing ambiguous grammars T3: 278-285

25 27 YACC programming specification T3: 287-295

UNIT – IV

26 28 Syntax directed translation T3: 304-309

27 28 S-attributed and

T3: 312-314

28 29 L-attributed grammars

29 30 Intermediate code, Types of Intermediate code

T3: 370-378

30 31 Abstract syntax tree

31 32 Translation of simple statements T3: 378-383

32 33 Control flow statements T3: 399-108

UNIT – V

33 34 Context Sensitive features T2: 233-228

34 35,36 Chomsky hierarchy of languages & Recognizers. T2: 217-232

35 37 Type checking, Type conversions

T3: 386-389

36 38 equivalence of type expressions

37 39 Overloading functions and operations T3: 390

UNIT- VI

38 40,41 Storage organization T3: 427-429

39 42 Storage types

T3:430-440

40 43 Storage allocation strategies

41 44 Scope access to non local names

T3: 441-448

42 45,46 Parameters

43 47 Language facilities for dynamics storage allocation T3: 429

UNIT - VII

44 48 Optimization, Principal sources of optimization T3: 584:592


45 49 Optimization of basic blocks T3: 533-540

46 50 Peephole optimization T3: 549-552

47 51 Flow graphs, Data flow graphs

T3: 529-530

48 52 Representation of DFD

49 53,54 Analysis of flow graphs T3: 597-610

UNIT – VIII

50 55 Machine dependent code generation T3: 505

51 56 Modes of Generation

T3: 507-512

52 57,58 Object code form

53 59 Generic code generation algorithm T3: 544

54 60 Register allocation and assignment

T3: 553-556

55 61 Using DAG representation of Block

56 62 Properties of DAG, Implementation of DAG

TEXT BOOKS:

1. Introduction to Automata Theory Languages & Computation, 3/e, Hopcroft, Ullman, PEA

2. Compilers Principles, Techniques and Tools, Aho, Ullman, Ravi Sethi, PEA

REFERENCE BOOKS:

1. Principles of Compiler Design, A.V. Aho . J.D.Ullman; PEA 2. Theory of Computer Science, Automata languages and computation , 2/e, Mishra, Chandra Shekaran,

PHI

3. Elements of Compiler Design, A.Meduna, Auerbach Publications, Taylor and Francis Group.

shri vishnu engineering college for women :: · pdf file... bhimavaram department of...

Documents