,,=:\

gq VTKRAMA SIMHAPURI UNIVERSITY:

NELLORE
:

B.Sc., Honors in ComPuter Science

MAJOR
w.e.f AY 2023 -24 onwards

COURSESTRUCTURE
Year Semester Cours Titlc Hrs./ Credits
e Week
EssentialsandapplicationsofMathematica l, 5 4
I
Ph sicalandChemicalSciences
I 5 4
AdvancesinMathematical,Physicalan d
2
ChemicalSciences
I 3
ProblemSolvingusingC-(T) 3
3
II ProblemSolvingusingC-(P) 2 I

DigitalLogicDesign-(T) J 3
4 2 I
Di gitalLogicDesign-(P)
o bj ec t Ori eil ted P ro gram m n gu S ln gJ a a -(r) J 3
5 2
o bj ect o n e nted Pro mm lngu S ll gJ a a P) I

Datastructuresusing C -(T) J J
III 6
DataStructuresusingC -(P) 2 I

ComputerOrganization-(T) 3 )
7 ,)
ComputerOrganization-(P) I

OperatingSystems -(T) J 3
8
ll OperatingSystems -(P) 2 I

DatabaseManagementSYstem-(T) 3 3
9
DatabaseManagementSYstem-(P) 2 I

o bj ecto r I e t1 ted So ftware E ll gl t') en i'l ( r) J J

t0
o bj e ct o r I en t d S o ftw are En I t.l ee n I'I -( P ) 2 I
IV
DataCommunicationsandComputerNetwor ks 3 3

ll
DataCommunicationsandComputerN etworks 2 I

WeblnterfaceDesi gningTechnologies-(T ) J ,
t2 2 I
WeblnterfaceDesigningTechnolog ies-(P)
WebAppl icationsDevelopmentusin gP HP& 3 3

l3 MYS L-

(sv
\)&r,,,r4!-_
 WebApplicationsDevelopmentusingPHP& 2 I
III
MYSQL-(P)
Intemetoffhings (T) 3 J
t4A
InternetofThings (P) 2

II
I

OR
14B FoundationsofDataScience -(T) ) 3

C--^
 FoundationsofDataScience -(P) 2 I

loT Applications DeveloPment and 3 3

l5A Pro mln

loT Applications Development and 2 I

Pro ln
OR
pp I I cati onde ve I op men tus I n Pyth o lt -(r ) 3 3
15B 2 I
App licationdevelopmentusingPlthon-(P)
VI Intemship/ApprenticeshiP

l6A
AdvancedDataStructures -(T)
AdvancedDatastructures -(P)
3
2
IL
OR
Artifi ciallntel ligence-(T) J J
t6B 2
Artifi ciallntelligence -(P) I

Computercraphics-(T) ) 3
t7A 2 I
ComputerGraphics-(P)
VII OR
DesignandAnalysisofAl gorithms -(T) J 3
17B
Desi gnandAnalysisofAlgorithms -(P) 2 I

Princip lesofMachineLearn ing-(T) J 3

l8A 2 I
Princip lesofMachineLearning-(P)
OR
SoftwareTesting-(T) J 3
l8 B 2 I
SoftwareTesting-(P)
AdvancedJavaProgramming -(T) J 3

IV
l9A 2 I
AdvancedJavaProgramming-(P)
OR
MobileApplicationDevelopment-(T) 3 3
l9B 2 I
SEC
MobileApplication Development-(P )
MEANStackDeveloPment-(T) 3 J
20A 2 I
MEANStackDeveloPment-(P)
OR
RProgramming-(T) 3 3
20B 2 I
RProgramming-(P)
Bi gDataTechnologies-(T) 3 3
2tA 2 I
B i gDataTechnologies-(P)
OR
CompilerDesign-(T) 3
2tB 2 I
CompilerDesign-(P)
-rl
Uotrl^d&- q'^/
 DataM iningConcepts&Techn iques-(T) 3 3
VIII 22A
DataMiningConcepts&Techniques-(P) 2 I

OR
Digital ImageProcessing -(T)
II J J
228
DigitallmageProcessing -(P) 2 I

