SEMESTER 1

R25PCC101               Mathematical Foundations of Computer Science

Credits : 3         CIE:30 SEE:70 Hrs/Week : 3L 

Course Objectives :

1. To learn logic theory and Boolean Algebra related to computer science

2. To understand relations and functions

3. To gain insights into recurrence relation

4. To comprehend algebraic structure

5. To study graph theory and concepts of trees

Course Outcomes :

By the end of the course, the student will be able to:

CO1 : Understand the required propositional logic to test the logic of a program.

CO2 : Examine various properties of Relations and Functions.

CO3 : Identify the basics of Linear Algebra in the form of Matrices and Vectors.

CO4 : Expose the principle of Inclusion and Exclusion as a basis for various Permutations and Combinations.

CO5 : Evaluate the procedural knowledge on Graphs and Trees to derive applications in Computer

UNIT-I 10 Hrs

Fundamentals of logic: Basic connective and truth tables, logical equivalence, logical implication, Use of quantifiers, definitions and the proof of theorems.

Set theory: Sets and subsets, set operations, and the laws of set theory, counting and Venn diagrams.

Properties of the integers: The well-ordering principle, recursive definitions, division algorithms, fundamental theorem of arithmetic.

UNIT-II 8 Hrs

Relations and functions: Cartesian product, functions onto functions, special functions, pigeon - hole principle, composition and Inverse functions.

Relations: Partial orders, equivalence relations and partitions.

Principle of inclusion and exclusion: Principles of inclusion and exclusion, generalization of principle.

UNIT-III 9 Hrs

Generating functions: Introductory examples, definitions and examples, partitions of integers.

Recurrence relations: First-order linear recurrence relation, second-order linear homogeneous recurrence relation with constant coefficients.

UNIT-IV 8 Hrs

Algebraic structures: Algebraic system general properties, semi groups, monoids, homomorphism, groups, residue arithmetic.

UNIT-V 10 Hrs

Graph theory: Definitions and examples, subgraphs, complements and graph isomorphism, vertex degree, planar graphs, Hamiltonian parts and cycles.

Trees: Definition, properties and examples, rooted trees, spanning trees and minimum spanning trees.

Suggested readings

1. Mott Joe L Mott, Abraham Kandel and Theodore P Baker, Discrete mathematics for computer scientists and mathematicians, Prentice Hall NJ, Second Edition 2015.

2. Jr. P. Tremblay and R Manohar, Discrete mathematical structures with applications to computer science, MCgraw Hill, 1987.

3. R. K. Bisht and H.S Dhami, Discrete mathematics, Oxford higher education, 2015.

4. Bhavanari Satyanarayana, Tumurukota Venkata Pradeep Kumar and Shaik Mohiddin Shaw, Mathematical foundations of computer science, BSP, 2016.

5. Ralph P. Grimaldi, Discrete and combinatorial mathematics, 5th edition, Pearson, 2004.

R25PCC102                                   Data Structures using C

Credits : 4       CIE : 30 SEE : 70 Hrs/Week : 4L 

Course Objectives (CO)

The course aims to:

1. Provide a strong foundation in C programming concepts such as functions, recursion, structures, unions, pointers, and dynamic memory management.

2. Introduce the concept of linear and non-linear data structures and their representations.

3. Develop the ability to implement, analyze, and compare operations on fundamental data structures like lists, stacks, queues, trees, and graphs.

4. Familiarize students with searching, sorting, and hashing techniques for efficient data processing.

5. Enhance problem-solving skills through the application of data structures to real-world computational problems.

Course Outcomes (CO)

On successful completion of the course, students will be able to:

CO1: Understanding as functions, recursion, pointers, structures, unions, and dynamic memory allocation.

CO2: Apply the concepts of linear data structures to solve computational problems.

CO3: Implement and analyze operations on non-linear data structures such as trees and graphs, including traversals and searching.

CO4: Evaluate the efficiency of searching, sorting.

CO5: Design and develop programs using appropriate data structures for real-time applications.

