University of Mumbai B.Sc.

(Computer Science)


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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful