Course Handouts (2017 18)

Department of

Computer Science & Engineering

III B.Tech. - I Semester

Course Handouts (2017 – 18)

Name of the student

Roll No.

Kallam Haranadhareddy Institute of Technology NH-5, Chowdavaram, Guntur-522 019

Approved by AICTE, New Delhi; Affiliated to JNTUK, Kakinada) Accredited by NAAC with ‘A’ Grade & An ISO 9001:2015 Certified Institution

Dept. of CSE, Kallam Haranadhareddy Institute of Technology, Guntur - 19 Page 1

INDEX

Sl. No. Description Page No.

1. College Vision & Mission 2

2. Department Vision & Mission 2

3. Program Educational Objectives (PEOs) 2

4. Graduate Attributes (GAs) 2

5. Program Outcomes (POs) 3

6. Program Specific Outcomes (PSOs) 3

7. JNTUK Academic Calendar 4

8. Department Academic Process Calendar 5

9. Course Structure 6

10. Evaluation Pattern 6

11. Quality of Internal Question Papers and Assignment Questions 7

12. Timetable 8

13. Full Details of All Theory & Lab Courses as per Course Structure 9

Theory: CD, DC, PPL, DBMS, OS

Labs: CD, OS & LP, DBMS

14. Non-Programming Laboratory Courses Assessment Guidelines 50

15. Programming Laboratory Courses Assessment Guidelines 51

16. Laboratory Course Evaluation Rubrics 52


COLLEGE VISION & MISSION Institute Vision:

To be a quality - oriented technical institution known for global academic excellence

and professional human values

Institute Mission:

To provide quality instruction with competent and knowledgeable faculty and well -

equipped laboratories to meet global standard

To achieve academic distinction through novel teaching and learning practice

To encourage students by providing merit scholarships

To prepare the graduates to accomplish professional practice,

employability, entrepreneurial development and higher education

To inculcate self-discipline, accountability and values in the learners for effective and

informed citizenship

To focus on MoUs with premier institutes and renowned industries for effective industry-

institution interaction to become an R&D centre through skill development professional up-

gradation and innovation

DEPARTMENT VISION & MISSION CSE Vision:

To impart quality technical education to students in the field of computer science and

engineering to produce technically competent software and hardware personnel with advanced

skills, knowledge and behavior to meet the global computational challenges

CSE Mission:

Providing strong theoretical and practical knowledge to students.

Providing students with training on latest technologies to meet the industry needs.

Developing ethical values in students to lead the life with good human values

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

PEO1: Graduates shall effectively apply mathematics, science and engineering methodologies

for analysis, design and implementation of real world problems.

PEO2: Graduates utilize breadth and depth of theoretical computer science to adopt emerging

technologies and tools for changing needs of industry or for pursuing higher studies.

PEO3: Graduates shall continue to enhance technical skills through lifelong learning, exhibit

social and ethical responsibilities and effective communication skills.

PEO4: Graduates shall be employed in software and hardware industries or pursue higher

studies or research or become entrepreneurs

Graduate Attributes (GAs) prescribed by NBA:

i. Engineering Knowledge

ii. Problem Analysis

iii. Design & Development of Solutions

iv. Investigation of Complex Problem

v. Modern Tools Usage

vi. Engineer and Society

vii.Environment & Sustainability


viii. Ethics

ix. Individual & Team work

x. Communication

xi. Lifelong Learning

xii.Project management & Finance

(A) PROGRAM OUTCOMES (POs)

Engineering Graduates will be able to:

PO 1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering

problems.

PO 2: Problem analysis: Identify, formulate, review research literature, and analyze complex

engineering problems reaching substantiated conclusions using first principles of mathematics,

natural sciences, and engineering sciences.

PO 3: Design/development of solutions: Design solutions for complex engineering problems

and design system components or processes that meet the specified needs with appropriate

consideration for the public health and safety, and the cultural, societal, and environmental

considerations.

PO 4: Conduct investigations of complex problems: Use research-based knowledge and

research methods including design of experiments, analysis and interpretation of data, and

synthesis of the information to provide valid conclusions.

PO 5: Modern tool usage: Create, select, and apply appropriate techniques, resources, and

modern engineering and IT tools including prediction and modeling to complex engineering

activities with an understanding of the limitations.

PO 6: The engineer and society: Apply reasoning informed by the contextual knowledge to

assess societal, health, safety, legal and cultural issues and the consequent responsibilities

relevant to the professional engineering practice.

PO 7: Environment and sustainability: Understand the impact of the professional

engineering solutions in societal and environmental contexts, and demonstrate the knowledge

of, and need for sustainable development.

PO 8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities

and norms of the engineering practice.

PO 9: Individual and team work: Function effectively as an individual, and as a member or

leader in diverse teams, and in multidisciplinary settings.

PO 10: Communication: Communicate effectively on complex engineering activities with the

engineering community and with society at large, such as, being able to comprehend and write

effective reports and design documentation, make effective presentations, and give and receive

clear instructions.

PO 11: Project management and finance: Demonstrate knowledge and understanding

of the engineering and management principles and apply these to one’s own work, as a

member and leader in a team, to manage projects and in multidisciplinary environments.

PO 12: Life-long learning: Recognize the need for, and have the preparation and ability to

engage in independent and life-long learning in the broadest context of technological change

(B)PROGRAM SPECIFIC OUTCOMES (PSOs) PSO 1: To use mathematical methodologies to crack problem using suitable mathematical

analysis, data structure and suitable algorithm.

PSO 2: The ability to interpret the fundamental concepts and methodology of computer

systems. Students can understand the functionality of hardware and software aspects of

computer systems.


PSO 3: The ability to grasp the software development lifecycle and methodologies of software

systems. Possess competent skills and knowledge of software design process. Familiarity and

practical proficiency with a broad area of programming concepts and provide new ideas and

innovations towards research

JNTU Academic Calendar for B.Tech 2015 Batch


DEPARTMENT ACADEMIC PROCESS CALENDAR

Academic Year: 2017-18 Sem: I

S. No. Academic Schedule B.Tech II & III Year B.Tech IV Year

1. Commencement of class work (I sem) 12-06-2017

19-06-2017

2. I mid examinations 07-08-2017 to 12-08-2017 14-08-2017 to 19-08-2017

3. II mid examinations 09-10-2017 to 14-10-2017 16-10-2017 to 21-10-2017

4. End examinations 23-10-2017 to 04-11-2017 30-10-2017 to 11-11-2017

5. Commencement of class work (II sem) 20-11-2017 27-11-2017

6. I mid examinations 15-01-2018 to 20-01-2018 22-01-2018 to 27-01-2018

7. II mid examinations 19-03-2018 to 24-03-2018 26-03-2018 to 31-03-2018

8. End examinations 02-04-2018 to 14-04-2018 09-04-2018 to 21-04-2018

S. No. Department Events Tentative Month, Day

1. National Technical symposium Sankalap-2017 (15th & 16th September )

2. Parents Meet 05/10/2017 & 04/03/2018

3. Attendance Dis play 31st of every month

4. Industrial v is it December 3rd & January 1st week 2018

5. Industrial t raining In summer vacation

6. Mini-projects As per course schedule

7. Guest lectures June, Sept & Dec-2017 & Feb-2018

8. Counseling July,Sept,Dec-2017 & march-2018

9. FDP, Work Shop, Conference Nov-2017 & Ma rch-2018

10. Students feedback Semester

11. Engineer’s Day 15th Sep, 2017

12. Annual Day March-2018, 1st Week

13. Sports Day Sankalap-17

14. NSS Activities

15.

1) Blood Ca mp Feb-2018

2) Medical Ca mp Jan-2018

3) Inkuduguntalu Nov-2017

4) Tree plantation Dec-2017

5) 5K/ 10K run Jan- 2018

16. IST E Activities

17. 1) Staff Seminar April-2018

2) Global Warning April-2018

18. College Magazine Nov-2017


B.TECH. COMPUTERSCIENCE AND ENGINEERING

III Year I Semester

COURSE STRUCTURE

S.No Subject

Code

Subject T P C

1 C301 Compiler Design 3+1 - 3

2 C302 Data Communication 3+1 - 3

3 C303 Principles of Programming Languages 3+1 - 3

4 C304 Database Management Systems 3+1 - 3

5 C305 Operating Systems 3+1 - 3

6 C306 Compiler Design Lab - 3 2

7 C307 Operating System & Linux Programming Lab - 3 2

8 C308 Database Management Systems Lab - 3 2

9 C309 Seminar - - 1

TOTAL CREDITS 22

EVALUATION PATTERN Distribution and weightage of marks

(i) The performance of a student in each semester shall be evaluated subject - wise with a

maximum of 100 marks for theory subject and 75 marks for practical subject. The project

work shall be evaluated for 200 marks.

(ii) For theory subjects the distribution shall be 30 marks for Internal Evaluation and 70

marks for the End -Examinations.

(iii) For theory subjects, during the semester there shall be 2 tests. The weightage of

Internal marks for 30 consists of Descriptive - 15, Assignment – 05, Objective – 10

(Conducted at College level with 20 Multiple choice question with a weightage of 1/2

Mark each). The objective examination is for 20 minutes duration. The subjective

examination is for 90 minutes duration conducted for 15 marks. Each subjective type test

question paper shall contain 3 questions and all questions need to be answered. The

Objective examination conducted for 10 marks and subjective examination conducted for

15 marks are to be added to the assignment marks of 5 for finalizing internal marks for

30. The best of two tests will be taken for internal marks. As the syllabus is framed for

6 units, the 1st mid examination (both Objective and Subjective) is conducted in 1-3 units

and second test in 4-6 units of each subject in a semester.

(iv) The end semester examination is conducted covering the topics of all Units for 70

marks. Part - A contains a mandatory question (Brainstorming / Thought provoking/

case study) for 22 marks. Part - B has 6 questions (One from each Unit). The student

has to answer 3 out of 6 questions in Part -B and carries a weightage of 16 marks each.

(v) For practical subjects there shall be continuous evaluation during the semester for 25

internal marks and 50 end examination marks. The Internal 25 marks shall be awarded as

follows: day to day work - 10 marks, Record-5 marks and the remaining 10 marks to be


awarded by conducting an internal laboratory test. The end examination shall be

conducted by the teacher concerned and external examiner.

(vi) For the subject having design and estimation, the distribution shall be 30 marks for

internal evaluation (20 marks for day to day work and 10 marks for internal test) and 70

marks for end examination. There shall be two internal tests in a Semester and the better

of the two shall be considered for the award of marks for internal tests.

(vii) For the seminar, the student shall collect the information on a specialized topic and

prepare a technical report, showing his understanding over the topic and submit to the

department, which shall be evaluated by the Departmental committee consisting of Head

of the department, seminar supervisor and a senior faculty member.

The seminar report shall be evaluated for 50 marks. There shall be no external

examination for seminar.

(viii) Out of a total of 200 marks for the project work, 60 marks shall be for Internal

Evaluation and 140 marks for the End Semester Examination.

The End Semester Examination (Viva-Voce) shall be conducted by the committee. The

committee consists of an external examiner, Head of the Department and Supervisor of

the Project. The evaluation of project work shall be conducted at the end of the IV year.

The Internal Evaluation shall be on the basis of two seminars given by each student on the

topic of his project and evaluated by an internal committee.

(ix) Laboratory marks and the internal marks awarded by the College are not final. The

marks are subject to scrutiny and sealing by the University whenever felt desirable. The

internal and laboratory marks awarded by the College will he referred to a Committee.

The Committee shall arrive at a scaling factor and the marks will be scaled as per the

scaling factor. The recommendations of the Committee are final and binding. The

laboratory records and internal test papers shall be preserved in the respective

departments as per the University norms and shall be produced to the Committees of

University as and when they ask for.

Quality of Internal Question Papers and Assignment Questions

The quality of internal semester question papers and assignments are assessed by the Module

coordinators and classified as per level of difficulty into three levels: Level 1 & 2 – These are the questions that the students “must know” –These questions constitute

the fundamental concepts of a subject and it is mandatory that every student knows these

concepts. Further, these questions are at the lower level of Blooms taxonomy like Remembering and Understanding. Lack of these fundamental concepts would mean that the

student is not fit for passing this course. Level 3 & 4 – These are the questions that the students “Need to Know” – These questions test

