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