VIKRAMA SIMHAPURI UNIVERSITY

NELLORE

MINUTES OF THE BOARD OF STUDIES (COMPUTER SCIENCE) FOR

UNDER GRADUATE PROGRAMMES MEETING

A meeting of the Board of Studies (BoS) in Computer Science for Under Graduate was
held on 30-08-2025 at Vikrama Simhapuri University, Nellore, under the chairperson of the BoS
in Computer Science, for preparation of the syllabus of 4-year UG Honors Major & Minor
Programmes and Skill Enhancement Courses for the Academic Year 2025-26.

Agenda:
1. Review and approve the Scheme and Syllabus prescribed by APSCHE for I and II
Semesters of UG B.Sc Honours Computer Science Major and Minor Programmes.
2. Preparation of the Scheme and Syllabus for I and II Semesters of UG B.Sc Honours
Information Technology Major and Minor Programmes.
3. Preparation of the Scheme and Syllabus for I and II Semesters of UG B.Sc Honours Data
Science Major and Minor Programmes.
4. Preparation of the Scheme and Syllabus for I and II Semesters of UG B.Sc Honours Data
Analytics Major and Minor Programmes.
5. Preparation of the Scheme and Syllabus for I and II Semesters of UG B.Voc Honours
Data Science Major and Minor Programmes.
6. Review and approve the Syllabus of Skill Enhancement Course prescribed by APSCHE
for the I Semester of UG Honours Programmes.
7. Preparation of the Model Question Papers.
8. Approval of the External and Internal Scheme of Examination.
9. Any other matters.

The following members of the Board of Studies (UG) in Computer Science attended the meeting.

S.No Name and Designation Capacity Signature

Smt. B. Vidyullatha,
1 Lecturer in Computer Science, Chairperson
PRR & VS Government College, Vidavalur.
Sri. D. Nagabhushanam,
2 Lecturer in Computer Science, Member
SVSSC Govt. Degree College, Sullurpet.
Smt. V. Padmavathi,
3 Lecturer in Computer Science, Member
D.K.W. Govt. Degree College, Nellore.
Resolutions:
1. After careful review and discussion, it is resolved to approve the syllabus as prescribed
by APSCHE for the UG B.Sc Honours Computer Science Major and Minor Programmes
for I and II Semesters with the following minor changes.
a. In Course 2: Problem Solving using C,
 Removed “Working with text files - modes: opening, reading, writing and
closing text files.” from Unit 5.
 Added “C Programming Language, 2nd Edition by Brian W. Kernighan /
Dennis Ritchie (Author)” to the list of text books.
b. In Course 3: Data Structures using C,
 Removed “Types of Queues- De-queues, Priority Queue, Heaps” from Unit 3.
 Removed “Hashing and collision resolution” from Unit 4.
 Removed “Concept of Shortest Path Problems” from Unit 5.
c. In Course 4: Digital Logic Design,
 Removed “Registers- bidirectional shift registers, universal shift register, design
of ripple counters, modulus counters” from Unit 5.
2. The board discussed and prepared the Course Structure (for Semesters I to VI) and the
Syllabus (for I and II Semesters) for the UG B.Sc Honours Information Technology
Major and Minor programmes, by referring to the earlier course structures and syllabi
prescribed by APSCHE and Vikrama Simhapuri University.
3. The board discussed and prepared the Course Structure (for Semesters I to VI) and the
Syllabus (for I and II Semesters) for the UG B.Sc Honours Data Science Major and
Minor programmes, by referring to the earlier course structures and syllabi prescribed by
APSCHE and Vikrama Simhapuri University.
4. The board discussed and prepared the Course Structure (for Semesters I to VI) and the
Syllabus (for I and II Semesters) for the UG B.Sc Honours Data Analytics Major and
Minor programmes, by referring to the earlier course structures and syllabi prescribed by
APSCHE and Vikrama Simhapuri University.
5. The board discussed and prepared the Course Structure (for Semesters I to VI) and the
Syllabus (for I and II Semesters) for the UG B.Voc Honours Data Science Major and
Minor programmes, by referring to the earlier course structures and syllabi prescribed by
APSCHE and Vikrama Simhapuri University.
6. After careful review and discussion, it is resolved to approve the syllabus as prescribed
by APSCHE for Skill Enhancement Course: AI Fundamentals for I Semester without any
modifications.
7. The board discussed and prepared the Model Question Papers (for I and II Semesters) for
the UG B.Sc Honours Computer Science, UG B.Sc Honours Information Technology
Major, UG B.Sc Honours Data Science Major, UG B.Sc Honours Data Analytics Major
and UG B.Voc Honours Data Science Major Programmes.
8. As per the instructions given by the University, it is resolved the following with regard to
the distribution of internal and external marks for theory courses:
 Internal Assessment: 30 marks
 External Examination (End-Semester University Examination): 70 marks
9. It is also resolved and updated Course Structures of UG Honours Programmes with
Internal and External Assessment marks.

BoS – Chairperson
UG Computer Science
 VIKRAMA SIMHAPURI UNIVERSITY
NELLORE

Syllabus for 4-Year UG Honours in B.Sc. (Computer Science) as Major in

consonance with Curriculum framework w.e.f. AY 2025-26

COURSE STRUCTURE (for Semester I to VI)

No. of Hrs Internal External

No. of
Year Semester Course Title of the Course /Week Assessment Assessment Total
Credits
(IA) (EA)
Computer Fundamentals and Office
3 3 30 70 100
Automation
1
I Computer Fundamentals and Office
2 1 0 50 50
Automation-Practical
Problem Solving Using C 3 3
I 30 70 100
2
Problem Solving Using C-Practical 2 1
0 50 50
Data Structures using C 3 3
3 30 70 100
Data Structures using C-Practical 2 1
II 0 50 50
Digital Logic Design 3 3
4 30 70 100
Digital Logic Design -Practical 2 1
0 50 50
OOPS Through JAVA 3 3
5 30 70 100
OOPS Through JAVA-Practical 2 1
0 50 50
III Data Base Management 3 3
6 30 70 100
Data Base Management -Practical 2 1
0 50 50
Computer Organisation 3 3
7 30 70 100
II Computer Organisation-Practical 2 1
0 50 50
Operating Systems 3 3
8 30 70 100
Operating Systems-Practical 2 1
0 50 50
Computer Networks 3 3
IV 9 30 70 100
Computer Networks 2 1
0 50 50
Python Programming 3 3
30 70 100
10
Python Programming-Practical 2 1 0 50 50
 No. of Hrs Internal External
No. of
Year Semester Course Title of the Course /Week Assessment Assessment Total
Credits
(IA) (EA)
Software Engineering 3 3
11 30 70 100
Software Engineering-Practical 2 1
0 50 50

Web Interface Design Technologies 3 3

12 A 30 70 100
Web Interface Design Technologies- 2 1
0 50 50
Practical
OR
V
SEB1:Data Science with R 3 3
12 B 30 70 100
SEB1:Data Science with R-Practical 2 1
0 50 50

Web Application Development using

3 3 30 70 100
PHP &
13 A
MySQL
III
Web Application Development using
2 1 0 50 50
PHP &
MySQL-Practical
OR
Python for Data Science 3 3
13 B 30 70 100
Python for Data Science Practical 2 1
0 50 50

Mobile Application Development 3 3

14 A 30 70 100
Mobile Application Development- 2 1
0 50 50
Practical
OR
Data Visualization Tools 3 3
14 B 30 70 100
VI Data Visualization Tools-Practical 2 1
0 50 50

MERN Stack 3 3
15 A 30 70 100
MERN Stack-Practical 2 1
0 50 50
OR
Machine Learning 3 3
15 B 30 70 100
Machine Learning-Practical 2 1
0 50 50
Note: In the III Year (during the V and VI Semesters), students are required to select a pair of electives from
one of the Two specified domains. For example: if set ‘A’ is chosen, courses 12 to 15 to be chosen as 12 A,
13 A, 14 A and 15 A. To ensure in-depth understanding and skill development in the chosen domain, students
must continue with the same domain electives in both the V and VI Semesters.
 SEMESTER-I

COURSE 1: COMPUTER FUNDAMENTALS AND OFFICE AUTOMATION

Theory Credits: 3 3 hrs/week

Course Objectives

1. Understand foundational computing concepts, including number systems, the evolution

of computers, block diagrams, and generational progress.
2. Develop knowledge of computer architecture, focusing on system organization and
networking fundamentals.
3. Acquire practical skills in document creation, formatting, and digital presentations
using word processing tools.
4. Gain proficiency in spreadsheet operations, such as data entry, formulas, functions, and
charting techniques.
5. Introduce data visualization and basic modelling principles, fostering analytical
thinking in structuring and interpreting data sets.

Course Outcomes

1. At the End of the Course, The Students will be able to explain different number systems,
the historical evolution of computers, and identify key components in a block diagram.
2. Learners will demonstrate basic blocks of a computer and fundamental networking
knowledge.
3. Learners will create professional-level documents and design visually appealing
presentations using word processing software and presentation software.
4. Learners will manipulate data within spreadsheets, apply formulas, and generate accurate
summaries and visualizations.
5. Learners will apply data modelling techniques to analyze, organize, and represent data
effectively in various scenarios.

Unit 1. Number Systems, Evolution, Block Diagram and Generations:

Number Systems: Binary, Decimal, Octal, Hexadecimal; conversions between number systems.

Evolution of Computers: History from early mechanical devices to modern-day systems.

Block Diagram of a Computer: Components like Input Unit, Output Unit, Memory, CPU (ALU
+ CU).

Generations of Computers: First to Fifth Generation – technologies, characteristics, examples.

Unit 2. Basic organization and N/W fundamentals:

Computer Organization: Functional components – Input/Output devices, Storage types, Memory
hierarchy.
Types of Computers: Micro, Mini, Mainframe, and Supercomputers.
Networking Fundamentals: Definition, need for networks, types (LAN, WAN, MAN), topology
(Star, Ring, Bus).

Internet Basics: IP Address, Domain Name, Web Browser, Email, WWW.

Unit 3. Word Processing and presentations:

Word Processing Basics: Using MS Word/Google Docs – formatting, styles, tables, mail merge.

Presentation Tools: Using PowerPoint/Google Slides – slide design, animations, transitions.

Applications: Creating resumes, reports, brochures, and presentations.

Keyboard Shortcuts

Unit 4. Spreadsheet Basics:

Spreadsheet Concepts: Understanding rows, columns, cells in tools like MS Excel/Google
Sheets, cell referencing.

Functions and Formulae: SUM, AVERAGE, IF, COUNT.

Charts and Graphs: Creating visual representations

Data Handling: Sorting, filtering, conditional formatting.

Text Functions: LEFT, RIGHT, MID, LEN, TRIM, CONCAT, TEXTJOIN

Advanced Functions: Logical: IF, AND, OR, IFERROR, Lookup: VLOOKUP, HLOOKUP,
XLOOKUP, INDEX, MATCH

Unit 5. Data Analysis and Visualization:

Conditional Formatting: Custom rules, Color scales, Icon sets, Data bars

Data Analysis Tools: Pivot Tables and Pivot Charts, Data Validation (Drop-downs, Input
Messages, Error Alerts), What-If Analysis: Goal Seek, Scenario Manager, Data Tables

Charts and Dashboards: Creating Interactive Dashboards, Using slicers with Pivot
Tables, Combo Charts and Spark lines

Productivity Tips: Using Named Ranges, Freeze Panes, Split View

Textbooks:

1. Fundamentals of Computers, Reema Thareja, Oxford University Press, Second Edition

2. Fundamentals of Computers, V. Rajaraman – PHI Learning

3. Introduction to Computers by Peter Norton – McGraw Hill

4. Microsoft Office 365 In Practice by Randy Nordell – McGraw Hill Education

References:

1. Excel 2021 Bible by Michael Alexander, Richard Kusleika – Wiley

2. Networking All-in-One For Dummies by Doug Lowe – Wiley

3. Microsoft Official Docs and Training: https://learn.microsoft.com

4. Google Workspace Learning Center: https://support.google.com/a/users/

Activities:

Outcome: At the End of the Course, The Students will be able to explain different number
systems, the historical evolution of computers, and identify key components in a block diagram.

Activity: Create a digital poster or infographic comparing number systems (binary, decimal, octal,
hexadecimal) and illustrating the timeline of computer generations with key innovations.

Evaluation Method: Rubric-based assessment of the poster presentation on a 10-point scale

focusing on:

● Accuracy of number system conversions

● Correct identification of block diagram components
● Visual organization and creativity
Outcome: Learners will demonstrate basic blocks of a computer and fundamental networking
knowledge.

Activity: Design a concept map showing the internal architecture of a computer and types of
networks (LAN, WAN, MAN), including devices and topologies.

Evaluation Method: Checklist-based peer review and instructor validation:

● Completeness of the map

● Correctness of networking concepts
● Use of appropriate terminology
● Logical flow and structure of the map
Outcome: Learners will create professional-level documents and design visually appealing
presentations using word processing software and presentation software.

Activity: Prepare a formal report (e.g., project proposal) in a word processor and present it using a
slide deck with transitions, embedded media, and design elements.

Evaluation Method: Performance-based evaluation using a 10-point scoring scale:

● Formatting and structure of the document

● Presentation aesthetics and clarity
● Communication skills during presentation
Outcome: Learners will manipulate data within spreadsheets, apply formulas, and generate
accurate summaries and visualizations.

Activity: Analyze a dataset (e.g., student scores or sales data) using spreadsheet software. Apply
formulas (SUM, AVERAGE, IF, VLOOKUP) and create relevant charts.

Evaluation Method: Practical test with a rubric:

● Correct use of formulas

● Accuracy of data summaries
Outcome: Learners will apply data modelling techniques to analyze, organize, and represent
data effectively in various scenarios.

Activity: Prepare an interactive dashboard for a given data set using EXCEL.

Evaluation Method: Evaluation of the dashboard on a 10-point scoring scale:

● Presentation aesthetics and clarity

● Interactiveness
● Communication skills during presentation
 SEMESTER-I

COURSE 1: COMPUTER FUNDAMENTALS AND OFFICE AUTOMATION

Practical Credits: 1 2 hrs/week

List of Experiments:

1. Demonstration of Assembling and Disassembling of Computer Systems.

2. Identify and prepare notes on the type of Network topology of your institution.
3. Prepare your resume in Word.
4. Using Word, write a letter to your higher official seeking 10-days leave.
5. Prepare a presentation that contains text, audio and video.
6. Using a spreadsheet, prepare your class Time Table.
7. Using a Spreadsheet, calculate the Gross and Net salary of employees (Min 5) considering
all the allowances.
8. Generate the class-wise and subject-wise results for a class of 20 students. Also generate
the highest and lowest marks in each subject.
9. Using IF, AND, OR, and IFERROR to Automate Grade Evaluation.
a. Create a table of student scores in different subjects.
b. Use IF to assign grades (A/B/C/Fail).
c. Use IFERROR to handle missing scores or invalid data.
10. Employee Database Search Using VLOOKUP, HLOOKUP, XLOOKUP, INDEX, and
MATCH
a. Create a database of employees (Name, ID, Department, Salary).
b. Implement VLOOKUP to search by employee ID.
c. Use HLOOKUP to extract department heads by role.
d. Apply XLOOKUP for more flexible searches.
e. Use INDEX + MATCH as an alternative to VLOOKUP.
11. Sales Report Analysis Using Pivot Tables and Charts
a. Use a dataset of product sales (Product, Region, Date, Quantity, Revenue).
b. Create Pivot Tables to summarize data by region/product.
c. Insert Pivot Charts for visual analysis (e.g., bar, line).
d. Add slicers to make the dashboard interactive.
12. Designing a Data Entry Form with Drop-downs and Input Rules
a. Create a student registration form.
b. Add drop-down lists for course selection using Data Validation.
c. Add input messages to guide users.
d. Add error alerts for wrong entries.
13. Monthly Budget Planning using Goal Seek and Scenario Manager
a. Create a simple personal budget (income, expenses, savings).
b. Use Goal Seek to determine income needed to save a desired amount.
c. Use Scenario Manager to compare different budgeting scenarios (best/ worst/
realistic case).
d. Create a one-variable Data Table to analyze how different expenses affect savings.
14. Dashboard Creation Using Combo Charts, Sparklines & Slicers
a. Use existing sales or attendance data.
b. Insert combo charts (e.g., column + line).
c. Add sparklines to show trends.
d. Use slicers with Pivot Tables to control dashboard elements.
e. Finalize and format for interactivity.
 SEMESTER-I

