SubjectTeaching& ExaminationScheme

Engg& Tech- BTech- CSE - BDA- 2023 - 24

Semester - 3
Internal Marks External Marks PassingMarks PassingMarks Total
(Theory+ CE) (Practical) Marks

Code Subject Credit Lect Lab Tut T P CE T P Int. + Ext. Int. + Ext.

303105201 Designof Data Structures 3 3 0 0 20 - 20 60 - 40 - 100

303105202 Designof Data StructuresLaboratory 2 0 4 0 - 20 - - 30 - 25 50

303105203 DatabaseManagement System 3 3 0 0 20 - 20 60 - 40 - 100

303105204 Database Management System Laboratory 1 0 2 0 - 20 - - 30 - 25 50

303105205 ObjectOrientedProgrammingwith JAVA 2 2 0 0 20 - 20 60 - 40 - 100

303105206 ObjectOrientedProgrammingwith JAVA Laboratory 1 0 2 0 - 20 - - 30 - 25 50

303105220 Digital Electronics 3 3 0 0 20 - 20 60 - 40 - 100

303105221 Digital ElectronicsLaboratory 1 0 2 0 - 20 - - 30 - 25 50

303191202 Discrete Mathematics 4 4 - - 20 - 20 60 - 40 - 100

303193203 Professional Communication Skills 2 - - 2 - - 100 - - 40 - 100

Total 22 15 10 2 800

Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical
Theory Passing %: 40 Practical Passing %: 50

27 |P a g e
 SubjectSyllabus
303105201 - DesignofDataStructures

Course:BTech Semester: 3
Prerequisite:ComputerProgrammingand Basic Syntaxes
Course Objective: Data structureis a subject of primary importance in Information and Communication Technology. Organizing or
structuring data is important for implementation of efficient algorithms and program development. Efficient problem solving needs
the application of appropriate data structureduring programdevelopment.

Teachingand ExaminationScheme
TeachingScheme Examination Scheme
Lecture Tutorial Lab InternalMarks ExternalMarks Total
Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
3 0 0 0 3 20 20 - 60 - 100
SEE - Semester End Examination, T - Theory, P- Practical

CourseContent W - Weightage(%),T - Teachinghours

Sr. Topics W T
1 Introduction: 10 6
Data Structures,Classifications(Primitive& Non-Primitive),Data structureOperations, Review of Arrays, Structures,
Self-Referential Structures, and Unions. Pointers and Dynamic Memory Allocation Functions. Representationof
Linear Arraysin Memory, dynamicallyallocated arrays. Performanceanalysis of an algorithm and space and time
complexities
2 Stacks,Recursionand Queue: 15 8
Stacks:Definition,Stack Operations,ArrayRepresentationof Stacks,Stacks using DynamicArrays, Stack
Applications:Polish notation, Infix to postfix conversion,evaluationof postfix expression.
Recursion-Factorial,GCD,Fibonacci Sequence,Tower of Hanoi,
Queues:Definition,ArrayRepresentation,Queue Operations, CircularQueues,Circular queues using Dynamic
arrays, Deque, Priority Queues and its problems
3 Linked Lists: 10 5
Definition, Representation of linked lists in Memory, Memory allocation; Garbage Collection. Linked list operations:
Traversing, Searching, Insertion, and Deletion. Doubly Linked lists, Circular linked lists, and header linked lists. Linked
Stacks and Queues. Applications of Linked lists
4 SearchingandSorting: 10 5
Interpolation Search
Sorts:SelectionSortInsertionSortBubble Sort QuickSort MergeSort, RadixSort
5 Trees: 10 4
Terminology,BinaryTrees, Propertiesof Binarytrees, Array and linkedRepresentationof Binary Trees,
Binary Tree Traversals-In Order,PostOrder,PreOrder; AdditionalBinarytree operations.Threadedbinarytrees,
Binary Search Trees – Definition,Insertion, Deletion, Traversal, Searching, Application of Trees-Evaluationof
Expression
6 Red BlackTreesand AVLTrees:Introduction-OperationsonRed BlackTrees AVL tree ConstructionOperationson 15 8
AVL Trees
7 Hashing:HashTableorganizations,HashingFunctions,Static and DynamicHashing 15 3
8 Graphs: 15 5
Definitions,Terminologies,Matrix and Adjacency List Representationof Graphs,ElementaryGraph operations,
Traversalmethods: BreadthFirst Search and Depth First Search.

28 |P a g e
 SubjectSyllabus
303105201 - DesignofDataStructures

Reference Books
1. FundamentalsofDataStructuresin C, 2ND eDITION, E.Horowitz,S,.SahniandSusanAnderson-Freed,UniversitiesPress
(TextBook)

2. SeymourLipschutz,DataStructuresSchaum'sOutlines,Revised1st Ed,McGrawHill, 2014.

CourseOutcomes
At the endof thiscourseStudentsWillbe ableto:
1 Understandthe conceptof Dynamicmemorymanagement,data types, algorithms,BigO notation
2 Understandbasicdatastructuressuch as arrays,linkedlists,stacksand queues
3 Describethehash functionandconceptsof collisionanditsresolutionmethods
4 Solve probleminvolvinggraphs,treesand heaps
5 ApplyAlgorithmfor solvingproblemslikesorting,searching,insertionand deletionof data

CourseOutcome
AfterLearningtheCoursethestudentsshall be able to:
AfterLearningthecoursethe students shallbeableto:
1. Use differenttypesof datastructures,operationsand algorithms
2. Applysearchingand sortingoperationson files
3. Use stack, Queue,Lists,Treesand Graphsinproblemsolving
4. Implementalldatastructuresina high-levellanguagefor problemsolving.

Miscellaneous
Exam Requirement
It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ)etc

