ACADEMIC PLANNER : COMPUTER SCIENCE

ACADEMIC PLANNER : COMPUTER SCIENCE

VIJAYA COLLEGE Page 1

Academic planner for 2009-2010 CSITI: Computer Fundamentals and Programming in C

Month Topics No of Hrs

JULY-AUGUST

1.COMPUTER FUNDAMENTALS Introduction to Computers

Evolution of Computers. Generation of Computers. Classification of Computers- Analog Digital and Hybrid Computers. Classification of Computers according to size- Super Computers. Mainframe Computers. Personal Computers (Different Types) and Terminals (Different Types), Characteristics of Computers. Block Diagram of a Digital Computer.

Introduction to Number system and Codes Different number systems and their conversions (Decimal. Binary. Octal, and Hexadecimal).l's complement and 2's complement. Floating Point numbers. Coding- BCD. Gray. ASCII and EBCDIC.

AUGUST-SEP

Boolean algebra and Gate networks Fundamental concepts of Boolean algebra. Inverter gales. AND gate. OR gate. NAND gate.NOR gate. X-OR gate. X-NOR gate. The universal property of NAND gate and NOR gate.Basic laws of Boolean algebra, DeMorgan's theorems. Simplification of Boolean expression .Karnaugh map (SOP).

Combinational Logic Adders (Half and Full), Decoder, Encoder, Multiplexer, De-multiplexer (Introductory

Concepts only).

SEP-OCTOBER

Flip-Flops Flip-flops (SR flip-flops. D flip-flops. JK flip-flops). Edge- Triggered flip-flops and Master-Slave flip-flops. Introduction to Registers and Counters

Computer Organization Instruction format. Addressing modes. Instruction set.

OCTOBER-NOV

Memory Memory Hierarchy. Primary Memory-Volatile and non-volatile memory. RAM and ROM. EPROM and EEPROM. Secondary Memory- Floppy Disk and Hard Disk.

Input/Output Devices Input Devices-Keyboard Mouse. Output Devices- VDU. Printers.



Introduction to Programming Concepts Types of Programming Languages. Software. Classification of Software. Application software and System Software. Structured Programming. Algorithms and Flowcharts with Examples.

II. PROGRAMMING IN C

JULY-AUGUST

Introduction to C History of C. Structure of a C program. The C character set. Constants, verities and keywords. Types of C constants and variables.

C Instructions Type declaration and arithmetic instructions. Integer and float conversions. Type conversion in assignment. Operators in C. Hierarchy of operations. Control Instructions. Input / Output Statements in C (Formatted and Unformatted).

AUGUST-SEP

Control Structures Decision control structures. Logical operators, conditional operator, and relational operator Loop control structures- while, do-while. for loop. Break statement. Continue statement switch-case control structure, go to statement

Arrays One dimensional and multidimensional array. Declaration, initialization, and An Manipulations. Sorting ( Bubble sort ) Strings- Basic Concepts. Library Functions.

SEP-OCTOBER

Functions Definition, function definition and prototyping, types of functions, types of arguments, recursion, passing arrays to functions. Storage classes in C- Automatic. Register, Extern and Static Variables.

Pointers Definition, Notation. Pointers and arrays, array of pointers. Pointers and functions- call value and call by reference. Pointers to pointers.

OCTOBER-NOV

Structures and Unions Definition, declaration, accessing structure elements. Array of structures. Structure Structure, Pointers and structures. Unions - definition, declaration, accessing union elements, Typedef,



Enum Bit fields. Bitwise operators

Bitwise AND, OR, exclusive OR, complement, right shift and left shift operators C preprocessor

Types of C preprocessor directives. Macros. File Inclusion. Files

File opening modes. Text and Binary files. High level and Low level operations on .Files. Command Line Arguments.

III semester CSIIIT1 - OOPS USING C++ AND DBMS

JULY-AUGUST

1. OOPS and C++ Introduction to OOP and C++

Characteristics and benefits of OOPs , History of OOP, Structure of C++ program, Data types and operators, Statements of C++, tokens, Expressions and control structures, operators in C++.

Input output objects Usage of cin and cout objects, Comparison of stdio.h and iostream.h

Control structures If, if-else, nested-if, switch, while, do-while, for, nested for, break and continue statements (use of conditional and logical operators).

AUGUST-SEP

Arrays, Functions and structures Array fundamentals, types, strings, C supported functions, prototyping, Inline functions, overloaded functions, functions with default arguments, storage classes, call-by-reference, return by reference, defining and using a structure.

Objects and classes Introduction-specifying a class-defining member function-nesting of member functions, arrays within a class, Arrays of objects, Objects as function arguments – Friend functions- pointer to members.

SEP-OCTOBER

Constructors, destructors and operator overloading Constructors, types of constructors, copy constructor, overloading constructs, destructors, OPERATORS overloading (Unary and binary operators), data conversion.



OCT-NOV

Inheritance Extending Classes- defining derived classes-single, multilevel, multiple, hierarchical, and hybrid inheritance. Virtual base classes- Abstract classes- pointers. Virtual functions and polymorphism-pointers to objects, this pointer,

File and streams C++ streams, C++ stream classes- unformatted I-o operations –formatted I-O operations-managing O/p with manipulators –working with files-classes for file stream operations-opening and closing files-sequential I-O operations.

2. DATA BASE MANAGEMENT SYSTEM

JULY-AUGUST

Introduction Basic Concepts: Data, database, DBMS, Disadvantages of File oriented systems, Advantages of DBMS, database users, Database Languages, Characteristics of Database, Role of DBA, Data Abstraction (Views) – Logical, Conceptual & Physical, Data independence – physical and logical independence.

(06)

AUGUST-SEP Data Models Introduction to Data Models: E-R model, Relational model, network model and hierarchical model.

(02)

SEP-OCT

RDBMS

Relational database concepts – attribute, tuple, types of attributes – single, multi-valued, stored, derived etc., keys – primary, index, candidate, alternate, foreign, Relationships, Relational algebra operations– UNION, INTERSECTION, DIFFERENCE, CARTESIAN PRODUCT, SELECTION, PROJECTION, JOIN, DIVISION, relational calculus, Domain, Domain integrity, Integrity rules – Entity integrity, referential integrity, Normalization and its properties (1st , 2nd and 3rd and BCNF)

(05)

OCT-NOV

DL and DML DDL commands - create table/views/index, drop, alter, DML commands – select, insert, delete, update, etc., DCL commands – grant, revoke, commit, TCL commands, SQL – query, sub-query, nested query, Joins – natural, inner, outer join.

(05)

Database design and Distributed databases Design guidelines, Overview of distributed databases

(01)



CSVT1 INTERNET TECHNOLOGY

JULY-AUGUST INTERNET TECHNOLOGY

Basic Internet Concepts History, components, Security, Protocols, Internet addressing, DNS and directory services.

(05)

AUGUST-SEP

Internet applications Electronic mail, News groups, UUCP, FTP and Telnet.

(05)

SEP-OCT

World Wide Web Overview, Hyper Text Markup Language, Uniform Resource Locator, HTTP, Common Gateway Interface, Multipurpose internet mail extensions, web browsers, search engines.

(08)

OCT-NOV

HTML Introduction, Lists in HTML, Ordered and Un ordered lists, Directory lists, Hyperlinks, HTML tables, Frames, HTML forms. Recent Development in Information Technology.

(15) (02)



CSVT2 JAVA PROGRAMMING AND UNIX/LINUX OPERATING SYSTEM JULY-AUGUST

1. JAVA PROGRAMMING

Introduction Features of Java, Data Types, Variable, Operators. Java Programming structure, Arrays – One Dimensional array, Two Dimensional array. Conrtol Structure:- if statement, switch statement, while statement, do-while statement, for loop, continue and break statement. Access specifiers – public, private.

(03)

AUGUST-SEP

Class and Objects Class fundamentals, declaring objects, Access modifiers – final, static, abstract, native, volatile, synchronized. Introduction to methods, constructors, command line arguments. Inheritance – single or simple inheritance, Multi level inheritance. Using SUPER, abstract and final key word with inheritance.

(04)

SEP-OCT

Packages and Interfaces Packages- define package, CLASS PATH, access protection, importing packages. Interface- define interface, implementing interface, variables in interface. Lang-Package:- Wrapper classes. Util-packages:- Date, Calendar, Random. IO-Packages:- File input stream and output stream.

(06)

OCT-NOV

Exception Handling and Multi Threading Exceptions

Fundamentals of Exception, Exception types, using try & catch, multiple catch, nested try, throw, finally, built-in –exception, user defined exceptions. MultiThreading : - Thread fundamentals, priorities, Creating thread using Thread class and Runnable interface.