a^---
 InformationSecurityandCryptography -(T) 3 J
23A
InformationSecurityandCryptography -(P) 2 I

OR
MobileADHOCandSensorNetworks -(T) J J
23B
MobileADHOCandSensorNetworks -(P) 2 I

AdvancedDBMS-(T) 3 3
244. 2 I
AdvancedDBMS-(P)
OR
CloudComputing-(T) 3 )
248 2 I
SEC
CloudComputing-(P)
ComputerVision-(T) J 3
25A 2 I
ComputerVision-(P)
OR
DigitalForensics-(T) J J
258 2 I
DigitalForensics-(P)

l^j^./
 II
Semester
Course3:Problem Solving using C
Credits-3

Course Objectives:

l. Toexplorebasicknowledgeoncomputers
2. Leamhowtosolvecommontypesofcomputingproblems.
3. Leamtomapproblems toprogrammingfeaturesofC.
4. LeamtowritegoodportableCprograms.
Courseoutcomes
Uponsuccessfulcompletion ofthecourse,astudentwill beableto:
I .UnderstandtheworkingofadigitalcomputerandFundamentalconstructsolProgramming
2. Analyzeanddevelop asolution toagivenproblem withsuitablecontrolstructures
3. Applythederived datatypes inprogramsolutions
4. Usethe'C'languageconstructs in theright way
5. ApplytheDynamicMemoryManagementforeffectivememoryutilization
UNIT.I
Introduction to computer and programming: Introduction, Basic block diagram and
functions ofuarious components of computer, Concepts of Hardware and software, Types
of software, Compilerand interpreter, Concepts of Machine level, Assembly level and
high-tevelprogramming, FlowchartsandAlgorithms
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,
ofC program,lnput/outputstatements in C-Formatted andUnformattedl/O
Structure
UNIT.II
Control statements: Decision making statements: if, if else, else if ladder, switch
statements. Loopcontrol statements: while loop, for loop and do-while loop. Jump Control
statements: break,continueand goto.
UNIT.III
Derived data types in C: Arrays: One Dimensional arays - Declaration, lnitialization
and Memoryrepresentation; TwoDimensionalarrays-
Declaration,lnitializationandMemoryrepresentation.
Strings:Declaring&lnitializingstringvariables;Stringhandlingfunctions,Characterhandlingf
unctions
UNIT-IV
Functions:FunctionPrototype,definitionandcalling.Returnstatement'Nestingoffunctions.Ca
tegories of functions. Recursion, Parameter Passing by address & by value. Local and
Gtobalvariables.Storageclasses: automatic, extemal, staticandregister.
Pointers: Pointerdatatype,Pointerdeclaration,initialization,accessingvaluesusingpointers'Po

Uk,il"IL-- Q-,
 interarithmetic. Pointers and arrays,pointersand functions.
UNIT.V
DynamicMemoryManagement: Introduction,Functions-
malloc,calloc,real Ioc,freeStructu res:
Basicsofstructure,structuremembers,accessingstructuremembers,nestedstructures,arrayof

structures,structure andfunctions,structuresandpointers.Unions-Union definition;

differencebetweenStructures andUnions.
TextBooks:
l.E.Balagurusamy,"ProgramminginANSIC",TataMcGrawHill,66Edn,lSBN- l3:978-
t-25-90046-2
2. HerbertSchildt,-CompleteReferencewithC,TataMcGrawHill,4thEdn.,ISBN-
I 3:97800704 I I 838, 2000
3. Computer fundamentals and programming in C, REEMA THAREJA,
4. OXFORDI.JNIVERSITYPRESS
ReferenceBooks
l. EBaIaguTusamy,COMPUTINGFUNDAMENTALS&CPROGRAMMING -
TataMcGraw-Hill,Second Reprint 2008,1SBN978-0-07-066909-3.
2. AshokNKamthane,Programmingwith ANSIandTurboC, PearsonEdition Pub1,2002.
3. Henry Mullish&Huubert L.Cooper: The Spirit of
C An Introduction
to modernProgramming, Jaico Pub. House,l996.
4. Ykanithkar,letusCBPB, t 3th edition-20l3,ISBN:978-81 8333 I 630,656pages.

