BSc Computer Science BSc Computer Science syllabus Nagpur University, BSc Computer Science in Nagpur

Atlanta Computer Institute Nagpur conducts Tuition Classes for BSc Computer Science First Year ( Part 1 ) , BSc Computer Science Second Year ( Part 2 ) and BSc Computer Science Final Year ( Part 3 ) for all universities in India . The Following syllabus is of Nagpur University. Final Year Projects Training is also given to BSc Computer Science Students.

Semester-wise Syllabus for B.Sc. Computer Science

Subject Structure

B.Sc. Part 1 Semester 1

Paper- 1  :-   Programming in C
Paper- 2  :-  Fundamentals of Information Technology


B.Sc. Part 1 Semester 2

Paper- 1 :-  Object Oriented Programming using ‘C ++’
Paper- 2 :-  System Analysis and Design


B.Sc.  2nd Year Semester 3

Paper 1 :- Data Structures
Paper 2 :- Operating Systems


B.Sc. 2nd Year Semester 4

Paper 1 :-  Java Programming
Paper 2 :-  Linux Operating System


B.Sc. Final Semester 5

Paper 1 :- Visual Basic Programming
Paper 2 :- Database Management System

 
B.Sc. Final Semester 6

Paper 1 :- Compiler Construction
Paper 2 :- SQL AND PL/SQL


Practicals


Note :- 1) A student has to perform ALL exercises.
II) Not more than two students should be allowed on one machine.

B.Sc. Part I Semester I :  Programming in C
B.Sc. Part I Semester II :  Object Oriented Programming using C ++
B.Sc. Part II Semester III :  Data Structure ( using C++ )
B.Sc. Part II Semester IV :  Java Programming
B.Sc. Final Semester V :  Visual Basic Programming
B.Sc. Final Semester VI :  SQL AND PL/SQL (Oracle)

Valuation Pattern :-
In University practical examination a student has to perform any one exercise from the list prescribed in the syllabus and it is to be executed on machine.
The valuation scheme of practical examination will be as under.
Record - 6
Viva - 6
Writing - 09
Execution - 09
TOTAL - 30

B.Sc. Part 1 Semester 1 (From 2013-2014)
Paper 1

PROGRAMMING IN C

UNIT- I :
Programming Structure : Sequence, Selection, Iteration and Modular. Problem Solving techniques: Development Tools: Algorithm, Flowcharts and Pseudo code (Definition and its characteristics) Developing Algorithm and Drawing flowcharts
UNIT- II :
C Character set, Tokens, Identifier, Keywords, Variables, Data types, Qualifiers. Operators and Expressions: Arithmetic, Relational, Logical, Bit-Wise, Increment, Decrement, Conditional and Special operators. typedef, Type Conversion, Constants, Declaring Symbolic Constants, Character Strings, Enumerated Data Types, Operator Precedence and Associativity. Library functions. : Maths, string handling Functions. Control Structure: Compound Statement, Selection Statement: if, if-else, Nested if, switch. Iteration statement: for, while, do..while, Nested loops, Jump statement: break, continue, goto. (Special emphasis on problem solving)
UNIT- III :
Arrays: Need, Types: Single and Two Dimensional Array.
Strings: Strings Manipulation, Arrays of Strings, Evaluation order
Function: Function Components, Return Data type, Parameter Passing, Return by Reference, Default Arguments, Recursive Functions, Arrays with Functions, Storage Classes. (Special emphasis on problem Solving )
UNIT- IV :
Structure: Declaration, Definition, Accessing structure members, Initialization, Nesting of Structures.
Union: Unions, Differences between Structure and Union
Pointer: Introduction, Address Operator (&), Pointer variables, void pointers, Pointer Arithmetic, Pointers to Pointers.
File handling : Hierarchy of File Stream Classes, Opening & closing a file, Testing for errors, File Modes, File pointers and their manipulations, Sequential Access, Random Access , Command Line arguments.

Text Books
1. The Art of programming through flowcharts & algorithm by Anil B. Chaudhari
Firewall Media, Laxmi publication, New Publication.
2. Programming in C by E. Balagurusamy TMH Publications.

Reference Books
1. C Programming - Kernighen Ritche
2. Programming with C – Y. Kanetkar.
3. C Programming – Holzner, PHI Publication.
4. Programming in C – Ravichandran.

B.Sc. Part 1 Semester 1
Paper 2

FUNDAMENTALS OF INFORMATION TECHNOLOGY

UNIT - I :
Basic Components of Digital Computers: Block Diagram. CPU: Functions of Each Unit: Primary Memory, ALU and CU, Instruction format. Bus: Data, Control and Address Bus Number Systems: Binary, Octal, Decimal, HexaDecimal, Their Conversions, Binary Arithmetic. ASCII, BCD, EBCDIC.
Language Evolution : Generation of Languages : Machine, Assembly, High Level Languages. Characteristics of Good Language Translators : Compiler, Interpreter and Assembler. Source and Object Program.
UNIT - II :
Memory: Static & dynamic, RAM, ROM, PROM, EPROM, EEPROM, flash and Cache.
Storage Devices: Hard Disk, Zip Disk and Optical Disk. Pen Drive, Blue Ray
UNIT - III :
Input Devices: Keyboard, Mouse, Light Pen, Touch Screen, Voice Input , MICR, OCR, OMR, Barcode Reader and Flatbed Scanner.
Output Devices: VDU, Printers: Dot Matrix, Laser and Inkjet.
Plotters: Drum, Flat-Bed and Inkjet.
UNIT - IV :
Network: Network terminology, Topologies : Linear, Circular, Tree and Mesh. Types of Networks: LAN, WAN, MAN. Repeaters, Bridge, Routers, Brouters and Gateway. Modem for Communication between pc’s, wi-fi network, Introduction of Bluetooth and Infrared devices. Network protocols. Architecture : Peer-to-Peer, Client/Server.

