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