course handouts (2017 18)khitguntur.ac.in/csehandouts/2017-18/ii b.tech i sem cse...

Department of

Computer Science & Engineering

II 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: Statics with R Prog., MEFA, DLD, Python Prog., DS, CG

Labs: DS through C++, Python Prog.

14. Non-Programming Laboratory Courses Assessment Guidelines 56

15. Programming Laboratory Courses Assessment Guidelines 57

16. Laboratory Course Evaluation Rubrics 58


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 2016 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

II Year I Semester

COURSE STRUCTURE

S.No Subject

Code

Subject T P C

1 C201 Statics with R Programming 3+1 - 3

2 C202 Mathematical Foundations of Computer

Science 3+1 - 3

3 C203 Digital Logic Design 3+1 - 3

4 C204 Python Programming 3+1 - 3

5 C205 Data Structures through C++ 3+1 - 3

6 C206 Computer Graphics - 3 3

7 C207 Data Structures through C++Lab - 3 2

8 C208 Python Programming Lab - 3 2

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 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 mark

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 (Theory, Design, Analysis,

Simulation, Algorithms, Drawing, etc. as the case may be and for Physics, Virtual Labs to be

considered as Assignments) Objective -10 (Conducted at College level with 20 Multiple choice

question with a weightage of ½ 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.

Internal Marks can be calculated with 80% weightage for best of the two Mids and 20%

weightage for other Mid Exam 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.

End Exam Paper: Part-A 1st Question is mandatory covering all the syllabus which contains

seven 2 marks questions for 14 marks with atleast 2 marks of question for each of the six

units and in Part-B 4 Questions out of 6 Questions are to be answered with each carrying 14

marks. Part-A & Part-B put together gives for 70 marks.

(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 / or drawing, (such as Engineering Graphics,

Engineering Drawing, Machine Drawing) and estimation, the distribution shall be 30 marks for

internal evaluation ( 20 marks for day – to – day work, and 10 marks for internal tests) and 70

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

can be calculated with 80% weightage for best of the two tests and 20% weightage for other

test and these are to be added to the marks obtained in day to day work.

(vii) For the seminar, Each student has to be evaluated based on the presentation of any latest

topic with report of 10-15 pages and a ppt of min 10 slides. 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%.


Course Title: Statics with R Programming

Sub code: : 201

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

Course Coordinator : Mr. B.SRIKANTH

Course Advisor (if any) : Mr. B.SRIKANTH

Module Coordinator : Mr. B.SRIKANTH

Course coordinator phone : 9963480304

Course coordinator e-mail : [email protected]

Course coordinator location : Room No.:

Course Coordinator availability : Monday 9:30am - 10:30am

Friday 2.30pm – 3.15pm

Resource link:

Pre-requisites Courses: Mathematics, C-Programming

Course Description:

In this course students will learn about the fundamentals of computers and understand the

various steps in Program development. It provides the syntax and semantics of R Programming

Language. This course makes how to write modular and readable R Programs. It also makes to

write programs using structured programming approach in R to solve problems.

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) The Art of R Programming, A K Verma, Cengage Learning 2) R for Everyone, Lander, Pearson.

3) The Art of R Programming, Norman Matloff, No starch Press.

Reference Books

1) R Cookbook, PaulTeetor, Oreilly. 2) R in Action,Rob Kabacoff, Manning

Freely Accessible Internet Sites

https://www.tutorialspoint.com/r/r_quick_guide.htm

Overview of assessment: Internal Test.

Quiz

Assignments.

University Exams.

SYLLABUS UNIT-I

Introduction, How to run R, R Sessions and Functions, Basic Math, Variables, Data Types,

Vectors, Conclusion, Advanced Data Structures, Data Frames, Lists, Matrices, Arrays, Classes.

UNIT- II

R Programming Structures, Control Statements, Loops, - Looping Over Non vector Sets,- If-

Else, Arithmetic and Boolean Operators and values, Default Values for Argument, Return

Values, Deciding Whether to explicitly call return- Returning Complex Objects, Functions are

Objective, No Pointers in R, Recursion, A Quick sort Implementation-Extended Extended

Example: A Binary Search Tree.

mailto:[email protected]

https://www.tutorialspoint.com/r/r_quick_guide.htm


UNIT- III

Doing Math and Simulation in R, Math Function, Extended Example Calculating Probability-

Cumulative Sums and Products-Minima and Maxima- Calculus, Functions Fir Statistical

Distribution, Sorting, Linear Algebra Operation on Vectors and Matrices, Extended Example:

Vector cross Product- Extended Example: Finding Stationary Distribution of Markov Chains,

Set Operation, Input /output, Accessing the Keyboard and Monitor, Reading and writer Files

UNIT- IV

Graphics, Creating Graphs, The Workhorse of R Base Graphics, the plot() Function –

Customizing Graphs, Saving Graphs to Files.

UNIT- V

Probability Distributions, Normal Distribution- Binomial Distribution- Poisson Distributions

Other Distribution, Basic Statistics, Correlation and Covariance, T-Tests,-ANOVA.

UNIT- VI

Linear Models, Simple Linear Regression, -Multiple Regression Generalized Linear Models,

Logistic Regression, - Poisson Regression- other Generalized Linear Models-Survival

Analysis, Nonlinear Models, Splines- Decision- Random Forests.

TEXT BOOKS

1. The Art of R Programming, A K. Verma, Cengage Learning.

2. R for Everyone, Lander, Pearson.

3. The Art of R Programming, Norman Matloff, No Starch Press

REFERENCES:

1. R Cookbook, PaulTeetor, Oreilly.

2. R in Action,Rob Kabacoff, Manning.

Course Objectives

1. Use R for statistical programming, computation, graphics, and modeling.

2. Write functions and use R in an efficient way.

3. Fit some basic types of statistical models.

4. Use R in their own research.

5. Use of different distribution methods in R.

6. Be able to expand their knowledge of R on their own

Course Outcomes

CO1: List motivation for learning a programming language.

CO2: Access online resources for R and import new function packages into the R workspace.

CO3: Import, review, manipulate and summarize data-sets in R.

CO4: Explore data-sets to create testable hypotheses and identify appropriate statistical tests.

CO5: Perform appropriate statistical Distributions using R.

CO6: Perform appropriate statistical tests using R Create and edit visualizations

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: List motivation for learning

a programming language

3 2 1 3

CO2: Access online resources for R and import new function

packages into the R workspace.

3 2 1 2 2

CO3: Import, review, manipulate and summarize data-sets in R.

3 2 1 1

CO4: Explore data-sets to create testable hypotheses and identify

appropriate statistical tests.

2 1 2


CO5: Perform appropriate

statistical Distributions using R

3 1 2

CO6: Perform appropriate

statistical tests using R Create and

edit visualizations

3 2 1 1

LESSON PLAN

Prerequisite: Engineering mathematics & Engineering physics

Unit/Topic

No. Topic Name No of Classes

Required

I UNIT-I

1.1 Introduction ,How to run R 1

1.2 R Sessions and Functions 1

1.3 Basic Math 1

1.4 Variables 1

1.5 Data Types 1

1.6 Vectors 1

1.7 Conclusion 1

1.8 Advanced Data Structures 1

1.9 Data Frames 1

1.10 Lists 1

1.11 Matrices 1

1.12 Arrays 1

1.13 Classes 1

II UNIT-II

2.1 R Programming Structures

1

2.2 Control Statements 1

2.3 Loops 1

2.4 Looping Over Nonvector Sets, If-Else 1

2.5 Arithmetic and Boolean Operators and values 2

2.6 Default Values for Argument, Return Values 1

2.7 Deciding Whether to explicitly call return- Returning

Complex Objects 2

2.8 Functions are Objective 1

2.9 No Pointers in R 1

2.10 Recursion 1

2.11 A Quick sort Implementation-Extended Example: A

Binary Search Tree.

2

III UNIT-III

3.1 Doing Math and Simulation in R,

1

3.2 Math Function 1

3.3 Extended Example Calculating Probability-Cumulative

Sums and Products-Minima and Maxima- Calculus

2

3.4 Functions Fir Statistical Distribution, Sorting 2

3.5 Linear Algebra Operation on Vectors and Matrices 1

3.6 Extended Example 1

3.7 Vector cross Product- Extended Example 1

3.8 Finding Stationary Distribution of Markov Chains 1


3.9 Set Operation 1

3.10 Input /out put 1

3.11 Accessing the Keyboard and Monitor 1

3.1 2 Reading and writer Files 1

IV UNIT-IV

4.1 Graphics

1

4.2 Creating Graphs 1

4.3 The Workhorse of R Base Graphics 2

4.4 the plot() Function 1

4.5 Customizing Graphs 2

4.6 Saving Graphs to Files 1

V UNIT-V

5.1 Probability Distributions 2

5.2 Normal Distribution 1

5.3 Binomial Distribution 1

5.4 Poisson Distributions 2

5.5 Other Distribution 1

5.6 Basic Statistics 1

5.7 Correlation and Covariance 1

5.8 T-Tests 1

5.9 ANOVA 1

VI UNIT-VI

6.1 Linear Models 1

6.2 Simple Linear Regression 1

6.3 Multiple Regression Generalized Linear Models 1

6.4 Logistic Regression 1

6.5 Poisson Regression 1

6.6 other Generalized Linear Models 1

6.7 Survival Analysis 1

6.8 Nonlinear Models 1

6.9 Splines- Decision- 1

6.10 Random Forests 1

Total No. of hours: 70 to 75

*** Note minimum classes: 70 Maximum classes: 75

QUESTION BANK

Unit

No. SL.No. Questions

Bloom’s

Taxonomy

level

Mapped

with CO

I

1 Explain about Sessions and Functions in R Language 3

CO1

2 Explain the Variables with the help of examples, 4

3 Explain the different Data Types in R-Programming 3

4 Explain the concept of Vectors in R-Programming 4

5 Explain Data Frames in R-programming 3

6 Explain about Lists in R-Programming 4

7 Explain about Matrices in R-Programming. 5

8 Explain Arrays in R-Programming. 6

9 What is factor? Explain with the help of example. 4

10 What are the different Classes in R Programming 7


II

1 Explain about R Programming Structures. 4

CO2

2 Explain the different Control Statements in R 3

3 What are the different Loops in R-Programming 2

4 Explain the Arithmetic and Boolean Operators in R 1

5 What are Complex Objects in R 7

6 Explain Functions in R. 5

7 Explain about Recursion in R programming 6

8 Explain the concept Pointers in R- Programming 7

9 A Quick sort Implementation-: 5

10 Construct A Binary Search Tree Using R-Programming 6

III

1 Explain Simulation in R 6

CO3

2 Explain about Math Function in R. 4

3 Explain the following concepts Calculating Probability-Cumulative Sums and Products-Minima and Maxima-

Calculus

2

4 Explain the different linear Algebra Operations on Vectors 2

5 Explain, Linear Algebra Operation on Matrices in R. 2

6 What are Functions Fir Statistical Distribution in R, 4

7 Explain Sorting in R-Programming. 6

8 What is Set Operation, and explain the Input /out put 4

9 Explain Stationary Distribution of Markov Chains in R. 6

10 Explain Reading and writer Files in R. 3

IV

1 Explain how to create Graphs. 3

CO4

2 Explain the Workhorse of R Base Graphics 4

3 Explain the plot() Function in R. 4

4 What is points () function? Explain with an example. 4

5 What is legend () function? Explain with an example. 4

6 What is text () function? Explain with an example. 4

7 What is locator () function? Explain with an example. 4

8 Explain the changing Character sizes concept in

Customizing Graphs

6

9 Explain about the Customizing Graphs. 3

10 Explain the procedure for Saving Graphs to Files. 3

V

1 Explain the Probability Distributions in R. 4

CO5

2 Explain the Normal Distributions in R 3

3 Explain the Binomial Distributions in R 3

4 Explain the Poisson Distributions in R 4

5 Explain the Other Distributions in R-Programming 3

6 What are the Basic Statistics in R-programming 3

7 Explain about Correlation. 4

8 Explain about Covariance. 2

9 Explain about T-Tests 6

10 Explain ANOVA concept in R-Programming. 8

VI

1 What are the different Linear Models in R. 3

CO6

2 Explain Simple Linear Regression, - 3

3 What are the different Multiple Regression Generalized

Linear Models?

9

4 Explain about Logistic Regression. 3

5 Explain Poisson Regression in R 4

6 Explain the concept of Decision- Random Forests. 4

7 What are the different Generalized Linear Models? 9

8 Explain the concept of Survival Analysis 8

9 Discuss about different Nonlinear Models 4

10 Explain the concept Splines- Decision- 6


E-learning materials

NPTEL

https:// nptel.ac.in/courses/102101056/9

Question-Papers html

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

Recommended books

1. R for Everyone: Advanced Analytics and Graphics- P. Lander Addison Wesley 1st Edition

2. Hands-On Programming with R – Grolemund , Garrett O’REILLY Hill,Second Edition..

Prepared by

B.Srikanth, Asst.prof., Dept. of CSE, KHIT

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

http://www.amazon.in/s/ref=dp_byline_sr_book_1?ie=UTF8&field-author=Lander&search-alias=stripbooks

http://www.amazon.in/s/ref=dp_byline_sr_book_1?ie=UTF8&field-author=Grolemund&search-alias=stripbooks

http://www.amazon.in/s/ref=dp_byline_sr_book_2?ie=UTF8&field-author=Garrett&search-alias=stripbooks


Course Title: Mathematical Foundations of

Computer Science

Sub code : C202


Course Coordinator : B.Aruna

Course Advisor (if any) : B.Aruna

Module Coordinator : B.Aruna



Course coordinator location : Room No.: 3F-04

Course Coordinator availability : Monday 11:40am - 12:20pm

Friday 11:40am - 12:20pm

Resource link :

Pre-requisites Courses : MFCSE

Course Description:

Fundamental concepts and tools in discreet mathematics with emphasis on their applications

to computer science. Topics include logic and Boolean circuits; sets, functions, relations,

databases, and finite automata: deterministic algorithms, randomized algorithms, and analysis

techniques based on counting methods and recurrence equations; trees and more general

graphs.



2. Assignment work.




1. Discrete Mathematical Structures with Applications to Computer Science, J. P.

Tremblay and

2. P. Manohar, Tata McGraw Hill.

3. Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D.

P. Mohapatra, 3rdEdition, Tata McGraw Hill.

4. Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K.

H. Rosen, 7th Edition, Tata McGraw Hill.

Software Links:

1. http://www.alljntuworld.in/jntuk-cse-important-questions/

2. https://www.smartzworld.com/notes/mfcs-notes-pdf-mfcs/

Reference Books

1. Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A.

Kandel, T.P. Baker, 2nd Edition, Prentice Hall of India.

2. Discrete Mathematical Structures, BernandKolman, Robert C. Busby, Sharon Cutler

Ross, PHI.

3. Discrete Mathematics, S. K. Chakraborthy and B.K. Sarkar, Oxford, 2011


1. http://www.ru.nl/english/education/masters/mathematical-foundations-of-computer-science/

2. http://www.math.northwestern.edu/~mlerma/courses/cs310-05s

3. https://www.ox.ac.uk/admissions/graduate/courses/msc-mathematics-and-foundations-

computer-science?wssl=1



http://www.alljntuworld.in/jntuk-cse-important-questions/


Quiz Assignments. University Exams.

SYLLABUS Unit I:

Mathematical Logic:

Propositional Calculus: Statements and Notations, Connectives, Well Formed Formulas, Truth

Tables, Tautologies, Equivalence of Formulas, Duality Law, Tautological Implications, Normal

Forms, Theory of Inference for Statement Calculus, Consistency of Premises, Indirect Method

of Proof.

Predicate Calculus: Predicative Logic, Statement Functions, Variables and Quantifiers, Free

and Bound Variables, Inference Theory for Predicate Calculus..

Unit II :

Set Theory:

Introduction, Operations on Binary Sets, Principle of Inclusion and Exclusion, Relations:

Properties of Binary Relations, Relation Matrix and Digraph, Operations on Relations, Partition

and Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering Relations,

Hasse Diagrams, Functions: Bijective Functions, Composition of Functions, Inverse Functions,

Permutation Functions, Recursive Functions, Lattice and its Properties.

Unit III :

Algebraic Structures and Number Theory:

Algebraic Structures: Algebraic Systems, Examples, General Properties, Semi Groups and

Monoids, Homomorphism of Semi Groups and Monoids, Group, Subgroup, Abelian Group,

Homomorphism, Isomorphism, Number Theory: Properties of Integers, Division Theorem, The

Greatest Common Divisor, Euclidean Algorithm, Least Common Multiple, Testing for Prime

Numbers, The Fundamental Theorem of Arithmetic, Modular Arithmetic (Fermat’s Theorem

and Euler’s Theorem)

Unit IV:

Combinatorics:

Basic of Counting, Permutations, Permutations with Repetitions, Circular Permutations,

Restricted Permutations, Combinations, Restricted Combinations, Generating Functions of

Permutations and Combinations, Binomial and Multinomial Coefficients, Binomial and

Multinomial Theorems, The Principles of Inclusion–Exclusion, Pigeonhole Principle and its

Application.

Unit V:

Recurrence Relations:

Generating Functions, Function of Sequences, Partial Fractions, Calculating Coefficient of

Generating Functions, Recurrence Relations, Formulation as Recurrence Relations, Solving

Recurrence Relations by Substitution and Generating Functions, Method of Characteristic

Roots, Solving Inhomogeneous Recurrence Relations.

Unit VI:

Graph Theory: Basic Concepts of Graphs, Sub graphs, Matrix Representation of Graphs:

Adjacency Matrices, Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and

Hamiltonian Graphs, Multigraphs, Planar Graphs, Euler’s Formula, Graph Colouring and

Covering, Chromatic Number, Spanning Trees, Algorithms for Spanning Trees (Problems Only

and Theorems without Proofs).

TEXT BOOKS:

1.Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay and

P. Manohar, Tata McGraw Hill.

2. Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D. P.

Mohapatra, 3rdEdition, Tata McGraw Hill.


3.Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K. H.

Rosen, 7th Edition, Tata McGraw Hill.

REFERENCES:

1. Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A. Kandel,

T.P. Baker, 2nd Edition, Prentice Hall of India.

2. Discrete Mathematical Structures, BernandKolman, Robert C. Busby, Sharon Cutler Ross, PHI.

3. Discrete Mathematics, S. K. Chakraborthy and B.K. Sarkar, Oxford, 2011

COURSE OBJECTIVES

To introduce the students to the topics and techniques of discrete methods and

combinatorial reasoning

To introduce a wide variety of applications. The algorithmic approach to the solution of

problems is fundamental in discrete mathematics, and this approach reinforces the close ties

between this discipline and the area of computer science

COURSE OUTCOMES:

CO1: Student will be able to comprehend mathematical principles and logic

CO2: Student will be able to demonstrate skills in solving mathematical problems.

CO3: Student will be able to demonstrate knowledge of mathematical modeling and

proficiency in using mathematical software.

CO4: Student will be able to communicate effectively mathematical ideas/results verbally or in

writing.

CO5: Student will be able to demonstrate skills in solving mathematical problems.

CO6: Student will be able to manipulate and analyze data numerically and/or graphically using

appropriate Software


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: Student will be able to

comprehend mathematical

principles and logic .

3

CO2 Student will be able to

demonstrate skills in solving

mathematical problems .

3


demonstrate knowledge of

mathematical modeling and

proficiency in using

mathematical software .

3


communicate effectively

mathematical ideas/results

verbally or in writing .

3


demonstrate skills in solving

mathematical problems .

3


manipulate and analyze data

numerically and/or

graphically using appropriate

Software .

3


LESSON PLAN Prerequisite: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE AND ENGINEERING

Unit/Topi

c No. Topic Name No of

Classes

Required I Introduction : Propositional Calculus

Propositional Calculus: Statements and Notations, Connectives,

Well Formed Formulas, Truth Tables, Tautologies, Equivalence of

Formulas, Duality Law, Tautological Implications, Normal Forms,

Theory of Inference for Statement Calculus, Consistency of

Premises, Indirect Method of Proof.

Propositional Calculus: Statements and Notations, Connectives,

Well Formed Formulas, Truth Tables, Tautologies, Equivalence of

Formulas, Duality Law, Tautological Implications, Normal Forms,

Theory of Inference for Statement Calculus, Consistency of

Premises, Indirect Method of Proof.

1

Statements and Notations, Connectives

1

Well Formed Formulas, Truth Tables 1

Tautologies, Equivalence of Formulas 1

Duality Law, Tautological Implications 1

Normal Forms 3

Theory of Inference for Statement Calculus 1

Consistency of Premises 1

Indirect Method of Proof 1

Predicate Calculus: Predicative Logic, Statement Functions 1

Variables and Quantifiers, Free and Bound Variables 1

Inference Theory for Predicate Calculus.

1

Tutorial -1(Truth tables, normal forms)

Assignment

II Introduction: Operations on Binary Sets 1

Principle of Inclusion and Exclusion 1

Relations: Properties of Binary Relations 1

Relation Matrix and Digraph, Operations on Relations 1

Partition and Covering, Transitive Closure 1

Equivalence Relations, Hasse Diagrams 1

Compatibility and Partial Ordering Relations 1

Functions: Bijective Functions, Composition of Functions 1

Inverse Functions,Recursive Functions

1

Permutation Functions 1

Lattice and its Properties 1

Tutorial -1(Properties of relations,Hasse diagrams)

Assignment

III Introduction: Algebraic Structures 1

Algebraic Systems, Examples, General Properties 1

Semi Groups and Monoids, Homomorphism of Semi Groups and Monoids

1

Group, Subgroup, Abelian Group, Homomorphism, Isomorphism 2

Number Theory:Properties of Integers, The Greatest Common

Divisor

1

Division Theorem , Least Common Multiple 1 Euclidean Algorithm,Testing for Prime Numbers 1

The Fundamental Theorem of Arithmetic 1

Modular Arithmetic (Fermat’s Theorem and Euler’s Theorem)

1

Tutorial -1(Euclidean Algorithm, Group, Subgroup, Abelian Group)

Assignment

IV Introduction: Combinatorics

1

Basic of Counting, Permutations, Permutations with Repetitions 1

Circular Permutations, Restricted Permutations 1

Combinations, Restricted Combinations 1

Generating Functions of Permutations and Combinations 1

Binomial and Multinomial Coefficients 1

Binomial and Multinomial Theorems 1


The Principles of Inclusion–Exclusion

1

Pigeonhole Principle and its Application

1

Tutorial -1(Binomial and Multinomial Theorems)

Assignment

V Introduction 1

Generating Functions, Function of Sequences, Partial Fractions 1

Calculating Coefficient of Generating Functions 1

Recurrence Relations, Formulation as Recurrence Relations 1

Solving Recurrence Relations by Substitution and Generating Functions

1

Method of Characteristic Roots 1

Solving Inhomogeneous 2

Tutorial -1(Recurrence Relations)

Assignment

VI Introduction 1

Basic Concepts of Graphs, Sub graphs 1

Matrix Representation of Graphs 1

Adjacency Matrices, Incidence Matrices 1

Isomorphic Graphs, Paths and Circuits 1

Eulerian and Hamiltonian Graphs 2

Multigraphs, Planar Graphs 1 Euler’s Formula, Graph Colouring and Covering 1

Chromatic Number 1

Spanning Trees 1

Algorithms for Spanning Trees 1

Tutorial -1(Isomorphic Graphs, Chromatic Number)

Assignment

Total No. of hours: 64

QUESTION BANK

S.N

O

QUESTION BLOOMS

TAXONO

MY

LEVEL

Mapped

with CO

UNIT – I

1 Find the truth table for the propositional formula:(p↔q) ↔(q→p) 2 CO 1

2 What is a well formed formula? What rules of well formed formulas Explain.

3 CO 1

3 Explain in brief duality law? 2 CO 1

4 Find DNF of ┐(P→(qΛr)) 5 CO 1

5 Give the truth tables for conjunction and disjunction. 2 CO 1

6 Explain about PDNF and PCNF. 3 CO 1

7 What is mean by contradiction? Explain it with an example. 2 CO 1

8 Define tautology? Explain with an example? 3 CO 1

9 Define contradiction? Explain with an example? 3 CO 1

10 Explain the two rules of inference. 3 CO 1

11 Explain detail about logical connectives with examples? 3 CO 1

12

Find the disjunctive normal forms of the following:

(┐p↔r)Λ(q↔p)

7 CO 1

13 Show that the premises a (b c), d (b∧ ¬c), a∧ b are inconsistent 10 CO 1

