University of Mumbai B.Sc.

(Computer Science)

Syllabus

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. 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.SC.

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful