You are on page 1of 8

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.              


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

Guide to Linking LANs. 4. VLSM. DNS. 5. Basic network commands and network management and troubleshooting Static Routing and Dynamic routing (RIP and OSPF) Firewall. 1997.. An Engineering Approach to Computer Networking. Ethernet twisted pair cabling Workgroup network and file sharing over Static IP. F. broadcasting. EIGRP. Network layer [12]  Network layer design issues  IP based networks (IP V4 addressing and classification. New Delhi. flooding. Keiser. HDLC. Leaky bucket algorithm. IP Subnetting and VLSM Lab: 1. link state)  GSM Cellular network and Mobile-IP  Congestion control and prevention. OSPF. Tanenbaum. Ed. Local Area Networks. CIDR. Derfler. Volume 1. A. ACL. Rose. Prentice Hall of India. Mobile routing schemes  Network layer protocols. Prentice Hall East. 6. IGRP. Dynamic IP (DHCP). BGP 6. Fifth Edition. D. ATM Internetworking. and NAT [6] [12] Reference: 1. 4. S. Token bucket algorithm  Internetworking Tunneling and routing. 5. Supernetting and route aggregation. Econ. 1990. multicasting. IP V6 Introduction)  Concept of Routing (Static and dynamic routing)  Routing algorithm (Shortest path. McGraw-Hill International Ed. HTML. Jr. Computer Networks. G. Data and Computer Communications.E. HTTP. 1995. distance vector. III Ed. 2. 7. RIP. Internetworking with TCP/IP. 1997. SLIP. FTP. PKI  Secret algorithms  Firewalls and UTM  Upper layer Services: DHCP. Third Edition. 2. William Stallings.   Error control (detection and correction) Sliding window protocol Data link protocols. A Practical Perspective on OSI Prentice Hall. PPP 5. and APIPA. Comer. IP. . flow based. ICMP. Transport layer  Transport layer design issues  Service primitives  Connection oriented and connectionless networks  Transport layer protocols TCP and UDP  TCP crash recovery 7. 3. Keshav. IGMP. 3. IS-IS. Addison-Wesley Longman. The Open Book. Subnetting. Email. Marshall T. Prentice Hall of India. Application layer  Network security issues  Authentication Authorization and Accounting  Cryptography and encryption. WWW  SNMP Tutorial: 1.

) 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. handling critical section problems : Mutual Exclusion with Busy Waiting. Process Control Block Introduction to threads. (4 hrs. Critical Sections.) 2.) 6.) 4. Memory management Memory management without swapping Swapping Virtual memory Page replacement algorithm Predicting page faults Segmentation with paging (10 hrs. Race Condition.) 8. Contents: 1. History of operating system. semaphores. Operating system structures. Process states. Processes and Threads (10 hrs. and  Provide students with sufficient understanding of operating system design and how it impacts application systems design and performance. Case study: a) b) c) UNIX MS-DOS NT .BCA252 CS Operating Systems (3 Cr.) 5. Files systems Files Directories File system implementation Protection mechanism and operating system securities (8 hrs.) Introduction Process Model.  Help students become competent in recognizing operating systems features and issues. Deadlocks Resources Condition of deadlocks Deadlock modeling Ostrich algorithm Deadlock detection and recovery Deadlock avoidance & prevention (5 hrs. Parallel processing. Kernel and user implementation of Threads Inter-process communication (Multiprocessing. Input/ Output Principles of input output hardware Principles of input output software Disk and disk scheduling Clocks Terminals (8 hrs. Introduction Definition Components of Computer System Operating system as an extended machine & resource manager. Monitors etc) Process scheduling 3. Operating system concepts.

(Unix. "Modern Operating System". Tanenbaum. 5 edition. Linux. Addison Wesley. There shall be a minimum of fifteen lab exercises covering various features of different O. "Operating System Concepts". PHI.(No classes are allotted to the case study. the students themselves referring various books should study this unit). .S. Andrew S. th Silbersatz and Galvin. Windows) Textbook: 1. DOS. 2.

1.Square Distribution: Introduction. A Basic Course In Statistics: B. Relation Between Mean. Cooke. test of Independence of attributes. compilation of administrative records. Agrawal. -7 11. students are expected to be able to (i) assemble data (ii) analyse data (iii) determine central tendency. Histogram. Inverse probability. Nature And Scope Of Statistics: Definitions of Statistics. Large sample Test. Interval Estimation of population parameters. distribution and make viable conclusions for decision-making. Fitting poission distribution. The Median. Estimation Theory & Testing of Hypothesis: Idea of sample & population. Standard Deviation. -6 8. Test of significance For difference between two proportions. Pictogram. sampling of attribute. The Range. Measures Of Dispersion: Absolute And Relative Measures. Various methods of calculating correlation coefficient. Poisson Distribution And Its Chief Features (Without Proof). Inter Quartile Range. Median And Mode. Probability Distribution. Statistics For Management: Levin. Binomial Distribution And Its Chief features (Without Proofs). Types of’ Graphic Representations. Methods of data collection: census method. Classical. Data And Its Collection: Primary And Secondary Data. Test of significance for difference between two means. Frequency Curve. B. -7 9. Geometric mean. Reference: 1. Area under Normal distribution.BCA253 HS Statistics and Probability Theory (3 Cr.) Basic Statistics. Prentice Hall Of India. -2 3. Bar Diagram. point estimation & Internal Estimation. -3 5. -2 2. test of significance For single proportion. Application. Mean Deviation. Types Of Diagrammatic Representations. characteristics of a good-estimator. axiomatic approaches of probability theory. Correlation And Regression Analysis: Introduction. -3 10. Kurtosis. L. Hyper-geometric distribution. Cumulative frequency Curve (Ogive). Qualitative And Quantitative Classification.K. Probability: Preliminaries. Test of significance for Single mean. Correlation Analysis. 2. Limitations And Distrusts Of Statistics. M. empirical. Pie Diagram. The Mode. New Delhi. small sample test. 3. Harmonic mean. -4 6. sampling distribution & standard error. Chi . Classification And Tabulation Of Data: Classification Procedure. Measures Of Central Tendency: Arithmetic Mean. Test of Goodness of fit. Wiley Eastern Elements Of Statistical Reasoning: Minimum And Clarke: Johnwiley And Sons. Clarke And D. Elbs (U. Sampling of variables. Quartiles. sample method. Scope Of Statistics.) 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. Regression Analysis. Coefficient Of Variation. conditional probability. Frequency Polygon. Normal distribution & its chief features. Diagrammatic And Graphic Presentation Of Data: Importance And Limitations. Tabulation Of Data. -2 4. Deciles And Percentiles. Fitting A Binomial Distribution. Quartile Deviation. student's tdistribution & its applications. -5 Text Book: Statistical Method For Research Workers: Sukhminder Singh Et Al: Kalyani Publisher. Descriptive And Inferential Statistics. Theoretical Distribution: Introduction. Mathematical Expectation & Variance of Random variable. -4 7. 4. Skewness. Sources of Primary & Secondary data. .

Ritzman. Meaning of Layout. "Production and Operation Management". Krajewski. Continuous improvement and The cost of poor quality Improving quality through TQM A case study of Cranston Nissan 6. Layout types 7. Adam Jr. Process Management  Major process decision: Process choice. Fbert. Nature and concept of Operation management:            Meaning of operation management Differences and similarities between manufacturing and services. Location and Layout  Meaning and Measures of capacity. 1. capital intensity  Relationship between decisions 4. Factors affecting location decisions.BCA256 MS Technology and Operation Management (3 Cr. Capacity. Vertical integration. 1. Just in time system  Characteristic of just in time system  The KANBAN system Text Books 1. Strategy and Analysis". "Operations Management. John Wiley and Sons James B. McGraw Hill Publishing Company Everett E. Rakesh Sarin. Management of Technology  Meaning and Role of Technology  Information Technology 5.Wesley Publishing Company. "Production and Operations Management". 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. Prentice-Hall of India Pvt.) 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. Ltd. 2. . 3. Material requirement planning  Inputs to material requirement planning  Planning factors  Outputs from material requirement planning 9. S Buffa. resource flexibility. Reference Books Elwood. Operation Strategy 3. Ronald J. Addison . Forecasting     Concepts Judgment methods Casual method: Linear regression Time series methods 8. "Modern Production/Operation Management". Total Quality Management     Quality as a management philosophy Total Quality management tools: Employee involvement. Dilworth.

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

Even though as mentioned above. Contents: A total 60 lab hours covering all features of oracle will be assigned to every student. project work can be conducted using any front-end tool and oracle as back-end database . students will be able to develop application software using oracle as back-end. Every group consisting of three students will be assigned a project work related to developing application software using oracle. the project includes D2K and oracle.) 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.257 CS Computer Project – IV (2 Cr.