14 Explain conjunctive normal form and find PCNF of (P ( Q R) ) ( P ( Q R )

7 CO 1

15 Write the following statement in symbolic form : 10 CO 1


All men are mortal.

Socrates is a man.

Therefore Socrates is mortal.

16 Show that R→S can be derived from the premises P→(Q→S),┐RvP

and Q.

10 CO 1

17 Obtain PDNF of P→(P→Q)Λ┐(┐Qv┐P). 7 CO 1

18 Obtain the canonical product of sums of the propositional formula: (PΛQ) V (┐QΛR).

7 CO 1

19 Using rules of inference demonstrate that R is a valid inference from

the premises P→Q,Q→R and P.

8 CO 1

20 Derive the following , using rule CP if necessary. ┐PVQ,┐QVR,R→S => P→S

8 CO 1

UNIT – II

1 Define equivalence relation? 4 CO 2

2 Show that the function f(x,y) = x+y is primitive recursive. 7 CO 2

3 Define compatibility relation? 4 CO 2

4 Define one-one and onto functions with examples. 2 CO 2

5 Define poset. 2 CO 2

6 Define transitive closure. 3 CO 2

7 Define in degree and out degree with example. 3 CO 2

8 Define lattice and properties of lattice . 3 CO 2

9 Define distributive lattice with example. 3 CO 2

10 Explain Hasse diagram with example. 4 CO 2

11 Define Relation ? List out the Properties of Binary operations? 3 CO 2

12 Draw the Hasse diagram of (P(S),≤), where P(S) is power set of the set S = {a,b,c}.

5 CO 2

13 Let the relation R be R= {(2,1),(3,2),(3,3)} on the set A={1,2,3}.

What is the transitive closure of R?

5 CO 2

14 Let A={1, 2,3 ,4} and f and g be functions from A to A given by

f={(1,4), (2,1), (3,2),(4,3)} and g={ (1,2), (2,3), (3,4), (4,1) prove that

f and g are inverse of each other.

5 CO 2

15 If A={1, 2,3,4}, B{w, x, y, z} and f={(1,w),(2,x),(3,y),(4,z)}then Prove that f is both one-to-one and onto.

5 CO 2

16 Draw the Hasse diagram of (A,≤), where A= {1,2,3,4}. 6 CO 2

17 Explain in brief about Inversive and Recursive functions with

examples?

3 CO 2

18 Draw the Hasse diagram of (P(S),≤), where S= {1,2,3,4}. 6 CO 2

19 Let X={1,2,3,4,5,6,7} and R= { (x,) / x-y is divisible by 3} in X.

Show that R is an equivalence Relation.?

6 CO 2

20 If A={1,2,3,4} and R is a relation on A defined by R=

{(1,2),(1,3),(2,4),(3,2),(3,3),(3,4)}, Find and and write their

digraphs.

6 CO 2

UNIT – III

1 Explain in brief about Least common multiple with example? 3 CO 3

2 Explain in brief about GCD with example? 3 CO 3

3 Explain prime factorisation with example? 3 CO 3

4 Find the LCM and HCF of 6 and 20 by prime factorization method. 5 CO 3

5 Check whether the following are prime or not?

337, 577, 252, and 157

5 CO 3

6 Find the HCF of 96 and 404 by prime factorization method. 5 CO 3

7 Prove that for all integers a, b, c, (i) if a b , then a bc (ii) if a b ,

and b c then a c for all a,b,c integers

4 CO 3

8 Find GCD and LCM of m=320and n=512 7 CO 3

9 Verify 287 is prime or not? 5 CO 3


10 What are the properties of binary operations? 3 CO 3

11 Explain brief about Properties of integers? 3 CO 3

12 Explain in brief about Fermats theorem? 3 CO 3

13 Explain in brief about Division theorem? 3 CO 3

14 Explain in brief about Eulers theorem? 3 CO 3

15 Explain in brief about Euclidian algorithm? 3 CO 3

16 Define abelian group with example? 3 CO 3

17 Define Congruence and discuss basic properties of congruence with proof.

3 CO 3

18 Find d=gcd(4977+405 ) and find the integers u an v such that d=

4977u+405v

7 CO 3

19 Let G={-1,0,1}. Verify that G forms an abelian group under addition? 4 CO 3

20 Define monoid,semi group,group and abelian group. 2 CO 3

UNIT – IV

1 What is the Pigeonhole principle? 2 CO 4

2 Find the number of permutations of the EVERGREEN word? 3 CO 4

3 Find the number of permutations of the MISSISSIPPI word? 3 CO 4

4 Find the number of permutations of the NARENDRA MODI word? 3 CO 4

5 Explain multinomial theorem. 3 CO 4

6 Explain principle of inclusion and exclusion for n sets. 2 CO 4

7 . Find the number of permutations of the MATHEMATICS word? 3 CO 4

8 Define binomial theorem. 2 CO 4

9 Find the number of permutations of the JNTUK word? 3 CO 4

10 Find the number of permutations of the ENGINEERING word? 3 CO 4

11 How many positive integers not exceeding 2000 are divisible by 2,5,7

or 11.

5

12 Find n if i) P(n,2)=72 ii) P(n,4)= 42p(n,2) iii )2P(n,2)+50=p(2n,2) 5 CO 4

13 In how many ways can four students be selected out of twelve students

i) If two particular students are not included at all?

ii) Two particular students included?

3 CO 4

14 . Answer the following: i) In how many ways can six men and four women sit in a row?

ii) In how many ways can they sit in a row if all the men sit together?

iii) In how many ways can they sit in a row if just the women sit together?

iv) In how many ways can they sit in a row if men sit together?

3 CO 4

15 Consider the six digits 1, 2, 3, 5, 6, and 7. Assuming that repetitions

are permitted, answer the following: i) How many ways 4 digit

numbers can be formed from the six digits 1, 2, and 3,5,6,7? ii) How many of these numbers are less than 4000? iii) How many of these

numbers in (i) are even? iv) How many of these numbers in (i) are

odd? v) How many of these numbers in (i) are multiple of 5? vi) How many of these numbers in (i) contain both the digits 5,7?

3 CO 4

16 How many positive integers not exceeding 100 are divisible by 3,5,7. 5 CO 4

17 Show that (S, ≤) is a lattice. Where S= {1,2,3,4}.Also show that (S,

≤) is a distributive lattice.

7 CO 4

18 Show that (S, /) is a lattice. Where S= {1,2,5,10}.Also show that (S,

/) is a distributive lattice.

7 CO 4

19 Define lattice and write their properties. 3 CO 4

20 What is the coefficient of in the expansion of (2 -

3x + )6

7 CO 4


UNIT – V

1 Find an explicit formula for the Fibonacci numbers. 5 CO 5

2 Explain about recurrence relation? 2 CO 5

3 Find the Generating function of -2? 5 CO 5

4 Find Generating function of 2(n-1)? 5 CO 5

5 Explain about partial fractions? 4 CO 5

6 Find Generating function of ? 5 CO 5

7 Solve the recurrence relation +2, = 1 using iteration

method.

5 CO 5

8 Explain about the method of Characteristics Roots? 4 CO 5

9 Solve the recurrence relation , = 1 using iteration

method.

5 CO 5

10 Find Generating function of ? 2 CO 5

11 Solve the recurrence relation -2 + =2, =25, =16 7 CO 5

12 Solve the recurrence relation – 2 - 3 = 0, n>= 2 by the

generating Function method = 3 , = 1.

8 CO 5

13 Solve the recurrence relation –7 +10 = 6+8n, = 1 , =2. 7 CO 5

14 Solve the recurrence relation +n, = 1 using iteration

method.

8 CO 5

15 What is a Generating function and explain the operations on

generating functions?

7 CO 5

16 Solve the recurrence relation of the sequence of numbers fn=fn-1+fn-

2 ,n>=2 With the initial condition f0=1,f1=1.

7 CO 5

17

Solve the recurrence relation =4 -4 , = 2 , =8

using G.F.

7 CO 5

18 Solve the recurrence relation =4 -4 , =1 , =1 7 CO 5

19 Solve the recurrence relation =4 -4 . 7 CO 5

20 Solve -4 = 9 7 CO 5

UNIT – VI

1 What is walk ,trail, path and circuit? Explain with an example. 2 CO 6

2 Define bipartite graph ? 3 CO 6

3 Define Euler graph and Hamilton graph Explain with an example . 3 CO 6

4 Define and explain planar graphs Explain with examples . 3 CO 6

5 Define and explain chromatic number. 3 CO 6

6 Explain isomorphic graphs? 4 CO 6

7 Define and explain minimal spanning tree. 2 CO 6

8 How many vertices will the graph contain 6 edges and all vertices

of degree 3?

5 CO 6

9 Define adjacency and incident matrices? 4 CO 6

10 Define coloring of agraph? 2 CO 6

11 Write conditions of chromatic number. 3 CO 6

12 Define chromatic number and find chromatic number of . 5 CO 6

13 Show that is non-planar. 5 CO 6

14 Explain BFS. 7 CO 6

15 Explain Kruskals algorithm with an example. 7 CO 6

16 Explain Prims algorithm with an example. 7 CO 6

17 A complete binary tree has 25 leaves .How many vertices does it

have?

8 CO 6

18 Show that the number of vertices of odd degree is even. 3 CO 6

19 Show that if the number of vertices of a connected graph is n and the

number of edges m and the region then r+n-m=2.

3 CO 6

20 Explain DFS. 7 CO 6


E-Learning Material

NPTEL, IIT & Other (Video lectures)

1. https://www.youtube.com/watch?v=xlUFkMKSB3Y

2. https://www.youtube.com/watch?v=wRMC-ttjhwM

3. https://www.youtube.com/watch?v=EfsbN5YbcPQ



Recommended books

1. Discrete Mathematics, Proofs, Structures and applications, 3rd ed, CRC Press

2.Discrete Mathematics, S.Santha, Cengage

.

Prepared by

B.Aruna, Asst.prof., Dept. of S&H, KHIT


Course Title : Digital Logic Design

Sub code: : C203


Course Coordinator : Ch. RAMAKRISHNA REDDY

Course Advisor (if any) : Ch. RAMAKRISHNA REDDY

Module Coordinator : Ch. RAMAKRISHNA REDDY



Course coordinator location : Room No.: 2T-15

Course Coordinator availability : Friday 2.30pm – 4.15pm

Saturday 2.30pm – 4.15pm

Resource link:

Pre-requisites Courses: ----

Course Description: Digital Logic Design is foundational to the fields of electrical engineering and computer engineering.

Digital Logic designers build complex electronic components that use both electrical and computational

characteristics. These characteristics may involve power, current, logical function, protocol and user input. Digital Logic Design is used to develop hardware, such as circuit boards and microchip

processors. This hardware processes user input, system protocol and other data in computers,

navigational systems, cell phones or other high-tech systems.



2. Assignment work.




1. Digital Design, 5/e, M.Morris Mano, Michael D Ciletti, PEA.

2. Fundamentals of Logic Design, 5/e, Roth, Cengage.

3. Digital Logic and Computer Design, M.Morris Mano, PEA.

Software Links:

1. http://www.engrcs.com/courses/engr250/engr250lecture.pdf

2. https://en.wikipedia.org/wiki/Digital_electronics Reference Books

1. Digital Logic Design, Leach, Malvino, Saha, TMH.

2. Modern Digital Electronics, R.P. Jain, TMH. Freely Accessible Internet Sites

http://american.cs.ucdavis.edu/academic/ecs154a.sum14/postscript/cosc205.pdf https://books.google.co.in/books?id=WAdktAtutbsC&printsec=frontcover&source=gbs_ge_summary_r&cad=0#v=onepage&q&f=false

Computer Software

a. Tina pro

b. Multisim


Quiz

Assignments.

University Exams.


http://american.cs.ucdavis.edu/academic/ecs154a.sum14/postscript/cosc205.pdf

https://books.google.co.in/books?id=WAdktAtutbsC&printsec=frontcover&source=gbs_ge_summary_r&cad=0#v=onepage&q&f=false

https://books.google.co.in/books?id=WAdktAtutbsC&printsec=frontcover&source=gbs_ge_summary_r&cad=0#v=onepage&q&f=false


SYLLABUS

UNIT I:

Digital Systems and Binary Numbers: Digital Systems, Binary Numbers, Binary Numbers,

Octal and Hexadecimal Numbers, Complements of Numbers, Complements of Numbers,

Signed Binary Numbers, Arithmetic addition and subtraction.

UNIT II:

Concept of Boolean algebra: Basic Theorems and Properties of Boolean algebra, Boolean

Functions, Canonical and Standard Forms, Min terms and Max terms.

UNIT III:

Gate level Minimization: Map Method, Two-Variable K-Map, Three-Variable K-Map, Four

Variable K-Maps. Products of Sum Simplification, Sum of Products Simplification, Don’t –