SUGGESTEDCO-C URRICULARACTIVITIES&EVALUATIONMETHODS:
Unitl :Activity:Quizoncomputerhardwareandsoft wareconcepts
EvaluationMethod:Objective-basedquizassessingknowledgeandunderstanding
Unit2:Activity: Problem-solvingusingDecision-
MakingStatements
EvaluationMethod:Correctnessofdecision-makinglogic
Unit3:Activity:ArrayandString ProgramDebugging
EvaluationMethod: Identifi cationandconectionoferrorsincode
Unit4:Activity: PairProgrammingExerciseonFunct
ions
EvaluationMethod:Col laborationandCodeQuality
Unit5:Activity: StructuredProgramming
Assignment
EvaluationMethod: Appropriateuseofstructuresandnestedstructures

t/
 IISemester
Course3:ProblemSolvingusingC
Credits- I
ListolExperi
ments

l. A.Writeaprogramto calculate simple& compoundinterest

B. WriteaCprogram tointerchan getwonumbers.
2. FindthebiggestofthreenumbersusingC.
3. Writeacprogramtofind thesum ofindividualdigitsof apositiveinteger.
4. AFibonaccisequenceisdefinedasfollows:thefirstandsecondtermsinthesequencea
re0and l. Subsequentterms arefoundbyaddingtheprecedingtwoterms
inthesequence.
5. WriteacprogramtocheckwhetheranumberisArmstrongornot.
6. Writeacprogramtogeneratealltheprimenumbersbetween I andn,wherenisavalues
upplied bytheuser.
7. Writeacprogramthat implements searching of givenitemingiven Iist
8. Writeacprogramthatusesfunctionstoperformthefollowing:Additionoftwomatric
es.Multiplicationof two matrices.
9. Writeaprogramfor concatenationoftwo strings.
10. Writeaprogramforlength ofastringwithand without StringHandling functions
I L Writeaprogram todemonstrateCallbyValueandCall byReferencemechanism
I 2. WriteaProgramtofi ndGCDofTwo numbersusingRecursion

I 3. Writeacprogram toperformvariousoperations usingpointers.

14. Writeacprogramtoreaddataofl 0employeeswithastructureofl.employeeid2.aada

mo,3.title, 4 joineddate,5.salary, 6.date ofbirth, 7.gender, S.department.
I 5. WriteaProgramtodemonstratedynamicarraysusingDynamicMemoryManageme

ntfunctions

Ur.^l v
 IlSemester
Cou rse4:DigitalLogicDesign
Credits-3

CourseObjectives
Tofamiliarizewiththeconcepts ofdesigningdigitalcircuits.
CourseOutcomes
Uponsuccessfulcompletion ofthecourse,the students will beableto

L UnderstandhowtoConvertnumbersfromoneradixtoanotherradixandperformarithmet
icoperations.
2. SimplifyBooleanfunctionsusingBooleanalgebra andk-maps
3. Designaddersandsubtractorscircuits
4. Design combinational logic circuits such as decoders, encoders,
multiplexers anddemultiplexers.
5. Usefl ipflopstodesignregistersandcounters.

UNIT_I

Number Systems: Binary, octal, decimal, hexadecimal number systems, conversion of

numbers fromone radix to another radix, r's, (r-l)'s complements, signed binary numbers,
addition and subtractionofunsigned and signed numbers, weighted and unweightedcodes.
UNIT-II
Logic Gates and Boolean Algebra: NOT, AND, OR, universal gates, X-OR and X-NOR
gates,Boolean laws and theorems, complement and dual ofa logic lunction, canonical and
standard forms,two level realization of logic functions using universal gates,
minimizations of logic functions (POSandSOP) using Booleantheorems, K-map(upto four
variables).don't carecond itions.
UNIT- III
Combinational Logic Circuits - l:Design of half adder, full adder, half subtractor,
fullsubtractor,rippleaddersand subtractors,rippleadder / subtractor.
UNIT-IV
Combinational Logic Circuits - 2: Design of decoders, encoders, priority encoder,
multiplexers,demultiplexers,higherorderdecoders,demultiplexersandmultiplexers,realizati
onofElooleanfunctionsusing decoders,multiplexers.
UNIT-V
Sequential Logic Circuits: Classification of sequential circuits, latch and flip-flop, RS-
latch usingNANDandNORGates,truthtables,RS,JK,TandDflip-
flops,truthandexcitationtables,conversionofflip-flops, flip-flopswith asynchronous inputs

