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