(05)

2. UNIX/ LINUX OPERATING SYSTEM

JULY-AUG

Introduction History, features, architecture, File System : Boot Block, super block, Inode table, data block, storing & accessing files, directory & file related commands.

(03)

AUG-SEP

Special tools utilities Filters process, piped process, process control, FOR, EXIT, WAIT & EXEC commands, Unix system calls & library functions.

(03)



SEP-OCT

System administration User & supervisor privileges & facilities. Controlling processes accessing the file system, security issues, secondary storage management.

(03)

OCT-NOV

Shell programming C shells – shell variables, parameter shell commands, if, while, until, for, break, & continue, simple programs. Unix system communication : Introduction, write, read, wall commands.

(08)

BCA105T – PROGRAMMING CONCEPTS Using C

52 Hrs JULY-AUGUST

Computer Programming : Basic Programming concepts - Algorithm, Flowcharts, Modular Programming and structured programming.

(3)

‘C’ PROGRAMMING Problem solving using Computers, Concept of flowcharts and algorithms ( 5) AUGUST-SEP

Overview of C : Introduction, Importance of ‘C’, Sample ‘C’ Programs, Basic structure of ‘C’ programs, Programming style, Executing a ‘C’ Program.

(3)

Constants, Variables and Data types : C’ Tokens, keywords, and identifiers, constants, variables, datatypes, declaration of variables, assigning values to variables, defining symbolic constants.

(3)

Operators and expression : Arithmetic operators, Relational operators. Logical operators, Assignment operators, increment and decrement operators, conditional operators, bitwise operators, special operators, some computational problems, type conversion in expressions, operator precedence and associativity. Mathematical functions.

(5)

Managing input and output operators : Input and Output statements, reading a character, writing characters, formatted input, formatted output statements.

(3)



Decision making, Branching and looping : Decision making with IF statement, simple IF statement, The IF-ELSE statement, nesting of IF .. ELSE statements, The ELSE –IF ladder, The switch statement, The ?: operator, The GOTO statement, The WHILE statement, The DO statement, The FOR statement, jumps in loops.

(6)

SEP-OCT

Arrays : One dimensional arrays, Two-dimensional arrays, initializing two-dimensional array, Multidimensional arrays.

(5)

Handling of character strings : Declaring and initializing string variables, reading string from terminal, writing string to screen, arithmetic operations on characters, putting strings together. Comparison of two strings, string handling functions-strlen, strcat, strcmp, strcpy

(5)

OCT-NOV

User defined functions : Need for user-defined functions, a multi-functional program, the form of ‘C’ function, Return values and their types, calling a function, category of functions- No arguments and no return values, arguments but no return values, arguments with return values, handling of non-integer functions, nesting of functions, recursion, functions with arrays.

(4)

Structure and union : Structure definition, giving values to members, structure initialization, comparison of structure variables, array as structure, array within structure, union.

(5)

Pointers : Understanding pointers, accessing the address of variables, declaring and initializing pointers, accessing a variable through its pointer.

(3)



BCA304T – OPERATING SYSTEMS 52 hrs JULY-AUG

Introduction: Batch Systems, Concepts of Multiprogramming and Time Sharing, Parallel, Distributed and real time Systems, Operating System Structures, Components & Services, System calls, System programs, Virtual machines

(6)

Process Management: Process Concept, Process Scheduling, Co – Operating process, Threads, Inter process communication, CPU Scheduling Criteria, Scheduling algorithm, Multiple Processor Scheduling, Real time Scheduling, Algorithm evolution.

(8)

AUG-SEP

Process Synchronization and deadlocks: The Critical Section Problem, Synchronization hardware, Semaphores, Classical problems of synchronization, Critical regions, monitors, Dead locks – System model, Characterization, Dead lock prevention, avoidance and detection, Recovery from dead lock, Combined approach to deadlock handling.

(10)

SEP-OCT

Memory Management: Logical and Physical address space, Swapping, Contiguous allocation, Paging, Segmentation, Segmentation with paging in Mastics and Intel 386, Virtual memory – Demand paging and it’s performance, Page replacement algorithms, Allocation of frames, thrashing, page size and other considerations. Demand Segmentation

(10)

File management (Systems, Secondary Storage Structure): File Concepts, Access methods, Directory Structure, Protection and consistency semantics, File system structure, Allocation methods, Free space management, Directory Implementation, Efficiency and Performance, Recovery.

(8)

OCT-NOV

Disk Management (Structure, Disk Scheduling Methods):Disk Structure & Scheduling methods, Disk management, Swap – Space management,

(5)

Protection and Security: Goals of protection, Domain Protection, Access matrix, Security Problem, Authentication, One time password, program threats, System threads.

(5)

BCA305T – DATA STRUCTURES Using C 52

JULY-AUG

Introduction to Data structures: Definition, Classification of data structures : primitive and non primitive. Operations on data structures.

(2)

Dynamic memory allocation and pointers: Definition Accessing the address of a variable, Declaring and initializing pointers. Accessing a variable through its pointer. Meaning of static and dynamic memory allocation. Memory allocation functions : malloc, calloc, free and realloc.

(4)

AUG-SEP Recursion: Definition, Recursion in C, Writing Recursive programs – Binomial coefficient, (4)



Fibonacci, GCD. Searching and Sorting Search:- Basic Search Techniques : Search algorithm searching techniques

: sequential search, Binary search – Iterative and Recursive methods. Comparison between sequential and binary search.

(4)

Sort- General Background: Definition, different types: Bubble sort ,Selection sort, Merge sort, Insertion sort, Quick sort

SEP-OCT Stack – Definition, Array representation of stack, Operations on stack : Infix, prefix and postfix notations Conversion of an arithmetic expression from Infix to postfix. Applications of staks.

(7)

Queue - Definition, Array representation of queue, Types of queue: Simple queue, circular queue, double ended queue (deque) priority queue, operations on all types of Queues

(7)

OCT-NOV

Linked list – Definition, Components of linked list, Representation of linked list, Advantages and Disadvantages of linked list. Types of linked list : Singly linked list, Doubly linked list, Circular linked list and circular doubly linked list. Operations on singly linked list : creation, insertion, deletion, search and display.

(7)

Tree - Definition : Tree, Binary tree, Complete binary tree, Binary search tree, Heap Tree terminology : Root, Node, Degree of a node and tree, Terminal nodes, Non-terminal nodes, Siblings, Level, Edge, Path, depth, Parent node, ancestors of a node. Binary tree : Array representation of tree, Creation of binary tree. Traversal of Binary Tree : Preorder, Inorder and postorder.

(7)

BCA – FIFTH SEMESTER BCA 501: COMPUTER ARCHITECTURE

52 hrs JULY-AUG

DIGITAL LOGIC CIRCUITS: Logic gates Boolean algebra, map simplification, combinational circuits, flip-flop, sequential circuits.

(5)

INTEGRATED CIRCUITS AND DIGITAL FUNCTIONS: Digital integrated circuits, IC flip-flops and registers, decoders and multiplexers, binary counters, shift registers, random - access memories (RAM) read-only memories (ROM)

(10)

AUG-SEP

DATA REPRESENTATION : Data types, fixed-point representation, floaing-point representation, other binary codes, error detection codes.

(5)

BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes, computer instruction, (10)



timing and control, execution and instruction, input-output and interrupt, design of computer.

SEP-OCT

CENTRAL PROCESSOR ORGANIZATION: Processor bus organization, arithmetic logic unit (ALU), instruction formats, addressing modes, data transfer and manipulation, program control, microprocessor organization.

(10)

OCT-NOV

INPUT-OUTPUT ORGANIZATION: Peripheral devices, asynchronous data transfer, direct memory access (DMA), priority interrupt, input-output processor (IOP).

(6)

MEMORY ORGANIZATION : Auxiliary memory, microcomputer, memory hierarchy, associative memory, virtual memory, cache memory.

(6)

BCA 502: INTERNET PROGRAMMING 52 JULY-AUG

Introduction: Internet origin and development – internet architecture frame work-world Wide Web. Introduction to JAVA: JAVA Evolution: Java History, Java Features, How Java Differs from C and C++, Java and Internet, Java and World Wide Web, Web Browsers, Hardware and Software requirements, Java Support Systems, Java Environment. Overview of JAVA Language: Introduction, Simple Java Program, More of Java, An Application with Two Classes Java Program structure, Java Tokens, Java Statements, Implementing a Java Program, Java Virtual Machine, Command Line Arguments, Programming Style. Constants, Variables, and Data Types: Introduction, Constants, Variables, Data Types, Declaration of Variables, Giving Values to Variables, Scope of variables, Symbolic Constants, Type Casting, Getting Values of Variables, Standard Default Values, Operators and Expressions; Introduction, Arithmetic Operators, Relational Operators, Logical Operators, Assignment Operators, Increment and Decrement Operators, Conditional Operators, Bitwise Operators, Special Operators, Arithmetic Expressions, Evaluation of Expressions, Precedence of Arithmetic Operators, Type conversion and Associativity, Mathematical Functions. Decision Making and Branching: Introduction, Decision Making with if Statement, Simple if Statement, The if …… else Statement, Nesting of if ……… else Statements, The else if Ladder, The Switch Statement, The ?: Operator. Decision Making and Looping: Introduction. The while Statement, The do Statement, The for Statement, Jumps in Loops Labeled Loops.

