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