SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES.

AUTONOMOUS
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

I B.Tech - I Semester

INTRODUCTION TO PROGRAMMING L T P C
(Common to all Branches) 2 1 0 3

PRE-REQUISITES: Nil

COURSE EDUCATIONAL OBJECTIVES:

1. To introduce students to the fundamentals of computer programming.
2. To provide logical thinking and problem-solving skills using control structures.
3. To familiarize students with programming concepts such as data types, arrays and strings.
4. To introduce the concepts of pointers and user-define data types.
5. To encourage the students with functions and file handling mechanisms.

UNIT- 1 Introduction to Programming and Problem Solving (10)

History of Computers, Basic organization of a computer: ALU, input-output units, memory,
program counter, Introduction to Programming Languages, Basics of a Computer Program-
Algorithms, flowcharts. Introduction to Compilation and Execution, Primitive Data Types,
Variables, and Constants, Basic Input and Output, Operators and Expressions, Type Conversion,
and Casting.

Problem solving techniques: Algorithmic approach, characteristics of algorithm, Problem solving

strategies: Top-down approach, Bottom-up approach, Time and space complexities of
algorithms.

UNIT- 2 Control Structures (8)

Simple sequential programs, Conditional Statements (if, if-else, switch), Loops (for, while, do-
while). Break and Continue.

UNIT- 3 Arrays and Strings (9)

Arrays indexing, memory model, programs with array of integers, two dimensional arrays.
Strings-Declaring and Initializing String Variables, Reading string from terminal, Writing string
to the screen, String Handling Functions.

UNIT-4 Pointers & User Defined Data types (9)

Pointers, dereferencing and address operators, pointer and address arithmetic, array
manipulation using pointers. User-defined data types-Structures and Unions.

UNIT-5 Functions & File Handling (9)

Introduction to Functions, Function Declaration and Definition, Function call Return Types and
Arguments, modifying parameters inside functions using pointers, arrays as parameters. Scope and
Lifetime of Variables. File Handling- Basic Operations on Files – File Handling Function.
TOTAL HOURS: 45
COURSE OUTCOMES:

On successful completion of the course the student will be able POs related to
to, COs
CO1 Understand basics of computers, the concept of algorithm and PO1, PO2
algorithmic thinking.
CO2 Analyze a problem and develop an algorithm and program using PO1, PO2, PO3
control structures to solve it.
CO3 Implement various programming concepts using arrays and PO1,PO2, PO3, PO4
strings.
CO4 Understand and implement more advanced features of pointers PO1, PO2, PO5
and user-defined data types.
CO5 Develop problem-solving using functions and file handling PO1, PO3, PO4,
concepts. PO5
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES.
AUTONOMOUS
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

TEXT BOOKS:
1. "The C Programming Language", Brian W. Kernighan and Dennis M. Ritchie, Prentice- Hall,
1988
2. Schaum’s Outline of Programming with C, Byron S Gottfried, McGraw-Hill Education, 1996

REFERENCE BOOKS:
1. Computing fundamentals and C Programming, Balagurusamy, E., McGraw-Hill Education,
2008.
2. Programming in C, Rema Theraja, Oxford, 2016, 2nd edition
3. C Programming, A Problem Solving Approach, Forouzan, Gilberg, Prasad, CENGAGE,
3rd edition

REFERENCE WEBSITES:
1. https://onlinecourses.swayam2.ac.in/cec22_cs11
2. https://onlinecourses.nptel.ac.in/noc22_cs40
3. https://www.geeksforgeeks.org

CO-PO MAPPING:

CO-
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
PO
CO1 3 3 - - - - - - - - - -

CO2 3 3 2 - - - - - - - - -

CO3 3 3 2 3 - - - - - - - -

CO4 3 3 - - 3 - - - - - - -
CO5 3 - 3 3 3 - - - - - - -

CO* 3 3 2 3 3 - - - - - - -
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

I B.Tech. – I Semester

COMPUTER PROGRAMMING LAB L T P C

(Common to All Branches) 0 0 3 1.5

PRE-REQUISITES: Nil

COURSE EDUCATIONAL OBJECTIVES:

1. To provide knowledge on flowchart and algorithm to the given problem
2. To exercise conditional and iterative statements to write C programs
3. To develop the skill of C programs using arrays, strings and functions.
4. To understand C programs using pointers, Structures and union.
5. To familiarize with file handling techniques.