the skill of the student at a higher level of Blooms Taxonomy like Applying and Analyzing, the student should be able to apply the fundamental knowledge gained in a course to analyze a typical

problem and arrive at conclusions. Level 5 & 6 – these are the questions that have the status of “Good to know” – These questions test the highest skills levels of Blooms Taxonomy like Evaluate and Create. A student would

be considered to have achieved proficiency in the subject if he/she is able to answer the questions

in Level 5 & 6 and is able to apply the concepts for finding engineering solutions. The module coordinators regularly analyze the assignment and internal papers and classify them into the above six levels and ensure that a good balance is maintained for all the six levels. A

recommended distribution of marks at the three levels is as follows - level 1 -30%, Level 2 -20%,

Level 3 – 20%, Level 4 – 10%, 5 – 10% & Level 6 -10%.


TIME TABLE


Course Title: Compiler Design

Sub code : C301

Contact Hours per week : 3 (L) + 1(T) Hours

Course Coordinator : Ms. S. Sri Lakshmi Parvathi

Course Advisor (if any) : Ms. S. Sri Lakshmi Parvathi

Module Coordinator : Ms. S. Sri Lakshmi Parvathi

Course coordinator phone : 7331124798

Course coordinator e-mail : [email protected]

Course coordinator location : Room No.: 2S-01

Course Coordinator availability :

Resource link :

Pre-requisites Courses : C Programming

Course Description:

Understands the process involved in a compiler, create an overall view of various types of

translators, linkers, loaders, and phases of a compiler, understand what is syntax analysis,

various types of parsers especially the top down approach, awareness among students the

various types of bottom up parsers, understand the syntax analysis and, intermediate code

generation, type checking, the role of symbol table and its organization, Code generation,

machine independent code optimization and instruction scheduling.

Overview of learning activities:

1. Lecture and Class Discussions.

2. Assignment work.

3. Tutorial/Quiz sessions

4. Power Point Presentations

Overview of learning resources:

Prescribed & Suggested Text Books

1. Compilers, Principles Techniques and Tools- Alfred V Aho,

Monica S Lam, Ravi Sethi, Jeffrey D. Ullman,2 nded, Pearson,2007.

2. Compiler Design, K. Muneeswaran, Oxford Reference Books

1. Engineering a compiler, 2 nd edition, Keith D.Cooper & Linda

Torczon, Morgan Kaufman.

2. Principles of compiler design, V. Raghavan, 2 nd ed, TMH, 2011.

3. Compiler construction, Principles and Practice, Kenneth C Louden, CENGAGE

4. Implementations of Compiler, A new approach to Compilers

including the algebraic methods, Yunlinsu, SPRINGER Freely Accessible Internet Sites

1. https://www.tutorialspoint.com/compiler_design/

Overview of assessment: Internal Test. Quiz Assignments. University Exams.

mailto:[email protected]

https://www.tutorialspoint.com/dbms/


SYLLABUS UNIT-I

Overview of language processing – pre-processors – compiler – assembler – interpreters, pre-

processors, – linkers & loaders - structure of a compiler – phases of a compiler (TEXT BOOK

2). Lexical Analysis – Role of Lexical Analysis Lexical Analysis Vs. Parsing – Token, patterns

and Lexemes – Lexical Errors – Regular Expressions – Regular definitions for the language

constructs – Strings, Sequences, Comments – Transition diagram for recognition of tokens,

Reserved words and identifiers, Examples.

UNIT- II

Syntax Analysis – discussion on CFG, LMD,RMD, parse trees, Role of a parser – classification

of parsing techniques-Brute force approach, left recursion, left factoring, Top down parsing –

First and Follow- LL(1) Grammars, Non- Recursive predictive parsing – Error recovery in

predictive parsing.

UNIT- III

What is bottom up parsing approach, Types of Bottom up approaches; Introduction to simple

LR – Why LR Parsers – Model of an LR Parsers – Operator Precedence- Shift Reduce

Parsing – Difference between LR and LL Parsers, Construction of SLR Tables.

More powerful LR parses, construction of CLR (1), LALR Parsing tables, Dangling ELSE

Ambiguity, Error recovery in LR Parsing. Comparison of all bottoms up approaches with all

top down approaches

UNIT- IV

Semantic analysis, SDT Schemes, evaluation of semantic rules. Intermediate code, three

address code, quadruples, triples, abstract syntax trees. Types and declarations, type Checking.

UNIT- V

Symbol tables: use and need of symbol tables. Runtime Environment: storage organization,

stack allocation, access to non-local data, heap management, parameter passing mechanisms,

introduction to garbage collection. Reference counting garbage collectors.

Code generation: Issues, target language, Basic blocks & flow graphs, Simple code generator,

Peephole optimization, Register allocation and assignment.

UNIT- VI

Machine independent code optimization – semantic preserving transformations, global

common sub expression elimination, copy propagation, dead code elimination, constant

folding,strength reduction, loop optimization. Instruction scheduling, inter procedural

optimization.

TEXT BOOKS

1. Compilers, Principles Techniques and Tools- Alfred V Aho, Monica S Lam, Ravi

Sethi, Jeffrey D. Ullman,2 nd ed, Pearson,2007.

2. Compiler Design, K. Muneeswaran, Oxford.

REFERENCES:

1. Engineering a compiler, 2 nd edition, Keith D.Cooper & Linda Torczon, Morgan Kaufman.

2. Principles of compiler design, V. Raghavan, 2 nd ed, TMH, 2011.

3. Compiler construction, Principles and Practice, Kenneth C Louden, CENGAGE

4. Implementations of Compiler, A new approach to Compilers including the algebraic

methods, Yunlinsu, SPRINGER

Course Objectives

1. Understand the process involved in a compiler,

2. Create an overall view of various types of translators, linkers, loaders, and

phases of a compiler,

3. Understand what is syntax analysis, various types of parsers especially

the top down approach,

4. Understand the various types of bottom up parsers,


5. Understand the syntax analysis and, intermediate code generation, type checking,

6. Understand the role of symbol table and its organization, Code

generation, machine independent code optimization and instruction

scheduling.

Course Outcomes

1. Able to explain the compilation process, and phases of compiler

2. Able to explain role of parser and construct different types of parsers and

able to identify the similarities and differences among various parsing

techniques

3. Able to explain the role semantic analyzer and explain Syntax

Directed Translation schemes, type checking.

4. Able to generate intermediate code in different representations.

5. Able to explain symbol table organization and storage organizations,

garbage collection in runtime environment.

6. Able to explain optimization techniques to generate optimized code

MAPPING OF CO’S WITH PO’S

COURSE OUTCOMES P

O1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PS

O1

PS

O2

PS

O3

CO1:Able to explain the compilation process, and

phases of compiler

3 3 1

CO2:Able to explain role of parser and construct different

types of parsers and able to

identify the similarities and

differences among various parsing techniques

3 3 2 3

CO3:Able to explain the role

semantic analyzer and explain Syntax Directed Translation

schemes, type checking

3 3

CO4: Able to generate

intermediate code in different representations.

3 3

CO5:Able to explain symbol

table organization and storage

organizations, garbage collection in

runtime environment.

3

CO6:Able to explain optimization techniques to

generate optimized code

3 3 2 3

LESSON PLAN

Unit Content(s) to be covered No. of Lecture

hours required

TOTAL

Overview of language processing

pre-processors – compiler – assembler

1

11

interpreters, linkers & loaders 1

structure of a compiler 1

phases of a compiler. 2


I Lexical Analysis – Role of Lexical Analysis– Lexical

Analysis Vs. Parsing – Token, patterns and Lexemes –

Lexical Errors

1

Regular Expressions – Regular definitions for the language

constructs , Strings, Sequences, Comments

2

Transition diagram for recognition of tokens, 1

Reserved words and identifiers, Examples 1

LEX Tool 1

II

Syntax Analysis

discussion on CFG, LMD,RMD, parse trees,

1

15

Role of a parser 1

classification of parsing techniques 1

Brute force approach 1

left recursion 1

left factoring, 1

Ambiguity 1

Top down parsing 1

RDP with backtracking 1

RDP without backtracking 1

First and Follow . 2

LL(1) Grammars, 1

Non-Recursive predictive parsing 1

Error recovery in predictive parsing 1

III

What is bottom up parsing approach, Types of Bottom up

approaches;

1

12 Shift reduce parsing 1

Operator Precedence 1

Introduction to simple LR – Why LR Parsers –Model of an

LR Parsers –- Shift Reduce

1

Difference between LR and LL Parsers, Construction of

SLR Tables.

2

construction of CLR (1), 2

LALR Parsing tables 1

Dangling ELSE Ambiguity 1

Error recovery in LR Parsing. 1

Comparison of all bottoms up approaches with all top down

approaches

1

IV

Semantic analysis, SDD 1

10

Applications of SDD 1

DAG 1

SDT Schemes 2

evaluation of semantic rules 2

three address code, quadruples,triples 1

abstract syntax trees 1

Types and declarations 1

Type expressions 1

Translation of expressions 1

type Checking 2

Symbol tables: use and need of symbol tables. 1

Runtime Environment: storage organization, stack 1


V allocation,

10 access to non-local data 1

heap management, 1

parameter passing mechanisms, introduction to garbage

collection.

1

Reference counting garbage collectors. 1

Code generation: Issues, target language, Basic blocks &

flow graphs

1

Simple code generator 1

Peephole optimization 1

Register allocation and assignment 1

VI

Machine independent code optimization

semantic preserving transformations, global common sub

expression elimination, copy propagation, dead code

elimination, constant folding, strength reduction

3

7

loop optimization. 2

Instruction scheduling, inter procedural optimization. 2

TOTAL 65

QUESTION BANK

Unit no.

Q. No

Questions

Blooms Course

Taxonomy Outcome

Level

I

1 What is the difference between pass and phase? 3

CO1 2 Write short notes on functions of semantic analysis. 8 3 What is the role of regular expression in lexical analysis?

Explain 8

4 Differentiate front end and back end. 4

5 How to specify the tokens? Differentiate token, lexeme and pattern with suitable examples. And draw transition diagrams also.

8

6 How to generate object code for X=Y+Z*15 through different phases of compiler?

8

7 Explain the three general approaches for the implementation of a Lexical analyzer.

10

II

1 Why left recursion has to be eliminated from grammar? 3

CO2

2 Write about different grammars used to specify the syntax of languages and explain with an example how grammars can be used to derive input strings in different ways

8

3 Check whether the given grammar G: S 1AB|є A 1AC|0C B 0S C 1 is LL(1) or not?

8

4 Show that the grammar E E+E|E*E|(E)|id is ambiguous. 4 5 Discuss the process of error recovery in predictive parsing 8

6 What is LL(1) parser? Construct the LL(1) parser for G: S (L)|a L L,S|S and check the acceptance of input string (a,(a,a))

10

III

1 Differentiate between LR and LALR parsers. 4

CO3

2 What is Dangling ELSE ambiguity? How it can be solved with LR parsers? Explain with an example.

8

3 Construct CLR parse table for S AA A aA|d 8

4 Write the rules to compute operator precedence 4

5 With neat sketch explain the structure of LR parser and the rules to compute LR item.

8


E-learning materials

NPTEL

http://www.nptel.iitm.ac.in/downloads/106108052/

Question-Papers html

1. http://www.khitguntur.ac.in/cse.php#cseqp.php

Recommended books

1. Compilers, Principles Techniques and Tools- Alfred V Aho, Monica S

Lam, Ravi Sethi, Jeffrey D. Ullman,2 nd ed, Pearson,2007.

2. Compiler Design, K. Muneeswaran, Oxford.

Prepared by

S, Sri Lakshmi parvathi, Asst.prof., Dept. of CSE, KHIT

6 Write the algorithm to construct LALR parser and explain the same with grammar S L=R|R L *R|id R L

10

IV

1 What is Attribute grammar? Give Example. 4

CO4

2 Explain how to generate three address codes with syntax directed definitions with an example.

8

3 Write short notes on i) Formats of three address code ii) Construction syntax tree for expressions

8

4 Generate three address code for the given pseudo code while(i<=10) { A=A*B+20 i++ print(A value) }

4

5 Differentiate synthesized and inherited attributes with example. 8 6 What is an Abstract syntax tree? How to construct it?

Explain by writing syntax directed definition. 8

V

1 What is the use reference counting garbage collector?example? 4

CO5

2 What is meant by activation of procedure? How it can be represented with activation tree and record? Explain with quick sort example.

8

3 Explain the functional issues to be considered while generating

the object code.

8

4 Write short notes on parameter passing mechanisms. 4

5 Write short notes register allocation and assignment with graph coloring technique.

8

6 What is symbol table? Explain the different organization of symbol table.

8

7 Explain various ways to access non local variables.

VI

1 Define common sub expression. How to identify it? 4

CO6

2 Consider the pseudo code for quick sort and perform all the function preserving transformation techniques on flow graph of it.

10

3 Write about inter procedural optimization. 6

4 Generate the flow graph for dot product of two matrices and perform some local optimizations.

8

5 Explain Common sub expression and dead code elimination 6

6 Explain Copy propagation, constant folding. 6

7 Explain Strength Reduction 5

http://www.nptel.iitm.ac.in/downloads/106108052/

http://www.khitguntur.ac.in/cse.php#cseqp.php


Course Title: DATA COMMUNICATION

Sub code : C302


Course Coordinator : Mr.G.Manoj kumar

Course Advisor (if any) : Mr.G.Manoj kumar

Module Coordinator : Mr.G.Manoj kumar


Course coordinator e-mail :[email protected]

Course coordinator location : Room No.: 2T12

Course Coordinator availability :Tue 10.00-10.50

Resource link :

Pre-requisites Courses : Communications

Course Description:

Understands the process involved in a compiler, create an overall view of various types of

translators, linkers, loaders, and phases of a compiler, understand what is syntax analysis,

various types of parsers especially the top down approach, awareness among students the

various types of bottom up parsers, understand the syntax analysis and, intermediate code

generation, type checking, the role of symbol table and its organization, Code generation,

machine independent code optimization and instruction scheduling.



2. Assignment work.



Overview of learning resources: Prescribed & Suggested Text Books

1.Introduction to Data Communications and Networking, Wayne Tomasi, Pearson Education.

Software Links:

www. Google.com.

www. Scribd.com.

https://www.tutorialspoint.com/data_communications/

Reference Books

1. Data Communications and Networking, Behrouz A Forouzan, Fourth Edition.TMH.

2.Data and Computer communications, 8/e, William Stallings, PHI.

3.Computer Communications and Networking Technologies, Gallow, Second Edition

Thomson

4.Computer Networking and Internet, Fred Halsll, Lingana Gouda Kulkarni, Fifth Edition,

Pearson Education

Overview of assessment: Internal Test. Quiz Assignments. University Exams.

SYLLABUS Unit I:

INTRODUCTION TO DATA COMMUNICATIONS AND NETWORKING: Standards

Organizations for Data Communications, Layered Network Architecture, Open Systems

Interconnection, Data Communications Circuits, Serial and parallel Data Transmission,

Data communications Networks, Alternate Protocol Suites.SIGNALS, NOISE,

MODULATION, AND DEMODULATION: Signal Analysis, Electrical Noise and Signal to


https://www.tutorialspoint.com/data_communications/


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

OPTICAL FIBER TRANSMISSION MEDIA:

Advantages of Optical Fiber cables, Disadvantages of Optical Fiber Cables, Electromagnetic

spectrum, Optical Fiber Communications System Block Diagram, Optical Fiber construction,

Propagation of Light Through an Optical fiber Cable, Optical Fiber Modes and Classifications,

Optical Fiber Comparison, Losses in Optical Fiber Cables, Light sources, Light Detectors,

Lasers.

Unit III :

DIGITAL TRANSMISSION: Pulse Modulation, Pulse code Modulation, Dynamic Range, Signal Voltage –to Quantization

Noise Voltage Ratio, Linear Versus Nonlinear PCM Codes, Companding, PCM Line Speed,

Delta Modulation PCM and Differential PCM. MULTIPLEXING AND T CARRIERS: Time-

Division Multiplexing, T1 Digital Carrier System, Digital Line Encoding, T Carrier systems,

Frequency- Division Multiplexing, Wavelength- Division Multiplexing, Synchronous Optical

Network

Unit IV:

WIRELESS COMMUNICATIONS SYSTEMS:

Electromagnetic Polarization, Electromagnetic Radiation, 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.

CELLULAR TELEPHONE SYSTEMS: First- Generation Analog Cellular Telephone,

Personal Communications system, Second-Generation Cellular Telephone Systems, N-AMPS,

Digital Cellular Telephone, Interim Standard, Global system for Mobile Communications.

Unit VI:

DATA COMMUNICATIONS CODES, ERROR CONTROL, AND DATA FORMATS: Data Communications Character Codes, Bar Codes, Error Control, Error Detection and

Correction, Character Synchronization.

DATA COMMUNICATIONS EQUIPMENT:

Digital Service Unit and Channel Service Unit, Voice- Band Data Communication Modems,

Bell Systems-Compatible Voice- Band Modems, Voice- Band Modem Block Diagram, Voice-

Band Modem Classifications, Asynchronous Voice-Band Modems, Synchronous Voice-Band

Modems, Modem Synchronization, 56K Modems, Modem Control: The AT Command Set,

Cable Modems.

TEXT BOOKS:


Reference Books :

1. Data Communications and Networking, Behrouz A Forouzan, Fourth Edition.TMH.

2. Data and Computer communications, 8/e, William Stallings, PHI.

3. Computer Communications and Networking Technologies, Gallow, Second Edition

Thomson

4. Computer Networking and Internet, Fred Halsll, Lingana Gouda Kulkarni, Fifth Edition,

Pearson Education


COURSE OBJECTIVES

To have a detailed study of various analog and digital modulation and demodulation

techniques

To have a thorough knowledge of and Optical fiber communications

To have a thorough knowledge of various multiplexing schemes and Data communication

protocols

To have a brief knowledge of and Micro wave and satellite communications systems

To know about the standards and mechanisms of television systems.

To have a basic knowledge of and error mechanisms in data

COURSE OUTCOMES:

CO1: Knowledge of working of basic communication systems

CO2: Knowledge of working of basic optical fibre communications.

CO3: Knows about the principles of Multiplexing and De Multiplexing.

CO4: knowledge of and Micro wave and satellite communications systems.

CO5: Gains the standards and mechanisms of television systems.

CO6: Basic knowledge of and error mechanisms in data


Lesson Plan Prerequisite: Communications

Unit/Topic

No. Topic Name No of Classes

Required

1.1 Introduction to Data Communications

Standards Organizations for data communications , layered Network

architecture ,

1

1.2 Standards Organizations for data communications 1

1.3 layered Network architecture 1

1.4 Open System Interconnection 1

1.5 Data Communication Circuits 1

Tutorial -1(Test on OSI Model)

1.6 Serial and Parallel Data Transmission 1

Course Outcomes

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PS

O1

PS

O2

PS

O3

CO1: Knowledge of working

of basic communication

systems .

1 1 3 2

CO2 An ability to understand the

different switching algebra

theorems and apply them for logic functions.

3 2 1

CO3: Knows about the

principles of Multiplexing and

De Multiplexing .

3 2 3

CO4: knowledge of and

Micro wave and satellite

communications systems .

3

2

CO5: Gains the standards

and mechanisms of television

systems .

3 3 2

CO6: Basic knowledge of

and error mechanisms in data

.

3 3

3


1.7 Data Communication Networks 1

1.8 Alternate Protocol suites 1

1.9 Introduction to Signals,Noise,Modulations, Signal analysis 1

Tutorial -2(Test on DCN)

1.9 Electrical Noise and Signal-toNoise Ratio Digital modulation

Electrical Noise and Signal-toNoise Ratio

1

1.10 Analog Modulation Systems, and M-ary Encoding, Digital Modulation

Analog Modulation Systems, and M-ary Encoding, Digital Modulation

1

1.11 Information Capacity, Bits, Bit Rate, Baud, M-ary Encoding,

ModulModulation

1

II METALLIC CABLE TRANSMISSION MEDIA

2.1 : Metallic Transmission Lines, Transverse Electromagnetic Waves,

Characteristics

Electromagnetic Waves

1

2.2 Transverse Electromagnetic Waves 1

2.3 Characteristics of EM Waves 1

2.4 Advantages of Optical Fiber cables, Disadvantages of Optical Fiber Cable 1

Tutorial -1(Test on Characteristics of EM Waves)

2.5 Electromagnetic spectrum 1

2.6 Optical Fiber Communications System Block Diagram ,Optical Fiber

construction

1

2.7 Propagation of Light Through an Optical fiber Cable 1

2.8 Optical Fiber Modes and Classifications 1

2.9 Optical Fiber Comparison 1

2.10 Losses in Optical Fiber Cables, , Light sources

1

Tutorial -II(Test on Basic Optical fibre Modes)

2.11 Light Detectors, Lasers 1

3 (a)Digital transmission,(b)Multiplexing and T carriers

(b)multiplexing and t cabbrriers

3.1 Pulse Modulation, 1

3.2 Pulse code Modulation 1

3.3 Dynamic Range, Signal Voltage –to Quantization Noise Voltage Ratio 1

3.4 Linear Versus Nonlinear PCM Codes, 1

3.5 Companding, PCM Line Speed 1

Tutorial -1(Test on some basic Definations )

3.6 Delta Modulation PCM and Differential PCM.

1

3.7 MULTIPLEXING AND T CARRIERS: Time- Division Multiplexing,

Multiplexing, Synchronous Optical Network

1

3.8 T1 Digital Carrier System, 1

3.9 Digital Line Encoding, 1

Tutorial -II(Test on DM and DPCM)

3.10 T Carrier systems 1

3.11 T 1,T2 Carrier systems, 1

3.12 T 3,T4 Carrier systems, 1

3.13 FDM 1

3.14 WDM & SONET 1

Tutorial -III(Test on T Carrier systems)

4. Wireless communications systems

4.1 INTRODUCTION to WSN

1

4.2 Electromagnetic Polarization, Electromagnetic Radiation, 1

4.3 Optical Properties of Radio Waves 1

4.4 Terrestrial Propagation of Electromagnetic Waves, 1

4.5 Skip Distance, Free-Space Path Loss, 1

Tutorial -I(Test on Terrestrial Propagation)

4.6 Microwave Communications Systems 1

4.7 Satellite Communications Systems.

1

V (a)Telephone Instruments and Signals,(b)

(b)cellular telephone systems

5.1 Introduction to TELEPHONE INSTRUMENTS 1


5.2 The Subscriber Loop

1

5.3 Standard Telephone Set, Basic Telephone Call Procedures 1 5.4 Call Progress Tones 1

5.5 Signals and Examples

1

Tutorial –I ( Test on Standard telephone set and basic Call procedures )

5.6 Cordless Telephones ,Caller ID 1

5.7 Electronic Telephones, Paging systems. 1

5.8 Introduction to cellular telephone systems 1

5.9 First- Generation Analog Cellular Telephone Standard, Global system for

Mobile Communications.

1

5.10 Personal Communications system 1

Tutorial –II(Test on Cellular Telephone Systems)

5.11 Second-Generation Cellular Telephone Systems, 1

5.12 N-AMPS 1

5.13 Digital Cellular Telephone Interim Standard,. 1

5.14 Global system for Mobile Communications 1

Tutorial –III(Digital Cellular Telephone )

6. DATA COMMUNICATIONS CODES

1

6.1 Introduction to codes

1

6.2 Character Codes 1

6.3 Bar Codes. 1

6.4 Error Control 1

6.5 Error Detection and Correction 1

Tutorial –I(Test on codes)

6.6 Character Synchronization 1

6.7 DATA COMMUNICATIONS EQUIPMENT: Digital Service Unit and

Channel Service Unit,,

1

6.8 Voice- Band Data

.000000000000000000000000000000000000.Communication Modems

1

6.9 Bell Systems-Compatible Voice- Band Modems, Voice- Band Modem Block

Diagram, Voice- Band Modem Classifications

1

6.10 Asynchronous Voice-Band Modems, Synchronous Voice-Band Modems,

Modem Synchronization,.

1

6.11 56K Modems, Modem Control: The AT Command Set, Cable Modems 1

6.12 Voice- Band Data Communication Modems 1

Tutorial –II(Test on MODEMS)

Curricular gaps

1. Data Codes 1

2. Modulation Techniques operating at different positions 1

