DAVANGERE UNIVERSITY

Shivagangotri, Davangere-577002
Board of Studies in Computer Science
BCA Graduate Programme Structure and Contents -CBCS Scheme
1st Semester
Sem Paper *E/C/L Paper Teaching Marks
ester Code Hours
Theor Practic IA Exa Total Credit
y al m s
- L Kannada 4 - 20 80 100 4
- L English 4 - 20 80 100 4
16BA21 C Mathematics-1 4 - 20 80 100 4
16BA22 Introduction to Computer 4 - 20 80 100 4
C Science
16BA23 Windows and Office - 3 20 80 100 4
1
C Automation Lab
16BA24 Programming Fundamentals 4 - 20 80 100 4
C and C Programming
16BA25 C C Programming Lab - 3 20 80 100 4
- C Foundation Course 4 - 20 80 100 4
- C EC & CC 1 - 50 - 50 1
21
0 640 850 33

2nd Semester
Seme Paper *E/C/L Paper Teaching Marks
ster Code Hours
Theor Practic IA Exa Total Credit
y al m s
- L Kannada 4 - 20 80 100 4
- L English 4 - 20 80 100 4
16BB21 C Mathematics-2 4 - 20 80 100 4
16BB22 C Data Representation and Digital 4 - 20 80 100 4
Electronics
2 16BB23 C Trouble Shooting and Networking - 3 20 80 100 4
Lab
16BB24 C Data Structures using C 4 - 20 80 100 4
Programming
16BB25 C Data Structures using C Lab - 3 20 80 100 4
- C Foundation Course 4 - 20 80 100 4
- C EC & CC 1 - 50 - 50 1
21
0 640 850 33

3rd Semester
Seme Paper *E/C/L Paper Teaching Marks
ster Code Hours
Theor Practic IA Exa Total Credit
y al m s
3 L Kannada 4 - 20 80 100 4
L English 4 - 20 80 100 4
16BC21 C Comp. Orgn. & Arch. 4 - 20 80 100 4
16BC22 C Data Base Management System 4 - 20 80 100 4
16BC23 C Data Base Management System - 3 20 80 100 4
 Lab
16BC24 C Object Oriented Prog. with C++ 4 - 20 80 100 4
Object Oriented Prog. with C++ - 3 20 80 100 4
16BC25 C Lab
- C Foundation Course 4 - 20 80 100 4
- C EC & CC 1 - 50 - 50 1
21
0 640 850 33

4th Semester
Seme Paper *E/C/ Paper Teaching Hours Marks
ster Code L Theor Practical IA Exa Total Credit
y m s
L Kannada 4 - 20 80 100 4
L English 4 - 20 80 100 4
16BD2 4 - 20 80 100 4
1 C Operating Systems
16BD2 4 - 20 80 100 4
2 C Java Programming
4 16BD2 - 3 10 40 50 4
3 C Java Programming Lab
16BD2 Internet 4 - 20 80 100 4
4 C Programming[HTML,CSS,Java Script]
16BD2 - 3 10 40 50 4
5 C Internet Programming Lab
- C Foundation Course 4 - 20 80 100 4
- C EC & CC 1 - 50 - 50 1
19
0 560 750 33

5th Semester
Seme Paper *E/C/ Paper Teaching Hours Marks
ster Code L Theor Practical IA Exa Total Credit
y m s
12BE2 Software Engineering 4 - 20 80 100
1 C 4
12BE2 Data Communications & 4 - 20 80 100
2 C Networks 4
12BE2 4 - 20 80 100 4
3 C E-Commerce
12BE2 4 - 20 80 100 4
4 C J2EE [Servlets, JSP, Beans, Corba]
12BE2 - 4 20 80 100 4
5 5 C J2EE Lab
PHP and MySQL [Web
12BE2 E5.1 Programming]
E5.2 4 - 20 80 100 4
6 Advanced Microprocessor 8086
E5.3 Software Testing
E5.1 Web Programming Lab
12BE2
E5.2 Microprocessor Lab - 4 20 80 100 4
7
E5.3 Software Testing Lab
- C SDC 4 - 20 80 100 4
16
0 640 800 32
 6th Semester
