BCA Garware College Syllabus 2024-2025 PDF

Maharashtra Education Society’s Abasaheb Garware College (Autonomous) (Affiliated to Savitribai Phule Pune University) Three Year B.C.A. Degree Program in Computer Applications (Faculty of Science and Technology) F.Y.B.C.A. (Science...

Maharashtra Education Society’s Abasaheb Garware College (Autonomous) (Affiliated to Savitribai Phule Pune University) Three Year B.C.A. Degree Program in Computer Applications (Faculty of Science and Technology) F.Y.B.C.A. (Science) Choice Based Credit System Syllabus To be implemented from Academic Year 2024-2025  Structure of the major for Course: B.C.A (Science) Course Year Semester Course Code Course Title Remark Credit No. of hours Type Problem Solving using CA-111-TH Computer and C 2 30 Major Programming Practical based on C CA-112-PR 2 programming Principle of Digital ELC-113-TH 2 30 Electronics I Practical based on Principle ELC-114-PR 2 4 per batch of Digital Electronics Minor Foundation course in 4 per MTC-113-TH 2 30 Mathematics batch Practical based on MTC-114-PR Foundation course in 2 4 per batch Mathematics 1 SEC SEC-101-CA Basics of Web Designing 1+1 15 +Practical CA-161-TH Advanced C Programming 2 30 Major Practical based on Advanced CA-162-PR 2 4 per batch C Programming Sequential Circuits and ELC-163-TH 2 30 Computer Organization Practical based on ELC-164-PR Sequential circuits and 2 4 per batch II Computer Organization Minor Data Representation and MTC-163-TH 2 30 visualization Practical based on Data MTC-164-PR Representation and 2 4 per batch visualization Database Management SEC SEC-151-CA 1+1 15 +Practical System CA-201-MJ Data Structures using C 2 30 Relational Database Major CA-202-MJ 2 30 Management Systems Practical Based on Data CA-204-MJP 2 4 per batch Structures and RDBMS Introduction to Internet of ELC-203-MN things and Embedded 2 30 systems Practical Based on Introduction to Internet of III Minor ELC-204-MNP 2 4 per batch things and Embedded 2 systems MTC-201-MN Discrete Mathematics 2 30 Practical Based on Discrete MTC-202-MNP 2 4 per batch Mathematics VSC CA-222-VSC Python Programming 1+1 15 +Practical FP FP-231-CA Project on Web designing Computing Science in IKS CA-200-IKS 2 30 Ancient India CA-251-MJ Web Technology – I 2 30 IV Major CA-252-MJ Software Engineering 2 30  Practical Based on Web CA-254-MJP 2 4 per batch Technology I Microcontroller ELC-253-MN Architecture and 2 30 Programming Practical Based on Microcontroller Minor ELC-254-MNP 2 4 per batch Architecture and Programming MTC-253-MN Matrix algebra 2 30 Practical Based on Matrix MTC-254-MNP 2 4 per batch algebra VSC CA-272-VSC Computer Networks 2 30 Project on Software CEP CA-281-CEP Engineering SEC SEC-262-CA Advanced Excel 1+1 15 +Practical CA-301-MJ Operating Systems 2 30 CA-302-MJ Web Technology – II 2 30 CA-303-MJ Artificial Intelligence 2 30 Major Fundamentals of Data CA-304-MJ 2 30 Core Science Practical Based on CA-305-MJP 2 4 per batch Operating Systems Practical Based Web CA-306-MJP 2 4 per batch Technology II V Object Oriented CA-311-MJ 2 30 Major Programming – I Elective Practical Based on Object CA-312-MJP 2 4 per batch Oriented Programming I ELC-302-MN Embedded system Design 2 30 Minor Numerical Techniques for MTC-302-MN 2 30 Computer Science 3 VSC CA-321-VSC Network Security 2 30 FP CA-331-FP Project CA-351-MJ Mobile Technology 2 30 CA-352-MJ Software Testing and Tools 2 30 Software Project CA-353-MJ 2 30 Major Management Core CA-354-MJ Data Analytics 2 30 Practical Based on Mobile CA-355-MJP 2 4 per batch Technology VI Practical-Based Software CA-356-MJP 2 4 per batch Testing and Tools Object Oriented CA-361-MJ 2 30 Major Programming II Elective Practical Based on Object CA-362-MJP 2 4 per batch Oriented Programming II VSC CA-371-VSC Cloud Computing 2 30 OJT CA-381-OJT On Job Training 4  CA-111-TH: Problem Solving using Computer and C Programming Lectures: 30 (Credits-2) Prerequisites: None Course Objectives: 1. To introduce the foundations of computing, programming and problem- solving using computers. 2. To develop the ability to analyze a problem and devise an algorithm to solve it. 3. To develop the basic concepts and terminology of programming in general. 4. To implement algorithms in C. 5. To test, debug and execute programs. Learning Outcomes: On completion of this course, students will be able to: 1. Explore algorithmic approaches to problem solving. 2. Develop modular programs using control structures and arrays in C. Unit 1: Problem solving and C programming 08 1.1 Problem solving using Computers 1.2 Programming Languages as tools, types of languages 1.3 Algorithms-definition, characteristics, examples, advantages and limitations 1.4 Flow charts - definition, notations, examples, advantages and limitations, Comparison with algorithms 1.5 Structure and example of first C program 1.6 Compilation process (compilers, interpreters) 1.7 Character set, Keywords, Identifiers 1.8 Variables, Constants (character, integer, float, string, escape sequences, enumeration, constant) 1.9 Data Types (Built-in and user defined data types) 1.10 Operators, Expressions, Types of operators 1.11 Arithmetic operators, Increment Decrement operators, Relational and logical operators, Bitwise operators, Assignment operators, Comma operator, size of operator, conditional operator, Operator precedence and Order of evaluation 1.12 Formatted input and output, format specifiers Unit 2: Control Structures 07 2.1 Decision making structures: if, if-else, else-if ladder, switch 2.2 Loop control structures - while, do while, for 2.3 Use of break and continue 2.4 Nested control structures 2.5 Unconditional branching (goto statement) Unit 3: Functions 07 3.1 Function definition, Types of functions (Standard library and User defined functions) 3.2 Function parameters/arguments (Actual, Formal) 3.3 Parameter passing method (by value), return statement 3.4 Recursive functions 3.5 Scope of variables and Storage classes Unit 4: Arrays 08 4.1 Concept of array, advantages, disadvantages 4.2 Types of Arrays – One, Two dimensional array 4.3 Array Operations - declaration, initialization, accessing array elements 4.4 Memory representation of two-dimensional array (row major and column major) 4.5 Passing arrays to function 4.6 Array applications - Linear search, sorting an array (bubble sort) Reference Books: 1. A Structured Programming Approach Using C, Behrouz A. Forouzan, Richard F. Gilberg, Cengage Learning India 2. Programming in ANSI C, E. Balagurusamy, 7th Edition, McGraw Hill 3. Programming in ANSI C, Ram Kumar and Rakesh Agrawal 4. The ‘C’ programming language, Brian Kernighan, Dennis Ritchie, PHI  CA-112-PR: Practical based on C programming No. of Sessions: 15 (Credits-2) Assignments of C Programming: 1. Assignment on use of data types, simple operators (expressions) 2. Assignment on decision making statements (if and if-else, nested structures) 3. Assignment on decision making statements (switch case) 4. Assignment on use of while loops 5. Assignment on use of for loops 6. Assignment on nested loops 7. Assignment on writing C programs in modular way (use of user defined functions) 8. Assignment on recursive functions 9. Assignment on use of arrays (1-D array) and functions 10. Assignment on use of multidimensional array (2-D arrays) and functions  ELC-113-TH: Principle of Digital Electronics Lectures: 30 (Credits-2) Prerequisites: None Course Objectives: 1. To learn number systems and their representation. 2. To understand basic logic gates, Boolean algebra and K-maps. 3. To understand combinational and sequential circuits. 4. To provide a broad overview of architecture and functioning of computer systems 5. To study arithmetic circuits, combinational and sequential circuits. Learning Outcomes: On completion of this course, students will be able to: 1. To get familiar with concepts of digital electronics. 2. Design of combinational circuits. 3. To study simple digital circuits. 4. To know the digital techniques of simplifying the circuits. Unit 1: Data representation and Computers Arithmetic 10 1.1 Review of Decimal, Binary, Octal, Hexadecimal Number system and their inter- conversion, 1.2 BCD code, Gray code, ASCII, Concept of parity code. 1.3 Signed and Unsigned numbers, 1’s and 2’s complement of binary numbers, Binary arithmetic (Addition, subtraction and subtraction using 1’s complement and 2’s complement). Unit 2: Boolean Algebra & Logic Gates 10 2.1 Introduction, Logic (AND OR NOT), 2.2 Boolean theorems, Boolean Laws, De Morgan’s Theorem, Reduction of Logic expression using Boolean Algebra, Deriving Boolean expression from given circuit, exclusive OR and Exclusive NOR gates, Universal Logic gates, Implementation of other gates using universal gates. 2.3 Reduction technique using Karnaugh maps – 2/3/4 variable K-maps, grouping of variables in K-maps, K-maps for product of sum form, minimize Boolean expression using K-map and obtain K-map from Boolean expression. Unit 3: Combinational Circuits 10 3.1 Half adder and full adder, 4-Bit Universal adder/ Subtractor, Applications of Ex-OR gates as parity checker and generator. 3.2 Study of Multiplexer (4:1) and Demultiplexer (1:4), Encoders - Decimal/ BCD or binary, Decoder- BCD to seven segment decoder, IC 74138 and IC 7447, Digital comparator. Reference Books 1. Digital Fundamentals: Floyd T.M., Jain R.P., Pearson Education. 2. Digital Electronics: Jain R.P., Tata McGraw Hill. 3. Digital Principles and Applications: Malvino Leach, Tata McGraw-Hill.  ELC-114-PR: Practical based on Principle of Digital Electronics No. of Sessions: 15 (Credits-2) List of Practical: 1. Study of Logic Gates (Verification of Truth tables). Knowing the various IC numbers and internal structure. 2. Study of Binary to Gray & Gray to Binary Converter (K- Map based design). 3. Study of Half Adder and Full Adder using Logic Gates. 4. Study of nibble adder/ subtractor. 5. Use of Ex-OR as a 4-bit Parity Checker and Generator circuits. 6. Study of Multiplexer and Demultiplexer (4:1 & 1:4). 7. Study of BCD to Seven Segment Display using IC 74138 and IC 7447. 8. Study of Decimal/ BCD or binary encoder.  MTC-113-TH: Foundation course in Mathematics Lectures: 30 (Credits-2) Course Objectives: 1. To introduce the basics of Set Theory, relations and functions 2. To study and implement important concepts of Mathematics which are widely used in various day to day problems. 3. To apply the concepts to Computer Science. Learning Outcomes: On completion of this course, students will be able to: 1. Student will understand and implement important concepts of Mathematics which are widely used in various day to day problems. 2. Students will learn to apply the concepts to Computer Science. Unit 1: An Introduction to Sets 06 1.1 Sets – Set theory, Need for sets, Representations of sets, cardinality of a set, Ordered sets 1.2 Operations on Sets – Union, Intersection, Complement, Difference of two sets, Product of two sets, Set identities 1.3 Types of sets – Finite, Infinite, Countable sets, Power set Unit 2: Relations 10 2.1 Relation- definition, properties, representing relation as a digraph and matrix. 2.2 Types of relations – Reflexive, Symmetric, transitive and antisymmetric relations 2.3 Equivalence relations – definition and properties, partition of a set 2.4 Partial order – definition, properties. Hasse diagram. Chains and antichains. Unit 3: Functions 08 1.1 Definition, properties 1.2 Types of functions – Injective, Surjective, Bijective functions, Inverse of a function 1.3 Operations on functions – addition, multiplication, composition Unit 4: Counting 04 4.1 Basics of counting- Rules of Sum and Product 4.2 Basic permutations and combinations Text Book: Kenneth Rosen, Discrete Mathematics and its applications, Tata McGraw Hill, Seventh Edition.  MTC-114-PR: Practical based on Foundation course in Mathematics No. of Sessions: 15 Credits-2) List of Practical Practical 1: Assignment based on sets, set representation and types of sets Practical 2: Assignment on operations on sets Practical 3: Assignment on relations, representations of relations, equivalence relation Practical 4: Assignment on partial orders Practical 5: Assignment on functions, operations on functions Practical 6: Assignment on Injective, surjective, bijective functions Practical 7: Assignment on combinatorics – sum and product rules Practical 8: Assignment on permutation and combinations Practical 9: Assignment based on Units 1 and 2 Practical 10: Assignment based on Units 3 and 4  SEC-111-CA: Basics of Web Designing Lectures: 15 + Practical (Credits-2) Prerequisites: None Course Objectives: 1. To learn basic HTML tags. 2. To design static Webpage. 3. To define styles for web pages using CSS. 4. To create a dynamic and interactive web page using Javascript Learning Outcomes: On completion of this course, students will be able to: 1. Design a page using basic HTML tags. 2. Build simple static Web application. 3. Define different styles for HTML tags. 4. Understand scripting language which helps to develop interactive webpage. Unit 1: HTML 08 1.1 Introduction to HTML, Structure of HTML 1.2 HTML tags, attributes and HTML comment 1.3 HTML formatting tags 1.4 Headings, Paragraph 1.5 Ways to define color – Plain color, RGB, Hex value, HSL value 1.6 Inserting an Image 1.7 List 1.8 Tables 1.9 Hyperlinks and Image links 1.10 Frames and iFrame Unit 2: HTML form designing and HTML 5 06 2.1 Inserting text box, text area, buttons, List box, radio, checkbox 2.2 Designing of Forms 2.3 GET and POST methods 2.4 Designing form using HTML 5 input tags Unit3: CSS 08 3.1 Introduction to Style Sheet 3.2 Ways to apply CSS to HTML 3.3 CSS Border, margin, positioning, color, text, link, background, list, table, padding,image, display properties, z-index, opacity 3.4 Use of Id and classes in CSS 3.5 Use of and 3.6 Introduction of CSS3: Gradients, Transitions, Animations, multiple columns 3.7 Introduction to Bootstrap 3.8 Bootstrap Tables, Images, Buttons Unit 4: Javascript and Jquery 08 4.1 Concept of script 4.2 Introduction to Javascript  4.3 Variables, identifiers and operators, control structures 4.4 Functions 4.5 Event Handling in Javascript 4.6 Math and date object 4.7 String object and predefined String functions 4.8 DOM concept in Javascript, DOM objects 4.9 Validations in Javascript 4.10 Jquery library 4.11 Including jquery library in page Jquery selector 4.12 DOM manipulation using Jquery Reference Books 2. HTML Black Book by Steven Holzner, Dremtech press. 3. The Complete Reference by Thomas A. Powell, Mc Graw Hill 4. https://getbootstrap.com/ Practical Assignments: 1. HTML Tags - headings, paragraphs, line break, colors, fonts, links, Images, List, tables and Frames 2. Creating forms by using HTML and HTML5 Tags 3. Styling HTML pages using CSS 4. Assignment on bootstrap 5. Assignment on Javascript 6. Assignment on jquery  Semester - II CA-161-TH: Advanced C Programming Lectures: 30 (Credits-2) Prerequisites:  Basic knowledge of C language. Course Objectives: 1. To study advanced concepts of programming using the C language. 2. To understand code organization with complex data types and structures. 3. To work with files. Learning Outcomes: On completion of this course, students will be able to: 1. Develop modular programs using control structures, pointers, arrays, strings and structures. 2. Design and develop solutions to real world problems using C. Unit 1: Pointer 08 1.1 Introduction to Pointer 1.2 Declaration, definition, initialization, dereferencing 1.3 Pointer arithmetic 1.4 Relationship between Arrays & Pointers- Pointer to array, Array of pointers. 1.5 Multiple indirection (pointer to pointer) 1.6 Functions and pointers- Passing pointer to function, returning pointer from function, function pointer 1.7 Dynamic memory management- Allocation(malloc(), calloc()), Resizing (realloc()), Releasing(free()), Memory leak, dangling pointers Unit 2: String 05 2.1 Definition, declaration, initialization 2.2 Predefined string functions 2.3 Array of strings 2.4 Strings and Pointers 2.5 Command line arguments Unit 3: Structures and Unions 07 3.1 Concept of structure, definition and initialization, use of typedef 3.2 Accessing structure members 3.3 Nested Structures 3.4 Arrays of Structures 3.5 Structures and functions- Passing each member of structure as a separate argument, passing structure by value / address 3.6 Pointers and structures. 3.7 Self-referential structure and its application 3.8 Concept of Union, declaration, definition, accessing union members 3.9 Difference between structures and union Unit 4: File Handling and Preprocessor 10 4.1 Introduction to streams 4.2 Types of files  4.3 Operations on text files 4.4 Standard library input/output functions 4.5 Random access to files 4.6 Role of Preprocessor 4.7 Format of preprocessor directive 4.8 File inclusion directives (#include) 4.9 Macro substitution directive, argumented and nested macro 4.10 Macros versus functions Reference Books 1. Programming in ANSI C, E. Balagurusamy, 7th Edition, McGraw Hill 2. The ‘C’ programming language, Brian Kernighan, Dennis Ritchie, PHI 3. Programming in C ,A Practical Approach, Ajay Mittal, Pearson 4. Problem Solving and Programming Concept, Maureen Sprankle, 7th Edition, Pearson Publication  CA-162-PR: Practical based on Advanced C Programming No. of Sessions: 15 (Credits-2) Assignments of Advanced C: 1. To demonstrate use of pointers 2. To demonstrate advanced use of pointers 3. To demonstrate concept of strings, array of strings 4. To demonstrate string operations using pointers 5. To demonstrate command line arguments 6. To demonstrate structures (using array and functions) 7. To demonstrate nested structures and Unions 8. To demonstrate file handling 9. To demonstrate use of preprocessor directives  ELC-163-TH: Sequential Circuits and Computer Organization Lectures: 30 (Credits-2) Prerequisites: None Course Objectives: 1. To provide knowledge of technological and practical aspects of electronics. 2. To familiarize with current and recent technological developments. 3. To learn the basic concepts behind the architecture and organization of computers. Learning Outcomes: On completion of this course, students will be able to: 1. To get familiar with building blocks of sequential circuits. 2. To study the concept of counter and counter circuits. 3. To understand the working of shift register circuits. 4. To learn organization of components of CPU and their way of communication. Unit 1: Sequential circuits 12 1.1 Introduction, S-R flip-flop, D flip-flop, JK flip-flop, Race-around condition, T flip-flop, Application of flip-flops. 1.2 Counters: Introduction, Synchronous counter, Asynchronous counter, Terms related to counters, IC74193 (4-bit binary counter), IC 7490, Analysis of counter circuits. 1.3 Shift Register: Introduction, parallel and serial shift registers, Ring counter, Johnson counter. Unit 2: CPU, Memory and I/O Organization 12 2.1 Block diagram of CPU, functions of CPU, general register organization, flags, Concept of RISC and CISC 2.2 Memory System hierarchy, Cache Memory, Internal Memory, External Memory, Concept of Virtual Memory. 2.3 Input/ Output: types of I/O data transfers - CPU initiated, interrupt initiated and DMA, Need of I/O interfaces, Parallel and serial communication (asynchronous and synchronous data transfer). Unit 3: Introduction to Microprocessors and Microcontrollers 06 3.1 Block diagram of Pentium, Functional units, Concept of pipeline and parallelism Programmers model 3.2 Introduction to Microcontroller Intel 8051 – Functional block diagram, Introduction to multi-core processors. Reference Books: 1. R.P. Jain, “Modern Digital Electronics”, McGraw-Hill Publications 2. Floyd and Jain, “Digital Fundamentals”, Pearson Publication. 3. M. Morris Mano, “Digital computer Design“, 3rd Edition, PHI, New Delhi. 3. A. Antonokous “Introduction to Assembly language programming for Pentium RISC Processor” 4. Mazidia and McKinlay, “The 8051 microcontroller and embedded systems” Pearson Publication ELC-164-PR: Practical based on Sequential circuits and Computer Organization No. of sessions: 15 (Credits-2) List of Practical: 1. Study of RS, clocked RS and D flip flop. 2. Study of Mod 2, Mod 5, Mod 10 counter using IC 7490. 3. Study of Shift register using IC7495. 4. Study of Diode matrix ROM. 5. Study of Mod 16 counter using IC 74193. 6. Study of ring counter using Shift register IC7495. 7. Interfacing of decade counter to Seven Segment Display using IC 7447. 8. Introduction to microcontroller development board Activity: 1. Lecture of Industry person related to syllabus.  MTC-163-TH: Data Representation and Visualization Lectures: 30 (Credits-2) Course Objectives: 1. To introduce methods in descriptive statistics 2. To explain the concept of descriptive statistics for real data 3. To summarize data visually and numerically Learning Outcomes: On completion of this course, students will be able to: 1. Summarize data visually and numerically 2. Analyze a problem, identify methods in descriptive statistics Unit 1: Introduction 08 1.1 Raw data, attributes and variables, discrete and continuous variables. Presentation of data using frequency distribution and cumulative frequency distribution. 1.2 Graphical Presentation of frequency distribution –histogram, stem and leaf chart, less than and more than type ogive curves, bar graph, Pie chart Unit 2: Measures of Central tendency 08 2.1 Measures of Central tendency (for ungrouped data): Mean, Mode, Median. Examples where each one of these is most appropriate. 2.2 Measures of Central tendency (for grouped data): Mean, Mode, Median. Examples where each one of these is most appropriate. 2.3 Partition values: Quartiles, Box-Plot. Unit 3: Measures of dispersion 06 3.1. Measures of Dispersion: Range, Coefficient of range, Quartile deviation, Coefficient of quartile deviation, 3.2. Variance, Standard Deviation, Coefficient of Variation. Unit 4: Bivariate Data 06 4.1 Bivariate data, Scatter diagram. 4.2 Correlation, Positive Correlation, Negative Correlation, Zero Correlation 4.3 Curve fitting – line , parabolic fit Text Book: 1. Fundamentals of Applied Statistics, Gupta and Kapoor, S. Chand and Sons, New Delhi, 2014, Fourth Edition Reference Books: 1. Statistical Methods, G.W. Snedecor, W.G. Cochran, John Wiley & sons, 1991, Eight Edition 2. An Introductory Statistics, Kennedy and Gentle  MTC-164-PR: Practical based on Data Representation and visualization No. of sessions: 15 (Credits-2) Manual problems solving practical 1. Problems based on Unit 1 2. Measures of Central Tendency 3. Measures of Dispersion. 4. Problems on Bivariate data Practical using R software / Excel 5. Introduction to R software / Excel 6. Graphical Presentation of frequency distribution – bar graph, stem and leaf chart, ogive curves 7. Measures of Central Tendency 8. Measures of Dispersion. 9. Bivariate data  SEC-161-CA: Database Management Systems Lectures: 15, Practical sessions: 15 (Credits-2) Prerequisites:  Basic Knowledge of Files  Basics of Set Theory Course Objectives: 1. To understand the fundamental concepts of database 2. To understand user requirements and frame it in data model. 3. To understand creations, manipulation and querying of data in databases. Learning Outcomes: On completion of this course, students will be able to: 1. design data models, schemas and instances 2. design E-R Model for given requirements and convert the same into database tables. 3. implement SQL: Data definition, constraints, schema, queries and operations in SQL Unit 1: Introduction to DBMS 03 1.1 Introduction 1.2 File system Vs DBMS 1.3 Levels of abstraction & data independence 1.4 Structure of DBMS 1.5 Users of DBMS 1.6 Advantages of DBMS Unit 2: Database Design and ER Model 12 2.1 Over view of DB design process 2.2 Conceptual Design using ER data model (entities, attributes, entity sets, relations, relationship sets) 2.3 Constraints (Key constraints, Integrity constraints, referential integrity, unique constraint, Null/Not Null constraint, Domain, Check constraint, Mapping constraints) 2.4 Keys Concept with Examples: Primary Key, Candidate Keys and Super Keys 2.5 Extended features – Specialization, Aggregation, Generalization 2.6 Structure of Relational Databases (concepts of a table) 2.7 DBMS Versus RDBMS 2.8 Examples of E-R Model Unit 3: Basic SQL 07 3.1 Introduction to query languages 3.2 Basic structure 3.3 DDL Commands 3.4 ML Commands 3.5 Forms of a basic SQL query (Expression and strings in SQL) Unit 4: Advanced SQL 08 4.1 Set operations 4.2 Aggregate Operators and functions 4.3 Null value  4.4 Nested Subqueries 4.5 SQL mechanisms for joining relations (inner joins, outer joins and their types) 4.6 Examples on SQL Reference Books 1. Database System Concepts, Henry F. Korth, Abraham Silberschatz, S.Sudarshan,Tata McGraw-Hill Education 2. Database Management Systems, RaghuRamakrishnan, Mcgraw-hill higherEducation 3. Beginning Databases with PostgreSQL: From Novice to Professional, RichardStones, Neil Matthew, Apress 4. Practical Postgresql, By Joshua D. Drake, John C Worsley, O’Reilly Practical Assignments of DBMS: 1. To create simple tables with the primary key constraint (as a table level constraint& as a field level constraint) (include all data types). To create one or more tables with following constraints: Primary Key, Foreign Key Check constraint Unique constraint, Not null constraint. 2. To drop a table, alter schema of a table, insert / update / delete records using tables created in previous Assignments. (Use simple forms of insert / update /delete statements) 3. Write simple queries based on single table using simple form of select statement: Select from table [where order by] Select from table [where group by having order by ] 4. To query table, using set operations (union, intersect) and using nested queries (use of except, exists, not exists, all clauses)  Evaluation Pattern The internal and external evaluation will be 50-50% All the courses, both theory as well as practical, of major and minor are of two credits each. So, total marks will be 50. Out of 25 mars will be allotted for internal evaluation and 25 marks for external evaluation. Theory Courses:  Internal evaluation will be of 25 marks for which 2 continuous evaluation exams will be conducted  External evaluation will be of 25 marks Practical Courses: Internal evaluation will be of 25 marks out of which 10 marks will be for assignment submissions done throughout the semester and a test/viva will be conducted for 15 marks External evaluation will be of 25 marks For Skill Enhancement and Vocational skills, 2 credit course is divided as 1 credit for theory and 1 credit of practical. In that case also internal and external will be of 50-50%. Distribution of 25 internal and 25 external (For total 2 credits) can be decided subject- wise Methods of assessment for internal evaluation: Seminar, objective test, open book test, Quiz, viva, projects, assignments, group discussion, research paper review, case study, industrial visit Passing percentage The student must secure at least 40% marks of that course to earn the full credit. Examination Credits Marks Out of Passing marks (40%) Internal 2 25 10 External 2 25 10 Note: There is separate passing for internal and external examinations.