UNIT-I 12 Hrs

Functions – Parameter Passing, void functions, Recursion

Structures and unions – definition, programming examples, passing the structure as parameter to function, Union

Pointers – Definition, Operations on Pointers, Pointer to Arrays, Pointer to Structures

Dynamic Memory Allocation – malloc(), calloc(), realloc(), free(), Programming Example for DMA.

UNIT-II 9 Hrs

Lists - Concept and their representations. Operations – Create, Display, Insert, Delete, Search etc.

Linked lists - Single, Circular Linked List, Doubly Linked Lists, Operations – Create, Display, Insert, Delete, Search etc.

UNIT-III 8 Hrs

Stacks – Linear and Linked Stacks.

Stack Applications – Infix to post conversion, Postfix Expression Evaluation

Queues - Linear and Linked Queues, Circular Queues, Double Ended Queues.

UNIT-IV 10 Hrs

Searching : Linear Search - Binary Search.

Sorting : Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap & Heap Sort.

Hashing : Types of Hashing, Collision resolution techniques.

UNIT-V 9 Hrs

Graph and its representations - Graph Traversals.

Trees - Binary Trees - representation and traversals, Binary Search Trees, AVL Trees, B-Tree

Suggested readings

1. Brian W. Kernighan I Dennis Ritchie, The C Programming language, Second Edition, Pearson 2015

2. Pradip Dey and Manas Ghosh, Programming in C, Second Edition, Oxford University Press, 2011.

3. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, Fundamentals of Data Structures in C, Second Edition, University Press, 2008.

4. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Second Edition, Pearson Education, 1996

5. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, Data Structures and Algorithms, Pearson Education, I983.

R25PCC103     Object Oriented Programming using Java 

Credits : 4 CIE : 30 SEE : 70 Hrs/Week : 4 L 

Course Objectives

1. Learn the basics of object-oriented programming

2. Study Java I/O mechanisms

3. Explore Java API

4. Develop graphics-based Java programs

5. Learn the JDBC, servlet, JSP and Swing framework

Course Outcomes

CO1:Apply object-oriented concepts such as inheritance, interfaces, and inner classes to design modular Java applications.

CO2:Implement file handling using Java I/O streams, readers/writers, and console input/output classes. 

CO3:Apply Java utility classes (BitSet, Date, Calendar, Timer, StringTokenizer) to build efficient applications. 

CO4:Design GUI-based applications using AWT components and the Java graphics library.

CO5: Develop GUI-based desktop applications using the Java Swing package. Using Java Server Pages (JSP), integrating with Servlets and JDBC for full-stack Java web development.

UNIT-I 8 Hrs

Object-Oriented System Development: Understanding Object-Oriented Development, understanding object concepts, Benefits of Object-Oriented Development.

Java Programming Fundamentals: Introduction, Overview of Java, Data Types, Variables and Arrays, Operators, Control Statements, Classes, Methods, Inheritance, Packages and Interfaces, Inner Classes.

UNIT-II 9 Hrs

I/O Basics : Stream and Byte classes, Character Streams, Reading Console input and output, PrintWriter Class, String Handling, Exception Handling, Multithreaded Programming.

UNIT-III 10 Hrs

Exploring Java Language, Collections Overview, Collections Interfaces, Collections Classes, Iterators, Random Access Interface, Maps, Comparators, Arrays, Legacy classes and interfaces, String Tokenizer, BitSet, Date, Calendar, Timer.

UNIT-IV 10 Hrs

Introducing AWT Working with Graphics : AWT Classes, Working with Graphics. Event Handling: Two Event Handling Mechanisms, The Delegation Event Model, Event Classes, Source of Events, Event Listener Interfaces.

AWT Controls : Control Fundamentals, Labels, Using Buttons, Applying Check Boxes, CheckboxGroup, Choice Controls, Using Lists, Managing Scroll Bars, Using TextField, Using TextArea, Understanding Layout Managers, Menu bars and Menus, Dialog Boxes, FileDialog, Handling events by extending AWT Components, Exploring the controls, Menus, and Layout Manager.

