University of Mumbai B.Sc.

(Computer Science)

Syllabus

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

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

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

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

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

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

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

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

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

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

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

Using top titles and bottom titles. 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. Inserting data in table structures and deleting tables. Practical 16: Updating tables. altering table structures and deleting tables. Printing the report. Practical 18: Storing SQL and formatting statements in command files.

Sign up to vote on this title
UsefulNot useful