TYBsc Syllabus

________________________________________________________________________ Prop. Syllabus Page 1 of 35 T.Y.B.Sc.Comp.Sc. Jan 2001

REPORT OF THE SYLLABUS COMM ITTEE APPOINTED BY THE FACULTY OF SCENCE FOR B.Sc. COMPUTER SCIENCE COURSE

(T.Y.B.Sc. COMPUTER SCIENCE SYLLABUS) The committee held several meetings to frame the syllabus of B.Sc. (Computer Science) at T.Y.B.Sc. level. After extensive discussions, the committee arrived at following conclusions:

1. The ordinances and regulations regarding: a) The standards of passing at T.Y.B.Sc. exam b) The scheme of examination c) The number of papers, practicals and marks allotted to them d) The number of lectures per paper, number of periods per paper per week,

number of periods of practicals etc. Pertaining to T.Y.B.Sc. (Computer Science) will be identical to the ordinances and regulations existing and notified from time to time, which are applicable to other subjects such as Physics, Chemistry at T.Y.B.Sc. level. Hence, no separate draft of ordinances and regulations is given.

2. The committee, after deliberations decided that the titles, of the papers of T.Y.B.Sc. (Computer Science) are to be changed as given in Annexure I. The Course structure and other details are also given in Annexure I. 3. The detailed syllabus for T.Y.B.Sc. (Computer Science) is given in Annexure II.

There are Six Units in each paper. If there are two sections, each section of the paper is divided in 3 Units. The detailed references are mentioned at the end of each section instead of merely giving a list of reference book at the end of the paper. It is expected that the question paper will have twelve questions, two in each unit, with internal option. The student will be required to attempt six questions, one in each unit. Thus the study of any unit in the paper may not be left as an option.

4. Annexture II also gives a list of practicals, with minimum number of practicals to be performed.

5. For the purpose of examination, the breakup of total marks for practicals (200 for Group I to IV and 80 for Applied Component) will be as follows:

A) Main subject Practical Examination: Experiment I (Group I Practical) : 45 Marks

Experiment II (Group II Practical) : 45 Marks Experiment III (Group II I Practical): 45 Marks. Experiment IV (Group IV Practical

-PROJECT ): 50 Marks. Journal(Group I to II I) & Viva-voce on Journal: 15 Marks. ------------- Total 200 Marks.

-------------


B) Applied Component Practical Examination: Experiment I : 35 Marks. Experiment II: 35* Marks. Journal & Viva-voce on Journal : 10 Marks.

--------------- Total 80 Marks.

*Note: 1.Expt. II examination will be in the form of demonstration and Viva-voce on project, as mentioned in the syllabus. 2. Each student must maintain a record of the experiments & projects performed, as per the syllabus and must bring the certified journals and project reports, duly signed by the teacher concerned and the Head of the Dept. at the time of final examination.

6. Requirement of the batch size, number of students per computer in a batch and the

network configuration and other details are same as mentioned in Annexure III (pages 21,22) of the earlier report of the committee.

7. As regards the lab requirement (Hardware & Software), space and time table requirements are satisfied; the colleges may have multiple batches at T.Y.B.Sc. (Computer Science) Class. 8. As already mentioned in earlier report (para 2, page 1), “The Bachelor of Science (B.Sc.) with Computer Science course will have the status, as one of the subject at the B.Sc. Course. It is further clarified that adequate laboratory staff (viz. Lab. Assistant and Lab attendant) are required for conduct of B.Sc. Computer Science Practicals, on the same pattern as with the other science subjects such as Physics, Chemistry etc. For smooth conduct of practicals at F.Y., S.Y. & T.Y.B.Sc. (Computer Science), a minimum of 1 Lab. Asst. and a minimum of 1 Lab. Attendant be provided for each lab, each session, during entire period of laboratory practical session. 9. As the field of Computer Science is advancing at a rapid rate, the committee

strongly recommends that a provision be made for an automatic review of Computer Science syllabus more frequently i.e. every two years.

10. In view of fast changing nature of the subjects in Computer Science Course and

certainty of non-availabili ty of “ in-house” faculty to teach them (Which is a global and industry-wide phenomenon); it is strongly recommended that the Orientation Courses be conducted in the summer vacation before the new T.Y.B.Sc. Course syllabus is introduced and also after review/revision of the syllabi in the subject of Computer Science at F.Y., S.Y. & T.Y. B.Sc. levels.


11. The committee strongly recommends that workshops be held periodically to discuss: (a) New/Current topics in the syllabus and changes required in the syllabus.

(b) Uniformity in teaching and implementation of the syllabus, Difficulties encountered in teaching and implementation of the syllabi. (c) Methods to be adopted for assessment and the examination etc.

12. The Committee strongly feels that without active support, including the financial support for holding these “Orientation Courses” & “Workshops” ; the implementation of the syllabus will be jeopardized. This observation stems from the facts that i) The Computer Science is a new and recently introduced subject at B.Sc. level, unlike well entrenched subjects like Chemistry, Zoology etc. and ii ) Special nature of the subject needs preferential treatment and nurturing.

13. The Committee wishes to thank numerous faculty members, of different colleges, for their interest, discussions and valuable suggestions. 14. The Committee puts on record the valuable help rendered by A.A. section of the

University and all the faciliti es extended. I, as a convener, thank all the members of the Syllabus Committee for their active Co-operation, without which the task would not have been completed. (Dr.S.R.KAULGUD) CONVENOR


ANNEXURE –I COURSE STRUCTURE

T.Y.B.Sc.(COMPUTER SC.)

TITLE APPROX. NO.OF. LECT.

THEORY MARKS

PRACT. MARKS

TOTAL MARKS

PAPER I SECTION – I SECTION - II

SYSTEMS SOFTWARE

DATA COMMUNICATIONS & NETWORKING

100 48

52

100

Group I 50 150

PAPER II SECTION – I SECTION – II

ADVAN CED JAVA –1 ADVAN CED JAVA – 2

100 52 48

100 Group II 50

150

PAPER – III SECTION – I SECTION – II

OPERATING SYSTEMS

THE LINUX OS

100 52 48

100 Group III 50

150

PAPER – IV SECTION – I SECTION – II

STRUCTURED SYSTEM

ANALYSIS AND DESIGN

OBJECT ORIENTED ANALYSIS & DESIGN

AND SOFTWARE ENGG. CONCEPTS

100 52

48

100 Group IV 50

150

APPLIED COMPONENT

WEB DESIGN & APPLICATIONS

PAPER I

PRINCIPLES OF WEB DESIGN

50

60

Group I (A.C)

40

100

PAPER – II

WEB TECHNOLOGIES

50

60

Group II (A.C)

40

100


NOTE : For students offering “ 3 units” of computer science at T.Y.B.Sc., following will be the course structure. Paper I & Paper I I (of six units) and Group I ,Group II practicals (of six unit course) wil l form the course contents.

