SCHOOL OF COMPUTER SCIENCE SCHEME OF STUDIES

2y ago
15 Views
3 Downloads
617.93 KB
87 Pages
Last View : 1m ago
Last Download : 3m ago
Upload by : Samir Mcswain
Transcription

SCHOOL OF COMPUTER SCIENCESCHEME OF STUDIESMaster of Computer Applications(2016 Batch)1

S.N.123456S.N.123Course No.MCA-101 AMCA-102 AMCA-104 AMCA-106 AMCA-108 AEN-105 ASCHEME OF STUDIESMCA Degree Programme1st YearSEMESTER – ICourse NameComputer ProgrammingDiscrete StructuresData Communication and NetworkingWeb DevelopmentData Structures and its applicationTechnical .443443Course No.MCA-151 AMCA-154 AMCA-156 APRACTICAL/DRAWING/DESIGNCourse NameComputer Programming LabData Structures and its application LabWeb Development e No.MCA-103 AMCA-105 AMCA-107 AMCA-109 AMCA-110 AMCA-111 AS.N.1Course No.MCA-153 A2MCA-155 A3MCA-159 A28SEMESTER – IICourse NameRelational DBMSObject Oriented Programming USING C Computer Organization and ArchitectureOperating SystemsAnalysis and Design of AlgorithmsSoftware Engineering PrinciplesPRACTICAL/DRAWING/DESIGNCourse NameRelational DBMS LabObject Oriented Programming USING C LabOperating System lab18-0-9 -T-P0-0-3Cr.20-0-320-0-3227

SCHEME OF STUDIESMCA Degree ProgrammeS.N.123456S.N.123Course No.MCA-201 AMCA-206 AMCA-208 AMCA-215 AMCA-218 AMCA-219 A2nd Year (1st yr for Lateral entry)SEMESTER – III (semester –I for Lateral Entry)Course NameComputer Graphics and MultimediaCore and Advanced JavaProgramming Using C#Computer Software TestingObject Oriented Software Engineering & UMLCyber Laws and Intellectual Property RightCourse No.MCA-251 AMCA-256 AMCA-258 APRACTICAL/DRAWING/DESIGNCourse NameComputer Graphics and Multimedia LabCore and Advance Java LabC# Programming -P0-0-30-0-30-0-3Cr.22220-0-926S.N.123456SEMESTER – IV (Semester- II for Lateral Entry)Course No.Course NameMCA-209 A Data Mining and Data WarehousingMCA-213 A Advanced Operating SystemMCA -214 A Soft Computing techniquesMCA-216 A Cloud ComputingMCA-220 A Cryptography & Data CompressionMCA-221 A Big Data AnalysisS.N.123Course No.MCA-259 AMCA-266 AMCA- 271 APRACTICAL/DRAWING/DESIGNCourse NameData Mining and Data Warehousing LabCloud Computing LabBig Data Analysis 4433L-T-P0-0-30-0-30-0-3Cr.22227

SCHEME OF STUDIESMCA Degree Programme3rd Yr (2nd Yr for Lateral entry)S.N.12345S.N.123SEMESTER – V (Semester III for lateral Entry)Course No.Course NameMCA-301 A Artificial IntelligenceMCA-303 A Introduction to ERPMCA-304 A Android Applications developmentElective -1Elective -2Course No.MCA-351 AMCA-354 AMCA-381 APRACTICAL/DRAWING/DESIGNCourse NameArtificial Intelligence LabAndroid Applications development LabMinor 33L-T-P0-0-30-0-30-0-8Cr.22425S.N.Course No.3rd yearSEMESTER – VI ( Semester IV for lateral entry)Course NameL-T-P1MCA-371 AInternship0-0-3212MCA-391 AElective ( CST)Seminar***3-0-363-0-00-0-43217234Cr.