Seme Paper *E/C/ Paper Teaching Hours Marks
ster Code L Theor Practical IA Exa Total Credit
y m s
12BF2 Cloud Computing 4 - 20 80 100
1 C 4
12BF2 4 - 20 80 100
2 C Data Warehouse and Data Mining 4
12BF2 UNIX 4 - 20 80 100 4
3 C
12BF2 - 4 20 80 100 4
4 C UNIX Lab
E6.1 VB.NET Programming
6 12BF2
E6.2 Android Programming 4 - 20 80 100 4
5
E6.3 Network Programming
E6.1 VB.NET Programming Lab
12BF2 Android Programming Lab
E6.2 - 4 20 80 100 4
6
E6.3 Network Programming Lab
12BF2 Project Work - 4 10 40 50 4
7 C
- SDC 4 - 20 80 100 4
15
0 600 750 32
* E/C - Elective / Compulsary / L-Language

BCA 1st Semester Basic Mathematics

Subject 16BA21 Total Teaching 52
Code : Hours :
IA Marks : 20 Teaching 04
Hours/Week :
Exam 80 Examination 03
Marks : Hours :
Credits : 4

1. Symbolic Logic : Proposition and its types, Negation, Disjunction,

Conjunction, Tautologies and Contradictions, Logical equivalence, Algebra of
propositions, conditional Propositions, Converse, Inverse and ContraPositive
Proposition, Bi-conditional Proposition, Arguments (Formation of truth table
and simple problems). [07
Hrs]
2. Matrices and Determinants: Matrix, order, types of Matrices, addition,
subtraction, scalar multiplication of a matrix, product of two matrices,
problems,. Determinants of a square matrix and evaluation, minor, cofactor of
element of a square matrix, adjoint, singular matrices, inverse of a square
matrix, problems. Solution of a system of linear equations by matrix method,
characteristic equation and characteristic roots of a square matrix of orders 2
and 3. [10Hrs]
3. Set Theory: Equivalent sets, identical sets, empty set, union and
Intersection of sets, complement of a set, difference of sets and problems.
Cartesian product of two sets, relation, domain and range of a Relation, Types
of relations, Identities, reflexive, symmetric Transitive, antisymmetric, Inverse
Relations and problems. Functions, Into, one-one, onto, Bijective, constant
functions, Inverse functions, Inverse of an element, composition of two
mappings problems. [10Hrs]
4. Trigonometry : Definitions of Trigonometric functions, Trigonometric ratios of
an acute angle, Trigonometric Identities and Problems, Trigonometric
Functions of Standards angles (without proof) Problems, Trigonometric
functions of allied angles (statement only without proof) and problems.
Compound angles, multiple and sub-multiple angles and Transformation
formulae (without proof) Simple problems, Inverse trigonometric functions
Derivations of standard formulae and problems.
[10Hrs]
5. Continuity and Differentiation: Continuity and Differentiability concept,
derivatives of standard functions from 1 st principle - xn, eax, log ax, ax, Sin ax,
Cos ax, Tan ax, cot ax, sec ax and cosec ax (with proof). Derivative of
composite function, chain rule, derivative of inverse trigonometric functions,
derivative of implicit functions. Concepts of exponential and logarithmic
functions to base e. Derivatives of exponential and logarithmic functions.
logarithmic differentiation, derivatives of functions expressed in parametric
forms. Second order derivatives. [10Hrs]
6. Principle of Mathematical Induction: Process ot the proof by induction,
motivating the application of the method by looking at natural numbers as
the least inductive subset of real numbers. The principle of mathematical
induction and simple application. [5 Hrs]
Reference Books:
1. Set Theory and related Topics S. Lipschutz.
2. Matrices F. Ayres
3. Matrices Shantinarayan
4. Real Analysis-N.P.Bali
5. Mathematics text books(NCERT) vol1 and vol 2-Arora
6. Mathematics text books(NCERT) vol1 and vol 2-S.S.Bosco

BCA 1st Semester Introduction to Computer

Science
Subject 16BA22 Total Teaching Hours : 52
Code :
IA Marks : 20 Teaching Hours/Week : 04
Exam 80 Examination Hours : 03
Marks :
Credits: 4

1. Introduction to Computer Science: Introduction, Characteristics of

Computers, Generation of Computers, Classifications of Computers, the
Computer System, Applications of Computers. 6 Hrs
2. Computer Architecture: Introduction, CPU, Memory, Communication between
Various Units of a Computer System, The Instruction format, Instruction Set,
Multiprocessor Systems, Primary Memory, Secondary Storage, Input and Output
Devices 8 Hrs
3. Computer Software: Introduction, Software Definition, Relationship between
Hardware & Software, Software Categories- System Software, Application
Software, Software Terminology. 6 Hrs
4. Introduction to Excel : Functions of Microsoft Excel , Calculations,
Recalculations, Repeat Information, Reverse Changes, Add Display
Enhancements, Copy & Reuse your Sheet; Starting MS Excel : Excel
Environment , Office Assistant, Title bar, Performing Operations through Menus,
 Changing the size of a work book and Excel Window, Cell and Cell Address,
Standard Toolbar, Formatting Toolbar, The Formula bar, Status bar, Components
of an Excel Work Book, Closing Excel Work Book without Saving, Quitting M S
Excel, Working in Excel : Moving inside a Work Book, Moving Cell-pointer quickly,
Selecting a Command, types of data, Entering data , making changes to an
entry, Mathematical Calculations, Manipulating Data, Changing the layout,
Simple Graphs, Manipulating Sheets. 12 Hrs
5. Introduction to Access : Introduction to Database, Defining a database,
Understanding RDBMS, Objects of Relational DB- Tables, Queries, Forms &
Reports, Macros, Functions of DBMS, Creating Tables, Working in Table, Saving
Table, Defining Primary Key, Adding Validations to the table, Updating Table-
Modifying table, Rearranging Field, Adding Field, Deleting Field, Changing Column
Width , Changing Height of Row , Working with Forms, Handling Quires.
Generating Reports. 10 Hrs
6. Introduction to Computer Programming Using HTML: Introduction to HTML,
Providing Structured Format, Creating Your First HTML Page, Adding Title, Adding
Different Headings, Adding Paragraphs and Emphasis, Forcing Line Breaks, Using
Non-Break Spaces, Performing Text, Adding Special Characters, Creating Lists,
Adding Links to other Pages, Adding links to Areas in the same page, Working
with Images, Flowing Text around Images, Using Tables.
10 Hrs

Text Books:
1. Introduction to Computer Science, ITL Education Solution Limited published by
Pearson Education
2. Comdex Computer Course Kit.
3. Active Server Pages and ASP.NET by Kris Jamsa Thomson Publication.

BCA 1st Semester Basic Skills Lab

Subject 16BA23 Total Teaching 39
Code : Hours :
IA Marks : - Lab Hours/Week : 03
Exam 50 Examination 03
Marks : Hours :
Credits: 4

1. MS DOS:
a. Internal Commands.
b. External Commands: - More, Move, attrib, edit, Tree, Sort, deltree.

2. Introduction to MS-Word:
a. Creating Biodata,
b. Designing Marks Card.
c. Designing Time table.
 d. Job Application.

3. Introduction to MS-Excel:
a. Creating Employee Payroll.
b. Students Marks List.
c. Drawing Bar Charts.
d. Drawing Pie Chart.

4. Introduction to MS-Power Point:

a. Designing a Visiting Card in a single slide.
b. Animating different objects on single slide.
c. Designing multiple slides with timed transitions. (at least 5 slides).
d. Inserting and Designing a Chart in slide.

5. Introduction HTML programming:

a. Linking Pages.
b. Putting Images in HTML.
c. Using Tables.
Text Book:
1. Working with MS-OFFICE 2000, Content Development Group, Chennai,
Tata McGraw-Hill
2. T R Jagadeesh, M A Jayaram , D S rajendra Prasad, A Computer
Laboratory Refferal for Diploma and Engineering Students

Examination:
2 Questions may be chosen one from each of any two groups among Word,
Excel, PowerPoint or HTML.
Student has to answer and execute both questions.

Marks Distribution:

Exam Marks
Practical Proper 35+35
=60
Viva 10
Report 20
Total 100

BCA 1st Semester C Programming

Subject 16BA24 Total Teaching 39
Code : Hours :
IA Marks : 20 Lab Hours/Week : 04
Exam 80 Examination 03
Marks : Hours :
Credits: 4

1. Computer Software: Introduction, Software Definition, Relationship between

Hardware & Software, Software Categories- System Software, Application
Software, Software Terminology. Classification of programming languages,
Assemble, Complier, Interpreter, linker, loader, operating System.(only
Definitions), Algorithms and flow charts. 10 Hrs
 2. C Programming: Introduction, features basic program structure, character set,
tokens, keywords and identifier. Constants, variables, data types, variables
declaration, symbolic constant definition. Operators: Arithmetic, relational,
logical, assignment, increment, decrement, conditional, bitwise and special
operators, Arithmetic expressions, evaluation of expressing precedence of
operators and associativity. Type conversions. Mathematical functions, managing
I/O operators reading and writing a character, formatted I/O.
10 Hrs.