ANNEXURE-II

T.Y.B.Sc. COMPUTER SCIENCE SYLLABUS

PAPER-I SECTION-I SYSTEMS SOFTWARE

UNIT-I :

1.1 Language Processors: Introduction, Language Processing Activities,

Fundamentals of Language Processing & Language Specification, Language Processor Development Tools.

1.2 Data Structures for Language Processing: Search Data structures, Allocation Data

Structures.

1.3 Scanning & Parsing. (Total 14 Lectures) Ref: DMD: Chapter 1, 2 & 3. UNIT-I I : 2.1 Assemblers: Elements of Assembly Language Programming, A Simple Assembly

Scheme, Pass Structure of Assemblers, Design of a Two Pass Assembler, A single pass Assembler for IBM PC.

2.2 Macros and Macro Processors: Macro Definition and Call , Macro Expansion, Nested Macro Calls, Advanced Macro Facil ities, Design of a Macro Preprocessor.

2.3 Linkers: Relocation and Linking Concepts, Design of a Linker, Self-Relocating Programs, A Linker for MS-DOS, Linking for Overlays, Loaders.

2.4 Software Tools: Software Tools for Program Development, Editors, Debug Monitors, Programming Environments, User Interfaces. (Total 16 Lectures)


Ref: DMD: Chapters 4, 5, 7 & 8. UNIT-I I I : Compilers: 3.1 Statement of Problem: Recognizing Basic Elements, Recognizing Syntactic Units

and Interpreting Meaning, Intermediate form, Arithmetic statements, Non-Arithmetic statements, Non-executable statements, Storage Allocation, Code Generation, Optimization (Machine-independent), Optimization (Machine Dependent), Assembly Phase, General Model of the Compiler.

3.2 Phases of the Compiler: Lexical Phase, Syntax Phase, Interpretation Phase,

Optimization, Storage Assignment, Code Generation, Assembly Phase, Passes of the Compiler.

3.3 Data structures: Introduction, Implementation, Recursion, Call & Return Statements, Storage Classes, Static, Automatic, External Control & Based Storage. Implementation, Block structure, Non-local Go To’s, Interrupts, Pointers. 3.4 Interpreters: Use & Overview, Pure & Impure Interpreters

(Total 18 Lectures)

Ref: For Compilers: JD: Chapter 8. Additional Ref: DMD: Chapter 6. Ref: for Interpreters: DMD: Chapter 6.

Main References: 1. DMD: Systems Programming & OS by D.M.DHAMDHERE (2nd Revised Edition) TMH. 2. JD: Systems Programming by John Donovan TMH.

* ********


PAPER-I SECTION-I I

Data Communication and Networking

Unit IV: Introduction to Data Communication (18) 4.1 Data communication model, data communication networking, protocols and

protocols architecture WS-1.1 to 1.4

4.2 Data transmission: concepts and terminology, analog and digital data transmission, Transmission impairments-attenuation, distortion, noise, channel capacity. WS 2.1 to 2.3

4.3 Transmission media: guided transmission media, wireless transmission WS 3.1 and 3.2, FB-7.1 to 7.3

4.4 Signals: Analog , digital signals FB: 4.1 to 4.5

4.5 Data communication interface: asynchronous and synchronous transmission, line configurations, interfacing

WS 5.1to 5.3 FB- 6.1 to 6.4 4.6 Data link control: flow control, error detection, error control, HDLC, other data link

control protocols. WS 6.1 to 6.5 FB 9.1 and 9.3, 10.1 to 10.3, 11.1 11.4

4.7 Multiplexing: FDM, Sync TDM. Statistical TDM WS- 7.1 to 7.3, FB 8.1 to 8.2

UNIT V Networks: (16) 5.1 LAN architecture, Bus /Tree LANs, Ring LANs, STAR LANs, WS 12.1 to 12.4, FB 2.1 to 2.5

5.2 LAN systems: Ethernet and fast Ethernet (CSMA/CD), Token ring WS 13.1 and 13.2, FB 12.1 to 12.4 5.3 Bridges: bridge operation, routing with bridges WS 14.1 and 14.2 FB 20.1 to 20.3 5.4 Switching: Circuit switching, packet switching, FB 14.1 and 14.2 UNIT VI . Communication architecture and protocols: (16) 6.1 Protocols and architecture: Protocols, OSI, TCP/IP, TCP/IP protocol suite WS 15.1 to 15.3 FB 3.1 and 3.2

6.2 Principles of internetworking, CLNP, the Internet protocol WS 16.1 to 16.4 FB 23.1 and 23.2 6.3 Security requirements and attacks, DES.

WS 18.1 and 18.2 6.4 Electronic mail: SMTP and MIME, URL, URI, HTTP

WS 19.3 to 19.4 FB 23.4 and 23.5 6.5 ISDN: an overview, ISDN channels, User access, Broadband ISDN

WS A-1 to A-3 FB 15.1 to 15.5


6.6 WAP: Wireless Application Protocol-Introduction.

Main ref: i) Data and computer communication by Will am Stalli ngs PHI (5th ed) ii ) Data communication and networking by Behrouz Forouzan (TMH 1999) Additional References : I) Computer networks by Andrew S Tanenbaum(PHI) ii ) Local area Networks by Keiser G E (TMH)

*********

Paper II Section I

Advanced Java - I

Unit I

Explanation of the statement: "Java: A simple, object-oriented, network-savvy, interpreted, robust, secure, architecture-neutral, portable, high performance, multithreaded dynamic language".

Explanation (at the overview level) of the following terms: Plug-ins, Java API's, jdk, J2SE, J2EE, J2ME, JVM, Java Hotspot, JRE, HotJava, JAR, AWT, Swing, Applets, Servlets, JSP, Lava Beans, EJB, RMI, JDBC, JMI, Java 2D, Java 3D, DND, Java IDL, Java Collections, RSA Signatures, X.509 Certificates, JPDA.

Differentiate between jdk 1.0, jdk 1.1, jdk 1.2, J2SE, J2EE, J2ME and J2SE v 1.3. Overview of main improvements and additions in each version. Information about deprecated classes and methods till t he Java 2 platform. Support or refute the statement: "Since jdk1.1, there have not been many enhancements in the Java language specification, but there improvements have taken place in the Java API's".

Differences between: (i) Java and C, (ii ) Java and C++, (iii ) Java Language and Java Platform.

Review of the Java language.

Java keywords and identifier naming conventions. Java primitive types. Their constants, variables, final variables, operators, expressions, assignments, statements and blocks. Type conversions and promotion rules between primitive types. The Java reference types. Strings, arrays and classes. Differences in creating, copying and comparing primitive types and reference types.