29 |P a g e
 SubjectSyllabus
303105202 -DesignofDataStructuresLaboratory

Course:BTech Semester: 3
Prerequisite:Basicknowledgeof Data Structures
CourseObjective: Thiscourseprovidesa broadintroductiontoData StructuresThe variousData structuresandits analysisof
working design and development.

Teachingand ExaminationScheme
TeachingScheme Examination Scheme
Lecture Tutorial Lab InternalMarks ExternalMarks Total
Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
0 0 4 0 2 - - 20 - 30 50
SEE - Semester End Examination, T - Theory, P- Practical

CourseOutcome
AfterLearningtheCoursethestudentsshall be able to:
AfterLearningthecoursethe students shallbeableto:
1. Use differenttypesof data structures,operationsand algorithms
2. Applysearchingand sortingoperationson files
3. Use stack, Queue,Lists,Treesand Graphsinproblemsolving
4. Implementalldatastructuresina high-levellanguagefor problemsolving

ListofPractical
1. ImplementStackand its operationslike (creationpushpoptraversepeeksearch)usinglineardatastructure
2. ImplementInfix to PostfixExpressionConversionusingStack
3. Implement PostfixevaluationusingStack.
4. Implement Towersof Hanoiusing Stack.
5. Implementqueueandits operationslike enqueue,dequeue,traverse,search.
6. ImplementSingleLinkedlists andits operations(creationinsertiondeletiontraversalsearchreverse)
7. Implement DoubleLinkedlists and its operations(creationinsertiondeletiontraversalsearchreverse)
8. Implementbinarysearchand interpolationsearch.
9. Implement Bubblesort,selectionsort, Insertionsort,quick sort,mergesort.
10. ImplementBinarysearchTreeand its operations(creation,insertion,deletion).
11. Implement Traversals PreorderInorderPostorderon BST.
Implement Graphsandrepresentusingadjacenylist and adjacencymatrixand implementbasicoperationswithtraversals
12.
(BFS and DFS).

30 |P a g e
 SubjectSyllabus
303105203 - DatabaseManagementSystem

Course:BTech Semester: 3
Prerequisite:Basic ComputerKnowledge
CourseObjective:The coursewillenablestudentsto understand the differentissuesinvolvedin the designand implementationof
a database system as well executevarious database queries using SQL.

Teachingand ExaminationScheme
TeachingScheme Examination Scheme
Lecture Tutorial Lab InternalMarks ExternalMarks Total
Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
3 0 0 0 3 20 20 - 60 - 100
SEE - Semester End Examination, T - Theory, P- Practical

CourseContent W - Weightage(%),T - Teachinghours

Sr. Topics W T
1 Introduction: 10 3
Introductionandapplicationsof DBMS, FileProcessing System and its limitations,ANSI/SPARCModel,Data
Independence,Client-Server Architecture, Users & DBA, Database Architecture.
2 SQL: 10 4
Data DefinitionLanguage(DDL) commands,Data ManipulationLanguage(DML)commands,Data Control Language
(DCL) commands, Transaction Control Language (TCL) commands.
Predicates& Clauses:LogicalOperators(AND / OR), RelationalOperators,BETWEENPredicate,IN & NOT IN
Predicate, LIKE Predicate.
FunctionsinSQL:AggregateFunctions, Character Functions,ArithmeticFunctions,Date Functions,
Conversion Functions.
3 DataModels: 10 5
HierarchicalModel, Network Model,RelationalModel, ObjectOrientedModel.
E-R Diagram: Introductionto E-RDiagram,Entities,Attributes& its types, Relationships,Mapping Cardinalities,
Participation Constraints, Weak Entity Sets, Specialization, Generalization, Aggregation.
4 RelationalData Model: 10 4
RelationalDataModel: Introduction,Degree,Cardinality.
Constraints & Keys: Primary Key, Foreign Key, Super Key, Candidate Key, Not Null Constraint, Check Constraint.
Relational Algebra Operations: Selection, Projection, Cross-Product, Rename, Joins (Natural & Outer Join), Set
Operators(Union, Intersection, Set Difference), Aggregate Functions.
5 RelationalDatabase Design: 20 6
Functional Dependency– definition,trivialandnon-trivialFD, Armstrong'sAxioms/InferenceRules, Closure of FD,
Closure of Attributes,Candidate Key, Finding a Candidate Key, Decomposition(Lossy& Lossless), Database
Anomalies,Normalization– 1Nf, 2NF, 3NF, BCNF, 4NF, 5NF
6 Transaction: 20 12
Transaction:Introduction,ACID Properties,Transaction Life Cycle, Scheduling,Serial Schedule,Interleaved
Schedule, Transaction Operations, Serializability(View& Conflict), Two-Phase Commit Protocol.
DatabaseRecovery:Introduction,Log Based Recovery,Shadow Paging,Checkpoints.
ConcurrencyControl:Introduction,Lock Based Protocol, Two Phase Lock Protocol,IntentionLocking, Multiple
Granularity, Time-based Protocol.
Deadlock: Introduction,Deadlock Detection,Deadlock Recovery,Deadlock Prevention(Wait-Die, Wound-Wait&
Timeout-Based Approach).
7 QueryProcessing: 10 3
QueryProcessing:Introduction,Layersof QueryProcessing,Measuresof Query Cost, File Scans(Linear& Binary
Search), Materialized View, Pipelining.
Query Optimization:Introduction,EquivalenceRules, Cost-BasedQuery Optimization.
8 Security: 5 2

31 |P a g e
 SubjectSyllabus
303105203 - DatabaseManagementSystem