Care Conditions, NAND and NOR Implementation, Exclusive‐OR Function

UNIT IV:

Combinational Logic: Introduction, Analysis Procedure, Design Procedure, Binary Adder–

Subtractor, Decimal Adder, Binary Multiplier, Decoders, Encoders, Multiplexers, HDL Models

of Combinational Circuits.

UNIT V:

Synchronous Sequential Logic: Introduction to Sequential Circuits, Storage Elements:

Latches, Storage Elements: Flip‐Flops, Analysis of Clocked Sequential Circuits, Mealy and

Moore Models of Finite State Machines,

UNIT VI:

Registers and Counters: Registers, Shift Registers, Ripple Counters, Synchronous Counters,

Ring Counter, Johnson Counter, Ripple Counter. TEXT BOOKS:

1. Digital Design, 5/e, M.Morris Mano, Michael D Ciletti, PEA.

2. Fundamentals of Logic Design, 5/e, Roth, Cengage. REFERENCES:

1. Digital Logic and Computer Design, M.Morris Mano, PEA.

2. Digital Logic Design, Leach, Malvino, Saha, TMH.

3. Modern Digital Electronics, R.P. Jain, TMH

COURSE OBJECTIVES

1. To introduce the basic tools for design with combinational and sequential digital logic

and state machines.

2. To learn simple digital circuits in preparation for computer engineering

COURSE OUTCOMES (COs)

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

CO1: An ability to define different number systems, binary addition and subtraction, 2’s

complement representation and operations with this representation.

CO2: An ability to understand the different switching algebra theorems and apply them for

logic functions.

CO3: An ability to define the Karnaugh map for a few variables and perform an algorithmic

reduction of logic functions.

CO4: An ability to design the Different Combinational logic Circuits for logic functions.

CO5: An ability to design the Different Sequential logic Circuits for logic functions.

CO6: An ability to design the Different Registers and counters for logic functions


Mapping of COs with Pos

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

Unit/Topic


Required

UNIT-1

I Digital Systems and Binary Numbers

1.1 Introduction to Number Systems

1

1.2 Introduction Decimal NS and arithmetic’s 1

1.3 Introduction to Binary NS 1

1.31 Binary to decimal conversion 1

1.32 Decimal to Binary convertion 1

Tutorial -1(Conversions)

1.33 Binary arithmetic’s 3

1.4 Introduction to Octal NS 1

1.41 Octal to decimal conversion 1


1.42 Binary to octal conversion 1

1.43 Octal to binary conversion 1

1.44 Decimal to octal conversion 1

1.45 Octal arithmetic’s 1

1.5 Introduction Octal NS 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: An ability to define

different number systems,

binary addition and subtraction,

2’s complement representation

and operations with this

representation

3 2 1 2

CO2: An ability to understand

the different switching algebra

theorems and apply them for

logic functions

2 1

CO3: An ability to define the

Karnaugh map for a few

variables and perform an

algorithmic reduction of logic

functions .

3 1 1 1

CO4: An ability to design the

Different Combinational logic

Circuits for logic functions.

3 2 2 1 2 3


Different Sequential logic

Circuits for logic functions .

2 2 3


Different Registers and counters

for logic functions.

2 2 2 2 2 2



1.51 Binary to Hexadecimal conversion 1

1.52 Octal to Hexadecimal conversion 1

1.53 Decimal to Hexadecimal conversion 1

1.54 Hexadecimal to Decimal conversion 1

1.55 Hexadecimal to Octal conversion 1


1.56 Hexadecimal to Binary conversion 1

1.57 Hexadecimal arithmetic’s 1

1.6 Complements of Numbers 2

Tutorial -1(Complements of Numbers)

1.7 Signed Binary Numbers 2

UNIT-2

II Concept of Boolean algebra:

2.1 Basic Theorems and Properties of Boolean algebra 5

Tutorial -II(Theorems)

2.2 Boolean Functions 1

2.3 Canonical and Standard Forms 2

Tutorial - II(Theorems)

2.4 Minterms 1

2.5 Maxterms 1

UNIT-3

III Gate level Minimization:

3.1 Map Method 1

3.2 Two-Variable K-Map. 2

3.3 Three-Variable K-Map 2

Tutorial -III(Three-Variable K-Map)

3.4 Four Variable K-Maps 3

Tutorial -III(Four-Variable K-Map)

3.5 Products of Sum Simplification 1

3.6 Sum of Products Simplification 1

3.7 Don’t – Care Conditions 2

3.8 Exclusive OR Function 1

Tutorial -III(Don’t – Care Conditions)

3.9 NAND and NOR Implementation 3

UNIT-4

IV Combinational Logic:

4.1 Introduction, Analysis Procedure, Design Procedure 1

4.2 Binary Adder–Subtractor 1

Tutorial -IV(Binary Adder–Subtractor)

4.3 Decimal Adder 1

4.4 Binary Multiplier 1

4.5 Decoders 2

4.6 Encoders 2

Tutorial -IV(Decoders)

4.7 Multiplexers 2

4.8 HDL Models of Combinational Circuits. Variables

2

Tutorial -IV(Multiplexers)

UNIT-5

V

Synchronous Sequential Logic:


5.1 Introduction to Sequential Circuits & Storage Elements 1

5.2 Latches 2

5.3 Flip-Flops 2

Tutorial -V(Flip-Flops)

5.4 Analysis of Clocked Sequential Circuits 2

5.5 Mealy and Moore Models of Finite State Machines.

2

Tutorial -V(Analysis of Clocked Sequential Circuits)

UNIT-6

VI Registers and Counters:

6.1 Registers

Programming, Turtle Graphics 1

6.2 Shift Registers 2

6.3 Ripple Counters 2

Tutorial -VI(Shift Registers)

6.4 Synchronous Counters 3

6.5 Ring Counter 1

6.6 Johnson Counter 1

Tutorial -VI(Ring Counter) Total No. of hours: 75

Curricular Gaps:

1. Weighted Codes and Non-Weighted Codes 4

2. Logic Gates 2

3. PLD’s 3

QUESTION BANK

Unit

No. Sl.No. Questions

Bloom’s

Taxonomy level

Mapped with

CO

I

1. Convert (i) (615.25)8 to (?)10, (?)2 & (?)16.

(ii) (12.125)10 to (?)8, (?)2 & (?)16.

(iii) (1101.111)2 to (?)10, (?)8 & (?)16.

(iv) (6A5.B5)16 to (?)10, (?)2 & (?)8.

3 CO 1

2.

The solutions of quadratic equation

are

Identify the base of the

system.

2 CO 1

3.

Represent -45,+45,-65&+65 in (i)sign magnitude

form (ii) sign 1’s complement form (iii) sign 2’s

complement form.

4 CO 1

4. Evaluate using Add and Subtract in BINARY (i)

1111 & 1010 (ii) 100100 & 10110 8 CO 1

5. Solve (28)10 - (15)10 using 6-bit 2’s complement

subtraction. 5 CO 1

6.

Solve (i) 5250-321 (ii)3570-2100 (iii) 20-100

using 9’s complement subtraction and 10’s

complement subtraction.

6 CO 1

7.

Solve (i) 325010-7253210 (ii) 7253210-325010

using10’s complement subtraction and what did

you infer from results.

7 CO 1

8.

Solve arithmetic operations indicated below and verify answers if left most position is sign bit and

negative numbers are in 2’s complement form

(i)101011+111000 (ii)111001-001010

9 CO 1

9. Solve (i) 32508-725328 (ii) 7253210-325010 using 7 CO 1


7’s complement subtraction and 16’s complement

subtraction. what did you infer from results.

10. Solve (i) 32508-725328 (ii) 7253210-325010 using 1’s complement subtraction and 10’s complement

subtraction.

10 CO 1

11. Describe 2’s complement form and 2’s

complement form of subtraction with example. 1 CO 1

12. Consider 2’s complement form and solve 325010-

7253210. 8 CO 1

II

1. List out basic Boolean theorems and properties and give proofs of each property and theorem.

2 CO 2

2.

Conclude that AND-OR network is equivalent to

(i)NAND-NAND network and (ii) NOR-NOR

network. 8 CO 2

3. Classify universal gates? Why are they called so? 7 CO 2

4. Represent XOR & XNOR using Universal gates. 4 CO 2

5.

Modify the following equations into standard sop

(i)f(A,B,C,D)= A’B+BC+CD’+ACD

(ii)f(A,B,C,D)= (A+B’+C) (A+D) (B’+C’)

(A+B+C)

5 CO 2

6.

Modify the following equations into canonical pos

(i)f(A,B,C,D)= A’B+BC+CD’+ACD

(ii)f(A,B,C,D)= (A+B’+C) (A+D) (B’+C’) (A+B+C)

6 CO 2

7.

Represent the following functions using (i) NAND

gates (ii) NOR gates

F1=A(B+CD)+(BC) F2=WX’+X’Y(Z+W’)

3 CO 2

8. Conclude ((AB)’+A’+AB)’=0 8 CO 2

9.

Reduce the following Boolean expressions

AB’(C+BD)+A’B’A’B’C+(A+B+C’)’+A’B’C’D

9 CO 2

10.

Write the complement of the following Boolean

expressions

X’YZ+XZ XY+X(WZ+WZ’)

10 CO 2

11. State the Demorgan’s theorems and simplify the

expression. (((AB)’+ABC)’+A(B+AB’))’. 1 CO 2

12. Reduce {(CD)’+A}’+A+CD+AB. 7 CO 2

III

1.

Apply K-MAP

(i)f(a,b,c,d)=∑(0,2,3,6,7)+d(8,10,11,15)

(ii)f(w,x,y,z)=π(4,5,6,7,8,12) φ(1,2,3,9,11,14) 5 CO 3

2.

Apply K-MAP and implement using NAND gates

(i)f(a,b,c,d)=∑(1,2,4,6,7,8,11,12,13) to POS form.

(ii)f(w,x,y,z)=π(1,3,7,11,15) φ(0,2,5) to SOP form.

6 CO 3

3.

Analyze Y= Ʃ m

(3,6,7,8,10,12,14,17,19,20,21,24,25,27,28) using

K-Map method.

7 CO 3

4. Write minimal SOP and minimal POS expressions for the following function

F(A,B,C,D)= Ʃ m (0,1,1,5,8,9,10).

9 CO 3

5.

Solve the following Boolean expression using X-

NOR and NOR gates F=AB’CD’+A’BCD’+AB’C’D+A’BC’D.

10 CO 3


6.

Consider K-MAP and simplify

f(a,b,c,d)=∑(0,1,3,4,5,6,7,8,9,10,12,14)

f(a,b,c)=π(0,2,4,6)

8 CO 3

7.

Modify using K-MAP and implement using AOI

logic

f(a,b,c,d)=∑(1,2,4,6,7,8,11,12,13) to POS form. f(w,x,y,z)=π(1,3,7,11,15) φ(0,2,5) to SOP form

3 CO 3

8.

Represent the following Boolean expression using

X-OR and OR gates

F=AB’CD’+A’BCD’+AB’C’D+A’BC’D.

4 CO 3

9. Reproduce Y=∑ (0,1,4,5,16,17,21,25,29) using K-

Map method. 1 CO 3

10.

Consider K-MAP simplification and implement