Text Books:
1. Information technology concepts by Dr. Madhulika Jain, Shashank & Satish Jain, [BPB Publication, New Delhi.]
2. Fundamentals of Information Technology By Alexis And Mathews Leon
[Leon Press, Chennai & Vikas Publishing House Pvt Ltd, New Delhi]

B.Sc. Part I Semester I


Practical List

Programming in ‘C’
1) Program to Compute Fibonacci series
2) Program to find if a given number is prime or not.
3) Program to accept number and display it in words
4) Program to find sum of digits of any entered no.
5) Program to reverse the digit.
6) Program to find frequency of occurrence of a given number from array of N elements.
7) Program to reverse the array.
8) Program to Insert an element in One dimensional Array at a given position.
9) Program to Delete an element form One dimensional Array.
10) Program to Arrange string data (name of students) in alphabetical order using bubble sort.
11) Program to search the element in an array of N elements using
a) Linear search method
b) Binary search
12) Program to a) Multiply two Two dimensional Array’s (3 X 3 matrix)
b) Find largest element in Two dimensional Array ( 3 X 3 matrix).
13) Program a) To Check if given String is Palindrome or not
b) To calculate number of blanks, vowels and words from entered phrase.
14) Program to a) compute Cosine series : cos x = 1- x^2/2! + x^4/4!-x^6/6!+---------. b) Compute Sine series : sin x = x- x^3/3!+ x^5/5! –x^7/7! + ---------
15) Program to find Factorial of a number using recursive function.
16) Program using function to find sum of two numbers
a) With no argument & no return values
(b) With argument & no return values
(c) With argument & return values
17) Program to demonstrate passing structure to functions. Fields are empno, name, Basic
a) Call by Value
b) Call by reference
18) Program to
a) swap values of two variables by passing pointers.
b) Read two integers and determine bigger of the two with the help of function big() returning an integer pointer.
19) Create a sequential file and perform following operation fields are Roll, Name, M1, M2, M3
a)Add records
b)Process & Display output.


B.Sc. Part 1 Semester 2
Paper 1

OBJECT ORIENTED PROGRAMMING USING C++

UNIT - I :
Object Oriented Methodology:
Elements of Object Oriented programming, Objects, Classes, OOPs features.
Classes & Objects: Specifying a Class, Creating Objects, Accessing Class members, Defining member function, Outside Member Functions as inline, Accessing Member Functions within the class, Static data member, Access Specifiers: Private, Protected and Public Members.
UNIT - II :
CONSTRUCTORS & DESTRUCTORS: Introduction, Parameterized Constructors, Constructor Overloading, Constructors with Default Arguments, Copy Constructor, Destructor, Order of Construction and Destruction, Static data members with Constructor and Destructors.
OPERATOR OVERLOADING: Definition, Overloadable Operators, Unary Operator Overloading, Unary & Binary overloading, Rules for Operators Overloading.
UNIT - III :
DYNAMIC OBJECTS: Pointers to Objects, Creating and Deleting Dynamic Objects: New and Delete operators, Array of Objects, Array of Pointers to Objects, Pointers to Object Members, this Pointer.
INHERITANCE: Defining, Abstract classes, Single, Multilevel, Multiple, Hierarchical, Hybrid Inheritance, Constructor and Destructor in Derived Classes.
UNIT - IV :
VIRTUAL FUNCTIONS: Need for Virtual Functions, definition, Pure Virtual Functions, Abstract Classes, Rules for Virtual Functions.
EXCEPTION HANDLING: Exception Handling Model, List of Exceptions, Handling Uncaught Exceptions, Fault Tolerant Design Techniques, Memory Allocation Failure Exception, Rules for Handling Exception Successfully.

Text Books
1. Mastering C++ by K R Venugopal Tata McGraw-Hill , New Delhi.

Reference Books:
1. The C++ Programming Language –Bjarne Stroustrup
2. Programming with C++ - Ravichandran
3. Programming with C++ - Robert Lafore
4. Object Oriented Programming with C++ by E. Balagurusamy, McGraw Hill

B.Sc. Part 1 Sem 2
Paper 2

SYSTEM ANALYSIS AND DESIGN

UNIT - I :
Introduction : System, Subsystems, Components of Computerized Information System, Systems Analysts, SDLC, Prototyping.
Feasibility Study and Analysis: Identifying Problems, Organizing Feasibility Analysis: Economic, Financial, Organizational and Technological. Feasibility Decision, Choice of a solution.
Data Collection: Interviews, Brain Storming, Questionnaires, Document Search, Observation.
UNIT - II :
Structured tools and techniques of Data analysis : Structured English, Process Charts, SOP, Decision Tables and Decision Trees, Data Flow Diagram, Data Dictionary.
(Special emphasis on problem solving )
System Design : Input design: Input Validation, Human factor Consideration, Messages, System Tolerance. Output design: Categories of output, Design Principles, Control of Output. Forms: Principles of Form Design, Ways to ensure Quality Forms.
Codes: Types, Physical Representation of Codes, Principle of Code Design.
UNIT - III :
Implementation: Training, Operational Training and Related Activities, Planning to Implement Change, Change Strategies.
Testing: Preparation for Testing, Test Execution: Levels of Testing, Component, Function, Subsystem, System, Test Evaluation, Acceptance.
Conversion: Cold Turkey, Parallel, Pilot, Modular and Sequential Methods. Conversion Period Length. System Evaluation.
UNIT - IV :
Project Planning, Metrics for Project Size Estimation, Project Estimation Techniques, Scheduling: Work Breakdown Structure, Activity Networks and CPM, Gantt Charts, PERT Charts, Project Monitoring and Control. Risk Management, Software Configuration Management: Necessity, Configuring Management Activities
Software Reliability and Quality Management: Software Reliability, Software Quality, ISO 9000. Software Maintenance: Characteristics of Software Maintenance, Maintenance Process Models, Estimation of Maintenance Cost.
Software Reuse: What can be reused, Why no reuse so far, Basic Issues.