Security:Data Security,Data Integrity,Authentication,Authorization,Encryption,Decryption, Access Control (DAC,

RBAC,MAC),IntrusionDetection, SQL Injection
9 PL/SQLConcepts:Views,PL/SQLBlock, Cursors,Triggers,StoredProcedures,Store Functions 5 3

Reference Books
1. DatabaseSystemConcepts(TextBook)
By AbrahamSilberschatz,HenryKorth,S. Sudarshan| McGrawHillInternational|6thEdition
2. An IntroductiontoDatabaseSystems
By C. J. Date, A. Kannan,S.Swamynathan|PearsonEducation|8thEdition
3. SQL, PL/SQL– TheProgrammingLanguage
By IvanBayross| BPBPublications

CourseOutcome
AfterLearningtheCoursethestudentsshall be able to:
AfterLearningthe Coursethe students shallbe able to:
1. Understandbasicconceptsof Database.
2. UnderstandRelationalModelsandits importance.
3. Buildproperstructureddatabasefora givenproblemor application.
4. Learnhow varioustransactionsaremanagedin real-timescenarios.
5. Understandtheevaluationparametersof a queryaswell as securityparametersofdatabase.
6. ImplementSQL conceptsto builddynamicdatabase applications.

Miscellaneous
Exam Requirement
It consistsof Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ)etc.

32 |P a g e
 SubjectSyllabus
303105204 - DatabaseManagementSystemLaboratory

Course:BTech Semester: 3
Prerequisite:Basic ComputerKnowledge
CourseObjective:The coursewillenablestudentsto understand the differentissuesinvolvedin the designandimplementationof
a database system as well executevarious database queries using SQL.

Teachingand ExaminationScheme
TeachingScheme Examination Scheme
Lecture Tutorial Lab InternalMarks ExternalMarks Total
Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
0 0 2 0 1 - - 20 - 30 50
SEE - Semester End Examination, T - Theory, P- Practical

CourseOutcome
AfterLearningtheCoursethestudentsshall be able to:
AfterLearningthe Coursethe students shallbe able to:
1. Understandbasicconceptsof Database.
2. UnderstandRelationalModelsand its importance.
3. Buildproperstructureddatabasefora givenproblemor application.
4. Learnhow varioustransactionsaremanagedin real-timescenarios.
5. Understandtheevaluationparametersof a queryas wellas securityparametersofdatabase.
6. ImplementSQL conceptsto builddynamicdatabaseapplications.

Listof Practical
1.
1. WhatisDBMS?Explainadvantagesof DBMSover FPS.
2. List15 applicationsofDatabase.Explainany2 howDatabasecanbe helpfulinmanagingthatapplication?
3. Createthe Databasefor the following:

1. StudentDetailsusing Excel.
2. EmployeesDetailsusing MS Access
3. Facebookusing Excel

2.
Createfollowing Tables:

Important Instructions:

• Use varchar2(30) datatypefor AlphanumericCharactersand SpecialSymbols,numberdatatypefor Numbers,

date datatype for Date.

·Use same table and columnname (Capital and

33 |P a g e
 SubjectSyllabus
303105204 - DatabaseManagementSystemLaboratory

Small Case) as mentioned in thisfile.

• Insertproperdata(CapitalandSmall Case)asmentionedinthis file.
• Employee
• Emp_nameStreetCity Adam Spring PittsfieldBrooksSenatorBrooklynCurryNorthRye DemaloSunShineSan Deago

3. SimpleQueries:
1. Describedeposit, branch.
2. Describeborrow,customers.
3. Listalldata fromtable DEPOSIT.
4. Listalldata fromtableBORROW.
5. Listalldata fromtable CUSTOMERS.
6. Listalldata fromtable BRANCH.
7. Giveaccountnoand amountof depositors.
8. Listall data fromSAILORS.
9. ListBoatName anditscolor.
10. List Employeenameandits city.
11. List allthedetailsof Clients.
12. Describevariousproductsandits price.
13. Describesailor’sname,age and itsrating.
14. Describethemanagersof variousemployees
15. DescribethedetailsofLoanfor customers.
16. Describethedateof travelof varioussailors.
4. SimpleQueries:
(1) Givenameof depositorshavingamountgreaterthan 4000.
(2) Listthe employeeshavingsalarylessthan 22000.
(3) List the sailorshavingagemorethan 25.
(4) Listtheboatstravellingon 10-oct-98
(5) Listthe detailsof boat“Interlake”.
(6) Listthe detailsof thered coloredboat.
(7) List the detailsofclientswhosecityisMumbai
(8) List ClientName,due balanceandcityof the clientshavingbalancegreaterthan 1500.
(9) Describethe detailsof productshavingsellingpriceless than500.
(10) Listthe productsforwhichquantityorderedislessthan 120 and costpriceisgreaterthan 250.
(11) Displayaccount detailshavingamount greater 2200.
(12) Displayallthe customersstayingin Nagpur
(13) Displaythenamesof sailorshavingratinggreaterthan 7
(14) Displaythe ordersmadein the monthof June
(15) Listall the accountscreatedinthemonthof March

5. “Like”Queries:
1. Displayallcustomerswhosename startwith ‘M’.
2. Displayallthe customerswhose nameendswith ‘L’.
3. Displayallloan detailswhose branchstartswith ‘A’.
4. Displaythe detailsof sailorswhose nameis minimum6characterslong.
5. Displaythe detailsofEmployeeswhoseaddressstartswith ‘S’.
6. Listthe detailsofthe boat endingwith‘e’.
7. Listthedetailsof clientshaving ‘h’ as a 3rdcharacterinhis/her name.
8. ListClientName,duebalanceandcitywhosepincode startswith 4.
9. Listall customerswhosecitycontains‘a’ as secondcharacter.
10. Listclientnamesandcitywhosestate has ‘a’ as fourthor fifthcharacter.

34 |P a g e
 SubjectSyllabus
303105204 - DatabaseManagementSystemLaboratory

6. “AggregateFunctions& DML” Queries:

1. List total depositfrom deposit..
2. GiveMaximumloangivento a customer.
3. Describetheaverageageof allthe sailors.
4. Count totalnumberofcustomers
5. Counttotalnumberof customer’scities.
6. Displaytotaltargetfor the salesman.
7. Updatethesalaryof the employeehaving10000 to 11500
8. Update thecity of clientfromBangaloretoBengaluru.
9. Givethe 15% hikein the salaryof all theEmployees.Renamethatcolumnto “NewSalary”.
10. Increasethesellpriceofall productsby 20% and labelnewcolumnas“NewSell Price”.(Donotupdate the table)
11. Providethe countof customersstayingin“Bombay”
7. “Join”Queries:
1. Findthesalaryof Adam.
2. Find thecitywhereBrookswork.
3. Displaythesailor’sdetailswhoseboat is bookedfor 9th May,98.
4. Displaytheday of rideand sailornameforboat103.
5. Displaythesailornameanditsage for Redcoloredand 101 boat.
6. Displaythe sailordetailswhoseboatis never booked.
7. Displaythesailornamethat hasRed or GreenBoat.
8. Displayallsailordetailsandboat detailsand who hasInterlakeboat.
9. Displaysailor’sratingwithboat detailsor thetrip on 10th October,98.
10. Displaythesailoridand namewhoseageismorethan42 or who has Blue coloredboat.
11. Displaynameandratingof sailorwhose boatnameis Clipper.
12. Listproductswhosesellingpriceismorethan500 and lessthanequal to 750.
13. Describethesecondhighestsalary of an employee.
14. Displaythedate of travelandsailor’snamewhose ageisbetween35 and 65.
15. List allthe employeesworkingfor“FBC”.

8. “Join”Queries:
1. Displayallthe employeenameandthe citywheretheywork.
2. Displaytheemployeenameand company’snamehavingsalarymorethan 15000.
3. Findtheaverageratingandage of allsailors.
4. List variousproductsavailable.
5. Displaythe namesofsalesmanwhohave salarymorethan2850.
6. Changethe costpriceof Trousersto 950
7. Listall the clientshaving“a”as a secondcharacterintheirnames.
8. Listall the productswhose QtyonHandislessthan Reorderlvl.
9. Printthedescriptionandtotal qty soldforeach product.
10. Findout all the productswhichhavebeensold to “IvanBayross”.
11. Findthe namesofall clientswhohavepurchased Trousers.
12. Findtheproductsandtheirquantitiesfor the ordersplacedbyclientC00001and C00002.
13. Listthe clientdetailswhoplaceorderno. O19001.
14. Listthe nameofclientswhohaveplacedordersworthRs. 10000 or more.
15. Findthetotal of Qty orderedfor eachOrder.

9. “Miscellaneous” Queries:
1. Find the averagerateforeachOrder.
2. Givethe loandetailsofall the customers.
3. Listthecustomernamehavingloanaccountinthe same branchcitytheylivein.
4. Providetheloandetailsof all the customerswhohave openedtheiraccountsafterAugust’95.
5. ListtheorderinformationforclientC00001 and C00002.
6. Listall the informationfortheorderplacedinthemonth of june.

35 |P a g e
 SubjectSyllabus
303105204 - DatabaseManagementSystemLaboratory

7. Listthedetailsofclientswhodo not stayinMaharashtra.

8. Determinethemaximumandminimumproductprice.Renamethe outputas “Max_Price”and “Min_Price”.
9. Countthe numberofproductshavingpricelessthanor equalto 500.
10. List the ordernumberandthe day on whichclientplacedanorder.
11. Listthe monthandthedate on whichanorderisto be delivered.
12. Listthedate,25 days after today’sdate.
13. Find the totalof all the billedordersinthemonthof June.
14. List the productsand ordersfromcustomerswhohaveorderedlessthan 5 unitsof “PullOvers”.
15. Findthelistof productsand ordersplacedby “IvanBayrosss”and “MamtaMuzumdar”.
16. Listthe clientswhoplacedorderbefore June’04.
17. List all the clientswhostaysin“Bengaluru”or“Mangalore”.

10. PL/SQLBlock:
1. Writea PL/SQLBlocktoAdd 2 Numbers
2. WriteaPL/SQLBlockto findAreaof Rectangle,Triangleand Square.
3. Writea PL/SQLBlocktofindMaximumof3 numbers
4. WriteaPL/SQLBlocktoprintsumof N NumbersusingFor Loop.
5. WriteaPL/SQLBlock to generateFibonacciseriesof N numbers

Miscellaneous
Exam Requirement
It consistsof Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ)etc

36 |P a g e
 SubjectSyllabus
303105205 - ObjectOrientedProgrammingwithJAVA

Course:BTech Semester: 3
Prerequisite:Basicknowledgeof software applications
CourseObjective: This course providesa broad introductionto softwareengineering.The variousprocessmodelsrequiredto
develop software is also being described.Moreover the functionaland non-functionalrequirementsare also described.

Teachingand ExaminationScheme
TeachingScheme Examination Scheme
Lecture Tutorial Lab InternalMarks ExternalMarks Total
Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
2 0 0 0 2 20 20 - 60 - 100
SEE - Semester End Examination, T - Theory, P- Practical

CourseContent W - Weightage(%),T - Teachinghours