using AOI logic f(a,b,c,d)=∑(1,2,4,12,13)+d(5,6,7 to POS form.

f(w,x,y,z)=π(1,3,9,11,15) φ(0,2,5) to SOP form

8 CO 3

IV

1.

Design

(i) HALF ADDER (ii) HALF SUBTRACTOR

(iii) FULL ADDER

(iv) FULL SUBTRACTOR

9 CO 4

2. Explain 4 bit ripple adder/subtractor with suitable

example. 7 CO 4

3.

Design

(i) 4bit magnitude comparator (ii) 5bit magnitude comparator

10 CO 4

4.

Summarize the following code converters

(i) GRAY-BINARY (ii) BINARY-BCD

(iii) BCD-XS3

(iv) XS3-BINARY

(v) INARY-GRAY

8 CO 4

5. Design (i) octal to binary encoder

(ii) 4 bit priority encoder 9 CO 4

6.

Reproduce HALF SUBTRACTOR and FULL

ADDER using (i) MUX (ii) DEMUX (iii) DECODER

2 CO 4

7.

Apply decoder and external gates for following

(i) F1=X’Y’Z’+XZ F2=XY’Z’+X’Y

F3=X’Y’Z’+XY

(ii) F1=∑(0,1,3,6,7)

F2=∑(0,2,4,7)

5 CO 4

8. Represent following using LOGIC GATE (i) 3 to 8

decoder (ii) 4 to 16 mux (iii) 1x16 demux 4 CO 4

9.

Analyze following using (i) 4 input mux (ii) 8x1

mux (iii) 3 to 8 decoder (iv) 2 to 4 decoder F1=∑(0,1,3,6,7)

7 CO 4

10.

Apply (i) 4 input mux (ii) 8x1 mux (iii) 16x1 mux

for following F1=∑(0,1,3,4,8,9,15)

6 CO 4

11. Convert 4 to 16 decoder into demux 3 CO 4

V

1. Explain the operation of (a) SR latch using NOR

gates (b) Gated D latch using NAND gates 7

CO5

2. Explain the operation of negative edge triggered D flip-flop when CP=1.

7 CO5


3.

Define is RACE AROUND condition? How can

we eliminate it? Explain MASTER SLAVE JK

flip-flop and state its advantages.

2 CO5

4. Explain the operation of positive edge triggered JK

flip-flop in detail. 3 CO5

5. Distinguish combinational & sequential logic

circuits? 8 CO5

6. Interpret different methods used to trigger a flip-

flop? 6 CO5

7. Define flip-flop? Design basic flip-flop circit with NAND gates.

1 CO5

8. Write EXCITATION tables and TRUTH tables of

(a) D (b) T (c) JK (d) SR flip-flops. 10 CO5

9. Determine characteristic equations of (a) D (b) T (c) JK (d) SR flip-flops.

5 CO5

10.

Justify the following terms with respect to flip-

flops (a)Setup time (b) Hold time (c) Propagation

delay (d) Preset (e) Clear (f) Latch

8 CO5

11. Convert the following flip-flops (a) JK to D (b) T

to D (c) D to SR (d) SR to JK (e) T to SR 4 CO5

VI

1.

Distinguish Asynchronous & Synchronous

sequential logic circuits? 8

CO6

2.

With neat diagram explain operation of (a)3 bit

universal shift register. (b) 4 bit controlled buffer

register.

7 CO6

3. illustrate Johnson’s counter using a 2 bit shift register. Draw waveforms and list applications of

shift register.

5 CO6

4.

Describe about parallel in serial out shift register.

How to load data word ABCD=1101 in the 4 bit bidirectional shift register in shift left mode.

2 CO6

5. Sketch a register for left & right shift of data for

10110101. 9 CO6

6. Differentiate ring counter and twisted ring counter. Draw and explain about 4 bit ring counter.

8 CO6

7. Explain about synchronous ripple counter and

compare merits and demerits. 3 CO6

8. Explain about 4 bit ripple down counter using

positive edge triggered flip-flop. 4 CO6

9. Define ripple counter. Design BCD ripple counter. 1 CO6

10. Explain about working of 4 bit asynchronous counter.

7 CO6

11.

Design (a) mod-12 synchronous up counter using

’T’ flip-flop. (b) mod-10 synchronous down

counter using ’JK’ flip-flop. (c) mod-6 synchronous up counter using ’D’ flip-flop. (d)

mod-6 synchronous down counter using ’SR’ flip-

flop.

10 CO6

12. A counter has 14 stable states 0000 to 1101.if input frequency is 50KHz Compute it’s output

frequency?

6 CO6


E-learning materials NPTEL

1. https://www.youtube.com/watch?v=CeD2L6KbtVM

2. https://www.youtube.com/watch?v=sUutDs7FFeA

3. https://www.youtube.com/watch?v=95kv5BF2Z9E 4. https://www.youtube.com/watch?v=FwJalVfvn50&list=PL803563859BF7ED8C&index=5

5. https://www.youtube.com/watch?v=i_HYxdri69Y&index=8&list=PL803563859BF7ED8C

6. https://www.youtube.com/watch?v=ibQBb5yEDlQ&index=16&list=PL803563859BF7ED8C 7. https://www.youtube.com/watch?v=4CRPlaBnfV0&index=18&list=PL803563859BF7ED8C

8. https://www.youtube.com/watch?v=O3If0Nr9to0&index=26&list=PL803563859BF7ED8C

9. https://www.youtube.com/watch?v=QrZgp0SAUFQ&index=29&list=PL803563859BF7ED8C

10. https://www.youtube.com/watch?v=RZQTTfU9TNA&list=PL803563859BF7ED8C&index=30

Question-Papers html 1. http://www.khitguntur.ac.in/cse.php#cseqp.php

Recommended books

1. Digital Circuits by A.Anand kumar.

2. Switching theory and Logic design by A.Anand kumar

Prepared by

Ch. Rama Krishna Reddy, Asst.prof., Dept. of CSE,

https://www.youtube.com/watch?v=CeD2L6KbtVM

https://www.youtube.com/watch?v=sUutDs7FFeA

https://www.youtube.com/watch?v=95kv5BF2Z9E

https://www.youtube.com/watch?v=FwJalVfvn50&list=PL803563859BF7ED8C&index=5

https://www.youtube.com/watch?v=i_HYxdri69Y&index=8&list=PL803563859BF7ED8C

https://www.youtube.com/watch?v=ibQBb5yEDlQ&index=16&list=PL803563859BF7ED8C

https://www.youtube.com/watch?v=4CRPlaBnfV0&index=18&list=PL803563859BF7ED8C

https://www.youtube.com/watch?v=O3If0Nr9to0&index=26&list=PL803563859BF7ED8C

https://www.youtube.com/watch?v=QrZgp0SAUFQ&index=29&list=PL803563859BF7ED8C

https://www.youtube.com/watch?v=RZQTTfU9TNA&list=PL803563859BF7ED8C&index=30


Course Title : Python Programming

Sub code: : C204


Course Coordinator : Dr. B.TARAKESWARA RAO

Course Advisor (if any) : Dr. B.TARAKESWARA RAO

Module Coordinator : Dr. B.TARAKESWARA RAO



Course coordinator location : Room No.: IS-01



Resource link: https://www.python.org/downloads/

Pre-requisites Courses: C and C++ Programming

Course Description:

In this course students will learn about the fundamentals of computers and understand the

various steps in Program development. It provides the syntax and semantics of Python

Programming Language. This course makes how to write modular and readable Python

Programs. It also makes to write programs using structured and OOP programming approach in

Python to solve problems.



2. Assignment work.




1. Python Programming: A Modern Approach, Vamsi Kurama, Pearson

2. Learning Python, Mark Lutz, Orielly

3. Think Python, Allen Downey, Green Tea Press

4. Core Python Programming, W.Chun, Pearson.

5. Introduction to Python, Kenneth A. Lambert, Cengage

Software Links:

1. https://www.python.org/

2. https://en.wikipedia.org/wiki/List_of_Python_software Reference Books


2. Learning Python, Mark Lutz, Orielly Freely Accessible Internet Sites

https://www.python.org/about/gettingstarted/

https://www.tutorialspoint.com/python/

https://www.python.org/about/gettingstarted/ Computer Software

a. Windows XP or Later versions

b. Python3.6.1


Quiz

Assignments.

University Exams.



https://www.tutorialspoint.com/python/



SYLLABUS

UNIT-I

Introduction: History of Python, Need of Python Programming, Applications Basics of Python

Programming Using the REPL(Shell), Running Python Scripts, Variables, Assignment,

Keywords, Input-Output, Indentation.

UNIT- II

Types, Operators and Expressions: Types - Integers, Strings, Booleans; Operators-

Arithmetic Operators, Comparison (Relational) Operators, Assignment Operators, Logical

Operators, Bitwise Operators, Membership Operators, Identity Operators, Expressions and

order of evaluations Control Flow- if, if-elif-else, for, while, break, continue, pass.

UNIT- III

Data Structures Lists: Operations, Slicing, Methods; Tuples, Sets, Dictionaries, Sequences.

Comprehensions.

UNIT- IV

Functions - Defining Functions, Calling Functions, Passing Arguments, Keyword Arguments,

Default Arguments, Variable-length arguments, Anonymous Functions, Fruitful

Functions(Function Returning Values), Scope of the Variables in a Function : Global and Local

Variables.

Modules: Creating modules, import statement, from. Import statement, name spacing,

Python packages: Introduction to PIP, Installing Packages via PIP, Using Python Packages

UNIT- V

Object Oriented Programming OOP in Python: Classes, 'self variable', Methods,

Constructor Method, Inheritance, Overriding Methods, Data hiding.

Error and Exceptions: Difference between an error and Exception, Handling Exception, try

except block, Raising Exceptions, User Defined Exceptions.

UNIT- VI

Brief Tour of the Standard Library - Operating System Interface - String Pattern Matching,

Mathematics, Internet Access, Dates and Times, Data Compression, Multithreading, GUI

Programming, Turtle Graphics.

Testing: Why testing is required ?, Basic concepts of testing, Unit testing in Python, Writing

Test cases, Running Tests.

TEXT BOOKS:


2. Learning Python, Mark Lutz, Orielly

REFERENCES:

1. Think Python, Allen Downey, Green Tea Press

2. Core Python Programming, W.Chun, Pearson.

3. Introduction to Python, Kenneth A. Lambert, Cengage

COURSE OBJECTIVES

1. To learn History and importance of Python and its basics.

2. To learn operators and control structures of Python.

3. To examine Python Data structures like List Sets, Tuples and Dictionaries.

4. To learn Python packages and its modular programming.

5. To explore Object oriented futures of Python.

6. To learn standard libraries and Test cases of Python.

COURSE OUTCOMES (COs)

CO1: Analyze the features of Python.

CO2: Use of operators and control structures in python

CO3: Use various python data structures.


CO4: Analyze the packages of Python and its functions

CO5: Use of Object oriented features in python.

CO6: Analyze standard libraries and test cases of python.


LESSON PLAN

Unit/Topic


Required

I Introduction

1.1 History of Python

1

1.2 Need of Python Programming 1

1.3 Applications Basics of Python Programming Using the REPL(Shell) 1

1.4 Running Python Scripts 1

1.5 Variables 1

Tutorial -1(Installation of Python) 1

1.6 Assignment 1

1.7 Keywords

1

1.8 Input-Output, Indentation 1

II Types, Operators and Expressions:

2.1 Types - Integers, Strings, Booleans; 1

2.2 Operators: Arithmetic Operators, Comparison (Relational) Operators 1

Tutorial -1(How to work with Python) 1

2.3 Assignment Operators, Logical Operators, Bitwise Operators 1

2.4 Membership Operators, Identity Operators 1

2.5 Expressions and order of evaluations 1

2.6 Control Flow- if, if-elif-else 1

2.7 for, while 1

Tutorial -1(Programs on Python Operators) 1

2.8 break, continue, pass 1

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: Analyze the features of Python

CO2: Use of

operators and control

structures in python

3

3

1

3

1

2

1

CO3: Use various python data structures

1 1 2 1 3 2 3 1

CO4: Analyze the

packages of Python

and its functions

1 2 3 2 2 3 3 1

CO5: Use of Object oriented features in python

2 2

CO6: Analyze standard libraries and test cases of python

2 2 2 3 2 1


III Data Structures

3.1 Lists 1

3.2 Lists - Operations. 1

3.3 Slicing 1

3.5 Tuples 1

Tutorial -1(Programs on Python Control Structures) 1

3.6 Sets 1

3.7 Dictionaries 1

3.8 Sequences, Comprehensions

1

IV Functions

4.1 Defining Functions 1

4.2 Calling Functions 1

Tutorial -1(Programs on List) 1

4.3 Passing Arguments 1

4.4 Keyword Arguments , Default Arguments 1

4.5 Variable-length arguments 1

4.6 Anonymous Functions 1

4.7 Fruitful Functions(Function Returning Values) 1

Tutorial -1(Programs on Sets and sequences) 1

4.8 Scope of the Variables in a Function - Global and Local

Variables

1

4.9 Modules: Creating modules, import statement 1

4.10 From. Import statement, name spacing 1

4.11 Python packages: Introduction to PIP 1

4.12 Using Python Packages, Installing Packages via PIP 1

Tutorial -1(Programs on Functions) 1

V

Object Oriented Programming OOP in Python:

5.1 Classes 1

5.2 self variable 1

5.3 Methods 1

5.4 Constructor Method 1

5.5 Inheritance 1

Tutorial -1(Programs on Functions with arguments) 1

5.6 Inheritance Examples 1

5.7 Overriding Methods 1

5.8 Data hiding 1

5.9 Error and Exceptions: Difference between an error and Exception 1

5.10 Handling Exception, try

except block

1

Tutorial -1(Programs on Python Packages) 1

5.11 Raising Exceptions 1

5.12 User Defined Exceptions 1

VI Brief Tour of the Standard Library

6.1 Operating System Interface

Programming, Turtle Graphics

1

6.2 String Pattern Matching 1

6.3 Mathematics 1

Tutorial -1(Programs on classes and methods) 1

6.4 Internet Access 1

6.4 Dates and Times 1

6.5 Data Compression 1

6.6 Multithreading 1


6.7 GUI 1

Tutorial -1(Programs on Inheritance) 1

6.8 Testing: Why testing is required? 1

6.9 Basic concepts of testing 1

6.10 Unit testing in Python 1

6.11 Writing and Running Tests

Test cases

2

Tutorial -1(Programs on Exception Handling ) 1


QUESTION BANK

Unit

No.

Sl.No. Questions Bloom’s

Taxonomy

level

Mapped

with CO

I

1 Discuss about Python and its importance. 2 CO 1

2 Explain the importance of python programming. 5 CO 1

3 Write and explain the Features of Python. 5 CO 1

4 Write a program to read element from commandline and

print as it is.

4 CO 1

5 Write a short note on the following a. Variable

b. Keywords

c. Input/output statements in Python

1 CO 1

II

1 Discuss about Operators in Python? Explain with

example.

1 CO 2

2 Explain the control structures in Python. 5 CO 2

3 Write a short note on following: a. Strings

b. Integers

c. Booleans

4 CO 2

4 Write an example on break and continue in python. 4 CO 2

5 Differentiate while loop and for loop? 2 CO 2

6 Write a program add.py that takes 2 numbers as

command line arguments and prints its sum.

2 CO 2

7 Write a program that prints out the decimal equivalents of 1/2, 1/3, 1/4, . . . , 1/10 using for loop.

2 CO 2

8 Write a program to count the numbers of characters in

the string.

2 CO 2

III

1 Explain about the List data structure in python. 4 CO 3

2 List out the differences between List and Set data

structures in python.

1 CO 3

3 Write and explain about the Dictionaries with suitable

example.

1 CO 3

4 Discuss about the following

a. Sequences

b. Comprehensions

2 CO 3

5 Write a short note on Slicing. 1 CO 3

6 Write a program to count frequency of characters in a

given file.

5 CO 3

IV

1 Write and explain about the functions in python. 3 CO 4

2 Discuss about the following a. Anonymous functions

b. Fruitful functions

c. Variable length arguments

2 CO 4

https://docs.python.org/2/faq/general.html#what-is-python


3 Discuss about modules in python with suitable example. 2 CO 4

4 Write a short note on python packages. 5 CO 4

5 Write a function unique to find all the unique elements of a list.

5 CO 4

V

1 Define exception. Write exceptions handling process in

python

1 CO 5

2 Discuss about user defined exceptions in python with example.

1 CO 5

3 Differentiate Exception and error with example. 2 CO 5

4 Write a short note on following:

a. Inheritance b. Method overriding

c. Data hiding

2 CO 5

5 Differentiate Method and Constructor. 2 CO 5

VI

1 Discuss about Turtle graphs in python. 2 CO 6

2 Write and explain Multithreading in python. 2 CO 6

3 Discuss about unit testing in python. 2 CO 6

4 Write a short note on String pattern matching. 4 CO 6

5 Write and explain a test case in python. 4 CO 6

6 Write a GUI for an Expression Calculator using tk. 5 CO 6

7 Write a test-case to check the function reverse string

which returns the reversed string.

5 CO 6


NPTEL, IIT, & Other

1.https://www.youtube.com/playlist?list=PL2UlrhJ_JwyD84Thz1Mg3KVVkaI1YyQ7L

2. https://www.youtube.com/playlist?list=PLiVuYHRFwOQzw-RgEA19Jf88BGpH-Iq6t

3. https://www.youtube.com/playlist?list=PL9FAE4422FA13FDE4

4. https://www.youtube.com/watch?v=dmCzzQ5AGEI

5. https://www.youtube.com/watch?v=s4BXykRTHCc



Recommended books:

1. Python: The Complete Reference – by Martin C. Brown, OSBORNE.

2. Programming Python, 4th Edition – By Mark Lutz O'Reilly Media.

3. Python Programming for the Absolute Beginner – by Michael Dawson CENGAGE

Learning, 3rd Edition

Prepared by

Dr. B.TARAKESWARA RAO, Prof., Dept. of CSE, KHIT


Course Title: Data Structures through C++

Sub code : C305


Course Coordinator : Mr. Ch Samsonu

Course Advisor (if any) : Mr. Ch Samsonu

Module Coordinator : Mr. Ch Samsonu Course coordinator phone : 9849268278

Course coordinator e-mail : [email protected] Course coordinator location : Room No.:Exam Cell

Course Coordinator availability : Monday 9:30am - 10:30am Friday

2.30pm – 3.15pm

Resource link:

Pre-requisites Courses: C++

Course Description:

In this course students will learn about the different techniques to organize the data

structures. The student will know how to use different data structures in various applications



2. Assignment work.



Overview of learning resources:

Prescribed & Suggested Text Books

1. Data structures, Algorithms and Applications in C++, S.Sahni, University Press (India)

Pvt.Ltd, 2nd edition, Universities Press, Pvt. Ltd.

2. Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education.

Ltd., Second Edition.

3.Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and .Mount,

Wiley student edition, John Wiley and Sons

REFERENCE BOOKS: 1. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek, Thomson 2. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI.

3. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education Freely Accessible Internet Sites

1. opendatastructures.org/ods-cpp.pdf

2. https://freeebookdownload.blogspot.com/2016/06/data-structures-using- c.html

Computer Software

a.Turbo C

b.gcc

Overview of assessment:

Internal Test.

Quiz

Assignments.

University Exams

SYLLABUS UNIT-I:Arrays: Abstract Data Types and the C++ Class, An Introduction to C++ Class- Data

Abstraction and Encapsulation in C++- Declaring Class Objects and Invoking Member

Functions- Special Class Operations- Miscellaneous Topics- ADTs and C++Classes, The

Array as an Abstract Data Type, The Polynomial Abstract Data type- Polynomial



Representation- Polynomial Addition. Spares Matrices ,Introduction- Sparse Matrix

Representation- Transposing a Matrix- Matrix Multiplication, Representation of Arrays.

UNIT-II: Stacks and Queues: Templates in C++, Template Functions- Using Templates to

Represent Container Classes, The Stack Abstract Data Type, The Queue Abstract Data Type,

Subtyping and Inheritance in C++, Evaluation of Expressions, Expression- Postfix Notation-

Infix to Postfix.

UNIT-III: Linked List: Single Linked List and Chains, Representing Chains in C++,

Defining a Node in C++- Designing a Chain Class in C++- Pointer manipulation in C++-

Chain Manipulation Operations, The Template Class Chain, Implementing Chains with

Templates- Chain Iterators- Chain Operations- Reusing a Class, Circular Lists, Available

Space Lists, Linked Stacks and Queues, Polynomials, Polynomial Representation- Adding

Polynomials- Circular List Representation of Polynomials, Equivalence Classes, Sparse

Matrices, Sparse Matrix Representation- Sparse Matrix Input- Deleting a Sparse Matrix,

Doubly Linked Lists, Generalized Lists, Representation of Generalized Lists- Recursive

Algorithms for Lists- Reference Counts, Shared and Recursive Lists

UNIT-IV: Trees: Introduction, Terminology, Representation of Trees, Binary Trees, The

Abstract Data Type, Properties of Binary Tress, Binary Tree Representations, Binary Tree

Traversal and Tree Iterators, Introduction, Inorder Traversal Preorder Traversal, Postorder

Traversal, Thread Binary Trees, Threads, Inorder Traversal of a Threaded Binary Tree,

Inserting a Node into a Threaded Binary Tree, Heaps, Priority Queues, Definition of a Max

Heap, Insertion into a Max Heap, Deletion from a Max Heap, Binary Search Trees, Definition,

Searching a Binary Search Tree, Insertion into a Binary Search Tree, Deletion from a Binary

Search Tree, Height of Binary Search Tree

UNIT-V: Graphs The Graph Abstract Data Type, Introduction, Definition, Graph

Representation, Elementary Graph Operation, Depth First Search, Breadth First Search,

Connected Components, Spanning Trees, Biconnected Components, Minimum Cost Spanning

Trees, Kruskal S Algorithm, Prims Algorithm Sollin’ s Algorithm, Shortest Paths and

Transitive Closure, Single Source/All Destination: Nonnegative Edge Cost, Single Source/All

Destination: General Weights, All-Pairs Shortest Path, Transitive Closure

UNIT-VI: Sorting: Insertion Sort, Quick Sort, Merge Sort Merging, Iterative Merge Sort,

Recursive Merge Sort, Heap Sort

TEXT BOOKS:

1. Data structures, Algorithms and Applications in C++, S.Sahni, University Press (India)

Pvt.Ltd, 2nd edition, Universities Press, Pvt. Ltd.

2. Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education.

Ltd.,Second Edition.

3. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and .Mount,

Wiley student edition, John Wiley and Sons

REFERENCE BOOKS:

1. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek, Thomson

2. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI.

3. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education. COURSE OBJECTIVES:

1. To be familiar with basic techniques of object oriented principles and exception handling

using C++ and array application to represent polynomials and sparse matrix.

2. To be familiar with stack and queue data structures.

3. To be familiar with Linked list data structures.

4. To be familiar with advanced data structures such as balanced search trees, AVLTrees, and

B Trees.

5. To be familiar with graph and its applications

6. To be familiar with different sorting techniques


Course Outcomes:

By the end of the course student will be able to

CO1: Abstract Data Type(ADT), Array data structure and apply array representation for

polynomials and its applications, sparse matrix representations

CO2: Stack and Queue ADT representation and uses of these in different

applications.

CO3: Linked list ADT representation and applications that are using Linked list,

CO4: Incorporate data structures into the applications such as binary search trees,

AVL and B Trees

CO5: Implementing data structure Graph and applications of graph data structures.

CO6: Implement the various sorting techniques Mapping of COs with POs

LESSON PLAN

Prerequisite: Engineering mathematics & Engineering physics Unit/Topi

c No.

Topic Name No of

Classes Required

I ARRAYS

1.1 Abstract Data Types and the C++ Class: An Introduction to C++ Class 1 1.2 Data Abstraction and Encapsulation in C 1

1.3 Declaring Class Objects and Invoking Member Functions 1

1.4 Special Class Operations- Miscellaneous Topics: ADTs and C++Classes 1

1.5 The Array as an Abstract Data Type 2

1.6 The Polynomial Abstract Data type- Polynomial Representation 2

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: Abstract Data Type(ADT), Array data structure and apply array representation for polynomials and its applications, sparse matrix representations

3

1

2

3

CO2: Stack and Queue ADT representation and uses of these in different applications

3

2

3

2

CO3:Linked list ADT representation and applications that are using Linked list

3

2

2

2

2

CO4: Incorporate data structures into the applications such as binary search trees, AVL and B Trees

3

2

2

3

CO5: Implementing data structure Graph and applications of graph data structures

2

3

2

2

3

3

CO6: Implement the various sorting techniques

3

3

3

3

3

2


1.7 Polynomial Addition 1

1.8 Spares Matrices,Introduction- Sparse Matrix Representation 1

1.9 Transposing a Matrix- Matrix Multiplication, Representation of Arrays 1

II STACKS AND QUEUES

2.1 Templates in C++, Template Functions- Using Templates to Represent 1

2.2 The Stack Abstract Data Type 2

2.3 The Queue Abstract Data Type 2

2.4 Sub typing and Inheritance in C++ 1

2.5 Evaluation of Expressions, Expression- Postfix Notation- Infix to Postfix 2

III LINKED LISTS

3.1 Single Linked List and Chains 1

3.2 Representing Chains in C++ 1

3.3 Defining a Node in C++- Designing a Chain Class in C++ 1

3.4 Pointer manipulation in C++ 1

3.5 Chain Manipulation Operations, The Template Class Chain, Implementing Chains with Templates

1

3.6 Chain Iterators- Chain Operations- Reusing a Class 1

3.7

Circular Lists, Available Space Lists 1

3.8 Linked Stacks and Queues 1

3.9 Polynomials, Polynomial Representation- Adding Polynomials 1

3.10 Circular List Representation of Polynomials 1

3.11 Equivalence Classes, Sparse Matrices, Sparse Matrix Representation- Sparse Matrix Input- Deleting a Sparse Matrix

2

3.12 Doubly Linked Lists, Generalized Lists, Representation of Generalized Lists

1

3.13 Recursive Algorithms for Lists- Reference Counts, Shared and Recursive Lists

1

IV TREES

4.1 Introduction, Terminology, Representation of Trees 1 4.2 Binary Trees, The Abstract Data Type, Properties of Binary Tress 1 4.3 Binary Tree Representations, Binary Tree Traversal and Tree Iterators 1 4.4 Introduction, Inorder Traversal Preorder Traversal, Postorder Traversal 1 4.5 Thread Binary Trees, Threads, Inorder Traversal of a Threaded Binary 1 4.6 Inserting a Node into a Threaded Binary TreeCommon Collector 1 4.7 Heaps, Priority Queues 1 4.8 Definition of a Max Heap, Insertion into a Max Heap, Deletion from a 1 4.9 Binary Search Trees, Definition, Searching a Binary Search Tree,

Insertion into a Binary Search Tree, Deletion from a Binary Search Tree, Height of Binary Search Tree.

2 V GRAPHS 5.1 The Graph Abstract Data Type, Introduction, Definition, Graph

Representation, Elementary Graph Operation 2

5.2 Depth First Search, Breadth First Search 1 5.3 Connected Components 1 5.4 Spanning Trees, Biconnected Components, Minimum Cost Spanning

Trees, Kruskal S Algorithm, Prims Algorithm Sollin’ s Algorithm 2

5.5 Shortest Paths and Transitive Closure, Single Source/All Destination 1 5.6 Single Source/All Destination: General Weights, All-Pairs Shortest Path,

Transitive Closure 2

VI SORTING 6.1 Insertion Sort, 1 6.2 Quick Sort 1 6.3 Merge Sort Merging, Iterative Merge Sort, Recursive 1 6.4 Heap Sort 1 6.6 Analysis of different sorting techniques 2 ** 2 to 3 topics 1 1


*** Note Minimum classes: 60

Maximum classes : 75


QUESTION BANK

S.NO

QUESTION

BLOOMS

TAXONOMY

LEVEL

Mapped with

CO

UNIT – I

1 Explain sparse matrix representation using array with an example.

Discuss the advantage and disadvantages of this method.

4 CO1

2 Discuss matrix multiplication with an example. 2 CO1

3 Define polynomial ADT 2 CO1

4 Define data structure. Discuss different types of data structure their

implementations applications.

5 CO1

5 What is an array? Discuss different types of array with examples. 6 CO1

6 Explain how to implement polynomial ADT using array. Discuss

its Advantages and Disadvantages.

5 CO1

7 Explain polynomial addition using arrays. 6 CO1

UNIT – II

1 Write an algorithm to insert and delete a key from circular queue. 6 CO2

2 Explain the procedure to convert infix expression to postfix

expression with the following expression: ((A – (B+C) * D) /

(E+F))

4 CO2

3 List the application of stacks. 1 CO2

4 Define queue full condition. 1 CO2

5 Write an algorithm for basic operations of stack. 3 CO2

6 Explain the procedure to evaluate postfix expression. Evaluate the following postfix expression 7 3 4 + - 2 4 5 /+ * 6 / 7 +?

4 CO2

8 Explain the operations performed on simple queue with an

example.

6 CO2

9 Convert following expression X+( Y * Z) – (( N * M +O) /P) in to post form.

5 CO2

UNIT – III

1 List various operations of linked list and explain how to insert a

node anywhere in the list.

6 CO3

2 Show how to reverse a single linked list. 7 CO3

3 Write recursive algorithm for lists. 5 CO3

4 Explain the procedure to insert and delete element from sparse

matrix.

4 CO3

5 Write an algorithm to push and pop an element from linked stack 6 CO3

6 Discuss sparse matrix representation using linked list. 4 CO3

7 What is the degree of a graph? 2 CO3

UNIT – IV

1 List the different tree traversals 2 CO4

2 Define spanning tree. 2 CO4

3 Explain binary tree ADT. 4 CO4

4 Discuss representation of binary tree using arrays and linked list. 8 CO4

5 Define binary search tree. Show how to insert and delete an

element from binary search tree.

7 CO4

6 Write algorithm to insert and delete an element from binary search

tree.

6 CO4

7 Construct max heap for the following: 140, 80 , 30 , 20 ,10 ,40 ,30

,60 ,100 ,70 ,160 ,50 , 130, 110, 120

5 CO4

UNIT – V

1 Define in-degree and out-degree of a graph.. 2 CO5

2 Explain Warshall’s algorithm to find transitive closure of a graph

with a sutable example.

7 CO5


3 Write Prim’s algorithm. 4 CO5

4 What is a graph? Explain the properties of graphs. 6 CO5

5 Write breadth first traversal algorithm. Explain with an example. 6 CO5

6 What are connected components of graph? Is there a method to

find out all the connected components of graph? Explain.

4 CO5

7 Explain Prim’s algorithm with an example. 6 CO5

8 What is planer graph? 1

UNIT – VI

1 What is the best sorting technique? Why? 2 CO6

2 State and explain insertion sort with example. 8 CO6

3 Differentiate between iterative merge sort and recursive merge

sort.

7 CO6

4 Rearrange following numbers using quick sort: 10, 6, 3, 7, 17, 26,

56, 32, 72

6 CO6

5 Write a program to sort the elements using radix sort. 7 CO6

6 Write algorithm for merge sort. 6 CO6

7 Discuss how to sort elements using merge sort with suitable

example.

5 CO6

8 Time complexity of quick sort 2 CO6


NPTEL

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



http://www.manaresults.co.in/oqp/RT21042052017.pdf

Recommended books

Data structures, Algorithms and Applications in C++, S.Sahni, University Press (India) Pvt.Ltd,

2nd edition, Universities Press, Pvt. Ltd.

Prepared by

Ch.Samsonu, Asst.Prof., Dept. of CSE, KHIT

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




Course Title: Computer Graphics

Sub code : C306


Course Coordinator : Mr. K KRANTHI KUMAR

Course Advisor (if any) : Mr. K KRANTHI KUMAR

Module Coordinator : Mr. V.RAJIV JETSON



Course coordinator location : Room No.:



Resource link:

Pre-requisites Courses: Mathematics –I

Students should have knowledge of geometry, graphs and matrix

Course Description:

In this course students will learn about the fundamentals of Basic principles and techniques for

computer graphics on modern graphics hardware. Students will gain experience in interactive

computer graphics using the OpenGL API. Topics include: 2D viewing, 3D viewing,

perspective, lighting, and geometry.



2. Assignment work.



Overview of learning resources:

Prescribed & Suggested Text Books

1. Donald Hearn, Pauline Baker, Computer Graphics – C Version, second edition

Pearson Education, 2004.

2. F.S. Hill, Computer Graphics using OPENGL, Second edition, Pearson Education,

Reference Books

1. James D. Foley, Andries Van Dam, Steven K. Feiner, John F. Hughes,

2. Computer Graphics- Principles and practice, Second Edition in C, Pearson

Education, 2007.

3. C from Theory to Practice, G S. Tselikis and N D. Tselikas, CRC Press.

4. Basic computation and Programming with C, Subrata Saha and S. Mukherjee,


https://www.tutorialspoint.com/computer_graphics/

Computer Software

Turbo C+


Quiz

Assignments.

University Exams.

SYLLABUS UNIT-I:

2D Primitives Output primitives – Line, Circle and Ellipse drawing algorithms - Attributes

of output primitives – Two dimensional Geometric transformations - Two dimensional

viewing – Line, Polygon, Curve and Text clipping algorithms


https://www.tutorialspoint.com/computer_graphics/


UNIT-II:

3D Concepts Parallel and Perspective projections - Three dimensional object representation –

Polygons, Curved lines, Splines, Quadric Surfaces, - Visualization of data sets -

3Dtransformations – Viewing -Visible surface identification.

UNIT-III:

Graphics Programming Color Models – RGB, YIQ, CMY, HSV – Animations – General

Computer Animation, Raster, Keyframe - Graphics programming using OPENGL – Basic

graphics primitives –Drawing three dimensional objects - Drawing three dimensional scenes

UNIT- IV: Rendering Introduction to Shading models – Flat and Smooth shading – Adding texture to

faces –Adding shadows of objects – Building a camera in a program – Creating shaded

objects– Rendering texture – Drawing Shadows.

UNIT- V: Fractals Fractals and Self similarity – Peano curves – Creating image by iterated functions –

Mandelbrot sets – Julia Sets – Random Fractals

UNIT- VI:

Overview of Ray Tracing Intersecting rays with other primitives – Adding Surface texture

Reflections and Transparency – Boolean operations on Objects.

TEXT BOOKS

1. Donald Hearn, Pauline Baker, Computer Graphics – C Version, second edition Pearson

Education,2004.

2. F.S. Hill, Computer Graphics using OPENGL, Second edition, Pearson Education, 2003

REFERENCE BOOKS:

1. James D. Foley, Andries Van Dam, Steven K. Feiner, John F. Hughes, Computer Graphics-

Principles and practice, Second Edition in C, Pearson Education, 2007. COURSE OBJECTIVES:

1. To develop, design and implement two dimensional graphical structures

2. To develop, design and implement three dimensional graphical structures

3. To enable students to acquire knowledge Multimedia compression and animations

4. To learn Creation, Management and Transmission of Multimedia objects.

5. To Learn Curves and surfaces -- methods for rendering and shading curved objects

6. To learn shading algorithms -- determining how a surface should be shaded to produce

realistic illustrations

Course Outcomes:

By the end of the course student will be able to

CO1: Know and be able to describe the general software architecture of programs that use2D

computer graphics

CO2: Know and be able to describe the general software architecture of programs

that use3D computer graphics.

CO3: Know and be able to discuss hardware system architecture for computer graphics. This

Includes, but is not limited to: graphics pipeline, frame buffers, and graphic Accelerators/co -

processors,

CO4: Know and be able to select among models for lighting/shading: Color, ambient light;

distant and light with sources; Phong reflection model; and shading (flat, smooth, Gourand,

Phong)

CO5: Know techniques of Curve Drawing, Fractals and Sets.

CO6: Implement the various sorting techniques


Mapping of COs with POs

LESSON PLAN

Prerequisite: Engineering mathematics & Engineering physics Unit/Topic

No. Topic Name No of

Classes

Required

I 2D Primitives

1.1 Output Primitives 1

1.2 Line, 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: Know and be

able to describe the

general software

architecture of

programs that use2D

computer graphics

3

2

1

1

CO2: Know and be

able to describe the

general software

architecture of

programs that use3D

computer graphics

2

3

2

2

CO3: Know and be

able to discuss

hardware system

architecture for

computer graphics.

This Includes, but is

not limited to:

graphics pipeline,

frame buffers, and

graphic

3

1

2

2

CO4: Know and be

able to select among

models for

lighting/shading:

Color, ambient light;

distant and light with

sources; Phong

reflection model; and

shading (flat, smooth,

Gourand, Phong)

1

2

2

CO5: Know

techniques of Curve

Drawing, Fractals and

Sets

1

2

3

2

CO6: Know and able

to learn Ray Tracing

1

3

2

2


1.3 Circle and Ellipse drawing algorithms 3

1.4 Attributes of output primitives 1

1.5 Two dimensional Geometrical Transformations 3

1.6 Two dimensional viewing 1

1.7 Line, Polygon 1

1.8 Curve and Text clipping algorithms 2

II 3D Concepts

2.1 Parallel and Perspective projections 1

2.2 Three dimensional object representation 2

2.3 Polygons, 1

2.4 Curved lines 1

2.5 Splines, 1

2.6 Quadric Surfaces, 1

2.7 Visualization of data sets 1

2.8 3Dtransformations 3

2.9 Viewing -Visible surface identification.

1

III Color Models

3.1 RGB, 1

3.2 YIQ, 1

3.3 CMY, 1

3.4 HSV 1

3.5 Animations 1

3.6 General Computer Animation, 1

3.8 Raster, 1

3.9 Keyframe 1

3.10 Graphics programming 1

3.11 using OPENGL 1

3.12 Basic graphics primitives 1

3.13 Drawing three dimensional objects 1

IV Rendering

4.1 Introduction to Shading models 1

4.2 Flat and Smooth shading 2

4.3 Adding texture to faces 1

4.4 Adding shadows of objects 3

4.5 Building a camera in a program 1

4.6 Creating shaded objects 1

4.7 Rendering texture 1

4.8 Drawing Shadows 2

V Fractals

5.1 Fractals 2

5.2 Self similarity 1

5.3 Peano curves 1

5.4 Creating image by iterated 2

5.5 Functions 1

5.6 Mandelbrot sets 1

5.7 Julia Sets 1

5.8 Random Fractals 3


VI Overview of Ray Tracing –

6.1 Intersecting rays 2

6.3 with other primitives 1

6.4 Adding Surface texture –

1

6.5 Reflections and Transparency 2

6.6 Boolean operations on Objects 2

Total No. of hours: 70 to 75

*** Note Minimum classes: 60

Maximum classes : 75

QUESTION BANK

UNIT – I Blooms

taxonomy

Mapping

with outcome

1 Explain the Bresenham’s line drawing algorithm 4

CO2

2 Explain the midpoint circle drawing algorithm. Assume 10cm as the radius and co-ordinate origin as the center of the

circle

4

3 Explain (a) random and raster scan devices (b) primitives used for filling

3

4 Explain about filled area primitives 3

5 Explain D viewing pipeline in detail 3

6 Explain Cohen-Sutherland’s line clipping algorithm. 4

7 Derive the viewing Transformation matrix in detail 6

8 Explain polygon clipping algorithm 3

9 Explain the different 2D transformations 4

10 Explain the about the lines of attribute primitives? 3

UNIT – II

1 Explain about parallel and perspective projection in detail? 9

CO2

2 Discuss the concept of three dimensional object

representations?

8

3 Explain curved line and splines 9

4 Explain about quadric surface in detail? 9

5 Discuss about the concept of Visualization of data sets? 7

6 Explain about 3D Transformation in detail? 3

7 Explain the concept of 3D viewing in detail? 4

8 What are the methods of visible surface detection? 2

9 What is back face detection ?give one example 1

10 Write the concept of painter’s method? 1

UNIT – III

1 What is the importance of graphics programming? 2

CO3

2 Write short note on the following color models:

I. RGB

II. YIQ III. CMY

IV. HSV

2

3 What is computer animation? give one example 1

4 Explain about general computer animation techniques? 3

5 Discuss about raster animation in detail? 9

6 Discuss about key frame systems? 4

7 What are basic graphics primitives? 2

8 Write the concept of drawing three dimensional objects? 2

9 Write the concept of drawing three dimensional scenes? 2


10 What is animation sequence? 2

UNIT – IV

1 What is rendering? give one example 1

CO4

2 What is shading ?give one example 1

3 Explain the concept of shading models? 4

4 Discuss the concept of flat and smooth shading? 7

5 Write the concept of adding textures to faces? 2

6 Write the concept of adding shadows of objects? 9

7 Discuss about the concept of building a camera in a program?

9

8 Explain the concept of creating shaded objects? 3

9 Discuss about rendering textures? 3

10 Discuss about drawing shadows? 2

UNIT – V

1 Discuss about the concept of Fractals and self similarity? 3

CO5

2 Explain about the concept of peano curves? 9

3 What is creating image by iterated functions? 2

4 What are Mandelbrot sets? Give example? 4

5 Explain about Julia sets? Give example? 3

6 Explain about Random Fractals? Give example? 4

UNIT – VI

1 What is meant by intersecting rays? 2

CO6

2 Give the relationship between intersecting rays and primitives?

2

3 Write the concept of adding surface textures? 9

4 What is reflection and transference? 2

5 Write the concept of Boolean operation on objects? 2


NPTEL





Recommended books

Data structures, Algorithms and Applications in C++, S.Sahni, University Press (India) Pvt.Ltd,

2nd edition, Universities Press, Pvt. Ltd.

Prepared by

K.Kranthi Kumar, Asst.Prof., Dept. of CSE, KHIT





SUBJECT TITLE: Data Structures through C++ Lab

FACULTYMEMBER: Ms. S. Sri Lakshmi Parvathi

Aim and objective of the course:

Students should know how to implement and execute the different data structures in the

machine.

Objectives of Course:

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

1. To develop skills to design and analyze simple linear and non linear data structures.

2. To Strengthen the ability to identify and apply the suitable data structure for the given

real world problem

3. To Gain knowledge in practical applications of data structures

Course Outcomes:

1. Able to implement different types of linked list.

2. Able to implement circular queue

3. Able to implement Binary Search Tree

4. Able to implement minimum spanning tree, shortest paths in a graph.

5. Able to implement BFS and DFS

6. Able to implement different sorting techniques

Syllabus:

Lab Experiments:

1. Implementation of Singly linked list.

2. Implementation of Doubly linked list.

3. Implementation of Multistack in a Single Array.

4. Implementation of Circular Queue

5. Implementation of Binary Search trees.

6. Implementation of Hash table.

7. Implementation of Heaps.

8. Implementation of Breadth First Search Techniques.

9. Implementation of Depth First Search Techniques.

10. Implementation of Prim’s Algorithm.

11. Implementation of Dijkstra’s Algorithm.

12. Implementation of Kruskal’s Algorithm

13. Implementation of MergeSort

14. Implementation of Quick Sort

15. Implementation of Data Searching using divide and conquer technique


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 implement different types of linked list

3 3

CO2: Able to implement circular queue

2 3 3

CO3: Able to implement Binary Search Tree

2 3 3


Equipments & Software required:

Software:

i.) Turbo C