(12)

AUG-SEP Classes, Arrays, Strings and Vectors: Classes, Objects and Methods: Introduction, Defining a (8)



Class, Adding Variables, Adding Methods, Creating Objects, Accessing Class Members, Constructors, Methods Overloading, Static Members, Nesting of Methods, Inheritance: Extending a Class Overriding Methods, Final Variables and Methods, Finalizer methods, Abstract Methods and Classes, Visibility Control. Arrays, Strings and Vectors: Arrays, One – dimensional Arrays, Creating an Array, Two – dimensional Arrays, Strings, Vectors, Wrapper Classes

SEP-OCT

Interfaces, Packages, and Multithreaded Programming: Interfaces: Multiple Inheritance: Introduction, Defining Interfaces, Extending Interfaces, Implementing Interfaces, Accessing Interface Variables. Packages: Putting Classes together: Introduction, Java API Packages, Using System Packages, Naming Conventions, Creating Packages, Accessing a Package, Using a Package, Adding a Class to a Package, Hiding Classes. Multithreaded Programming: Introduction, Creating Threads, Extending the Thread Class, Stopping and Blocking a thread, Life Cycle of a thread, Using Thread Methods, Thread Exceptions, Thread Priority, Synchronization, Implementing the ‘Runnable’ Interface.

(10)

Managing Exceptions, Applet Programming: Managing Errors and Exception: Introduction, Types of Errors, Exceptions, Syntax of Exception Handling Code, Multiple Catch Statements, Using Finally Statement, Throwing Our Own Exceptions, Using Exceptions for Debugging. Applet Programming: Introduction, How Applets Differ from Applications, Preparing to Write Applets, Building Applet Code, Applet Life Cycle, Creating an Executable applet, Designing a Web Page, Applet Tag, Adding Applet to HTML File, running the Applet, More about Applet Tag, Passing Parameters to Applets, Aligning the Display, More About HTML Tags, Displaying Numerical Values, Getting Input from the Usr.

(12)

OCT-NOV

Graphics Programming, Input / Output: Graphics Programming: Introduction, The Graphics Class, Lines and rectangles, circles, and Ellipses, Drawing Arcs, Drawing Polygons, Line Graphs, Using Control Loops in Applets, Drawing Bar Charts. Managing Input / Output Files in JAVA: Introduction, Concept of Streams, Stream Classes, Byte Stream Classes, Character Stream Classes, Using Streams, Other Useful I/O Classes, Using the File Class, Input/Output Exceptions, Creation of Files, Reading/Writing Characters, Reading/Writing Bytes, Handling Primitive Data Types, Concatenating and Buffering Files, Interactive Input and output, Other Stream Classes.

(10)

BCA 503: VISUAL PROGRAMMING 52 hrs JULY-AUGUST

INTRODUCATION TO VB : the intergrated Development Environment - menu bar, tool bar, form designer, project explorer, properties window, form layout window. The VB editor.

(5)



THE FORM OBJECT : Properties, events and methods of forms; Properties - Name, Caption, Backcolor, Borderstyle, controlbox, maxbutton, minbutton, moveable, startup position, height, width, left, top, scalemode, window state; Events - load, unload, Click, Activate, Deactivate, Resize, methods- Show, hide, cls, unload, print. Controls - Properties and events of different controls such as commond buttons, labels, textboxes, image controls, timer, horizontal and vertical scroll bars, option buttons, check boxes, frames, lists and combo boxes. Predefined Dialog Boxes - MsgBox and InputBox.

(15)

AUG-SEP

PROGRAMMING IN VB : Data types, variables, declaration and scope, arithmetic operations, Study of form and code modules, private and public procedures. Main () procedure. Subs and Functions. Mathematical and string Functions.

SEP-OCT

Branching and Looping Statements; If - Then, If - Then - Else and Nested If Statements; Select Case- different forms; For - Next, While - Wend and Do - Loops statements; Arrays - declaration. Static and dynamic arrays. Array() Function; menus and toolbars - Creating menus and toolbars, Working with the menu editor, Designing Multiple Document interface forms. Microsoft common controls.

OCT-NOV

OOP methods and properties of an object, class Modules, Encapsulation and Inheritance characteristics; Dynamic Link Libraries ( DLLs) and Windows API; Designing Help files; File handling - Sequential, Random access and Binary files, Database connectivity - DAO and ADO Tables and Queries. ActiveX Data objects

(32)

BCA 504: SOFTWARE ENGINEERING 52 hrs JULY-AUG

Introduction: Software Products and Software process, Process models : Waterfall modal, Evolutionary Development, Bohemia’s Spiral model, Overview of risk management, Process Visibility, Professional responsibility.

(4)

Computer based System Engineering: Systems and their environment, System Procurement, System Engineering Process, System architecture modeling, Human Factors, System reliability Engineering.

(3)

AUG-SEP

Requirements and Specification: The requirement Engineering Process, The Software requirement document, Validation of Evolution of requirements, Viewpoint – oriented & method based analysis, System contexts, Social 7 organizational factors, Data flow, Semantic, Object, models, Requirement definition, Requirement Specification, Non functional requirement.

(8)

Software prototyping: Prototyping in software process, Prototyping techniques, User interface (2)



prototyping. Software Design: Design Process, Design Strategies, Design Quality, System Structuring, Control

models, Modular decomposition, Domain Specific architecture. (5)

SEP-OCT

Object Oriented & function oriented design: Objects, object Classes and inheritance, Object identification, An object oriented design example, Concurrent Objects, Data flow design, Structural decomposition, Detailed Design, A Comparison of design Strategies.

(5)

User interface design: Design Principles, User System interaction, Information Presentation, User Guidance, Interface Evaluation.

(3)

OCT-NOV

Software Reliability and reusability: Software reliability metrics, Software reliability Specification, Statistical testing, Reliability Growth modeling, Fault avoidance & tolerance, Exception handling & defensive programming, Software development with reuse, Software development for reuse, Generator based reuse, Application System Portability.

(8)

Software Verification and Validation: The testing Process, Test Planning & Strategies, Black Box, Structural, interface testing, Program inspections, Mathematically based verification, Static analysis tools, Clean room software development.

(8)

Management Issues: Project management, Quality management, Software cost estimation, Software maintenance.

(6)



BSC II, IV, and VI sem - CSIIT1 : Data Structures and Operating System

1. DATA STRUCTURES 60 JAN

Introduction to data Structures Definition, Classification of data structures, Operations on data structures, Introduction to Time and Space Complexity

02

Primitive Data Structures

Integer, character, float, strings- memory representation and primitive operations, string manipulation using pointers.

02

Arrays

Storage Representation for 1D and 2D arrays, Insertion and deletion on ID arrays, advantages and disadvantages of arrays.

02

Linked List

Pointers. Dynamic Memory Allocation .Singly Linked lists. Operations on linked lists-insertion and Deletion of a Node. Introduction to Circularly linked list and. Doubly linked lists.

05

JAN-FEB

Stacks Concepts, operations, sequential and linked implementation. Application of stacks- recursion-towers of Hanoi- Infix to postfix conversion. Evaluation of Postfix Expressions.

Queues Concepts, operations, sequential and linked implementation. Circular

05 05



queues. Priority queues and Dequeues (Introductory concepts)-Application of queues.

Trees Definitions and Concepts-Binary trees. Sequential and Linked Representation of Binary Trees Traversal.

Graphs

Concepts, Sequential and Linked Representation of Graphs. BFS and DFS Traversal. Warshall's Shortest Path Algorithm.

05 04

FEB-MAR

Searching and Sorting

Linear and Binary search Selection sort. Insertion sort. Quick sort. Merge sort.

04

11. OPERATING SYSTEM

Introduction to Operating Systems

What is an Operating System (OS)?. History of OS- Simple Batch System, Mutiprogrammed Batched Systems. Time-Sharing Systems, Personl Computer System, Distributed Systems and Real-Time Systems. Operating System Structures- Command Interpreter System, Operating System Services, System Calls, System Programs.

(04)

Process Management

Process Concept. Process Control Block. Process Scheduling. CPU Scheduling –Basic Concepts, Scheduling Criteria. Scheduling Algorithms- FIFO, RR,SJF- Multi-level. Multi-level feedback.

(06)



MAR-APR

Storage Management

Basic Concepts, Logical and Physical Address- Space. Swapping. Contiguous Allocation. Paging, Segmentation. Virtual Memory- Demand Paging. Page Replacement Algorithms, Allocation of Frames. Thrashing and Demand Segmentation

(07)

File System

File Concept, Access Methods. Directory Structure. Protection. File System Structure, Allocation Methods. Free-Space Management.

(05)

I/O Systems Overview of I/O Systems. I/O Interface. Secondary Storage Structure- Disk Structure, Disk Scheduling.

(03)



IV semester Syllabus CSIVT1 SOFTWARE ENGINEERING AND VISUAL PROGRAMMING 1. SOFTWARE ENGINEERING

JAN

Software engineering and Project planning Software characteristics, software components, Software process model: Classic life cycle model, prototyping model, spiral model. Planning software project: Defining the problem, developing solution strategy, planning development process, planning activities.

05

Software cost estimation Cost factors, cost estimation techniques, staffing. Software requirement definition

Software requirement specification, Formal specification techniques

02 03

JAN-FEB

Software design

Fundamental design concepts, modules and modularization criteria, design notations, design techniques. Object oriented design: components of object oriented design modules. Coding

Implementation issues, structured coding techniques, coding style, data abstraction, , Verification and validation, reviews. Testing

Verification and validation techniques, Quality assurance, walkthrough and inspection, unit testing and debugging, system testing, formal verification. Software maintenance

Types of maintenance, Enhancing maintainability during development.

04 03 03 02



VISUAL PROGRAMMING FEB-MAR

Introduction

Introduction, Features of Visual Basic, IDE, Writing small programs.

Program Constructs

Variables, Constants, Operators, User defined data types, Arrays, Functions, control statements, Input Box, Msg Box.

Controls

Intrinsic controls, common properties and importance.

03 06 04

MAR-APR

Control arrays and User defined procedures

Creation, general procedures and event procedure, creating and calling functions, scope of procedures.

Handling Data access

Visual Data manager, Creating a data base, Data control, Data Access objects, RDO, ActiveX objects.

04 06

VI Semester Syllabus -CSVIT1 INTERACTIVE COMPUTER GRAPHICS COMPUTER GRAPHICS

JAN

Introduction Practical applications of computer Graphics: Display, hard copy and Interactive input devices, Display processors, Graphics software. Line drawing systems and point plotting techniques Introduction –Coordinate systems-Display Devices –The CRT –Inherent Memory devices, Line(DDA,Bresenhams), Circle(DDA,Bresenhams) and ellipse(midpoint) drawing algorithms. Character generation.

04 10

JAN-FEB

Instruction sets for display processors, line styles, color and intensity, Area filling, character attributes, Inquiry functions, bundled attributes Two Dimensional Transformations

07



Translation, Scaling, Rotation, reflection, Shearing, Matrix Representations – Clipping and windowing, window to viewport transformation,

FEB-MAR

Line clipping algorithm –Cohen – Southerland and Mid point subdivision.

Interactive computer graphics

Concept of a segment: Segment files, Segment attributes, Graphical Input devices –The mouse-Tablets-Light pen-joy stick. Input techniques-Round Robin technique.

06

MAR-APR Three Dimensional graphics 3d Transformation .Hidden surface elimination :The depth buffer algorithm –scan line algorithm, Polygon surfaces, curved surfaces, Representation of solid objects surfaces,

08

CSVIT2 COMPUTER NETWORKS - COMPUTER NETWORKS JAN

Introduction Definition of networks, objectives of network, categories of network ( LAN, MAN, WAN &

Internet) , ISO OSI Reference Model, TCP reference model, topologies used in networking (

Point-to-point, Broadcasting)

Physical layer

DTE-DCE Interface, transmission media – magnetic media, twisted pair, base band coaxial cable, broad band coaxial cable, fiber optics, satellite communications, Multiplexing – FDM, TDM, Switching – circuit, message and packet, ISDN services

05 05

JAN-FEB

Data link layer

Design issues and services provided to higher layers, Framing, Error correction and error

detection, DLL protocols – unrestricted simplex protocol, simplex protocol, stop and wait,

06



piggybacking, sliding window protocol – 1-bit sliding protocol.

MAC sub layer

MAC protocols- Aloha and slotted aloha, CSMA and CSMA/CD, IEEE Standards – cabling,

Manchester, Differential Manchester Encoding, 802.3 (Ethernet)

08

FEB-MAR

Network layer Design issues- services provided to transport layer, routing algorithms – optimality principle, shortest path, flooding-definition. Congestion control algorithm – principles of congestion control.

Transport layer

Concepts, services provided to the upper layer, quality of service

05 02

MAR-APR Presentation layer

Data compression techniques, network security – traditional cryptography and other cryptography techniques (Introductory concepts only).

Application layer

E-mail, Overview of TCP\IP

02 02

II Semester BCA 204 – OOPS Using C++

JAN

Introduction : Procedural Languages, definition of OOP, Basic concept of OOP, Object, Class, Data Abstraction, Data Encapsulation, Data Hiding member functions, Reusability, Inheritance, Creating new Data Types, Polymorphism, Overloading, Dynamic binding, and Message passing. C++ Features: The iostream class, C++ Comments, C++ Keywords, Variable declaration, The Const Qualifier. The Endl, Set W, set precision, Manipulators, The scope resolution operator, The new & delete Operators.

02 02



Functions: Simple Functions: Function declaration, calling the function, function definition; Passing argument to, returning value from function; passing constants, Variables, pass by value, passing structure variables, pass by reference, Default arguments, return statements, return by reference, overloaded functions; Different number of arguments, Different Kinds of arguments, inline function.

08

JAN-FEB

Objects & Classes : Classes & Objects, Class Declaration, Class members; Data Constructors, Destructors, Member functions, Class member visibility; private, public, protected. The scope of the class object constructors; Default Constructor, Constructor with argument, constructor with default arguments, Dynamic constructor, copy constructor, Overloaded constructor, Objects as function arguments; member functions defined outside the class, Objects as arguments, returning objects from functions, class conversion, manipulating private Data members, Destructors, classes, objects & memory, array as class member data, Array of objects, string as class member Operator Overloading : Overloading unary operator: Operator Keyword, Operator Arguments, Operator return value, Nameless temporary objects, limitations of increment operator, overloading binary operator, arithmetic operators, comparison operator, arithmetic assignment operator, Data conversion; conversion between Basic types, Conversion between objects & Basic types, conversion between objects of different classes.

12

FEB-MAR

Inheritance : Derived Class & Base Class : Specifying the Derived class accessing Base class members, the protected access specifier, Derived class constructor, Overriding member functions, public and private inheritance; Access Combinations, Classes & Structures, Access Specifiers, Level of inheritance; Multilevel inheritance, Hybrid inheritance, Multiple inheritance; member functions in multiple inheritance, constructors in multiple inheritance, Containership; Classes within classes, Inheritance &

08



Program Development. Virtual Functions: Normal member function accessed with pointers, Virtual member functions accessed with pointers, Dynamic binding, pure virtual functions, Friend function; Friends for functional notation, friend classes, the this pointer; Accessing Member Data with this, using this for returning values.

05

MAR-APR

Templates & Exception Handling: Introduction, Templates, Class Templates, function templates, Member function templates, Template arguments, Exception Handling. Streams : The Stream class Hierarchy, Stream classes Header file, string J/O : Writing strings, reading strings, character J/O, Detecting End – of – file. Object J/O; writing an object to disk, reading an object from disk, J/O with multiple objects; the f stream class, The open function, File Pointers; Specifying the position, Specifying the offset. The tellg Function, Disk J/O with Memory Functions; Closing Files, Error Handling, Command Line Arguments.

04 05

BCA 205 – DATA BASE MANAGEMENT SYSTEMS

52

JAN

Introduction: Database and Database Users, Characteristics of the Database Approach, Different people behind DBMS, Implications of Database Approach., Advantages of using DBMS, When not to use a DBMS. Database System Concepts and Architecture: Data Models, Schemas, and Instances., DBMS Architecture and Data Independence., Database languages and interfaces., The Database system Environment, Classification of DBMS.

05 04

JAN-FEB

Data Modeling Using the Entity-Relationship Model: High level Conceptual Data Models for Database Design with an example., Entity types, Entity sets, Attributes, and Keys, ER Model Concepts, Notation for ER Diagrams, Proper naming of Schema Constructs, Relationship types of degree higher than two.

05



Record Storage and Primary File Organization: Secondary Storage Devices. Buffering of Blocks. Placing file Records on Disk. Operations on Files, File of unordered Records (Heap files), Files of Ordered Records (Sorted files), Hashing Techniques, and Other Primary file Organization.

FEB-MAR Functional Dependencies and Normalization for Relational Databases : Informal Design Guidelines for Relational Schemas, Functional Dependencies, Normal Forms Based on Primary Keys., General Definitions of Second and Third Normal Forms, Boyce–Codd Normal Form. Relational Data Model and Relational Algebra: Relational Model Concepts., Relational Model Constraints and Relational Database Schema, Defining Relations, Update Operations on Relations., Basic Relational Algebra Operations, Additional Relational Operations., Examples of Queries in the Relational Algebra., Relational Database design Using ER – to – Relational Mapping. Relational Database Language: Data definition in SQL, Queries in SQL, Insert, Delete and Update Statements in SQL, Views in SQL, Specifying General Constraints as Assertions, Specifying indexes, Embedded SQL.

06 06 05

MAR-APR

PL / SQL: Introduction, Exceptions & Cursor Management, Database Triggers, Functions, Procedures and packages. Transaction Processing Concepts: Introduction, Transaction and System Concepts, Desirable properties of transaction, Schedules and Recoverability, Serializability of Schedules, Transaction Support in SQL, Locking Techniques for Concurrency Control, Concurrency Control based on time stamp ordering, Optimistic Concurrency control techniques, Using locks for Concurrency Control in Indexes.

08 07

BCA404T – DATA COMMUNICATION AND NETWORKS 52 JAN

1. Communication Networks & Services Approaches to Network design: Network Goals, Network Topologies, Switching Techniques: Message, Packet and Circuit switching,

06



Evolution of Network Architecture and Services (i) Telegraph Networks and Message switching (ii) Telephone Networks and Circuit switching (iii) Internet, Computer Network and Packet switching

Essential elements of Network Architecture Key factors in Communication Network Evolution

2. Layered Architecture &Applications Examples of Layering: OSI Reference Model, TCP/IP Model Application Layer Protocols and TCP/IP utilities : Telnet, FTP, HTTP and IP utilities like PING, TRACEROUTE, IPCONFIG, NETSTAT

04

JAN-FEB

3. Digital Transmission Digital representation of information, Basic properties of digital transmission systems, Characterization of communication channels: Frequency domain and Time domain, Fundamental limits in digital transmission: Nyquist signaling rate, Shannon channel capacity, Line coding. Modems and Digital modulation: Amplitude shift keying, Frequency shift keying, Phase shift keying. Transmission media: Twisted Pair, Coaxial cable, Optical Fibre, Radio transmission, Infra red Light. Error detection and correction: Error detection, two dimensional parity checks, internet checksum, polynomial codes and their error detection capability Multiplexing: Frequency Division Multiplexing, Time Division Multiplexing, Wavelength Division Multiplexing, SONET Multiplexing Circuit Switches: Space division switches, time division switches.

12

FEB-MAR

4. Peer-To-Peer Protocols Connection oriented and connectionless service models, Features of Services offered by a given layer, Peer to peer protocols in end to end and single hop network

10



ARQ protocols: Stop and wait, go back N, Selective Repeat Other peer to peer protocols: Sliding window flow control, Timing recovery for synchronous services, TCP Reliable stream service and flow control Data Link Control – Framing, Point to Point Protocol (PPP), High level Data Link Control (HDLC). 5. Medium Access Control Protocols Multiple access communications, Random access MAC protocols: ALOHA, Slotted ALOHA, CSMA, CSMA/CD Scheduling approaches to medium access control: Reservation systems, polling, Token passing rings, Comparison of Scheduling approaches in medium access control, Comparison of random access and scheduling medium access controls Channelization: FDMA, TDMA, CDMA

07

MAR-APR

6. Local Area Networks LAN structure, MAC sublayer, Logical Link Control layer (LLC), LAN Standards: Ethernet and IEEE 802.3 LAN standard, Token Ring and IEEE 802.5 LAN standard, FDDI, Wireless LANs and IEEE 802.11 standard, LAN bridges: Transparent bridges, Source Routing bridges, Mixed-media bridges. 7. Packet Switching Networks Network services and Internal Network operation, Packet network topology, Datagrams and Virtual circuits, Connectionless packet switching: Virtual circuit packet switching, Structure of a packet switch Routing in packet networks : Routing algorithm classification, Routing tables, Flooding, Hierarchical Routing, Shortest path routing algorithms ( Bellman Ford Algorithm, Dijkstra’s Algorithm), Link State routing, Distance Vector Routing Congestion control algorithms: Open Loop control and Closed Loop control

07 06



BCA405T – VISUAL PROGRAMMING

52

JAN

Unit 1: Windows Programming: Traditional Programming Paradigms – Overview of Windows Programming – Data Types – Resources – Windows

Messages – Device Contexts – Document Interfaces – Dynamic Linking Libraries – Software Development Kit (SDK) Tools – Context Help.

10

JAN-FEB

Unit 2: Visual Basic Programming: Introduction – Forms – Variables, Types – Properties – Decision Making – Looping – Modules – Procedures – Functions-Tool Box Controls – Menus – Grid Controls – Dialog Boxes

FEB-MAR

Database Manager – Data Control – Record set Objects. Unit 3: Visual C++ Programming: Objects – Classes - VC++ Components – Resources – Event Handling – Menus – Dialog Boxes – Importing VBX Controls – Files – MFC File Handling – Document View Architecture – Serialization.

10

MAR-APR

Unit 4: Interfacing Other Applications – Multiple Document Interface (MDI) – Splitter Windows – Exception Handling – Debugging – Object Linking and Embedding (OLE) – Database Application – DLL – ODBC.

12

BCA406T – UNIX PROGRAMMING 52

JAN

Introduction History, salient features, Unix system architecture, Unix command format, Unix internal and external commands, Directory commands, File related commands, Disk related commands, general utilities.

Unix File System Boot inode, super and data block, in-core structure, Directories, conversion

06



of pathname to inode, inode to a new file, Disk block allocation. 02

JAN-FEB

Process Management Process state and data structures of a Process, User vs. kernel node, context of a Process, background processes, Process scheduling commands, Process terminating and examining commands.

Secondary Storage Management Formatting, making file system, checking disk space, mountable file system, disk partitioning, file compression.

Special Tools and Utilities Filters, Stream editor SED and AWK, Unix system calls and library functions, Processes, signals and Interrupts, storage and compression facilities.

06 06

FEB-MAR

Shell Programming Vi editor, shell types, shell command line processing, shell script features, executing a shell script, system and user-defined variables, expr command, shell screen interface, read and echo statement, command substitution, escape sequence characters, shell script arguments, positional parameters, test command, file test, string test, numeric test.

MAR-APR

Conditional Control Structures – if statement, case statement Looping Control Structure – while, until, for, statements. Jumping Control Structures – break, continue, exit.

Unix System Communication Introduction, write, read, wall commands, sending and handling mails.

System Administration

16 04



Roles of a System Administrator, File System Maintenance, System Startup and Shutdown, User Management, Backup and Restore, Daemons, Domain Name System DNS, Distributed File System.

04

BCA – SIXTH SEMESTER BCA 601: COMPUTER GRAPHICS

52

JAN

Graphics Systems: Application of CG, CG classification-Graphic softwares- CRT Functioning- Factors Affecting CRT- Raster scan System – Shadow mask method, Display Processor with raster system- Raster co-ordinate system- color mapping- Instruction set and Raster System applications. Output Primitives Line drawing methods-Direct, DDA and Bresenhams, line attributes, - Circle drawing-Direct and midpoint circle drawing-Ellipse Drawing- Bresenhams Ellipse Algorithm-Area filling- scan- line area filling and character attributes.

06 08

JAN-FEB

Two_dimensional Transformation: Basic Transformation, Translation, Rotation, Scaling- Reflection and Sheer matrix representations- Homogeneous co-ordinates- composite transformation- Raster methods for transformation. Windowing and Clipping: Viewing Transformations, Clipping process, Point clipping, Line Clipping, Cohen Sutherland line clipping algorithm, Midpoint Subdivision algorithm.

08

FEB-MAR

Area clipping, Sutherland and Hodgeman Polygon clipping Algorithm, Text clipping. Three Dimensional Graphics: 3D-coordinate system, 3D-Display techniques, 3D-transformations, Polygon surfaces, Octrees, Bezier curves, Hidden surface removal, Depth buffer and scan-line method. Segments:

06



Introduction, functions for segmenting, display file, segment attributes, display file compilation.