Sr. Topics W T
1 Designintroduction: 8 4
Object-oriented programming, oops principles, encapsulation, inheritance and polymorphism java as a oops &
internet enabled language, importance of java, java usage in industry, the byte code, compiling, and running of
simple java program, jvm, jdk, jre
2 Datatypes,variable,operators: 10 4
Data types,variables,dynamicinitialization,scopeand lifetimeof variables,type conversionandcasting,operators
3 Controlstatements:ConditionalStatements,Looping Statements,Jump Statements 10 5
4 Arrays:Array,ArrayvaluesandmemorystorageStructure,Types of Arrays. 8 4
5 Objectoriented programming: 18 9
Classes and objects: conceptsof classes and objects, declaringobjects, assigning object referencevariables,
methods,constructors,accesscontrol, garbagecollection,usageof static withdata and methods,usage of finalwith
data, overloadingmethodsand constructors,parameter passing - call by value, recursion, nested classes.
6 Inheritance: 8 2
InheritanceBasics,memberaccessrules,Usageof super key word, formsof inheritance,MethodOverriding,
Abstract classes, Dynamic methoddispatch, Using final with inheritance
7 Strings,Packagesand Interfaces: 12 5
String handlingfunctions,Packages, Class path, importingpackages,differencesbetweenclassesand interfaces,
Implementing& Applyinginterface, enumerations in java.
8 ExceptionHandling:Exceptions,Types of Exceptions,Handlingof Exceptions 8 3
9 MultiThreading:Thread,Usageof threads,Typesof threads, Handling Threads 10 4
10 CollectionsFramework:FunctionalProgramming,Collections,Hierarchyof collections 5 8

Reference Books
1. IntroductiontoJava Programming(ComprehensiveVersion)Daniel Liang; Pearson(TextBook)

2. CoreJavaVolume-IIFundamentalsHorstmann& Cornell; Pearson

3. CompleteReferenceJava2 HerbertSchildt;TMH

37|P a g e
 SubjectSyllabus
303105205 - ObjectOrientedProgrammingwithJAVA

CourseOutcomes
At the endof thiscourseStudentsWillbe ableto:
1 Describethe proceduralandobject orientedparadigmwithconceptsof streams,classes,functions,data and objects
2 Understanddynamicmemorymanagementtechniquesusing pointers,constructors,destructors, etc
3 Describetheconceptof functionoverloading,operator overloading,virtualfunctionsand polymorphism
4 Classifyinheritancewiththe understandingofearlyandlate binding,usage of exceptionhandling,genericprogramming.
5 Demonstratetheuse of variousOOPsconceptswiththe helpof programs

CourseOutcome
AfterLearningtheCoursethestudentsshall be able to:
Afterlearningthecoursethe students shallbeableto:
1. Understandthe principlesandpracticeof objectorientedprogramming.
2. Write, compileanddebugprogramswith Java compiler.
3. Createarobust applicationusingexceptionhandling.
4. Understandthe principlesof synchronizationand designapplicationusing multi-threading.

38 |P a g e
 SubjectSyllabus
303105206 - ObjectOrientedProgrammingwithJAVA
Laboratory

Course:BTech Semester: 3
Prerequisite:Basicknowledgeof software applications
CourseObjective: This course providesa broadintroductionto softwareengineering.The variousprocessmodelsrequiredto
develop software is also being described.Moreover the functional and non-functionalrequirementsare also described.

Teachingand ExaminationScheme
TeachingScheme Examination Scheme
Lecture Tutorial Lab InternalMarks ExternalMarks Total
Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
0 0 2 0 1 - - 20 - 30 50
SEE - Semester End Examination, T - Theory, P- Practical

CourseOutcome
AfterLearningtheCoursethestudentsshall be able to:
Afterlearningthecoursethe students shallbeableto:
1. Understandthe principlesandpracticeof objectorientedprogramming.
2. Write, compileanddebugprogramswith Java compiler.
3. Createarobust applicationusingexceptionhandling.
4. Understandthe principlesof synchronizationand designapplicationusing multi-threading.

39 |P a g e
 SubjectSyllabus
303105206 - ObjectOrientedProgrammingwithJAVA
Laboratory

ListofPractical
1. writea programtodisplayHelloWorldmessagein consolewindow.
2. Writea programtoperformarithmeticandbitwiseoperationsin a singlesourceprogramwithoutobjectcreation.
Write a programto performarithmeticandbitwiseoperationsby creatingindividualmethods andclassesthan createan
3.
object to execute the individualmethods of each operation.
4. Writea javaprogramtodisplaytheemployeedetailsusing Scannerclass.

5. Writea Javaprogramthatprintsall realsolutionstothequadraticequationax2+bx+c=0. Read in a, b, c andusethe

quadraticformula.If thediscriminateb2-4acis negative,displaya messagestatingthatthereareno real solutions?
The Fibonaccisequence is defined by the following rule. The first 2 values in the sequenceare 1, 1. Every subsequent value
6. is the sum of the 2 values preceding it. Write a Java program that uses both recursive and non- recursive functions to print
the nth value of the Fibonaccisequence?
7. Write a Javaprogramthatpromptstheuserforan integerandthen printsoutalltheprimenumbersupto thatInteger?
8. Writea Javaprogramtomultiplytwogivenmatrices?
9. Writea Javaprogramforsortingagivenlist of namesin ascendingorder?
10. Write a javaprogramforMethodoverloadingandConstructoroverloading
11. Writea javaprogramtorepresentAbstractclasswith example.
12. Writea programto implementmultipleInheritances.
13. write programtodemonstratemethodoverridingand super keyword.
14. Writea javaprogramtoimplementInterfaceusingextendskeyword.
15. Writea javaprogramtocreateinnerclasses.
16. Write a javaprogramtocreateuserdefinedpackage.
17. Writea Javaprogramthatdisplaysthenumberofcharacters,linesand wordsin a text?
18. Writea Javaprogramthatcheckswhetheragivenstringis a palindromeornot.Ex: MADAM is a palindrome?
Writea Java programthatreadsa line of integersandthendisplayseachintegerandthesumofall integers.(Use
19.
StringTokenizer class)?
20. Writea javaprogramforcreatingsingletryblockwith multiplecatchblocks.
21. writea programfor multipletryblocksand multiplecatchblocksincludingfinally.
22. write a programtocreateuserdefinedexception.
23. Writea java programforproducerandconsumerproblemusingThreads.
Write a java program that implements a multi-threadapplicationthat has three threads. First thread generatesrandom
24. integer every 1 secondand if the value is even, secondthreadcomputesthe squareof the numberand prints. If the value
is odd, the third thread will print the value of cubeofthe number.
25. write a programto createdynamicarrayusing ArrayListclassandthe printthecontentsofthearrayobject.
26. Writeprogramsto implementadd,searchand removeoperationon ArrayList object.