Week 1
Familiarization with programming environment
i) Basic Linux environment and its editors like Vi, Vim & Emacs etc.
ii) Exposure to Turbo C, gcc
iii) Writing simple programs using printf(), scanf()

Week 2
Converting algorithms/flow charts into C Source code.
Developing the algorithms/flowcharts for the following sample programs
i) Sum and average of 3 numbers
ii) Conversion of Fahrenheit to Celsius and vice versa
iii) Simple interest Calculation

Week 3
Simple computational problems using arithmetic expressions.
i) Finding the square root of a given number
ii) Finding compound interest
iii) Area of a triangle using heron’s formulae
iv) Distance travelled by an object

Week 4
Simple computational problems using the operator’ precedence and associativity
i) Evaluate the following expressions.
a. A+B*C+(D*E) + F*G
b. A/B*C-B+A*D/3
c. A+++B---A
d. J= (i++) + (++i)
ii) Find the maximum of three numbers using conditional operator
iii) Take marks of 5 subjects in integers, and find the total, average in float

Week 5
Problems involving if-then-else structures.
i) Write a C program to find the max and min of four numbers using if-else.
ii) Write a C program to generate electricity bill.
iii) Find the roots of the quadratic equation.
iv) Write a C program to simulate a calculator using switch case.
v) Write a C program to find the given year is a leap year or not.

Week 6
Iterative problems e.g., the sum of series
i) Find the factorial of given number using any loop.
ii) Find the given number is a prime or not.
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

iii) Compute sine and cos series

iv) Checking a number palindrome
v) Construct a pyramid of numbers

Week 7
1D Array manipulation, linear search
i) Find the min and max of a 1-D integer array.
ii) Perform linear search on1D array.
iii) The reverse of a 1D integer array
iv) Find 2’s complement of the given binary number.
v) Eliminate duplicate elements in an array.

Week 8
Matrix problems, String operations, Bubble sort
i) Addition of two matrices
ii) Multiplication two matrices
iii) Sort array elements using bubble sort
iv) Concatenate two strings without built-in functions
v) Reverse a string using built-in and without built-in string functions

Week 9
Pointers
i) Write a C program to find the sum of a 1D array using pointers
ii) Enter n students data using Pointers and display failed students list
iii) Demonstrate the arithmetic operations using pointers.
iv) Write a C Program using Pointers to Read in an Array of Integers and Print its Elements in Reverse Order

Week 10
Structures and Unions
i) Demonstrate the differences between structures and unions using a C program.
ii) Write a C program to find the total, average of n students using structures
iii) Write a C program to copy one structure variable to another structure of the same type.
iv) Write a C program to shift/rotate using bit fields.

Week 11
Simple functions using call by value, solving differential equations using Eulers theorem.
i) Write a C function to calculate NCR value.
ii) Write a C function to find the length of a string.
iii) Write a C function to transpose of a matrix.
iv) Write a C function to demonstrate numerical integration of differential equations using Euler’s
method

Week 12
Recursive functions
i) Write a recursive function to generate Fibonacci series.
ii) Write a recursive function to find the GCD of two numbers.
iii) Write a recursive function to find the factorial of a number.
iv) Write a recursive function to find the sum of series.

Week 13
Simple functions using Call by reference.
i) Write a C program to swap two numbers using call by reference.
ii) Write a C program to copy one string into another using pointer.
iii) Write a C program to find no of lowercase, uppercase, digits and other characters using
pointers.
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

Week 14
File operations
i) Write a C program to write and read text into a file.
ii) Write a C program to write and read text into a binary file using fread() and fwrite()
iii) Copy the contents of one file to another file.
iv) Write a C program to merge two files into the third
v) Write a C program to print last n characters of a given file.
Total Hours: 45

COURSE OUTCOMES:

After the successful completion of this course, the students able POs related to
to: COs
CO1 Read and understand the execution of programs written in C PO1
language.
CO2 Analyze the programs on control statements and arrays. PO2
CO3 Design C programs which utilize memory efficiently using PO3
programming constructs like pointers.
CO4 Develop the programs to demonstrate the applications of arrays, PO4
functions, basic concepts of pointers in C
CO5 Analyze and implement the advanced concepts on functions and File PO5
handling techniques.
CO6 Follow the ethical principles in implementing the programs PO8
CO7 Do experiments effectively as an individual and as a team PO9
member in a group.
CO8 Communicate verbally and in written form, the understanding PO10
about the experiments.
CO9 Continue updating their skill related to loops, pointers and files, PO12
implementing programs in future.