06

MAR-APR

Graphical Input Techniques: Positioning techniques, Grid, Constraints, Dynamic manipulation, Gravity field, Rubber band, Selection technique, Menu, Pointing and selection by naming 8.Graphical Input Devices: Keyboards, Mouse, Joystick, Touch Panels, Track ball.

08 04

BCA 602: E-COMMERCE & WEB DESIGNING 52 JAN

Introduction: Electronic Commerce Environment and opportunities:

Background. The electronic Commerce environment, Electronic marketplace technology. Modes of electronic commerce: Overview,

Electronic Data Interchange (EDI), Migration to open EDI, e-commerce with Internet/WWW, Commerce Net advocacy, Web Commerce going Forward. Approaches to safe e-commerce: Overview, Secure Transport

Protocols, Secure Transactions, Secure Electronic Payment Protocol, Secure Electronic Transaction, Certificates, for Authentication, Security on Web Servers and Enterprise Networks.

10

JAN-FEB

Payments and Security: Electronic Payment systems: Types, Digital Token-Based Electronic Payment Systems, Smart Cards and Electronic Payment Systems, Credit card-based Electronic Payment Systems, Risk and Electronic Payment Systems, Designing Electronic Payment Systems. Master Card/Visa Secure Electronic Transactions:Introduction, Business Requirements, Concepts, Payment Processing e-mail and Secure e-mail Technologies: Introduction, The means of Distribution. Applications – 1: Consumer-Oriented e-Commerce: Applications, Mercantile Process Models, Mercantile Models from the Consumer’s Perspective and from the Merchant’s Perspective. Interorganizational

10 08



Commerce and EDI: EDI, Applications of EDI in business, Legal, Security and Privacy Issues; EDI and e-commerce; Standardization and EDI. EDI Software Implementation, EDI Envelope for Message Transport, Value-added Networks.

FEB-MAR

Applications – II: Advertising and Marketing: The New Age oInformation – Based Marketing, Advertising on the Internet, Charting the On-Line Marketing Process, Marketing Research. Consumer Search and Resource Discovery: Search and Resource Discovery Paradigms. Information Search and Retrieval, e-Commerce Catalogs or Directories, Information Filtering, Consumer – Data Interface: Emerging Tools. Electronic Publishing: EP and Web – Based EP.

08

MAR-APR

Web Design: Web design, Web design Process, Designing for others, site types and architectures, Navigation Theory and practice, Linkage: Text, Buttons, Icons and Graphics, Search and design, site maps, Indexes, and navigational and use aids. Scripting languages – Java script & VB script.

16

BCA 603: DESIGN AND ANALYSIS OF ALGORITHMS 52 JAN

Introduction: Definition of algorithm, Characteristic of algorithm, Different Control Structures, Writing Structured Programs, Analysis of algorithm Dixide and Conquer : General Method, Binary Search, Finding Maximum & Minimum., Merge Sort, Quick Sort, Selection Sort.

07 10

JAN-FEB

Greedy Method: General method, Knapsack Problem, Job Sequencing with deadline, Minimum – cost Spanning trees, Optimal Storage on tapes, Optimal merge patterns, Single – Sour Shortest Paths,

10

FEB-MAR Dynamic Programming: Introduction to Graphs, Definition types, Terms related to graph, General Method, Multistage Graphs, All pair Shortest Paths, 0/1 – knapsack, The traveling salesperson problem, Flow Shop Scheduling. Basic traversal & Search techniques: Search & traversal techniques for trees, Search & traversal techniques for graphs, Code Optimization, AND /

10



OR Graphs, Game trees. MAR-APR

Backtracking: General method, The 8- Queens Problem, Sum of subsets, Graph Coloring, Hamiltonian Cycles, Knapsack Problem.

07

II Sem B.Sc.

CSIIPI: DATA STRUCTURES LAB

Month Syllabus

Total Practical

Hours/Semester: 45

DEC-JAN

1. Menu driven program to concatenate two strings and Find the length of a string using pointers.

2. Menu driven program to copy a string and extract a substring using pointers.

JAN-FEB

3. Menu driven program to Find GCD of two numbers and Factorial of given number.

4. Creation of linked list and insertion of an element into it.

FEB-MAR

5. Creation of linked list and deletion of an item from it.- 6. Implementation of Stack using pointers. 7. Implementation of Queues using Pointers

MAR-APR

8. Creation of Binary Tree and its Traversals. 9. Implementation of Quick Sort, insertion sort and selection sort.

10. Implementation of Binary search.



IV Sem BSc

CSIV1 DBMS MINI PROJECT (PRACTICAL) DEC-JAN software requirements specification JAN-FEB software design FEB-MAR project implementation and coding MAR-APR software testing

VI Sem BSc CSVIPI PROJECT LAB (PRACTICAL) DEC-JAN 1.software requirements specification JAN-FEB 2.software design

FEB-MAR 3.project implementation and coding

MAR-APR

4.software testing

Students are required to take up a problem and develop a system by making use of the existing infrastructure( S/w and H/w) available in their respective colleges. Students should collect the requirements and work in the allotted lab hours in the college only.



II Semester BCA

BCA204P - PRACTICALS IN C++ PROGRAMMING

DEC-JAN

1) Write a program to implement digital clock

2) Write a program to swap two numbers using friend function

3) Write a program to calculate area and circumference of circle using inline function

4) Write a program to create electricity bill.

JAN-FEB

5) Write a program to prepare a shopping lists

6) Write a program to perform bank transaction 7) Write a program to perform addition of two matrices using operator overloading. 8) Write a program for multiplication of two matrices using operator overloading.

9) Write a program to find sum of complex number using friend function.

10) Write a program to implement operation on stack.

FEB-MAR

11) Write a program to add two distance variable.

12) Write a program to implement operation on queue.

13) Write a program to sort elements using templates.

14) Write a program to find the maximum of two numbers using template.

15) Write a program to compare two string using equal to operator

MAR-APR

16) Write a program to concatenate two strings.

17) Write a program to find maximum of 2 Nos. using friend function.

18) Write a program to create a student report using inheritance technique.



19) Write a program to add two time variable

20) Write a program to implement area of geometrical figures



DBMS LAB

DEC-JAN

1. Consider the Insurance database given below. The primary keys are underlined and the data types are specified.

PERSON (DRIVER – ID #: string, name: string, address: strong)

CAR (Regno: string, model: string, year: int)

ACCIDENT (report – number: int, date: date, location: string)

OWNS ( driver – id #: string, Regno: string)

PARTICIPTATED (driver – id #: string, Regno: string, report – number: int, damage amount: int)

i) Create the above tables by properly specifying the primary keys and the foreign keys.

ii) Enter atleats five tuples for each relation.

iii) Demonstrate how you

a) Update the damage amount for the car with a specific Regno in the accident with report number 12 to

25000.

b) Add a new accident to the database.

iv) Find the total number of people who owned cars that were involved in accidents in 2002.

v) Find the number of accidents in which cars belonging to a specific model were involved.

vi) Generation of suitable reports.

vii) Create suitable front end for querying and displaying the results.

JAN-FEB

2. Consider the following relations for an order processing database application in a company.


ii) Enter atleast five tupels for each relation.

iii) Product a listing: CUSTNAME, #oforders, AVG_ORDER_AMT, where the middle column



is the total average order amount for that customer

iv) List the order# for orders that were shipped from all the warehouses that the company has

in a specific city.

v) Demonstrate how the delete item# 10 from the ITEM table and make that field null in the

ORDER_ITEM table.



FEB-MAR

3. Consider the following database of students enrollment in courses and books adopted for each

course.

STUDENT (regno: string, name: string, major: string, bdate: date)

COURSE (course #: int, cname: string, dept: string)

ENROLL (regno: string, course#: int, sem: int, marks: int)

BOOK_ADOPTIO (course#: int, sem: int, book-ISBN: int)

TEXT (book – ISBN: int, book-title:string, publisher: string, author: string)


ii) Enter atleast five tuples for each relation

iii) Demonstrate how you add a new text book to the database and make this book be adopted

by some department.

iv) Produce a list of text books (include Course #, Book – ISNB, Book – title) in the alphabetical

order for courses offered by the ‘CS’ department that use more than two books.

v) List any department that has all its adopted books published by a specific publisher.





MAR-APR

4. The following tables are maintained by a book dealer.

AUTHOR ( author – id : int, name: string, city: string, country: string)

PUBLISHER (publisher – id: int, name: string, city: string, country: string)

CATALOG (book – id: int, title: string, author – id: int, publisher – id: int, category – id,: int,

year: int, price: int)

CATEGORY (category – id: int, description: string)

ORDER – DETAILS (order – no: int, book – id: int, quantity: int)