Java classes and objects. Difference between the two. Variable default values. Method signature. Class methods and variables, instance methods and variables. Object constructor methods. Method and constructor overloading. The ‘ this’ keyword. The finalize() method. Using objects as parameters. Methods returning an object type. Access control. Public, private and protected instance variables. Public, private, protected, static, abstract, final, native and synchronized methods. Nested and inner classes. Subclasses and inheritance. Subclass constructors, default constructor and constructor chaining. Superclass variable referencing a subclass object. Using superclass members. Overriding


superclass methods. Preventing method overriding and and class inheritance. Abstract classes.

Java Garbage collection. Java packages. Defining a package and giving it a unique name. Access control and protection in packages. Importing packages in programs. Java interfaces. Defining, implementing, accessing, applying and accessing interfaces.

Java strings. String handling – methods in String class. Java one and multi -dimensional arrays. Object literal syntax for creating strings and arrays. Exception handling in Java. Java input/output.

Unit References: 1. S.Y.B.Sc. Java Syllabus Text Books Code:J2CR (Ch. 1-13) 2. Code PWJ: (Appendix A, B, C, D, G) 3. The Java Platform - A White Paper, Douglas Cramer, java.sun.com Website, JavaSoft. 4. The Java Language Environment - A White Paper, James Gosling and Henry

McGilton, java.sun.com Website, JavaSoft. 5. Details of Java2 jdk v1.3 from the java.sun.com Website. 6. Code:J2CR. (Ch. 6-10).

Unit II

Java.lang package. Simple type wrappers. Number, double, float, byte, short, int, long, character, boolean, process and void. The Math class.

Java Utilit y and Collection Classes. Java.util package. The collections framework (Interfaces in the collections framework, traversing collections with iterators, general purpose implementations, arrays as collections, algorithms, wrappers as implementations, extending the abstract implementations, legacy collections framework classes, traversing collections with enumerations). References 1. Code: JPAT. (Ch. 10). 2. Code: J2CR. (Ch. 14, 15). 3. Code: LJ. (Ch. 9). Unit I II

GUI, Windows and Events. Technology of a GUI, AWT & Swing API's. Programming with the JFC, Swing API components, JComponent class, Windows dialogs and panels, Layout managers (Border, flow, grid, grid-bag, card and box layouts. Tabbed panes, split panes, positioning the components), labels, buttons, and check boxes. Event listeners and adapters. Menus, tolbars and actions. Sliders, progress bars and scroll bars. Lists and combo boxes. Text entry components. Choosers. Tables and Trees. Painting 2D graphics. References 1. Code: JPAT. (Ch. 12,13).

2. Code: LJ. (Ch. 13-18).


Paper II Section I I

Advanced Java - II Unit IV

Java Beans. JavaBeans component model. Bean development environments. Using the Sun BeanBox. Creating a JavaBean class. Exploring iindexed, bound and constrained properties. Adding custom event types. Creating JavaBean class with events. Supplying additional JavaBean information. Providing a custom property editor. Creating a JavaBean class with BeanInfo class. Creating a JavaBean class that uses the BeanContext API. EJB overview. References 1. Code: JPAT. (Ch. 15). 2. Code: J2CR. (Ch. 25). 3. Code: LJ. (Ch. 19).

Unit V

Network Programming. Working with URL's. Woking with TCP/I and, Datagram sockets. Developing a remote class of objects, developing RMI client and server classes. JNDI, Java IDL and CORBA. Java Client side programming. Applets. Using the java.applet package. Extending the Applet class. Ticker message applet. Adding sound and images to applets. Understanding applet security issues. Signed applets. Permissions and policy files. Packaging applets in jar files. References 1. Code: JPAT. (Ch. 16,14). 2. Code: J2CR. (Ch. 18). 3. Code: LJ. (Ch. 11,20).

Unit VI

Java Server side programming. Servlets. Building a dynamic Web site. Understanding the http protocol. Writing servlets. Servlet API. Writing servlets to receive requests and send responses. Guidelines for server driven Web sites. JSP. Server processing of JSP's. Java programs in JSP's. Applying MVC principles using JSP's and JavaBeans. JDBC API. Loading database drivers. Establishing a database connection. Issuing dynamic SQL statements. Processing a ResultSet. References 1. Code: IJS. (Ch. 3-5). 2. Code: J2CR. (Ch. 27). 3. Code: JPAT. (Ch. 17).

Main References 1. Code: JPAT. Java Programming Advanced Topics, Joe Wigglesworth and Paula

Lumby, Course Technology (Thomson Learning), (2000).


2. Code: J2CR. Java 2 - The Complete Reference 3/e, Patrick Naughton and Herbert Schildt, TMH, (1999).

Additional References 1. Code: LJ. Learning Java, Patrick Neimeyer & Jonathan Knudsen, SPD -

O'Reill y, (2000). 2. Code: PWJ. Programming with Java - A Primer, E Balagurusamy, TMH,

(1998). 3. Code: IJS. Instant Java Servlets, Phil Hanna, TMH, (1999).

* *******

Paper-I I I Section-I

Operating Systems Unit-I : 1.1 Operating System Overview

Operating Systems objectives & functions, The evolution of operating Systems, Major Achievements, Examples of Operating systems.. WS: Chap.2.1 to 2.5

1.2 Process Description & Control Process states, Process Description, Process Control, Processes & Threads, Examples of Process Description & Control. WS: Chap. 3.1 to 3.6

1.3 Concurrency: Mutual Exclusion & Synchronization

Principles of Concurrency, Mutual Exclusion-Software Approaches, Mutual Exclusion-Hardware approaches, Semaphores, Monitors, Message Passing, Readers/Writers problem. (Total: 15 Lectures) WS: Chap. 4.1 to 4.8


Unit-I I 2.1 Concurrency: Deadlock & Starvation Principles of Deadlock, Deadlock prevention, Deadlock Detection, Deadlock Avoidance, Dining

Philosophers Problem, Example Systems.

WS: Chap 5.1 to 5.7

2.2. Memory Management & Virtual Memory

Memory Management Requirements, Loading programs into memory.

Virtual Memory: Hardware & Control Structures, Operating System Software, Examples of Memory Management.

WS: Chap.6.1 to 6.3 & 7.1 to 7.4

2.3 Processor Scheduling

Types of Scheduling, Scheduling Algorithms. Multiprocessor Scheduling, Real-time Scheduling, Example Systems.

WS: Chap.8.1, 8.2 & Chap 9.1 to 9.3 (Total 18 Lectures) Unit-III : 3.1 I/O Management & Disk Scheduling I/O Devices, Organization of the I/O Function, OS Design Issues, I/O Buffering, Disk I/O, Examples.

WS: Chap.10.1 to 10.7

3.2 File Management

Overview, File Organization & Access, File Directories, File Sharing, Record Breaking, Secondary Storage Management. Example-UNIX System-V. (4 Lectures) WS: Chap.11.1 to 11.8

3.3 Client Server Computing


WS: Chap.12.3

3.4 Graphical User Interface & OS

Introduction, Windowing Technology, GUI, Relationship between the OS & Windows, Components of GUI, Requirement of a Windows based GUI, MS-WINDOWS & NT. (4 Lectures) AG: Chap.12.1 to 12.7 WINDOWS-2000 & Windows Mill ennium Edition. Introduction & New Features, Migrating to Windows 2000 Introduction & New Features of Windows Mil lennium Edition. (Total: 21 lectures) MM: Chap.1 & 2.

ME: Chap.1 & 2.

* ******

PAPER-III SECTION-I I

THE LINUX OPERATING SYSTEM Unit-IV:

4.1. Operating Systems & Linux, History of Linux & Unix, Linux Overview, Shell: Bourne, Korn & C-shell , File structure: Directories & files, Utilit ies: Editors, Filters & Communications. RP: Chap.1 Pages: 3 to 11.

4.2 Installi ng Linux: Hardware & Software Requirements, Creating Linux partition, Creating Install Disks, Installi ng Open Linux System, Network Configuration, Final Configuration, Installi ng LILO. Installing & Configuring X-Windows. RP: Chap.2 Pages 21 to 52

4.3 Linux Startup & Setup: User Accounts, Accessing Your Linux System Starting &

Shutting Down, Login/Logout, Linux Commands, Installi ng Software Packages, Remote communications, Modem Setup, Internet Connections with Modems: pppd & ezppp, XFMail , X-Windows & network Configuration.

RP: Chap.3 Pages: 57 to 100.


4.4 Windows Managers & Desktops: X-Windows: Windows, File & Program Managers, Starting & Exiting Window Managers & File Desktops, System Configuration Tools, Windows & Icons, Xterm, X-Windows Multitasking RP: Chap.4 Pages 107 to 116.

4.5. Shell Operations: The Command Line, Standard I/O & Redirection, Pipes, Shell Variables, Shell Scripts, User defined Commands, Jobs: Background, Kills & Interruptions. Delayed Execution.

RP: Chap.5

(Total Lectures: 16) Unit V

5.1 Linux File Structure: Linux Files, File Types, File Classifications: the file & od commands. The File Structure, Home Directories, Path Names, System Directories. Listing, Displaying & Printing Files. Ls, cat, more & lpr commands.Managing directories: mkdir, rmdir, ls, cd & pwd. Nested directories. File And Directory Operations: find, cp, mv, rm, & ln.

RP: Chap.6

5.2 File Management Operations: Displaying File Information: ls –l, File & Directory permissions: chmod, Setting Permissions: Permission Symbols, chown & chgrp. Mounting & Formatting Floppy Disks, Mounting CD-ROMs, Mounting Hard Drive Partitions: Linux & MS-DOS. The fstab file. Lisa and fstool, NFS and /etc/exports, NIS, Archive Files and Devices:tar, Xtar. File Compression: gzip, Installi ng Software from Compressed Archives: .tar.gz, Downloading Compressed Archives, Compili ng Software, The mtools Utili ties: msdos, Dos & Windows Emulators: DOSemu, Wine & Will ow. RP: Chap.7.

5.3 Internet Servers: Starting Servers, Server init Scripts, inetd Server Management,

FTP Server, The Apache Web Server.

RP: Chap.12 (pages 451 to 477).

5.4 Remote Access: TCP/IP Remote Access Operations: rwho, rlogin, rcp, and rsh, TCP/IP Network System Information: rwho, ruptime, and ping, Remote Access Permision: rhosts, Remote Login: rlogin. Remote Filecopy : rcp, Remote Execution: rsh. Unix to Unix CoPy: uucp and related commands.


RP: Chap.13

5.5 Compilers & Libraries: gcc, g++ & gdp.

RP: Chap 23 (Total Lectures: 18)

UNIT-VI 6.1 Shell Programming. The Bourne Again Shell . The Vi editor. (The vi editor Commands to be covered in practicals)

RP: Chap15 & Chap 17

6.2 System Administration

RP: Chap 19

6.3 Network Administration. RP: Chap. 20

6.4 Configuring the X-Windows System.

RP: Chap21. (Total 16 Lectures)

Main References:

1. WS: Operating Systems (Second Edition) by Willi am Stalli ngs. (PHI). 2. AG: Operating Systems by Achyut Godbole (TMH) 3. RP: Linux The Complete Reference (Second Edition) by Richard Petersen (TMH) 4. MM: WINDOWS 2000 –A Beginner’s Guide by Martin Mathews (TMH) 5. ME: WINDOWS MILLENNIUM EDITION-A Beginner’s Guide (TMH)

Additional References:

1. Modern Operating Systems by Tanembaum (PHI) 2. Red Hat Linux: The Complete Reference by Peterson (TMH) 3. Systems Programming & Operating Systems(Second Edition) by Dhamdhere

(TMH) 4. Using Linux by Bill Ball (for practicals) (Que-PHI)


* *********

Paper IV Section I

Structured Systems Analysis & Design Unit I

What is a System? The general systems approach to problem solving. The three approaches to software systems development - The Structured approach, the Object Oriented Approach and the Information Engineering Approach.

Software Development Life Cycle Models. Waterfall Model, Prototyping Model, RAD Model, Incremental Model, Spiral Model, Concurrent Development Model, Component Based Model, Formal Methods Model and Fourth Generation Techniques. – Their features, strengths, weaknesses and differences between them.

Fact finding techniques. Sampling documents, forms and files. Site visits, Observation of Work environment. Questionnaire formulation. Interviewing techniques.

Project Feasibil ity Study. Operational, technical, economic, organisational and cultural feasibilit y. Defining project costs and project benefits. Cost/Benefit Analysis for a project – Net present value, payback period and return on investment computations.

Unit References: 1. Code: SADCW. (Ch. 2,3). 2. Code: SEPA. (Ch. 2,11). 3. Code: SADM. (Ch. 2,4, Module B).

Unit II

Investigating System Requirements. Functional and Technical Requirements, The sources of system requirements, identifying system requirements, structured walkthroughs.

Modeling System Requirements. The purpose, type and overview of models. Modeling system requirements for events. Modeling system requirement for objects, roles, devices, organisational units, and locations.

Data Modeling. Data entities attributes and relationships. The Entity-Relationship diagram.

Process Modeling. Developing Data Flow Diagrams. Level of abstraction. Context diagram. Top level DFD. DFD fragments. The event-partitioned system model. Decomposing processes. Physical and Logical DFD. Evaluating DFD quality. Documenting DFD components. The concept of data dictionary. Process, data flow, data store, data elements descriptions.

Representing Process Logic. Building decision tables, decision trees, structured English, tight English and pseudocode. Their usage and differences.

Unit References: 1. Code: SADCW. (Ch. 4,5,6). 2. Code: SEPA. (Ch. 12). 3. Code: SSAIT. (Ch. 5).


Unit III