TEXT BOOKS:
1. Ajay Mittal, Programming in C: A practical approach, Pearson.
2. Byron Gottfried, Schaum' s Outline of Programming with C, McGraw Hill

REFERENCE BOOKS:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice-
Hall of India
2. C Programming, A Problem-Solving Approach, Forouzan, Gilberg, Prasad, CENGAGE

REFERENCE WEBSITES:
1. https://onlinecourses.swayam2.ac.in/cec22_cs11
2. https://onlinecourses.nptel.ac.in/noc22_cs40
3. https://www.geeksforgeeks.org.

CO-PO MAPPING:

CO-PO PO PO PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
1 2
CO1 3 - - - - - - - - - - -
CO2 - 3 - - - - - - - - - -
CO3 - - 3 - - - - - - - - -
CO4 - - - 3 - - - - - - - -
CO5 - - - - 3 - - - - - - -
CO6 - - - - - - - 3 - - - -
CO7 - - - - - - - - 3 - - -
CO8 - - - - - - - - - 3 -
CO9 3
CO* 3 3 3 3 3 - - 3 3 3 3
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

I B.Tech. – II Semester

DATA STRUCTURES L T P C
(Common to CSE and Allied branches) 2 1 0 3

PRE-REQUISITES: Computer Programming

COURSE OBJECTIVES:
1. To provide the knowledge of basic data structures and their implementations.
2. To understand importance of data structures in context of linked list concept.
3. To develop skills to apply appropriate data structures in problem solving using stacks.
4. To understand and implement the data structures using queue concept.
5. To provide knowledge about trees and hashing concepts.
UNIT-1 (9)
Introduction to Linear Data Structures: Definition and importance of Linear data structures,
Abstract data types (ADTs) and their implementation, Overview of time and space complexity analysis
for linear data structures. Searching Techniques: Linear & Binary Search, Sorting Techniques: Bubble
sort, Selection sort, Insertion Sort

UNIT- 2 (9)
Linked Lists: Singly linked lists: representation and operations, doubly linked lists and circular linked
lists, Comparing arrays and linked lists, Applications of linked lists.

UNIT- 3 (9)
Stacks: Introduction to stacks: properties and operations, implementing stacks using arrays and
linked lists, Applications of stacks in expression evaluation, backtracking, reversing list etc.

UNIT- 4 (9)
Queues: Introduction to queues: properties and operations, implementing queues using arrays and
linked lists, Applications of queues in breadth-first search, scheduling, etc.
Deques: Introduction to deques (double-ended queues), Operations on deques and their
applications.

UNIT-5 (9)
Trees: Introduction to Trees, Binary Search Tree – Insertion, Deletion & Traversal
Hashing: Brief introduction to hashing and hash functions, Collision resolution techniques: chaining
and open addressing, Hash tables: basic implementation and operations, Applications of hashing in
unique identifier generation, caching, etc.
Total Hours: 45

Course Outcomes

On the successful completion of this course, the student should be POs related
able to, to COs
CO1 Explain the role of linear data structures in organizing and accessing data PO1, PO2
efficiently in algorithms.
Design, implement, and apply linked lists for dynamic data storage,
CO2 demonstrating understanding of memory allocation. PO1,PO2

Develop programs using stacks to handle recursive algorithms, manage

CO3 program states, and solve related problems PO1,PO2,P
O3,
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

Apply queue-based algorithms for efficient task scheduling and breadth- PO1,
CO4 first traversal in graphs and distinguish between deques and priority PO3,PO4
queues, and apply them appropriately to solve data management
challenges.

CO5 Devise novel solutions to small scale programming challenges involving PO1,PO3,PO
data structures such as stacks, queues, Trees. 4,PO5

Text books:
1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd Edition.
2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan Anderson-
Freed, Silicon Press, 2008