ii) Enter atleast five tuples for each relation.

iii) Give the details of the authors who have 2 or more books in the catalog and the price of the

books is greater than the average price of the books in the catalog and the year of

publication is after 2000.

iv) Find the author of the book which has maximum sales.

v) Demonstrate how you increase the price of books published by a specific publisher by 10%.



5. Consider the following database for a banking enterprise.

BRANCH (branch – name: string, branch – city: string, assets: real)

ACCOUNT (accno : int, branch – name: string, balance: real)



DEPOSITOR (customer – name: string, accno: int)

CUSTOMER (customer – name: string, customer – street: string, customer – city: string

LOAN (loan – number: int, branch – name: string, amount: real)

BORROWER (customer – name: string, loan – number: int)


ii) Enter atleast five tuples for each relation.

iii) Find all the customers who have atleast two accounts at the main branch.

iv) Find all the customer who have an account at all the branches located in a specific city.

v) Demonstrate how you delete all account tuples at every branch located in a specific city.



IV Semester BCA - BCA405P – VISUAL PROGRAMMING LAB

DEC-JAN

1) Design an application to validate the user name and password and display appropriate message using message box control.

2) Application to change the font size, font and style of a text string using combo boxes. 3) Application to change the calculator using design array. 4) Application to design a calculator using design scrollbar.

5) Application to play AVI file containing audio and video using MCI control.

JAN-FEB

5) Application to play media file using active movie control or media player. 6) Application to design a screen saver (using timer). 7) Application to animation using animation control. 8) Application to move an image using a timer and command button controls. 9) Application to design MDI form to child and design the menu.

FEB-MAR 10) Design an application to establish connection to data base (Using data control).



11) Design an application to demonstrate sequential file access in VB. 12) Design an application to demonstrate the encryption and decryption in VB 13) Program to convert a number to wordings (up to 1000). 14) Program to display the message “ welcome to Visual Basic” at the center of the Window with

random fore color for the message and random back color for the form.

MAR-APR

15) Program to display the message “ welcome to Visual Basic” through out the Window with random fore color for the message.

16) Program to display a working anolog clock at the center the form 17) Windows API: Program to display a form always on the top of other Windows. 18) Program to display the message “welcome to Visual Basic” in a label box. The label box

should scroll from right to left. 19) Program to accept only numbers with fractional part using text box.

BCA406P - UNIX PROGRAMMING LAB - SECTION A DEC-JAN

1) To count the number of characters in a given string 2) To find whether the given year is leap year or not

JAN-FEB

3) To check whether a given number is even or odd 4) To find the factorial of a given number. 5) To print a string in the reverse order.

FEB-MAR

6) To count the number of vowels in a given string. 7) To print all prime numbers between m and n (m<n). 8) To check whether a given string is a palindrome or not. 9) Write a shell script that displays all the files in the current directory.

MAR-APR

10 ) write a shell script that creates a file and compresses it using: a) compress b) pack

SECTION B

1. Create a file containing the following fields: student No., student name, age, sex, height and weight. Print all the details in a neat format.

2. Write menu based shell programs with at least 3 options for the following:

Payroll system



VI Semester BCA - BCA 604: COMPUTER LAB 6.1 (Based on BCA 601)

DEC-JAN

1. DDA technique to draw a) straight line b) circle

2. Bresenham’s techniques for a)straight line b)circle

3. 3 Picchart Depiction of the results of an election between four parties.

JAN-FEB

4. Histogram ABC Car Co. produced 24, 16, 12 & 08 thousand cards in 1990, 1991, 1992

& 1993. Develop

a) A horizontal histogram to fit within 50 column and width

b) A vertical histogram to fit into2” height

FEB-MAR

5. Transformation Draw a rectangle. triangle and illustrate reflection, translation,

rotation and scaling.

1. Clipping the triangle ABC against a window. Animation like a man walking with and umbrella, shadow of a pole as sun moves & National flag.

MAR-APR

Section – B: Demonstration of an animated game developed as a project. - BCA 605:

Internet & Web page Design Lab DEC-APR

BCA 606: PROJECT WORK

DEC-JAN 1.software requirements specification

JAN-FEB 2.software design

FEB-MAR 3.project implementation and coding

MAR-APR

4.software testing

*****



CSIPI: C PROGRAMMING LAB

PART A

PROGRAMS Total Practical Hours/ Semester : 45

JULY-AUGUST

1 . Program to convert upper case into lower case and vice versa. 2. Program to count the number of occurrences of a character in a string. 3. Program to print the right most digit in a number. 4. Program to count the number of numerals, upper case. lower case and special

character in a given string

AUGUST-SEP.

5. Program to check whether a string is palindrome or not. 6. Program to find out inc value ofSin(x)/Cos(.\) using mathematical series. 7. Program to print the transpose of a matrix. 8. Program to check whether a matrix is identity matrix or not. 9. Program to find the product of two matrices.

PART B SEP-OCTOBER

10. Program to arrange numbers in ascending order. 11. Program to arrange names in alphabetic order. 12. Program to find the mean, median and standard deviation of numbers using functions. 13. Program to display first N terms of Fibonacci series using recursive functions.

14. Program to find the roots of Quadratic equation using macros.

OCTOBER-NOV

15. Program to demonstrate the use of Structures and Union. 16. Program to show the difference between Call by value and Call by reference. 17. Program to demonstrate the use of Files. 18. Program to implement Bitwise operation.



CSIIIP1 C++ LAB (PRACTICAL)

PART A ( Program related to C++ concepts 3 hrs JULY-AUGUST

1. Input the number of hours that an employee works and the employee wages and display the

employees gross pay. 2. Find the largest and second largest of four numbers. 3. Check whether a given date is valid. 4. Find the GCD and LCM of two numbers

AUGUST-SEP

5. Find N C R where N C R = N ! / ((N-R)! * ( R!)) 6. Generate the fibonacci series using arrays. 7. Interchange the values of two variables using reference variables. 8. Find the factorial of a number using 9. function overloading.

SEP-OCT

Find whether a given number is prime using function overloading. Calculate compound interest using default arguments where CI = P * ( 1 + R / 100 ) T. Check whether a given number is odd or even using inline functions.

PART B ( Program related to OOPS concepts) 1. Write a program to create a database for a bank account containing Name, Account No,

Account type and Balance include the following a. Constructors b. Destructors c. Default constructors d. Input and Output functions and Input and Output for 5 people using different methods.

OCT-NOV

2. Create a class to hold information for a customer about his current-account and savings-account in a bank. Using friend functions find the total balance of both the account.

3. Write a program to overload the following operators. a. Binary operator ‘ +’ to concatenate 2 strings and compare using ‘==’ b. Relational operator ‘ < ‘ to find whether one date is less than other. c. Find the sum of 2 matrices using operator ‘ +’ d. Find the next date of a given date using ‘++’ operator e. Using ‘+’. ‘-‘, ‘*’ to find the sum , difference and product of 2 complex



numbers 4. Create a base class for a stack and implement push and pop operation. Include derived class

to check for stack criteria’s such as a) stack is empty b) Stack is full

CSVP1 Internet lab :3 Hrs JULY-AUGUST

1. Write HTML code to display your name, register number, class and college commenting on the date of creation.

2. Write a few lines about your college including the title as “My College” a) Use appropriate text formatting options. b) Make the name of the college to scroll from the left to the right at the bottom. c) Use appropriate foreground and background color representation.

3. Display information about yourself a) Use unordered lists to display your hobbies. b) Use definition lists to display certain events. c) Use ordered lists to display your subject of interest. (Include appropriate titles and formatting features)

4. Create an HTML document to display a picture of your choice and write a few lines about it.

AUGUST-SEP

5. Write a few lines about your country with a background sound, which repeats 7 times. Also include suitable images in it.

6. Create a HTML document to display the courses available in your college. Each course should be linked to another HTML document, which provides information about the course.

7. Create an image link displaying a product. The link should provide information about the product.

SEP-OCTOBER

8. Create a list providing information about three web sites; link each item on the list to the web sites.

9. Create a table to display your class timetable. Use your choice of background color, table color, etc., Use appropriate cell spacing, cell padding and cell width.

10. Create a table denoting your family tree. Include pictures at appropriate positions.



OCT-NOV

11. Display a list of three products in a frame. Link each one to display information about the product in the second frame.

12. Create an application form, which asks for information to admit the student to the college. The information can include Name: Fathers Name: Address: Age: Date Of Birth: College last studied: List of marks:

Add “Accept” and “Reject” buttons at the end.