Total No. of hours: 71

QUESTION BANK

Unit

No

S.No Questions Bloom’s

Taxonomy

level

`Mapped

with CO

I

1 State Data communications and Network and

Serial and parallel data transmission?

1 CO1

2 Define bits, bit rate and baud rate? 1 CO1

3 Describe Amplitude modulation with a neat

diagram?

2 CO1

4 Explain in detail about the TCP/IP protocol

suite?

2 CO1

5 Write a short note on layered network

architecture?

3 CO1

6 Differientiate about the LOS and NOS? 3 CO1


7 Write in brief about Serial and Parallel Data

Transmission?

4 CO1

8 Design an data communication circuit? 4 CO1

9 Explain the OSI Model 5 CO1

10 Compare Analog and Digital modulation? 6 CO1

11 Discuss in detail about Peer-to-Peer and

Dedicated Client/Server networks?

4 CO1

12 Distinguish about the most prevalent types of

Electrical noise

5 CO1

13 Explain standard Organisations of data

communications

5 CO1

14 Explain Network topology with neat lay out? 5 CO1

15 Compare different types of network and

explain with data rates?

6 CO1

II

1 Define laser? 1 CO2

2 List out the advantages of Optical Fiber

cables?

3

3 Explain in detail about light sources and light

detectors?

2 CO2

4 Explain the disadvantages of optical fiber? 2 CO2

5 Explain how light propagate through optical

fiber.?

3 CO2

6 Write a brief note on the predominant losses in

optical fiber cables?

3 CO2

7 Analyze are the characteristics of

Electromagnetic waves?

CO2

8 Compare in detail about the single-mode and

multi-mode step-index optical fiber.?

5 CO2

9 Justify the advantages and disadvantages of

the optical fibers?

5 CO2

10 Write in detail about metallic transmission

lines and electromagnetic waves?

3 CO2

11 Design an Optical Communication Block

diagram with neat explanation

6 CO2

III

1 Define COMPANDING? 1 CO3

2 State Dynamic range and Pulse code

modulation?

1 CO3

3 Describe Wave length division multiplexing? 1 CO3

4 Define T1 Digital carrier system? 1 CO3

5 Compare Linear versus Non-linear PCM

codes?

2 CO3

6 Summarize Synchronous optical network? 5 CO3

7 List out the TDM and FDM? 3 CO3

8 Write a short note on the four predominant

methods of Pulse Modulation?

6 CO3

9 Classify any four factors that should be

considered when selecting Line Encoding

format. What is Digital Line Encoding?

4 CO3

10 Write about the T Carrier systems and digital

line Encoding ?

6 CO3


11 Design and explain about delta modulation

PCM and differential PCM?

6 CO3

12 Explain Single-Channel, Simplex PCM

transmission system?

3 CO3

IV

1 Define Electromagnetic Polarization? 1 CO4

2 Summarize the free space path loss? 5 CO4

3 State the Microwave Communications

Systems?

1 CO4

4 Explain the Optical Properties of Radio

Waves?

2 CO4

5 List out the skip distance and free space path

loss?

3 CO4

6 Explain Electro magnetic radiation ? 4 CO4

7 Explain Satellite communication systems 3 CO4

8 Describe about the Terrestrial Propagation of

Electromagnetic Waves?

2 CO4

9 Differentiate about the micro wave

communication system and Satellite

communication system?

2 CO4

10 Compare the Optical Properties of Radio

Waves and Terrestrial Propagation of

Electromagnetic Waves?

2 CO4

V

1 Define the Subscriber Loop? 1 CO5

2 State Caller ID and standard telephone set? 1 CO5

3 Describe about the cardless telephones? 2 CO5

4 Write in brief about the digital cellular

telephone ?

3 CO5

5 Differentiate the First and Second -

Generation Analog Cellular Telephone?

4 CO5

6 Explain the Personal Communications

system?

4 CO5

7 Compare the First and second generation

Cellular telephone systems?

5 CO5

8 Explain about the Standard Telephone Set and

give out the Basic Telephone Call Procedures

2 CO5

9 Summarize Global System for Mobile

Communications?

5 CO5

10 Design and Explain the GSM system

Architecture.

6 CO5

12 Explain about the Call Progress Tones and

Signals

3 CO5

1

Define Digital Service Unit and Channel

Service Unit

1 CO6

2 State Character Codes? 1 CO6

3 Explain about the Data Communications

Character Codes

2 CO6

4 Describe Error control ,Error Detection and

Correction

2 CO6

5 Explain about the Voice- Band Data

Communication Modems

3 CO6


VI

6 Write in brief about Voice- Band Modem

Block Diagram and their classifications

3 CO6

7 Differentiate about the Asynchronous and

Synchronous Voice-Band Modems

4 CO6

8 Design and Explain the Voice Band block

diagram?

4 CO6

9 Write a brief note on 56K MODEMS, Modem

Control?

3 CO6

10 Summarize the Voice And Data

Communication MODEMS ?

5 CO6

11 Explain Modem Synchronization and briefly

explain about the 56K Modems

2 CO6

12 Differentiate about the Asynchronous and

Synchronous Voice-Band Modems

4 CO6

E-Learning Material NPTEL, IIT & Other (Video lectures)

1. http://nptel.ac.in/courses/106105082/

2. http://www.nptelvideos.in/2012/11/data-communication.html

3. http://nptel.ac.in/downloads/106105080/


1. file:///C:/Users/VLSI-Lab/Downloads/DATA%20COMMUNICATION_Nov_2015.pdf

2. file:///C:/Users/VLSI-Lab/Downloads/DATA%20COMMUNICATION_May_2016.pdf

Recommended books


2 . Data Communications and Networking, Behrouz A Forouzan, Fourth Edition.TMH.

3. Data and Computer communications, 8/e, William Stallings, PHI.

Prepared by

G. Manoj Kumar, Asst.prof., Dept. of CSE, KHIT

http://nptel.ac.in/courses/106105082/

http://www.nptelvideos.in/2012/11/data-communication.html


Course Title : PRINCIPLES OF PROGRAMMING

LANGUAGES

Sub code: : C303


Course Coordinator : Mr. S. Krishna Reddy

Course Advisor (if any) : Mr. S. Krishna Reddy

Module Coordinator : Mr. S. Krishna Reddy

Course coordinator phone : +91-8008840475


Course coordinator location : Room No.: CP Lab 5


Resource link :

Pre-requisites Courses : C Programming, C++ and Java

Course Description:

This course surveys the range of programming paradigms in current use, including imperative,

functional, object-oriented, database and concurrent paradigms. Students learn the relative

strengths and weaknesses of the different styles, and are able to apply this knowledge to choose

the right paradigm for a particular programming task. The emphasis is on individual written

justifications, supported by technical knowledge.



2. Assignment work.




Prescribed & Suggested Text Books

1. Robert W. Sebesta, “Concepts of Programming Languages”, Tenth Edition,

Addison Wesley, 2012.

2. Programming Langugaes, Principles & Paradigms, 2ed, Allen B Tucker, Robert

E Noonan, TMH Reference Books

1. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT Press,

2009. 2. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice Hall,

1998 3. Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009. 4. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO

Standard”, Fifth Edition, Springer, 2003

Freely Accessible Internet Sites

https://en.wikipedia.org/wiki/Programming_language


Overview of assessment:

Internal Test.

Quiz

Assignments.

University Exams.


https://en.wikipedia.org/wiki/Programming_language



SYLLABUS

UNIT I: SYNTAX AND SEMANTICS: Evolution of programming languages, describing syntax, context, free grammars, attribute grammars,

describing semantics, lexical analysis, parsing, recursive - decent bottom - up parsing.

UNIT II: DATA, DATA TYPES, AND BASIC STATEMENTS: Names, variables, binding, type checking, scope, scope rules, lifetime and garbage collection, primitive data types, strings, array types, associative arrays, record types, union types, pointers and references,

Arithmetic expressions, overloaded operators, type conversions, relational and boolean expressions ,

assignment statements , mixed mode assignments, control structures – selection, iterations, branching, guarded Statements.

UNIT III: SUBPROGRAMS AND IMPLEMENTATIONS: Subprograms, design issues, local referencing, parameter passing, overloaded methods, generic

methods, design issues for functions, semantics of call and return, implementing simple subprograms, stack and dynamic local variables, nested subprograms, blocks, dynamic scoping

UNIT IV: OBJECT- ORIENTATION, CONCURRENCY, AND EVENT HANDLING:

Object – orientation, design issues for OOP languages, implementation of object, oriented constructs, concurrency, semaphores, Monitors, message passing, threads, statement level concurrency, exception

handling, event handling.

UNIT V: FUNCTIONAL PROGRAMMING LANGUAGES: Introduction to lambda calculus, fundamentals of functional programming languages, Programming

with Scheme, – Programming with ML,

UNIT VI: LOGIC PROGRAMMING LANGUAGES:

Introduction to logic and logic programming, – Programming with Prolog, multi - paradigm languages

TEXT BOOKS: 1. Robert W. Sebesta, “Concepts of Programming Languages”, Tenth Edition, Addison Wesley, 2012.

2. Programming Languages, Principles & Paradigms, 2ed, Allen B Tucker, Robert E Noonan, TMH

REFERENCES: 1. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT Press, 2009.

2. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice Hall, 1998.

3. Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009. 4. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth Edition,

Springer, 2003

COURSE OBJECTIVES

1. To understand and describe syntax and semantics of programming languages.

2. To understand data, data types, and basic statements

3. To understand call-return architecture and ways of implementing them

4. To understand object-orientation, concurrency, and event handling in programming

languages

5. To develop programs in non-procedural programming paradigms

COURSE OUTCOMES (COs)

Upon Completion of the course, the students will be able to

CO1: Describe syntax and semantics of programming languages.

CO2: Explain data, data types, and basic statements of programming languages.

CO3: Design and implement subprogram constructs.

CO4: Apply object - oriented, concurrency, and event handling programming constructs.

CO5: Develop programs in Scheme, LISP and ML.

CO6: Develop programs in logic programming and Prolog


Mapping of COs with Pos

LESSON PLAN

Prerequisite: Computer Programming in C, C++ and Java

Unit/Topic

No. Topic Name

No of

Classes

Required

I SYNTAX AND SEMANTICS

1.1 Evolution of programming languages 1

1.2 describing syntax 1

1.3 Context Free Grammars 2

1.4 attribute grammars 1

Tutorial

1.5 describing semantics 1

1.6 Lexical analysis 1

1.7 Parsing 1

1.8 recursive – decent parsing 1

1.9 bottom - up parsing 1

Tutorial

II DATA, DATA TYPES, AND BASIC STATEMENTS

2.1 Names, variables 1

2.2 binding, type checking 1

2.3 scope, scope rules 1

2.4 lifetime and garbage collection 1

2.5 primitive data types 1

Tutorial

2.6 Strings, array types, associative arrays 1

2.7 record types, union types 1

2.8 pointers and references, Arithmetic expressions 1

2.9 overloaded operators, type conversions, 1

2.10 relational and Boolean expressions, assignment statements 1

Course Outcomes

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PS

O1

PS

O2

PS

O3

CO1: Describe syntax and

semantics of programming

languages

1 3 1 3

CO2: Explain data, data types, and basic statements of

programming languages

2 2 3 1 2 3

CO3: Design and implement

subprogram constructs. 2 3 3 1 1 2 3

CO4: Apply object - oriented,

concurrency, and event handling programming

constructs.

2 3 3 1 1 3

CO5: Develop programs in

Scheme, LISP and ML. 2 3 3 2 2 2

CO6: Develop programs in

logic programming and

Prolog.

2 3 3 2 2 2


Tutorial

2.11 mixed mode assignments 1

2.12 control structures – selection 1

2.13 iterations, branching, guarded Statements 1

III SUBPROGRAMS AND IMPLEMENTATIONS

3.1 Subprograms, design issues 1

3.2 local referencing, parameter passing 1

Tutorial

3.3 overloaded methods, generic methods 1

3.4 design issues for functions, semantics of call and return 1

3.5 implementing simple subprograms 1

3.6 stack and dynamic local variables, nested subprograms 1

3.8 Blocks and dynamic scoping 1

Tutorial

IV OBJECT- ORIENTATION, CONCURRENCY, AND EVENT

HANDLING

4.1 Object – orientation 1

4.2 design issues for OOP languages 1

4.3 implementation of object oriented constructs 1

4.4 Concurrency 1

4.5 Semaphores 1

Tutorial

4.6 Monitors 1

4.7 message passing 1

4.8 Threads 1

4.9 statement level concurrency 1

4.10 exception handling 1

Tutorial

4.11 event handling 2

V FUNCTIONAL PROGRAMMING LANGUAGES

5.1 Introduction to lambda calculus, 2

5.2 fundamentals of functional programming languages 2

Tutorial

5.3 Programming with Scheme 2

5.4 Programming with ML 3

Tutorial

VI LOGIC PROGRAMMING LANGUAGES

6.1 Introduction to logic and logic programming 3

6.2 Programming with Prolog 3

Tutorial

6.3 multi - paradigm languages 3

Total No. of hours: 60 to 70

QUESTION BANK

Unit

No.

Sl.

No. Questions Bloom’s

Taxonomy level

Mapped

with CO

I

1. What is the difference between syntax &

semantics? 2 CO1

2. What are associatively and precedence? Why are they significant in parse trees?

3 CO1


3. What is meant by ambiguity? Give example. 5 CO1

4. What is the difference between a sentence and a sentential form in a CFG?

1 CO1

5. Explain the process of compilation in each

phase of a compiler. 6 CO1

6. Discuss about Context-free grammar and regular expression? Give the parse tree of a

following statement: A = (B+C) * (D / E). 6 CO1

7. Give an example of left recursive rule in CFG.

What is the significance of left recursive rule 3 CO1

8. What are the main features of the programming

paradigm with examples? 3 CO1

9. Define CFG? What does it mean for CFG to be

ambiguous? 2 CO1

10. Define grammars, derivation and a parse tree 1 CO1

11.

10 CO1

12. Explain language evaluation criteria and the

characteristics that affect them. 4 CO1

13.

8 CO1

14. What is primary use of attribute grammar? 2 CO2

15. Describe differences between Top-Down and

Bottom-Up Parsers. 4 CO1

16. Explain about lexical analysis. 4 CO1

II

1. What are the merits of sub range types 1 CO2

2. Explain in detail various design issues of character string types

2 CO2

3. What is a variable and what are the attributes of

a variable? Elaborate on address of a variable 6 CO2

4. What is meant by type checking? Differentiate between static type checking and dynamic type

checking and give their relative advantages 5 CO2

5. What are dangling pointers and lost heap-

dynamic variables? How are they created? 7 CO2

6. Explain various primitive data types with

suitable examples 4 CO2

7. Explain about control structures 9 CO2

8. Define Coercion, Typeerror, Typechecking and Strong Typing

2 CO2

9. Explain structure of an associative array? 3 CO2

10. Define name and structure type compatibility.

What are relative merits of these two 4 CO2

III 1

Define sub program. What are the distinct categories of Subprograms?

4 CO3

2 What is an overloaded subprogram? Explain

with an example 5 CO3


3 Explain different parameter passing methods

with an example 4 CO3

4. Explain two methods for implementing blocks 4 CO3

5. Describe deep access and shallow access

methods for implementing dynamic scoping 7 CO3

6. Explain how subprograms names are passed as

parameters 6 CO3

7. Explain about Co-Routines with an example 10 CO3

8. Explain design issues of functions 2 CO3

9. Explain the difference between virtual and non-

virtual methods 3 CO3

10. Define sub program. What are the distinct

categories of Subprograms? 2 CO3

IV

1. Explain features of Object-Oriented

Programming Languages 2 CO4

2.

Explain the following terms :

a)Message passing

b) Concurrency in Ada

c) Monitors.

1 CO4

3. What is exception handling? How exceptions

are handled in C++ and JAVA 4 CO4

4. Discuss in detail overloaded operators 10 CO4

5. Explain Thread class in JAVA and its methods 2 CO4

6. Discuss the design issues of Exception

Handling. 2 CO4

7. Implement Producer and Consumer problem using Semaphores

7 CO4

8. Explain in detail abstract data types in java with

examples. 4 CO4

V

1. How functions are defined in Scheme 4 CO5

2. Explain the principles of ML 2 CO5

3. Explain about Predicate functions in Scheme 5 CO5

4. Explain about primitive functions in Scheme 2 CO5

5. Explain about list functions in Scheme 7 CO5

6. How functions are defined in ML 3 CO5

7. Write factorial function using COMMON LISP 10 CO5

8. Explain about data objects in LISP? 7 CO5

VI

1. Explain about Logic programming 2 CO6

2. Explain the Basic elements of Prolog 2 CO6

3. Explain list structures and Goal statements in

PROLOG 5 CO6

4. Explain generate and test programming strategy

in PROLOG 7 CO6

5. Explain how backtracking works in PROLOG 9 CO6

6. Explain about fact and rule statements in PROLOG

3 CO6


E-learning materials NPTEL


2. http://nptel.ac.in/courses/106102067/25

3. http://www.nptel.ac.in/courses/106102067/40


1. https://www.jntufastupdates.com/jntuk-b-tech-3-1-regular-supply-exams-question-papers-

collection/ Recommended books

1. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT Press, 2009.

2. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice Hall, 1998.

3. Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009. 4. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth Edition,

Springer, 2003

Prepared by

S. Krishna Reddy, Asst.prof., Dept. of CSE, KHIT


http://nptel.ac.in/courses/106102067/25

http://www.nptel.ac.in/courses/106102067/40

https://www.jntufastupdates.com/jntuk-b-tech-3-1-regular-supply-exams-question-papers-collection/

https://www.jntufastupdates.com/jntuk-b-tech-3-1-regular-supply-exams-question-papers-collection/


Course Title : Database Management Systems

Sub code: : C404


Course Coordinator : Mr. B. Satyanarayana Reddy

Course Advisor (if any) : Mr. B. Satyanarayana Reddy

Module Coordinator : Mr. B. Satyanarayana Reddy



Course coordinator location : Room No.: 2S-02


Resource link :

Pre-requisites Courses : C Programming Course Description:

Developing and managing efficient and effective database applications requires understanding

the fundamentals of database management systems, techniques for the design of databases, and

principles of database administration. This course emphasized database concepts,

developments, use and management in three main sections: database concepts, practice, and

emerging trends. Relational database systems are the main focus, but other types, including

object- oriented databases, are studied. Practical design of databases and developing database

applications using modern software tools will be emphasized,



2. Assignment work.



Overview of learning resources: Prescribed & Suggested Text Books

1. Database Management Systems, 3/e Raghuram Krishnan, Johannes Gehrke, TMH

2. Database Management System, 6/e Ramez Elmasri, Shamkant B. Navathe, PEA Reference Books

1. Database Principles Fundamentals of Design Implementation and Management,

Corlos Coronel, Steven Morris, Peter Robb, Cengage Learning.

2. Database System Concepts. 5/e Silberschatz, Korth, TMH

3. Introduction to Database Systems, 8/e C J Date, PEA .

4. The Database book principles & practice using OraclelMySql Nacain Gehani,

University Press Freely Accessible Internet Sites

1. https://www.tutorialspoint.com/dbms/

2. http://www.w3schools.in/dbms/

3. http://ovid.cs.depaul.edu/Classes/CSC355-S14/CSC355-links.htm Computer Software

Oracle SQL Developer will be used for hands-on activities. It is an integrated

environment for the development and management of Oracle Database and is

available for free.

Overview of assessment:

Internal Test.

Quiz

Assignments.

University Exams


https://www.tutorialspoint.com/dbms/

http://www.w3schools.in/dbms/

http://ovid.cs.depaul.edu/Classes/CSC355-S14/CSC355-links.htm


SYLLABUS UNIT-I Introduction: Database system, Characteristics (Database Vs File System), Database

Users(Actors on Scene, Workers behind the scene), Advantages of Data base systems,

Database applications. Brief introduction of different Data Models; Concepts of Schema,

Instance and data independence; Three tier schema architecture for data independence;

Database system structure, environment, Centralized and Client Server architecture for the

database

UNIT- II RELATIONAL MODEL : Introduction to relational model, concepts of domain, attribute,

tuple, relation, importance of null values, constraints (Domain, Key constraints, integrity

constraints) and their importance

BASIC SQL : Simple Database schema, data types, table definitions (create, alter), different

DML operations (insert, delete, update), basic SQL querying (select and project) using where

clause, arithmetic & logical operations, SQL functions(Date and Time, Numeric, String

conversion).

UNIT- III Entity Relationship Model: Introduction, Representation of entities, attributes, entity set,

relationship, relationship set, constraints, sub classes, super class, inheritance, specialization,

generalization using ER Diagrams.

SQL : Creating tables with relationship, implementation of key and integrity constraints, nested

queries, sub queries, grouping, aggregation, ordering, implementation of different types of joins,

view(updatable and non-updatable), relational set operations.

UNIT- IV SCHEMA REFINEMENT (NORMALIZATION) : Purpose of Normalization or schema

refinement, concept of functional dependency, normal forms based on functional

dependency(1NF, 2NF and 3 NF), concept of surrogate key, Boyce- codd normal form(BCNF),

Lossless join and dependency preserving decomposition, Fourth normal form(4NF).

UNIT- V TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL : Transaction,

properties of transactions, transaction log, and transaction management with SQL using

commit rollback and savepoint.

Concurrency control for lost updates, uncommitted data, inconsistent retrievals and the

Scheduler. Concurrency control with locking methods : lock granularity, lock types, two phase

locking for ensuring serializability, deadlocks, Concurrency control with time stamp ordering :

Wait/Die and Wound/Wait Schemes, Database Recovery management : Transaction recovery.

SQL constructs that grant access or revoke access from user or user groups. Basic PL/SQL

procedures, functions and triggers

UNIT- VI STORAGE AND INDEXING : Database file organization, file organization on disk, heap

files and sorted files, hashing, single and multi-level indexes, dynamic multilevel indexing

using B-Tree and B+ tree, index on multiple keys.

TEXT BOOKS: 1. Database Management Systems, 3/e Raghuram Krishnan, Johannes Gehrke, TMH

2. Database Management System, 6/e Ramez Elmasri, Shamkant B. Navathe, PEA

3. Database Principles Fundamentals of Design Implementation and Management, Corlos

Coronel, Steven Morris, Peter Robb, Cengage Learning

REFERENCES: 1. Database System Concepts. 5/e Silberschatz, Korth, TMH

2. Introduction to Database Systems, 8/e C J Date, PEA


3. The Database book principles & practice using OraclelMySql Nacain Gehani, University

Press.

Course Objectives:

Provides students with theoretical knowledge and practical skills in the use of databases and

database management systems in information technology applications.

The logical design, physical design and implementation of relational databases are covered

Course Outcomes:

CO1: Define a Database Management System and give a description of the Database

Management system structure

CO2:Know the constraints and controversies associated with relational database model.

CO3:Understand the Entity Relationship Model and the use of structured query language

CO4:Explore the concept of data planning and Database design

CO5:Know the rules guiding transaction ACID

CO6:Describe the storage structures and indexing techniques


LESSON PLAN

COURSE OUTCOMES P

O1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PS

O1

PS

O2

PS

O3

Define a Database Management System and give a description of the Database Management system structure

3

3

3

3

Know the constraints and controversies associated with relational database model

3

Understand the Entity Relationship Model and the use of structured query language

3

3

Explore the concept of data planning and Database design

3

Know the rules guiding transaction ACID

3

Describe the storage structures and indexing techniques

2

2

3

S. No. Title No of

Classes

Required

Total

I

Introduction 1

11

Database system, Characteristics (Database Vs File System) 2

Database Users (Actors on Scene, Workers behind the scene) 1

Advantages of Data base systems, and Database applications 2

Concepts of Schema, Instance and data independence 1

Three tier schema architecture for data independence 1


Database system structure, environment 2

Centralized and Client Server architecture for the database 1

II

RELATIONAL MODEL: Introduction 1

15

concepts of domain, attribute, tuple, relation, importance of null values, 1

constraints (Domain, Key constraints, integrity constraints) 2

BASIC SQL: Simple Database schema 1

data types, table definitions (create, alter), 2

different DML operations (insert, delete, update) 2

SQL querying (select and project) using where clause 2

arithmetic & logical operations 2

SQL functions(Date and Time, Numeric,

String conversion)

2

III

Entity Relationship Model: Introduction 1

15

Representation of entities, attributes, entity set 1

relationship, relationship set, constraints 2

sub classes, super class, inheritance 1

specialization, generalization using ER Diagrams 2

SQL : Introduction 1

Creating tables with relationship 1

implementation of key and integrity constraints 1

nested queries, sub queries, grouping, aggregation, ordering 2

implementation of different types of joins 1

view(updatable and non-updatable),relational set operations 2

IV

SCHEMA REFINEMENT (NORMALIZATION)

7

Purpose of Normalization or schema refinement 1

concept of functional dependency 1

normal forms based on functional dependency(1NF,2NF,3NF) 2

concept of surrogate key, Boyce-codd normal form(BCNF) 1

Lossless join and dependency preserving decomposition 1

Fourth normal form(4NF) 1

V

TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL

14

Definition, properties of transactions, transaction log 1

management with SQL using commit rollback and save point 1

Concurrency control for lost updates, uncommitted data 1

inconsistent retrievals and the Scheduler 1

Concurrency control with locking methods : lock granularity 1

lock types,2_phase locking for serializability, deadlocks 2

Concurrency control with time stamp ordering: 1

Wait/Die and Wound/Wait Schemes 1

Database Recovery management : Transaction recovery 1

SQL constructs: grant/revoke access from user or user groups 1

Basic PL/SQL procedures 1

functions and triggers 2

VI

STORAGE AND INDEXING

8

Database file organization, file organization on disk 1

heap files and sorted files, hashing 2

single and multi-level indexes 1

dynamic multilevel indexing using B-Tree and B+ tree 3

index on multiple keys 1

TOTAL: 70


QUESTION BANK

Unit No.

Q. No

Questions

Blooms

Taxonomy

Level

Course Outcome

I

1 Compare and Contrast file Systems with database systems? 6

CO1

2 Define Data Abstraction and discuss levels of Abstraction? 2

3 Discuss about different types of Data models? 4

4 Describe the Structure of DBMS? 4

5 Write about views and updates on views? 2

6 Explain different types of database users and write the functions of

DBA?

4

7 Explain about different types of integrity constraints? 4

8 Discuss about the logical database Design? 4

II

1 Illustrate different set operations in Relational algebra with an example? 6

CO2

2 Discuss about Domain Relational calculus in detail? 4

3 Define trigger and explain its three parts? Differentiate row level and

statement

2

4 Discuss different types of aggregate operators with examples in SQL? 4

5 Illustrate Group by and Having clauses with examples?

6 Discuss about Complex integrity constraints in SQL?

7 Define a nested query?

Write a nested query to find the names of sailors who have reserved both

a red and green boat? Write a nested query to find the names of sailors who have reserved all

boats?

2

8 Discuss correlated nested queries?

Write a query to find the names of sailors who have reserved a red boat? Write a query to find the names of sailors who have not reserved a red

boat?

1

9 Explain Relational calculus?

Write a TRC query to find the names of sailors who have reserved boat 103?

Write a DRC query to find the names of sailors who have reserved boat

103?

1

10 Consider the following relational schema Employee (empno,name,office,age) Books(isbn,title,authors,publisher)

Loan(empno, isbn,date)

Write the following queries in relational algebra.

Find the names of employees who have borrowed a book Published by McGraw-Hill?

Find the names of employees who have borrowed all books Published by

McGraw-Hill? Find the names of employees who have borrowed more than five

different books published by McGraw-Hill?

For each publisher, find the names of employees who have borrowed?

3

1 Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2,

where R1 is one- to-many and R2 is many-to-many. R1 and R2 do not

have any attributes of their own. Calculate the minimum number of tables required to represent this situation in the relational model?

3

2 Discuss additional features of the ER-Models. 4


III

3 Discuss about the Concept Design with the ER Model? 4

CO3

4 We can convert any weak entity set to strong entity set by simply adding

appropriate attributes. Analyze why, then, do we have weak entity sets?

2

5 Let E1 and E2 be two entities in an E/R diagram with simple single-

valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one- to-many and R2 is many-to-many. R1 and R2 do not

have any attributes of their

own. Calculate the minimum number of tables required to represent this situation in the relational model?

8

6 Given the Students relation as shown below

For (Student Name, Student Age) to be the key for this instance, Analyze

and find

value of X not be equal to?

8

7 Given the relations employee(name,salary,deptno) department (deptno,

deptname, address)

Solve which query cannot be expressed using the basic relational algebra

Operations(U, -,x , ,p)?

8

8 Write SQL Query to find second highest salary of Employee from

Employee table?

6

IV

1 Illustrate redundancy and the problems that it can cause? 6

CO4

2 Define decomposition and how does it address redundancy? Discuss the problem

2

3 s that may be caused by the use of decompositions?

4 Define functional dependencies. How are primary keys related to FD’s? 2

5 Define normalization? Explain 1NF, 2NF, 3NF Normal forms? 2

6 Compare and contrast BCNF with 3NF? 6

7 Describe properties of decompositions? 4

8 Explain about Schema refinement in Database design? 4

9 Illustrate Multivalued dependencies and Fourth normal form with example?

6

10 Discuss about Join dependencies and Fifth normal form? 4

11 Consider a schema R (A, B, C, D) and functional dependencies A -> B

and C ->D. Solve and find whether the decomposition of R into R1 (A,

B) and R2(C, D) belongs to which one or both (dependency preserving and loss less join)?

8

12 Show that: if α → β and α → γ then α → βγ 8

13 Consider a schema R (A, B, C, D) and functional dependencies A -> B

and C ->D. Solve and find whether the decomposition of R into R1 (A, B) and R2(C, D) belongs to which one or both (dependency preserving

and loss less join)?

8

1 Explain ACID properties and Illustrate them through examples? 4

2 Discuss How do you implement Atomicity and Durability? 4

3 Illustrate Concurrent execution of transaction with examples? 6

4 Discuss Serializability in detail? 4

5 Discuss two phase locking protocol and strict two phase locking

protocols?

4

6 Describe Timestamp based locking protocols? 4

7 Describe Validation-based locking protocols? 4


V

8 Discuss in detail Multiple Granularity? 4

CO5

9 Explain in detail Storage structure? 4

10 Discuss Deferred database modification and Immediate database

modification?

4

11 Discuss how do you recover from Concurrent transactions? 6

12 Explain Buffer Management? 4

13 Explain different types of Advanced Recovery Techniques? 4

14 Write in detail about Remote Backup systems? 4

15 Consider the following transactions with data items P and Q initialized to zero:

4

16 Analyzewhich of the following concurrency control protocols ensure

both

4

17 Consider the transactions T1, T2, and T3 and the schedules S1 and S2

given below. T1: r1(X);r1(Z);w1(X);w1(Z) T2: r2(Y);r2(Z);w2(Z)

T3: r3(Y);r3(X);w3(Y)

S1: r1(X);r3(Y);r3(X);r2(Y);r2(Z); w3(Y);w2(Z);r1(Z);w1(X);w1(Z)

S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z);

r2(Z); w3(Y); w1(X); w2(Z); w1(Z)

Analyze which one of the schedules is conflict-serializable?

8

18 Suppose that there is a database system that never fails. Analyze whether

a recovery manager required for this system?

8

19 Consider the transactions T1, T2, and T3 and the schedules S1 and S2

given below. T1: r1(X);r1(Z);w1(X);w1(Z)

T2: r2(Y);r2(Z);w2(Z) T3: r3(Y);r3(X);w3(Y)

S1: r1(X);r3(Y);r3(X);r2(Y);r2(Z);

w3(Y);w2(Z);r1(Z);w1(X);w1(Z) S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z);

r2(Z); w3(Y); w1(X); w2(Z); w1(Z)

Analyze which one of the schedules is conflict-serializable?

8

VI

1 Explain in detail about ISAM? 4

CO6

2 Explain B+ trees? Discuss about this Dynamic Index Structure? 4

3 Demonstrate searching a given element in B+ trees? Explain with example?

4

4 Illustrate insertion and deletion of an element in B+ trees with example? 6

5 Write in detail about Static Hashing? 6

6 Explain in detail about Extendible Hashing? 4

7 Explain in detail about Linear Hashing? 4

8 Compare and Contrast Extendible Hashing with Linear Hashing? 6

9 Consider a B+-tree in which the maximum number of keys in a node is 5. 6

10 In the index allocation scheme of blocks to a file, Calculate on what

maximum

6

11 A clustering index is defined on the fields of which type? Analyze them. 6

12 Calculate the minimum space utilization for a B+ tree index? 6

13 Write in detail about Hash based Indexing and Tree based Indexing? 6


NPTEL

1. http://www.nptelvideos.in/2012/11/database-management-

system.html Question-Papers html

http://www.nptelvideos.in/2012/11/database-management-system.html

http://www.nptelvideos.in/2012/11/database-management-system.html


1. http://www.khitguntur.ac.in/cse.php#cseqp.php

Recommended books

1. Database System Concepts - 6th edition - Avi Silberschatz

2. Database Systems - A Practical Approach to Design, Implementation & Management By

Thomas Connolly, Carolyn Begg

3. Fundamentals of Database Systems - Elmasari , Navathe

4. Database Management Systems By Raghu Ramkrishnan, Gehrke

Prepared by

B. Satyanarayana Reddy, HOD & Prof., Dept. of CSE, KHIT

http://www.khitguntur.ac.in/cse.php#cseqp.php


Course Title: Operating Systems Sub code : C305


Course Coordinator : Mr. G. Lakshmi Narayana

Course Advisor (if any) : Mr. G. Lakshmi Narayana

Module Coordinator : Dr.B Tarakeswara Rao

Course coordinator phone : +91-9700021761


Course coordinator location : Room No.: CP Lab 1

Course Coordinator availability : Mon - Sat ( 10:00am - 05:20pm )

Resource link:

Pre-requisites Courses: Basics of computer and Computer Programming in C

Course Description:

This course will provide an introduction to operating system design and implementation. The

operating system provides a well-known, convenient, and efficient interface between user

programs and the bare hardware of the computer on which they run. The operating system is

responsible for allowing resources (e.g., disks, networks, and processors) to be shared,

providing common services needed by many different programs (e.g., file service, the ability to

start or stop processes, and access to the printer), and protecting individual programs from one

another.

The course will start with a brief historical perspective of the evolution of operating systems

over the last fifty years, and then cover the major components of most operating systems. This

discussion will cover the tradeoffs that can be made between performance and functionality

during the design and implementation of an operating system. Particular emphasis will be given

to three major OS subsystems: process management (processes, threads, CPU scheduling,

synchronization, and deadlock), memory management (segmentation, paging, swapping), file

systems, and operating system support for distributed systems.



2. Assignment work.




Prescribed & Suggested 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, Sixth 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.

4 W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”,

Fifth Edition, Springer, 2003 Freely Accessible Internet Sites

http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/

Operating%20Systems/New_index1.html

Overview of assessment: Internal Test.

Quiz

Assignments.

University Exams



SYLLABUS UNIT-I:Computer System and Operating System Overview: Overview of computer

operating systems, operating systems functions, protection and security, distributed systems,

special purpose systems, operating systems structures and systems calls, operating systems

generation.

UNIT-II:Process Management – Process concept- process scheduling, operations, Inter

process communication. Multi Thread programming models. Process scheduling criteria and

algorithms, and their evaluation.

UNIT-III:Concurrency: Process synchronization, the critical- section problem, Peterson’s

Solution, synchronization Hardware, semaphores, classic problems of synchronization,

monitors, Synchronization examples

UNIT-IV:Memory Management: Swapping, contiguous memory allocation, paging,

structure of the page table, segmentation

Virtual Memory Management:virtual memory, demand paging, page-Replacement,

algorithms, Allocation of Frames, Thrashing

UNIT-V:Principles of deadlock – system model, deadlock characterization, deadlock

prevention, detection and avoidance, recovery form deadlock,

UNIT-VI:File system Interface- the concept of a file, Access Methods, Directory structure,

File system mounting, file sharing, protection.

File System implementation- File system structure, allocation methods, free-space

management Mass-storage structure overview of Mass-storage structure, Disk structure,

disk attachment, 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, Sixth Edition–2005, Pearson education

REFERENCE BOOKS:

1. http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/

Operating%20Systems/New_index1.html

2. Operating systems- A Concept based Approach-D.M.Dhamdhere, 2nd Edition, TMH

3. Operating System A Design Approach-Crowley, TMH.

4. Modern Operating Systems, Andrew S Tanenbaum 3rd edition PHI. COURSE OBJECTIVES:

1. To gain knowledge about the Operating Systems concepts and the services provided by and

the structure of an operating system.

2. To understand what a process is and how processes are synchronized and CPU scheduling.

3. To gain knowledge about the process synchronization and synchronization examples.

4. To understand different approaches to main memory management.

5. To gain knowledge about the deadlock

6. To understand different approaches to disk scheduling, secondary memory management and

the file system

Course Outcomes:

By the end of the course student will be able to

CO1: Describe the general architecture of computers and compare differing structures for

operating Systems and system calls

CO2:Understand and analyze theory and implementation of process management and

CPU scheduling algorithms used in operating system.

CO3:Understand and analyze theory and implementation of resource control

(concurrency etc.),

CO4:To provide students knowledge of memory management

CO5:To provide students knowledge of deadlock handling algorithms.

CO6:Describe the general file system implementation, mass storage structure and disk

scheduling algorithms


Mapping of COs with POs

LESSON PLAN

Prerequisite: Basics of Computer and Computer Programming in C

Course Outcomes

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PS

O1

PS

O2

PS

O3

CO1: Describe the general architecture of computers

and compare differing

structures for operating Systems and system calls

1

2

3

2

3

CO2: Understand and analyze theory and

implementation of process

management and CPU scheduling algorithms used

in operating system

1 2 3 2

CO3: Understand and

analyze theory and implementation of resource

control (concurrency etc.),

1 3

CO4: To provide students

knowledge of memory management

1 2 1

CO5: To provide students

knowledge of deadlock

handling algorithms

1 2 2

CO6: Describe the general

file system implementation,

mass storage structure and disk scheduling algorithms.

1 2 3 2

Unit

Content(s) to be covered

No. of Lecture

hours required

I

Introduction to Overview of Computer Os’s 1

Functionality of Components of Computer System 1

Instruction Execution,Instruction Cycle 1

Instruction Execution,Instruction Cycle with interrupts 1

I/O communication Techniques and Memory Hierarchy,cache memory 1

Serial Processing,Batch Processing ,Kinds of OS’s 1

OS Structures 1

Special purpose Systems 1

System Calls 1

System Generation 1

Process Concept:Definition, PCB,Process in Memory

1

Process State Diagrams 1


II



Scheduling Queues 1

Scheduling Queues 1

CPU-Scheduling Algorithm:FCFSWith Examples 1

CPU-Scheduling Algorithm:SJF,Priority With Examples 1

CPU-Scheduling Algorithm:Round Robin,FeedbackWith Examples 1

Scheduling Criterion 1

III

Process Synchronization:Rce conditions 1

Critical –section Problem and Requirements of its solution 1

Peterson’s S/W solution for two process 1

H/W instruction implementation for mutual Exclusion:TestAndSet,Swap Instructions

1

Semaphores,Binary Semaphores 1

Monitors 1

Classic Problems of Synchronization:Bounded Buffer 1

Classic Problems of Synchronization:reader-writer 1

Classic Problems of Synchronization:dining philosophers 1

Starvation,deadlocks 1

IV

Memory:Main Memory Concepts 1

Contiguous Memory Allocation:Fragmentation 1

Paging: paging H/W,Address mappings with Examples 1

Page Table Implementation:Share,Inverted Paging,Hierarchical 1

Segmentation: Segmentation H/W,Address mappings with Examples 1

Segmentation: Segmentation H/W,Address mappings with Examples 1

Virtual Memory concepts 1

Page replacement algorithms with examples 1

Page replacement algorithms with examples 1

IV Thrashing 1

V

DeadLocks: Characterization 1

Dead Prevention 1

DeadLock Avoidance: Bankers Algorithm with Example 1

DeadLock Detection:single instance: wait for graph 1

DeadLock Detection:multiple instance: detection algorithm 1

DeadLock Recovery:Process Termination 1

DeadLock Recovery:Resource Preemption 1

DeadLock Avoidance: Bankers Algorithm with Example 1

DeadLock Detection:single instance: wait for graph 1

DeadLock Recovery:Resource Preemption 1

VI

File Concepts 1

File System implementation 1

Swap space management 1

Directory Structures 1

File System Mounting 1

File Allocation Techniques 1

File Access Methods 1

Disk Structure 1

Disk Scheduling Algorithms 1

Disk Scheduling Algorithms with Examples 1

Total No Of Hours 65


QUESTION BANK

SNO QUESTION BLOOMS

TAXONOMY

LEVEL

Mapping

with CO’s

UNIT – I

1 With the help of a diagram, explain the abstract view of the

components of a computer system.

4

CO1

2 (a)Define an operating system. What is its purpose?

(b)Explain the various functions of an operating system

4

CO1

3 (a) Explain the terms multiprogramming and multitasking.

(b)Explain the layered approach and microkernel approach

to system design.

3 CO1

4 (a)What is a system call? Explain in brief the types of

system calls provided by OS

3 CO1

5 List and explain the different operating system services. 3 CO1

UNIT – II

1 What is process and program? How and what information

about a process is represented using PCB. With the help of a

diagram, explain the different states of a process.

9 CO2

2 What are the different types of Scheduling Queues? What are the different types of schedulers?

8 CO2

3 Explain IPC mechanism with example. 9 CO2

4 What is a thread? What are the benefits of multithreaded

programming? Explain the multithreaded models for user

and kernel threads.

9 CO2

5 What is meant by CPU scheduling? Explain the criteria for

comparing CPU scheduling algorithms

7 CO2

6 List and explain the different CPU scheduling algorithms

with example

3 CO2

UNIT – III

1 What is the difference between binary and counting

semaphore. Give a solution for bounded buffer problem

2 CO3

2 What is Critical Section problem? What are the different

solutions to critical section problem?

2

CO3

3 What is the need for Process synchronization? How

hardware can be used to solve synchronization problem

1 CO3

4 Explain the Readers-Writers problem and give the solution for

synchronization using semaphores.

3 CO3

5 What are the advantages of monitors over semaphores?

Solve the Dinning philosopher’s problem using monitors.

9 CO3

6 What is the dinning philosopher problem? Discuss

Peterson's solution.

4 CO3

UNIT – IV

1 What is addressing binding? How base and limit registers can be

used for address protection.

1 CO4

2 What is Contiguous memory allocation and Dynamic

loading?

1 CO4

3 Explain the memory management technique Paging. 4 CO4

4 Explain the segmentation memory management scheme. 7 CO4

5 Explain the difference between external fragmentation and

internal fragmentation

2 CO4


6 Explain the hardware implementation of the page table. 9 CO4

7 What is the need for demand paging 9 CO4

8 What is virtual memory? Discuss its benefits. 3 CO4

9 What is page fault ? illustrate different page replacement

algorithms with the help of an example.

3 CO4

UNIT – V

1 What is Safe state? Write the Bankers algorithm and explain

it with the help of an example.

3 CO5

2 What is Resource allocation graph? How Resource

allocation graph can be used in the context of Deadlocks

9 CO5

3 Give Banker's algorithm and explain with suitable example. 2 CO5

4 What is Deadlock? What are the necessary conditions for

deadlock? What are the overheads associated with Deadlock

prevention and Deadlock avoidance algorithms.

4 CO5

5 What is deadlock avoidance approach? Explain safe state and

unsafe state with example.

3 CO5

UNIT – VI

1 What are the different file attributes and file operations. 2 CO6

2 What are the different file allocation methods? 2 CO6

3 What are the different types of files supported by an

operating system?

9 CO6

4 Discuss the schemes for defining logical structure of a

directory.

2 CO6

5 What are the different types of mass storage structures? 2 CO6

6 What are the different disk scheduling algorithms? 2 CO6


NPTEL


2. http://nptel.ac.in/courses/106102067/25

3. http://www.nptel.ac.in/courses/106102067/40


https://www.jntufastupdates.com/jntuk-b-tech-3-1-regular-supply-exams-question-

papers-collection/

Recommended books

1. Operating System Concepts (2012) by Silberschatz, Galvin and Gagne. Also known as the

"dinosaur book,"

2. Operating Systems (2003) by Deitel, Deitel, and Choffnes

Prepared by

G. Lakshmi Narayana, Asst.Prof., Dept. of CSE, KHIT


http://nptel.ac.in/courses/106102067/25

http://www.nptel.ac.in/courses/106102067/40

https://www.jntufastupdates.com/jntuk-b-tech-3-1-regular-supply-exams-question-%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20papers-collection/

https://www.jntufastupdates.com/jntuk-b-tech-3-1-regular-supply-exams-question-%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20papers-collection/


SUBJECT TITLE: Compiler Design Lab

FACULTYMEMBER: Ms. S. Sri Lakshmi Parvathi

Aim and objective of the course:

Uml & Dp course involves documenting the user requirements using the UML notation

and describing various components of UML and use case. Create a requirements model using

UML class notations and use-cases based on statements of user requirements, and to analyze

requirements models given to them for correctness and quality, Create the OO -design of a

system from the requirements model in terms of a high-level architecture description, and low-

level models of structural organization and dynamic behavior using UML class, object, and

sequence diagrams.

Objectives of Course:

At the end of this lab, the learner will be able to:

1. To enlighten the student with basic knowledge in compiler design and its applications.

Course Outcomes:

1. Able to demonstrate the process of lexical analysis, parsing and other compiler design

aspects practically.

2. Able to design lexical Analyzer using C programming language and lex tool

3. Able to design the parser using yacc tool

4. Able to generate different types of parsers for the given expressions.

Syllabus:

Lab Experiments:

1. Design a lexical analyzer for given language and the lexical analyzer should ignore

redundant spaces, tabs and new lines

2. Simulate First and Follow of a Grammar.

3. Develop an operator precedence parser for a given language.

4. Construct a recursive descent parser for an expression.

5. Construct a LL(1) parser for an expression

6. Design predictive parser for the given language

7. Implementation of shift reduce parsing algorithm.

8. Design a LALR bottom up parser for the given language.

9. Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer

generating tools

10. Write a program to perform loop unrolling.

11. Convert the BNF rules into YACC form and write code to generate abstract syntax tree.

Write a program for constant propagation


Course Outcomes

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PS

O1

PS

O2

PS

O3

CO1: Able to demonstrate the process of lexical analysis, parsing and other compiler design aspects practically

3 3 3


Equipments & Software required:

Software:

i.) Computer Systems with latest specifications

ii) LEX tool

iii) LINUX environment/ Turbo C

References:

earning materials:

Precautions:

Students should inform the Lab-in charge in the case of any hardware problems

Prepared by

S, Sri Lakshmi parvathi, Asst.prof., Dept. of CSE, KHIT

CO2 : Able to

design lexical

Analyzer using C

programming

language and lex

tool

3 3 3

CO3: Able to

design the parser

using yacc tool

3 3 3

CO4: Able to

generate different

types of parsers for

the given

expressions

3 3 3 1


SUBJECT TITLE: OPERATING SYSTEM & LINUX PROGRAMMING

LAB

FACULTYMEMBER: G.Lakshmi Narayana


This lab complements the operating systems course. Students will gain practical experience

with designing and implementing concepts of operating systems such as system calls, CPU

scheduling, process management, memory management, file systems and deadlock handling

using C language in Linux environment Objectives of Course:

1. To provide an understanding of the design aspects of operating system.

2. To give a practical orientation of programming in linux environment using system calls

and advanced concepts in linux programming. Course Outcomes:

At the end of this lab, the learner will be able to:

1. Able to demonstrate the process CPU scheduling algorithms.

2. Able to use system calls in the operating system.

3. Able to implement different memory management techniques.

4. Able to simulate dead lock avoidance and prevention.

5. Able to Study of Unix/Linux general purpose utility command 6. Able to Study different types of shells

Syllabus:

Lab Experiments:

Operating System

1. Simulate the following CPU scheduling algorithms

a) Round Robin b) SJF c) FCFS d) Priority

2. Multiprogramming-Memory management- Implementation of fork (), wait (), exec() and exit

(), System calls

3. Simulate the following

Multiprogramming with a fixed number of tasks (MFT)

Multiprogramming with a variable number of tasks (MVT)

4. Simulate Bankers Algorithm for Dead Lock Avoidance

5. Simulate Bankers Algorithm for Dead Lock Prevention

6. Simulate the following page replacement algorithms

a) FIFO b) LRU c) LFU 7. Simulate the following File allocation strategies a) Sequenced b) Indexed c) Linked

Linux Programming

1.a) Study of Unix/Linux general purpose utility command list

man,who,cat, cd, cp, ps, ls, mv, rm, mkdir, rmdir, echo, more, date, time, kill, history,

chmod, chown, finger, pwd, cal, logout, shutdown. Study of vi editor

b) Study of Bash shell, Bourne shell and C shell in Unix/Linux operating system.

c) Study of Unix/Linux file system (tree structure).

d) Study of .bashrc, /etc/bashrc and Environment variables

2. Write a C program that makes a copy of a file using standard I/O, and system calls

3. Write a C program to emulate the UNIX ls –l command.

4. Write a C program that illustrates how to execute two commands concurrently with a

command pipe

Ex: - ls –l | sort 5. Write a C program that illustrates two processes communicating using shared memory 6. Write a C program to simulate producer and consumer problem using semaphores

7. Write C program to create a thread using pthreads library and let it run its function


8. Write a C program to illustrate concurrent execution of threads using pthreads library


Recommended system & Software required:

Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB

RAM and 100 MB free disk space

References:

E-Learning materials:

Precautions:

1. Students should inform the Lab-in charge in the case of any hardware problems

Prepared by

G. Lakshmi Narayana, Asst.Prof., Dept. of CSE, KHIT

Course Outcomes

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PO

S1

PO

S2

PO

S3

CO1: Able to demonstrate the process CPU scheduling algorithms

1 2 1 3

CO2 : Able to use

system calls in the

operating system

1 3 2

CO3: Able to

implement different

memory

management

techniques

1 2 1 2

CO4: Able to

simulate dead lock

avoidance and

prevention

2 1 3 1

CO5: Able to Study

of Unix/Linux

general purpose

utility command

1 3 2

CO6: Able to Study

different types of

shells

2 1 3


SUBJECT TITLE: DATABASE MANAGEMENT SYSTEMS LAB FACULTY MEMBER: Mr. B. Satyanarayana Reddy


The major objective of this lab is to provide a strong formal foundation in database concepts,

technology and practice to the participants to groom them into well-informed database application developers.

Rather than imparting isolated knowledge/experience fragments in each of concepts, technology and practice,

the course will aim at achieving a good blend of the three. The overriding concern, therefore, is to include just

enough concepts and theory to motivate and enrich the practical component, and to include technology

component to maximize the relevance of the course to the industry without sacrificing the long-term objectives

of rigor and foundational strength that can withstand the vagaries of technological advances.

Course Objectives:

1. To provide a sound introduction to the discipline of database management as a subject in its

own right, rather than as a compendium of techniques and product specific tools.

2. information-oriented data-processing oriented framework.

3. To give a good formal foundation on the relational model of data

4. To present SQL and procedural interfaces to SQL comprehensively.

5. To give an introduction to systematic database design approaches covering conceptual

design, logical design and an overview of physical design.

Course Outcomes:

1. Understand, appreciate and effectively explain the underlying concepts of database

Technologies.

2. Design and implement a database schema for a given problem-domain.

3. Populate and query a database using SQL DML/DDL commands.

4. Declare and enforce integrity constraints on a database using a state-of-the-art RDBMS.

5. Programming PL/SQL including stored procedures, stored functions, cursors, packages.

Syllabus: 1) Creation, altering and droping of tables and inserting rows into a table (use constraints while

creating tables) examples using SELECT command

2) Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS, UNION,

INTERSET, Constraints.

Example:- Select the roll number and name of the student who secured fourth rank in the class

3) Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY,

HAVING and Creation and dropping of Views.

4) Queries using Conversion functions (to_char, to_number and to_date), string functions

(Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr and instr), date

functions (Sysdate, next_day, add_months, last_day, months_between, least, greatest, trunc,

round, to_char, to_date).

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

and exception –Handling section (Ex. Student marks can be selected from the table and printed

for those who secured first class and an exception can be raised if no records were found)

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

block.

6)Develop a program that includes the features NESTED IF, CASE and CASE expression. The

program can be extended using the NULLIF and COALESCE functions.

7)Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops using

ERROR Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE-APPLICATION


ERROR.

8) Programs development using creation of procedures, passing parameters IN and OUT of

PROCEDURES.

9)Program development using creation of stored functions, invoke functions in SQL Statements

and write complex functions.

10)Program development using creation of package specification, package bodies, private

objects, package variables and cursors and calling stored packages.

11)Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR,

WHERE CURRENT of clause and CURSOR variables.

12)Develop Programs using BEFORE and AFTER Triggers, Row and Statement Triggers and

INSTEAD OF Triggers


Software required:

i.) Computer Systems with latest specifications

ii) Intel based desktop PC

iii) Mysql /Oracle latest version

References:

1)ORACLE PL/SQL by example. Benjamin Rosenzweig, Elena Silvestrova, Pearson Education

3rd Edition

2)ORACLE DATA BASE LOG PL/SQL Programming SCOTT URMAN, Tata Mc-Graw Hill.

3)SQL & PL/SQL for Oracle 10g, Black Book, Dr.P.S. Deshpande.

4) Data Base Management System, Oracle SQL and PL/SQL, Pranab kumar Das Gupta, P

Radha Krishna, PHI

Prepared by

B. Satyanarayana Reddy, HOD & Prof., Dept. of CSE, KHIT

Course Outcomes

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PS

O1

PS

O2

PS

O3

CO1: Understand, appreciate

and effectively explain the

underlying concepts of database Technologies .

3

CO2:Design and implement a database schema for a given problem- domain .

3

CO3: Populate and query a database using SQL

DML/DDL commands . 3 3

CO4: Declare and enforce integrity constraints on a database using a state-of-the-art.RDBMS .

3

CO 5: Programming PL/SQL including stored procedures,

stored functions, cursors,

packages .

3


NON-PROGRAMMING LABORATORY COURSES ASSESSMENT GUIDELINES

a) The number of experiments in each laboratory course shall be as per the

curriculum in the scheme of instructions provided by JNTUK. Mostly the number

of experiments is 10 in each laboratory course under semester scheme.

b) The students will maintain a separate note book for observations in each laboratory

course.

c) In each session the students will conduct the allotted experiment and enter the

data in the observation table.

d) The students will then complete the calculations and obtain the results. The

course coordinator will certify the results in the same session. The students will

submit the record in the next class. The evaluation will be continuous and not

cycle-wise or at semester end.

e) The internal marks of 25 are awarded in the following manner:

a. Laboratory record - Maximum Marks 15

b. Test and Viva Voce - Maximum Marks 10

f) Laboratory Record: Each experimental record is evaluated for a score of 50.

The rubric parameters are as follows: a. Write up format - Maximum Score 15

b. Experimentation Observations & Calculations - Maximum Score 20

c. Results and Graphs - Maximum Score 10

d. Discussion of results - Maximum Score 5

e. While (a), (c) and (d) are assessed at the time of record submission, (b) is

assessed during the session based on the observations and calculations.

Hence if a student is absent for an experiment but completes it in another

session and subsequently submits the record, it shall be evaluated for a score of

30 and not 50.

g) The 15 marks of laboratory record will be scaled down from the TOTAL of the

assessment sheet.

h) The test and viva voce will be scored for 10 marks as follows:

a. Internal Test - 6 marks

b. Viva Voce / Quiz - 4 marks

The assessment of each experiment is recorded in the following format for every

Student.

Exp.

No.

Title

of

the

Exp

Date

conduct

ed

Date

submitt

ed

Observations

and

Calculati

ons (20)

Writ

e up

(15)

Results

and

Graphs

(10)

Discussion

of Results

(5)

Total

(50)

1 2 3

Total

Avg.(Total/No of experiments conducted as per curriculum)

Scaled down to 15 marks(Avg./50 * 15)


a. Write up format - Maximum Score 20 b. Process development and coding - Maximum Score 10 c. Compile, debug, link and execute program - Maximum Score 15 d. Process validation through input-output - Maximum Score 5

PROGRAMMING LABORATORY COURSES ASSESSMENT GUIDELINES

i. The number of experiments/programs/sessions in each laboratory course shall be

as per the curriculum in the scheme of instructions provided by JNTUK.

ii. The students will maintain a separate note book for each laboratory course in

which all the related work would be done.

iii. In each session the students will complete the assigned tasks of process

development, coding, compiling, debugging, linking and executing the programs.

iv. The students will then execute the programme and validate it by obtaining the

correct output for the provided input. The course coordinator will certify the

validation in the same session.

v. The students will submit the record in the next class. The evaluation will be

continuous and not cycle- wise or at semester end.

vi. The internal marks of 25 are awarded in the following manner:

a. Laboratory record - Maximum Marks 15

b. Test and Viva Voce - Maximum Marks 10

vii. Laboratory Record: Each experimental record is evaluated for a score of 50.

While (a) is assessed at the time of record submission, (b), (c) and (d) are

assessed during the session based on the performance of the student in the

laboratory session. Hence if a student is absent for any laboratory session but

completes the program in another session and subsequently submits the record, it

shall be evaluated for a score of 20 and not 50.

viii. The 15 marks of laboratory record will be scaled down from the TOTAL of

the assessment sheet.

ix. The test and viva voce will be scored for 10 marks as follows:

Internal Test - 6 marks

Viva Voce / Quiz - 4 marks

The assessment of each experiment is recorded in the following format for every

student.

The rubric parameters are as follows:

Ex

p.

No

.

Titl

e of

the

Ex

p

Date

conduct

ed

Date

submitt

ed

Process

Developm

ent and

coding

(10)

Compilati

on,

Debuggin

g, Linking

and

Executing

(Max 15)

Process

Validati

on

(Max 5)

Write

up

forma

t

(Max

20)

Total

Score

(Max

50)

1

2

3

Tota

l


LABORATORY COURSE EVALUATION RUBRIC

CATEGORY

OUTSTANDING

(Up to 100%)

ACCOMPLISHED

(Up to 75%)

DEVELOPING

(Up to 50%)

BEGINNER

(Up to 25%)

Write up format Aim, Apparatus, material requirement, theoretical basis, procedure of experiment, sketch of the experimental setup etc. is demarcated and

presented in clearly labeled and neatly organized sections.

The write up follows the specified format but a couple of the specified parameters are missing.

The report follows the specified format but a few of the formats are missing and the experimental sketch is not included in the report

The write up does not follow the specified format and the presentation is shabby.

Observations

and Calculations

The experimental

observations and calculations are recorded in neatly prepared table with correct units and significant figures. One sample calculation is

explained by substitution of values

The experimental

observations and calculations are recorded in neatly prepared table with correct units and significant figures but sample calculation is not shown

The experimental

observations and calculations are recorded neatly but correct units and significant figures are not used. Sample calculation is also not shown

The experimental

observations and results are recorded Carelessly. Correct units significant figures are not followed and sample

calculations not shown

Results and

Graphs

Results obtained are

correct within reasonable limits. Graphs are drawn neatly with labeling of the axes. Relevant calculations are performed from the graphs. Equations are

obtained by regression analysis or curve fitting if relevant


correct within reasonable limits. Graphs are drawn neatly with labeling of the axes. Relevant calculations from the graphs are incomplete and equations are not

obtained by regression analysis or curve fitting


correct within reasonable limits. Graphs are not drawn neatly and or labeling is not proper. No calculations are done from the graphs and equations are not

obtained by regression analysis or curve fitting

Results obtained

are not correct within reasonable limits. Graphs are not drawn neatly and or labeling is not proper. No calculations are done from the

graphs and equations are not obtained by regression analysis or curve fitting

Discussion of

results

All relevant points of

the result are discussed and justified in light of theoretical expectations. Reasons for divergent results are identified and corrective measures discussed.

Results are discussed

but no theoretical reference is mentioned. Divergent results are identified but no satisfactory reasoning is given for the same.

Discussion of results

is incomplete and divergent results are not identified.

Neither relevant

points of the results are discussed nor divergent results identified

Course Handouts (2017 18)

Documents

Transcript of Course Handouts (2017 18)