3. Decision making, Branching and Looping: Introduction, Sequential and

Branching Statements, Simple IF, IF-ELSE, Nested-IF, ELSE-IF ladder, switch
statements, the ?: operator, goto statements, while, do-while and for statements,
break and continue statements.
8 Hrs.

4. Arrays and Strings: Introduction, one and two dimensional arrays, array
declaration and initialization. String:- declaration and initialization of string
variable, reading and writing strings, string handling functions.
8 Hrs.

5. Function: Introduction, Need, Definition, Syntax of function Declaration, Return

Values and Their Type, Function Calls, Nesting of functions, function with arrays.
6 Hrs.

6. Pointers: understanding pointers, accessing the address of a variable, declaring

and initializing pointers, accessing a variable through its pointers.
4 Hrs.

7. Structures: Definition, Declaration, Syntax, Accessing members of a Structure,

Initialization, Structures within Structures, Structures and Functions, Definition of
union and its general form.
6 Hrs.

Text Books:
(1)Programming in ANSIC E.Balaguruswamy.
(2)Computer Concepts and C programming Techniques: A. M Padma Reddy.

Reference Books:
(1) Let us C Yashwantkanetkar.
(2)Computer Concepts and C programming: P B Kottur

BCA 1st Semester C Programming

Lab
Subject 16BA25 Total Teaching 39
Code : Hours :
IA Marks : - Lab Hours/Week : 03
Exam 50 Examination 03
Marks : Hours :
Credits: 4
 1. WAP to find biggest of 3 numbers.
2. To simulate calculator array SWITCH statements.
3. WAP to find sum of first N numbers.
4. To generate prime numbers between two integers M and N.
5. To find the sum of odd positioned digits in the given integer.
6. WAP to generate fibanocci numbers between two integers P and Q.
7. WAP to cheek whether given number is palindrome or not.
8. To find the biggest and second biggest among N numbers (without using
array).
9. To count the numbers of words, vowels, spaces and lines in the given text.
10. WAP to sort the given array in ascending order using linear sort
11. WAP to search an element using binary search.
12. To delete the repeated elements in an array.
13. WAP to add two matrices using Functions.
14. WAP to multiply two matrices using Functions.
15. To find the sum of each row and column in a matrix.
16. To find the norm of trace of a matrix.
17. To transpose the given matrix and check whether the transpose in same
as the original matrix.
18. To read an array and count the number of even nos and odd nos in an
array of size N.
19. To read an array and to find the biggest element in an array and with its
position.
20. To sort the diagonal element of a square matrix.

Examination:

One Question has to be given from the above list (Carries 25 Marks).
One more question has to be given by the examiner by his choice and that
question need not be in the list (Carries 15 Marks).
Student has to answer and execute both questions.

Marks Distribution:

Criteria Marks
Question from The Examiners
List Question
Practic Writing 20 20
al Program
Proper Execution 15 15
Total 70
Viva 10
Report 20
Total 100
 BCA 2nd Semester Mathematics
Subject Code : 16BB21 Total Teaching 52
Hours :
IA Marks : 20 Teaching 04
Hours/Week :
Exam Marks : 80 Examination 03
Hours :
Credits: 4

1. Complex Numbers : Definition of Complex Number as an ordered pair, real

and imaginary parts, modulus and amplitude of a complex number, polar
form of a complex number, problems.
DeMoires theorem (statement only) method of finding square roots ,cube
roots, and fourth roots of a complex number and their representation in the
Argand diagram.
[8 Hrs]
2. Standard Integrals: Integration as inverse process of differentiation.
Integration of algebraic, logarithmic, exponential and trigonometric functions,
Integration by parts and by partial fraction. Definite Integrals and evaluation
of definite integrals . Application of definite Integrals- application in finding
the area under simple curves. [10 Hrs]
3. Polar Curves: Introduction, angle between radius vector and tangent, length
of the perpendicular from the pole to the tangent, angle between two curves,
pedal equations.
[6 Hrs]
4. Three dimensional Geometry: Direction cosines and direction ratios of a
line joining two points. Cartesian equation of a line, coplanar and skew lines,
shortest distance between two lines. Cartesian equation of a plane. Angle
between i)Two lines ii) Two planes.
[8 Hrs]
5. Probability: Random experiments, outcomes, sample spaces(set
representation). Events: occurrence of events, not, and and or events,
exhaustive events, mutually exclusive events. Probability of an event ,
probability of not, and and or events. Multiplication theorem on
probability. Conditional probability, independent events, total probability,
Bayes theorem. [8 Hrs]
6. Linear inequalities: linear inequalities. Algebraic solutions of linear
inequalities in one variable and their representation on the number line.
Graphical solution of linear inequalities in two variables. Solution of system of
linear inequalities in two variables-graphically. Inequalities involving modulus
function. [6 Hrs]