The process of moving from analysis to design.

Application Architecture Design. Determining the automation system boundary.

Software Design. Designing the system flowchart and the system level structure chart. Transaction analysis and transform analysis.

Designing Databases. Databases and DBMS. Designing Relational DBMS’s. Normal forms upto 3rd normal form. Understanding of 4th and 5th normal forms. Representing entities, relationships, enforcing integrity constraints and business rules.

Designing system inputs outputs and controls.

Designing the user interface. Interface design guidelines. Dialog design. Designing Windows forms.

Unit References: 1. Code: SADCW. (Ch. 9,10,11,12). 2. Code: SEPA. (Ch. 13,15).

(Note: For References Please see the list at the end of Paper IV Section II; Object Oriented Systems Analysis Design & Software Engineering Concepts.)

Paper IV Section II

Object Or iented Systems Analysis Design &

Software Engineering Concepts Unit IV

Object Oriented Requirements Specifications and Analysis. The Unified Modeling Language. The Case diagrams, class diagrams, object diagrams. The system activities. Collaboration and sequence diagrams. States, state transitions and statechart diagrams. Activity diagrams, component diagrams and deployment diagrams.

Unit References: 1. Code: SADCW. (Ch. 7, 9). 2. Code: IUML. (Ch. 3).

Unit V

Object Oriented Databases. Designing object databases, representing classes and relationships.

Hybrid Object-Relational Databases. Classes and attributes. Relationships. Relational DBMS and object DBMS data types.

Distributed databases and distributed systems.

Client/Server Software Engineering. The structure of Client/Server systems. Software Engineering for Client/Server systems. Analysis, Design and Testing of Client/Server systems.

Unit References:


1. Code: SADCW. (Ch. 10). 2. Code: SEPA. (Ch. 28).

Unit VI

Component Based Software Engineering. Engineering of component based systems. The CBSE process. Domain engineering. The component based development. Classifying and retrieving components. Economics of CBSE.

Unit Reference: 1. Code: SEPA. (Ch. 27).

Main References: 1. Code: SADCW. Systems Analysis and Design in a Changing World, Satzinger,

Jackson and Burd - Thomson Learning/Course Technology, (2000).

2. Code: SEPA. Software Engineering – A Practitioner’s Approach 5/e, Roger S. Pressman – McGraw-Hill International Edition (2001).

3. Code: SADM. Systems Analysis and Design Methods, Whitten and Bentley – Tata McGraw Hill (1998).

4. Code: IUML. Instant UML, Pierre-Alain Muller – Wrox/SPD (1997).

Additional References: 1. Code: SSATT. Structured Systems Analysis: Tools and Techniques, Gane and

Sarson – Prentiss Hall (1979). 2. Code: UMLN. UML in a Nutshell, Sinan Si Alhir – Wrox/SPD (1998).

* ******


PRACTICALS

Group I Advanced Java - I Practicals

Notes:

The following instructions about Java practicals should be carried out in the interest of uniformity in their conduct across all the constituent colleges of University of Mumbai.

1. The practicals should be performed on the J2SE jdk 1.3 platform. The J2SE jdk 1.3 is downloadable from the java.sun.com website.

2. The compilation and execution should be from the bare command prompt available on the Windows 9.x or compatible system. Other IDE’s should not be used for program entry, editing, debugging, compilation or testing.

3. Methods available in jdk 1.0, 1.1 and 1.2, which are deprecated by jdk 1.1, 1.2 or 1.3 should not be used in programs.

4. The practical problems must be solved using the best possible methods available on the jdk 1.3, irrespective of whether those methods form a part of the T.Y.B.Sc. (Theory) Advanced Java-I and/or Advanced Java-II syllabus or not. Though there is a substantial correlation between the T.Y.B.Sc. Java theory and practicals, the practicals are not to be treated as a subset of the theory.

5. In each program, the input data (where it exists), should be output along with the results. The numeric values output should be preceded by explanatory text.

6. Exceptions should be generated and exception handling code should be written wherever necessary.

7. Some of the programs could become too long to complete in one lab session. The instructor may, in that case supply a part of the program and ask the student to complete it. The partly complete program could also contain deliberate errors, so that the student debugs the program after completing its coding. The errors could be syntactic as well as logical.

8. Classes should be properly encapsulated, so that the data structures are not directly accessible from outside of classes.

9. Polymorphism and inheritance should be implemented wherever necessary. Lab Programs Perform at least Four practicals from programs 1-8 and at least FOUR from practicals from programs 9-13.

1. Compute the factorial of an integer larger than 20, using the BigInteger (or similar) class. The main() method should accept none, one or more integers from the keyboard, validate that the input is non-negative and call a method that returns the factorial value. The result should be output in main().

2. Create a class that represents a rectangle. The rectangle object could be created by specifying either the (x,y) co-ordinates of its two diagonally opposite corners, or by specifying its length and height and the (x,y) co-ordinates of its left and corner. The rectangle should be a square if only one of the length or breadth are provided. By default, if no co-ordinates are


provided, the rectangle should be a square of unit length with two edges along positive x and y-axes.

Define methods for the following: (i) That moves the rectangle to another position. (ii ) That changes either the length or breadth of the rectangle, or both. (iii ) That determines whether a point (x,y) lies within the rectangle. (iv) That returns the largest rectangle that includes the defined rectangle and another. (v) That returns the overlap between the defined rectangle and another. Define another class that tests the above class.

3. Include sub-classes in the above rectangle class which do the following: (i) Draws the rectangle on screen.

(ii ) Draws the border of one colour and fill s the rectangle with the same or another colour.

Define another class that tests the rectangle class and its subclasses.

4. Define a class that holds a complex number x+iy. Define no parameter, one parameter and two parameter constructors for the class.

Code methods for the following. That returns the real part of the number. That returns the imaginary part of the number. That returns the modulus of the number. Returns the sum of two complex numbers. Returns the difference between two complex numbers. Returns the product of two complex numbers.

Define a test class that checks the methods defined above.

5. Define a subclass that extends the FilterReader class. The sub-class removes all the Tags from an HTML file to present plaintext output.

Define a test class for the above class. An exception should be thrown and handled if the source file could not be found.

6. Define a subclass which extends the BufferedReader class. The sub-class filters out and displays only those lines from a text file that contain a given character string. An exception should be thrown and handled if number of command line arguments are not proper and if the source file could not be found.

7. Define a class that copies a file to another, destination file with the following provisions:

If the destination is a directory, source file name should be used. If the destination file exists, first ensure that it could be overwritten and then overwrite it only after operator permission is received. If the destination file does not exist, ensure that the directory does and a file could be written to it before copying.

Define a class to test out the program completely.

8. Define a class to read a file, compress it and output the compressed file as another file on disk. The program should either compress a single file, or if the file parameter is a directory, compress all files in the directory. Define a test class to demonstrate the program.