References:

earning materials:


Precautions:

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

Prepared by

Ch. Samsonu, Assoc.prof., Dept. of CSE, KHIT

CO4: Able to implement

minimum spanning tree, shortest paths in a graph

3 3

CO5: Able to implement BFS and DFS

1 2 2 2

CO6: Able to implement different sorting techniques

3 3 2 2



SUBJECT TITLE: PYTHON PROGRAMMING LAB

FACULTYMEMBER: Dr. B.Tarakeswara rao/ Mr.P.Lakshmikanth/ Mr. Mahesh Reddy

Aim and objective of the course:

Python is an easy-to-learn. It is a powerful modern programming language. It has high-level

data structures and a simple but effective approach to object-oriented programming. Python is

an interpreted language, which can save you time during program development because no

compilation and linking is necessary. The interpreter can be used interactively, which makes it

easy to experiment with features of the language, and to test functions during bottom-up

program development. Python also allows you to split up your program in modules that can be

reused in other Python programs. It comes with a large collection of standard modules that you

can use as the basis of your programs. There are also built-in modules that provide things like

file I/O, system calls, sockets, and interfaces to GUI toolkits Objectives of Course:

1. Introduction to Scripting Language

2. Exposure to various problems solving approaches of computer science

3. Analyze the features of Python.