Reference Books:
1. Integral Calculus -Shanthi Narayan
2. Integral Calculus N.P .Bali
3. Analytical Geometry -Shanthi Narayan
4. Differential Calculus-N.P.Bali
5. Co-ordinate Geometry- Shanthi Narayan
6. Mathematics text books(NCERT) vol1 and vol 2-Arora
7. Mathematics text books(NCERT) vol1 and vol 2-S.S.Bosco
 BCA 2nd Semester Analog and Digital
Electronics
Subject 12BB22 Total Teaching Hours : 52
Code :
IA Marks : 20 Teaching Hours/Week : 04
Exam 80 Examination Hours : 03
Marks :
Credits: 4

1. Atomic Structure : Proton , Electron , Neutron , Atomic number , Atomic

weight , Valence electron , Free electron , Various bands ( Valence band &
Conduction bands ) . Semiconductor materials: Definition, types of
semiconductors (P type and N type). Junction Diode (Forwardbiasing & Reverse
biasing), Diode characteristics. 08 Hrs

2. Transistors: Definition, Naming the terminals, common collector, common

emitter and common base. construction and working of a transistor , Different
modes of operation, Relationship between Alpha , Beta and Gama , Transistor as
an Amplifier, Biasing of a Transistor-Voltage Divider method, Single and
Multistage Amplifier. 08 Hrs

3. Electronic Tubes: Construction and working of a vaccum diode , Use of a diode

as rectifier-Half wave and Full wave rectifier , Construction and Working of a
triode, Construction and Working of a tetrode.
08 Hrs.

4. Number system: Binary number system, Decimal number system, Octal

number system, Hexadecimal number system. Bases inter conversions.
Representation of negative numbers : signed & magnitude , 1s and 2s
complements for Binary numbers , 9sand 10s complements for decimal
numbers , Codes- BCD code, 8421code , GRAY code , EXCESS-3 code & ASCII
Code. 08.hrs

5. Boolean algebra and logic Gates: Laws of Boolean algebra, proof by

induction method, reduction of expression using Boolean laws. Evaluation of
Boolean expression, DeMorgans theorems and their proof, simplification of
Boolean expressions using Boolean laws. AND, OR, NOT, NOR, NAND, EX-OR
Gates: Definition, truth table, symbolic notation and its Boolean expression.
Design of logic Gates for a given Boolean expression. 12. Hrs

6. Simplification of Boolean functions: SOP and POS form, minterm and

maxterm, conversion of SOP to POS and POS tp SOP. Karnaugh Map (brief study),
Combination Logic&Sequential Logic(Adder, Encoder, Decoder, Multiplexer,
Demultiplexer, Filp-flops, Registers, Counters: Definition and meaning only).
8 HRS

Text Books:
1. Principles of Electronicsby V K Metha.
2. Digital Fundamental by Thomas L Floyd.
3. Basic Eletronics by G.K.Mithal
Reference Books:
1. Digital Logic and Computer Design- M. Morris Mono
2. Computer fundamentals - B. Ram
3. Digital fundamentals - Bartee
 BCA 2nd Semester Trouble shooting Lab
Subject 16BB23 Total Teaching Hours : 39
Code :
IA Marks : - Teaching Hours/Week : 03
Exam 50 Examination Hours : 03
Marks :
Credits: 4

1. Testing of Voltages Between Neutral, Phase, and Ground, to check the

proper earthing.
2. Identifying Harddisk partitions using any of the partitioning tools.
Identifying the Primary and Logical Partitions, and Set one partition as active.
3. Crimping RJ 45 Cable Straight cable and test the connectivity.
4. Crimping RJ 45 Cable Cross cable and test the connectivity.
5. Setting up of connection between two computers by assigning proper IP
Addresses, Test connection by Pinging.
6. Share a Folder from one system and Access it from another System in the
network.
7. Installation of Windows operating System (Any Version), identify the
Devices for which drivers are not installed by default.
8. Installation of Linux (Any Version) With multi OS Boot on a system with
windows.
9. Configure Squid Proxy server on Linux.
10. Configure telnet on linux and login to that system from any of the other
windows computers.
11. Install and Configure any free proxy servers on windows and test the
access of internet from a client.

