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