Skip to main content

Open navigation menu

Close suggestionsSearchSearch

enChange Language, English

Upload

Sign in

Sign in

Gbe e, Belief Lact icaar fly) 9 PART-C: Learning Resources at™ Tefen eM Bouks, Reference Buols and Others Rae ext Books Recommended: — : © D. Nasi, S. Gill, LB, Dixit, Dighal 1 Limited. © KK Neniwal. Di and Computer Organization, Lasini Publivatiny i igital Hcetronies (Hindi). Paperback Publication, Keference books Recommended: ¢ M, Marris Mano, Digital logic and Computer Design, Prem 2A. K. Main, Digital Arall of India private le, clronics Principles, Devices and Applications, John Wiley & Suns, Ll, Online Resources: + Digital Cireuits by Prof, u Chattopadhyay (NPTE htips://youtube,com/playlistist=PLbRMADVUM nue? PS Jeezacink- | Ex cowatrdisim6ViOuGRFGIYmeZy |» Digital Electronies by Prof Gautam Saba (NPTEL) | hitps//voutube com/plavlistlist-PLbRMhDVUMagedu(TOvBWiCb3L20l4nY [Link]-L6P MoGGO) + Switching Cirenits and Logie Design by Prof. Indranil § ttps2// [Link] playlist YBAzp0 + Online Simulator’s for Digital L_¢ Digital tectronies referen FP Kharagpur fist =PLb nwt VECOEIN A Us(QQ/D6wIhi MSResixe Digital Eleetronies Tutorial « Javatpoint PART -D: Assessment and Evaluation —_ _— ‘Suggested Continuous Evaluation Method: Maxirsum Marks: 100 Marks Continunus internal Assessment (CIA): 30. Marks Marks _ Internal Test 7 Quiz-(2y: 20 & 3 Assignment /Seminar- 10 Total Marks 30 Two section A&B ection A: QU. Objective 10 x1> 10 Mark; Q2, Short rest / Quiz marks in Assignment shall be Ameesaniene (CIA): led Sguinst 30 Marks (tty Courwe Teacher) onyFOUR YEAR UNDERGRADUATE PROGRAM (2024 ~ 20) DEPARTMENT OF COMPUTER APPLICATION COURSE CURRICULUM | PART- A: Introduction | Progam: Shelielor in Computer Apple ; ; ' Feenstra Wsiatin sf Sein 202-2025 (Certipicaun / Diploma ¢ Degree/ anaes) 61 | Course Code ASC-UBT | 2 | Come Title Programming In CV4 [| Comme type DSC (Disclpline Speeltte Course) | [4 | Prerequisive ‘As por program | 1 Ai the onl of thie eum, ns ‘alucdanin will bo able to: | | 4c Unuleratuial the Hintlamentas of objet arkented pringramnanioy | a J Wie progiminr lu! 1 cone oF whjeet arte programs \° 3 Detine fnctons, ein aud to erents ove [baie | 2» Welly prugewnis for file handling, J evelap unl progr io calve_raal world problem. “ 3 Groulls | Credle» (5 Hours - Learning & Observation, 7! "otal Marks Max, Marks: 100 sin Has Markos: 40 PART -B: Content of the Course _ ; . j | “Tela NecalFenching-Lenrning Periods (OF Hie. por period) « 43 Periods (45 Hoary) Pe - ~ - : ” No. at) Unit Loples (Course contents) ail Heliniilan of Program, Source file, Object analiior: Awembler, Interpreter, Compiler, Tion and Programming Concept le, Executable file, Heeler file, Language | Tsing, Debugging, Linker und Louder, Algor, law Chart, iatory of Cam | Siructure of C progrim ,C Tokens : Identifiers, Keywords, Constants, Varlables, Operntors, | yy | Pata Types, Control trues: Conditional an! fooping stalements, Operator Precedence | and User | | ive ond Associntvity, Any and iis typen, Pointer, Funetfony + Stondaed 1 vi unetionsy Function provlype, Call by value und Call by reference, 1 io, 111 [introduction 10 Object Programming: Concept of object oriented | | programming, Features of G+, Steucture of C++ program, Duala Lypes, structure, class anid | ints, Aecoos Specifier: Private, Publie Protected, inline linetions, aac dan and wate J 44 | aoe Sons uctor: Dealt eonnrueter, Copy constrictor, Parumeterized eonstructor, | | i Destructor, THT | Inherliance wid Polymorphism: Defin ie anil lerived elas, Typer of | Juligritanee: Single, Multilevel, Multiple, Hierirchival and Hybrid Inher itanes, Polymorphian: Definition, Compile tine polymorphism: Function overloading, Cpertar | 14 room, conairuioy ovelonding, Kunime polymompism: Virol Pusetion, pare | eitual tet, Saline funetion, on, fn cea [oper anganonepit nd Fite ilu and Stream elise, Char VO, String Ofiiaet WO, Mefdet 1/0, ie Pointer, Opening and Closing file, “Eygabyonittadtg and Standard ‘Template LAbrary: Delain, Fxeeption avi uy, ‘ateland throws keywords, ‘Temp Be Bia vale Tokeu, Kdeniifler, Keyword Fiactlon, Class, Objeci, Polymorphism, Inheritance, Constructor, Templar, gl. bs *e ie ine Cites: er Cale, i Bic “Z Pe jprdainny OT re arvntshor) sigs = cL na) High ANTECTA [VIVA “ jek | | |PART-C: Learning Resources Teal Books, Reference Books and Others - Text Books Recommended: + Peter Juliff, Program Design, PHI Publications, + Yashwant Kanetkar, Let us C: BPB Publications, | * E-Balaguruswamy, Programming in ANSIC, Tata MeGraw Hill Reference Books Recommended: + Y. Kanetkar, Let us CH, B.P.B Publication. E. Balaguruswamy, Programming in C++, Tata MoGraw Hill R. Kumar, Object Oriented Programming with C+, Prakhar Publication(Hindli) | Lakhyani)(Hindip Online Resources: ‘+ Introduction to € and C+ from SWAYAM/NPTEL bhtps:/[Link]/noe22_cs103/preview hhupsitwww. youtube, com/waich?v=K Gah] VDw-p8&lisi=PLmpdylke B4KsM9uOEWvPIVFUKU3|Ne6D2S&index=2 * Constaftand Inline Funétion through NPTEL: hutps:/Avw. [Link]?v=pX6LufLsv2M&tlis B4KiM9uOEdvPIVFUKU3]Ne6D2éindex=10 + Pointer and Reference NPTEL hutps:/[Link]/watch?v=GtsBZSel-cEélist=PLmpdylk- BaKrMuOEdvPIVFUKU3jNC6D28index=12 + Function Overloading NPTEL hitgs://svw [Link]/watcl?v=wWGmGAShHeUsilist=P Lmpdylk- B4K:M9uOEdvPIVFUKU3}Ne6D2&index=13 + Operator Overloading NPTEL hitps://worw. youtube. com/wateh'?v=UjpOwedd- FER list=I B4KrM9uOEdvPIVFUKU3{NC6D2&index=17 + Dynamic Memory Management NPTEL hutps://www [Link]/watch? v=IkFK2X6qleélist-PLmpaylk- BAK rM9uOEdvPIVFUKU3)Nc6D2&index=18 = Class and Object NPTEL hups://www [Link]/watch? v=wtuks_{3vP4élist=PLmp4ylle BAK rM9uOEdvPIVFUKU3)Ne6D2&indlex=24 + Access Specifiers NPTEL hups:diwaw. youtube,com/watch? v=6ki_W7eXUMOélist=PLmpAylk- B4KrM9uOEdyPIVFUKU3jNc6D2index=22 ‘+ Constructor and Destructor NPTEL. |hups://www. [Link]/watelt?v=wtuks_(3vP4élist=PLinpdylk- BaKrM9uOEdvPIVFUKU3)Ne6D2&index=24 CH different topics from W3School hupsi/[Link]/CPP/dethult asp + C+ different topics from Javatpoint Intps://wwer [Link]-tutorial Limp yl Lipsy a Se [Link], She! Dhupiya, Lakiyani , C++ Programming Alka Publications, Ajmer (Paperback, Dhupiya,‘Maximum Marks: tinuous haternal Asses 100 Marks: sssment (CIA): 30 Marks Internal Test / Quiz-(2): 20420 — Assignment /Seminar- 10 ‘Two section -A &B Scetion wen ‘and Signature of Convener & Membefs of CB faba Kh eke : EN dunny bso) Cheat main q | Gendt |, Ae \ fear Hoon St) [Section Bo2s Ye" Earartskin) 5 QU. Objective ~ 10 x1* 10 Maric: Q2. Short answer ty : Deserinl} ve answer type ats. out of 2 from each w Butier marks out of the two Test / ‘obtained! marks in Assignment considered against 30 Marks wnYEAR UNDERGRADUATE PROGRAM (2024 ~— 28) ceee DEPARTMENT OF COMPUTER APPLICATION COURSE CURRICULUM PART- A: Introduction 1 Computer Appi | (Certificate / Diploma Degree) | Code __| Case. Title Semester =U Sessions 2021-202 [Lab 3: Programming in cH Practical . i As per program i | At ihe end ofthis couse, the students — | + Understand the fundamental programming conecpts ancl methodologies ; which are essential o create good C++ programs, * Code, test, and implement a well-structured, robust computer program using the C+ programming language + Write rensable modules (collections of functions) * Understand designvimplementation issues involved with variable allocation and binding, control fow, types, subroutines, parameter essing. | | Develop on in-lepth understanding of functional, logic, and object |______ Oriented programming-paradigms, — — hing, nes (CLO) T Hours Laboratory or Field Leurniny/training | Mark ~ tee Mah 50____|_Min Passi Content of the Course ning/performance Pe Wiite a program in C+ for addition of two numbers using float data type. Write a program ja C+ to find the biggest number between two numbers, Write a program in C++ to find the factorial value of any entered number using do - while loop, + Write a program in C++ for various arithmetic operations using switch case statements, { i Write a program in C+++ for Multiplication of two 3X3 matrices. i Write a program in C+ to store five books of information using structure, | |7. Write @ program in C+ to store six employee information using union. i 8. Write a program in CH to calculate simple interest using call by value and | | call by reference method. | 9. Write a program in C+ to find the sum and average of five numbers using | class and objects. | i | | i | 30 | 10. Write a program in C++ to multiply two numbers using private and public \ member functions. . 11, Write @ program in C'+* to print structure like this using scope resolution operator | | | 3 | 12 i iB | 1234 | t wee tractor t 112. Write a program in CH to sa soca Awa lamie)ca program in CH for multiple inherita [1S FRE ear Gt for opersorovertoading. | = program in C+ for friend class and friend function 1s Vite a program in C+ for viral function and visual class 117. write program in C++ for Exception Handling, ; ‘ [81 write a program in G+* to open and close a file using file Handling, | 19, Given two ordered arrays of integers, write a program to merge the two-arrays | to got an ordered array. |20. WAP to display Fibonacci series (i) using recursion, (ii) using iteration 121, WAP to calculate Factorial of a number (i) using recursion, (ii) using iteration }22. WAP to calculate GCD of two numbers (i) with recursion (ii) without | recursion. |23. Create a Matrix class using templates. Write a menu-driven program to | perform following Matrix Operations (2-D array implementation). 2) Sum b) | Difference c) Product d) Transpose 22. Create the Person class. Create some objects of this class (by taking information from the user). Inherit the class | | j | Person to create two classes Teacher and Student class, Maintain the respective information i the classes and create, display and delete objects of these two classes (Use Runtime Polymorphism). | | | \24. Create a cl ‘Triangle. Include overloaded functions for calculating area. |. Ovetload assignment operator and equality operator. = |25. Create.a class Box containing length, breadth and height, Include following methods in it: a) Calculate surface Area b) Calcalate-Volume c) Increment, Overload ++ operator (both prelix & postfix) d) Decrement, | 9perator (both prefix & postfix) e) Overloud operator Overload (to check equality | oftowo boxes), asa friend function ) Overload Assignment operator g) Check j i | | if it is a Cube or cuboid i j i 26. Create a structure Student containing fields for Roll No., Name, Class, Year| j | and Total Marks. Create 10 students and store them ina file. ' i |27. Write a program to retrieve the student information from the file created in| | \ | the previous question and print it in the following format: Roll No, Name i \ Marks | | 28. Copy the contents of one text file to another file, after removing all | | | hi ° | i whitespaces. i: | 29. Write a program for exception handling. | | 30, Write a program to insert data into file and to display it. | | i i | = Kowntt [Ar lame a anure oF Ge Seer C\alewen Erase f (Pex Books Recommentat ‘* E. Balaguruswamy, Programming in ANSIC, Tata MeGraw Hill ne Boe Renin + ¥. Kanetkar, Let us CH, 8.0.8 Publicationam Oe cnmning with C=, Prakdar Publicalion(ilinaly et Ghupiye, Lakhyani, C+ Programming Alka Publications Ames (Paperbacte, Dhupiya, Lakhyan ttn (Gina resources oe piraduetion 0 C und C+ from SWAYAM/NPTEL \ Aprontinesouses. ape tsnoe22-cs103fprevew | BUxiMNOBNnIVEUKUS NecDoRine | + Constant end inline Function through NPTEL:; |” perry atubu son/ontehsepXCLat-so2Maiat-P Lamp BaRiNOiOEUWPIVFURUS)NEGD2E mlenetO | © Pointer and Reference NPTEL | | | | | | hups:f/[Link]?v=GisBZ5e1 -cEélis BAK rM9uOEdvPIVFUKUS3}Ne6D2aindex=12 Function Overloading NPTEL hups:i/wvw. [Link]/watch?v=wGmGAShIeUSlist=PLmp4ylk- BAK rMYUOESvPIVFUKU3)Ne6D2index= 13 + Operator Overloading NPTEL, hltps://[Link]/wateh?y—0jpOwedd-FEMist=PLmp4ylle- BalrM9uOEdvPIVFURU3jNeGD2&indox=17 | Dynamic Memory Management NPTEL, |hups://[Link]/wateh?v=IkFK2X6qleO8list=PLmpaylk- | BAK M9uOEWyPIVFUKU3)No6D2Rindex= 18 = | * Class and Object NPTEL a ! |hups:f/wow youtube, com/wateh’vwiuks_(VPARTSt=PLinpdylk> i BAK FM9UOEdvPIV FUKUS)NeGD2Rindex=24 ‘Access Specifiers NPTEL, Itps:/[Link]/watch?v=6ki_W7eXUMOS.List=PL BAKM9UOEdvPIVEUKU3)Ne6D2&index=22 Constructor and Destructor NPTEL hups:/[Link]/watch? v—wtuks_vP4élist=PLmpdytke PLmpayik- oye | 84KrM9uOEdVPIVFUKU3]NeGD2&inde i Ci different topies from W3School ' hups:/[Link] \ C¥++ different topics from Javatpoint | hispss# www [Link]-tutorial RT -D: Assessment and Evaluation —__ = _ ‘ed Continuous Evaluation Methods: — | Maximus Marks: 50 Marks | Continuous Internal Assessment (CIA): 13 Marky { | 1 Semester Exam (BSE): _35 Marl aS - “Continuous Internal internal Test Quiz-2y: 10 & 10 | Botter marks out of ‘Qu Assessment (CIA): |Assiznment/Seminar-+Attendance - 05 | + obiained marks in Assignment shall he! (By Course Teacher) ual Maris 7 15 onside aginst 1$ Marks | End Semester Exam|Laboratory / Field Skill Performance: On spat Assessment aged by A. Performed the Task based on lab. work = 20 Marky BL. Spotting based on tools & technology (written) = 10 Marks C._Viva-voce (hased on principleltechnology) 05 Marks mcg Sigranare of Rosener & Members of ChoS: curse teacher! “8 per lah, statu | \ OnStar) + ees Mi | (ESE): I 6: i) | eave) ge ar Lica KUTUR peaFOUR YEAR UNDERGRADUATE PROGRAM (2024 _ 2a) DEPARTMENT OF COMPUTER APPLICATION COURSE CuRRICU Sn LUM PART-A: Introduction Program: Guchelor in Computer Applic: sient | (Certificue/ Dipluma/ DewreeMh mehr Bt iT Sessions 24h Course Learning, Dutcomes (CLO) © | Credit Value” c ‘| 3 Credits 7_| Total Marks =: ~Learning & Observation — | Min Passing Mi cep es ( i Period | Introduction, Fundamentals of Algorithms, Data ty; et Primitive, No-Ptimitive Absent Data Type (ADT), Cla | | i and Nonlinear Data Structure. Arra | | calculations of Arcay, Sparse Ar ,o 4 Operations Like INSERT, DELETE, TRAVERSE. Int a “Tse # Definition, Operations PUSH, POP, Implementations Wa 1g Amay and Linked list, | | Applications of Stack: tnfx, Prefix, Postfix representation and conversion using Sta, | Postfix expression evaluation using Stack, Recursion using Stack | Queue: Definition, Types of Queues: Priority Queue, Circular queue, Double Ended Queue, operations of Queue INSERT, DELETE, TRAVERSE, Implementuti | fon Queue using Aray i anc! Linked list, Applications of Queue, [ Tree: Definition of Trees and their types, Binary trees, Properties of Binary trees and | ‘operations Insertion, deletion, searching and traversal algorithm preorder, post order, n-ovth traversal, Binary Search Trees, Implementations, AVL Trees Graph, efinition of Graph and thet types, Adjesncy and Incident (matrix Linked st) REEL EMiatfon of grophs, Graph Traversal ~ Breadth fist Traversal Depth ea Traversal, “/Comieetiviyyendt Graphs; Weighted Graphs, Shortest Path Algorithm, Spanoing Tree, ‘Mita Spanning Tree, Kruslal’s and Prim's Algorith Sorting Methods: Types of Soring Selection So, Inetion Sor, Bubble Som Merge Sort, Radix Sort, Searching: Lincar search, Binary eeare, “Data, ADT, Array, Linked Lis, Sack ‘& Members k Son, seu, Tree, Graph, Searching, Sorin pe 1 fon prisoors) san =) 5 je ANTEETA Kerv waeART-G: Learning Resources Text Hooks, Reference Books and Others rext Buoks Recommended: + Michael T, Goodtich, Data Structures and Algorithms in C44, Wiley + Horowitz and Sahani, Fundamentals of Data Structures, Computer Se ¢ Press Reference Books Recommended: + Alfred V. Aho, D: ata structures and Algorithms, Jhon E. Hoperoft and J.B, Ullman. + Jean Paul Trembley and Paul Sorenson, An Introduction to Da ata Structures with Applications! TMH, International Student Edition |_*_R- Kruse, Leung &Tondo, Data Structures and Program Design in C, PHI Publication, 2" Edition Online Resources: + NPTEL YouTube Channel: Data Structure + huips://[Link]/playlist?list yWrewhF EO, NPTEL YouTube Channel: Introduction to Data Structure [Link],com/vatch?v=2We7UNOBA oEdlist™PLBE3763A F2EICSTIE NPTEL YouTube Channel: Stacks butps:/[Link]/watch?v=gl USSZVWDs¥ &list=PLBF3763A 21 NPTEL YouTube Channel: Que ues and linked list 7 [Link]/watch? v=PGWZUezDMY l&list=PLBF3763AFZE1 NPTEL YouTube Channel: Trees https:/[Link]éwat NPTEL YouTube Chane ¢ Complete course ‘Lc2MoXNv7E4mtsPlnn9BnTOENXsG: /o De R &si: itch’ =!ORLeHHtazMélist=PLBF3763AF2E1CS72I : Graphs hutps://www, Youtube. com/vatch?y=97p5s845wfS&list=I LBF3763AF2E1 + _W3schools Data Structure Reference: DSA Tutorial (w3 [Link]) |PART -D: Assessment and Evaluation | Suggested Continuous Evaluation Methods: a | Maximum Marks: 100 Marks | Continuous Internal Assessment (CIA): 30 Marks | Semester Exam (ES! "Continuous Internal aa ; aes) + sment (CIA): iment /Seminat- 10 | obtained marks in Assignment shall be | Course Tesenar) | 1 Mn % ins 30 Sars nd Semester Tivo sect a-ARB i 10 xb 10 Mark: Q2. Shon unsiver types $44 -20 Marks answer yf Wang aaggsanaine Of Gonrenar ad Mfimnercer choc Pek eotela othe Otel? | chadwey ek-®Bahey) pre) a AG y )