COURSE 2: PROBLEM SOLVING USING C

Theory Credits: 3 3 hrs/week

Course Objectives:

1. Understand the fundamentals of computer programming, Apply structured problem-

solving approaches using algorithms, flowcharts, and C programming constructs.
2. Develop efficient logic using decision-making, loop, and jump control statements.
3. Utilize derived data types like arrays and strings for modular program design.
4. Design and implement modular solutions using functions, recursive logic, pointer
operations, and dynamic memory management.
5. Handle complex data structures including structures, unions, and text file operations.

Course Outcomes:

At the end of the course, students will be able to:

1. Understand basic computing concepts, programming paradigms and write structured C

programs.
2. Apply control flow statements to solve logical and repetitive tasks in C.
3. Implement arrays and string operations to manage and manipulate data efficiently.
4. Design modular code using functions, recursion, and appropriate parameter passing.
5. Utilize pointers and memory operations for effective data handling. Demonstrate
competence in dynamic memory allocation and text file processing.

Unit 1. Introduction to computer programming:

Introduction, Types of software, Compiler and interpreter, Concepts of Machine level, Assembly
level and high-level programming, Flowcharts and Algorithms, Fundamentals of C: History of C,
Features of C, C Tokens-variables and keywords and identifiers, constants and Data types, Rules
for constructing variable names, Operators, Structure of C program, Input /output statements in C-
Formatted and Unformatted I/O.

Unit 2. Control statements:

Decision making statements: if, if else, else if ladder, switch statements. Loop control statements:
while loop, for loop and do-while loop. Jump Control statements: break, continue and goto.

Unit 3. Derived data types in C:

Arrays: One Dimensional arrays - Declaration, Initialization and Memory representation; Two
Dimensional arrays -Declaration, Initialization and Memory representation. Strings: Declaring &
Initializing string variables; String handling functions, Character handling functions.
Unit 4. Functions:
Function Prototype, definition and calling. Return statement. Nesting of functions. Categories of
functions. Recursion (Basic Concept only). Parameter Passing by address & by value. Local and
Global variables. Storage classes: automatic, external, static and register.
Pointers: Pointer data type, Pointer declaration, initialization, accessing values using pointers.
Pointer arithmetic, Pointers and arrays.

Unit 5. Dynamic Memory Management:

Introduction, Functions-malloc, calloc, realloc, free Structures: Basics of structure, structure
members, accessing structure members, nested structures, array of structures, structure and
functions, structures and pointers. Unions - Union definition; difference between Structures and
Unions.

Text Books:
1. Programming in ANSI C, E. Balagurusamy, Tata McGraw Hill, 6 th Edn,
2. Computer fundamentals and programming in C, Reema Theraja, Oxford University Press.
3. C Programming Language, 2nd Edition by Brian W. Kernighan / Dennis Ritchie (Author).

Reference Books:

1. Let us C, Y Kanetkar, BPB publications

2. Head First C: A Brain-Friendly Guide, David Griffiths, Dawn Griffiths

Activities:

Outcome: Understand basic computing concepts, programming paradigms and write structured C
programs.

Activity: Create a concept map of computing fundamentals and programming paradigms

(procedural, structured, object-oriented). Then, they write a structured C program (e.g., a
calculator or student grade system) using proper syntax, indentation, and modular design.

Evaluation Method: Rubric-based Code Review & Viva to check the

○ The correctness of the concept map

○ Correct use of structure (main + functions)
○ Identification of paradigm used
○ Code readability and documentation
Outcome: Apply control flow statements to solve logical and repetitive tasks in C.

Activity: Implement a program that solves a logic puzzle (e.g., number guessing game, pattern
generation, or prime number finder) using if, switch, for, while, and do-while.
Evaluation Method: Automated Test Cases + Peer Review to check the

○ Correct use of control statements

○ Logical correctness of output
○ Efficiency and edge case handling
○ Peer feedback on clarity and logic
Outcome: Implement arrays and string operations to manage and manipulate data efficiently.

Activity: Build a program that stores and arranges student marks in ascending and descending
order using arrays and performs string operations like concatenation, comparing, and formatting
names.

Evaluation Method: Functional Demonstration + Code Walkthrough to check the

○ Correct array and string usage

○ Memory efficiency
○ Handling of invalid inputs
○ Explanation of sorting/searching logic
Activity:

● Recursive Problem Solver

Students write a modular program to solve a recursive problem (e.g., factorial, Fibonacci,
or Tower of Hanoi) using functions with parameters and return values.
Evaluation Method:

● Code Trace + Written Quiz

○ Correct function decomposition
○ Proper parameter passing (by value/reference)
○ Recursion depth and base case handling
○ Quiz on tracing recursive calls
Outcome: Utilize pointers and memory operations for effective data handling. Demonstrate
competence in dynamic memory allocation and text file processing.

Activity: Create a program that dynamically stores user input (e.g., survey responses) using
pointers and writes/reads the data to/from a text file.

Evaluation Method: Memory Debugging + File I/O Assessment to check the

○ Proper use of malloc, calloc, realloc, and free

○ Pointer arithmetic and dereferencing
○ File creation, reading, writing, and error handling
○ Use of tools like Valgrind or manual memory trace (Optional for Unix flavours)
 SEMESTER-I

COURSE 2: PROBLEM SOLVING USING C

Practical Credits: 1 2 hrs/week

List of Experiments:

1. Write a program to check whether the given number is Armstrong or not.

2. Write a program to find the sum of individual digits of a positive integer.
3. Write a program to generate the first n terms of the Fibonacci sequence.
4. Write a program to find both the largest and smallest number in a list of integer values
5. Write a program to demonstrate change in parameter values while swapping two integer
variables using Call by Value & Call by Address
6. Write a program to perform various string operations.
7. Write a program to search an element in a given list of values.
8. Write a program that uses functions to add two matrices.
9. Write a program to calculate factorial of given integer value using recursive functions
10. Write a program for multiplication of two N X N matrices.
11. Write a program to sort a given list of integers in ascending order.
12. Write a program to calculate the salaries of all employees using Employee (ID, Name,
Designation, Basic Pay, DA, HRA, Gross Salary, Deduction, Net Salary) structure.
a. DA is 30 % of Basic Pay
b. HRA is 15% of Basic Pay
c. Deduction is 10% of (Basic Pay + DA)
d. Gross Salary = Basic Pay + DA+ HRA
e. Net Salary = Gross Salary - Deduction
13. Write a program to read / write the data from / to a file.
14. Write a program to reverse the contents of a file and store in another file.
15. Write a program to create Book (ISBN,Title, Author, Price, Pages, Publisher)structure and
store book details in a file and perform the following operations
a. Add book details
b. Search a book details for a given ISBN and display book details, if available
c. Update a book details using ISBN
d. Delete book details for a given ISBN and display list of remaining Books
 SEMESTER-II

COURSE 3: DATA STRUCTURES USING C

Theory Credits: 3 3 hrs/week

Course Objectives:

1. Understand fundamental concepts of algorithms and data structures with focus on

complexity analysis and abstract data types.
2. Explore various types of linked lists and their dynamic memory representations and
operations.
3. Analyze and implement linear data structures, such as stacks and queues, and examine
their real-world applications.
4. Apply sorting and searching algorithms, understanding their performance implications and
optimization strategies.
5. Design and manipulate hierarchical and graph-based structures, applying traversal
algorithms and understanding their practical uses in computing.

Course Outcomes:

Learners will be able to:

1. Explain algorithm characteristics, time and space complexity, and asymptotic notations
with clarity.
2. Implement and analyze different types of linked lists, including insertion, deletion, and
traversal operations.
3. Develop stack and queue data structures using arrays and linked lists, and apply them in
expression evaluation.
4. Apply efficient searching and sorting algorithms to solve computational problems and
evaluate performance trade-offs.
5. Construct and traverse tree and graph structures, using them to solve problems like
shortest path and spanning trees.

Unit 1. Basic Concepts:

Algorithm: Definition and characteristics, Complexity analysis: Space Complexity, Time
Complexity, Asymptotic Notations.

Introduction to Data structures: Definition, Types of Data structures, Abstract Data Types (ADT),
Introduction to Linked Lists, Representation of linked lists in Memory, Comparison between
Linked List and Array.
Unit 2. Linked Lists:
Types of Linked Lists - Singly Linked list, Doubly Linked list, Circularly Singly Linked list,
Circularly Doubly Linked list; Implementation of Single Linked List ADT: Creating a List,
Traversing a linked list, Searching in linked list, Insertion and deletion into linked list (At first
Node, Specified Position, Last node).

Unit 3. Stacks and Queues:

Introduction to stack ADT, Implementation of stacks using array and Linked List, Application of
stacks - Polish Notations - Converting Infix to Post Fix Notation - Evaluation of Post Fix
Notation.

Queues: Introduction to Queue ADT, Implementation of Queues using array and Linked List,
Application of Queues, Circular Queues.

Unit 4. Searching and Sorting:

Linear or Sequential Search, Binary Search.

Sorting: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort and Merge Sort

Unit 5. Trees and Graphs:

Tree Terminology, Binary Tree Representation, Traversal techniques, Expression Tree, Binary
Search Tree- Definition, Operations on a Binary Search Tree: Creation, Search, Insertion &
deletion.

Graphs: Introduction to Graphs, Terminology, Representation (Adjacency Matrix, Adjacency

List), Traversal of Graphs (DFS, BFS), Applications of Graphs, Concept of Minimum Cost
Spanning Tree.

Textbooks:

1. Data Structures Using C, Balagurusamy E. Tata MCGraw Hill

2. Data Structures using C, Reema Thareja, Third Edition, Oxford University Press
Reference Books:

1. Data Structures, Lipschutz, Schaum’s Outline Series, Tata Mcgraw-hill

2. Data Structures Using C, Ch. Vijay Kumar, Pen Press International

Activities:
Outcome: Explain algorithm characteristics, time and space complexity, and asymptotic notations
with clarity

Activity: Create a comparative chart of algorithms with different notations related to time and
space complexities.

Evaluation Method: Rubric-based assessment of the chart for correctness, clarity, and depth of
explanation on a 10-point scale.
Outcome: Implement and analyze different types of linked lists, including insertion, deletion, and
traversal operations

Activity: Code a menu-driven program in C to implement single linked lists with all basic
operations.

Evaluation Method: Practical lab assessment with test cases and Viva-style questioning to
explain pointer manipulation.

Outcome: Develop stack and queue data structures using arrays and linked lists, and apply them
in expression evaluation

Activity: Build a program to convert infix expressions to postfix and evaluate them using stacks;
Implement queues using both arrays and linked lists with enqueue/dequeue operations.

Evaluation Method: Code review and execution of programs for sample cases and evaluation
based on correctness and efficiency.

Outcome: Apply efficient searching and sorting algorithms to solve computational problems and
evaluate performance trade-offs

Activity: Implement and compare sorting algorithms (e.g., selection sort and bubble sort) and
searching algorithms (e.g., Linear vs. Binary Search) on datasets of varying sizes. Record number
of swaps and iterations for preparing a chart to assimilate the results.

Evaluation Method: Performance report with graphs and analysis. Oral presentation or peer
review discussing trade-offs and algorithm selection rationale.

Outcome: Construct and traverse tree and graph structures, using them to solve problems like
shortest path and spanning trees

Activity: Implement binary trees and graphs using adjacency lists/matrices.

Evaluation Method: Lab demo with sample inputs and visual output (e.g., tree traversal order,
graph paths).
 SEMESTER-II

COURSE 3: DATA STRUCTURES USING C

Practical Credits: 1 2 hrs/week

List of Experiments

1. Write a program to read ‘N’ numbers of elements into an array and also perform the
following operation on an array
a. Add an element at the beginning of an array

b. Insert an element at given index of array

c. Update an element using a values and index

d. Delete an existing element

2. Write a program to implement Single Linked List with insertion, deletion and traversal
operations
3. Write a program to implement Doubly Linked List with insertion, deletion and traversal
operations
4. Write a program to implement the Stack operations using Arrays and Linked Lists.
5. Write a program to convert a given infix expression to a postfix expression using stacks.
6. Write a program to implement the Queue operations using Arrays and Linked Lists.
7. Write a program to implement the Circular Queue operations using Arrays.
8. Write a program for Binary Search Tree Traversals
9. Write a program to search an item in a given list using the following Searching Algorithms
a. Linear Search

b. Binary Search.

10. Write a program for implementation of the following Sorting Algorithms

a. Bubble Sort

b. Insertion Sort

c. Quick Sort

d. Merge Sort
 SEMESTER-II

COURSE 4: DIGITAL LOGIC DESIGN

Theory Credits: 3 3 hrs/week

Course Objectives

1. Introduce the fundamentals of number systems, their conversions, and binary arithmetic
operations.
2. Explore digital logic through gates, Boolean algebra, and simplification techniques for
logic functions.
3. Develop proficiency in designing basic combinational circuits like adders and subtractors.
4. Equip students with the skills to implement advanced combinational components such as
multiplexers, encoders, and decoders.
5. Foster understanding of sequential circuits, flip-flops, counters, and shift registers for
system-level design.

Course Outcomes

At the end of the course, students will be able to:

1. Apply concepts of number systems to perform radix conversions and binary arithmetic
using signed and unsigned formats.
2. Simplify logic functions using Boolean algebra, Karnaugh maps, and universal gates.
3. Design and analyze combinational circuits such as half adders, full adders, and subtractors.
4. Construct advanced combinational logic modules, including multiplexers, demultiplexers,
encoders, decoders, and their hierarchical versions. Realize complex Boolean functions
using combinations of logic modules.
5. Develop and evaluate sequential circuits such as flip-flops, latches, counters, and shift
registers.

Unit 1: Number Systems:

Conversion of numbers from one radix to another radix, r’s, (r-1)’s complements, signed binary
numbers, addition and subtraction of unsigned and signed numbers, weighted and unweighted
codes.

Unit 2. Logic Gates and Boolean Algebra:

NOT, AND, OR, universal gates, X-OR and X-NOR gates, Boolean laws and theorems,
complement and dual of a logic function, canonical and standard forms, two level realization of
logic functions using universal gates, minimizations of logic functions (POS and SOP) using
Boolean theorems, K-map (up to four variables), don’t care conditions.
Unit 3. Combinational Logic Circuits – 1:
Design of half adder, full adder, half subtractor, full subtractor, ripple adders and subtractors,
ripple adder / subtractor.

Unit 4. Combinational Logic Circuits – 2:

Design of decoders, encoders, priority encoder, multiplexers, demultiplexers, higher order
decoders, demultiplexers and multiplexers, realization of Boolean functions using decoders,
multiplexers.