Reference Books:
1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter
Sanders
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E.
Hopcroft
3. Problem Solving with Algorithms and Data Structures" by Brad Miller and David Ranum
4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,
and Clifford Stein
5. Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching,
and Graph Algorithms" by Robert Sedgewick

Reference Websites
1. https://nptel.ac.in/courses/106/102/106102064/
2. https://nptel.ac.in/courses/106/106/106106127/

CO-PO Mapping
CO- PO1 PO PO PO4 PO PO6 PO PO8 PO9 PO1 PO1 PO1
PO 2 3 5 7 0 1 2
CO1 3 3 - - - - - - - - - -
CO2 3 3 - - - - - - - - - -
CO3 3 2 2 - - - - - - - -
CO4 3 - 3 3 - - - - - - - -
CO5 3 - 2 2 2 - - - - - - -
CO* 3 3 3 2 2 -
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

I B.Tech. – II Semester

DATA STRUCTURES LAB L T P C

(Common to CSE and Allied branches) 0 0 3 1.5

PRE-REQUISITES: Computer Programming

COURSE OBJECTIVES:
1. To strengthen the ability of the students to identify the problem.
2. To apply the suitable data structure for the given real-world problem.
3. To understand the knowledge about linear data structure.
4. To understand and analyze the data structure concepts using non-linear data structures.
5. To gain knowledge in practical applications of data structures.

List of Experiments:

1: Array Manipulation
i) Write a program to reverse an array.
ii) C Programs to implement the Searching Techniques – Linear & Binary Search
iii) C Programs to implement Sorting Techniques – Bubble, Selection and Insertion Sort

2: Linked List Implementation

i) Implement a singly linked list and perform insertion and deletion operations.
ii) Develop a program to reverse a linked list iteratively and recursively.
iii) Solve problems involving linked list traversal and manipulation.

3: Linked List Applications

i) Create a program to detect and remove duplicates from a linked list.
ii) Implement a linked list to represent polynomials and perform addition.
iii) Implement a double-ended queue (deque) with essential operations.

4: Double Linked List Implementation

i) Implement a doubly linked list and perform various operations to understand its
properties and applications.
ii) Implement a circular linked list and perform insertion, deletion, and traversal.
5: Stack Operations
i) Implement a stack using arrays and linked lists.
ii) Write a program to evaluate a postfix expression using a stack.
iii) Implement a program to check for balanced parentheses using a stack.

6: Queue Operations
i) Implement a queue using arrays and linked lists.
ii) Develop a program to simulate a simple printer queue system.
iii) Solve problems involving circular queues.

7: Stack and Queue Applications

i) Use a stack to evaluate an infix expression and convert it to postfix.
ii) Create a program to determine whether a given string is a palindrome or not.
iii) Implement a stack or queue to perform comparison and check for symmetry.

8: Binary Search Tree

i) Implementing a BST using Linked List.
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

ii) Traversing of BST.

9: Hashing
i) Implement a hash table with collision resolution techniques.
ii) Write a program to implement a simple cache using hashing.
Total Hours: 45

COURSE OUTCOMES

On the successful completion of this course, the student should be POs related
able to, to COs
CO1 Explain the role of linear data structures in organizing and accessing data PO1
efficiently in algorithms
Design, implement, and apply linked lists for dynamic data PO2
CO2 storage, demonstrating understanding of memory allocation.

Develop programs using stacks to handle recursive algorithms, manage PO3

CO3 program states, and solve related problems
Apply queue-based algorithms for efficient task scheduling and breadth- PO4
CO4 first traversal in graphs and distinguish between deques and priority
queues and apply them appropriately to solve data management
challenges.
CO5 Recognize scenarios where hashing is advantageous, and design PO5
hash-based solutions for specific problems.

CO6 Follow the ethical principles in implementing the programs PO8

CO7 Do experiments effectively as an individual and as a team PO9
member in a group.
CO8 Communicate verbally and in written form, the understandingabout the PO10
experiments.
CO9 Continue updating their skill related to loops, pointers and files, PO12
implementing programs in future.

Textbooks:
1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd Edition.
2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan Anderson-
Freed, Silicon Press, 2008
Reference Books:
1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter
Sanders
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E.
Hopcroft
3. Problem Solving with Algorithms and Data Structures" by Brad Miller and David Ranum
4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,
and Clifford Stein
Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph
Algorithms by Robert Sedgewick.
Reference Websites:
1. https://nptel.ac.in/courses/106/102/106102064/
2. https://nptel.ac.in/courses/106/106/106106127/

