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