University of Mumbai B.Sc.

(Computer Science)


S.Y.BSc. (W.E.F. 2004-05)

TERM I = 40.SC. COMPUTER SCIENCE Year II Discrete Mathematics Computer Graphics-I Paper I – Section I Paper I – Section II C++ and JAVA Data structures Paper II – Section I Paper II – Section II GUI and Visual Basic Data Base Management Paper III – Section I Paper III – Section II Total Lectures / Subject = 80 / Year. TERM II = 40 Examination Pattern for II nd Year of B Sc Computer Science Marks of Theory paper per Term = 50 converted to 30 Marks of Practical per paper per Year = 40 converted to 40 Total marks per paper per year will be 30 + 30 + 40 = 100 .B.

Methods of proof. machines and regular languages. Groups and coding – Coding of binary information and error detection Decoding and error correction. properties of relations. 4. Relations and Digraphs – Product sets and partitions. representation of special languages and grammars. Discrete structures by Liu Digital Logic John M Yarbrough Brooks/cole. 8. semi groups. Prentice-Hall of India pvt ltd Discrete Mathematics With Applications. Logic – Propositions and Logical operations. Semi groups . mathematical induction. Abraham Kandel Theodore P. The pigeonhole principle. Thompson Learning Discrete Mathematics and its Applications Kenneth H. paths in relations and digraphs. recurrence relations.Mott. Operations on sets. Schaum’s Outlines Series. manipulation of relations. Transitive closure and Warshalls algorithm. Semi groups and groups – Binary operations. 5. Finite state machines. machines and languages. Counting – Permutations. Seymour Lipschutz. 7. groups. Products and quotients of groups. 3. Sc (Computer Science) SUBJECT: Discrete Mathematics Paper I : Section I Computer Graphics -I Paper I : Section II Periods per week Lecture ( 1 Period = 50 minutes ) Practical Year II 3 3 Hours 3 Marks 50 Evaluation System Theory Examination per Term per Section Practical per year -- 40 SECTION I 1. Division in the integers. Marc Lipson. growth of functions 6. relations and digraphs. permutation functions. Ltd. Baker. Mathematical structures. Combinations. TMG . Reference : Discrete structures by B Kolman RC Busby. products and quotients of semi groups. Conditional Statements. Functions – Functions for computer science. equivalence relations. Sequences. elements of probability. Fundamentals – Sets and subsets. Joe L. Computer Science: YEAR II Paper I CLASS: B. Epp.B Sc. Rosen TMG Discrete Mathematics for computer scientists and Mathematicians. 2. S Ross PHI Pvt. Languages and finite state machines – Languages. Susanna S. computer representation of relations and digraphs. Books/Cole Publishing Company Discrete Mathematilcs.

Cohen-Sutherland Line Clipping. Geometric Transformations: Matrices. Homogeneous Coordinates and Translation. Flood-Fill Algorithm.Color Tables.DDA Algorithm. Polygons.D. J. Foley. Sproull. Soft Fill. Line Clipping. Introduction. 2 D Viewing. Newman. J. curves. Introduction to Computer Graphics. Van Dam. Willaim M. Phillips. What is computer graphics? Elements of graphics workstation. Attributes of Output Primitives. Graphics Software Coordinate Representations. Pauline Baker. Algorithms: Line drawing algorithms.Line Type.Bezier Curves and surfaces. Boundary-Fill Algorithm.Raster Scan Systems. Addision Wesley Computer Graphics by Rogers ******************* END OF PAPER I ******************** . 3 D Concepts: Three-Dimensional Display Methods. Scaling Transformations. Visible Line and surface Identification. Frame Buffers. Perspective Projection. filling. 2. characters etc. Sutherland-Hodgeman Polygon Clipping. Random Scan Systems. Graphics Primitives. 5.K.F. McGraw-Hill.Parallel Projection. Text Attributes.Polygon Representation. AreaFill Attributes. Video Display Devices. Input Devices. Roy A. Robert F.L. Display Control. Filling. Surface Rendering. Attributes of lines. Clipping Operations. 6. Character Generation. Inside-Outside Tests. Line Attributes. Coordinate Translations. Tata McGraw-Hill Principles of Interactive Computer Graphics. Feiner.Fill Styles. McGraw-Hill Computer Graphics(Schaum’s Outline Series). Circle and ellipse generating algorithms.Normalized Device Coordinates. The Display-File Interpreter. S. Hughes & R. Window-toviewport Coordinate Transformation. Line Width. ThreeDimensional Object Representations.SECTION II Computer Graphics . Plastock. Line Color. Character Attributes. Inverse Transformations. 3. Prientice Hall of India Computer Graphics. Display-File Structure.Midpoint Circle Algorithm. A.Point Clipping. Pen and Brush Options. Rotation about an arbitrary point. Two-Dimensional Viewing Functions.Sin and Cos Rotation. Color and Grayscale levels. Midpoint Ellipse Algorithm. Fundamental problems in Geometry. Polygon Clipping.Filled Area Primitives. 7. Transformation Routines. The viewing pipeline. B-Spline Curves and surfaces Reference: Computer Graphics. 4. Donald Hearn & M. Bresenham's Line Algorithm. Polynomials and spline curves. Scan-Line Polygon Fill Algorithm. Pattern Fill.I 1. Primitive Operations. Display-File Algorithms. Viewing Coordinate Reference Frame. Scan-Line Fill of Curved Boundary Areas. Steven Harrington. Grayscale.