LIST OF ELECTIVESMCA Degree ProgrammeS.N.1.2.3.4.5.6.7.Course No.CA-1309 ACA-1425 ACA-1401 ACA-1323 AMCA-302 ACA-1326 ACA-1327 AMCA-211 AElective -1Course NameNetwork Security & ManagementInformation Storage and ManagementIntroduction to XMLAdvanced Computer ArchitectureSystem Network AdministrationExpert SystemNatural language processingInformation Technology 03-0-0Cr.33333333ELECTIVE -2S.N.123456Course No.CA-1328 ACA-1406 ACA-1307 AMCA-210 ACA-1324 AMCA-212 ACourse NameDigital Image ProcessingEMBEDDED SYSTEM DESIGNNeural NetworkSoftware Project ManagementAdvanced Database Management SystemMobile 3337CA-1421 ACompiler Design3-0-038CA-1424 ADistributed computing3-0-039CA-1310 A3-0-03 D multimedia & Animation53

st1 YearSchool of Computer Science6

MCA-101 ACOMPUTER PROGRAMMINGL-T-P4-0-0Cr4OBJECTIVETo introduce the students the basic of C and Logic behind the implementation of differentfeatures of C like different data types , function, array, control statements, pointers, structures,file processing and recursion1.2.3.4.5.INTRODUCTION TO COMPUTER SYSTEM: Computer Fundamentals: Definition,Block Diagram along with Computer components, Characteristics & classification ofcomputers, hardware & software, types of software, Introduction to Compiler, Assembler,and Interpreter, Operating System, Definition, functions, data representation – bits and bytesand operations of data, radix number system – decimal, binary, octal, hexadecimal numbersand their inter conversions, representation of information inside the computers.BASICS OF PROGRAMMING AND OVERVIEW OF C PROGRAMMING:Programming Fundamental, Problem definition, Algorithm, Flow charts and their symbolsTypes of programming languages, Translators, Introduction to C, Structure of C program, Ccharacter set, Identifier and Keywords, Data types, constants, variables, Declaration,expressions, statements, Symbolic constants, type conversion, Types of operators, Input andoutput functions in C, header files, common programming errors, Control Statements,Sequencing, Selection, Condition and iteration.COMPOSITE DATA TYPES: Declaring, Referencing and initializing arrays, arraysubscript, using for loop for sequential access, multi-dimensional array, String basics stringlibrary functions, assignment and substring, concatenation, string comparison. Declarationand Initialization of structure, structure within structure, Array of structureFUNCTIONS AND POINTERS: Definition of function, function prototype, Purpose ofmain function, passing parameters, Scope of function, recursion, Call by value andreference, Types of storage classes, Scope of variable: Global and local, static variables,Recursion. Pointer variables, initializing pointers, pointer operators, pointer expressions,pointers and arrays, pointer and functions,DYNAMIC MEMORY ALLOCATION AND FILE PROCESSING: C's dynamicallocation functions. Streams and file types, opening and closing a data file, input and outputoperations, text mode versus binary mode, formatted input output operations with files,random access to files.Text Book:- Let Us C by Yashwant Kanetkar; BPB Publication, New Delhi.Reference Books :1. Programming in C by Schaum Series, McGraw Hills Publishers, New Delhi.2. Exploring C by Yashwant Kanetkar; BPB Publications, New Delhi.3. Application Programming in C by RS Salaria, Khanna Book Publishing Co. (P) Ltd., NewDelhi.4. Programming in C by R Subburaj, Vikas Publishing House Pvt. Ltd., Jangpura, New Delhi.5. Programming with C Language by C Balaguruswami, Tata McGraw Hill, New Delhi.6. Programming in C by BP Mahapatra, Khanna Publishers, New Delhi7

MCA-102 ADISCRETE STRUCTURELTPCr4004OBJECTIVE: To lay mathematical foundation for the fundamentals of various computationalstructures such as Boolean algebra, propositional logic, graph and trees.PRE-REQUISITES: Knowledge of Data StructureSET THEORY: Introduction to set theory; set operations; algebra of sets: duality,finite and infinite sets, classes of sets, power sets, multi sets, Cartesian product,representation of relations, types of relation, equivalence relations and partitions,partial ordering relations and lattices; function and its types, composition of function andrelations; cardinality and inverse relationsPROPOSITIONAL CALCULUS AND TECHNIQUES OF COUNTING: Basicoperations: AND (Λ), OR (V), NOT ( ), truth value of a compound statement,propositions, tautologies, contradictions, Permutations with and without repetition,combination.RECURSION AND RECURRENCE RELATION: Polynomials and their evaluation;sequences, introduction to AP, GP and AG series, partial fractions; linear recurrencerelation with constant coefficients; homogeneous solutions, particular solutions, totalsolution of a recurrence relation using generating functions.1.2.3.ALGEBRIC STRUCTURES: Definition and examples of a monoid, semigroup,groups and rings; homomorphism, isomorphism and automorphism; subgroups and normalsubgroups; cyclic groups, integral domain and fields; co-sets; Lag range„s theorem4.GRAPHS: Introduction to graphs, directed and undirected graphs; homomorphic andisomorphic graphs; subgraphs; cut points and bridges; multigraph and weighted graph;paths and circuits, shortest path in weighted graphs; Eulerian path and circuits, Hamiltonpaths and circuits; planar graphs; Euler„s formula.TEXT BOOKLiu C. L., ―Elements of Discrete Mathem atics‖, McGraw Hill, 1989REFERENCE BOOKS1.2.3.4.5.Johnson Bough R., ―Discrete Mathematics‖, 5th Edition, Pearson Education, 2001Graham Ronald, Knuth Donald E. and Patashik Oren, ―Concrete Mathematics: AFoundation for Computer Science‖ , Addison-Wesley, 1989Gersting Judith L., ―Mathematical Structures for Computer Science‖, Computer SciencePress, 1993Chtewynd A. and Diggle P. ,Discrete Mathem atics‖ , Modular Mathematics Series,Edward Arnold, London, 1995Lipshutz S ., ―S chaums Outline series: Theory and problems of Probability‖, McGraw HillSingapore, 19828

6.7.Kolm an B. and Busby R. C., ―Discrete Mathematical Structures‖, Prentice Hall of India, 1996Trembley and Manohar, ―Discrete Mathematical Structures with Applications to Computers‖, McGraw Hill, 19959

MCA-104 ADATA COMMUNICATION ANDNETWORKINGL-T-P3-0-0Cr3OBJECTIVETo have a fundamental understanding of the design, performance and state of the art of wirelesscommunication systems, Topics covered include state of the art wireless standards and researchand thus changes substantially form one offering of this course to the nextPRE-REQUISITES: Knowledge of computers hardware and software1. Introduction to Networks and LAN: Overview of networks: topologies, LAN, MAN, WAN.Network reference Models: OSI and TCP/IP, Layers and their functions and protocols.Networking Devices: Hubs, Switches, Repeater, etc. Internet working devices: Bridges, Router,gateways etc., Data Transmission media, Switching Techniques, Modulation and multiplexingtechniques. Overview of LAN: LAN standards, Channel access methods: CSMA, CSMA/CD,Token ring. Ethernet: layered architecture, Fast Ethernet: layered architecture, Gigabit Ethernet(IEEE 802.3z):2. Network Layer and Transport Layer: Point -to Pont Networks, Introduction to InternetProtocol, IP Datagram, IP Addressing, routing, IP packet, IP address, IPv4 & IPv6. CongestionControl & Quality of services (QoS) –Congestion Control in TCP & Frame Relay Network;QOS; Flow Characteristics; Technique to improve Congestion Control; Scheduling; trafficshaping, Transport layer Protocols: TCP functions, segments and connections. UDP, TCP versesUDP.3. Wide Area Networks: Introduction to WAN, WAN technologies: SONET/SDH, ATM: ATMcell, layered architecture, ATM signaling, addressing and applications. Frame Relay TechnologyOverview and Standards. ISDN & B-ISDN: Technology Overview, Interfaces and Channels,Layered Protocol architecture and Frame Format.4. Internet Suite of Protocols: Application Layer: Introduction to application layer andprotocols, WWW, HTTP, DNS. E-Mail and protocols: SMTP, IMAP and MIME. File transferprotocols: FTP and TFTP. Network management protocol: SNMP. Voice over IP (VoIP).5. Network Management and Security: Simple Network Management Protocol (SNNP). DataEncryption & Cryptographic techniques. Firewalls: types, architecture and applications, VLANs: architecture and applications, Internet Security protocol (IPsec).1. Text Book:- Tanenbaum Andrew S., “Computer Networks”, 4th Edition, PearsonEducation/Prentice Hall of India, 2003.REFERENCE BOOKS1. Forouzan Behrouz A, “Data Communications and Networking”, Tata McGraw Hill.2. Stallings William, “Data and Computer Communication”, 5th Edition, Prentice Hall ofIndia, 1997.3. Fred Halsall, “Data Communications, Computer Networks and Open Systems”, 4thedition, Addison Wesley, Low Price Edition, 2000.4. Tittel E. D., “Computer Networking”, Tata McGraw Hill, 200210

