University of Mumbai B.Sc.

(Computer Science)


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

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 . TERM I = 40.B.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.

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

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

Ivor Horton A first book of C++. protected and public inheritance. Reference Parameters. Returning References. Dynamic Allocation Operators. Packages and Interfaces. 3. Levels of inheritance and multiple inheritance 4. protected members. Constructor overloading. Inheritance. Networking. Constructors with default arguments. Multithreaded Programming. functions with default arguments. Overriding functions. Early verses Late binding 5. Pointer to derived types. Balaguruswamy. Event Handling Reference: Object Oriented programmimg using C++. I/O. relational and assignment operators. Constructors with dynamic operations Function and Operator Overloading: Function overloading. Unary operator overloading. Virtual Functions and Polymorphism: Virtual Functions. Introduction to JAVA: Java . 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. 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++. Pointers and References: Array of Objects. Arrays. String Handling. Revision of C++ fundamentals: Object oriented programming using C++. Initialized and Uninitialized Arrays. “this” pointer. Java. Allocating Objects 6. Using Virtual Functions. Passing Reference to Objects. variables. Destructor. lang. Binary operator overloading. I/O Applets. Java. E. Inheritance: Derived and base class.CLASS: B. Control Statements. Exception Handling. TMG . Abstract Classes. Steve Oualline Shroff Publishers Teach Yourself C++ Herbert Schildt. Parameterized constructors. Pure Virtual Functions. Exploring java. Arrays. Pointer to Object. Operators. Derived class constructors. Introduction to HTML Applets.Data Types. Inline functions. util. Gary Bronson Practical C++ programming. Object Initialization and Cleanup: Constructors. Pointer to Class Member. Introducing Classes. Independent References. Operator returning value. Classes and Objects: 2. Overloading arithmetic. Private.

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

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

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

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

. concatenation. function overloading Practical 3: Operators and operator overloading Practical 4: Inheritance. 2. subtraction and comparison. Practical 10: Java string handling.GENERAL INSTRUCTIONS FOR CONDUCT OF REGULAR PRACTICAL 1. 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. 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. 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. The concerned teacher and the head of the department should certify the said journal. string sorting. Practical 9: Demonstration of the concept of a Java package and its interfaces. multiple inheritances Practical 5: Virtual Functions and Polymorphism: Practical 6: Arrays. which includes encapsulation. The practicals TAKEN should be recorded in a journal maintained for the purpose. At least fourteen practicals (seven from each section) should be completed in a year. polymorphism etc. Functions/Methods used in C Graphics. inheritance. 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. Pointers and References: JAVA Practical 7: Introductory concepts and working on JAVA Practical 8: Concept of a Java class.

integrity constraints. Queries with aggregate functions. Circular Queue. Non-Equijoins with inequalities in the join condition. Printing to printer using Print Method. application to recursion. Equi-joins and outer joins. Practical 12: Use of Java input / output as a set of stream classes. and Concatenation. Deletion. character. List box Properties. Deque. List Box/ Combo Box. 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. Clear Method. Sub-Procedures and Sub-functions Practical 6: Multiple Forms Practical 7: Use of List Boxes & Combo Boxes. data formatting and other complex formatting. 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. Priority Queue Practical 17: Stacks and their representation. subtotals and selection on subtotal rows.Paper II: Section II JAVA Practical 11: Java error conditions using exception handling. Practical 4: Use of different message boxes and statements used in VB Practical 5: Menus. Multitable queries using the join operators. Practical 13: Java Applet on the Internet/ Intranet. Linear Data Structures Arrays an their memory representation Practical 14: Practical 15: Practical 16: Queues. More complex single table queries. Practical 20: Sparse matrix and its representation & implementation. Removing an item from a list. Creating tables with defaults. Ordering queries and using sub-queries. Queries using single row numeric. merging and reversing. Insertion. Filling the List using Property window / AddItem Method. Using String Function. Create views and update them. referential integrity .Generate a correlated subquery. Practical 18: Practical 19: Linked Lists Operations and applications: Implementation.

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

Sign up to vote on this title
UsefulNot useful