Gary Bronson Practical C++ programming. Ivor Horton A first book of C++. Pointer to Class Member. Introducing Classes. Private. relational and assignment operators. Passing Reference to Objects. Virtual Functions and Polymorphism: Virtual Functions. E. Arrays.Data Types. Operator returning value. Object Initialization and Cleanup: Constructors. Reference Parameters. Multithreaded Programming. variables. Unary operator overloading. Java. Balaguruswamy. Java. Pointer to derived types. Independent References. String Handling. Revision of C++ fundamentals: Object oriented programming using C++. Parameterized constructors. Sc (Computer Science) SUBJECT: C++ and JAVA Data Structures using C / C++ Periods per week Lecture ( 1 Period = 50 minutes ) Practical Year II Paper II : Section I Paper II : Section II 3 3 Hours 3 Marks 50 Evaluation System Theory Examination per Term per Section Practical per year -- 40 SECTION I C++ 1. Constructors with default arguments. lang. Inheritance. “this” pointer. Introduction to JAVA: Java . Using Virtual Functions. protected members. util. Inheritance: Derived and base class. protected and public inheritance. Returning References. Event Handling Reference: Object Oriented programmimg using C++. Destructor. Control Statements. Dynamic Allocation Operators. TMG . I/O Applets. Pointer to Object. Derived class constructors. Abstract Classes. Operators. Initialized and Uninitialized Arrays. Introduction to HTML Applets. Overloading arithmetic. Overriding functions. Pure Virtual Functions. I/O. functions with default arguments. Levels of inheritance and multiple inheritance 4. 3. Arrays. Pointers and References: Array of Objects.CLASS: B. Exploring java. TMH Complete reference to C++ by Herbert shield TMH Let us C++ by Yaswant Kanetkar BPB Starting out with C++ by Tony Gaddis PENRAM International Publishing(India) Practical C++ Programing O’Reilly Beginning C++. Networking. Exception Handling. Constructors with dynamic operations Function and Operator Overloading: Function overloading. Inline functions. Steve Oualline Shroff Publishers Teach Yourself C++ Herbert Schildt. Allocating Objects 6. Packages and Interfaces. Binary operator overloading. Early verses Late binding 5. Classes and Objects: 2. Constructor overloading.