Text Books:
1) Information Systems Analysis, Design and Implementation By K. M. Hussain Donna Hussain [Tata McGraw-Hill Publishing Company Ltd, New Delhi]
2) Fundamentals of Software Engineering by Rajib Mall [PHI Publication]
3) Workbook on Systems Analysis & Design by V. Garg [PHI Publication]

Reference Books:
1. System Analysis and Design- Don Yeates, shiebls, Helmy (M).
2. System Analysis & Design - Edward –TMH
3. System Analysis and Design – Satzinger, Robert Jackson and Stephen Burd, Thomson Learning
4. Introduction to Systems Analysis Design, Igor Hawryszkiewycz, PHI


B.Sc. Part I Semester II

Practical List

OBJECT ORIENTED PROGRAMMING USING C++
1) Demonstrate the usage of Constructor and Destructor.
i) Define a class data with data member acct_no, balance containing constructor data to initialize data member and a member function display for output.
2) Program to demonstrate usage of a constructor and Destructor function. Declare a class with public data member count. The class containing one constructor and destructor to maintain updated information about active objects i.e. i) No of objects created. ii) No of objects Destroyed.
3) Program to accept the distance between city 1st & 2nd, city 2nd & 3rd. calculate the distance between city 1st & 3rd. Define a class road with private data member km, m, d1, d2, d3 containing member function getdata to accept values of d1, d2 and calculate for calculating distance.
4) Demonstrate the use of operators overloading (string manipulation: + for concatenation and relational operators for alphabetical comparison).
5) In a bank N depositor deposit the amount, write a program to find total amount deposited in the bank. Declare a class deposit with private data member Rupee and Paisa containing member function getdata, putdata.
i) Use array of objects
ii) Use Operator ‘+’ overloading.
6) Declare class event and accept time of first event and second event and find the difference between 1st and 2nd event. Containing public member function getdata and display with private data member hour, minute, second and total.
i) Use Operator ‘-‘ overloading.
7) Program to demonstrate Single Inheritance. Declare a class B and derive publically class D from B.
i) The class B contains private data member a, public data member b with member function get_ab, get_a, show_a.
ii) The derived class D contains data member c with member function mul and display.
8) Program to demonstrate Multiple Inheritances. Declare class M and N and derive publically class P from M and N.
i) Declare a class M with protected data member m and public member function get_m.
ii) Declare a class N with protected data member n containing member function get_n.
iii) Declare class P containing member function display.
9) Program to demonstrate Multilevel Inheritance. Declare a class student and derive publically a class test and derive publically class result from class test.
i) The class student contains protected data member roll_number with public member functions get_number and put_number.
ii) The class test containing protected data member sub1, sub2 with public member function get_marks and put_marks.
iii) The class result contains data member total and public member function display.
10) Program to demonstrate Hierarchical Inheritance. Declare a class Side and derive publically class Square from base class side and also derive publically class cube from base class side.
i) Class Side contains protected data member L with a member function set_values.
ii) Class Square contains member function sq.
iii) Class Cube contains member function cub.
11) Program to demonstrate usage of normal virtual function and pure virtual Function with abstract class.
12) Program to determine whether the input is +ve or –ve through exception.
13) Program to raise exception if an attempt is made to perform divide-by-zero.


B.Sc. Part 2 Semester 3  (From 2014-2015)
Paper 1

 

DATA STRUCTURES

UNIT - I :
LINKED LIST : Linked List, Representation of Single, Double, Header, Circular Single and Double Linked list, All possible operations on Single and Double linked List using Dynamic representation, Polynomial Representation and its Manipulation.
UNIT - II :
STACKS : Stacks terminology, Representation of Stacks in Memory, Operation on Stacks, Polish Notations, Translation of infix to postfix & prefix expression, Infix to Postfix Conversion, Evaluation of Postfix Expression, Recursion, Problems on Recursion, Quick Sort and Tower of Hanoi Problem.
UNIT - III :
QUEUE : Representation of Queues in Memory, Circular Queue. Dequeue and Priority Queue. Operations of above Structure using Array and Linked Representation.
SORTING AND SEARCHING: Selection Sort, Insertion Sort, Merge Sort, Efficiency of Sorting Methods, Big-O Notations.
Hash Tables, Hashing Technique, Collision Resolution Technique.
UNIT - IV :
TREES : Basic Terminologies, Representation of Binary Trees in Memory, Traversing of Binary tree, Binary Search Tree, Operation on Binary Search Tree, Heap Tree, Operation on Heap Tree, Heap Sort Method
GRAPHS : Basic Terminologies, Definition and Representation of Graphs in Memory: Linked List and Matrix Representation. Traversing graphs : BSF, DFS Method.