\N-r*l'L w
(presetandclear).
Design of registers, shift registers, bidirectional shift registers, universal shift register,
designofripplecounters, synchronous counters and variablemoduluscounters.

TextBooks:

l.M.MorrisMano,MichaelDCi tetti, .,DigitalDesi gn", 5thedition,pEA.

ReferenceBooks
I . Kohavi,Jha,"SwitchingandFiniteAutomataTheory',,3rdedition,Cambridge.

2. 2.Leach,Malvino,Saha, ',DigitalprinciplesandApplications,',Tthedition,TMH.
3. 3.Roth,"FundamentalsofLogicDesign',,5thedition,Cengage.

SUGGESTEDCO-CURRICULARACTIVITIES&EVALUATIONMETHODS:
Unitl :Activity:JAM(Justa Minute)Session : Explaining RadixConversion
EvaluationMethod:CommunicationSki lls andKnowledgepresentation
Unit2 :Activity: Boolean Al gebraAssi gnment
EvaluationMethod:AssignmentCompletionandCorrectness
Unit3:Activity: Hands-onLabActivity:BuildingAdderandSubtractorCircuits

EvaluationMethod:LabPerformanceandcorrectnessofcircuit Implementation

Unit4:Activity:Group Discussion:ApplicationsofDecoders,Encoders, Multiplexers

EvaluationMethod:ParticipationandCriticalThinking
Unit5:Activity:QuizonFlip-FlopsandRegister-CounterDesign

EvaluationMethod:QuizPerformanceandKnowledgeRetention

q-,,
 II Semester
Course4:DigitalLogicDesign
Credits-l
ListofExperiments

Thelaboratoryworkcanbedonebyusingphysical gates andnecessaryequipment orsimulators.

Simulators: httos://sourcefo l 1.lc .net/oroiects/satesim/or htt :/ ircuitverse. or any free

open-sourcesimulator
l. Introduction to digital electronics lab- nomenclature of digital ICs,
specifications, study ofthe data sheet, concept of Vcc and ground, verification
ofthe truth tables of logic gatesusingTTLICs.
2. ImplementationofthegivenBooleanfunctionsusinglogicgatesinbothSOPandPOs
forms
3. Realizationofbasicgatesusinguniversal gates.
4. Designandimplementation ofhalfandfulladder circuitsusinglogicgates.
5. Designandimplementationofhalfandfullsubtractorcircuitsusinglogicgates.
6. Verifi cationofstabletablesofRS,JK,TandDfl ip-fl opsusingNANDgates.
7. Verifi cationofstabletablesofRS,JK,Tand Dfl ip-fl opsusingNORgates.
8. Implementationandverifi cationofDecoderandencoderusinglogicgates.
9. ImplementationoPlXlMUXandDeMUXusinglogicgates.
I0. Implementationof8Xl MUXusingsuitablelowerorderMUX.
I l. ImplementationofT-segmentdecodercircuit.
I 2. Implementationofll-bitparalleladder.

I 3. Designandveri fi cationo?l-bitsynchronouscounter.

I 4. Designandveri fi cationof4-bitasynchronouscounter.

C-/
 II
Semester
Course5: ObjectOrientedProgrammingusingJava
Credits-3

CourseObjectives
Tointroducethefu ndamentalconceptsofObject-

Orientedprogrammingandtodesign&implementobject-orientedprogramming concepts in
Java.

CourseOutcomes

Uponsuccessfulcompletion ofthecourse,astudentwill beableto:

l. UnderstandthebasicconceptsofObject-

OrientedProgrammin gandJavaPro gramConstructs