UNIT-V 9 Hrs

Introduction to Swing Package,

Introduction to JDBC, JDBC Drivers & Architecture, Connecting to Non-Conventional Databases, Introduction to Servlet, Servlet Life Cycle, Developing and Deploying Servlets, Exploring Deployment, Handling Request and Response, JSP,

Introduction to Java Spring Boot. Suggested Readings

1. Herbert Schildt, The Complete Reference Java, 9th Edition, Tata McGraw Hill, 2005.

2. Bruce Eckel, Thinking in Java, 4th Edition, Pearson Education.

3. Dietel and Dietel, Java: How to Program, 5th Edition, Prentice Hall.

4. James M. Slack, Programming and Problem Solving with JAVA, Thomson Learning, 2002.

5. C. Thomas Wu, An Introduction to Object-Oriented Programming with Java, Tata McGraw Hill, 2005.

6. Kathy Sierra, Bert Bates, Head First Java, 2nd Edition, A Brain-Friendly Guide, Publisher: O'Reilly Media, February 2005. 7. Jim Keogh, J2EE, McGraw Hilll

R25PCC104                                               Computer Architecture

Credits: 3 CIE:30         SEE:70 Hrs/Week : 3L 

Course Objectives:

The course aims to:

1. Learn the basics of data representation

2. Study register transfer micro-operations

3. Explore the CPU

4. Comprehend computer arithmetic algorithms

5. Learn I/O organization

Course Outcomes:

On successful completion of the course, students will be able to:

CO1 : Describe different data types, number systems, complements, binary codes, and fixed- and floating-point representations ,computer functions and interconnection structures.

CO2 : Illustrate the concepts of register transfer, microoperations, and the functioning of a basic ALU microprogrammed control, control memory, and design of a control unit.

CO3 : Demonstrate knowledge of peripheral devices, I/O interfaces, data transfer modes, interrupts, DMA and Memory Organization .

CO4 : Explain general register and stack organization, instruction formats,  program control and arithmetic operations.

CO5 : Analyze arithmetic and instruction pipelines including RISC pipelines and Evaluate CPU performance

      UNIT-I                                                                                                                                                          10 Hrs

Data Representation: Data types, Complements, Fixed- and Floating-Point representations, and Binary codes.

Overview of Computer Function and Interconnections: Computer components, Interconnection structures, Bus interconnection, Bus structure, and Data transfer.

       UNIT-II                         12Hrs

Register Transfer and Micro Operations: Register Transfer language, Register Transfer, Bus and Memory Transfers, Arithmetic, logical and Shift Micro operations,  Arithmetic Logic Shift Unit .

Computer Organization and Design :Instruction codes, CPU Registers, Computer Instructions, Timing and Control,  Instructions Cycle, Memory Reference Instructions,  Input-Output and Interrupt.

Microprogrammed Control: Control memory, Address Sequencing, Micro program example, Design of Control    Unit.

     UNIT-III 9 Hrs

Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous data transfer, Modes of Transfer, Priority Interrupt, Direct Memory Access (DMA), I/O Processor, Serial Communication.

Memory Organization: Memory Hierarchy, Main Memory, RAM and ROM, Auxiliary memory, Associative memory, Cache memory, Virtual memory.

    UNIT-IV                                                                                                                                                       9 Hrs

Central Processing Unit: General Register Organization, Stack Organization, Instruction formats, Addressing modes, Data Transfer and Manipulation, and Program control.

Computer Arithmetic: Addition and Subtraction, Multiplication, Division, and Floating- Point Arithmetic Operations.

    UNIT-V                                                                                                                                                          7 Hrs

Pipeline Processing: Arithmetic, Instruction, and RISC Pipelines.

Assessing and Understanding Performance: CPU performance and its factors, Evaluating performance.

Suggested Readings

1. Morris Mano, Computer System Architecture, Pearson Education India, 3rd Edition, 2007.