References: Kruse. JAVA handbook. ***************** END OF PAPER II ***************** . Data structure and analysis of Algorithms Classification of Data Structures Storage Structures: Sequential and Linked 2. Circular Queue. Sparse matrix and its representation & implementation. Joyce Farrell.15) Object oriented Programming with C++ and JAVA. Deletion. sorting and searching techniques. Prentice-Hall of India pvt ltd Object Oriented Programming Using C++. Operations and applications: Implementation. “Fundamentals of Data Structures. Brooks/Cole. hashing function. Addison-Wesley. Hashing: Hash table. Computer Science Press. binary trees and their operations such as traversal.Object Oriented design in c++ using STL. circular. “Data Structures and Algorithms”. Knuth ‘Fundamentals of Algorithms’ (Narosa Publication) Horowitz. 3. Linear Data Structures: Arrays and their memory representations Queues. 4. and Concatenation. merging and reversing.Hopcroft. 5. Ullman.Leung.7. Nabajyoti Barkakati. Deque. Priority Queue Stacks and their representation. Insertion. TMH. Trees and their representations. application to recursion. doubly. D.Samantha. Linked Lists and their representation: singly. Course Technology Thompson Learning Patric Naughton.9. threading.10. Sahni.Tondo. Graphs: Definition and terminology. “Data structures and Program Design in C”. Definition of Data Structure. Prentice-Hall of India pvt ltd SECTION II Data Structures using C / C++: 1. (Ch. Thompson Learning Object oriented Programming in C++. Prentice Hall Aho.13. 2-6. Nicholas J De Lillo.

command buttons. If –then-else Statement. Declaring variables. tab controls. G U I Murphy’s law of G U I Design. Designing the User Interface. Initializing an Array using for Each. Constants. Creating a new subprocedure. Val Function. planning GUI Design Work. Referring to Objects on a Different Forms. Testing whether Input is valid or not. Me Keyword.CLASS: B. Constants. Passing Variables to Procedures. Static. adding. Nested If Statements. Coding for controls. Naming rules/conventions. Accessing Information with User-Defined Data Types. Object Oriented. Identifying visual cues. Show Method. Working with multiple controls and their properties. Variables. Keyboard access. Introduction to Visual Basic Introduction Graphical User Interface (GUI). 6. Using common dialog box. How to use VB complier to compile / debug and run the programs. Check Boxes . Unload Statement. 5. The Visual Basic Environment. Default & Cancel property. Removing an item from a list. Case Structure . Clear Method. Passing Argument ByVal or ByRef. List Box/ Combo Box. Displaying Message in Message Box. Private. Data Types. The line Control. and Calculations Variables. Menus. Arrays Single-Dimension Arrays. List box Properties. Named & intrinsic. Using List Boxes with Array.Using If statements with Option Buttons & Check Boxes. Formatting Data. Images. 4. 8. Programming Language (Procedural. Sub-Procedures and Sub-functions Defining / Creating and Modifying a Menu. . Hide. For/Next Loops. Do/Loops. VB Controls Textboxes. List. removing Forms in project. User-Defined Data Types. Option Buttons. Multiple Forms Creating. Using MsgBox Function. Or. Constants. The Shape Control. Icons and graphics. Setting a Border & Styles. Sc (Computer Science) SUBJECT: GUI and Visual Basic Paper III: Section I Data Base Management Paper III: Section II Periods per week Lecture ( 1 Period = 50 minutes ) Practical Year II 3 3 Hours 3 -Marks 50 40 Evaluation System Theory Examination per Term per Section Practical per year SECTION I 1. Frames. Not). Comparing Strings. Visual programming Software Component Mindset-role of programming code 2. Using String Function. 7. Scope of variables. clear communication. 3. Writing a Function Procedure. Filling the List using Property window / AddItem Method. Loops and Printing List Boxes & Combo Boxes. Compound Conditions(And. Two dimensional arrays. GUI standard. Arithmetic Operations. Features of G U I. Decision & Conditions If Statement. Variables Public. Load. Using Call Statement to call a procedure. color selection. Printing to printer using Print Method. Event Driven).

Recoverability. Put. Transaction Definition in SQL. Finding the end of a Data file. Different types of Database Systems 2. Decomposition. E-R Model: Basic Concepts. Database language. Mapping Constraints. displaying the record no & record count. Basic Structure. Normalization Using Join Dependencies. Weak Entity set. checking for BOF & EOF. Database Administrator. Sequential File Organization (Writing Data to a sequential Disk File. The Free File Function.9. Storage Management. TMH SECTION II Data base concepts and Systems 1. SQL. Relational Model: Structure of Relational Database. SET operations. Creating a sequential data file. Implementations of Atomicity and durability. Locating a file). Extended E-R features. and Normalization Using Multi valued Dependencies. Introduction. findprevious.setting its property. opening the database. Concurrent Executions. Concurrency in index structure. Advanced data handling Displaying data in grids ( grid control. findlast. Deadlock Handing. Null Values. Aggregate functions. The Relational Algebra. Transaction. Views of data. The Err Object. Random Data File Opening a random file. Serializability. Domain-Key Normal Form and Alternative Approaches to Database Design . navigating the database in code ( the recordset object using the movenext. Books: i) ii) iii) Programming in VB 6 by Julia case Bradley .Purpose of Database Systems. Views 4. Timestamp based protocol. Millspaugh. Recordset . Viewing the data in a file. Concurrency Control. Reading and writing a random file(Get. file open errors ) . findnext. Seek). updating a database file ( adding. trap errors with On Error. Anita C.Transaction Concepts. Insert and Delete operations. The Domain Relational Calculus. properties of grid ) . using listboxes & comboboxes as data bound controls. creating a new dynaset. Validation based protocol. Accessing Database File Creating the database files for use by Visual Basic(Using MS-Access). Design Issues. Design Of an E-R Database Schema. Other SQL features 5. seek method. E-R Diagram. 11. Using the Data Control . Multiple Granularity. TMH The Complete Reference Visual Basic 6 by Noel Jerke . Views. Multi version Schemes. Modification of Database. The tuple relational calculus.Lock based protocol. DDL.Background.0 Programming by Content Development Group. Data Files Opening and Closing Data Files. Joined Relations. movepreviouse. deleting records ) .Pitfalls in Relational-Database Design. TMH Visual Basic 6. Reduction of an E-R schema to Tables 3. Overall System Structure. State. Database Users. Nested Sub queries. Using Data Control with forms. Transaction Management. Derived Relations. working with database fields. Data Models. Reading the Data in a sequential file. Normalization Using Functional Dependencies. Keys. Query Optimization 6. 10. movefirst & movelast methods . validation & error trappings ( locking text boxes.) . LOF. searching for a specific record ( findfirst. Relational Database Design. Trapping Program Errors.

7. G. row selection. Groff & Paul N. nested sub queries . rules for single table query processing Multi-table queries : Simple joins . multi-tier architecture) RDBMS: Data models (File management systems. sub query search conditions. constants (numeric. Microsoft SQL Server 7. S. Omran A. DBMS by Date 3. symbolic constants). 6. Visual basic 6 Programing Black Book. IDG books. BPB Publications Database Management Systems Majumdar/ A K Bhattacharyya. GUI Design for dummies. Prentice Hall Inc. rules for multi-table query processing ) . Korth. Codd's 12 rules SQL Basics: statements. Ullman. grouped queries. all column selections . Database Systems and Concepts. IDG Books India Pvt. IDG Books India Pvt. Elmasri and Navathe An Introduction to Database System. Kemper and Moerkotte. Bukhares & A. outer joins Summary Queries : column functions. SQL features & benefits. SQL a complete reference by Alexis Leon & Mathews Leon TMG 10. built-in functions. sorting query results. Eric Smith. Galgotia Publications Oracle Client Server Computing. search Visual Basic 6 : In Record Time/ Brown. missing data (NULL values) Simple queries: The SELECT statement . Ltd. Henry F. multi table query performance .K Elmagarmid. sub queries in the HAVING clause.: Mable. tables. Steven Holzner.1996 **************** END OF PAPER III ****************** . Ltd. Rob: Peasley. hierarchical databases. Prientice Hall New Jersy Object Oriented MultiDatabase System. client/server architecture. Sliberschatz. McGraw Hill 2. Tata Mc Graw Hill Object Oriented Database Management. file server architecture . qualified column names. ODBC & the SQL access group) . other SQL standards. string. 4. the structure of the join ( table multiplication. Sudarshan. simple queries. sub queries & joins. role of SQL. R. Aitken—Technology Press 8. SQL considerations for multi table queries ( table aliases. Date Principles of Database System. Patrick Dalton. names ( table & column names). expressions . Books: 1. Ltd. SQL & networking ( centralized architecture. relational data model ( Keys. The complete reference SQL by James R.7. Visual Basic 6 programing Bible. correlated sub queries. B P B Publication Beginning S Q L Server 2000 for Visual Basic Developers Willis thearon Shroff publishers & distributers Fundamentals of Database Systems. data types . SQL Standards ( ANSI / ISO Standards. SQL Server 2000 Black Book. query results. duplicate rows.: Pruchniak Prentice Hall India pvt. group search conditions Sub queries & query expressions : using sub queries. Non equi-joins. self joins) . Techmedia References: Using visual basic 6 / Reselman. Visual Basic6 Programming Blue Book by Peter G.J. IDG Books India Pvt. relationships). C.0 Bjeletich. date & time. Weinberg TMG 9.S. 5. Introduction to SQL: The SQL language. network databases).