Text Books:
1.Classical Data Structures : D. Samanta. PHI, New Delhi.
2. DATA STRUCTURE : LIPSCTUZ SCHUM OUTLINE SERIES

Reference Books:
1. Data structure Using C++ : Y. Kanetkar
2. Data Structures Using C++: Tennenbaum
3. Data structures by Tremblay Sorenson
4. Data structures by Bhagat singh Naps


B.Sc. Part 2 Semester 3
Paper 2

 

OPERATING SYSTEMS

UNIT - I :
Structure of Operating System, Operating System functions, Characteristics of Modern OS. Process Management: Process states, Creation, Termination, Operations on Process, Concurrent process, Processes Threads, Multithreading, Micro Kernels
CPU Scheduling: Schedulers, Scheduling Methodology, CPU Scheduling Algorithm: FCFS, SJF, RR, Priority Scheduling.
UNIT – II :
Performance comparison : Deterministic Modeling , Queuing analysis, Simulators.
Deadlock and Starvation: Resource Allocation Graph, Conditions for Dead Lock, Dead Lock Prevention, Dead Lock Detection, Recovery from Deadlock.
UNIT - III :
Memory Management: Logical Vs. Physical Address Space, Swapping, Memory Management Requirement, Dynamic Loading and Dynamic Linking, Memory Allocation Method: Single Partition allocation, Multiple Partitions, Compaction, paging, segmentation, Segmentation with paging. Protection.
UNIT - IV :
I/O Management: I/O hardware, I/O Buffering, Disk I/O, Raid, Disk Cache. File Management: File Management system, File Accessing Methods, File Directories, File Allocation Methods, File Space Management, Disk Space Management, Record blocking. Protection Mechanisms: Cryptography, Digital Signature, User Authentication.

Text Books:
1: Operating Systems by P. Balakrishna Prasad [Scitech Publication]

Reference Books:
1. Operating System Concept : Silbershaz (Addision Education)
2. Operating Systems - H.M. Deitel - Addision Wesley.
3. Operating Systems- John J. Donoven.
4. Operating System : A.S.Godbole (TMH)
5. Modern Operating Systems : Tenenenbaum (Pearson Education)
6. Operating System : Peterson.


B.Sc. Part II Semester 3

Practical List


Data Structure (Programming using C++)

1) Program to insert a node at the beginning, at the end and in the middle of the given linked list.
2) Program to delete a node at the beginning, at the end and in the middle of the given linked list.
3) Program to create a linked list of customer names and their telephone numbers. (Using Menu Driven and include features of adding a new Customer and deleting an existing Customer.)
4) Program to reverse a linked list.
5) Program to search a value in the given linked list.
6) Program to insert a node at the beginning, at the end or in the middle of a given doubly linked list.
7) Program to delete a node from the beginning, at the end or in the middle of a given doubly linked list.
8) Program to create, insert and delete a node in Circular linked list.
9) Program to push and pop an element into / from a stack implemented using linked list.
10) Program to push and pop an element into / from a stack implemented using Array.
11) Program to evaluate postfix expression.
12) Program to sort an array using quick sort.
13) Program to solve Towers of Hanoi problems using recursion.
14) Program to perform insertion and deletion operation in linear queues.
15) Program to perform insertion and deletion operation on circular queues.
16) Program to sort an array using Insertion sort.
17) Program to sort an array using Selection sort.
18) Program to insert an element in a binary search tree.
19) Program to traverse inorder of a binary tree.
20) Program to traverse preorder of a binary tree.
21) Program to traverse postorder of a binary tree.


B.Sc. Part 2 Semester 4  Paper 1


JAVA PROGRAMMING

 UNIT - I :
Introduction to Java: -History of Java, features of Java, getting started with Java.
Java programs:-Introduction of Application & Applets. Variables: -Variable naming, variable initialization, assign values, Rules of variables, Scope of variable. Operators: -Arithmetic, Assignment, Unary, Comparison, Shift, Bit- Wise, Logical, Conditional, New, Special, Relational. Data types:-Integers, Char, String, Float etc. Typecasting:
Tokens: -Java tokens Order of precedence of operators Streams: - Input and output.
UNIT - II :
Creating a class & subclass: -Declaring a class, Naming class, Rules to assign Class & Subclass, Creating a new object, Class of an object. Data members: -Declaring data member, Naming variables, using class members. Methods: -Using data members, Invoke a method, passing arguments to a method, calling method. Access Specifier & Modifiers: -Public, Private, Protected, Static & Final. Overloading: -Method overloading, Constructor overloading. Java class library: - Different types of classes.
Decision making & loops:-If-then-else, Switch,? : operator, While-loop, do-while loop, for. Array: -Creating an array, one-dimensional array, two-dimensional array. String: -String array, string methods. Inheritance: -Single & multiple inheritances Interfaces: -Defining interfaces, extending interfaces, implementing interfaces.
UNIT - III :
Packages: -Java API packages, creating packages, accessing packages, adding a class to packages. Import statement: - Introduction & implementation of import statement.
Applets:-Introduction to Applets & Application, how applets application are different creating An applet. Applets life cycle, designing a web page, creating an executable applet, running the applet, applet tags, passing a parameter to applet, HTML tag,
Converting applet to application. Threads:-Overview of threads, single & multiple threads, lift cycle of threads, stopping & blocking threads, working with threads, priority to thread, synchronization. Exceptions & Errors:-Introduction, types of error, exception, syntax of exception, handling techniques, exception for Debugging.
UNIT - IV :
Event: -Event driven programming, handling an (AWT) events. Graphic class:-Introduction, the graphic classes, drawing & filling of lines, rectangle, circle & ellipse, arcs, polygons, text & fonts, creating a font class, font objects, text, coloring object.
Streams:-Introduction, Abstract stream classes, file input & output.
AWI Applications: -Creating a GUI using AWT toolkit, using component class, frames.
Components & Control: -Textfield, textarea class, label, button, choice, list, checkbox, class, and combo. Menus: -Creating a popup menus. Image: - Type of image, Properties of an image, Displaying an image. Layouts: -Using Window Listener interface, Different types of Layout, Layout manager, Flow manager, Grid manager. Container: -Different types of container (Frame, Dialog, Panel)

Text Books:
1. Programming with Java a primer II edition:-E Balaguruswamy(Tata McGraw-Hill)
2. Java Programming (For absolute beginners) Russell PHI
Reference Books:
1. Black Book on Java
2.Java-Complete References



B.Sc. Part 2 Semester IV Paper 2


LINUX OPERATING SYSTEM

UNIT - I :
Logging In and Logging Out, Anatomy of Linux OS, Directory Structure, /usr Directory, File Types: User datafiles, System data files, Executable files. Naming files and directories, Spawning Processes. Shell: Creating User Account, Shell Program, bash shell, Changing shell prompt. Commands: Basic Syntax for a command, Exploring the Home Directory, ls, mkdir, rmdir, stat, cat, rm, mv, cp
UNIT - II :
Editor: Vi editor. Hooking up Hardware Devices: Formatting a Floppy Disk, Gathering important system information. Backing Up and restoring the File System: Simple Backup, gzip, gunzip, tar. Printing files: Print Spool directory, Sending files to Printer.
UNIT - III :
Sharing Files with other Users: Maintaining User Accounts, Changing Password, Creating Group Accounts, Granting Access to files, Changing File Ownership, Protecting Files, Making a File Read-Only. Working with Processes: Types of processes, ps Command, Creating process, killing process, free command and top utility.
UNIT - IV :
Managing Disk Space: df, du commands, Creating Additional Free Disk Space, Locating Unused Files, Setting System Clock. Communication Utilities: who, who am i, finger, mesg, write, wall, talk, Creating a message of the day. X Window System, Graphical User Interfaces: KDE and GNOME Desktop Environment.

Text Books:
1. SAMS Teach Yourself Linux by Craig and Coletta Witherspoon [Techmedia]

Reference Books:
1. LINUX complete reference by Richard Peterson



B.Sc. Part II Semester IV


Practical List


JAVA PROGRAMMING

 
1) a) Write a program that declares a class, object and also it access the data member of it’s class.
b )Write an applet that accepts a value from the user and display it.
2) a) Write a program that accept marks of 5 subject, calculate total, percentage and display the grade according to their percentage.
b) Write a program that will print the multiplication table from 1 to 10.
3) a) Write an program to accept a set of values from the user into an array, display the
values as well as their average.
b) Accept string into a text field, sort the characters in the string and display the
sorted string in another text field.
4) a) Write a program to demonstrate the overloading & constructor.
. b)Write an applet that accepts two numbers from the user and display all the numbers between them.
5) a) Write a program to demonstrate the single inheritance.
b) Write an applet to accept ten numbers into array, sort the array and display the
sorted array. Accept the ten numbers into the ten different text fields.
c) Write a program to create a multiple selection list and also display the list of
items selected by the user.
6) a) Write an applet to demonstrate the user menu Bar.
b) Write a sample program that will convert the applet to application.
c) Write a program to demonstrate the Interfaces.
7) a)Write a program for exception handling that accept two no as textfields, the values are added & their sum is displayed. The code traps the error when user could enter text instead of an numbers.
b)Write a program that would accept it input for the user & store it in a file called Test. java.
8) a) Write a program to implement graphic class draw (line, rectangle, fill rectangle,
Circle, oval).
b) Write an applet that display a choice menu of three buttons (Add, Modify,
Delete) selecting a choice from the menu should display the appropriate button
Use the show () method of the layout Manager.
9) a)Write a java program to read & display the information from the file ABC. dat.
b) Write a program to implement the concept of loading & displaying images.
c) Write a program to demonstrate the Animation in Java.


B.Sc. Final Semester 5 (From 2015-2016)
Paper 1


VISUAL BASIC PROGRAMMING

 UNIT - I :
Working with Visual Basic Window Components: Menu Bar, Tool Bar, Project Explorer Window, Form Layout Window, properties Window, Toolbox, Code Editor Window Working with Forms: Properties, Events, Methods Working with Basic Controls:Label, CommandButton, TextBox, OptionButton, Frame, CheckBox, ListBox, ComboBox, Image, Scroll, Picture, Timer, DriveListBox, DirListBox, FileListBox and Shape Controls. Basic Programming Fundamentals: Variables, Data types, Constant, Conversion Function. Scope of Variable: Public, Private Static. Operators: Logical, Arithmetic, Concatenation, Comparison. Decision Structure: If.. Then, If..Then..Else, Select Case.. End Case. Loop Structure: Do..While, While.. Wend, For.. Next, With..EndWith. DoEvents()
UNIT - II :
Arrays: Dynamic Array, Preserve and Control arrays. Procedure: General procedure, General Methods for Passing Arguments to a Procedure, Functions: User-Interaction, String, Math, Date, Conversion Functions. Modules: Form, Standard.
UNIT - III :
Menus: Creating, Adding Menu Items, Creating Shortcut, Adding Separators Bars, Submenus, Code for Menus. Creating Popup Menu: System, Custom. Database Handling: Database Concepts, Creating and Accessing Database, Using Data Control.  Using DAO: Creating Search Programs, Numeric Search and Complex Search Programs.
UNIT - IV :
Using ADO Data Control, Data Link, ODBC Data Source name, Using Connection String, Creating Navigating buttons. Working with Advanced Data Controls : DataList Control, DataCombo Control, DataGrid Control and Msflexgrid Control. Handling Errors : Run Time, Trapping and Handling Error, ERR Object. Data Environment and Data Reports.

Text Books:
1) VISUAL BASIC – to Advance by Soma Dasgupta [BPB Publication]

Reference Books:

1. Evangelos Petroutsos, Mastering Visual Basic 6.0 BPB Publication.
2. VISUAL BASIC 6 COMPLETE REFRENCE (TMH PUB)
3. Visual Basic 6 Deitel & Deitel (Pearson Education)
4. Mastering VB 6.0 Black Book -Peter - Norton-Techmedia.

B.Sc. Final Semester 5 Paper 2


DATA BASE MANAGEMENT SYSTEM


UNIT - I :
DBMS : Definition: Databases, DBMS, Problems with traditional file processing system, Objectives of the database systems, Three level architectures of DBMS, Component of DBMS, Database Administrator, Database Users, Data model, Different types of data models, Concepts of Hierarchical, Network Models.
UNIT - II :
E-R Models : Basic Concepts, Entity, Attributes, Relation Ship, Mapping, Keys, Weak and Strong Entity Set, Problems on E-R Diagrams, Extended E-R Features: Specialization, Generalization, Aggregation, Problems on Reduction of an E-R Schema to Tables, Tabular representation of Strong, Weak entity Sets and Relationship Sets.
UNIT - III :
Relational Model: Structure, Relational Algebra, Fundamental Operations, Set –Intersection, Natural Join, Division and Assignment Operation. Extended Relational Algebra Operations, Aggregate Functions.
UNIT – IV :
Functional Dependency: Functional Dependency, Fully Functional Dependency, Partial Dependency, Transitive Dependency, Multi Valued Dependency.
Normalization, Normal Forms ( 1NF, 2NF, 3NF, BCNF, 4NF, 5NF). Problems on Normal forms.

Text Books:
1) Data Base System Concepts By A SilbersChatz By Henry Korth And S.Sudarshan [Mcgraw-Hill ltd. New Delhi] 3rd Edition.
2) Introduction to Data Base Management by NAVEEN PRAKASH [Tata McGrawHill ltd.]

Reference Books:

1. Bipin C. Desai, An Introduction to Database Systems, Galgotia Publications.
2. Raghu Ramakrishnan & Johannes Gerhrke, "Data Base Management Systems", Mc Graw Hill International Edition, 2000
3. Muzumdar, Introduction to Database Management Systems. TMH

B.Sc. Final Semester V


Practical List

VISUAL BASIC PROGRAMMING

1. a) Make an application in Visual Basic, which display a picture when
i) Command button with caption “ click here” is clicked.
ii) After delay time 100ms (by using Timer control)
b) Design an Application to find
iii) sin x = x- x^3/3!+ x^5/5! –x^7/7! + --------- iv) cos x = 1- x^2/2! + x^4/4!-x^6/6!+---------. v) Find a even/odd no. vi) Find Factorial of no. vii) Find if number is a Prime Or not prime
2. a) A book stall gives discount on the books as per following conditions,
No. of books purchased Discount
<=5 Nil
>5 and <=10 10%
>10 and <=15 12%
>15 20%
Create a form as follows to calculate the discount.
Unit Price
No. of Books
Total Price
Discount
Total Amount
b) Design a form for speed control program using scrollbars.
3. a) Design an application, which display a text and given choice to change text to bold, italic, underline (any one or in combination) using check box controls.
b) Write a VB code to give five choices of colors. Design an application to choose any one color using option button and change the forecolor of TextBox Caption.
4.a)Write a program in VB to build application to display sorted list of group A & group B student in two list boxes. Make provision to shift name (s) on either side using List Box control.
b)Write a program in VB to build application which display list of states. Make provision to display capital of the state and cities when a particular state is selected using combo box.
5. a)Write a VB Program to create an array of N elements. Find the frequency of element and display the positions in an array.
b) Create an application, which counts no. of characters and no. of words entered in
TextBox.
6) Create Menus using menu editor as follows.
File
New
Open
Save
Exit
Edit
Cut
Copy
Paste
And Write appropriate code on click event of New & Exit Menu Options.
7) Create a database pay.mdb using Visual Database Manager with fields code number (n), Name of Employee (T), Designation (T), Address (T), Joining date (d), Basic pay (n), Status (T) [permanent / temporary], Department (T) [purchase, sales, account]. Achieve connectivity using Data control. Develop an application in V.B. to display the data of employees using MSFlexgrid control as shown below with company’s logo.
EMPLOYEE INFORMATON < logo>
I.D. NAME ADDRESS DESIGNATION DEPT. Date of Joining Status BASIC
8) Design a Menu as shown below.
Record
DATABASE
Open
Append
Save
Exit
Create table pay.mdb using Visual Data Manager and connect it to vb application using Data Control. Display/view records using DbGridControl.
Create an application in V.B. to open database of employee pay.mdb by using menu option “OPEN” .Use APPEND and SAVE options to Add & Save records in DATABASE.
9) Open DataBase fees.mdb with fields: -
Name, class, fees Using Visual Data Manager. Use Data control for connectivity.
Develop a menu driven application in V.B. to: -
I) Compute total fees class wise
II) Search a record of a particular student belonging to a particular class.
Record
DATABASE
Open
Compute total fees
Exit
Display
Search
10) Create a DataBase College.mdb containing fields:-
Name, Class, Marks in phy, Comp. Sc., Maths and Percentage Using Visual Data Manager.Connect database to vb application using Data Control.
Develop a Menu driven application in V.B. to
I) Edit a records class wise.
II) Calculate class wise passing percentage where a student is declared “pass”, if he/she gets percentage > = 45.
Display Class wise list of students who are placed in Ist Division. (Percentage>=60)
Edit
DATABASE
Display
Create
B.Sc.-I
B.Sc.-II
B.Sc.-III
Exit
11) Create a table book.mdb using VDM containing fields:-
Name of book, subject, price, date of purchase, Name of publication,
Develop a menu driven application in V.B. to: -
I) Open Database
I) Delete a record of book.
II) Display subject wise list of book in proper format.
Record
DATABASE
Delete
Open
Exit
Use DataControl for connectivity.
12) Create a table using VDM to store required information for computing Electricity Bill.
Charges are as follows 1) 1.25 /units for 1st 30 units 2) 2.90 / units from 31 to 300 units 3) 4.0 /units from 301 to onwards.
Develop a menu driven application . to: -
I) Open Database
II) Display Electricity Bill in proper format.
III) Delete a record of book
IV) Append a record
V) Edit record
Record
DATABASE
Delete
Open
Append
Display Bill
Edit
Exit
Use ADODC to achieve connectivity.
13) Create the database emp.mdb having table emp_biodata directly through MSACCESS and Display records using datagrid control.
Develop a menu driven application . to: -
I) Open Database II) Display records using datagrid control.
III) Search a record IV) Append a record
Record
DATABASE
Append
Open
Search
Display
Exit
Use ADODC to achieve connectivity.
14) Create an application for employee salary sheet. IF BASIC >5000 HRA=40 % OF BASIC DA=50 % OF BASIC IF BASIC >= 2500 HRA = 35 % OF BASIC DA=45 % OF BASIC IF BASIC >=1500 HRA = 30 % OF BASIC DA=40 % OF BASIC OTHER WISE HRA= 20 % OF BASIC DA =30 % OF BASIC TA= 150 PF= 15 % OF BASIC PT = 18% OF BASIC
Develop a menu driven application in V.B. to: -Compute total Salary
Search a record of a particular employee belonging to a particular department.
Record
DATABASE
Compute total salary
Open
Search
Display
Exit
Use ADODC to achieve connectivity.
Note -: While designing menu MDI forms are expected wherever required.

B.Sc. Final Semester 6 Paper 1

COMPILER CONSTRUCTION

UNIT - I :
Compilers and translators, need, the structure of a compiler, Lexical Analysis, Syntax analysis, Intermediate code Generation, Optimization, Code Generation, Book keeping, Error Handling
UNIT - II :
High Level programming languages, Definitions of programming languages, The lexical and syntactic structure of a language, Data elements, structures, Operators, Assignment Statements, Data Environments, Parameter transmission, Storage management.
UNIT - III :
The role of the lexical analyzer, Approach to the design of lexical analyzer, Implementation of lexical analyzer, Context free grammars, Derivations and parse trees, Ambiguous grammar.
UNIT - IV :
Parsers, Shift-reduce parsing, Operator precedence parsing, Top-down parsing, predictive parsers, Symbol Table , Code Optimization: The principal source optimization, Loop optimization, The DAG representation of basic blocks, Code Generation : A machine model, a simple code generator, Register Allocation and assignment.

TEXT BOOKS :
1. Principles of Compiler Design - A.V. Aho, J. D.Ullman : Pearson Education.

Reference Books:
1. Modern Compiler Design- Dick Grune, Henry E. Bal, Cariel T. H. Jacobs,
Wiley dreamtech.
2. Engineering a Compiler-Cooper & Linda, Elsevier.
3. Compiler Construction, Louden, Thomson.


B.Sc. Final Semester 6 Paper 2

 
SQL AND PL/SQL

UNIT - I :
CODD’S Rules, Oracle Database Objects, Sub Languages of SQL, Data types, Operators.
DDL Statement: Creating Tables, Deriving Table from existing table, Altering, Dropping Tables. Integrity Constraints, Specifying Names for the Constraints, Viewing Integrity Constraints, Adding and Dropping Constraints. DML Statements: SELECT statement, Insert, Update, Delete, Working with Sequences and Synonyms. Built-in functions: Arithmetic, Date, Character, Conversion, Single row, Aggregate, Decode.
Joins, Set Operators and Sub queries. DCL and TCL Statements: Grant, Revoke, Commit, Rollback and Savepoints.
UNIT - II :
VIEWS: Creating Views, Dropping Views, Inserting, Updating and Deleting Data using Views, Types of Views. PL/SQL Programming: PL/SQL Data Types, Identifiers, Operators and Expressions, Iterative Statements, Conditional Statements, emphasis on Problems
UNIT - III :
Exception Handling : Predefined Exceptions, User defined Exceptions. Cursors: Declaring Cursors, Opening and Retrieving Records, Closing cursors. Attributes of Explicit and Implicit Cursors, Parameter Passing in Cursors. Procedures : Create and Drop Procedure, Creating Procedures with Parameters, Calling Procedures, Granting the EXECUTE Permission Problems on Exception Handling, Cursors and Procedures.
UNIT - IV :
Function: Creating and Dropping Function, Purity Levels in Functions, Executing Functions. Triggers: Create Triggers, Type of Triggers, Creating BEFORE and AFTER Triggers, INSTEAD-OF Triggers, Trigger Predicates, Inserting, Updating and Deleting Triggers, Enabling , Disabling and Dropping Triggers. Problems on Functions and Triggers