Lab CSVP2 -JAVA PROGRAMMING AND UNIX/LINUX OPERATING SYSTEM LAB (PRACTICAL

03

JULY-AUG

1. Write a Java program to check whether two strings are equal or not. 2. Reverse a string 3. Write a Java program to find the sum of digits of a given number 4. Write a Java program to display multiplication table

AUG-SEP

5. Write a Java program to generate prime numbers between a range. 6. Write a Java program to sort an array 7. Write a Java program to create object for tree Set and Stack and use all methods 8. Write a Java program to check all math class functions.

LINUX/UNIX operating system lab SEP-OCT

1. To conversant with system administration functions 2. To conversant with system commands 3. Write a shell program to count the number of characters in a given string. 4. Write a shell program to count the number of vowels.



OCT-NOV

4. Write a shell program to find whether the given year is leap year or not. 5. Write a shell program to check whether given string is palindrome or not. 6. Write a shell program to display all the files in a current directory. 7. Write a shell program to find the factorial of a given number 8. Write a shell program to print a string in a reverse order.

I Semester BCA

BCA105P - PRACTICALS IN C PROGRAMMING

List of programs

PART A JULY-AUGUST

1) Write a Program to find the root of the given quadratic equation using switch case. 2) Write a C Program to generate and print first N FIBONACCI numbers. 3) Write a Program to find the GCD and LCM of two integer numbers 4) Write a C Program that reverse a given integer number and check whether the number is

palindrome or not.

AUGUST-SEP

5) Write a Program to find whether a given number is prime number or not 6) Write a C Program to input numbers and to find mean variance and standard deviation. 7) Write a C Program to read two matrices and perform addition and subtractions of two

matrices. 8) Write a C Program to read a string and check whether it is palindrome or not. 9) Write a Program to find the factorial of a number using function

PART B SEP-OCT

10) Write a C Program to find if a character is alphabetic or numeric or special character. 11) Write a C Program to compute the sum of even numbers and the sum of odd numbers using a

function. 12) Write a C Program to find trace and normal of a square matrix using functions. 13) Write a C Program to accept a sentence and convert all lowercase characters to uppercase and

vice –versa.



OCT-NOV

14) Write a Program to accept different goods with the number, price and date of purchase and display them.

15) Write a C Program to find the length of a string without using the built – in function. 16) Copying the contents of one file into another. 17) Write a C program to accept the reverse of a string using pointers.



III Semester BCA BCA305P – Data Structures Using C - Lab

JULY-AUGUST

1. Write a C program to search for an element in an array using Binary search

2. Write a C program to sort a list of N elements using Bubble sort Technique

3. Write a C program to demonstrate the working of stack of size N using an array. The elements

of the stack may assume to be of type integer or real, the operations to be supported are 1.

PUSH 2. POP 3. DISPLAY. The program should print appropriate messages for STACK

overflow, Under flow and empty, use separate functions to detect these cases

4. Write a C program to simulate the working of an ordinary Queue using an array. Provide the

operations QINSERT, QDELETE and QDISPLAY. Check the Queue status for empty and full.

AUG-SEP

5. Write a C program to simulate the working of an Circular Queue using an array. Provide the

operations CQINSERT, CQDELETE and CQDISPLAY. Check the Circular Queue status for

empty and full.

6. Using dynamic variables and pointers Write a C program to construct a singly linked list

consisting of the following information in each node;

Roll – No (Integer), Name (Character string)

The operations to be supported are ;

1. LINSERT Inserting a node in the front of the list

2. LDELETE Deleting the node based on Roll – No

3. LSEARCH Searching a node based on Roll-No

4. LDISPLAY Displaying all the nodes in the list



7. Write a C program to sort a list of N elements using Merge sort Algorithm

8. Using Dynamic variables and pointers construct Binary search tree of integers , Write C

functions to do the following ;

1. Given a KEY, Perform a search in Binary search tree . If it is found display Key found else

insert the key in the Binary search tree.

2. While constructing the Binary search tree do not add any duplicate

3. Display the tree using any of the traversal method

SEP-OCT

9. Write a C program to sort a list of N elements of integer type using heap sort Algorithm

10. Write a C program to simulate the working of Towers of Hanoi problem for N disks , print the

total number of Moves taken by the program.

11. Write a C program to sort a list of N elements of integer type using quick sort Algorithm

12. Write a C program to find ncr using recursion

OCT-NOV

13. Write a C program to convert and print a given valid fully parenthesized in fix arithmetic

expression to post fix expression, the expression consists of single character (letter or digit) as

operands and +, -, * , / as operators, assume that only binary operators are allowed in the

expression

14. Write a C program to search for an element using sequential search

15. Write a C program to create file for N students, it should contain Roll-No, Name and

Marks in two subjects. Using the above created file, create an out put file which

contains Roll-No, Name, Marks in subjects, Total and Average.



BCA306P – NUMERICAL ANALYSIS and LINEAR PROGRAMMING Lab

JULY-AUG

1) Write a program to find the roots of an equation f (x) = 0 using Bisection method.

2) Write a program to find the simple/multiple roots of f (x) = 0 using Newton – Raphson

method.

3) Write a program to find the roots of system of non-linear algebraic equations using

Newton’s method.

4) Write a program to find the roots of f(x) = 0 using Secant method.

AUG-SEP

5) Write a program to find the integral of a function using Trapezoidal rule.

6) Write a program to find the integral of a function using Simpson’s 1/3rd and 3/8th rule

using switch case.

7) Write a program to find the integral of a function using adaptive Simpson method

8) Write a program to solve the system of equations Ax = b in tridiagonal form using Thomas

Algorithm.

SEP-OCT

9) Write a program to solve the system of equations Ax = b using Gauss elimination method.

10) Write a program to solve the system of equations Ax = b using Jacobi Iteration method.

11) Write a program to solve the system of equations Ax = b using Gauss-Seidel method

12) Write a program to find the largest (or smallest) Eigen value and corresponding eigen vector

of a square matrix using power (or inverse power) method.



OCT-NOV

13) Write a program to solve first and second order ordinary differential equations (

initial value problem) using Runge-Kutta fourth order method.

14) Write a program to solve first order ordinary differential equations (initial value problem)

using adaptive Runge-Kutta method .

15) Write a program to solve second order ordinary differential equations ( boundary value

problem) using shooting method based on adaptive Runge-Kutta method

and Newton-Raphson method.

16) Write a program to solve the optimization problem solvable by Simplex method.

V Semester BCA

BCA - 506: COMPUTER LAB 5.1 (Based On BCA 502) 1. Write a program to find factorial of list of number reading input as command line argument.

2. Write a program to find prime series reading N as command line argument.

3. Write a program to sort list of elements in ascending and descending order and show the

exception handling.

4. Write a program to implement Rhombus pattern reading the limit form user.

5. Write a program to implement all bitwise operations read the input form user and display

input, output errors.

6. Write a program to implement all string operations.

7. Write a program to find area of geometrical figures using method.

8. Write a program to implement constructor overloading by passing different number of



parameter of different types.

9. Write a program to create student report using applet, read the input using text boxes and

display the o/p using buttons.

10. Write a program to calculate bonus for different departments using method overriding.

11. Write a program to implement an applet by passing parameter to HTML.

12. Write a program to implement thread priorities.

13. Write a program to implement thread, applets and graphics by implementing animation of ball

moving.

14. Write a program to implement mouse events.

15. Write a program to implement keyboard events.

BCA - 507: COMPUTER LAB 3.2 (Based on BCA 504)

JULY-AUGUST 20) Design an application to validate the user name and password and display appropriate

message using message box control.

21) Application to change the font size, font and style of a text string using combo boxes.

22) Application to change the calculator using design array.

23) Application to design a calculator using design scrollbar.

AUG-SEP

24) Application to play AVI file containing audio and video using MCI control.

25) Application to play media file using active movie control or media player.

26) Application to design a screen saver (using timer).



27) Application to animation using animation control.

9) Application to move an image using a timer and command button controls.

SEP-OCT

28) Application to design MDI form to child and design the menu.

29) Design an application to establish connection to data base (Using data control).

30) Design an application to demonstrate sequential file access in VB.

31) Design an application to demonstrate the encryption and decryption in VB

32) Program to convert a number to wordings (up to 1000).

14) Program to display the message “ welcome to Visual Basic” at the center of the Window with

random fore color for the message and random back color for the form.

OCT-NOV

33) Program to display the message “ welcome to Visual Basic” through out the Window with

random fore color for the message.

34) Program to display a working anolog clock at the center the form

35) Windows API: Program to display a form always on the top of other Windows.

36) Program to display the message “welcome to Visual Basic” in a label box. The label box

should scroll from right to left.

37) Program to accept only numbers with fractional part using text box.

Documents

ACADEMIC PLANNER : COMPUTER SCIENCE