4. Use of operators and control structures in python

5. Use various python data structures.

6. Analyze the packages of Python and its functions

7. Use of Object oriented features in python.

8. Analyze standard libraries and test cases of python.. Course Outcomes:

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

1. To write Python programs using operators

2. To write Python programs using control structures.

3. To write Python programs using Data structures like List Sets, Tuples and Dictionaries.

4. To use Python packages and its modular programming.

5. To write Python programs using Object oriented futures of Python

6. To use standard libraries and Test cases of Python

Syllabus:

Lab Experiments:

List of Experiments (Sixteen experiments to be done)

Exercise 1 - Basics

a) Running instructions in Interactive interpreter and a Python Script

b) Write a program to purposefully raise Indentation Error and Correct it

Exercise 2 - Operations

a) Write a program to compute distance between two points taking input from the user

(Pythagorean Theorem)

b) Write a program add.py that takes 2 numbers as command line arguments and prints its sum.

Exercise - 3 Control Flow

a) Write a Program for checking whether the given number is a even number or not.

b) Using a for loop, write a program that prints out the decimal equivalents of 1/2, 1/3, 1/4, . . . 1/10

c) Write a program using a for loop that loops over a sequence. What is sequence ?

d) Write a program using a while loop that asks the user for a number, and prints a countdown

