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