Computer Networking

BCA 251 CS Year: II Teaching Schedule Hours / Week Theory Tutorial Practical 4 1 3 Examination Scheme Internal Assessment Theory Practical 20 50 Theory 80 Final Practical Total 150 Semester: II

Objective: The course aims at providing a sound conceptual foundation in the area of Computer Networks with emphasis on the design aspects. The course attempts to provide a balanced treatment of the state-of-the-art in the area and thus prepares the students for taking more rigorous and specialized courses in this and related fields. Contents:: 1. Introduction to Computer Network Types of network (LAN, MAN, WAN, etc) Network topologies (Bus, Ring, Star, Hybrid, etc) Wireless networks (Bluetooth, WiFi, WiMAX, etc) Packet switched and circuit switched networks, Virtual circuits Ethernet, Token bus, Token ring, FDDI 2. 3.

[6]

Network Architecture and components [6] Layered architecture, interfaces, services, and protocol hierarchies ISO-OSI reference model TCP/IP reference model Novell networks Internet protocol stacks Network components (NIC, Bridge, Repeater, Hub, Switch, Router, Gateways), Collision and Broadcast domains Ethernet cabling standards Data Communication [12] Communication network and its types Features and advantages of network Concepts of data, signal, channel and circuits, channel speed and bandwidth, bit rate and baud rate, maximum data rate of a channel Signals, waves and transmission Analog and digital communications Asynchronous and synchronous transmission Data encoding techniques Modulation, and noise Multiplexing and demultimplexing T1 / E1 carrier systems Transmission media Transmission errors, error detection and correction codes X.25, Frame relay, SMDS, ISDN, ATM, ADSL, CDMA, MPLS IEEE Working groups for 802 family listing [6]

4. Data-link layer Data link layer design issues Data link layer services, LAN address (MAC) and ARP Framing methods

Error control (detection and correction) Sliding window protocol Data link protocols, HDLC, SLIP, PPP

5. Network layer [12] Network layer design issues IP based networks (IP V4 addressing and classification, Subnetting, VLSM, CIDR, Supernetting and route aggregation, multicasting, broadcasting, IP V6 Introduction) Concept of Routing (Static and dynamic routing) Routing algorithm (Shortest path, flooding, flow based, distance vector, link state) GSM Cellular network and Mobile-IP Congestion control and prevention, Leaky bucket algorithm, Token bucket algorithm Internetworking Tunneling and routing, ATM Internetworking, Mobile routing schemes Network layer protocols, IP, ICMP, IGMP, IS-IS, RIP, OSPF, IGRP, EIGRP, BGP 6. Transport layer Transport layer design issues Service primitives Connection oriented and connectionless networks Transport layer protocols TCP and UDP TCP crash recovery 7. Application layer Network security issues Authentication Authorization and Accounting Cryptography and encryption, PKI Secret algorithms Firewalls and UTM Upper layer Services: DHCP, DNS, Email, FTP, HTTP, HTML, WWW SNMP Tutorial: 1. IP Subnetting and VLSM Lab: 1. 2. 3. 4. 5. Ethernet twisted pair cabling Workgroup network and file sharing over Static IP, Dynamic IP (DHCP), and APIPA. Basic network commands and network management and troubleshooting Static Routing and Dynamic routing (RIP and OSPF) Firewall, ACL, and NAT [6]

[12]

Reference: 1. A. Tanenbaum, Computer Networks. III Ed. Prentice Hall East. Econ. Ed. 2. G. Keiser, Local Area Networks, McGraw-Hill International Ed. 3. F. Derfler, Jr., Guide to Linking LANs. 4. S. Keshav, An Engineering Approach to Computer Networking, Addison-Wesley Longman, 1997. 5. William Stallings, Data and Computer Communications, Fifth Edition, Prentice Hall of India, New Delhi, 1997. 6. D.E. Comer, Internetworking with TCP/IP, Volume 1, Third Edition, Prentice Hall of India, 1995. 7. Marshall T. Rose, The Open Book, A Practical Perspective on OSI Prentice Hall, 1990.

BCA252 CS Operating Systems (3 Cr.)

Year II
Teaching Schedule Theory Tutorial Practical 3 1 2

Semester II
Examination Scheme Internal Assessment Final Theory Practical Theory 20 20 60 Total Practical 100

Objectives:
The objectives of this course are to: Help students become familiar with the fundamental concepts of operating systems; Help students become competent in recognizing operating systems features and issues; and Provide students with sufficient understanding of operating system design and how it impacts application systems design and performance.

Contents: 1. Introduction
Definition Components of Computer System Operating system as an extended machine & resource manager. History of operating system. Operating system concepts. Operating system structures.

(4 hrs.)

2. Processes and Threads

(10 hrs.)

Introduction Process Model, Process states, Process Control Block Introduction to threads, Kernel and user implementation of Threads Inter-process communication (Multiprocessing, Parallel processing, Critical Sections, Race Condition, handling critical section problems : Mutual Exclusion with Busy Waiting, semaphores, Monitors etc) Process scheduling

3. Memory management
Memory management without swapping Swapping Virtual memory Page replacement algorithm Predicting page faults Segmentation with paging

(10 hrs.)

4. Files systems
Files Directories File system implementation Protection mechanism and operating system securities

(8 hrs.)

5. Input/ Output
Principles of input output hardware Principles of input output software Disk and disk scheduling Clocks Terminals

(8 hrs.)

6. Deadlocks
Resources Condition of deadlocks Deadlock modeling Ostrich algorithm Deadlock detection and recovery Deadlock avoidance & prevention

(5 hrs.)

8. Case study:
a) b) c) UNIX MS-DOS NT

(No classes are allotted to the case study; the students themselves referring various books should study this unit). There shall be a minimum of fifteen lab exercises covering various features of different O.S. (Unix, Linux, DOS, Windows)

Textbook:
1. 2. Andrew S. Tanenbaum, "Modern Operating System", PHI. th Silbersatz and Galvin, "Operating System Concepts", 5 edition, Addison Wesley.

BCA253 HS Statistics and Probability Theory (3 Cr.)

Year II
Teaching Schedule Theory Tutorial Practical 3 1 -

Semester II
Examination Scheme Internal Assessment Final Theory Practical Theory 20 80 Total Practical 100

Objective:
After the completion of the subject, students are expected to be able to (i) assemble data (ii) analyse data (iii) determine central tendency, distribution and make viable conclusions for decision-making.

1. Nature And Scope Of Statistics:

Definitions of Statistics; Descriptive And Inferential Statistics; Scope Of Statistics; Limitations And Distrusts Of Statistics. -2

2. Data And Its Collection:

Primary And Secondary Data; Sources of Primary & Secondary data; Methods of data collection: census method, sample method, compilation of administrative records. -2

3. Classification And Tabulation Of Data:

Classification Procedure; Qualitative And Quantitative Classification; Tabulation Of Data. -2

4. Diagrammatic And Graphic Presentation Of Data:

Importance And Limitations; Types Of Diagrammatic Representations, Bar Diagram; Pie Diagram; Pictogram; Types of Graphic Representations; Histogram; Frequency Polygon; Frequency Curve; Cumulative frequency Curve (Ogive). -3

5. Measures Of Central Tendency:

Arithmetic Mean; Geometric mean, Harmonic mean; The Median; Quartiles; Deciles And Percentiles; The Mode; Relation Between Mean, Median And Mode. -4

6. Measures Of Dispersion:
Absolute And Relative Measures; The Range; Inter Quartile Range; Quartile Deviation; Mean Deviation; Standard Deviation; Coefficient Of Variation; Skewness; Kurtosis; -4

7. Probability:
Preliminaries; Classical, empirical, axiomatic approaches of probability theory, conditional probability, Inverse probability, Probability Distribution, Mathematical Expectation & Variance of Random variable. -6

8. Theoretical Distribution:
Introduction; Binomial Distribution And Its Chief features (Without Proofs); Fitting A Binomial Distribution, Poisson Distribution And Its Chief Features (Without Proof); Fitting poission distribution, Normal distribution & its chief features; Area under Normal distribution; Hyper-geometric distribution. -7

9. Estimation Theory & Testing of Hypothesis:

Idea of sample & population; point estimation & Internal Estimation; characteristics of a good-estimator; Interval Estimation of population parameters; sampling distribution & standard error; sampling of attribute; test of significance For single proportion, Test of significance For difference between two proportions, Sampling of variables; Large sample Test; Test of significance for Single mean, Test of significance for difference between two means; small sample test; student's tdistribution & its applications. -7

11. Chi - Square Distribution:

Introduction; Application; Test of Goodness of fit, test of Independence of attributes; -3

10. Correlation And Regression Analysis:

Introduction; Correlation Analysis; Various methods of calculating correlation coefficient, Regression Analysis. -5

Text Book:
Statistical Method For Research Workers: Sukhminder Singh Et Al: Kalyani Publisher, New Delhi.

Reference:
1. 2. 3. 4. A Basic Course In Statistics: B. M. Clarke And D. Cooke; Elbs (U.K.) Basic Statistics; B. L. Agrawal; Wiley Eastern Elements Of Statistical Reasoning: Minimum And Clarke: Johnwiley And Sons. Statistics For Management: Levin; Prentice Hall Of India.

BCA256 MS Technology and Operation Management (3 Cr.)

Year II
Teaching Schedule Theory Tutorial Practical 3 1

Semester II
Examination Scheme Internal Assessment Final Theory Practical* Theory** 20 80 Total Practical 100

*Continuous **Duration: 3 hours

Objective:
The basic objective of this course is to provide students with the fundamental knowledge of technology and operations function of an organization.

