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