Miscellaneous
Exam Requirement
It consistsof Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ)etc.

40 |P a g e
 SubjectSyllabus
303191202 - DiscreteMathematics

Course:BTech Semester: 3
Prerequisite:BasicConceptsofSet Theory,Function
CourseObjective:The courseprovidesamathematicalbackgroundrelatedto Computerengineering.

Teachingand ExaminationScheme
TeachingScheme Examination Scheme
Lecture Tutorial Lab InternalMarks ExternalMarks Total
Hrs/Week Hrs/Week Hrs/Week Hrs/Week Credit T CE P T P
4 - - - 4 20 20 - 60 - 100
SEE - Semester End Examination, T - Theory, P- Practical

CourseContent W - Weightage(%),T - Teachinghours

Sr. Topics W T
1 UNIT 1Sets, Relationand Function:Cartesianproducts, Binary relation,Partialorderingrelation,Equivalence 11 6
relation, Size of a set, Finite and infinitesets, Countable and uncountable Sets, Cantor'sdiagonal argument, The
power Set theorem, Schroeder-Bernsteintheorem, Lattices: Definitions and properties, Hasse diagrams, and
examples
2 UNIT 2Principlesof Mathematical Induction:The Well-OrderingPrinciple, Recursive definition, The division 9 5
algorithm: Prime Numbers,ThegreatestcommonDivisor:Euclidean Algorithm, The fundamental theorem of
arithmetic.Basic countingtechniques-inclusionand exclusion, pigeon-holeprinciple,permutationand combination.
3 UNIT 3Propositional Logic: Syntax, Semantics,Validity and Satisfiability, Basic Connectivesand Truth Tables, Logical 18 11
Equivalence: the laws of logic, logical implication, Rules of inference, The use of quantifiers Proof Techniques: Some
terminology, Proof methods and Strategies, Forward Proof, Proof by contradiction, Proof by contraposition, Proof of
necessity and sufficiency.
4 UNIT 4Algebraic Structuresand Morphism:AlgebraicStructureswithone binary operation,Semi groups, Monoids, 40 24
Groups, Congruencerelationand Quotientstructures,Free and cyclic groups, Permutationgroups, Substructures,
Normal subgroups, Algebraic structureswithtwo binary operation,Rings, Integral domain and Fields. Boolean
algebraand Booleanring, Identitiesof booleanalgebra, duality,Representation of booleanfunction, Disjunctive and
conjunctivenormal form.
5 UNIT 5Graphs and Trees:Graphs and theirproperties,Degree, connectivity,Path, Cycle, Sub Graph,Isomorphism, 22 14
Eulerian and Hamiltonian walks, Graph colouring, colouring maps and Planar graphs, colouring vertices, colouring
edges, List colouring, Perfectgraph, definition properties and example, Rooted trees and sorting, Weightedtrees
and Prefix codes, Bi-connectedcomponent and ArticulationPoints, Shortest distances.

Reference Books
1. DiscreteMathematicsandits Applications(TextBook)
By KennethH.Rosen|Tata McGraw–Hill
2. Discrete Mathematics
By NormanL.Biggs| OxfordUniversityPress| 2nd Edition
3. DiscreteMathematicalStructureswith Applicationsto ComputerScience(TextBook)
By J.P.TremblayandR.Manohar| Tata McGraw-Hill
4. DiscreteMathematicswith Applications(TextBook)
By SusannaS. Epp| WadsworthPublishingCo.Inc.| 4
5. Elementsof DiscreteMathematicsA ComputerOriented Approach(TextBook)
By C. L. Liu and D P Mohapatra|TataMcGraw–Hill|3

41 |P a g e
 SubjectSyllabus
303191202 - DiscreteMathematics