5. Comer D. E., “Internetworking with TCP/IP”, Volume 1, 3rd Edition, Prentice Hall ofIndia, 1995.11

MCA-106AWEB DEVELOPMENTLTP400Cr51. HYPERTEXT MARKUP LANGUAGE:Plugin‟s and Helper Application,XML andXHTML, The Anatomy of HTML, Structure and other semantic elements of HTML 4.1,HTML5: HTML responsive, HTML entities, HTML 5 canvas, HTML API, HTML5 Data location.2. Power of CSS: CSS Introduction, Syntax and different CSS properties, CSS3: RoundedCorner, border images, CSS3 transitions and animations, CSS3 multiple columns, CSS3 boxsizing, Responsive Web Designing: Introduction, viewport, Grid View, Media Query: add abreakpoint, including breakpoint, orientation, Bootstrap3.3. CLIENT SIDEPROGRAMMING: Introduction to JavaScript syntax: output, Comments,variables, functions, operators, conditions, switch, loop; JavaScript event handling, objects andfunctions, J Query: Introduction, Selectors, J Query Events and Effects, J Query HTML.4. SERVER SIDE PROGRAMMING: Basics of PHP: Installation, syntax, variables, output,data types,operators, conditional loop i.e. if-else, switch; while loop, for loop, multidimensionalarrays, Predefined PHP Functions and creating user defined functions; PHP form handling anddatabase connectivity; Managing Sessions: Using Session Variables, Destroying a Session;Cookies: Storing Data in Cookies , Setting Cookies.5. AJAX and My SQL: Introduction to AJAX, AJAX Request and Response, AJAX Events,MySQL Introduction, Installation, SQL Syntax: Where, And, OR, Update, Delete, SQL Joins,Create DB, Create Table, SQL Keys, SQL Functions: Avg, Count, Max, Min, Sum, Group By,UCase, LCase, AJAX and PHP.Textbook:Uttam K. Roy, “Web Technology”, Oxford PublicationReferences:1. Musciano Chuck, “HTML & XHTML: The Definitive Guide”, Bill Kennedy, 4th Edition,20002. Holzner Steven, “XHTML Black Book”, Paraglyph Press, 20003. Uttam K. Roy, “Web Technology”, Oxford Publication4. Kamal Raj, “Internet and Web Technologies”, Tata McGraw Hill, 20025. GodboleAchyut S. and KahateAtul, “Web Technologies, Tata McGraw Hill, 20036. Roger S. Pressman,David Lowe, “Web Engineering”.Tata McGraw Hill Publication, 200712

MCA-108 AL T PCr40 04DATA STRUCTURES AND ITS APPLICATIONSOBJECTIVETo relay the theoretical and practical fundamental knowledge of most commonly used algorithmsand data structurePRE-REQUISITES: Knowledge of basic computer programmingSYLLABUS1. INTRODUCTION TO DATA STRUCTURES AND TIME COMPLEXITY: Definitionof data structures and abstract data types; linear vs. non-linear data types; Static and Dynamicimplementations; Arrays; 2; Examples and real life applications. Time Complexity;Asymptotic Notations; Running Times; Best Case; Worst Case; Average Case; Introductionto Recursion.2. STACKS AND QUEUES: The Stacks: Definition; Array based implementation of stacks;Examples: Infix; postfix; prefix representation; Conversions; Applications; definition ofQueues; Circular Queue; Array based implementation of Queues.3. LINKED LISTS: Lists; different types of linked lists; Linked List implementation of stacksand queues; Implementation of Singly linked Lists and Circular Linked List; Applications;4. TREES AND GRAPHS:: Definition of trees and Binary trees; Properties of Binary treesand Implementation; Binary Traversal pre-order; post order; In- order traversal; BinarySearch Trees; Implementations. Definition of Undirected and Directed Graphs; The Arraybased implementation of graphs; Adjacency matrix; path matrix implementation; The LinkedList representation of graphs; Graph Traversal – Breadth first Traversal; Depth firstTraversal;5. SORTING AND SEARCHING: Introduction; selection; insertions; bubble sort; Efficiencyof above algorithms; Shell sort; Merge sort; Quick sort; Heap sort, Searching Algorithms:Straight Sequential Search; Binary Search (recursive & non–recursive Algorithms).TEXT BOOKA.K. Sharma – Data structure Using C, 2nd edition pearson 2013Langsam, Augentem M.J. and Tenenbaum A. M., ―Data Structures using C & C ‖,Prentice Hall of India, 2009.REFERENCE BOOKS1. Aho A. V., Hopcroft J. E. and Ullman T. D., ―Data Structures and Algorithms‖, OriginalEdition, Addison-Wesley, Low Priced Edition, 1983.2. Horowitz Ellis and S ahni S artaj, ―Fundamentals of Data Structures‖, Addison-Wesley Pub,1984.3. Horowitz, S ahni and Rajasekaran, ―Fundamentals of Computer Algorithms‖ 2007.4. Kruse Robert, ―Data Structures and Program Design in C‖, Prentice Hall of India, 19945. Lipschetz Jr. Seymour, ―Theory & Problems of Data Structures‖, S chaum „s Outline, TataMcGraw Hill13

6. Weiss Mark Allen, ―Data Structures and Algorithms Analysis in C‖, Pearson Education,20007. Corm en T . H . et al., ―Introduction to Algorithms‖, 2nd Edition, Prentice Hall of India,2001.8. Dasgupta Sanjay, Christos P. and Vazirani Umesh, ―Algorithms‖, Tata McGraw Hill, 200814

EN-105 ATECHNICAL COMMUNICATIONLTPCr3003Objective : The subject aims to strengthen the communication ability of the students, to nurturetheir business communication and presentation skills, leading to their holistic personalitydevelopment and overall assisting them in developing managerial capacity.UNIT 1: Communication skills& Vocabulary BuildingNature and significance of communication, Types of communication,Barriers of CommunicationReading, Writing , Speaking and Listening Skills.A Selected list of Homophones, Foreign words & Business TermsUNIT 2: Effective Communication & Personality DevelopmentFluency Enhancement Game/Activities.Team Building skill, Leadership skill development. Bodylanguage in GD; Types of GD. Mock Group Discussion. Expressing opinions & disagreements;GD in the selection process; Creative Brainstorming,Self introduction in front of the Interviewboard; Public speaking tips; Humorous speechUNIT3: Internal Communication&Technology in Education:- Meeting- Need and importance ofMeeting. Role of the chairperson.; Agenda; Minutes; Notice; Memo; Memorandum; Circular,Role of the chairperson, Role of the Participants.Fusion of Management, Nature of participation in different group activities, seminars,conferences and workshops, Technology and communication.UNIT 4: Employment & Business Related DevelopmentCV & Job application; Covering letter; Inquiry, Order, Credit and Status enquiry; Complaints,Claims, Adjustment and Collection letterUNIT 5: Corporate communication & FacingInterviews:- Public Relations(PR); Tools of PR;External and Internal Measures of PR,Tools of presentation, oral presentation skill, removal ofstage fear. Activities based on PowerPoint Presentation, process of interview andbody languagein an interview.TEXT BOOKS:1. Pal Rajender, Korlahalli,”Essentials of Business Communications” S.Chand and Sons.2. Lesikar,Pedit,”Business Communication and Managerial skills, All India Book Travellers.3. T.N. CHHABRA, “ Business Communication concepts and skills, Sun India Publications.REFERENCE BOOKS:1.Flatley,Lesikar” Basic Business Communication skills for empowering the internetgeneration”, All India Traveller booksellers2.Hewing Martin, “Advanced Business Communication “, Cambridge University Press15