2. Implement classesandobjectsandanalyzelnheritanceandDynamicMethodDispatch
3. Demonstratevariousclassesindifferentpackagesandcandesignownpackages
4. ManageExceptions andApplyThreads
5. CreateGUlscreens alongwitheventhandling
UNIT.I
ooPs concepts and Java Programming: Introduction to object-oriented concepts,
proceduralandobject-orientedprogramming paradigm
Javaprogramming:AnoverviewofJava,JavaEnvironment,Datatypes,Variables,constants,s
cope and life time of variables, operators, type conversion and casting, Accepting Input
from theKeyboard, Reading Input with Java.util.Scanner Class, Displaying Output with
system.out.printfo,DisplayingFormatted outputwith String.formatO,control statements
UNIT.II
Arrays,CommandLineArguments, Strings-StringClassMethods
Classes & Objects: Creating Classes, declaring objects, Methods, parameter passing,
static fieldsandmethods,constructors, and 'this'ke,.\,r/ord, overloadingmethods andaccess
Inheritance: Inheritance hierarchies, super and subclasses, member access rules, ,super,
keyrvord,preventing inheritance: final classes and methods, the object class and its
methods; Polymorphism:Dynamicbinding, method overriding,
abstractclassesandmethods I

UNIT-III
Interface: Interfaces VS Abstract classes, defining an interface, implement interfaces,
accessingimplementations throughinterface references, extending interface;
Packages:Defining,creatingandaccessingapackage.understandingcLASSpATH,importing

w
 packages.
Exception Handling: Benefits of exception handling, the classification of exceptions,
exceptionhierarchy, checked exceptions and unchecked exceptions, usage of try, catch,
throw, throws andfinally, rethrowing exceptions, exception specification, built in
exceptions, creating own exceptionsubclasses.
UNIT-IV
Multithreading: Differences between multiple processes and multiple threads, ttread states,
tfueadlife cycle, creating threads, interrupting threads, thread priorities, synchronizing threads, inter
threadcommunication.
stream based uo
(ava.io) - The Stream classes-Byte streams and character streams,
Readingconsole Input and writing console output, File class, Reading and writing Files,
The Console class,Serialization
UNIT-V
GUIProgram mingwith Swing-
Introduction,MVCarchitecture,components,containers.Understanding Layout Managers -
Flow Layout, Border Layout, Grid Layout, Card Layout, CridBaglayout.
EventHandling-TheDelegationeventmodel-
Events,Eventsources,EventListeners,Eventclasses, Handling mouse and keyboard events,
Adapter classes, Inner classes, Anonymous Innerclasses.
TextBooks:
l. JavaThecompletereference,gthedition,HerbertSchildt,McGrawHill.
2. Understanding Object-Oriented Programming with Java, updated

edition, T.Budd,PearsonEducation.

ReferenceBooks
CayS.Horstmann,"CoreJavaFundamentals",Volume l, I I thEdition,PrenticeHall,20
18.

2. PaulDeitel,HarveyDeitel,"JavaSE8forprogrammers",3rdEdition,Pearson,20'15'
3. S.Malhotra,S.Chudhary,ProgramminginJava,2ndedition,OxfordUniv'Press'
SUGGESTEDCO.CURRICULARACTIVITIES &EVALUATIONMETHODS:

Unitl:Activity:QuizonObject-OrientedProgrammingConcepts andJavaConstructs

EvaluationMethod : Qu izPerformanceandKnowledgeRetention

Unit2:Activity:Object-OrientedProgrammingAssignment: Classlmplementation
EvaluationMethod:AssignmentCompletionandCorrectness

Unit3:Activity: Hands-onLabActivity: CreatingandUsingCustomJavaPackages

EvaluationMethod: LabPerformanceandCorrectnessofCodelmplementation

Unit4:Activity:CaseStudy Discussiononwheremulti-threadingiscrucial

ttt4e*g- C.,
 EvaluationMethod: Criticalthinking,problem-solving,andpresentationskills.

Unit5:Activity: CUldesign contest usingJavaSwings

EvaluationMethod: GUldesign,Visualappearanceanduserfriendliness,usability,an
dadherencetoevent handling principles.