CO-PO MAPPING
CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 - - - - - - - - - - -
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

CO2 - 3 - - - - - - - - - -
CO3 - - 3 - - - - - - - - -
CO4 - - - 3 - - - - - - - -
CO5 - - - - 3 - - - - - - -
CO6 - - - - - - - 3 - - - -
CO7 - - - - - - - - 3 - - -
CO8 - - - - - - - - - 3 - -
CO9 - - - - - - - - - - - 3
CO* 3 3 3 - 3 - - 3 3 3 - 3
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

I B.Tech. – I Semester

IT WORKSHOP LAB L T P C
(Common to all branches of Engineering) 0 0 2 1

PRE-REQUISITES: Nil

COURSE OBJECTIVES:

1. To introduce the internal parts of a computer, peripherals, I/O ports, connecting cables.
2. To demonstrate configuring the system as Dual boot both Windows and other Operating
Systems Viz. Linux, BOSS
3. To teach basic command line interface commands on Linux.
4. To teach the usage of Internet for productivity and self-paced life-long learning
5. To introduce Compression, Multimedia and Antivirus tools and Office Tools such as Word
processors, Spread sheets and Presentation tools.

List of Experiments:

PC Hardware & Software Installation

1.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.

2.Every student should disassemble and assemble the PC back to working condition. Lab instructors
should verify the work and follow it up with a Viva. Also students need to go through the video which
shows the process of assembling a PC. A video would be given as part of the course content.

3.Every student should individually install MS windows on the personal computer. Lab instructor
should verify the installation and follow it up with a Viva.

4.Every student should install Linux on the computer. This computer should have windows
installed. The system should be configured as dual boot (VMWare) with both Windows and Linux.
Lab instructors should verify the installation and follow it up with a Viva

5.Every student should install BOSS on the computer. The system should be configured as dual
boot (VMWare) with both Windows and BOSS. Lab instructors should verify the installation and
follow it up with a Viva

Internet & World Wide Web

6.Orientation & Connectivity Boot Camp: Students should get connected to their Local Area
Network and access the Internet. In the process they configure the TCP/IP setting. Finally students
should demonstrate, to the instructor, how to access the websites and email. If there is no internet
connectivity preparations need to be made by the instructors to simulate the WWW on the LAN.

7.Web Browsers, Surfing the Web: Students customize their web browsers with the LAN proxy
settings, bookmarks, search toolbars and pop up blockers. Also, plug-ins like Macromedia Flash
and JRE for applets should be configured.

8.Search Engines & Netiquette: Students should know what search engines are and how to use the
search engines. A few topics would be given to the students for which they need to search on
Google. This should be demonstrated to the instructors by the student.

9. Cyber Hygiene: Students would be exposed to the various threats on the internet and would
be asked to configure their computer to be safe on the internet. They need to customize their
browsers to block pop ups, block active x downloads to avoid viruses and/or worms.

LaTeX and WORD

10.Word Orientation: The mentor needs to give an overview of La TeX and Microsoft (MS) office
or equivalent (FOSS) tool word: Importance of La TeX and MS office or equivalent (FOSS) tool Word
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

as word Processors, Details of the four tasks and features that would be covered in each, Using
La TeXand word – Accessing, overview of toolbars, saving files, Using help and resources, rulers,
format painter in word.

11.Using La TeX and Word to create a project certificate. Features to be covered:- Formatting
Fonts in word, Drop Cap in word, Applying Text effects, Using Character Spacing, Borders and
Colors, Inserting Header and Footer, Using Date and Time option in both La TeX and Word.

12.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.

13.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
and Mail Merge in word.

EXCEL
Excel Orientation: The mentor needs to tell the importance of MS office or equivalent (FOSS) tool
Excel as a Spreadsheet tool, give the details of the four tasks and features that would be covered
in each. Using Excel – Accessing, overview of toolbars, saving excel files, Using help and resources.
14.Creating a Scheduler - Features to be covered: Gridlines, Format Cells, Summation, auto fill,
Formatting Text

15.Calculating GPA -. Features to be covered:- Cell Referencing, Formulae in excel – average, std.
deviation, Charts, Renaming and Inserting worksheets, Hyper linking, Count function,