MCA-151AA Computer programming LabL-T-P0-0-2List of ExperimentsSEQUENTIAL CONTROL STATEMENTS12345678910Write a program to Print HELLOWrite a program to add two numbersWrite a program to calculate simple interestWrite a program to calculate average of three numbersWrite a program to swap two numbersWrite a program to illustrate mixed data typesWrite a program to calculate area and circumfrence of circleWrite a program to evaluate a polynomial expressionWrite a program to add digits of a four digit numberWrite a program to check whether the person if eligible for voting or notCONDITIONAL CONTROL STATEMENTS1112131415Write a program to find gratest of two numbersWrite a program to find out which type of triangle it isWrite a program to find out greatest of three numbersWrite a program to evaluate performance of the studentWrite a program to make a basic calculatorLOOP CONTROL STATEMENTS16171819Write a program to print fibonacci upto the given limitWrite a program to find the sum of digits of a numberWrite a program to find factorial of a numberWrite a program to print table of any numberARRAYS AND STRINGS20Write a program to enter the elements in a one dimensional array16CR2

212223242526272829Write a program to find the sum and average of five numbersWrite a program to sort the array elementsWrite a program to enter the marks of 50 students an calculate the averageWrite a program to add 2 matrixWrite a program to multiply 2 matricesWrite a program to calculate the length of stringWrite a program to concatenate 2 stringsWrite a program to reverse the stringWrite a program to count the numbers of characters in a string30Write a program that converts lower case characters to upper case31 Write a program without using predefined functions to check weather the string ispalindrome or notFUNCTIONS323334353637Write a program using function to find the largest of three numbersWrite a program using function to swap two numbers using call by valueWrite a program using function to swap two numbers using call by refrenceWrite a program using function to sum the digits of a numberWrite a program to calculate factorial of a number using recursive functionWrite a program to print first n fibonacci using recursive functionPOINTERS383940Write a program to illustrate the concept of chain of pointersWrie a program to calculate the area and perimeter of circle using pointersWrie a program to find largest of three numbersSTRUCTURES4142Write a program to read an employee record using structure and print itWrite a program to prepare salary chart of employee using array of structuresFILE HANDLING43. Write a program to Create a file and store text and display the contents17

MCA-158 ALTPCr0032DATA STRUCTURE AND ITS APPLICATION LABLIST OF EXPERIMENTS1. Search an element in a two-dimensional array using linear search.2. Using iteration and recursion concepts write programs for finding the element in thearray using Binary Search Method3. Inserting & deleting an element in the array4. Tower of Hanoi problem using recursion5. Perform following operations on matrices using functions onlya) Addition b) Subtraction c) Multiplicationd) Transpose6. Static & dynamic Implementation of stack ( push & pop operation)7. Implementation of Circular queue (insert & delelte operation)8. Create a linear linked list & perform operations such as insert, delete, update,reverse in the link list9. Create a circular linked list & perform operations such as insert, delete10. Implement binary search tree. (Insertion and Deletion in Binary Search Tree)11. Simulates the various tree traversal algorithms12. Implementation Bubble, Insertion & selection sort.13. Implementation of quick sort14. Implementation of merge sort15. Implementation of heap sort16. Simulate various graph traversing algorithms.REFERENCE BOOKS1. A.K. Sharma – Data structure Using C, 2nd edition pearson 20132. R. S. Salaria -Data Structure Using C3. Kruse Robert, ―Data Structures and Program Design in C‖, Prentice Hall of India,19944. Lipschitz Jr. Seymour, ―Theory & Problems of Data Structures‖, Schaum„s Outline, 2ndEdition, Tata McGraw Hill18

MCA-156 AWeb Development LabLTPCr0032List of ExperimentHTMLIaIbIcIdSimple HTMLHyper LinksUsing FramesRegistration Form with TableCSSII aIII aIII bIII cIII dIII eInline Style , Internal Style ,and external Style SheetsJAVA SCRIPTUse user defined function to get array of values and sort them in ascendingorderDemonstrate String and Math Object‟s predefined methodsDemonstrate Array Objects and Date Object‟s predefined methodsException HandlingCalendar Creation : Display all monthEvent HandlingIII fVI aVI bVII aVII b Validation of registration form Open a Window from the current window Change color of background at each click of button or refresh of apage Display calendar for the month and year selected from combo box OnMouseover eventXMLCreate a any catalogDisplay the catalog created using CSS and XSLPHPFile operationRegular Expression, Array, Math, Date functions19

MCA-103 ARELATION DATABASE MANAGEMENT SYSTEMLTPCr3003OBJECTIVETo provide knowledge about various organizations and management information systems,keeping in view the aspects of share ability, availability, evolvability and integrityPRE-REQUISITESKnowledge of data structures, discrete mathematical structures1.INTRODUCTION: What is database, Purpose of database system; advantages of usingDBMS; database concept and architecture; data abstraction; data models; instances andschema; data independence; schema architecture; database languages; database administrator;database users2.DATA MODELING: Entity sets attributes and keys, relationships (ER); database modelingusing entity; type role and structural constraints, weak and strong entity types; enhancedentity-relationship (EER), ER diagram design of an E-R database schema; specialization andgeneralization3.RELATIONAL MODEL: Relational model: relational model -basic concepts, enforcingdata integrity constraints, Relational algebra: introduction, Selection and projection, setoperations, renaming, Joins, Division, syntax, semantics. Operators; extended relationalalgebra operations, Calculus: Tuple relational calculus, Domain relational Calculus; Codd'srules.4.DATABASE DESIGN AND SQL: Database design process; relational database design,anomalies in a database; functional dependencies membership and minimal covers normalforms, multi-valued dependencies, join dependencies, inclusion dependencies; reduction ofan E-R schema to tables; effect of de-normalization on database performance, Query-byexample (QBE), Introduction to SQL, basic queries in SQL, advanced queries in SQL,functions in SQL; basic data retrieval, aggregation, categorization, updates in SQLs; views inSQL.TRANSACTION PROCESSING: Desirable properties of transactions, implementation ofatomicity and durability; reconsistent model, read only and write only model; concurrentexecutions, schedules and recoverability; serializability of schedules concurrency control;serializability algorithms; testing for serializability; precedence graph; concurrency control,deadlock handling - detection and resolution.TEXT BOOK5.Silberschatz A., Korth H. F. and Sudarshan S., “Database System Concepts”,6th edition,McGraw-Hill, International Edition,201020

Steven Feuerstein, Bill Pribyl , “Oracle PL/SQL”, O'Reilly Media , 4th Edition, 2005REFERENCE BOOKS1. Desai Bipin, “Introduction to Database Management System”, Galgotia Publications,19912. Elmasri R. and Navathe S. B., “Fundamentals of Database Systems”, 6th edition,Addison-Wesley, Low Priced Edition, 20103. Date C. J., “An Introduction to Database Systems”, 8th edition, Addison-Wesley, LowPriced Edition, 20034. Date C. J. and Darwen H., “A Guide to the SQL Standard”, 4th edition, Addison-Wesley,20035. Hansen G. W. and Hansen J. V., “Database Management and Design”, 2nd edition,Prentice- Hall of India, Eastern Economy Edition, 19996. Majumdar A. K. and Bhattacharyya P., “Database Management Systems”, 5th edition,Tata McGraw- Hill Publishing, 19997. Looms, “Data Management & File Structure”, Prentice Hall of India, 198921

MCA-105 ALTPCr4004OBJECT ORIENTED PROGRAMMING USING C OBJECTIVE: Providing a sound conceptual understanding of the fundamental concepts ofcomputing hardware, software, networking and services; build programming logic and therebydeveloping skills in problem solving using C programming language; Introduce theconcept of object orientation and on how to handle data in different forms; Emphasize theconcepts and constructs rather than on language features.1.2.3.4.5.OBJECT ORIENTED CONCEPTS& INTRODUCTION TO C : Introduction toobjects and object oriented programming, difference between procedure oriented & Objectoriented programming; main feature of Object oriented programming: Class, Object,encapsulation (information hiding); Polymorphism: overloading, inheritance, overridingmethods, abstract classes, access modifiers: controlling access to a class; method, or variable(public, protected, private, package); other modifiers; Basics of C ,Simple C Programs,preprocessors directives, Namespace, Memory management operators in C , Inlinefunction, default arguments, & reference typesCLASSES AND DATA ABSTRACTION: Introduction; structuredefinitions;accessing members of structures; class scope and accessing class members; separatinginterface from implementation; controlling access function and utility functions, initializingclass objects: constructors, usingdefault arguments with constructors; usingdestructors; classes : const(constant) object and const member functions, objectas member of classes, friend function and friend classes; using this pointer, dynamicmemory allocation with new and delete; static class members& function; containerclasses and integrators;.OPERATOR OVERLOADING, TEMPLATE &EXCETION HANDLING:Introduction; fundamentals of operator overloading; restrictions on operators overloading;operator functions as class members vs. as friend functions; overloading, ; overloadingunary operators; overloading binary operators. Function templates; overloading templatefunctions; class template; class templates and non- type parameters; basics of C exception handling: try, throw, catch, throwing an exception, catching an exception, rethrowing an exceptionINHERITANCE, VIRTUAL FUNCTIONS AND POLYMORPHISM: Introduction,inheritance: base classes and derived classes, protected members; casting base-class pointersto derived-class pointers; using member functions; overriding base–class members in aderived class; public, protectedandprivate inheritance;usingconstructorsand destructors in derived classes; implicit derived–class object to base-class objectconversion; composition vs. inheritance; virtual functions; abstract base classes andconcrete classes; polymorphism; new classes and dynamic binding;virtual destructors;polymorphism; dynamic binding.FILES AND I/O STREAMS: Files a

3 MCA-107 A Computer Organization and Architecture 3-0-0 3 . INTRODUCTION TO COMPUTER SYSTEM: Computer Fundamentals: Definition, Block Diagram along with Computer components, Characteristics & classification of . Application Programming in C by RS S

Related Documents:

This handbook supplement applies to students entering the fourth year of their degree in Computer Science, Mathematics & Computer Science or Computer Science . Undergraduate Course Handbook 1.2 Mathematics & Computer Science The Department of Computer Science offers the following joint degrees with the Department of Mathematics: BA .

The brochure is a summary of the UKZN Medical Scheme 2019 benefits, pending approval from the Council for Medical Schemes. A copy of the Scheme Rules can be downloaded from the Scheme website www.discovery.co.za This brochure gives you a brief outline of the benefits, UKZN Medical Scheme offers. This does not replace the Scheme Rules.

CSEC English A Specimen Papers and Mark Schemes: Paper 01 92 Mark Scheme 107 Paper 02 108 Mark Scheme 131 Paper 032 146 Mark Scheme 154 CSEC English B Specimen Papers and Mark Schemes: Paper 01 159 Mark Scheme 178 Paper 02 180 Mark Scheme 197 Paper 032 232 Mark Scheme 240 CSEC English A Subject Reports: January 2004 June 2004

This scheme of work provides ideas about how to construct and deliver the Cambridge IGCSE Computer Science course. The syllabus for Cambridge IGCSE Computer Science (0478) has been broken down and the scheme of work contains ten units with suggested teaching activities and lea

Trends in the State of Computer Science in U.S. K-12 Schools 2016 Table of Contents Executive Summary 3 Introduction 5 Value of Computer Science in Schools 6 Opportunities to Learn Computer Science 9 Perceptions of Computer Science 14 Challenges and Opportunities for Computer Science in K-12

Introduction to Computer Science I Course Overview Computer Science 111 Boston University Welcome to CS 111! Computer science is not so much the science of computers as it is the science of solving pro

Computer Science Teachers Association, Cyber Innovation Center, and National Math and Science Initiative have answered the call by organizing states, districts, and the computer science education community to develop conceptual guidelines for computer science education. The K-12 Computer Science Framework was developed for -12 Computer Science

Introduction to Science Section 2 The Branches of Science, continued The branches of science work together. -biological science: the science of living things botany, ecology -physical science: the science of matter and energy chemistry: the science of matter and its changes physics: the science of forces and energy -earth science: the science of the Earth, the