List of practicals/ tutorials/term work for Paper II Paper II: Section I C++ Practical 1: Simple programs to revise C++ fundamentals Practical 2: Constructor and constructor overloading. inheritance. Practical 10: Java string handling. polymorphism etc. The concerned teacher and the head of the department should certify the said journal. At least fourteen practicals (seven from each section) should be completed in a year. In order to take the practical a lab session similar to the given practical can be taken to initiate the thinking required for the practical. subtraction and comparison. concatenation. Practical 10: DDA Line drawing algorithm Practical 11: Bresenham’s line drawing algorithm Practical 12: Midpoint circle algorithm Practical 13: Midpoint-ellipse algorithm Practical 14: Polygon generation Practical 15: Polygon filling Practical 16: Animation using different line and pixel methods Practical 17: Clipping algorithms Practical 18: Creation of bezier / B-splines. . 2. The practicals TAKEN should be recorded in a journal maintained for the purpose. string sorting. Functions/Methods used in C Graphics. Practical 9: Demonstration of the concept of a Java package and its interfaces.GENERAL INSTRUCTIONS FOR CONDUCT OF REGULAR PRACTICAL 1. which includes encapsulation. function overloading Practical 3: Operators and operator overloading Practical 4: Inheritance. Pointers and References: JAVA Practical 7: Introductory concepts and working on JAVA Practical 8: Concept of a Java class. multiple inheritances Practical 5: Virtual Functions and Polymorphism: Practical 6: Arrays. List of practicals/ tutorials/term work for Paper I Paper I: Section I Practical 1: Problem solving session on topic 1 Practical 2: Problem solving session on topic 2 Practical 3: Problem solving session on topic 3 Practical 4: Problem solving session on topic 4 Practical 5: Problem solving session on topic 5 Practical 6: Problem solving session on topic 6 Practical 7: Problem solving session on topic 7 Practical 8: Problem solving session on topic 8 Paper I: Section II Practical 9: Working in C Graphics.