Examination:

One Question has to be given from the above list (Carries 25 Marks).
One more question has to be given by the examiner by his choice and that
question need not be in the list (Carries 15 Marks).
Student has to answer and execute both questions.

Marks Distribution:

Criteria Marks
Question from The Examiners
List Question
Practic Writing 20 20
al Program
Proper Execution 15 15
Total 70
Viva 10
Report 20
Total 100
 BCA 2nd Semester Data Structures Using C
Subject 16BB24 Total Teaching Hours : 52
Code :
IA Marks : 20 Teaching Hours/Week : 04
Exam 80 Examination Hours : 03
Marks :
Credits: 4

1. Recursion: Introduction, what is recursion, factorial of a number, Fibonacci

series, GCD of two numbers, Tower of Hanoi, binary search, binomial coefficient,
efficiency of recursion, comparison between iterative and recursive functions,
properties of recursive functions. 04 Hrs
2. Structures, Pointers, and Unions: introduction, Arrays of structures, nesting
of structures. Introduction to special features of C, Register variable, bitwise
operator, bit fields, enumerations, command line arguments, macros,
preprocessors statement, Dynamic memory allocation.
10 Hrs.
3. Stacks and Queues: Introduction, definition of a stack with various operations,
stack implementation using arrays, applications of stack, conversions of
expressions: conversion from infix to postfix, Infix to prefix, evaluation of postfix
expression, stacks using structures. Queues: Introduction, different types of
queues, implementation of ordinary queue, circular queue. 12
Hrs
4. Linked Lists: Introduction, Definition and linked representation, stack and
Queues using Linked list, other list structure: circular and doubly list (concepts
only). 10 Hrs
5. Trees: Introduction, Definitions, Storage representation of a binary tree, tree
traversals, Binary search tree.
06 Hrs
6. Searching and Sorting: Introduction, Linear Search, Binary search, indexed
sequential search, and Interpolation search. Sorting: Introduction, Bubble sort,
Merge sort, quick sort, Selection sort, Insertion sorts.
10 Hrs.
Text Books:

1. Systematic approach to Data structures using C A.M. Padma Reddy, Revised

edition 2007
2. Programming in ANSI C - E. Balagursamy

Reference Books:
1. Datastructures and applications - Trembly and Sorenson
2. Data Structures using C, Aaron M. Fenenbaum, Yedidyah Langsam and Moshe J.
Augestein, Pearson education/PHI, 2006

BCA 2nd Semester Data Structures Using C

Lab
Subject 16BB25 Total Teaching Hours : 39
Code :
IA Marks : - Teaching 03
Hours/Week :
Exam 50 Examination Hours : 03
Marks :
Credits: 4

1. Program to Read and Display Employees Information using array of Structure.

2. Program to implement a structure within a structure.
3. To find sum of elements of the given array using recursion.
4. Program to solve the problem of Tower of Hanoi.
5. WAP to implement stack operations using structure.
6. WAP to implement queue operation using structure.
7. WAP to convert valid infix expression to valid postfix expression.
8. WAP to convert valid infix expression to valid prefix expression.
9. WAP to evaluate a postfix expression.
10. WAP to implement a linked list to insert an element at begin and end of the
list, delete an element at begin and end of the list and display the list.
11. WAP to implement a stack operations (push, pop, display) using linked list.
12. WAP to implement a queue operations (Qinsert, Qdelete, Qdisplay) using
linked list.
13. WAP to search an element in a given list of integers using binary search using
recursion.
14. WAP to search an element in an array using Interpolation search.
15. WAP to sort elements in an array using Bubble sort.
16. WAP to sort elements in an array using Selection sort.
17. WAP to sort elements in an array using Quick sort.
18. WAP to sort elements in an array using Merge sort.
19. WAP to sort elements in an array using Radix sort.
Examination:

One Question has to be given from the above list (Carries 25 Marks).
One more question has to be given by the examiner by his choice and that
question need not be in the list (Carries 15 Marks).
Student has to answer and execute both questions.

Marks Distribution:

Criteria Marks
Question from The Examiners
List Question
Practic Writing 20 20
al Program
Proper Execution 15 15
Total 70
Viva 10
Report 20
Total 100