P. 1


|Views: 139|Likes:
Published by s_m_aslam

More info:

Published by: s_m_aslam on Aug 11, 2010
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





University of Mumbai B.Sc.

(Computer Science)


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

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

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

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

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

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

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

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

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

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

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

altering 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. Using top titles and bottom titles. Inserting data in table structures and deleting tables.constraints and check constraints both at the column level and table level. Printing the report. Practical 16: Updating tables. Executing command files and printing the reports.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->