9. Define a class that enables the drawing of freehand lines on a screen through mouse clicking and dragging. Use anonymous inner classes to implement event listeners. The drawing should be cleared when a key is pressed and the line colour should be selectable. Define a test class to demonstrate the program.


10. Define a class that produces an applet, which performs a simple animation of moving a coloured object (like a circle), on the screen. Demonstrate the screen animation.

11. Define a class that transforms a simple shape like a rectangle by translating, scaling, rotating and shearing it. Demonstrate the class by a screen drawing.

12. Define a class that fill s one shape by gradient fill, fill s another with a tili ng effect and still another by a shadow effect. Demonstrate the class by a screen drawing.

13. Define a class that demonstrates anti-aliasing at the boundary between two colours. Demonstrate the class by a screen drawing.

Reference: Java Examples in a Nutshell – David Flannagan, SPD-O’Reill ey (2000).

* ********

GROUP: I I

VISUAL BASIC, LINUX & SHELL PROGRAMM ING PRACTICALS

VISUAL BASIC 6:

1. Multiple Forms: a) Creating and handling multiple forms. b) Referring to Objects on a Different Form. c) A Multiple form project.

2. Accessing Database files: a) Data bases supported by VB 6. b) Creating database files for Use by VB c) Using the Data Control. d) Viewing the database file.

3. Navigating the Database: a) Using List Boxes and Combo boxes as Data-Bound Controls. b) Adding a Look up table and Navigation. c) Updating a Database File, Preventing Errors.

4. Advanced data handling-Grids, Validation, Selection and SQL: a) Displaying Data in Grids. b) Validation and error trapping c) Validation Techniques. d) Recordsets, Searching. e) Reordering a Table Recordset f) Creating a New Dynaset Using SQL.


g) Tracking database Erros. 5. Drag-and Drop:

a) Create the User Interface. b) Set the properties. c) Add Command Buttons. d) Dragging and dropping Multiple Objects. e) The Toybox Program.

6. Dynamic Link Libraries: a) The Declare Statement. b) Passing Arguments ByVal and ByRef. c) Calli ng a DLL Procedure d) Finding the Reference Information for DLLs. e) Accessing System Information with a DLL. f) Placing Tabs for Columns in a List Bok.

7. Object Linking and Embedding: a) Object Linking b) Object Embedding c) Creating OLE Objects at Run Time.

8. Visual Basic for Applications:

a) Recording an Excel Macro b) A Sample Excel VB Application.

9. Multiple Document Interface (MDI): a) Creating on MDI Project b) Adding Menus to an MDI project. c) Creating a Window Menu d) Defining Shortcut Menus e) The Report Designer. f) Printing the Report.

10. Graphics: Study of Graphics commands & its applications.

NOTE: 1. Some of the experiments listed above may require more than one turn. The teacher should decide and allot the time required for each title listed above 2. Minimum number of experiments required is six from above. 3. Reference for above practicals: Programming in VB 6.0 by Julia Bradly & Anita Mil lspaugh (TMH)


LINUX & SHELL PROGRAMMING: 1. Creating a Linux Partition (Using either MS-DOS FDISK Command or LINUX

fips Command), Creating boot disks for LINUX & Installi ng LINUX. Login & logout, shutting down the server. (This may be a demonstration experiment, the demo to be given by the teacher.)

2. Basic LINUX commands I:

Logging on to LINUX, Creating a user account.

File system: ls command with flags, pwd, cd, ls, cat, mkdir, rmdir,chmod,cp,rm, mv 3. Basic LINUX commands II : General puropse Utiliti es: more, file, wc, od, cmp, comm, diff, lp, banner, cal, date, who, tty, sty

3. Basic LINUX commands III:

Simple Filters: pr, head, tail, cut, paste, sort, uniq, nl & kill commands. Line editing with ex command Logging out .

4. To study vi editor: Create a file, Enter the text, Edit Text, Moving around, Save the file. customizing ex/vi, .exrc file & Exinit, options to vi, splitti ng a file using

split command. (Study all important commands & key combinations)

5. Advanced Filters: Single Quotes & Double Quotes, the grep command, Extending grep - the egrep command, Multiple string searching: the fgrep, Stream editing with sed command

Translating characters-the tr command. Relational join: The join command

6. Shell Programming (6 Simple programs to be entered compiled & executed.) Shell Programming Sample Programs:

1) Write a shell script which will use case structure to output the following

1. List of files. 2. Processes of user. 3. Today's date. 4. Users of the system. 5. Quit to Unix


2) Write a shell script which will compile a C program and hence execute it.

7. Advanced Shell Programming

8. Advanced File System 9. System Administration

Minimum six practicals from above should be completed. References 1. UNIX SysstemV.4 Concepts & Applications By Sumitabha Das (TMH)

2. Using Linux by Bill Ball (Que-PHI)

* ********

Group I I I

Advanced Java - I I Practicals Notes

Please see the instructions in the Notes section of Group I, Advanced Java 1 Practicals, as they are also applicable for the conduct Group III, Advanced Java - II practicals.

Lab Programs

1. Perform any NINE practicals with at least TWO practicals from each unit. 2. The practical should be conducted on a network using TCP/IP protocol and some of

the programs will require the IP addresses of the server and/or a few other nodes.

3. The student should write additional classes where required to test and/or display the results of the classes defined below.

Unit 1

1. Develop a Java bean that is a 2D shape fill ed with colour, which could take on different shapes. The colour changes randomly each time the mouse is clicked on the bean.

2. Create a Java bean that displays multiple lines of text with margins and alignment.

3. Create a Java bean that accepts numeric data as text, validates it as a number and then makes the numeric value available for further processing.

4. Create an invisible Java bean that multiplies the values of two of its properties and places the product in a third as a read only property.

Unit 2

5. Define a class to download a file from the Internet and either copy it as a file on the local machine, or output it to the screen.


6. Define a class that displays information about a file URL like its type, encoding, length, dates of creation, last modification and expiry. Additionally the class should display the request method, response message and the response code for a Web URL.

7. Build a class that implements a minimal http daemon that listens to a specified port and services simple ‘get file’ requests.

8. Build an applet that sends a datagram to a server each time that it is started or stopped. Further build a server application that receives the sent datagram and prints it out.

Unit 3

9. Write a servlet that accepts text and numbers sent from an HTML document and displays them on screen.

10. Write a servlet that accepts single-valued as well as multi -valued parameters like check boxes and multiple selection list boxes from an HTML document and outputs them to the screen.

11. Write a servlet that reads the name of the servlet class and its initialisation parameters from a server file and then displays these parameters on the screen.

12. Write a servlet that redirects the user to a different Web page when an out of sequence Web page is requested by him/her.

References: 1. Java Examples in a Nutshell – David Flannagan, SPD-O’Reill ey (2000). 2. Java 2 - The Complete Reference 3/e, Patrick Naughton and Herbert Schildt, TMH, (1999). 3. Learning Java, Patrick Neimeyer & Jonathan Knudsen, SPD - O'Reill y, (2000). 4. Instant Java Servlets, Phil Hanna, TMH, (1999).

* ******


Group I V

SSAD and OOAD Project

General guidelines for project per formance evaluation:

The student is required to analyse design, code and implement an actual system. The system could be implemented either as a traditional system, an event driven system, object oriented system or as a databased system. The coding and implementation should be in one of the languages/packages that are defined in the Computer Science syllabus of either F.Y.B.Sc., S.Y.B.Sc. or T.Y.B.Sc.

The project shall be done individually by each student, though a project with the same title could be given to more than one student.

A project guide should be assigned to students, who will generate a schedule for the completion of each of the phases of the project and hand it over to the students under his care before the 15th of July in the third year of the Computer Science course. It is highly recommended that the colleges try and obtain the services for external project guides who have working experience of managing projects. The guides should oversee the project progress on a weekly or fortnightly basis.

The student will produce and maintain a Gantt chart from the given schedule. The actual completion of each phase should also be noted on the chart. The chart shall be placed in the project documentation immediately after the Certificate and separate marks are assigned for completing each phase on time, as indicated by the Gantt chart during project evaluation.

The minimal phases for the project are: Project search, finalisation and allocation. Investigation system requirements. Data and Process Modeling. System Design. Program design. Program coding and unit testing. System integration. System implementation and acceptance testing.

The phases could be suitably modified if the waterfall paradigm is not used for project development or if the project uses Object Oriented techniques. The project guide should control iterations if any non-linear technique for project development, like prototyping, is used. The design phase must finish in the first term so that coding and unit testing could commence during the Diwali vacation. The project must be completed latest by 31st January of the academic year.

The project must be periodically reviewed by the project guide, who should certify the completion of each phase by affixing his signature on a table maintained for the purpose. The date of the signature assumes importance in view of the marks assigned in evaluation for completing each phase on time. A phase is deemed completed only when its documentation is submitted and approved. The signed sheet should appear in the project report after the Gantt cart.


Changes in the submitted documents are possible, as project development is essentially an evolutionary process. The project guide must ensure that changes are necessary due to the knowledge gained in succeeding phases of the project. The date of completion of a phase should be brought forward if the changes made are deemed to be errors and not due to additional knowledge gained from a succeeding phase.

The completed project must be reviewed in the in the month of February (or earlier) by the project guide to ensure that it is correctly working. The project guide should affix his signature on the certificate after the final review is conducted.

The certificate should minimally contain the following information.

• The fact that the student has successfully completed the project as per the syllabus, and that it forms a part of the requirements for completing the B.Sc. degree in Computer Science of University of Mumbai.

• The names of the student and the project guide. • The academic year in which the project is done. • Date of submission and final review of the project. • Signature of the project guide and the head of department with date along with the

department stamp. • Space for the signature of the University examiner and date on which the project is

evaluated.

The project report should contain the following system documentation (one copy for the project).

• Organisational Overview • Description of the present system. • Limitations of the present system. • The Proposed system – Its advantages and features. • Context diagram of the proposed system. • Top level DFD of the proposed system with at least one additional level of expansion. • Structure Chart of the System. • System flowchart. • Menu Tree • Program List. • Files or Tables (for DBMS projects) list. Class names to be entered for each file in

OO systems. • List of fields or attributes (for DBMS projects) in each file or table. • Program – File Table that shows the files / tables used by each program and the files

are read, written to, updated, queried or reports were produced from them. • Reports List with column headings and summary information for each report. • System Coding and variable / file / table naming conventions. • System controls and standards. • Screen layouts for each data entry screen. • Report formats for each report.


The project report should contain the following program documentation (one copy for each program).

• Program id. • Program level run chart. • Program function explanation. • Data entry screen (reproduced from system documentation). • Report layout (reproduced from system documentation). • Program level pseudocode or flowchart. Add decision tables, decision trees, tight

English explanation where necessary. • Program listing. • Test data. • Test results.

The project shall be evaluated by the University examiner at the time of University practical examinations. The system code should be available on a disk for evaluation along with the project report. The examiner should critically evaluate whether the project has been suff iciently tested by going through the test data and test results.

The student is expected to present and demonstrate the project to the University examiner.

50 marks are allotted to the project, which shall be divided as under.

Project documentation 10 Marks. Adherence to project schedule 10 Marks. Project quality 10 Marks. Demonstration of working project 10 Marks. Project presentation 10 Marks.

The examiner may deduct 2 marks, up to a maximum of 10, from the 'Adherence to project schedule' head for each schedule milestone that is missed by the student. The examiner may deduct 5 marks from the 'Project quality' head if the test data and results are not suff iciently exhaustive.

* ******


T.Y.B.Sc. COMPUTER SCIENCE

APPLIED COMPONENT

WEB DESIGN & APPLICATIONS Impor tant Note: The Web development is as much about creativity as about technology. While teaching (as well as while evaluating the student performance) proper emphasis should be given to each of the two aspects. The content creation is as much important as the technical know-how. All the time, case studies based on good sites should be given as ill ustrative examples while teaching this subject. Topics that need to be covered in two papers: 1. Web design and implementation process. 2. Keep the user in mind. 3. Objectives of a specific site. 4. Design philosophy. 5. Consistency throughout the site. 6. Compatibili ty with different browsers. 7. Selecting proper server and Uploading the site. 8. Creating User Interface, Gathering information. 9. Providing data-base connectivity. 10. Site maintenance and updates. Technologies Involved: 1. HTML & its extensions such as DHTML, XML etc. 2. Embedding Graphics, pictures, animation etc. 3. Embedding Java Applets. 4. Frames, Cascading Style-sheets. 5. Providing interactivity: Java Script, VB Script, Active Server Pages. 6. Audio & Video contents. 7. PERL CGI Script 8. FTP, TELNET etc. (TOTAL NUMBER OF LECTURES FOR EACH PAPER (APPROX): 50.


PAPER-I

PRINCIPLES OF WEB DESIGN Unit-I :

1.1 What is web-design? Web Design Pyramid, Building Web-sites, User perspective, Content focus, Evaluation of a web-site. TP: Chap.1

1.2 The Web Design Process: Basic Web Process Model, Goals & Problems, Audience and User Profili ng, The site plan, Design, implementation & Testing, Release & beyond.

TP: Chap.2

1.3 Designing For Users: Usabilit y, Knowing the users, User characteristics,

Response & Reaction time, GUI conventions, Web conventions, Accessibilit y, Usability.

TP: Chap.3

(Total 8 Lectures) Unit-I I : 2.1 Site Types and Architectures: General Web site types, Interactive vs. static sites,

Dynamic sites, Site Structure, Organization Models, Hierarchy, Deep vs. Shallow Sites,

Site types: Commercial sites, Informational, Entertainment, Navigational, Community, Artistic, Personal sites. (3 Lectures) TP: Chap 4 2.2 Navigation, Where am I? Precise location on the web: URLs, Page & site labels, Page

& Site style and Location, History, Placing Navigation Top, Bottom, Left, Right etc. Using Frames & sub-windows, Book-marking.

TP: Chap.5 2.3 Linking: Text, Buttons, Icons and graphics. Search and Design, How search engines work, Optimizing for search engines. Site Maps, Indexes & other navigational & user aids. TP: Chap.6, 7 & 8. (Total 10 Lectures)


Unit-III 3.1 Elements of Page Design: Page Types & Layouts, Page Sizes, Page Margins, Page

Types, Entrance Pages, Exit Pages, Text Design Metaphor & Thematic Design. GUI-Oriented Design., Layout Examples.

TP: Chap.9 3.2 Text & Color: Text Using Graphics, Setting Fonts, Using Downloadable fonts (say

Devnagari fonts), Dynamic Fonts, Netscape vs. IE Browsers. Text Layout, Formatting Tables, Writing For the web. TP: Chap 10.

3.3 Colors, Images and Backgrounds.

TP: Chap.11.

3.4 Building Interactivity Using GUI Features. TP: Chap.12

Total 10 Lectures.

UNIT-IV: E-COMMERCE:

4.1 Introduction, The Scope of E-Commerce, Definition, E-Commerce & Trade

Cycle, Electronic Markets, Electronic Data Interchange (EDI), E-Commerce in Perspective.

4.2 The Value Chain, Supply Chains, Porter’s Value Chain Model, Inter Organizational Value chains.

4.3 Competitive Advantage, Competitive Strategy, Porter’s Model, First Mover Advantage, Sustainable Competitive Advantage, Competitive Advantage using E-Commerce, Strategic Implications of IT.

DW: Chapters 1, 2, 3 & 4. Total 8 Lectures. UNIT-V:


5.1 Case Study of E-Commerce in Passenger Air Transport. 5.2 Electronic Markets. 5.3 Electronic Data Interchange (EDI).

DW: Chapters 5, 6, 7, 8 & 9. Total 8 Lectures. UNIT-VI :

6.1 Elements of E-Commerce 6.2 Purchasing On-line & After Sales On-line. 6.3 Introduction to E-Business. 6.4 Technology Adoption & other Issues. DW: Chapters 11, 15, 16 & 17. Total 8 Lectures

References: 1. TP: Web Design The Complete Reference by Thomas Powell

(TMH)

2. DW: e-Commerce Strategy, Technologies & Applications by David Whitley (McGraw Hill International Edition)

* *******

PAPER-II

Web Technologies UNIT-I 1.1 HTML & Graphics: HTML 4.0 Tag Reference, Global Attributes, Event Handlers, Document Structure Tags, Formatting Tags, List Tags, Hyperlinks, Image & Image map, Table Tags, Form Tags, Frame Tags, Executable Content Tags.

1.2 Image Maps, Advanced Graphics, Tables, Frames, forms &

Style Sheets.

ELJO: Chapter 2.

Total Lectures 8.

UNIT-I I


XML: Introduction to XML, Problems with HTML & SGML, Types of XML Markup, Document Type Definitions, Linking, Using Style Sheets with XML, XML Summary.

ELJO: Chapter 3.

Total Lectures 8.

UNIT-I I I

3.1 Introduction to Java Scripting, Web Browser Object Model, Manipulating Windows & Frames with Java Script. Using Java Script to create smart forms.

3.2 Cookies and State Maintenance: Maintaining State, Introduction to Cookies,

Advantages and limitations of Cookies, Disadvantages of Cookies, How to Use Cookies, which Servers and Browsers support Cookies.

3.3 Introduction to DHTML. Advanced Netscape DHTML, Advanced Microsoft

DHTML & Cross browser DHTML. ELJO: Chapter 4, 5 Total 10 Lectures. UNIT-IV 4.1 CGI & Server side scripting, CGI & the WWW, Beyond HTML with CGI, How CGI

works? CGI Server requirements for WINDOWS-NT & UNIX, CGI script structure, Standard CGI Environment Variables, CGI Libraries, Java Servlets, Server-Side JavaScript.

4.2 Web Database Tools, ORACLE & MS-ACCESS, Database tools, PHP, Server Side Includes, Visual Basic, Scripting Edition & Active Server Pages. ELJO: Chap. 6.

Total 10 Lectures. UNIT-V Using Java Tools:

• Input & Interactivity with Java • Graphics & Animation • Network Programming & Security.

(Thorough famili arity & Knowledge of Java Programming is assumed, only web- applications to be emphasized)


ELJO: Chap 7 Total 8 Lectures. UNIT-VI Apache Web Server, Server Side programming, Security Issues. Ref: Web Design the Complete Reference by Thomas Powell . Total 8 Lectures. References: 1.ELJO: Using HTML 4, XML & JAVA by Eric Ladd & Jim O’Donell . (Platinum Edition) (PHI) 2. PERL & CGI by Elizabeth Castro (Pearson Education Asia)

****** APPLIED COMPONENT PRACTICALS

GROUP I (A.C.)

1. Basic HTML Tags 2. Advanced HTML Tags 3. Cross Browser DHTML: Browser Detection, Dynamic Fonts, Style-sheets etc. 4. XML 5. Forms 1: Using Java script. 6. Forms 2: Netscape Script. 7. Forms 3: Using CGI Script. 8. Forms 4: ASP 9. Accepting Information from the site visitor. 10. Providing Database connectivity & interactivity. 11. Creating VB Front-end. 12. FTP Uploading of the web-site with or without an FTP client. 13. Server Side Programming. 14. Using HTML editor (any one). 15. Using Cold Fusion or equivalent tool. 16. Develop an application for Secured Transaction Site using any suitable tools. 17. Comparative Study of different Web browsers, including their latest version. 18. To develop Web based e-mailing system Minimum twelve practicals from above should be performed.

GROUP I I (A.C.)


Case Study: To Conceive, design & Implement a complete and integrated Web-site of one existing or hypothetical organization. (Upload this web-site on a server) Prepare a project Report & Discuss the designing and issues related to the development of this web-site. Note: 1. The teacher should encourage the students to get a live project for this purpose for as many students as possible.

2. There should be external evaluation(Viva) of this project. The project (Web-Site) should be uploaded on local & remote servers & be shown on-line to the examiner for evaluation as far as possible. (On-line evaluation is advisable to check the cross platform compatibil ity and other aspects of the project).

References: 1.The Web Programming Desktop Reference (6 in 1) (Que-PHI) 2. HTML by Xavier (TMH)

3.Online documentation from Microsoft, Sun Microsystems, Netscape etc.

* *********

Documents

TYBsc Syllabus