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