Unit 5. Sequential Logic Circuits:

Classification of sequential circuits, latch and flip-flop, RS- latch using NAND and NOR Gates,
RS, JK, T and D flip-flops, truth tables and excitation tables, conversion of flip- flops, flip-flops
with asynchronous inputs (preset and clear). Shift register.

Text Books:

1. Digital Design, M. Morris Mano, Michael D Ciletti,5th edition, Pearson.

2. Digital Logic Design, K.C. Rao, Ramana, Pen International Press
Reference Books:

1. Digital Electronics and Logic Design, Jaydeep Chakravorty, Universities Press

2. Digital Logic Design, Sonali Singh, BPB Publications

Activities:

Outcome: Apply concepts of number systems to perform radix conversions and binary arithmetic
using signed and unsigned formats

Activity: Design a calculator in a spreadsheet or simulation tool (e.g., Logisim) that performs:
Decimal ↔ Binary ↔ Hexadecimal conversions and binary arithmetic (addition, subtraction).

Evaluation Method: Rubric-based evaluation on a 10point scale (conversion accuracy, arithmetic

correctness)

Outcome: Simplify logic functions using Boolean algebra, Karnaugh maps, and universal gates

Activity: Provide students with complex Boolean expressions and truth tables. Ask them to:
Simplify using Boolean laws, Minimize using Karnaugh maps and Implement using only NAND
or NOR gates

Evaluation Method: Worksheet submission with step-by-step simplification and evaluation of

gate-level implementation using a 10-point scale.

Outcome: Design and analyze combinational circuits such as half adders, full adders, and
subtractors
Activity: Build and simulate: Half adder and full adder using logic gates, and half and full
subtractor circuits

Evaluation Method: Evaluate the correctness of the circuits for different inputs on a 10-point
scale.

Outcome: Construct advanced combinational circuits, including multiplexers, demultiplexers,

encoders and decoders.

Activity: Design Multiplexers for function selection, Decoders for control signal generation and
Encoders for input compression

Evaluation Method: Project-based evaluation with functional demo and assessments based on a
10-point scale.

Outcome: Develop and evaluate sequential circuits such as flip-flops, latches, counters, and shift
registers

Activity: Implement and test SR, JK, D, T flip-flops, asynchronous and synchronous counters
using a simulator (E.g. Logisim, Multisim)

Evaluation Method: Lab assessment on a 10-point scale to understand the correctness of the
circuit and presentation of the design.
 SEMESTER-II

COURSE 4: DIGITAL LOGIC DESIGN

Practical Credits: 1 2 hrs/week

List of Experiments

The laboratory work can be done by using physical gates and necessary equipment or simulators.

Simulators: https://sourceforge.net/projects/gatesim/ or https://circuitverse.org/ or any free open-

source simulator

1. Introduction to digital electronics lab- nomenclature of digital ICs, specifications, study of

the data sheet, concept of Vcc and ground, verification of the truth tables of logic gates
using TTL ICs.
2. Implementation of the given Boolean functions using logic gates in both SOP and POS
forms
3. Realization of basic gates using universal gates.
4. Design and implementation of half and full adder circuits using logic gates.
5. Design and implementation of half and full subtractor circuits using logic gates.
6. Verification of stable tables of RS, JK, T and D flip-flops using NAND gates.
7. Implementation and verification of Decoder and encoder using logic gates.
8. Implementation of 4X1 MUX and DeMUX using logic gates.
9. Implementation of 8X1 MUX using suitable lower order MUX.
10. Implementation of 7-segment decoder circuit.
11. Implementation of 4-bit parallel adder.
12. Design and verification of 4-bit modulus counter.
 Common to B.Sc. Honours Computer Science Major, B.Sc. Honours Information
Technology Major, B.Sc. Honours Data Science Major, B.Sc Honours Data Analytics
Major, B.Voc Honours Data Science Major

SEMESTER - I
COURSE 1: Computer Fundamentals and Office Automation

MODEL QUESTION PAPER

Time : 3 Hours Max. Marks:70

SECTION – A
Answer any FIVE of the following
(Marks: 5 x 4 marks = 20 marks)

1. Write about various number systems.

2. Explain Evolution of Computers.
3.What are input and output devices?
4.What is internet? Write about IP Address.
5. Explain formatting options in MS Word.
6. Write some keyboard shortcuts used in MS Word.
7. Define the following terms: row, column, cell in Excel/Google Sheets.
8. What is the purpose of Goal Seek in What-If Analysis?

SECTION – B
Answer any FIVE of the following
(Marks: 5 x 10 marks = 50 marks)

UNIT- I
9. (a) Explain the components of computer with a neat block diagram.
Or
(b) Explain the generations of computer in detail.

UNIT - II
10. (a) Explain different types of computers.
Or
(b) What is a network? Explain types of networks.

UNIT - III
11. (a) What is mail merge? Explain the steps to use mail merge feature in MS Word.
Or
(b)Explain how to design slides using Google Slides.
 UNIT - IV
12. (a) Explain following functions: SUM, AVERAGE, COUNT, IF with examples.
Or
(b) Write short notes on the following:
i) Sorting ii) Filtering iii) Conditional Formatting

UNIT - V
13. (a) Explain Pivot Tables and Pivot Charts.
Or
(b) Explain Data Validation in detail.
 Common to B.Sc. Honours Computer Science Major, B.Sc. Honours Information
