This action might not be possible to undo. Are you sure you want to continue?
S.Y.BSc. (W.E.F. 2004-05)
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. 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.
Epp. 8. machines and languages. groups. Baker. Mathematical structures. Transitive closure and Warshalls algorithm. 7. properties of relations. paths in relations and digraphs. Operations on sets. Logic – Propositions and Logical operations. products and quotients of semi groups. 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. Semi groups . Counting – Permutations. Thompson Learning Discrete Mathematics and its Applications Kenneth H. relations and digraphs.Mott. S Ross PHI Pvt. Methods of proof. 2. 5. Functions – Functions for computer science. Discrete structures by Liu Digital Logic John M Yarbrough Brooks/cole. Ltd.B Sc. semi groups. Reference : Discrete structures by B Kolman RC Busby. The pigeonhole principle. Marc Lipson. elements of probability. TMG . 3. recurrence relations. machines and regular languages. Joe L. equivalence relations. Abraham Kandel Theodore P. Combinations. Seymour Lipschutz. Division in the integers. Conditional Statements. Susanna S. 4. Sequences. computer representation of relations and digraphs. Languages and finite state machines – Languages. Books/Cole Publishing Company Discrete Mathematilcs. Semi groups and groups – Binary operations. representation of special languages and grammars. Relations and Digraphs – Product sets and partitions. Prentice-Hall of India pvt ltd Discrete Mathematics With Applications. growth of functions 6. Rosen TMG Discrete Mathematics for computer scientists and Mathematicians. Fundamentals – Sets and subsets. manipulation of relations. Finite state machines. Groups and coding – Coding of binary information and error detection Decoding and error correction. Products and quotients of groups. mathematical induction. Schaum’s Outlines Series. permutation functions. Computer Science: YEAR II Paper I CLASS: B.
What is computer graphics? Elements of graphics workstation.Fill Styles. B-Spline Curves and surfaces Reference: Computer Graphics. Introduction. curves. Text Attributes. Pattern Fill. Steven Harrington. Grayscale.Point Clipping. Clipping Operations. filling. Scaling Transformations. Visible Line and surface Identification. Frame Buffers. Attributes of lines. Hughes & R. S.SECTION II Computer Graphics . 2 D Viewing. ThreeDimensional Object Representations. Attributes of Output Primitives. Line Width.Sin and Cos Rotation. Character Generation. 2. Introduction to Computer Graphics. Character Attributes. Bresenham's Line Algorithm. Phillips.Parallel Projection. Polygon Clipping. Inverse Transformations. 3. J. McGraw-Hill Computer Graphics(Schaum’s Outline Series). Sproull. Transformation Routines. Line Clipping. The viewing pipeline. Van Dam. Prientice Hall of India Computer Graphics. Fundamental problems in Geometry. Scan-Line Polygon Fill Algorithm. Graphics Software Coordinate Representations. Willaim M. Viewing Coordinate Reference Frame. characters etc.Color Tables. 5. Robert F. Roy A. Sutherland-Hodgeman Polygon Clipping.F. Pauline Baker.D. Coordinate Translations. Two-Dimensional Viewing Functions. McGraw-Hill. 6. Color and Grayscale levels. Circle and ellipse generating algorithms. Display Control. Flood-Fill Algorithm. Surface Rendering.Polygon Representation. Geometric Transformations: Matrices. Foley.Bezier Curves and surfaces. Feiner. Line Color. Perspective Projection.L. Plastock. Algorithms: Line drawing algorithms. Cohen-Sutherland Line Clipping. Newman. Boundary-Fill Algorithm. Scan-Line Fill of Curved Boundary Areas. Primitive Operations. Video Display Devices.Filled Area Primitives. Addision Wesley Computer Graphics by Rogers ******************* END OF PAPER I ******************** . Pen and Brush Options. AreaFill Attributes. 4. A. Polygons. Midpoint Ellipse Algorithm. Donald Hearn & M. Rotation about an arbitrary point.K.I 1. Soft Fill. Tata McGraw-Hill Principles of Interactive Computer Graphics. The Display-File Interpreter. 3 D Concepts: Three-Dimensional Display Methods. 7. Polynomials and spline curves. Filling. J. Display-File Algorithms. Display-File Structure. Homogeneous Coordinates and Translation.Line Type.Raster Scan Systems. Line Attributes. Random Scan Systems. Input Devices. Graphics Primitives. Inside-Outside Tests.Midpoint Circle Algorithm. Window-toviewport Coordinate Transformation.DDA Algorithm.Normalized Device Coordinates.
Object Initialization and Cleanup: Constructors. Passing Reference to Objects. Levels of inheritance and multiple inheritance 4. Pure Virtual Functions. Dynamic Allocation Operators. “this” pointer. Introduction to HTML Applets. functions with default arguments. Reference Parameters. Exploring java. Inheritance: Derived and base class. Using Virtual Functions. Binary operator overloading. Arrays. Pointers and References: Array of Objects. 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++. Introducing Classes. Java. Inheritance. protected and public inheritance. Packages and Interfaces. Networking. Overloading arithmetic. Private. Control Statements. Derived class constructors. Inline functions. Pointer to derived types. Returning References. Balaguruswamy. Classes and Objects: 2. Constructor overloading. Operator returning value. Multithreaded Programming. Parameterized constructors. Pointer to Class Member. Exception Handling. Unary operator overloading. Allocating Objects 6. util. Abstract Classes. Destructor. Constructors with dynamic operations Function and Operator Overloading: Function overloading. Arrays. Revision of C++ fundamentals: Object oriented programming using C++. String Handling. Steve Oualline Shroff Publishers Teach Yourself C++ Herbert Schildt. 3.CLASS: B. I/O Applets. Virtual Functions and Polymorphism: Virtual Functions. Early verses Late binding 5.Data Types. E. TMG . lang. protected members. Overriding functions. Independent References. I/O. Event Handling Reference: Object Oriented programmimg using C++. Introduction to JAVA: Java . Operators. 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. variables. Ivor Horton A first book of C++. Constructors with default arguments. Pointer to Object. Initialized and Uninitialized Arrays. relational and assignment operators. Gary Bronson Practical C++ programming. Java.
Insertion. Trees and their representations. Data structure and analysis of Algorithms Classification of Data Structures Storage Structures: Sequential and Linked 2. and Concatenation. JAVA handbook. Deque. Thompson Learning Object oriented Programming in C++. “Fundamentals of Data Structures. Operations and applications: Implementation. Joyce Farrell. threading. 2-6. Knuth ‘Fundamentals of Algorithms’ (Narosa Publication) Horowitz. Priority Queue Stacks and their representation. Sahni. Prentice-Hall of India pvt ltd Object Oriented Programming Using C++. Linear Data Structures: Arrays and their memory representations Queues. Prentice-Hall of India pvt ltd SECTION II Data Structures using C / C++: 1. application to recursion. hashing function.Samantha. “Data structures and Program Design in C”. ***************** END OF PAPER II ***************** . sorting and searching techniques. Prentice Hall Aho. merging and reversing.7. Definition of Data Structure.Tondo. circular.13. Linked Lists and their representation: singly.15) Object oriented Programming with C++ and JAVA. 5. binary trees and their operations such as traversal. (Ch. Addison-Wesley. Deletion. Nicholas J De Lillo.10. D. Ullman. “Data Structures and Algorithms”. 3. Circular Queue. Brooks/Cole. References: Kruse. TMH. Hashing: Hash table.Object Oriented design in c++ using STL.Leung. Nabajyoti Barkakati. doubly.Hopcroft. Sparse matrix and its representation & implementation. Computer Science Press.9. Course Technology Thompson Learning Patric Naughton. Graphs: Definition and terminology. 4.
Constants. 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. 6. Programming Language (Procedural. Object Oriented. Scope of variables. Clear Method. Icons and graphics. Coding for controls. List box Properties. Filling the List using Property window / AddItem Method. Data Types. Removing an item from a list. 4. Accessing Information with User-Defined Data Types. Frames. Features of G U I. Named & intrinsic. VB Controls Textboxes. color selection. Identifying visual cues. Arithmetic Operations. adding. Using List Boxes with Array. and Calculations Variables. Naming rules/conventions. The line Control. Variables. command buttons. Initializing an Array using for Each. Using common dialog box. Constants. Variables Public. Keyboard access. 8. Sub-Procedures and Sub-functions Defining / Creating and Modifying a Menu. Do/Loops. Writing a Function Procedure. Menus. List Box/ Combo Box.CLASS: B. planning GUI Design Work. removing Forms in project. User-Defined Data Types. Visual programming Software Component Mindset-role of programming code 2. GUI standard. Comparing Strings. List. Constants. Referring to Objects on a Different Forms. Check Boxes . Unload Statement. Loops and Printing List Boxes & Combo Boxes. Hide. Displaying Message in Message Box. Using String Function. Designing the User Interface. Declaring variables. Passing Argument ByVal or ByRef. Creating a new subprocedure. Nested If Statements. For/Next Loops. Or. 5. Load. Decision & Conditions If Statement. How to use VB complier to compile / debug and run the programs. Show Method. The Visual Basic Environment.Using If statements with Option Buttons & Check Boxes. The Shape Control. Arrays Single-Dimension Arrays. . Option Buttons. If –then-else Statement. Printing to printer using Print Method. Compound Conditions(And. Private. Setting a Border & Styles. Images. G U I Murphy’s law of G U I Design. Formatting Data. Using MsgBox Function. Testing whether Input is valid or not. Multiple Forms Creating. Val Function. Static. Event Driven). Introduction to Visual Basic Introduction Graphical User Interface (GUI). tab controls. clear communication. 3. Case Structure . Default & Cancel property. Using Call Statement to call a procedure. Working with multiple controls and their properties. Me Keyword. Two dimensional arrays. Passing Variables to Procedures. 7. Not).
Relational Database Design. Accessing Database File Creating the database files for use by Visual Basic(Using MS-Access). Query Optimization 6. Domain-Key Normal Form and Alternative Approaches to Database Design . Transaction.Pitfalls in Relational-Database Design. Views of data. Aggregate functions. Database Administrator. Nested Sub queries. Concurrent Executions. Derived Relations. using listboxes & comboboxes as data bound controls. Storage Management. trap errors with On Error. State. Introduction. Insert and Delete operations. Views. Multi version Schemes. The Relational Algebra. working with database fields. 10.Background. Locating a file). Data Files Opening and Closing Data Files. TMH Visual Basic 6. Joined Relations. Data Models. Relational Model: Structure of Relational Database. Concurrency Control. Books: i) ii) iii) Programming in VB 6 by Julia case Bradley . Using the Data Control . displaying the record no & record count. Advanced data handling Displaying data in grids ( grid control. Using Data Control with forms. TMH The Complete Reference Visual Basic 6 by Noel Jerke .Lock based protocol.Transaction Concepts. Put. Anita C. Keys. SQL. Millspaugh. Random Data File Opening a random file. findprevious. and Normalization Using Multi valued Dependencies. Database language. updating a database file ( adding. 11. Recoverability. movefirst & movelast methods .Purpose of Database Systems. Sequential File Organization (Writing Data to a sequential Disk File. Null Values. Modification of Database. Database Users. deleting records ) . The tuple relational calculus. Validation based protocol. Mapping Constraints. Basic Structure. Normalization Using Functional Dependencies. The Free File Function. Design Issues. Reduction of an E-R schema to Tables 3.) . Serializability. searching for a specific record ( findfirst. Finding the end of a Data file. Overall System Structure. Timestamp based protocol. Trapping Program Errors. Multiple Granularity. file open errors ) . Seek). creating a new dynaset. The Err Object. opening the database. E-R Model: Basic Concepts. Creating a sequential data file. Extended E-R features. LOF. findnext. seek method.9. Other SQL features 5.setting its property. Transaction Management. Deadlock Handing. checking for BOF & EOF. DDL. Implementations of Atomicity and durability. SET operations. E-R Diagram. movepreviouse. Views 4. Viewing the data in a file. Normalization Using Join Dependencies. navigating the database in code ( the recordset object using the movenext. findlast. Reading and writing a random file(Get. Concurrency in index structure. Transaction Definition in SQL. Decomposition. Reading the Data in a sequential file. TMH SECTION II Data base concepts and Systems 1.0 Programming by Content Development Group. validation & error trappings ( locking text boxes. Recordset . Design Of an E-R Database Schema. The Domain Relational Calculus. Weak Entity set. properties of grid ) . Different types of Database Systems 2.
IDG Books India Pvt. Elmasri and Navathe An Introduction to Database System. multi table query performance . query results. hierarchical databases. grouped queries. SQL Standards ( ANSI / ISO Standards. Visual Basic 6 programing Bible. outer joins Summary Queries : column functions. sub query search conditions. DBMS by Date 3. Kemper and Moerkotte. relationships). Omran A. R. S. string. rules for single table query processing Multi-table queries : Simple joins . built-in functions. self joins) . relational data model ( Keys. Date Principles of Database System. Codd's 12 rules SQL Basics: statements. sub queries in the HAVING clause. Ltd. nested sub queries . Non equi-joins. multi-tier architecture) RDBMS: Data models (File management systems. ODBC & the SQL access group) . GUI Design for dummies. simple queries.7. SQL Server 2000 Black Book.ltd Visual Basic 6 : In Record Time/ Brown. role of SQL. correlated sub queries. IDG books. client/server architecture. SQL features & benefits. BPB Publications Database Management Systems Majumdar/ A K Bhattacharyya. Sudarshan. Techmedia References: Using visual basic 6 / Reselman. symbolic constants). SQL considerations for multi table queries ( table aliases. Prientice Hall New Jersy Object Oriented MultiDatabase System. data types .0 Bjeletich.: Pruchniak Prentice Hall India pvt. Patrick Dalton. duplicate rows. Henry F.: Mable.1996 **************** END OF PAPER III ****************** . date & time. Introduction to SQL: The SQL language. Galgotia Publications Oracle Client Server Computing. SQL & networking ( centralized architecture. sorting query results.J. row selection. SQL a complete reference by Alexis Leon & Mathews Leon TMG 10. McGraw Hill 2. constants (numeric. sub queries & joins.S. Microsoft SQL Server 7. search conditions. file server architecture . network databases). Groff & Paul N. The complete reference SQL by James R. Database Systems and Concepts. missing data (NULL values) Simple queries: The SELECT statement . names ( table & column names). C. 4. Bukhares & A. group search conditions Sub queries & query expressions : using sub queries. Prentice Hall Inc. the structure of the join ( table multiplication. Ltd. Ullman. tables. Ltd. Korth. B P B Publication Beginning S Q L Server 2000 for Visual Basic Developers Willis thearon Shroff publishers & distributers Fundamentals of Database Systems. IDG Books India Pvt. qualified column names. Tata Mc Graw Hill Object Oriented Database Management. Sliberschatz. Aitken—Technology Press 8.K Elmagarmid. rules for multi-table query processing ) . Weinberg TMG 9. 7. Visual basic 6 Programing Black Book. other SQL standards. Rob: Peasley. all column selections . 6. IDG Books India Pvt. G. Visual Basic6 Programming Blue Book by Peter G. expressions . Eric Smith. Steven Holzner. 5. Books: 1.
function overloading Practical 3: Operators and operator overloading Practical 4: Inheritance. subtraction and comparison. 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. inheritance. Practical 9: Demonstration of the concept of a Java package and its interfaces.GENERAL INSTRUCTIONS FOR CONDUCT OF REGULAR PRACTICAL 1. Functions/Methods used in C Graphics. string sorting. multiple inheritances Practical 5: Virtual Functions and Polymorphism: Practical 6: Arrays. 2. concatenation. The concerned teacher and the head of the department should certify the said journal. . Practical 10: Java string handling. At least fourteen practicals (seven from each section) should be completed in a year. polymorphism etc. 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. Pointers and References: JAVA Practical 7: Introductory concepts and working on JAVA Practical 8: Concept of a Java class. 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 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. The practicals TAKEN should be recorded in a journal maintained for the purpose. which includes encapsulation.
List box Properties. Practical 4: Use of different message boxes and statements used in VB Practical 5: Menus. Ordering queries and using sub-queries. Practical 20: Sparse matrix and its representation & implementation. Circular Queue. Linear Data Structures Arrays an their memory representation Practical 14: Practical 15: Practical 16: Queues. 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. Using String Function. Deletion. Non-Equijoins with inequalities in the join condition. character. Deque. Queries using single row numeric. 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. integrity constraints. Equi-joins and outer joins. Create views and update them. Queries with aggregate functions. data formatting and other complex formatting. Clear Method. Practical 18: Practical 19: Linked Lists Operations and applications: Implementation. application to recursion. Practical 13: Java Applet on the Internet/ Intranet. and Concatenation. More complex single table queries. Insertion. Printing to printer using Print Method. Practical 12: Use of Java input / output as a set of stream classes.Generate a correlated subquery. Removing an item from a list. Multitable queries using the join operators. Filling the List using Property window / AddItem Method. Creating tables with defaults. subtotals and selection on subtotal rows. merging and reversing. List Box/ Combo Box. referential integrity . 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. Priority Queue Practical 17: Stacks and their representation.
Executing command files and printing the reports. Practical 16: Updating tables. Using top titles and bottom titles.constraints and check constraints both at the column level and table level. Practical 17: Simple reporting by formatting column headers and columns of output. Printing the report. Inserting data in table structures and deleting tables. altering table structures and deleting tables. Practical 18: Storing SQL and formatting statements in command files. .
This action might not be possible to undo. Are you sure you want to continue?