Circular Queue. Removing an item from a list. Deletion. merging and reversing. Printing to printer using Print Method. referential integrity . Practical 13: Java Applet on the Internet/ Intranet. Non-Equijoins with inequalities in the join condition. Practical 12: Use of Java input / output as a set of stream classes. Creating tables with defaults. and Concatenation. Filling the List using Property window / AddItem Method. Sub-Procedures and Sub-functions Practical 6: Multiple Forms Practical 7: Use of List Boxes & Combo Boxes. Priority Queue Practical 17: Stacks and their representation. Queries using single row numeric. Using String Function. Practical 20: Sparse matrix and its representation & implementation. Equi-joins and outer joins. Practical 8: Use and working of Data Files Practical 9: Accessing Database File Prcatical 10: Advanced data handling Practical 11: Practical 12: Practical 13: Practical 14: Practical 15: Paper III – Section II Write simple single table SQL queries using operators with select columns and restricting rows of output. Insertion. More complex single table queries. Deque. data formatting and other complex formatting. Linear Data Structures Arrays an their memory representation Practical 14: Practical 15: Practical 16: Queues.Generate a correlated subquery. List Box/ Combo Box. subtotals and selection on subtotal rows. character. integrity constraints. Clear Method. Practical 4: Use of different message boxes and statements used in VB Practical 5: Menus. Ordering queries and using sub-queries. application to recursion. List box Properties. Practical 21: Tree traversal Practical 22: Graphing algorithms List of practicals/ tutorials/term work for Paper III Paper III – Section I Practical 1: Practical 2: Practical 3: Use of different controls used in VB. Multitable queries using the join operators. Queries with aggregate functions. Practical 18: Practical 19: Linked Lists Operations and applications: Implementation.Paper II: Section II JAVA Practical 11: Java error conditions using exception handling. Create views and update them.

Printing the report. Using top titles and bottom titles. . Practical 17: Simple reporting by formatting column headers and columns of output. Executing command files and printing the reports. altering table structures and deleting tables. Inserting data in table structures and deleting tables. Practical 16: Updating tables.constraints and check constraints both at the column level and table level. Practical 18: Storing SQL and formatting statements in command files.

Sign up to vote on this title
UsefulNot useful