1. Nature and concept of Operation management:

Meaning of operation management Differences and similarities between manufacturing and services. Operation management and organization A case study of successful Japanese owned facilities in United States Corporate strategy Market analysis Competitive priorities Flow strategy Flow strategy and competitive priorities Breakeven analysis Preference matrix

2. Operation Strategy

3. Process Management
Major process decision: Process choice, Vertical integration, resource flexibility, capital intensity Relationship between decisions

4. Management of Technology
Meaning and Role of Technology Information Technology

5. Total Quality Management

Quality as a management philosophy Total Quality management tools: Employee involvement, Continuous improvement and The cost of poor quality Improving quality through TQM A case study of Cranston Nissan

6. Capacity, Location and Layout

Meaning and Measures of capacity, Factors affecting location decisions, Meaning of Layout, Layout types

7. Forecasting
Concepts Judgment methods Casual method: Linear regression Time series methods

8. Material requirement planning

Inputs to material requirement planning Planning factors Outputs from material requirement planning

9. Just in time system

Characteristic of just in time system The KANBAN system

Text Books
1.
1. 2. 3.

Krajewski, Ritzman, "Operations Management, Strategy and Analysis", Addison - Wesley Publishing Company.

Reference Books
Elwood, S Buffa, Rakesh Sarin, "Modern Production/Operation Management", John Wiley and Sons James B. Dilworth, "Production and Operations Management", McGraw Hill Publishing Company Everett E. Adam Jr. Ronald J. Fbert, "Production and Operation Management", Prentice-Hall of India Pvt. Ltd.

Advanced Programming (4 cr.)

Theory 4 Tutorial 1 practical 3 Internal assessment Theory Practical 20 50 External Theory 80 total 150

1. Basic a. OOP review in java: Overview of object oriented programming, introduction to Java, features of Java, basic data types in java, operators and precedence, control flow statements, looping, break, continue, label, arrays, strings, vectors, class and objects. 6hrs b. Class and object review in java: Methods(constructor, overloading, overriding), command line arguments, subclasses, final classes, abstract classes, packages, access modifiers. 5hrs c. Exception Handling, interfaces, inner classes, types of inner classes. 3hrs d. Multithreading 4hrs Introduction, time sharing solution, application of multithreading, creating thread, lifecycle of thread, extending thread class, implementing the runnable interface, thread synchronization. 2. Applet programming 5hrs Introduction, standard applet methods, putting an applet on a web page, passing parameters to applet, applet life cycle, adding graphics and colors, user interfaces for applet, adding and arranging components on user interface, frames. 3. GUI programming 6hrs Introduction to AWT and swing, using swing components, Jcomponents, Jlabel, JToolTip, JTextField, JCheckBox, JButton, JPanel. Event Handling (introduction, event delegation model, events, event listener interface, windows event handling, listener adapter classes, action event handling). 4. Java INPUT/OUTPUT 5hrs Streams, predefined streams, standard streams, character streams, byte streams, flie streams, data streams, Reading console input and writing console output. 5. JDBC 5hrs JDBC basics, setting up a database, setting up a connection, create statement, execute statement, retrieve result, close connection statement, java.sql package(Driver manager, Driver interface, DriverPropertyInfo, Connection interface, statement interface, PreparedStatement interface) 6. Network Programming Networking in java basic (loading applet from network, loading images from URL), Network basic (TCP,UDP, ports, networking classes in JDK), Programming with URL(Parsing URL, reading from URL, connecting to UR, reading from and writing to a URL connection) 4hrs TCP socket, TCP server (code), TCP client (code), run TCP server/client and support multiple client, UDP socket, UDP server(QuoteServer class, QuoteServerThread class- code),UDP client (QuoteClient class-code) 7 hrs 7. Distributed Applications a. Introduction to distributed objects, Overview of RMI, interface to RMI remote server(program), RMI client(program) 5hrs b. CORBA introduction(concept-no need program), java IDL, overview and introduction to Java BEANS (BeanBox theoretical concept only), JNI introduction (reason for using native code), Introduction to Servlets(advantages of servlets - web architecture of 2-tire, n-tire), CGI concept. Introduction to JSP, usages of JSP 5hrs Lab Exercises: There shall be lab for all topics except 7(b).

257 CS Computer Project IV (2 Cr.)

Year II
Teaching Schedule Theory Tutorial Practical 1 3

Semester II
Examination Scheme Internal Assessment Final Theory Practical* Theory Practical** 40 60 Total 100

*Continuous **Duration: 3 hours

Objective:
After finishing this project; students will be able to develop application software using oracle as back-end.

Contents:
A total 60 lab hours covering all features of oracle will be assigned to every student. Every group consisting of three students will be assigned a project work related to developing application software using oracle.

Even though as mentioned above, the project includes D2K and oracle, project work can be conducted using any front-end tool and oracle as back-end database