Technology Major, B.Sc. Honours Data Science Major, B.Sc Honours Data Analytics
Major, B.Voc Honours Data Science Major

SEMESTER - I
COURSE 2: Problem Solving using C

MODEL QUESTION PAPER

Time : 3 Hours Max. Marks:70

SECTION – A
Answer any FIVE of the following
(Marks: 5 x 4 marks = 20 marks)

1. Differentiate Compiler and Interpreter.

2. Write the rules for constructing variable names.
3.Write about jump control statements.
4.What is an array? Write about types of arrays.
5. Write about character handling functions.
6. Explain about functions.
7. What is a pointer? Explain how to declare and initialize a pointer variable.
8. Explain how to access structure members with example.

SECTION – B
Answer any FIVE of the following
(Marks: 5 x 10 marks = 50 marks)

UNIT- I
9. (a) Explain the structure of C program with example.
Or
(b) Explain various operators in C.

UNIT - II
10. (a) Explain decision making statements with examples.
Or
(b) Explain loop control statements with examples.

UNIT - III
11. (a) Explain the Declaration, Initialization and Memory representation of One
Dimensional Array with example.
Or
(b) What is a string? Explain string handling functions.
 UNIT - IV
12. (a) Explain parameter passing techniques with examples.
Or
(b) Explain storage classes in C.

UNIT - V
13. (a) Explain the differences between structure and union.
Or
(b) Explain Dynamic Memory Management functions.
 Common to B.Sc. Honours Computer Science Major, B.Sc. Honours
Information Technology Major
SEMESTER-II
COURSE 3: Data Structures using C

MODEL QUESTION PAPER

Time : 3 Hours Max. Marks:70

SECTION – A
Answer any FIVE of the following
(Marks: 5 x 4 marks = 20 marks)

1. Define an Algorithm. Explain its characteristics.

2. Differentiate Linked List and Array.
3. Explain the types of linked lists.
4.What is a stack? Write its applications.
5. Write about Circular Queue.
6. What is searching and sorting.
7. Explain Binary Tree Traversals with examples.
8. Define a Graph. Write the applications of Graph.

SECTION – B
Answer any FIVE of the following
(Marks: 5 x 10 marks = 50 marks)

UNIT- I
9. (a) Define Data Structure. Explain the types of data structures in detail.
Or
(b) Write short notes on
i) Space Complexity ii) Time Complexity iii) Asymptotic Notations

UNIT - II
10. (a) Implement Single Linked List ADT with the following operations:
i) Creating a List ii) Insertion (At first Node, Specified Position, Last node).
Or
(b) Implement Single Linked List ADT with the following operations:
i) Creating a List ii) Deletion (At first Node, Specified Position, Last node).
 UNIT - III
11. (a) Explain the implementation of Stack ADT using an Array.
Or
(b) Explain the implementation of Queue ADT using an Array.

UNIT - IV
12. (a) Explain Binary Search with example.
Or
(b) Explain Bubble Sort with example.
UNIT - V
13. (a) Define Binary Search Tree. Explain the operations of Binary Search Tree.
Or
(b) What are Graph Traversal techniques? Explain with examples.
 B.Sc. Honours Computer Science Major
SEMESTER-II
COURSE 4: DIGITAL LOGIC DESIGN

MODEL QUESTION PAPER

Time : 3 Hours Max. Marks:70

SECTION – A
Answer any FIVE of the following
(Marks: 5 x 4 marks = 20 marks)

1. Explain how to represent signed binary numbers.

2. Distinguish between weighted and non-weighted codes with example.
3. Draw the logic symbol and write the truth table for:
a) AND gate
b) OR gate
4.What are minterms and maxterms? Give examples for each.
5. Write about a combinational circuit.
6. What is decoder? Give an example.
7. Write short notes on priority encoder.
8. Differentiate between a latch and a flip flop.

SECTION – B
Answer any FIVE of the following
(Marks: 5 x 10 marks = 50 marks)

UNIT- I
9. (a) Convert the following
i) (53.625)10 to ( ? )2
ii) (4095)10 to ( ? )16
iii) (2D7)16 to ( ? )8
iv) (777)8 to ( ? )2
Or
(b) Find the 1's and 2's complements of the following 8-digit binary numbers:
i) 10101110 ii) 10000001 iii) 10000000 iv) 00000001 v) 00000000

UNIT - II
10. (a) Simplify the following Boolean functions using three-variable K-map.
a) F(x,y,z)=Σ(0,1,5,7)
b) F(x,y,z)=Σ(0,1,2,3,6,7)
Or
(b) Describe the Postulates and Theorems of Boolean Algebra.
 UNIT - III
11. (a) Define Half-Adder. Design a Half-Adder using logic gates.
Or
(b)What is a Full-Adder ? Implement a Full adder using two half adders and one OR gate.

UNIT - IV
12. (a) What is a multiplexer? Implement the Boolean Function: F(A,B,C)=Σ(1,3,5,6) with a
multiplexer.
Or
(b) Draw the logic diagram of 2:4 Decoder with an ENABLE input using:
i) NAND gates ii) NOR gates.

UNIT - V
13. (a) Explain the operation of RS flip-flop with a logic diagram.
Or
(b) Explain the operation of JK flip-flop with a logic diagram.