2. William Stallings, Computer Organization and Architecture, PHI, 7th Edition, 2008.

3. David A. Patterson, John L. Hennessy, Computer Organization and Design, Morgan Kaufmann, 5th Edition, 2013.

4. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer Organization, Tata McGraw-Hill Education, 5th Edition, 2002.

R25PCC105 Probability and Statistics

Credits : 3 CIE : 30 SEE : 70 Hrs/Week : 3L 

Course Objectives:

1. Understand the Linear Algebra concepts through vector spaces.

2. Basic concepts of probability and various discrete and continuous probability distributions.

3. Learn sampling procedures and various kinds of estimation techniques.

4. Learn hypothesis testing and acquire knowledge of basic statistical inference and its applications.

5. Understand the concept of association between two variables and forecast future values by regression equations.

Course Outcomes:

By the end of the course, the student will be able to:

CO1: Apply linear algebra concepts to understand and implement data science algorithms.

CO2: Understand probability laws and distributions in solving real-world problems.

CO3: Estimate parameters using sample statistics effectively. 

CO4: Analyze and interpret hypothesis tests in practical contexts.

CO5: Perform and interpret correlation and regression analyses with applications.

UNIT-I 8 Hrs

Vector Spaces - Vector Spaces and Subspaces - Null Spaces, Column Spaces, and Linear Transformations.

Linearly Independent Sets - Bases - Coordinate Systems.

UNIT-II 9 Hrs

Probability - Basic terminology, three types of probability, probability rules, statistical independence, statistical dependency, Bayes' theorem.

Probability Distributions - Random variables, expected values, binomial distribution, Poisson distribution, normal distribution, choosing the correct distribution.

UNIT-III 8 Hrs

Sampling and Sampling Distributions - Random sampling, Non-Random Sampling distributions, operational considerations in sampling.

Estimation - Point estimates, interval estimates, confidence intervals, calculating interval estimates of the mean and proportion, t-distribution, determination of sample size in estimation.

UNIT-IV 10 Hrs

Testing Hypothesis - One sample tests - Hypothesis testing of the mean when the population standard deviation is known, powers of hypothesis tests, hypothesis testing of proportions, hypothesis testing of means when the standard deviation is not known.

Testing Hypotheses - Two sample tests - Tests for the difference between means - large sample, small sample, with dependent samples, testing for the difference between proportions - large sample.

UNIT-V 11 Hrs

Chi-square and Analysis of Variance - Chi-square as a test of independence, Chi-square as a test of goodness of fit, analysis of variance, inferences about a population variance, inferences about two population variances.

Regression and Correlation - Simple Regression - Estimation using the regression line, correlation analysis, making inferences about population parameters, limitations, errors, and caveats in regression and correlation analysis. Multiple Regression and correlation analysis. Finding multiple regression

equations and making inferences about population parameters.

Suggested Reading

1. David C. Lay, Linear Algebra and Its Applications, 4th Edition.

2. Richard I. Levin, David S. Rubin, Statistics for Management, Seventh Edition, PHI, 1997.

3. R. D. Sharma, Theory and Problems of Linear Algebra, International Publishing House Pvt. Limited, 2011.

4. A. K. Sharma, Linear Algebra, Discovery Publishing House Ltd., 2019.

5. Gilbert Strang, Linear Algebra and Its Applications, 2010.

6. S. C. Gupta and V. K. Kapoor, Fundamentals of Mathematical Statistics, Sultan Chand & Sons, New Delhi.

R25MGC106 Managerial Economics and Accountancy

Credits : 3 CIE : 30 SEE : 70 Hrs/Week : 3L

Course Objectives

1. To learn important concepts of Managerial Economics and apply them to evaluate business decisions.

2. To understand various parameters that determine consumer behavior.

3. To evaluate the factors that affect production.

4. To understand the concepts of capital budgeting and payback period.

5. To study the concepts of various book keeping methods.

Course Outcomes:

By the end of the course, the student will be able to:

CO1 : Understand the fundamental concepts of managerial economics to evaluate business decisions.

CO2 : Determine various types and elasticities of demand, and apply appropriate techniques for demand forecasting.

CO3 : Evaluate cost-output relationships, and determine price and output under perfect competition and monopoly using break-even analysis.

CO4 : Determine working capital requirements and apply capital budgeting techniques for effective financial planning and investment decision-making.

CO5 : Analyze and interpret financial statements using financial ratios for informed decision-making.

UNIT-I 9 Hrs

Meaning and Nature of Managerial Economics: Managerial Economics and its usefulness to engineers, Fundamental Concepts of Managerial Economics - Scarcity, Marginalism,

Equi-marginalism, Opportunity costs, Discounting, Time Perspective, Risk and Uncertainty, Profits, Case study method.

UNIT-II 8 Hrs

Law of Demand and Supply: Law of Demand, Determinants, Types of Demand; Elasticity of Demand (Price, Income, and Cross-Elasticity); Demand Forecasting, Law of Supply and Concept of Equilibrium.

UNIT-III 9 Hrs

Theory of Production and Markets: Production Function, Law of Variable Proportion, ISO quants, Economies of Scale, Cost of Production (Types and their measurement), Concept of Opportunity Cost, Concept of Revenue, Cost-Output relationship, Break-Even Analysis, Price-Output determination under Perfect Competition and Monopoly.

UNIT-IV 8 Hrs

Working Capital Management and Capital Budgeting: Concepts, Significance, determination, and estimation of fixed and variable working capital requirements, sources of capital.

Introduction to capital budgeting methods: Traditional and modern methods with problems.

UNIT-V 9 Hrs

Accounting: Meaning, Significance, Principles of double-entry book keeping, Journal, Ledger accounts, Subsidiary books, Trial Balance, preparation of Final Accounts with simple adjustments, Analysis and interpretation of Financial Statements through Ratios.

Suggested readings

1. Mehta P.L., Managerial Economics - Analysis, Problems and Cases, Sultan Chand & Sons Educational Publishers, 2011.

2. Maheswari S.N., Introduction to Accountancy, Vikas Publishing House, 2005.

3. Pandey I.M., Financial Management, Vikas Publishing House, 2009.

4. S.P. Jain and K.L. Narang, Financial Accounting, Kalyan Publishers, 2018.

5. M. Hanif and A. Mukherjee, Modern Accountancy, McGraw Hill, 3rd Edition, 2018.

R25LCC151 Data Structures using C Lab

Credits : 1.5 CIE : 25 SEE : 50 Hrs/Week : 3P Course Objectives

1. To understand and implement basic data structures using C.

2. To apply linear and non-linear data structures in problem solving.

3. To learn to implement functions and recursive functions through data structures.

4. To implement searching and sorting algorithms.

Course Outcomes

CO1:Write basic and advanced programs in C.

CO2:Implement functions and recursive functions in C.

CO3:Implement data structures using C.

CO4:Choose an appropriate sorting algorithm for an application and implement it in a modularized way.

Programs

1. Basic C Programs - looping, data manipulations, arrays.

2. Programs using strings - string function implementation.

3. Programs using structures and pointers.

4. Programs involving dynamic memory allocations.

5. Implementation of Linear search.

6. Implementation of Binary search.

7. Implementation of Bubble Sort

8. Implementation of Selection Sort.

9. Implementation of Insertion Sort.

10. Implementation of Merge sort.

11. Implementation Quick sort.

12. Implementation of Heap Sort.

13. Implementation of Single Linked List.

14. Implementation of Circular Linked List.

15. Implementation of Double Linked List.

16. Array implementation of stacks.

17. Array implementation of queues.

18. Linked list implementation of stacks.

19. Applications of Stacks – Infix to Postfix Conversion

20. Applications of Stacks –Postfix Expression Evaluation.

21. Implementation of Binary Trees and Tree Traversals.

22. Implementation of Binary Search Trees.

