B.Tech CSE Structure and Syllabus PDF

GAYATRI VIDYA PARISHAD COLLEGE FOR DEGREE AND P.G. COURSES (A) RUSHIKONDA, VISAKHAPATANAM 530045 | website: www.gvpcdpgc.edu.in (Approved by A.I.C.T.E | Affiliated to Andhra University | An ISO 9001:2015 Certified Institute) ENGINEERING AND TECHNOLOGY PROGRAM...

GAYATRI VIDYA PARISHAD COLLEGE FOR DEGREE AND P.G. COURSES (A) RUSHIKONDA, VISAKHAPATANAM 530045 | website: www.gvpcdpgc.edu.in (Approved by A.I.C.T.E | Affiliated to Andhra University | An ISO 9001:2015 Certified Institute) ENGINEERING AND TECHNOLOGY PROGRAM DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B. Tech Computer Science and Engineering (R-22 Regulation) I Year – I Semester Hours per Course Internal External Total Category Course Title week Credits code Marks Marks Marks L T P Engineering Mathematics-I(Partial CS1101 BS Differentiation, Multiple Integrals, 3 0 0 30 70 100 3 Fourier Series and Applications) CS1102 BS Green Chemistry 3 1 0 30 70 100 3 3 0 0 30 70 100 3 CS1103 HSS English Computer Programming CS1104 ES 3 0 0 30 70 100 Using ‘C’ 3 3 3 0 0 CS1105 ES IT Essentials 30 70 100 CS1106 HSS Communication Skills Lab 0 0 3 50 50 100 1.5 Engineering CS1107 BS 0 0 3 50 50 100 Chemistry Lab 1.5 Computer Programming CS1108 ES 0 0 3 50 50 100 using ‘C’ LAB 1.5 Total Credits 19.5 1  B. Tech Computer Science and Engineering (R-22 Regulation) I Year – II Semester Hours per Course Internal External TotalMarks Category Course Title week Credits code Marks Marks L T P Engineering Mathematics-II (Matrix Algebra, Ordinary CS1201 BS 3 0 0 30 70 100 3 Differential Equations and Laplace Transforms) CS1202 3 1 0 30 70 100 3 BS Engineering Physics Data Structures CS1203 ES 3 0 0 30 70 100 3 Using ‘C’ CS1204 ES Engineering Graphics 1 0 4 30 70 100 3 Discrete CS1205 ES Mathematical 3 0 0 30 70 100 3 Structures CS1206 ES IT Workshop Lab 0 0 3 50 50 100 1.5 Engineering Physics CS1207 BS 0 0 3 50 50 100 1.5 Lab CS1208 ES Data Structures Lab 0 0 3 50 50 100 1.5 Total Credits 19.5 2  B. Tech Computer Science and Engineering (R-22 Regulation) II Year – I Semester Hours per Course Intern-al External Total Category Course Title week Credits code Marks Marks Marks L T P ES Elements of Electronics CS2101 3 0 0 30 70 100 3 Engineering Digital Logic Design & CS2102 PC 3 0 0 30 70 100 3 Microprocessors Managerial Economics & 3 0 0 CS2103 HSS 30 70 100 3 Financial Accounting CS2104 PC Design and Analysis of 3 0 0 30 70 100 3 Algorithms Database Management Systems 3 0 0 30 70 100 CS2105 PC 3 CS2106 PC DEMP Lab 0 0 3 30 70 100 1.5 Database Management Systems Lab 0 0 3 50 50 100 CS2107 PC 1.5 CS2108 PC Algorithms through C++ Lab 0 0 3 50 50 100 1.5 Skill Course -1 CS2109 SC 1 0 2 50 50 100 2 C++ Programming CS2110 MC Environmental Science 3 0 0 30 70 100 0 Total Credits 21.5 3  B. Tech Computer Science and Engineering (R-22 Regulation) II Year – II Semester Hours Course Internal External Total Category Course Title per Credits code Marks Marks Marks week L T P Computer Organization & CS2201 ES 3 0 0 30 70 100 3 Architecture Operating Systems CS2202 PC 3 0 0 30 70 100 3 Object CS2203 PC Oriented 3 0 0 30 70 100 3 Programming Through Java Formal Languages &Automata CS2204 PC 3 0 0 30 70 100 3 Theory Probability, Statistics & 3 0 0 CS2205 BS Queuing Theory 30 70 100 3 Operating Systems LAB CS2206 PC 0 0 3 50 50 100 1.5 Object Oriented Programming CS2207 PC Through Java 0 0 3 50 50 100 1.5 Lab Skill Course -2 CS2208 SC 1 0 2 50 50 100 2 Python Programming CS2209 MOOCS Massive Open Online Courses 0 0 3 (NPTEL/COURSERA/UDEMY) 50 50 100 1.5 CS2210 MC NCC/NSS 0 0 2 - - - 0 Total Credits 21.5 Summer Internship – I (Evaluation will be done in 3-1) Honors & Minors 4 4  GAYATRI VIDYA PARISHAD COLLEGE FOR DEGREE AND P.G. COURSES (A) RUSHIKONDA, VISAKHAPATANAM 530045 | website: www.gvpcdpgc.edu.in (Approved by A.I.C.T.E | Affiliated to Andhra University | An ISO 9001:2015 Certified Institute) ENGINEERING AND TECHNOLOGY PROGRAM DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B. Tech CSE (R-22 Regulation) I Year – I Semester Hours per Course Internal External Total Category Course Title week Credits code Marks Marks Marks L T P Engineering Mathematics-I(Partial CS1101 BS Differentiation, Multiple Integrals, 3 0 0 30 70 100 3 Fourier Series and Applications) CS1102 BS Green Chemistry 3 1 0 30 70 100 3 3 0 0 30 70 100 3 CS1103 HSS English Computer Programming CS1104 ES 3 0 0 30 70 100 Using ‘C’ 3 3 3 0 0 CS1105 ES IT Essentials 30 70 100 CS1106 HSS Communication Skills Lab 0 0 3 50 50 100 1.5 Green Chemistry CS1107 BS 0 0 3 50 50 100 Lab 1.5 Computer Programming CS1108 ES 0 0 3 50 50 100 using ‘C’ LAB 1.5 Total Credits 19.5 1  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1101 L T P Int. Ext Engineering Mathematics-I 3 0 0 30 70 3 ( Partial Differentiation, Multiple Integrals, Fourier Series and Applications) COURSE OBJECTIVES 1. To transmit the knowledge of Partial differentiation. 2. To know of getting maxima and minima of function of two variables and finding errors and approximations. 3. To evaluate double and triple integrals, volumes of solids and area of curved surfaces. 4. To expand a periodical function as Fourier series and half-range Fourier series. COURSE OUTCOMES: CO 1: To determine the partial derivatives of functions of two or more variables. CO 2: Evaluate maxima and minima, errors and approximations. CO 3: Ability to evaluate double and triple integrals. CO 4: Ability to find volumes of solids and area of curved surfaces. CO 5: To expand a periodical function as Fourier series and half-range Fourier series. UNIT-I Partial Differentiation: Introduction - Functions of two or more variables - Partial derivatives - Homogeneous functions – Euler’s theorem - Total derivative - Change of variables – Jacobins. UNIT-II Applications of Partial Differentiation: Geometrical interpretation -Tangent plane and Normal to a surface -Taylor’s theorem for functions of two variables - Errors and approximations -Total differential. Maxima and Minima of functions of two variables - Lagrange’s method of undetermined multipliers - Differentiation under the integral Sign - Leibnitz’s rule. UNIT-III Multiple Integrals: Introduction - Double Integrals - Change of Order of Integration - Double Integrals in Polar Coordinates - Triple Integrals - Change of Variables. UNIT-IV Multiple Integrals-Applications: Area enclosed by plane curves - Volumes of solids - Area of a 2 curved surface - Beta Function - Gamma Function - Relation between Beta and Gamma Functions. UNIT-V Fourier Series: Introduction - Euler’s Formulae - Conditions for a Fourier Expansion - Functions having points of discontinuity - Change of Interval - Odd and Even Functions - Expansions of Odd or Even Periodic Functions, Half-Range Series - Parseval’s Formula. Text Book: Scope and Treatment as in “Higher Engineering Mathematics”, by Dr. B.S. Grewal, 43 rd Edition, Khanna publishers. Reference Books: 1. Graduate Engineering Mathematics by V B Kumar Vatti., I.K.International publishing house Pvt. Ltd. 2. Advanced Engineering Mathematics by Erwin Kreyszig. 3. A text book of Engineering Mathematics, by N.P. Bali and Dr. Manish Goyal, Lakshmi Publications. 4. Advanced Engineering Mathematics by H.K. Dass. S. Chand Company. 5. Higher Engineering Mathematics by B.V. Ramana, Tata Mc Graw Hill Company. 6. Higher Engineering Mathematics by Dr. M.K.Venkataraman. 3  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1102 Green Chemistry L T P Int. Ext 3 0 0 30 70 3 COURSE OBJECTIVES CO 1: To apply the basic knowledge of Chemistry to the Engineering Discipline. CO 2: To develop knowledge about water and its treatment for industrial and potable purposes. CO 3: To develop understanding in the areas of Batteries, Fuels Mechanism of Corrosion of Metals and Corrosion Control Methods, Green Chemistry and Technology and Processes involving Green Chemistry and apply the knowledge for solving existing challenges faced in various engineering and societal areas. LEARNING OUTCOMES: LO 1: The students are able to apply the basic concepts and principles studied in Chemistry to the field of Engineering. LO 2: The students are able to apply chemistry to different branches of engineering. LO 3: The students are able to acquire the knowledge in the areas of Water Chemistry, Mechanism of Corrosion of Metals and Corrosion Control Methods, Batteries, Fuel Cells, Green Chemistry and Technology and Processes involving Green Chemistry and suggest innovative solutions for existing challenges in these areas. UNIT-I Water Technology: Sources of Water – Impurities – WHO Limits – Hardness and its Determination by EDTA method– Boiler Troubles– Water Softening Methods – Lime-Soda, Zeolite and Ion Exchange - Municipal Water Treatment-Break Point Chlorination – Desalination of Sea Water : Reverse Osmosis and Electrodialysis. Methods UNIT-II Batteries:Definition, types,Primary batteries: Zinc-carbon (Leclanche type), zinc alkaline (Duracell), zinc/air batteries; Lithium primary cells –. Secondary batteries: Lead acid and VRLA (valve regulated (sealed) lead acid), nickel-cadmium, nickel-metal hydride batteries, lithium ion batteries, ultrathin lithium polymer cells. Advanced Batteries for electric vehicles: requirements of the battery – sodium- beta and redox batteries. 4  UNIT-III Fuel Cells:Definition, Description, working principle, advantages, disadvantages, H2_O2 fuel cells: alkaline fuel cells, phosphoric acid, solid oxide, molten carbonate, methanol fuel cells- Proton Membrane fuel cells. UNIT-IV Corrosion: Origin and Theory – Types of Corrosion: Chemical and Electrochemical; Pitting, Waterline,and Stress corrossion – Galvanic Series – Factors Effecting Corrosion. Corrosion Controlling Methods: Protective Coatings: Metallic Coatings, Electroplating and Electroless Plating. UNIT-V Green Chemistry and Technology: Introduction and significance of Green Chemistry, goals of green chemistry, 12 principles of green chemistry, toxicity of chemicals, material safety data sheet (MSDS), concept of zero pollution technologies: atom economy, functional toxicity Vs non-functional toxicity, functional group approaches to green chemistry, Elemination of toxic functional group, optimization of frame works for the design of the dgreener synthetic pathways, applications of green chemistry – Green solvents, green fuels and propellants, biocatalysis. Text Books: 1. Engineering Chemistry – PC Jain and M. Jain – DhanpathRai and Sons, New Delhi. 2. A Text book of Engineering Chemistry – S. S. Dara – S. Chand & Co. New Delhi. 3. Dell, Ronald M Rand, David A J, ‘Understanding Batteries’, Royal Society of Chemistry, (2001). 3. Hand Book of Green Chemistry and Technology; by James Clarke and Duncan Macquarrie; Blakwell Publishing. 5  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1103 English L T P Int. Ext 3 0 0 30 70 3 COURSE OUTCOMES CO-1:  Addressing explicit and implicit meanings of a text on current topics.  Understanding the context.  Learning new words and phrases.  Using words and phrases in different contexts.  CO-2:  Using the basic structure of a sentence.  Applying relevant writing formats to create paragraphs, essays, letters, emails, reports and presentations.  Retaining a logical flow while writing.  Planning and executing an assignment creatively.  Participating in discussions and influencing them and communicating ideas effectively.  Examining self-attributes and identifying areas that require improvement: self-diagnosis and self-motivation.   CO-3:  Analyzing a topic of discussion and relating it to time management skills.  Participating in discussions and influencing them. Communicating ideas effectively. Presenting ideas coherently within a stipulated time. CO-4:   Examining self-attributes and identifying areas that require improvement: self-diagnosis and self-motivation.  Adapting to a given situation and developing a functional approach to finding solutions: adaptability and problem solving.  Understanding the importance of helping others: community services and enthusiasm. 6  CO-5:  The student will learn to avoid redundancy will learn common abbreviations useful for competitive exams and will acquire basic proficiency in English including reading, comprehension and writing skills.  The student will be motivated with a sense of purpose throughout the course by learning life skills.  DETAILED SYLLABUS Topics: On the conduct of life: William Hazlitt Life skills: Values and Ethics If: Rudyard Kipling The Brook: Alfred Tennyson Life skills: Self-Improvement How I Became a Public Speaker: George Bernard Shaw The Death Trap: Saki Life skills: Time Management On saving Time: Seneca Chindu Yellama Life skills: Innovation Muhammad Yunus Politics and the English Language: George Orwell Life skills: Motivation Dancer with a White Parasol: Ranjana Dave Grammar: Prepositions – Articles – Noun-Pronoun Agreement, Subject-Verb Agreement – Misplaced Modifiers – Clichés, Redundancies, Punctuations. Vocabulary: Introduction to Word Formation – Root Words from other Languages – Prefixes and Suffixes – Synonyms, Antonyms – Common Abbreviations Writing: E-mail writing– Principles of Good Writing – Essay Writing –Paragraph Writing (with hints) Writing a Summary. 7 Textbook: Language and Life: A Skills Approach Board of Editors, Orient Black swan Publishers, India. 2018. Reference Books: Practical English Usage. Michael Swan. OUP. 1995. Remedial English Grammar. F.T. Wood. Macmillan.2007 On Writing Well. William Zinsser. Harper Resource Book. 2001 1.Study Writing. Liz Hamp-Lyons and Ben Heasly. Cambridge University Press. 2006. 2.Communication Skills. Sanjay Kumar and PushpLata. Oxford University Press. 2011. 3.Exercises in Spoken English. Parts. I-III. CIEFL, Hyderabad. Oxford UniversityPress. 4. University Physics by Young & Freedman 5. Nonconventional Energy by Ashoke V. Desai 8  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1104 Computer Programming L T P Int. Ext 3 0 0 30 70 3 using ‘C’ COURSE OBJECTIVES 1. The course is designed to provide complete knowledge of C language. 2. To provide students with understanding of code organization and functional hierarchical decomposition with using complex data types. 3. To provide knowledge to the students to develop logics which will help them to create programs, applications in C. 4. This course aims to identify tasks in which the numerical techniques learned are applicable and apply them to write programs, and hence use computers effectively to solve the task. 5. This course provides the fundamental knowledge which is useful in understanding the other programming languages. COURSE OUTCOMES At the end of the course students will be able to: CO1. Identify basic elements of C programming structures like data types, operators, constants, input- output statements and decision-making statements. CO2. Apply Various Operations on derived data types like arrays & strings. CO3. Design and Implementation of Modular Programming using functions. CO4. Design and Implementation of Modular Programming using Pointers. CO5. Develop C programs using user defined data types like structures and unions. UNIT-I Introduction to C and Decision Making,: Basic structure of C program, Constants, Variables and data types, Operators and Expressions, Arithmetic Precedence and associativity, Type Conversions. Managing Input and Output Operations Formatted Input, Formatted Output, Decision making with if statement, Simple if statement, The if…else statement, Nesting of if…else statement, the else.. if ladder, switch statement. UNIT-II Branching, Looping, Arrays & Strings:, the GOTO statement., The while statement, the do statement, The for statement, Jumps in Loops, One, Two-dimensional Arrays, Character Arrays. Declaration and initialization of Strings, reading and writing of strings, String handling functions, Table of strings. 9  UNIT-III Functions: Definition of Functions, Return Values and their Types, Function Calls, Function Declaration, Category of Functions: No Arguments and no Return Values, Arguments but no Return Values, Arguments with Return Values, No Argument but Returns a Value, Functions that Return Multiple Values. Nesting of functions, recursion, passing arrays to functions, passing strings to functions, the scope, visibility and lifetime of variables. UNIT-IV Pointers: Accessing the address of a variable, declaring pointer variables, initializing of pointer variables, accessing variables using pointers, chain of pointers, pointer expressions, pointers and arrays, pointers and character strings, array of pointes, pointers as function arguments, functions returning pointers, pointers to functions, pointers to structures-Program Applications. UNIT-V Structure, Unions and File handling: : Defining a structure, declaring structure variables, accessing structure members, structure initialization, copying and comparing structure variables, arrays of structures, arrays within structures, structures within structures, structures and functions and unions, size of structures and bit-fields- Defining and opening a file, closing a file, Input/ Output operations on files, Error handling during I/O operations, random access to files and Command Line Arguments- Program Applications. Text Books 1. Programming in ANSI C, E Balagurusamy, 6th Edition. McGraw Hill Education (India) Private Limited. Reference Books 1. Let Us C ,Yashwant Kanetkar, BPB Publications, 5th Edition. 2. Computer Science, A structured programming approach using C”, B.A.Forouzan and R.F.Gilberg, “ 3rd Edition, Thomson, 2007. 3. The C –Programming Language’ B.W. Kernighan, Dennis M. Ritchie, PHI. 4. Scientific Programming: C-Language, Algorithms and Models in Science, Luciano M. Barone (Author), EnzoMarinari (Author), Giovanni Organtini, World Scientific. 10  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1105 IT Essentials L T P Int. Ext 3 0 0 30 70 3 COURSE OBJECTIVES 1. Select the appropriate computer components to build, repair, or upgrade personal computers. 2. Explain how to correctly use tools and safely work in a lab. 3. Install components to build, repair, or upgrade personal computers. 4. Configure computers to communicate on a network 5. Configure devices to connect to the Internet and Cloud services 6. Explain how to use, configure, and manage laptops and mobile devices COURSE OUTCOMES At the end of the course student will be able to CO1: Understands the roles and responsibilities of the IT professional CO2: Troubleshoot advanced hardware and software problems CO3: Understand the basics of Operating Systems CO4: Learn the Safe Lab Procedures and Tools CO5: Understand Networks and Security Concepts.. UNIT- I Introduction to the Personal Computer Describe a Computer System, Identify the Names, Purposes, and Characteristics of Cases and Power Supplies, Identify the Names, Purposes, and Characteristics of Internal Components, Identify the Names, Purposes, and Characteristics of Ports and Cables, Identify the Names, Purposes, and Characteristics of Input Devices, Identify the Names, Purposes, and Characteristics of Output Devices, Explain System Resources and Their Purposes. UNIT- II Computer Assembly Attach the Components to the Motherboard and Install the Motherboard, Install Internal Drives, Install Drives in External Bays, Install Adapter Cards, Connect the Power Cables Reattach the Side Panels to the Case, Boot the Computer for the First Time. Basics of Preventive Maintenance and Troubleshooting Explain the Purpose of Preventive Maintenance, Identify the Steps of the Troubleshooting Process. 11  UNIT- III Fundamental Operating Systems Explain the Purpose of an Operating System, Describe and Compare Operating Systems to Include Purpose, Limitations, and Compatibilities, Determine Operating System Based on Customer Needs, Install an Operating System, Identify and Apply Common Preventive Maintenance Techniques for Operating Systems, Troubleshoot Operating Systems. UNIT- IV Safe Lab Procedures and Tool Use Explain the Purpose of Safe Working Conditions and Procedures, Identify Tools and Software Used with Personal Computer Components and Their Purposes, Implement Proper Tool Use. Fundamental Laptops and Portable Devices Identify Common Preventive Maintenance Techniques for Laptops and Portable Devices, Describe How to Troubleshoot Laptops and Portable Devices. UNIT-V Fundamental Networks Explain the Principles of Networking, Describe Types of Networks, Describe Basic Networking Concepts and Technologies, Describe the Physical Components of a Network, Describe LAN Topologies and Architectures. Fundamental Security: Explain Why Security Is Important, Describe Security Threats, Identify Security Procedures, Identify Common Preventive Maintenance Techniques for Security, Troubleshoot Security. Text Books: 1. IT Essentials: PC Hardware and Software Companion Guide Fourth Edition, CiscoNetworking Academy. Reference Books: 1.Network security essentials application and standrads, by William stallings, 4th edition,prentice hall. 2.Mike Meyers' CompTIA A+ Guide to Managing and Troubleshooting PCs, SixthEdition 6th Edition 12  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1106 Communication L T P Int. Ext 0 0 3 50 50 1.5 Skills LAB COURSE OBJECTIVES 1. To make students recognize the sounds of English through Audio-Visual aids; 2. To help students build their confidence and help them to overcome their inhibitions and self- consciousness while speaking in English; 3. To familiarize the students with stress and intonation and enable them to speak English effectively; and 4. To give learners exposure to and practice in speaking in both formal and informal contexts. COURSE OUTCOMES CO1: Students will be sensitized towards recognition of English sound patterns and the fluency in their speech will be enhanced; CO2: Students will be able to participate in group activities like roleplays, group discussions and debates; and CO3: Students will be able to express themselves fluently and accurately in social as well professional context. Topics: Introduction to Phonetics: The Sounds of English (Speech sound – vowels and consonants) - Stress and Intonation - Accent and Rhythm. Listening Skills: Listening for gist and specific information - listening for Note taking, summarizing and for opinions - Listening to the speeches of eminent personalities. Speaking Skills: Self-introduction - Conversation Skills (Introducing and taking leave) - Giving and asking for information - Role Play - Just A Minute (JAM) session - Telephone etiquette. Reading and Writing skills: Reading Comprehension – Précis Writing - E-Mail writing - Punctuation. Presentation skills: Verbal and non-verbal communication - Body Language - Making a Presentation. DISTRIBUTION AND WEIGHTAGE OF MARKS 13   The practical examinations for the English Language Lab shall be conducted as per the University norms prescribed for the core Engineering practical sessions.  For the Language lab sessions, there shall be a continuous evaluation during the semester for 50 sessional marks and 50 semester-end Examination marks.  For the 50 sessional (Internal) marks, 30 marks shall be awarded for day-to-day performance and for completing activities in the lab manual, 20 marks to be awarded by conducting Internal Lab Test(s).  For the 50 Semester- end (External) marks, 30 marks shall be awarded for written examination (dialogues, the sounds of English and stress) and 20 marks for External Examiner viva-voce. Reference Books:  Ashraf Rizvi. Effective Technical Communication. Tata McGraw Hill Education Private Limited, New Delhi.  Speak Well. Orient Blackswan Publishers, Hyderabad.  Allan Pease. Body Language. Manjul Publishing House, New Delhi. 14  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1107 Green Chemistry L T P Int. Ext 0 0 3 50 50 1.5 LAB COURSE OUTCOMES At the end of the course student will be able to: Course outcomes: At the end of the course the student shall be able to CO 1: Determine the quality of the ground water sample. CO 2: Determine the metal ions using titrimetry. CO 3: Explain the functioning of the instruments like pH metry, Conductometry and Potentiometry. CO 4: Use spectrophotometry to determine the metal ions. List of Laboratory Experiments (Any 10 experiments to be performed during the semester) 1. Determination of sodium hydroxide with HCl. 2. Determination of Fe (II) by potassium dichromate. 3. Determination of Fe(II) by permanganometry. 4. Determination of chromium (VI) by hypo. 5. Determination of Zinc by EDTA method. 6. Determination of hardness of water sample by EDTA method. 7. Determination of available chlorine in water. 8. Determination of sulphuric acid in lead-acid storage cell. 9. Determination of carbonate and bicarbonate in a mixer. 10. Determination of strength of an acid by pH metric method. 11. Determination of citric acid in a citrus fruit by conductometric method. 12. Determination of Fe(II) in Mohr’s salt by potentiometric method. 13. Construction of Galvanic cell. 14. Determination of Fe(III) by spectrophotometry. 15. Optimization of structure of the compound using Gaussian software. 16. Preparation of Biodiesel from vegetable oils. Reference Books: 1. Vogel’s Quantitative Chemical Analysis – V Edition – Longman 15  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1108 Computer L T P Int. Ext 0 0 3 50 50 1.5 Programming using ‘C’ LAB COURSE OBJECTIVES 1. To provide complete knowledge of C language. 2. To develop logics which will help them to create programs, applications in C. 3. To learn the basic programming constructs they can easily switch over to any other language in future. COURSE Outcomes CO1: Ability to implement the programs using control structures & arrays. CO2: Ability to implement the programs using strings & functions. CO3: Ability to implement the programs using user defined datat ypes. CO4: Ability to implement the programs using pointers and operations on files. LIST OF EXPERIMENTS 1. Basic Programs A. C program to scan all data type variables as input and print it as output. B. C program to perform arithmetic operations like +,-,*,/,% on two input variables. C. C program to perform temperature conversions from Centigrade to Fahrenheit and vice versa. 2. Programs on Operators A. C program to perform all bit wise operations. B. C program to extract the last two digits of a given integer n, where the number of digits should be greater than 2. C. C program to display the greatest of three numbers using a conditional operator. D. C program to swap two numbers without using a third variable. 3. Programs on Conditional Statements A. C program to check whether a given input integer is in between two values x and y. B. C program to check whether a given character is a vowel or a consonant or a digit or a specialsymbol. C. C program to display the nature of roots of a quadratic equation. D. C program to perform arithmetic operations using switch statement. E. C program to convert upper case character to lowercase and vice versa. 16 4. Programs on Loop Statements A. C program to print odd numbers between specified ranges. B. C program to display the factors of a given number and check whether it is a prime or not. C. C program to display the sum of individual digits of a given integer raised to the power of n. Also check whether the given integer is Armstrong or not. D. C Program to demonstrate the usage of unconditional control tatements E. C Program to display fibnocii series. F. C Program to generates 100 random real numbers in the range of 10.0 to 20.0 and sort them in descending order. G. C program to display the following pattern. 54321 4321 321 21 1 5. Programs on Functions A. C program to demonstrate the various categories of functions with respect to return type andnumber of arguments. B. C program to find the LCM of two numbers using functions. C. Create a header file which contains the following prototype: i. int factorial(int) ; // non-recursive function ii. int factorial_rec(int); //Recursive function iii. int prime(int); Use the above functions in a C program by including the above header file. D. C program to display Pascal’s triangle using functions. 6. Programs on Arrays A. C program to read n integer values into an array and display them B. C program to count and display the number of positive, negative, even and odd numbers in a given array of integers and also display their sum. C. C program to find the smallest and largest numbers in an array of integers. D. C program to perform addition, multiplication, transpose of given matrices using functions. E. C program to check whether a given integer exists in a list of numbers and print its index value if it is present, otherwise print “No”. 7. Programs on Character Array A. C program to convert upper case character to lowercase and vice versa in a given string. B. C program to delete all vowels in a given string and display the remaining string. C. C program to check whether a given string is palindrome or not. 17 8. Programs using String handling functions A. C program to demonstrate the usage of at least 10 predefined string handling functions. B. C Program to Sort the given n strings in ascending order. C. C program that implements the following user defined string handling functions i. To find the length of the given string ii. To copy the contents of one string to another iii. To reverse the contents of a string iv. To compare two strings v. To concatenate two strings 9. Programs on Pointers and Dynamic Memory Allocation A. C program to demonstrate the usage of pointers. B. C program that uses dynamic memory allocation functions to add n elements and display their average. C. C program that performs pointer arithmetic. D. C program that implements call by reference. E. C program to demonstrate the following i. Pointers to Pointers ii. Array of Pointers iii. Pointer to Array iv. Pointers to Functions 10. Programs on Structures A. C program to read the data of four students, each students has a name (string), roll number (string), age (integer), use an array of structure. Later find the average age of the students. B. C program using nested structures. C. C program that demonstrates different ways to access the structure elements using pointers. 11. Programs on Files A. C program to read the contents of a file and display on the output screen. B. C program to copy the contents of one file to another. C. C program to count and display the number of characters, words and lines in a file. 12. Programs on Command Line Arguments A. C program to perform arithmetic operations using command line arguments. B. C program to pass file name as argument and display the contents of file on screen. 18 GAYATRI VIDYA PARISHAD COLLEGE FOR DEGREE AND P.G. COURSES (A) RUSHIKONDA, VISAKHAPATANAM 530045 | website: www.gvpcdpgc.edu.in (Approved by A.I.C.T.E | Affiliated to Andhra University | An ISO 9001:2015 Certified Institute) ENGINEERING AND TECHNOLOGY PROGRAM DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B. Tech CSE (R-22 Regulation) I Year – II Semester Hours per Course Internal External TotalMarks Category Course Title week Credits code Marks Marks L T P Engineering Mathematics-II (Matrix Algebra, Ordinary CS1201 BS 3 0 0 30 70 100 3 Differential Equations and Laplace Transforms) CS1202 3 1 0 30 70 100 3 BS Engineering Physics Data Structures CS1203 ES 3 0 0 30 70 100 3 Using ‘C’ CS1204 ES Engineering Graphics 1 0 4 30 70 100 3 Discrete CS1205 ES Mathematical 3 0 0 30 70 100 3 Structures CS1206 ES IT Workshop Lab 0 0 3 50 50 100 1.5 Engineering Physics CS1207 BS 0 0 3 50 50 100 1.5 Lab CS1208 ES Data Structures Lab 0 0 3 50 50 100 1.5 Total Credits 19.5  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1201 L T P Int. Ext Engineering Mathematics-II 3 0 0 30 70 3 (Matrix Algebra, Ordinary Differential Equations and Laplace Transforms) COURSE OBJECTIVES  The way of obtaining rank, Eigen values and Eigen vectors of a matrix.  To know the importance of Cayley-Hamilton theorem and getting canonical form from a given quadratic form.  To solve the system of equations by using direct and indirect methods.  To solve first order and higher order differential equations by various methods.  To obtain the Laplace transforms and inverse Laplace transforms for a given functions and their applications. COURSE OUTCOMES CO1: Find rank, Eigen values and Eigen vectors of a matrix and understand the importance of Cayley-Hamilton theorem. CO2: Reduce quadratic form to canonical forms and solving linear systems by direct and indirect methods. CO3: Demonstrate solutions to first order differential equations by various methods and solve basic applications problems related to electrical circuits, orthogonal trajectories and Newton’s law of cooling CO4: Discriminate among the structure and procedure of solving higher order differential equations with constant and variable coefficients. CO5: Understand Laplace transforms and its properties and finding the solution of ordinary differential equations. UNIT-I Matrix Algebra: Rank of a matrix- Echelon form, Normal Form - Solution of Linear System of Equations - Consistency of Linear System of Equations - Gauss elimination method, LU Factorization method, Complex Matrices: Hermitian, Skew-Hermitian and Unitary Matrices and their Properties. UNIT-II Eigen Values and Eigen Vectors: Eigen Values and Eigen Vectors of a Matrix - Cayley-Hamilton theorem - Inverse and Powers of a Matrix using Cayley-Hamilton's theorem and its applications. Diagonalization of a Matrix - Quadratic Forms - Reduction of Quadratic Form to Canonical Form - Nature of a Quadratic Form. UNIT-III Ordinary Differential Equations of First Order and its Applications: Formation of ordinary differential equations (ODEs) - Solution of an ordinary differential equation - Equations of the first order and first degree - Linear differential equation - Bernoulli’s equation - Exact differential equations - Equations reducible to exact equations - Orthogonal Trajectories - Simple Electric (LR & CR) Circuits - Newton’s Law of Cooling - Law of Natural growth and decay. UNIT-IV Differential Equations of Higher Order: Solutions of Linear Ordinary Differential Equations with Constant Coefficients - Rules for finding the complimentary function - Rules for finding the particular integral - Method of variation of parameters - Cauchy’s linear equation - Legendre’s linear equation - Simultaneous linear differential equations. UNIT-V Laplace Transforms: Introduction - Existence Conditions - Transforms of Elementary Functions - Properties of Laplace Transforms - Transforms of Derivatives - Transforms of Integrals - Multiplication by tn - Division by t – Evaluation of integrals by Laplace Transforms - Inverse Laplace Transform - Applications of Laplace Transforms to Ordinary Differential Equations - Simultaneous Linear Differential Equations with Constant Coefficients - Second Shifting Theorem - Laplace Transforms of Unit Step Function, Unit Impulse Function and Laplace Transforms of Periodic Functions. Text Book: Scope and Treatment as in “Higher Engineering Mathematics”, by Dr. B.S. Grewal, 43 rd Edition, Khanna publishers. Reference Books: 1. Graduate Engineering Mathematics by V B Kumar Vatti., I.K. International publishing house Pvt. Ltd. 2. Advanced Engineering Mathematics by Erwin Kreyszig. 3. A text book of Engineering Mathematics, by N.P. Bali and Dr. Manish Goyal. Lakshmi Publications. 4. Advanced Engineering Mathematics by H.K. Dass. S. Chand Company. 5. Higher Engineering Mathematics by B.V. Ramana, Tata Mc Graw Hill Company.  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1202 Engineering L T P Int. Ext 3 0 0 30 70 3 Physics COURSE OBJECTIVES The fundamentals of sciences are essential to learn as the application of science in solving problems is technology. The engineering physics curriculum is designed in such a way that all branches of engineering will study the basic fundamentals of technology from where it is originated. The course objectives are 1. To impart knowledge in basic concept of physics of Thermodynamics relevant to engineering applications. 2. To grasp the concepts of physics for electromagnetism and its application to engineering. Learn production of Ultrasonics and their applications in engineering. 3. To Develop understanding of interference, diffraction and polarization: connect it to a few engineering applications. 4. To learn basics of lasers and optical fibers and their use in some applications. 5. To understand concepts and principles in quantum mechanics and Nanopahse Materials. Relate them to some applications. COURSE OUTCOMES By the end of this course, student would have CO.1: Understand the fundamentals of Thermodynamics and Laws of thermodynamics. Understand the working of Carnot cycle and concept of entropy. CO.2: Gain Knowledge on the basic concepts of electric and magnetic fields. Understand the concept of the nature of magnetic materials. Gain knowledge on electromagnetic induction and its applications. CO.3: Understand the Theory of Superposition of waves. Understand the formation of Newton’srings and the working of Michelson’s interferometer. Remember the basics of diffraction, Evaluate the path difference. Analysis of Fraunhofer Diffraction due to a single slit. CO.4: Understand the interaction of matter with radiation, Characteristics of Lasers, Principle, working schemes of Laser and Principle of Optical Fiber. Realize their role in optical fiber communication. CO.5: Understand the intuitive ideas of the Quantum physics and understand dual nature of matter. Compute Eigen values, Eigen functions, momentum of Atomic and subatomic particles using Time independent one Dimensional Schrodinger’s wave equation. Understand the fundamentals and synthesis processes of Nanophase materials.  UNIT-I THERMODYNAMICS (CO1) Part-I Introduction, Heat and Work, First law of thermodynamics and its applications, Reversible and Irreversible process, Carnot cycle and Efficiency (Problems based on efficiency), Carnot’s Theorem. Part-II Second law of thermodynamics (Kelvins and Clausius statement only) , Entropy - Physical Significance, Change of entropy in reversible and irreversible process, Second law in terms of entropy, Entropy and disorder, Third law of thermodynamics (statement only). UNIT - II ELECTROMAGNETISM (CO2) Gauss’s law (Statement and Proof, without applications), Ampere’s law (Statement and Proof, without applications), Faraday’s law of induction, Lenz’s law, Induced magnetic fields, Displacement current, Maxwell’s equations (no derivation), propagation of electromagnetic waves in free space (Theory only). Ultrasonics: Properties of ultrasonic waves, production of ultrasonic waves by magnetostriction and piezoelectric methods, acoustic grating, applications of ultrasonics, acoustic grating. UNIT - III OPTICS (CO3) Interference: Principle of superposition – Young’s Experiment – Coherence - Interference in thin films (reflected light), Newton’s Rings (Problems based on finding radius of curvature or wavelength), Michelson Interferometer and its applications (Theory only). Diffraction: Introduction, Differences between interference and diffraction, Fresnel and Fraunhofer diffraction, Fraunhofer diffraction at a single slit (Qualitative and quantitative treatment)(Theory only). Polarisation: Polarisation by reflection, refraction and double refraction in uniaxial crystals, Nicol prism, Quarter and Half wave plate (problems based on thickness), production and detection of plane, circular and elliptical polarization (Theory only). UNIT - IV LASERS AND FIBRE OPTICS (CO 4) Introduction, characteristics of a laser beam, spontaneous and stimulated emission of radiation, population inversion, Ruby laser, He-Ne laser, Semiconductor laser, applications of lasers (Theory only). Introduction to optical fibers, principle of propagation of light in optical fibers, Acceptance Angle and cone of a fibre, Numerical aperture (Problems based on acceptance angle and numerical aperture), Modes of propagations, classification of fibers,Fibre optics in communications, Application of optical fibers, fiber optic sensors.  UNIT - V MODERN PHYSICS (CO. 5) Introduction, De Broglie concept of matter waves, Heisenberg uncertainty principle, Schrodinger time dependent and independent wave equations, physical significance of wave function and its properties, application for particle in a one dimensional well – energy eigen values and eigen functions of the particles (No problems).Energy band theory of crystals, classification of conductors, semiconductors and insulators. (Theory only). Nanophase Materials :Introduction, properties, Top-down and bottom up approaches, Synthesis - Ball milling, Chemical vapour deposition method, sol-gel methods, Applications of nanomaterials. (Theory only). Text Books: 1. Physics by David Halliday and Robert Resnick – Part I and Part II - Wiley. 2. A textbook of Engineering Physics, Dr. M. N. Avadhanulu, Dr. P.G. Kshirsagar - S. Chand 3. Engineering Physics by R.K. Gaur and S.L. Gupta –DhanpatRai Reference Books: 1. Modern Engineering Physics by A.S. Vadudeva 2. University Physics by Young and Freedman Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1203 Data Structures L T P Int. Ext 3 0 0 30 70 3 using ‘C’ COURSE OBJECTIVES: 1. To understand recursive algorithms and basic concepts of data structures. 2. To learn linear data structures such as Stacks, Queues and Linked lists. 3. To learn Nonlinear data structures such as Trees and Graphs. 4. To understand and solve searching and sorting techniques. 5. To solve problems using data structures such as stacks, queues, linear lists, trees and graphs. COURSE OUTCOMES: At the end of the course student will be able to 1. Understand the implementation of Stacks and Queues using Arrays and their applications. 2. Describe various types of linked lists and their implementation. 3. Construct various types of trees and their traversal techniques. 4. Discuss the computational efficiency of the principal algorithms for sorting and searching. 5. Describe how graphs are represented in memory and solve real time application problems using concepts of graphs. UNIT – I Introduction to Data Structures: Abstract Data Types, Meaning and Definition of Data Structures. Stacks: Stack as an Abstract Data Type, Primitive Operations, Implementing Stack Operations using Arrays. Infix to Postfix, Infix to Prefix Conversions, Postfix Evaluation and Recursion. Queues: Queue as an Abstract Data Type, Sequential Representation, Types of Queues, Operations, Implementation using Arrays. UNIT – II Linked List: Operations, Implementation of Stacks, Queues and priority Queues using Linked Lists, Circular Lists: Insertion, Deletion and Concatenation Operations, Stacks and Queues as Circular Lists, Doubly Linked Lists. UNIT- III Trees: Binary Trees - Definitions and Operations, Binary Tree Representation: Node Representation, Implicit array Representation, Binary Tree Traversal, Threaded Binary Trees and their Traversal, Trees and their Applications; Heterogeneous binary trees, Tree Searching Insertion and Deletion of a node from a Binary Search Tree, Efficiency of Binary Search Tree operations. UNIT –IV Searching: Basic Searching Techniques: Dictionary as an Abstract Data Type, Algorithmic Notation, Sequential Searching and its Efficiency, Binary Search, Interpolation Search. Sorting: General Background: Efficiency, Asymptotic Notations, Efficiency of Sorting, Bubble Sort and Quick Sort and their Efficiency, Selection Sorting, Binary Tree Sort, Heap Sort, Insertion Sorts, Shell Sort, Address calculation Sort, Merge and Radix Sorts. UNIT – V Graphs and Their Application: Definition of Graphs, Representation of Graphs, Transitive closure, Linked Representation of Graphs, Topological Ordering of nodes, Graph Traversal and Spanning Forests, Undirected Graphs and their Traversals Applications of Graphs, Minimal Spanning Trees. Text Books: 1. Data Structures Using C and C++ Yaddish Langsam, Moshe J.Augenstein and Aaron M. Tanenbaum,Prentice Hall Of India(2ndEdition) 2. Data Structure and Algorithm, Prof. Maria Rukadikar S Reference Book: 1. Data Structures, Algorithms and Applications with C++, Sahani Mc-Graw Hill.  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1204 Engineering Graphics L T P Int. Ext 1 0 4 30 70 3 COURSE OBJECTIVES 1. The course is aimed at developing Basic Graphic skills.2: 2. Develop Skills in Preparation of Basic Drawings 3. Skills in Reading and Interpretation of Engineering Drawings COURSE OUTCOMES At the end of the course, the student will be able to: CO 1: Graphically construct and understand, the importance of mathematical curves in Engineering applications CO 2: Graphically visualize and construct orthographic projection of points and lines Visualize and construct different views of planes and solids in different CO 3: orientations CO 4: Construct and develop the sectioned surfaces of geometrical solids CO 5: Interpret and draw the Orthographic and Isometric views of different solids. UNIT-I Introduction: Lines, Lettering and Dimensioning, Geometrical Constructions. Curves: Construction of Conic sections by using general method - Normal and tangent to the curves. UNIT – II Projections of Points and Straight Lines: Principal or Reference Planes - Projections of a point lying in any one of the four quadrants. Projections of straight lines parallel to both reference planes - perpendicular to one reference plane and parallel to other reference plane - inclined to one planeand parallel to the other. UNIT – III Projections of Planes: Projection of Perpendicular planes: Perpendicular to both reference planes, perpendicular to one reference plane and parallel to other - perpendicular to one reference plane and inclined to other plane.  UNIT – IV Projections of Solids: Types of solids: Polyhedral and Solids of revolution. Projections of solids in simple positions: Axis perpendicular to horizontal plane - vertical plane -parallel to both the reference planes - Projection of Solids with axis inclined to one reference plane and parallel to other. UNIT – V Isometric Views: Isometric projection - Isometric scale and Isometric view. Isometric view of Prisms, Pyramids, cylinder, cone, sphere. Text Books: Elementary Engineering Drawing by N.D. Bhatt, Charotar Publishing House. Reference Books: Engineering Graphics by K.L. Narayana and P. Kannaiah, Tata Mc-Graw Hill. 10  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1205 Discrete Mathematical L T P Int. Ext 3 0 0 30 70 3 Structures COURSE OBJECTIVES: 1. To understand mathematical arguments using logical connectives and quantifiers and verify the validity of logical flow of arguments using propositional, predicate logic and truth tables. 2. To understand about permutations and combinations. 3. To understand various types of relations and discuss various properties of the relations. 4. To study the graphs, graph isomorphism and spanning trees. COURSE OUTCOMES: At the end of the course student will be able to: CO1: Solve the basic principles of Logics and proofs. CO2: Solve different kinds of problems related to Relations and set theory. CO3: Analyze the fundamental algorithms and construct simple mathematical proofs. CO4: Acquire knowledge to solve network problems using graph theory. CO5: Solve problems related to counting and advanced counting techniques. UNIT-I The Foundations-Logic and Proofs: Propositional Logic, Propositional Equivalences, Predicates and Quantifiers, Nested Quantifiers Rules of Inference, Introduction to Proofs, Proof Methods andStrategy. UNIT-II Basic Structures-Sets, Functions, Sequences and Sums: Sets, Set Operations, Functions, Sequences and Summations. Relations: Relations and their properties, n-ary relations, applications,Representation, closure equivalence relations, Partial orderings. UNIT-III The Fundamentals-Algorithms, the Integers and Matrices: Algorithms, The Growth of Functions, Complexity of Algorithms, The Integers and Division, Primes and Greatest Common Devisors, Integers and Algorithms, Applications of Number Theory, Matrices. Induction And Recursion: Mathematical Induction, Strong Induction and Well- Ordering, Recursive Definitions and 11 Structural Induction, Recursive Algorithms, Program Correctness. UNIT-IV Graphs: Graphs and Graph Models, Graph Terminology and Special Types of Graphs, representing Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest- Path Problems, Planar Graphs, Graph Coloring. UNIT-V Counting: The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations. Advanced Counting Techniques: Recurrence Relations, Solving Linear Recurrence Relations, Divide- and-Conquer Algorithms and Recursion Relations, Generating Functions, Inclusion- Exclusion, and Applications of Inclusion-Exclusion. Text Book: 1. Discrete Mathematics & Its Applications with Combinatorics and Graph Theory byKenneth HRosen, Tata McGraw-Hill Publishing Company Ltd., New Delhi. Reference Books: 1. Discrete Mathematics for Computer Scientists & Mathematicians by Joe L. Mott,Abraham Kandel, Theodore P. Baker, Prentice-Hall, India 2. Discrete Mathematics by Richard Johnson Baug, Pearson Education, New Delhi. 3. Discrete and Combinatorial Mathematics by Ralph. G. Grimaldi, Pearson Education, NewDelhi. 12  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1206 IT Workshop LAB L T P Int. Ext 0 0 3 50 50 1.5 COURSE OBJECTIVES 1. Explain the internal parts of a computer, peripherals, I/O ports, connecting cables. 2. Demonstrate basic command line interface commands on LINUX. 3. Teach the usage of Internet for productivity and self-paced lifelong learning. 4. Describe about Compression, Multimedia and Antivirus tools. 5. Demonstrate Office Tools such as Word processors, Spreadsheets and Presentation tools. COURSE OUTCOMES CO1: Assemble and disassemble components of a PC CO2: Construct a fully functional virtual machine, Summarize various LINUX operating system commands. CO3: Able to Troubleshoot hardware and software problems. Module I – Hardware Concepts 1. Every student should identify the peripherals of a computer, components in a CPU and its functions. Draw the block diagram of the CPU along with the configuration of each peripheral and submit to your instructor. Every student should disassemble and assemble the PC back to working condition. Module II – Software Installations 1. Every student should individually install operating system like LINUX or MS windows on the personal computer. The system should be configured as dual boot with both windows and LINUX. 2. Hardware Troubleshooting: Students have to be given a PC which does not boot due to improper assembly or defective peripherals. They should identify the problem and fix it to get the computer back to working condition. 3. Software Troubleshooting: Students have to be given a malfunctioning CPU due to system software problems. They should identify the problem and fix it to get the computer back to working condition. 4. Cyber Hygiene: Students should learn about viruses on the internet and install antivirus software. Student should learn to customize the browsers to block pop ups, block active x downloads to avoid viruses and/or worms. 5. Web Browsers, Surfing the Web: Students customize their web browsers with the LAN proxy settings, bookmarks, search toolbars and popup blockers. 13 Module III – MS-Office 1. MS Word - Features to be covered: Formatting Fonts in word, Drop Cap in word, Applying Text effects, Using Character Spacing, Borders and Colours, Inserting Header and Footer, Using Date. 2. Creating project abstract Features to be covered: Formatting Styles, inserting table, Bullets and Numbering, Changing Text Direction, Cell alignment, Footnote, Hyperlink, Symbols, Spell Check, Track Changes. 3. Creating a Newsletter: Features to be covered: Table of Content, Newspaper columns, Images from files and clipart, Drawing toolbar and Word Art, Formatting Images, Textboxes, Paragraphs in word. 4. Spreadsheet Orientation: Accessing, overview of toolbars, saving spreadsheet files, Using help and resources. Creating a Scheduler: Gridlines, Format Cells, Summation, auto fill, Formatting Text. 5. Calculating GPA - Features to be covered: Cell Referencing, Formulae in spreadsheet – average, std. deviation, Charts, Renaming and Inserting worksheets, Hyper linking, Count function, Sorting, Conditional formatting. 6. Creating Power Point: Student should work on basic power point utilities and tools in Latex and MS-Office/equivalent (FOSS) which help them create basic power point presentation. PPT Orientation, Slide Layouts, Inserting Text, Formatting Text, Bullets and Numbering, Auto Shapes, Lines and Arrows, Hyperlinks, Inserting Images, Tables and charts. 14  Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1207 Engineering L T P Int. Ext 0 0 3 50 50 1.5 Physics Lab COURSE OBJECTIVES To train the student in acquiring skills, techniques of using instruments to observe the physical phenomena, to measure certain physical quantities and constants. COURSE OUTCOMES By the end of the course CO1:Experiment and evaluate basic principles of physics by observing and analyzing the data, plotting graphs and interpreting the results. List of Laboratory Experiments: 1. Determination of Radius of Curvature of a given Convex Lens By forming Newton‘s Rings. 2. Determination of Wavelength of Spectral Lines in the Mercury Spectrum by Normal Incidence method. 3. Study the Intensity Variation of the Magnetic Field along axis of Current Carrying Circular Coil. 4. Determination of Cauchy‘s Constants of a Given Material of the Prism using Spectrometer. 5. Determination of Refractive Index of Ordinary ray µo and Extraordinaryµe ray. 6. Determination of Thickness Given Paper Strip by Wedge Method. 7. Calibration of Low Range Voltmeter. 8. Calibration of Low Range Ammeter. 9. Determination of Magnetic Moment and Horizontal Component of Earth‘s Magnetic Field. 10. Lees Method - Coefficient of thermal Conductivity of a Bad Conductor. 11. Carey Foster‘s Bridge – Verification of laws of Resistance and Determination of Specific Resistance. 12. Melde‘s Apparatus – Frequency of electrically maintained Tuning Fork. 13. Photoelectric cell-Characteristics. 14. Planks Constants. 15. Determination of energy band gap of a given semiconductor. 15 Course Allotment Title of the Course Contact Credits code of Marks Hours/week CS1208 Data Structures LAB L T P Int. Ext 0 0 3 50 50 1.5 COURSE OBJECTIVES: 1. To implement stacks and queues using arrays and linked lists. 2. To develop programs for searching and sorting algorithms. 3. To write programs using concepts of various trees. 4. To implement programs using graphs. COURSE OUTCOMES: At the end of the course student will be able to: Implement programs on stacks, queues and various types of linked list. 1. Develop programs using various graph algorithms 2. Implement program on Binary search tree traversals 3. Write programs using various searching and sorting techniques. List of Programs: 1.Write a C program to implement the operations on stacks. 2.Write a C program to implement the operations on circular queues. 3.Write a C program for evaluating a given postfix expression using stack. 4.Write a C program for converting a given infix expression to postfix form using stack. 5.Write a C program for implementing the operations of a dequeue. 6.Write a C program for the representation of polynomials using circular linked list andfor the addition of two such polynomials. 7. Write a C program to create a binary search tree and for implementing the in order,preorder, post order traversal using recursion 8. a) Write a C program for finding the transitive closure of a digraph b) Write a C program for finding the shortest path from a given source to any vertex ina digraph using Dijkstra’s algorithm 9. a) Write a C program for finding the Depth First Search of a graph. b) Write a C program for finding the Breadth First Search of a graph. 10. Write a C program for sorting a list using Bubble sort and then apply binary search. 11. Write a C program for quick sort 12. Write a C program for Merge sort. 13. Write a C program for Heap sort. Reference Books: 1. Data Structures Using C and C++ Yaddish Langsam, Moshe J.Augenstein and Aaron M.Tanenbaum, Prentice Hall Of India(2ndEdition) 2. Data Structure and Algorithm, Prof. Maria RukadikarS 3. Data Structures, Algorithms and Applications with C++, Sahani Mc-Graw Hill. 16  B. Tech Computer Science and Engineering (R-22 Regulation) II Year – I Semester Hours per Course Intern-al External Total Category Course Title week Credits code Marks Marks Marks L T P ES Elements of Electronics CS2101 3 0 0 30 70 100 3 Engineering Digital Logic Design & CS2102 PC 3 0 0 30 70 100 3 Microprocessors Managerial Economics & 3 0 0 CS2103 HSS 30 70 100 3 Financial Accounting CS2104 PC Design and Analysis of 3 0 0 30 70 100 3 Algorithms Database Management Systems 3 0 0 30 70 100 CS2105 PC 3 CS2106 PC DEMP Lab 0 0 3 30 70 100 1.5 Database Management Systems Lab 0 0 3 50 50 100 CS2107 PC 1.5 CS2108 PC Algorithms through C++ Lab 0 0 3 50 50 100 1.5 Skill Course -1 CS2109 SC 1 0 2 50 50 100 2 C++ Programming CS2110 MC Environmental Science 3 0 0 30 70 100 0 Total Credits 21.5 Course Title of the Course Contact Allotment of Code Hours/week Marks Credits Elements of Electronics L T P Int Ext CS2101. 3 Engineering 3 0 0 30 70 COURSE OBJECTIVES: 1. To introduce Electronics and Communication Engineering in a nutshell. 2. To explain the role of Electronics and Communication Engineering in all other engineering disciplines. 3. To explain the basic building blocks of digital and analog electronic circuits. COURSE OUTCOMES: At the end of the course, the student must be able to CO1: Design simple combinational and sequential circuits. CO2: Analyze the given RC and RL circuits. CO3: Design simple Diode circuits like rectifiers and clipping circuits. CO4: Design circuits using ideal opamp to perform mathematical operations on analog signals. CO5: Appreciate the importance of some of the analog systems such as ADC, DAC. UNIT-I Introduction to Electronics and Semiconductors: Energy band theory, Conduction in Insulators, Semiconductors and metals, Electron emission from metals, Classification of semiconductors, Carrier concentration in an intrinsic semiconductor, Properties of intrinsic semiconductor, Drift and diffusion currents. UNIT-II Semi-Conductor Diode: Theory of PN junction diode, Open circuited PN junction, V-I characteristics of a PN diode, Diode current equation, Transition and diffusion capacitances , Break down in PN diode, Applications of PN diodes. Zener diode, Zener regulator, Tunnel diode, Schottky diode. UNIT-III Rectifying circuits: Half wave and full wave rectifiers, Bridge rectifiers, Efficiency, Ripple and regulation of each rectifier, Capacitor filters. Bipolar Junction Transistor: – Introduction, construction, Operation of PNP and NPN Transistors – Transistor Circuit configurations- Characteristics of a CE configurations – h parameters, low frequency small signal equivalent circuit of a Transistor. UNIT-IV Transistor Biasing and thermal stabilization: Transistor Biasing, Stabilization, Different methods of transistor biasing – Fixed bias, Collector feedback bias – self bias – Bias compensation.Transistor Amplifiers: CE, CB, CC amplifier configurations –Multistage amplifier – A Two Stage RC coupled amplifier – frequency response curve and bandwidth. UNIT-V Field Effect Transistors: Junction Field Effect Transistors (JFET) – JFET characteristics, JFET Parameters, Small signal equivalent circuit – MOSFETS – Depletion and Enhancement MOSFETS. TEXT BOOKS: 1. Electronic Device and Circuits by Sanjeev Guptha. REFERENCE BOOKS: 1. Electronic Device and Circuits Theory by Robert L. Boylested Electronic Device andCircuits by David. A. Bell  Course Contact Allotment Code Title of the Course Hours/week of Marks Credits L T P Int Ext Digital Logic Design and 3 0 0 30 70 3 CS2102 Microprocessors COURSE OBJECTIVES: 1. To learn the basic principles for design of combinational circuit and sequential circuits. 2. Learn about the architecture of 8086 Microprocessor 3. Able to write programs in 8086 COURSE OUTCOMES: At the end of the course student will be able to: CO1: Understand Digital Circuits and Boolean Algebra and Minimize the Boolean expression using Boolean algebra and design it using logic gates. CO2: Realize and simplify Boolean Algebraic functions using K-Maps and design combinational circuits. CO3: Design and develop sequential circuits CO4: Learn 8086 Microprocessors architecture and storage & memory structures CO5: Understand the instruction set and programming of 8086 and able to write Assembly language programs. UNIT-I Introduction :Digital Signals, Digital Circuits, AND, OR , NAND, NOT, NOR and Exclusive-OR Operations, Boolean Algebra and Examples of IC Gates, Number Systems: Binary, Signed Binary, Octal, Hexa decimal Number, Binary Arithmetic, one’s and two’s complements arithmetic, codes, error detecting and correcting codes. UNIT-II Combinational Digital Circuits: Standard Representation for logic functions, K-Map Representation, simplification of logic functions using K-Map, Minimization of Logical Functions, Don’t Care Conditions, Multiplexer, Demultiplexer/Decoders, Adders, Subtractors, BCD Arithmetic, Carry look ahead adder, serial adder, ALU, elementary ALU design, parity checker/generator.  UNIT-III Sequential Circuits and Systems:1-bit memory, the circuit properties of Bistable latch, Clocked S-R Flip- flop, J-K, T and D-types Flip Flops, applications of flip flops, shift registers, applications of shift registers, ripple (Asynchronous) counters, synchronous counters, Counters design using Flip Flops. UNIT-IV Fundamentals of Microprocessors: Fundamentals of Microprocessor, Comparison of 8-bit (8085), 16- bit (8086) and 32-bit (80386) Microprocessors. The 8086 Architecture, Internal Block Diagram, CPU, ALU, Address, data and control bus, working registers, SFRs, Clock and RESET Circuits, STACK and STACK Pointer, Program Counter, Interrupts in 8086, I/O Ports, Memory Structures, Data and Program Memory. UNIT-V 8086 Instruction Set and Programming:8086 Instruction set and Programming, Addressing Modes: Introduction, Instruction Syntax, Data Types, Subroutines Immediate Addressing, Register Addressing, Direct Addressing, Indirect Addressing, Relative Addressing, Indexed Addressing, Data Transfer Instructions, Arithmetic Instructions, Logical Instructions, Branch Instructions, Bit Manipulation Instructions, Assembly Language Programs. TEXT BOOKS: 1. Digital Logic Design and Microprocessors, Dr. Narendra S. Jadhav, Dr. (Mrs.) Alpana P. Adsul, ISBN: 9789354517242. 2. Digital Logic and Microprocessor Design with VHDL, by Enoch Hwang 3. Digital Design, 3rdEdition, M.Morris Mano, Pearson Education REFERENCE BOOKS: 1. Digital Logic Design Principles, Norman Balabanian & Bradley Carlson, John Wiley & Sons (Asia) Pvt.Ltd.,2002 2. The 80x86 Family, Design, Programming and Interfacing, John E. Uffenbeck, 3rdEdition, Pearson Education Inc., 2002 3. BARRY B. BREY, The Intel Microprocessors 8086/8088,80186/80188,80286,80386 and 80486, Pentium, Pentium Pro Processor, Pentium II, Pentium III, Pentium 4, Architecture, Programming and Interfacing, 8th Edition, Pearson Education Inc.,2009.  Course Title of the Course Contact Allotment Credits Code Hours/week of Marks L T P Int. Ext CS2103 Managerial Economics & 3 0 0 30 70 3 Financial Accounting COURSE OBJECTIVES: The objective of this course is to: 1. To understand the concepts of managerial economics and familiar with demand concepts, types of methods or techniques of demand those are used by the entrepreneur or producer. 2. To have a thorough knowledge on the production theories and cost while dealing with the production and factors of production. To introduce the concepts of cost and significance, limitation of Break-even analysis. 3. To understand how to start a business by using different forms of business organizations. 4. To have a knowledge about how to record business transactions and books by using Accounting concepts and conventions, journal, ledger and other accounting records. 5. To assess the sources of funds and the financial position of the business by using common and comparative balance sheets. COURSE OUTCOMES: At the end of this course student will be able to: CO1: Adopt the Managerial Economic concepts for decision making and forward planning. Also know law of demand and its exceptions, to use different forecasting methods for predicting demand for various products and services. CO2: To assess the functional relationship between Production and factors of production and list out various costs associated with production and able to compute breakeven point to illustrate the various uses of breakeven analysis. CO3: To outline the different types of business organizations and their registration process. CO4: To adopt the principles of accounting to record, classify and summarize the accounts. CO5: To plan about the sources of funds for business and the implementation of common size and comparative balance sheets for assessing the financial position of the business. UNIT-I INTRODUCTION TO MANAGERIAL ECONOMICS & DEMAND: Definition, Nature and Scope of Managerial Economics. Demand Analysis: Definition-types of demand – Demand Determinants, Law of Demand and its exceptions. Elasticity of Demand: Definition, Types, Significance of Elasticity of Demand. Demand Forecasting: definition, methods of demand forecasting(survey methods, statistical methods, expert opinion method, test marketing, controlled experiments, judgmental approach to demand forecasting) UNIT-II THEORY OF PRODUCTION AND COST ANALYSIS: Production Function – Law of Variable Proportion, Isoquants and Iso costs, MRTS, Cobb-Douglas Production function, Laws of Returns. Cost Analysis: Types of Cost, Break-even Analysis (BEA), Determination of Break-Even Point (Simple numerical problems) - Managerial Significance and limitations of BEA. UNIT-III BUSINESS ENVIRONMENT: Features of Business Organization, Sole Proprietorship, Partnership and Joint Stock Company, Steps for formation and Registration of the company. UNIT-IV INTRODUCTION TO FINANCIAL ACCOUNTING: Introduction to Accounting: Accounting Principles, Concepts & conventions, Double-Entry Book Keeping, Journal, Ledger and Trial Balance. UNIT-V PREPARATION AND ANALYSIS OF FINANCIAL STATEMENTS: Introduction to Sources ofFinance: Equity shares, Preference shares, debentures, long term loans and Retained Earnings: Financial statement Analysis: advantages, Comparative and Common Size Balance Sheets Statements TEXT BOOKS: 1. A R Aryasri, “Managerial Economics and Financial Analysis”, 4th Edition, TMH Publication, 2012. 2. S A Siddiqui & A. S. Siddiqui “Managerial Economics and Financial Analysis”,1st Edition, New AgePublishers, 2012. REFERENCE BOOKS: 1. Dominick Salvatore, “Managerial Economics: Principles and Worldwide Applications”, 7thedition, OxfordUniversity Press, 2012. 2. N Ramachandran, Ram Kumar Kakani, “Financial Accounting for Management”, 2ndEdition, PearsonEducation, 2007. 3. D N Dwivedi, “Managerial Economics”, 8th Edition, PHI Publication, 2010.  Course Contact Allotment of Title of the Course Credits code Hours/week Marks Design and Analysis of L T P Int. Ext CS2104 3 Algorithms 3 0 0 30 70 COURSE OBJECTIVES: 1. To learn techniques for effective problem solving in computing. 2. To analyze the asymptotic performance of algorithms. 3. To explain familiarity with major algorithms and data structures. 4. To apply algorithm designing techniques such as greedy algorithms, dynamic programming, divide and conquer, backtracking, branch and bound etc. for common engineering design situations. COURSE OUTCOMES: At the end of the course student will be able to 1.Analyze the efficiency of algorithms using mathematical analysis and asymptotic notations. 2.Employ divide-and-conquer and decrease-and-conquer strategies for problem solving. 3. Apply transform-and-conquer and string-matching techniques appropriately when an algorithmic design situation calls for it. 4. Solve problems using algorithm design methods such as the greedy method, dynamic programming. 5.Understand P and NP,NP-complete and NP-hard problems. UNIT-I Introduction Fundamentals of algorithmic problem solving, important problem type. Fundamentals of analysis of algorithms and efficiency, Analysis framework, Asymptotic Notations and Basic Efficiency classes, Mathematical Analysis of Non-recursive Algorithms, Mathematical Analysis of recursive Algorithms. Brute Force: Selection Sort and Bubble sort, Sequential Search and Brute Force String Matching, Closest Pair and Convex Hull Problems by Brute Force–Exhaustive Search. UNIT-II Divide-and-Conquer – Merge sort, Quick sort, Binary Search, Binary Tree Traversals and Related Properties, Multiplication of large integers and Strassen’s Matrix Multiplication, Closest- Pair Convex- Hull Problems by Divide-and-Conquer. Decrease–and–Conquer: Insertion Sort, Depth-First Search and Breadth-First Search, Topological Sorting, Algorithms for Generating Combinatorial Objects, Decrease- by-a-Constant-Factor Algorithms, Variable-Size-Decrease Algorithms.  UNIT-III Transform-and-Conquer – Pre-sorting, Gaussian Elimination, Balanced Search Trees, Heaps and Heapsort, Horner’s Rule and Binary Exponentiation, Problem Reduction. Space and Time Tradeoffs: Sorting by Counting, Input Enhancement in string Matching, Hashing, B-Trees. UNIT-IV Dynamic Programming–Computing a Binomial Coefficient, Warshall’s and Floyd’s Algorithm, Optimal Binary Search Trees, The Knapsack Problem and Memory Functions. Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees. UNIT-V Limitations of Algorithm Power - Lower-Bound Arguments, Decision Trees, P, NP and NP – complete problems, Challenges of Numerical Algorithms. Coping with the Limitations of Algorithms Power: Backtracking, Branch-and-Bound. TEXT BOOKS: 1. Introduction to Design & Analysis of Algorithms by Anany Levitin, Pearson Education,NewDelhi,3rd Edition, 2017. 2. Fundamentals of Computer Algorithms, Horowitz and Sahni, Galgothia publications. REFERENCE BOOKS: 1. Introduction to Algorithms by Thomas H.Corman, Charles E.Leiserson, Ronald R. Rivest & Clifford Stein, Prentice Hall of India, New Delhi, New Delhis  Course Title of the Course Contact Allotment Credits Code Hours/week of Marks Database L T P Int Ext CS2105 3 0 0 30 70 3 Management Systems COURSE OBJECTIVES: 1. Focus the role of a database management system in an organization and construct ER 2.Diagrams Demonstrate basic database concepts, including the structure and operation of the relational data model and basic database queries using SQL. 3. Applying advanced database queries using Structured Query Language (SQL) 4. Evaluating logical database design principles and database normalization. 5. Demonstrate the concept of a database transaction, concurrency control, and data object locking and protocols. COURSE OUTCOMES: After successful completion of the course, the student will be able to: CO1: Understand database design principles. CO2: Apply data Modelling using E-R diagrams. CO3: Create refined data models using normalization. CO4: Build database queries using Structured Query Language. CO5: Understand the transaction management and concurrency control. UNIT-I Introduction to DBMS and Database Design: File system vs DBMS, advantages of DBMS, storage data, queries, DBMS structure, Types of Databases – Hierarchical, Network, Relational, Key-Value, Object Oriented, XML DB Overview of File Structures in database, Data base Design: data models, the importance of data models. E-R model: Entities, attributes and entity sets, relationship and relationship set, mapping cardinalities, keys, features of ER model, conceptual database design with ER model. UNIT-II Relational Model and Basic SQL Relational model: Integrity constraints over relations and enforcement, querying relation data, logical database design, views, destroying/altering tables and views. Basic SQL: Introduction to SQL, Basic SQL Queries: DML, DDL, DCL, TCL.  UNIT - III Structured Query Language (SQL): Select Commands, Union, Intersection, Except, Nested Queries, Aggregate Operators, Null values, Relational set operators, SQL join operators. Relational Algebra(RA): Selection, Projection, Set operations, Joins Relational Calculus (TRC, DRC): Tuple Relational Calculus, Domain Relational Calculus PL/SQL, Assertions, Triggers. UNIT - IV Schema Refinement and Normal Forms: Introduction to Schema Refinement, Functional Dep