Govt.

College for Men(A)::Kadapa

B.Sc. 1st Semester Computer Science Syllabus under CBCS
Paper I - PROBLEM SOLVING IN C

Objectives:

This course aims to provide exposure to problem-solving through programming. It introduces the
concepts of the C Programming language.

Course Learning Outcomes:

Upon successful completion of the course, a student will be able to:

1. Understand the evolution and functionality of a Digital Computer.

2. Apply logical skills to analyse a given problem
3. Develop an algorithm for solving a given problem.
4. Understand ‘C’ language constructs like Iterative statements, Array processing, Pointers, etc.
5. Apply ‘C’ language constructs to the algorithms towrite a ‘C’ language program.

UNIT I

Electronic Computers Then and Now, Computer Hardware: Main Memory, Secondary Memory,
Central Processing Unit, Input Devices, Output Devices, Computer Software: System Software,
Application Software, Computer Languages, Problem solving Techniques: Flow Chart, Algorithm,
Development of algorithms and Flowcharts for simple problems, The Software Development Method,
Applying the Software Development Method for Converting Miles to Kilometers

UNIT II

Introduction to C: Introduction – Structure of C Program – Writing the first C Program – File used in C
Program – Compiling and Executing C Programs – Using Comments – Keywords – Identifiers – Basic
Data Types in C – Variables – Constants – I/O Statements in C- Operators in C- Programming Examples.

Decision Control and Looping Statements: Introduction to Decision Control Statements– Conditional
Branching Statements – Iterative Statements – Nested Loops – Break and Continue Statement – Goto
Statement

UNIT III

Arrays: Introduction – Declaration of Arrays – Accessing elements of the Array – Storing Values in
Array– Operations on Arrays – one dimensional, two dimensional and multi dimensional arrays, character
handling and strings.

UNIT IV

Functions: Introduction – using functions – Function declaration/ prototype – Function definition –

function call – return statement – Passing parameters – Scope of variables – Storage Classes – Recursive
functions.

Structure, Union, and Enumerated Data Types: Introduction –Structures – Arrays of Structures –
Union – Arrays of Unions Variables – Enumerated Data Types.

UNIT V
Pointers: Understanding Computer Memory – Introduction to Pointers – declaring Pointer Variables –
Passing Arguments to Functions using Pointer -Memory Usage – Dynamic Memory Allocation –
Drawbacks of Pointers

Files: Introduction to Files – Using Files in C – Reading Data from Files – Writing Data to Files –
Detecting the End-of-file – Error Handling during File Operations – Accepting Command Line
Arguments.

BOOKS

1. Hanly J R & Koffman E.B, “Problem Solving and Programm design in C”, Pearson Education, 2009.
2. E Balagurusamy – Programming in ANSIC – Tata McGraw-Hill publications.
3. Brain W Kernighan and Dennis M Ritchie - The ‘C’ Programming language” - Pearson publications.
4. Ashok N Kamthane: Programming with ANSI and Turbo C, Pearson Edition Publications.
5. Yashavant Kanetkar - Let Us ‘C’ – BPB Publications.
 Problem solving in C LAB

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 refection of parameters in swapping of two integer values using Call
by Value&Call by Address

6. Write a program that uses functions to add two matrices.

7. Write a program to calculate factorial of given integer value using recursive functions

8. Write a program for multiplication of two N X N matrices.

9. Write a program to perform various string operations.

10. Write a program to search an element in a given list of values.

11. Write a program to sort a given list of integers in ascending order.

12.Write a program to explain pointer Concept.

 Govt.College for Men(A)::Kadapa
Department of Computer Science
Model Paper B.Sc Computer Science - Ist year Model Question Paper

Time: 3 Hrs Max. Marks: 60

SECTION – A
Answer any Five out of Ten questions. Each question carries Four marks (5x4= 20Marks)

1.Write any 4 applications & 4 limitations of Computer.

2Write the features of a)Algorithm b) Flow charts

3.Explain a.Key words

b.Identifiers
c.Constants
d.I/O statements in C language.

4.Explain GOTO statement in C ?

5.Write a C program illustrating break and continue statement?

6.What is string?Explain character handling in C language?

7.Explain advantages of functions?

8.Explain Enumerated datatypes in C with Examples?

9.Explain the advantages of using pointers?

10.Expalin Commandline Arguments in C?

SECTION – B
Answer ALL questions (Internal Choice). Each question carries Eight marks. (5X8=40 Marks)
UNIT-I

11.Explain a)Characteristics of Computers

b)Computer Generations

OR

12.Explain a)features of structured Programming Languages.

b)Features of Efficient and Maintainable Programs

UNIT-II
13.Write about a)structure of C program with example?b)Operators in C language?

OR

14.Explain Iterative Statemts in C with Examples?

UNIT-III
15.What is an Array? Explain Representation,Declaration,Storing,Accessing elements of One
Dimensional Array?
OR

16.Explain Two Dimensional Array? Write a C Program to multiply TWO arrays(2x2)?

UNIT-IV

17.What is Function? Explain passing arguments to Function by a) Value b) Reference.

OR
18.Explain a)Unions
b) Enumerated Datatype

UNIT-V

19.Explain Dynamic Memory Allocation in Pointers?

OR
20.Write about Operations on Files?
 Govt.College for Men(A)::Kadapa
B.Sc.2nd Semester Computer Science Syllabus under CBCS
Paper II - DATA STRUCTURES USING C

Course Objectives:

To introduce the fundamental concept of data structures and to emphasize the importance of various
data structures in developing and implementing efficient algorithms.