23. Implementation of Hash functions and Collision resolution techniques.

R25LCC152 Java Programming Lab

Credits : 1.5 CIE : 25     SEE : 50 Hrs/Week : 3P

Course Objectives

1. Learn how to write simple Java programs.

2. Learn how to write multithreaded programs.

3. Learn how to write GUI programs.

4. Learn how to write serialization programs.

5. Learn how to develop web application using servlet.

Course Outcomes

CO1:Be able to write simple Java programs.

CO2:Be able to write multithreaded programs.

CO3:Be able to write GUI programs.

CO4:Be able to write serialization programs.

CO5:Be able to develop small web application using servlet.

Programs

1. Write a program to calculate the salary of n employees using the concept of classes with constructors and methods.

2. Write a program to demonstrate an e-commerce website using inheritance, abstract classes, and dynamic polymorphism.

3. Write a program to demonstrate various arithmetic calculations using packages.

4. Write a program to demonstrate a client-server environment using multithreading.

5. Write a program to demonstrate mutual exclusion using thread synchronization.

6. Write a program to demonstrate a Linked List class.

7. Write a program to demonstrate Hash Set and Iterator classes.

8. Write a program to demonstrate Enumeration and Comparator interfaces.

9. Write a program to accept data and display output in key-value pairs.

10. Write a program to create a registration form with different controls, menus, and demonstrate event handling.

11. Write a program to copy data from one file to another file.

12. Write a program to merge the contents of two files and display output on the console.

13. Write a program to illustrate serialization.

14. Create GUI  to present a set of choices for a user to select stationary products and display the price of product after selection from the list.

15. Develop Servlet Question-Answer Application using HttpServlet Request HttpServlet Response Interfaces.

R25HSC153 Soft Skills Lab

Credits : 1 CIE : 25 SEE : 50 Hrs/Week : 2P Course Objectives

1. Learn conversational skills.

2. Learn reading strategies.

3. Learn time management.

4. Learn stress management.

5. Learn career planning.

Course Outcomes

CO1:Express conversational skills.

CO2:Specify reading strategies.

CO3:Perform time management.

CO4:Perform stress management.

CO5:Explore career planning.

Activities

1. Conversation skills, listening dialogues from TV/radio/Ted Talks/Podcasts.

2. Group discussion.

3. Interview Skills, Making Presentation.

4. listening to lectures and News programmes, listening to talk shows.

5. Watching videos on interesting events on Youtube,

6. Reading different genres of tests ranging from newspapers to philosophical treatises.

7. Reading strategies ◻ graphic organizers, Reading strategies ◻ summarizing

8. Reading strategies ◻ interpretation reports.

9. Writing cover letters, resumes.

10. Writing for publications, letters, memos, emails, and blogs.

11. Civil service (language-related), verbal ability.

12. Motivation, self-image.

13. Goal setting, managing changes.

14. Time management, stress management.

15. Leadership traits.

16. Teamwork.

17. Career and life planning.

18. Multiple intelligences.

19. Emotional intelligence.

20. Spiritual quotient (ethics).

21. Intercultural communication.

22. Creative and critical thinking.

23. Learning styles and strategies.

Suggested readings

1. Business English Certificate materials, Cambridge University Press.

2. Graded Examinations in Spoken English and Spoken English for Work downloadable materials from Trinity College, London.

3. International English Language Testing System Practice Tests, Cambridge University Press.

4. Interactive Multimedia Programs on Managing Time and Stress.

5. Personality Development (CD-ROM), Times Multimedia, Mumbai.

6. Robert M. Sherfield, Developing Soft Skills, 4th Edition, Pearson Education, 2009.

Web Resources :

http://www.slideshare.net/rohitjsh/presentation-on-group-discussion http://www.washington.edu/doit/TeamN/present_tips.html http://www.oxforddictionaries.com/words/writing-job-applications http://www.kent.ac.uk/careers/cv/coveringletters.htm http://www.mindtools.com/pages/article/newCDV_34.htm