CourseOutcome
AfterLearningtheCoursethestudentsshall be able to:
Equivalence relation.
• Apply principlesof mathematicalinductionand basic countingtechniquesto solveproblemsinvolvingprimenumbers,divisibility,
and combinatorial analysis.
• Evaluatepropositionallogic statementsand prooftechniquesto constructvalidarguments,identifylogical equivalences,and
apply quantifiers effectively in proofs.
• Differentiatealgebraicstructuresand applycongruencerelationsto solve problemsinabstract algebra,includinggroups, rings,
and Booleanalgebras.
• Analyzegraph propertiesand algorithms(Evaluationlevelof Bloom's Taxonomy)to solveproblemsrelatedto connectivity,
shortest paths, and tree structuresefficiently.

42 |P a g e
 SubjectSyllabus
303193203 - ProfessionalCommunicationSkills

Course:BTech Semester: 3
Prerequisite:KnowledgeofEnglishlanguagein practicallife
CourseObjective:Knowledgeand applicationofEnglish,Aptitudeand Management Skillsarecrucialfor better employabilityas
well as professionalism

Teachingand ExaminationScheme
TeachingScheme Examination Scheme
Lecture Tutorial Lab InternalMarks ExternalMarks Total
Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
- 2 - - 2 100 100 - - - 100
SEE - Semester End Examination, T - Theory, P- Practical

CourseContent W - Weightage(%),T - Teachinghours

Sr. Topics W T
1 TechnicalWriting:Email etiquette& Email writingLetterWriting(TypesofLetters& Layout): 10 4
Trains studentson detailed email and letter writing
Studentswillbe able to writeformallettersfollowingcertainstipulatedformats.
They will learn different types of lettersfor different officialpurposes.
2 InterpersonalCommunicationat Workplace:Dynamicsof communication 10 2
To developthe confidenceto handlea widerange of demandingsituationmoreeffectivelyatthe workplace
To enable the studentsto analyse their own interpersonalcommunicationstyle.
3 Debate:Thethreeminutedebateplanner 10 4
To enable the studentsto generateeffectivecriticalthinkinginto primaryissuesin the given topic.
Studentswillbe able to resolvecontroversiesandrecognizestrengthsand weaknessesof arguments.
4 Goalsetting& TrackingToenable the studentsto definestrategiesor implementationsteps to attain the identified 10 2
goals and make progress every day.
5 Time Management& Task Planning(Case–study) 5 2
To enablethe studentstoidentifytheirowntimewastersand adoptstrategiestoreducethem.
To enablestudentsto clarifyandprioritiestheirobjectiveandgoalsby creatingmoreplanningtime
6 ReadingComprehension:IntermediatelevelTo enable the studentsdevelopthe knowledge,skills,and strategies 5 2
they must possess to becomeproficient and independentreaders
7 ListeningSkills: Small everydayconversation& comprehension 10 2
Provides practice on understanding accentsand day to day
Listening to Englishconversations in differentcontext.
8 Informationdesignandwritingforprint andonlinemedia:Blog Writing 5 2
To enablestudentsto designinformationthatis targetedto specificaudiencesin specificsituation to meetdefined
objectives.
To createblogsandshare theirownknowledgeand experiencetothe world.
9 Advancedvocabulary Building 10 4
The studentswillexpandtheir vocabularyso as to enhance theirproficiencyinreadingand listeningto academic
texts, writing,and
The studentswill attainvocabularyto comprehendacademicand socialreadingand listening
The studentswill develop adequate speaking skills to communicateeffectively.
10 PicturePerceptionTopreparethe studentsfora test for basic intelligenceandIQ, generallydoneon the first day of 5 1
SSB (Sashastra Seema Bal is one of India's CentralArmed Police Forces)
11 Appreciation,Apologyand Acknowledgement letters Page1 of 2 10 2
To enable the studentsto maintainproductivebusinessrelationshipthroughdifferenttypesof letters.
To enable the studentsto expresstheir feelingswithout speaking out loud.
12 The ArtofNegotiation 5 2

43 |P a g e
 SubjectSyllabus
303193203 - ProfessionalCommunicationSkills

To enablethe studentstoreachan agreementformutualbenefitsthroughnegotiation.

To enablethe studentsto learna processby whichcompromiseor agreementisreachedwhileavoidingargument
and dispute
13 ActivitySession(Gameof Truth) 0 1
To make the studentsthinkof significanceofcertainthingsintheirlife.
To makethem sharetheirthoughtsand perceptionofmattersinlife,withothers.

Reference Books
1. BusinessCorrespondenceand ReportWriting
By SHARMA,R.ANDMOHAN,K.
2. CommunicationSkills 2011
By KumarS andLataP | OxfordUniversityPress
3. PracticalEnglish Usage
By MICHAELSWAN
4. A RemedialEnglishGrammarforForeignStudent
By F.T. WOOD
5. On WritingWell
By WilliamZinsser|HarperPaperbacks,2006| 30th anniversaryedition
6. Oxford PracticeGrammar,
By JohnEastwood|OxfordUniversityPress
7. QuantitativeAptitudefor Competitive Examinations
By Dr.R.S.Aggarwal

CourseOutcome
AfterLearningtheCoursethestudentsshall be able to:
AfterLearningthecoursethe students shallbeableto:
1. Write,readandunderstand workplaceEnglish
2. Speakand participateinoral organizationalcommunication
3. Useverbal& non-verbalcommunicationfordeliveringabusinesspresentation
4. EnhanceManagementskills.
5. Learntheprocessof negotiation.

44 |P a g e
 SubjectSyllabus
303105220 - DigitalElectronics

Course:BTech Semester: 3
Prerequisite:: BasicElectronics
CourseObjective:This courseis design to providebasic ideasof computerarchitecture.Thiscourse alsomakeshelp to understand
organizationandarchitectureofcomputer.It will help to develop their logical abilities.

Teachingand ExaminationScheme
TeachingScheme Examination Scheme
Lecture Tutorial Lab InternalMarks ExternalMarks Total
Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
3 0 0 0 3 20 20 - 60 - 100
SEE - Semester End Examination, T - Theory, P- Practical

CourseContent W - Weightage(%),T - Teachinghours

Sr. Topics W T
1 Fundamentals of Digital Systems and logicfamilies :Digital signals, digital circuits, Number Systems:binary, signed 15 7
binary, octal, hexadecimal number, binary arithmetic,
one͛ s and two͛ s complementsarithmetic, codes, BCD arithmetic ,error detecting and correcting codes, AND, OR,
NOT, NAND, NOR and Exclusive-OR operations, examples of IC gates, characteristics of digital lCs, Digital Logic
families:TTL and CMOS logic, interfacing CMOS and TTL.
2 MinimizationTechniques:BooleanAlgebra,Booleanpostulatesand laws,De-Morgan͛ sTheorem,Principleof Duality, 20 8
Booleanexpression,
Minterm, Maxterm,Sum of Products (SOP), Product of Sums (POS), K-map representation, simplificationand
minimizationoflogic functionsusing K-map. Don͛t careconditionsand Quine-McCluskeyMethod of minimization.
Variable Entered Maps, Realizing Logic Function with Gates.
3 CombinationalDigitalCircuits:BinaryAdders and Subtractors, Parallelbinaryadder & subtractor, Serialadder, BCD 20 9
adder, Carry look ahead adder,
Multiplexer/De Multiplexer,Encoder/Decoders,Popular MSI chips,Magnitude comparator,parity
checker/generator,code converters, priorityencoders, decoders/driversfor display devices.
4 SEQUENTIALCIRCUITS:A1-bitmemory,thecircuitpropertiesof Bi-stablelatch,the clockedSR flip flop,J- K-T and 20 9
Dtypesflip flops,
applicationsof flipflops, shiftregisters,Applicationsof shift registers,ring counter,sequencegenerator,ripple
(Asynchronous)counters, synchronous counters,special counter IC͛s, asynchronoussequential counters,
applicationsofcounters.
5 A/Dand D/A Converters:Digitaltoanalogconverters:weightedresistor/converter,R-2RLadder,examplesof D to A 10 5
convertersIC͛s, Analog to
Digitalconverters:successiveapproximation,A/D converter,dual slope A/D Converter,Exampleof A/DConverterICs.
6 SemiconductorMemoriesAnd ProgrammableLogic Devices:Classificationandcharacteristicsof memories,Content 15 7
addressable memory(CAM), commonly used memorychips,
Introductionof PLD,ROMas a PLD,Programmablelogicarray, Programmablearraylogic,ComplexProgrammable
logic devices(CPLDS), Field ProgrammableGate Array(FPGA)

Reference Books
1. ModernDigitalElectronics (TextBook)
By R.P.Jain| Tata McGraw-HillEducation
2. DigitalLogicand ComputerDesign
By MorrisMano| PHI
Page1 of 2
3. Fundamentalsof Digital Circuits
By AnandKumar | Prentice-HallofIndiaPrivateLimited,NewDelhi(2006)

45 |P a g e
 SubjectSyllabus
303105221 - DigitalElectronicsLaboratory

Course:BTech Semester: 3
Prerequisite:Basic Electronics

CourseObjective:This courseis design to providebasic ideasof computerarchitecture.Thiscourse alsomakeshelp to understand

organizationandarchitectureof computer.It will help to develop their logical abilities

Teachingand ExaminationScheme
TeachingScheme Examination Scheme

Lecture Tutorial Lab InternalMarks ExternalMarks Total

Credit
Hrs/Week Hrs/Week Hrs/Week Hrs/Week T CE P T P
0 0 2 0 1 - - 20 - 30 50
SEE - Semester End Examination, T - Theory, P- Practical

CourseOutcome
AfterLearningtheCoursethestudentsshall be able to:
AfterLearningthecoursethe students shallbeableto:
1. IdentifyandExplainthe digitalnumbersystemand alsoableto justifythe practicalapplicationofnumbersystem.
2. UnderstandandExplaindifferentlogicgatesandcodesandalso how to use theminrealwordapplication.
3. Realizetheminimizationtechniquesof digitalCircuits.
4. Designdifferent Adders, Subtracters, Multiplexers,decodersandmanymore circuits
5. Applythe theoreticalknowledge to designflip-flops,countersandmanymoresequentialcircuits.
6. Identifyandillustratespecificationsof differentlogicfamiliesand memoriesandanalyzethem in criticalway.

46 |P a g e
 SubjectSyllabus
303105221 - DigitalElectronicsLaboratory

ListofPractical

1. To StudyandTestingofvariousLogicGatesICs.
To Study and TestingofvariousLogicGatesICs.

2. ConfiguringNANDandNOR logic gatesasuniversalgates.

ConfiguringNANDand NOR logicgatesas universalgates.

3. Design Logic GatesusingTTLLogicGamily.

DesignLogicGatesusingTTL LogicGamily.

Studyand Implementationof BooleanLogic Functionsandcombinationalcircuitslike Adder/ Subtractor,CodeConverters,using

4.
LogicGates.
Study and ImplementationofBooleanLogicFunctionsand combinationalcircuitslike Adder/Subtractor,Code Converters,using LogicGates.

Studyand Implementationof BooleanLogic Functionsand combinationalcircuits like Multiplexers/De-Multiplexresusing Logic

5.
Gates.
Study and Implementationof BooleanLogic Functionsand combinational circuitslikeMultiplexers/De-MultiplexresusingLogicGates.

StudyandImplementationofBooleanLogic Functionsandcombinationalcircuitslike Encoders/Decoders,usingLogicGates.

6.
Study and Implementationof BooleanLogicFunctionsand combinationalcircuitslikeEncoders/Decoders,using LogicGates.

7. Studyandconfigureofflip-flopusingdigitalICs. Design digitalsystemusingthesecircuits.

Study and configureofflip-flopusingdigitalICs. Designdigitalsystemusingthesecircuits.

8. StudyandconfigureofregistersandcountersusingdigitalICs. Design digitalsystemusingthesecircuits.

Studyand configureof registersandcountersusingdigitalICs. Designdigitalsystem usingthese circuits.

9. StudyandDesignAto D / Dto Aconverters.

Study andDesignAtoD / D to A converters.

10. IntroductiontoFPGA/ CPLD.ImplementationofdigitalcircuitsstudiedinprevioussessionsusingPLD/ CPLD / FPGA

IntroductiontoFPGA/CPLD. Implementationofdigitalcircuitsstudiedin previoussessionsusing PLD/CPLD / FPGA

47 |P a g e