from that number to zero.

Exercise 4 - Control Flow - Continued

a) Find the sum of all the primes below two million.

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By

starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...


b) By considering the terms in the Fibonacci sequence whose values do not exceed four

million, find the sum of the even-valued terms.

Exercise - 5 - DS

a) Write a program to count the numbers of characters in the string and store them in a

dictionary data structure

b) Write a program to use split and join methods in the string and trace a birthday with a

dictionary data structure.

Exercise - 6 DS - Continued

a) Write a program combine_lists that combines these lists into a dictionary.

b) Write a program to count frequency of characters in a given file. Can you use character

frequency to tell whether the given file is a Python program file, C program file or a text file?

Exercise - 7 Files

a) Write a program to print each line of a file in reverse order.

b) Write a program to compute the number of characters, words and lines in a file.

Exercise - 8 Functions

a) Write a function ball_collide that takes two balls as parameters and computes if they are

Colliding. Your function should return a Boolean representing whether or not the balls are

Colliding. Hint: Represent a ball on a plane as a tuple of (x, y, r), r being the radius If (distance

between two balls centers) <= (sum of their radii) then (they are colliding)

b) Find mean, median, mode for the given set of numbers in a list.

Exercise - 9 Functions - Continued

a) Write a function nearly_equal to test whether two strings are nearly equal. Two strings a and b

are nearly equal when a can be generated by a single mutation on b.

b) Write a function dups to find all duplicates in the list.

c) Write a function unique to find all the unique elements of a list.

Exercise - 10 - Functions - Problem Solving

a) Write a function cumulative_product to compute cumulative product of a list of numbers.

b) Write a function reverse to reverse a list. Without using the reverse function.

c) Write function to compute gcd, lcm of two numbers. Each function shouldn’t exceed one line.

Exercise 11 - Multi-D Lists

a) Write a program that defines a matrix and prints

b) Write a program to perform addition of two square matrices

c) Write a program to perform multiplication of two square matrices

Exercise - 12 - Modules

a) Install packages requests, flask and explore them. Using (pip)

b) Write a script that imports requests and fetch content from the page. Eg. (Wiki)

c) Write a simple script that serves a simple HTTPResponse and a simple HTML Page

Exercise - 13 OOP

a) Class variables and instance variable

i) Robot ii) ATM Machine

Exercise - 14 GUI, Graphics

1. Write a GUI for an Expression Calculator using tk.

2. Write a program to implement the following figures using turtle.

Exercise - 15 - Testing

a) Write a test-case to check the even numbers

b) Write a test-case to check the function reverse_string which returns the reversed string.


Exercise - 16 - Advanced

a) Build any one classical data

b) Write a program to solve knapsack problem.


Equipments & Software required:

Software:

i.) Operating system (UNIX, Linux, Windows XP or earlier versions)

ii) Python 3.6.1 Version

References:

1. Python Programming: A Must Read Introduction to Python Programming

by Robert Richards.

2. Beginning Python: From Novice to Professional, 2nd Edition (The Experts Voice in

Open Source) (Books for Professionals by Professionals) 2nd Edition, by Magnus Lie

Hetland.

3. Learning Python, 5th Edition 5th Edition, by Mark Lutz.

4. Python Pocket Reference: Python In Your Pocket (Pocket Reference (O'Reilly)) 5th

Edition by Mark Lutz

E-Learning materials:


2. https://www.youtube.com/watch?v=vVPB2E8xANs

3. https://www.youtube.com/playlist?list=PLE2FD418285B14940

Precautions:

1. Care should be taken while performing the experiment

2. Loose connections must be avoided

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

Prepared by

Dr. B.TARAKESWARA RAO, 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: Analyze the

features of Python

1 1

CO2: Use of

operators and control

structures in python

2 1 2 1 1

CO3: Use various

python data structures.

2 1 2 2 3 2 2

CO4: Analyze the

packages of Python

and its functions.

2 1 1 2 2 2 1 3 1 2 3

CO5: Use of Object

oriented features in

python.

1 1

CO6: Analyze

standard libraries and test cases of python.

2 2 2 2 2 2 1 3 1 2 3

http://www.goodreads.com/book/show/23860991-python-programming

http://www.goodreads.com/author/show/61074.Robert_Richards

https://www.amazon.com/s/ref=dp_byline_sr_book_1?ie=UTF8&text=Magnus+Lie+Hetland&search-alias=books&field-author=Magnus+Lie+Hetland&sort=relevancerank

https://www.amazon.com/s/ref=dp_byline_sr_book_1?ie=UTF8&text=Magnus+Lie+Hetland&search-alias=books&field-author=Magnus+Lie+Hetland&sort=relevancerank

https://www.amazon.com/Mark-Lutz/e/B000APH2C4/ref=dp_byline_cont_book_1

https://www.amazon.com/Mark-Lutz/e/B000APH2C4/ref=dp_byline_cont_book_1


https://www.youtube.com/watch?v=vVPB2E8xANs

https://www.youtube.com/playlist?list=PLE2FD418285B14940


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


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


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


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


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)khitguntur.ac.in/csehandouts/2017-18/ii b.tech i sem cse...

Documents