LOOKUP/VLOOKUP
16.Split cells, freeze panes, group and outline, Sorting, Boolean and logical operators, Conditional
formatting

POWER POINT
17.Students will be working on basic power point utilities and tools which help them create basic
power point presentations. PPT Orientation, Slide Layouts, Inserting Text, Word Art, Formatting
Text, Bullets and Numbering, Auto Shapes, Lines and Arrows in PowerPoint.

18.Interactive presentations - Hyperlinks, Inserting –Images, Clip Art, Audio, Video, Objects,
Tables and Charts.

19.Master Layouts (slide, template, and notes), Types of views (basic, presentation, slide slotter,
notes etc), and Inserting – Background, textures, Design Templates, Hidden slides.

AI TOOLS – ChatGPT
20. Prompt Engineering: Experiment with different types of prompts to see how the model
responds. Try asking questions, starting conversations, or even providing incomplete sentences to
see how the model completes them.
 Ex: Prompt: "You are a knowledgeable AI. Please answer the following question: What is the capital
of France?"

21.Creative Writing: Use the model as a writing assistant. Provide the beginning of a story or a
description of a scene, and let the model generate the rest of the content. This can be a fun way
to brainstorm creative ideas
 Ex: Prompt: "In a world where gravity suddenly stopped working, people started floating upwards.
Write a story about how society adapted to this new reality."

22.Language Translation: Experiment with translation tasks by providing a sentence in one

language and asking the model to translate it into another language. Compare the output to see
how accurate and fluent the translations are.
 Ex:Prompt: "Translate the following English sentence to French: 'Hello, how are you doing today?'"
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

Total Hours: 45

Course Outcomes:

On the successful completion of this course, the student should be POs related
able to, to COs
CO1 Acquire knowledge on computer system such as system unit, input PO1
devices, and output devices connected to the computer.
Demonstrate the booting process that includes switching on the system,
CO2 execution of POST routine, then bootstrap loader, and loading of the PO2
operating system, and getting it ready for use.
Demonstrate the working of the internet that include the use of protocols,
CO3 domains, IP addresses, URLs, web browsers, web servers, mail-servers, PO3
etc.
Familiarize with parts of MS Office, To create and save a document, To
CO4 set page settings, create headers and footers, To use PO4
various formatting features such as bold face, italicize, underline,
subscript, superscript, line spacing, etc.
CO5 Prompt the diferent types of questions using CHATBOT PO5

CO6 Follow the ethical principles in implementing the programs PO8

CO7 Do experiments effectively as an individual and as a team member in a PO9

group.

CO8 Communicate verbally and in written form, the understanding about the PO10
experiments

CO9 Continue updating their skill related to MS Office, Internet and Computer in PO12
future.

Text Books:
1. Comdex Information Technology course tool kit, Vikas Gupta, WILEY Dream tech, 2003
2. The Complete Computer upgrade and repair book, Cheryl A Schmidt, WILEY Dream tech, 2013,
3rd edition

Reference Books:
1. Introduction to Information Technology, ITL Education Solutions limited, Pearson Education,
2012, 2nd edition
2. PC Hardware - A Handbook, Kate J. Chase, PHI (Microsoft)
3. LaTeX Companion, Leslie Lamport, PHI/Pearson.
4. IT Essentials PC Hardware and Software Companion Guide, David Anfins on and Ken
Quamme. – CISCO Press, Pearson Education, 3rd edition
5. IT Essentials PC Hardware and Software Labs and Study Guide, Patrick Regan– CISCO Press,
Pearson Education, 3rd edition

CO-PO Mapping
CO-PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 - - - - - - - - - - -
CO2 - 3 - - - - - - - - - -
 SREENIVASA INSTITUTE OF TECHNOLOGY AND MANAGEMENT STUDIES
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(Accredited by NBA)

CO3 - - 3 - - - - - - - - -
CO4 - - - 3 - - - - - - - -
CO5 - - - - 3 - - - - - - -
CO6 - - - - - - - 3 - - - -
CO7 - - - - - - - - 3 - - -
CO8 - - - - - - - - - 3 - -
CO9 - - - - - - - - - - 3
CO* 3 3 3 3 3 - - 3 3 3 - 3