Course Learning Outcomes:

Upon successful completion of the course, a student will be able to:

1. Understand available Data Structures for data storage and processing.

2. ComprehendData Structure and their real-time applications - Stack, Queue, Linked List, Trees
and Graph
3. Choose a suitable Data Structures for an application
4. Develop ability to implement different Sorting and Search methods
5. Have knowledge onData Structures basic operations like insert, delete, search,update and
traversal
6. Design and develop programs using various data structures
7. Implement the applications of algorithms for sorting, pattern matching etc

UNIT – I

Introduction to Data Structures: Introduction to the Theory of Data Structures, Data

Representation, Abstract Data Types, Data Types, Primitive Data Types, Data Structure and
Structured Type, Atomic Type, Difference between Abstract Data Types, Data Types, and Data
Structures, Refinement Stages.

Principles of Programming and Analysis of Algorithms: Software Engineering, Program Design,

Algorithms, Different Approaches to Designing an Algorithm, Complexity, Big ‘O’ Notation,
Algorithm Analysis, Structured Approach to Programming, Recursion, Tips and Techniques for
Writing Programs in ‘C’

UNIT – II

Arrays: Introduction to Linear and Non- Linear Data Structures, One- Dimensional Arrays, Array
Operations, Two- Dimensional arrays, Multidimensional Arrays, Pointers and Arrays, an Overview
of Pointers

Linked Lists: Introduction to Lists and Linked Lists, Dynamic Memory Allocation, Basic Linked
List Operations, Doubly Linked List, Circular Linked List, Atomic Linked List, Linked List in
Arrays, Linked List versus Arrays

UNIT – III

Stacks: Introduction to Stacks, Stack as an Abstract Data Type, Representation of Stacks through
Arrays, Representation of Stacks through Linked Lists, Applications of Stacks, Stacks and
Recursion

Queues: Introduction, Queue as an Abstract data Type, Representation of Queues, Circular Queues,
Double Ended Queues- Deques, Priority Queues, Application of Queues

UNIT – IV
Binary Trees: Introduction to Non- Linear Data Structures, Introduction Binary Trees, Types of
Trees, Basic Definition of Binary Trees, Properties of Binary Trees, Representation of Binary Trees,
Operations on a Binary Search Tree, Binary Tree Traversal, Counting Number of Binary Trees,
Applications of Binary Tree

UNIT – V

Searching and sorting: Sorting – An Introduction, Bubble Sort, Insertion Sort, Merge Sort,
Searching – An Introduction, Linear or Sequential Search, Binary Search, Indexed Sequential
Search

Graphs: Introduction to Graphs, Terms Associated with Graphs, Sequential Representation of

Graphs, Linked Representation of Graphs, Traversal of Graphs, Spanning Trees, Shortest Path,
Application of Graphs.

BOOKS

1. “Data Structures using C”, ISRD group Second Edition, TMH

2. “Data Structures through C”, YashavantKanetkar, BPB Publications
3. “Data Structures Using C” Balagurusamy E. TMH
 DATA STRUCTURES USING C LAB
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 begging of an array
b. Insert an element at given index of array
c. Update a element using a values and index
d. Delete an existing element
2. Write a program using stacks to convert a given
a. postfix expression to prefix
b. prefix expression to postfix
c. infix expression to postfix

3. Write Programs to implement the Stack operations using an array

4. Write Programs to implement the Stack operations using Liked List.

5. Write Programs to implement the Queue operations using an array.

6. Write Programs to implement the Queue operations using Liked List.

7. Write a program for arithmetic expression evaluation.

8. Write a program for Binary Search Tree Traversals

9. Write a program to implement dequeue using a doubly linked list.

10. Write a program to search an item in a given list using the following Searching
Algorithms

a. Linear Search

b. Binary Search.

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

a. Bubble Sort
b. Insertion Sort
c. Quick Sort

12. Write a program for polynomial addition using single linked list

13. Write a program to find out shortest path between given Source Node and

14. Destination Node in a given graph using Dijkstrar’s algorithm.

15. Write a program to implement Depth First Search graph traversals algorithm

16. Write a program to implement Breadth First Search graph traversals algorithm
 Govt.College for Men(A)::Kadapa
Paper-II : DATA STRUCTURES USING C
I B.Sc II SEMESTER Model Paper

TIME : 3 HRS MAXMarks:60 M

SECTION-A
Answer any Five out of Eight questions. Each question carries Four marks. (5x4 = 20
Marks)

1. Explain about different types of data structures.

2. Explain about Big ‘O’ Notation.
3. Explain about types of Arrays.
4. What is circular linked list?
5. What is stack and what are the applications of stack?
6. Explain about dequeues.
7. Write about types of trees.
8. Explain about Applications of Binary Tree.
9. Explain about binary search technique.
10. Define graph and list its types.

SECTION – B
Answer ALL questions (Internal Choice). Each question carries Eight marks. (5X8=40
Marks)

UNIT – I
11. Explain in detail about datatypes?
OR
12. What is Recursion? Write a C program to find factorial of a given number using
Recursion.

UNIT – II
13. Explain about pointers and arrays.
OR
14. Explain double linked list and its operations.

UNIT –III
15. Explain about array representation of stacks.
OR
16. Explain about linked representation of queues.

UNIT – IV
17. Explain about array representation of binary trees.
OR
18. Explain about binary tree traversal algorithms.

UNIT – V
19. Explain about linear search?
OR
20. Explain various graph representations.