Text Books:

1. Understanding ORACLE By Ivan Bayross [ BPB Publication]

Reference :
1. Database System Using Oracle: A Simplified Guide to SQL & PL-SQL: Nilesh Shah, PHI Publication.
2. Database Management Systems (Complete practical approach) by Sharad Maheshwari & Ruchin Jain, Firewall media
3. Dr. P.S.Deshpande SQL & PL/SQL for Oracle 10g Black Book
4. Scott Urman Programming PL/SQL TMH

B.Sc.Final Semester VI

Practical List

SQL and PL/SQL (ORACLE)

1) DDL Statements :
1.a) Create the table Invoice with fields inv_no(char, Primary key), mv_no(number), cust_id(char), issue_date(date), return_date(date).
Insert data in the table invoice as follows:
Inv_no mv_no cust_id issue_date return_date
I01 1 a01 21-Dec-06 25-Dec-06
I02 3 a02 19-Oct-06 30-Oct-06
I03 5 a03 14-Jul-06 1-Aug-06
I04 5 a04 15-Sep-06 30-Sept-06
I05 6 a05 19-Oct-06 21-Oct-06
I06 7 a06 1-Jan-06 15-Jan-06
I07 8 a07 15-Aug-06 30-Aug-06
I08 2 a05 1-Oct-06 15-Oct-06
I09 4 a01 12-sep-06 19-Sep-06
I10 9 a02 1-Dec-06 15-Dec-06
I11 6 a05 2-feb-06 14-feb-06
I12 3 a06 1-Jan-06 10-Jan-06
1.b) Modifying Table Structure by adding the new field price (number) and increasing the size of inv_no.
1.c) Add and Drop Constraints
i) Add primary key constraint
ii) Drop primary key constraint
iii) Add Unique key constraint
iv) Drop Unique key constraint
v) Add check constraint
2) DML Statements:
2.a) Add a records in above table
2.b) i)Change inv_no of I12 with ‘I111’.
ii)Change issue_date of customer of cust_id ‘a01’ to ’22-Dec-06’.
iii)Change movie no of cust_id ‘a05’ to 11.
iv)Display all movies with issue_date between 01-jan-06 to 01-sep-06
v)Display information for cust_id ‘a01’ & ‘a02’.
2.c) i) Delete records with inv_no ‘I11’from invoice table.
ii)Delete records having return date <=’20-Jan-06’.
3) DCL and TCL Statements
i) Grant insertion and deletion privileges on invoice table to another user XYZ.
ii) revoke the deletion privileges from user XYZ.
iii) after insertion of 2 records in invoice table create savepoint A.
iv) delete a record and create savepoint B.
v) rollback to A
4) Create the table Movie with fields mv_no(number, Primary Key), title(Char), Type(char), star(char), price(number), releasedate(date)
i) Add few records in above table
ii) Count total number of customer
iii) Calculate total price of all the movies.
iv) Calculate average price of all the movies.
v) Determine the maximum & minimum movies prices and rename the title as
MAX-PRICE and MIN-PRICE.
vi) Count the number of movies having price greater than or equal to 150.
vii) display total no. of movies released in the current year.
viii) display all the movie which start with letter ‘K’.
5) i) Create a View of table Invoice with following column inv_no(char, Primary key), mv_no(number), cust_id(char)
ii) Insert and delete records
iii) drop view
6) PL/SQL Programming:

Write a PL/SQL block
i) to find largest of 2 numbers
ii) to reverse the number
7) Cursor
i) Write a Cursor to fetch all rows of table invoice
ii) Write a Cursor to display all movies with issue_date between 01-jan-06 to 01-sep-06. If no record found then use Exception to display proper message.
iii) Write a Pl/SQL to accept the name and age of student and insert into table STUD after validating age not less than 18 otherwise raise exception
8) Create Procedure
i) to swap two values
ii) to display the cust_id, mv_no and call the procedure through main program
9) Create Function
i) to find gcd of two numbers.
ii) to find the total price of all the movie start with letter ‘K’ and call the function through main program
10) Create Trigger
i) that restricts the user from performing a DML on movie table on ‘Monday’
ii) Covert all the movie name into the upper case on insertion of each row.

 BSc Bachelor of Science, BCA Bachelor Of Computer Application, BCCA, Bachelor of Commerce & Computer Application BE IT/CS, Information technology/Computer Science MCA, Master of Computer Application MCM, Master of Computer Management Diploma , Polytechnic B.Arch Bachelor Of Architecture, Others,

Basic Programming

C / C++ ,

Testing

Software Testing,

Hardware & Networking

CCNA, MCSE, Hardware, Networking

Courses at Atlanta

New Batches start Every week On Mondays and Wednesdays.

New Batch Starting Date & Timing

Copyright © 2010-2023 All Right Reserved - Atlanta Computer Institute, Nagpur.