IT-301 E

L 3 T 1 P -

Rapid Application Development
Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs.

Unit-1: Visual Programming Environment: Concept of procedure and event oriented languages,
Integrated Development Environment for VC++ and Visual Basic, Components of Visual C++ and Visual Basic. Unit-2: Parts of Visual C++ Program: Application object, main window object, view object, document object, Document-View architecture and its advantages, dEvent oriented windows Programming, device context, Microsoft Foundation Classes- an Overview, Simple MFC application, API’s . Unit-3: Reading keystrokes, handling mouse, creating menus, toolbars, buttons, status bar prompts, dialog box, check box, radio buttons, list boxes, combo boxes, sliders, multiple documents. Unit-4: Serialization, file handling, debugging. Unit-5: DLL’s, OLE Object Technologies, Creating Internet Programs using Visual C++ and Visual Basic, Creating Active X Controls, connecting to Database (using DAO/ ADO/ RDO) using Visual Basic and Visual C++. Text Books • • • • • Microsoft Visual C++ By Steven Holzner (Pub: BPB) Visual C++ Programming, 2 nd edition by Steven Holzner(Pub: PHI) Using Visual Basic for Applications By Paul Sanna(Pub: PHI) Visual Basic Programming By Steven Holzner MSDN Help

Reference Books • • Visual C++: From the ground Up By Mucller (Pub :TMH) Programming Visual C++ by David J. Kruglinski

IT-303 E
L 3 T 1

Systems Programming &System Administration
P -

Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-1: Evolution of Components Systems Programming, Assemblers, Loaders, Linkers, Macros, Compilers. software tools, Text editors, Interpreters and program generators, Debug Monitors, Programming environment. Unit-2: Compiler: Brief overview of compilation process, Incremental compiler, Assembler: Problem statement, single phase and two phase assembler, symbol table; Loader schemes, compile and go Loader, general loader schemes, absolute loader, Subroutine linkage, Reallocating loader, Direct linkage Loader, Binders, Linking loader, overlays.

Unit-3: Macro language and macro-processor, macro instructions, features of macro facility, macro instruction arguments, conditional macro expansion, macro calls with macro instruction defining macros. Unit-4: Theoretical Concept of Unix Operating System: Basic features of operating system; File structure: CPU scheduling; Memory management: swapping, demand paging; file system: block and fragments, inodes, directory structure; User to user communication. Unit-5: Getting Started with Unix: User names and groups, logging in; Format of Unix commands; Changing your password; Characters with special meaning; Unix documentation; Files and directories; Current directory, looking at the directory contents, absolute and relative pathnames, some Unix directories and files; Looking at the file contents; File permissions; basic operation on files; changing permission modes; Standard files, standard output; Standard input, standard error; filters and pipelines; Processes; finding out about processes; Stopping background process; Unix editor vi. Unit-6: Test Manipulation: Inspecting files; File statistics; Searching for patterns; Comparing files; Operating on files; Printing files; Rearranging files; Sorting files; Splitting files; Translating characters; AWK utility. Unit-7: Shell Programming: Programming in the Borne and C-Shell; Wild cards; Simple shell programs; Shell variables; Shell programming constructs; interactive shell scripts; Advanced features. Unit-8: System Administration: Definition of system administration; Booting the system; Maintaining user accounts; File systems and special files; Backups and restoration; Role and functions of a system manager. Overview of the linux. operating system
Text Books: • Systems Programming by Donovan, TMH. • The unix programming environment by Brain Kernighen & Rob Pike, 1984, PHI & Rob Pike. • Design of the Unix operating system by Maurich Bach, 1986, PHI. • Introduction to UNIX and LINUX by John Muster, 2003, TMH. Reference Book: • Advanced Unix programmer’s Guide by Stephen Prato, BPB • Unix- Concept and applications by Sumitabha Das, 2002, T.M..H Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Students will be required to attempt five questions in all.

History of TCP/IP. Tree -. Network Topologies: Bus-. 2000. CSMA. T. • Computer Networks – A System Approach. Domain Name System. Windows NT/2000. Example networks ARPANET.IMAP. IP address classes.. Routers. Unit-3: Local Area Networks: Introduction to LANs. Frame Relay. Wide Area Networks. Class of Service. Metropolitan Area Networks. Unit–4: Wide Area Networks: Introduction of WANs.H. Unit-1: OSI Reference Model and Network Architecture: Introduction to Computer Networks. Private Networks. Services and Protocols of each layer Unit–2: TCP/IP: Introduction. Channel Access Methods. Larry L. Email – SMTP. Usage of LANs. Asynchronous Transfer Mode (ATM). Layer 2 & 3 switching. Introduction to Network Operating Systems: Client-Server infrastructure. Internet Protocol. VLANs. Low Price Edition. Token Ring. Halsall Fred. Students will be required to attempt five questions in all. International edition. Star-. HTTP. Congestion Control. • Business Data Communications. 2002. Fitzgerald Jerry. Synchronous Digital Hierarchy (SDH)/ Synchronous Optical Network (SONET). Tanenbaum Andrew S. Features of LANs. Quality of Service. Layers of TCP/IP. Traps.. Internet. Performance Management. CSMA/CD.. Complete -. IP Addressing. Text Book: • Computer Networks (3rd edition). Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Types of Networks : Local Area Networks.Wireless Links. Security management. Firewalls. 2nd Edition • Computer Networking – ED Tittel . Gateways. RARP. ICMP. Peterson & Bruce S. Computer Networks and Open Systems (4th edition). LAN interconnecting devices: Hubs. Bridges. Transmission Control Protocol . Fast Ethernet and Gigabit Ethernet. Components of LANs. POP. . LAN Standards. Irregular –Topology.M. Internet Control Protocols. Proxy Servers. WAN Technologies. User Datagram Protocol. OSI model. Reference Books: • Data Communications. Ethernet. Functions of each layer. Hybrid -. Overview of IP version 6. Token Passing. Davie. Unit-5: Introduction to Network Management: Remote Monitoring Techniques: Polling. Aloha. ARP. Application Layer. Routing. NNTP. Distributed Queue Dual Bus (DQDB). Addison Wesley. Layering architecture of networks. Protocols. Subnet Addressing. Switches.IT-305 E L 3 T 1 P - Computer Networks Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Ring-. FTP. 1996. IEEE 802 standards.

avoidance & detection. non-contiguous memory allocation paging and segmentation techniques. deadlock recovery. System programs and calls. Shortest-JobFirst (SJF). TMH. Shell interpreter. N. Windows NT file system. Multilevel Queue Scheduling. 1998. multi user. TMH • Operating Systems By Deitel. various allocation methods. Application I/O Interface. Unit-6: I/O Systems: I/O Hardware. Network OS. Unit–2: Process Management: Process concept. Shivaratri. Introduction to distributed file system. 1990. Unit–7: Unix System And Windows NT Overview Unix system call for processes and file system management. Prentice-Hall Reference Books: • Operating System By Peterson . Real Time OS. Addison-Wesley.CSE-301 E L 3 T 1 P - Principles of Operating Systems Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. • Modern Operating Systems by A. • Operating System By Milankovic.G. Prentice-Hall. 1974.M.4th edition.Demand Paging & Page-Replacement Algorithms. directory structures. TMH. CPU scheduling. Priority Scheduling. Various Operating system services. • Operating Systems Internals and Design Principles by William Stallings. 2001. 5th edition. Unit-1: Introduction: Introduction to Operating System Concepts (including Multitasking. Distributed OS. Multithreading etc). • Operating System Incorporating With Unix & Windows By Colin Ritche. virtual memory management . Windows NT architecture overview. Unit–4: File System: Different types of files and their access methods. swapping. segmentation with paging. T. Transforming I/O requests. scheduling criteria. Performance Issues. process scheduling. semaphores. 2003. Unit–3: Memory Management: Logical & Physical Address Space. scheduling algorithms -First Come First Serve (FCFS). operation on processes. Round Robin(RR). • Operating Systems by Mandrik & Donovan. 1990. Unit–5: Process-Synchronization & Deadlocks: Critical Section Problems. Time-sharing systems. methods for handling deadlocks-deadlock prevention. • Operating Systems – Advanced Concepts By Mukesh Singhal . Demand Segmentation. . Tanenbaum.. contiguous memory allocation. architecture. Students will be required to attempt five questions in all. disk scheduling and management and its associated algorithms. Types of Operating Systems: Batch operating system. 1992. Text Books: • Operating System Concepts by Silberchatz et al. AW. multiprogramming. Kernel. 1985.H Note: Eight questions will be set in all by the examiners taking at least one question from each unit. AWL.

arithmetic instructions. branch instructions. PHI. block diagram of 8086. control words. Microprocessors and interfacing : Hall. The 8088 & 8086 Microprocessors-Programming. looping instructions. pin diagram and description of various signals. programming examples.Students have to attempt any five questions. 4. shift and rotate instructions. flag manipulation instructions. 8085 microprocessor: Architecture. and assembly language programming. program relocation. modes and examples. data transfer instructions. directives and operators. Programming & Design : YuChang Liu & Glenn A Gibson. assembler instruction format. interrupt structure. PHI REFERENCE BOOKS: 1. DMA : Introduction to DMA process. Wiley Eastern Ltd.B . UNIT3. details of sub-blocks such as EU. TMH NOTE: 8 questions are to be set selecting FIVE questions from PART A and THREE questions from PART. INTERRUPT AND TIMER : 8259 Programmable interrupt controller.Hardware & Applications :Triebel & Singh. TMH 2. NOP and HLT instructions. interfacing. logical instructions. UNIT6. Microprocessor Architecture.Pentium processor : Brey.EE-309-E L T P 3 1 0 MICROPROCESSORS AND INTERFACING CLASS WORK EXAM TOTAL DURATION OF EXAM : : : : 50 100 150 3 HRS PART A UNIT1. Programmable interval timer chips. . instruction formats. INSTRUCTION SET OF 8086: Instruction execution timing. 2. Programming & Applications with 8085 : Ramesh S Gaonkar. INTERFACING DEVICE : The 8255 PPI chip: Architecture. PHI 3. The Intel Microprocessors 8086. addressing modes. memory segmentation and physical address computations. THE 8085 PROCESSOR : Introduction to microprocessor. Advanced Microprocessors and Interfacing : Badri Ram. THE 8086 MICROPROCESSOR ARCHITECTURE: Architecture. Microcomputer systems: the 8086/8088 Family: architecture. UNIT2. UNIT 5. instruction set. TEXT BOOKS : 1. 8237 DMA controller. PART B UNIT4. BIU.

Rogers. B-Spline curves. Three dimensional transformations: Three dimensional graphics concept. Foley. translation. Parametric representation of surfaces. Sutherland-cohen algorithm. Filled area algorithms: Scanline: Polygon filling algorithm. 1999. Andeies van Dam. rotation. viewports. Matrix representation of 3D Transformations. Polygon clipping algorithm: Sutherland-Hodgeman polygon clipping algorithm.4 bit code algorithm. area sub-division algorithm. image manipulation: Illumination models. 1994. types of projections. shadows. 2001. Circle drawing algorithms: Using polar coordinates. Unit-6: Illumination. Unit-4: Hidden surface removal: Introduction to hidden surface removal. scanline algorithm. reflection. Stevan K. shading.H Second Edition • Fundamentals of 3Dimensional Computer Graphics by Alan Watt.H 2002 Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Unit-1: Introduction to Computer Graphics: What is Computer Graphics. Interpolation method. clipping line (algorithms):.CSE -303 E L 3 T 1 P - Computer Graphics Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. windows. • Computer Graphics: Secrets and Solutions by Corrign John. The Z. Standard Publ. Line drawing algorithms: DDA. Bresenham’s. 1999. BPV • Introduction to Computer Graphics By N. the mathematics of planner geometric projections. Computer Graphics Applications. image processing. Composition of 3-D transformation. Computer Graphics Hardware and software. What is an image? Filtering. PHI Reference Books: • Procedural Elements for Computer Graphics – David F. Addision Wesley.M. Addision Wesley. boundary filled algorithm. Two dimensional transformations: transformations. . algorithm.buffer Unit-5: Representing Curves and Surfaces: Parametric representation of curves: Bezier curves. shading models for polygons. Two dimensional Graphics Primitives: Points and Lines. Unit-2: Two/Three Dimensional Viewing: The 2-D viewing pipeline. • Computer Graphics Secrets and solutions by Corrign John. Text Books: • Computer Graphics Principles and Practices second edition by James D.Pauline Baker. 2000. parametric line clipping algorithm (Cyrus Beck). Krishanmurthy T. Bresenham’s circle drawing. mid point circle drawing algorithm. Games & Multimedia Projects in C by Pilania & Mahendra. transparency.M. Unit-3: Viewing in 3D: Projections. T. BPB • Graphics. composite transformation. coordinate systems. Clipping: point. GUI. Hughes. Students will be required to attempt five questions in all. window to view port mapping. 2 nd Edition. Feiner and Johb F. scaling. geometric transformation of images. • Computer Graphics by Donald Hearn and M.

Make an active X control of your own using Visual Basic. 3. font size as selected by the user from different fonts contained in a list box. Appreciate how they are helpful in finding complexities of window’s programming? 2. Write a simple program that displays an appropriate message when an illegal operation is performed. 9. Create a simple database in MS access and connect it to Visual Basic using ADO or DAO. name. 7. Note: At least 10 experiments are to be performed by the students in the semester 1. 8. Study window’s API’s? Find out their relationship with MFC classes. 10. . L - T - P 2 Class Work: Exam: Total: Duration 25 25 50 of Exam: 3 Hrs. Create a simple model dialog box to read the information about a student i. Write a program to handle the mouse event right click on client area and display a message box as “Right Button Click”. 5. 6. With the help of Visual Basic. Write a simple console application to create archive class object from file class that reads and stores a simple structure (record). roll no. created an object of excel application and implement any function of it. using error handling technique in VB. Write a program that reads a text and changes its font. class using appropriate fields. Get familiar with the essential classes in a typical (document view architecture) VC program and their relationships with each other. 4.IT-307 E Rapid Application Development Lab.e.

5. 2. Write a program for circle drawing as Raster Graphics Display. Write a program for displaying 3D objects as 2D display using perspective transformation. Class Work: Exam: Total: Duration 50 50 100 of Exam: 3 Hrs. Write a program for Hidden surface removal from a 3D object. Write a program for 2D line drawing as Raster Graphics Display.CSE-309 E L T P 3 Computer Graphics Lab. . Write a program for polygon filling as Raster Graphics Display Write a program for line clipping. List of programs to be developed 1. Write a program for rotation of a 3D object about arbitrary axis. 7. 6. 4. Write a program for polygon clipping. 8. 3. Note: At least 5 to 10 more exercises to be given by the teacher concerned.

CSE-313 E L T P 2 Operating Systems Lab. AWK programming. . • • • Study of WINDOWS 2000 Operating System. basic commands pipe & filter commands). shell. Administration of WINDOWS 2000 (including DNS. Directory Services) Study of LINUX Operating System (Linux kernel.LDAP. • • • Note: At least 5 to 10 more exercises to be given by the teacher concerned. Class Work: Exam: Total: Duration 25 25 50 of Exam: 3 Hrs. Administration of LINUX Operating System. Writing of Shell Scripts (Shell programming).

Study of 8086 microprocessor kit 9. Write a program for finding square of a number using look-up table and verify.bit numbers by repeated addition method.EE-329-E L T P 0 0 2 MICROPROCESSORS AND INTERFACING LAB CLASS WORK EXAM TOTAL DURATION OF EXAM : : : : 25 25 50 3 HRS LIST OF EXPERIMENTS: 1. Write a program using 8085 for multiplication of two 8. 12. Addition of two 8-bit numbers. 3. 11. 13. 8. Write a program using 8085 for division of two 8. Write a program using 8086 for arranging an array of numbers in ascending order and verify. Study of 8085 Microprocessor kit. Finding the largest number from an array. b. 6. Write a program using 8085 for dividing two 8. 10. . 14. Addition of two 8-bit numbers (with carry). Use 8085/8086 microprocessor and 8255 PPI.bit numbers by bit rotation method and verify. 16-bit subtraction (display borrow) 4. b. Write a program using 8085 and verify for : a. Write a program using 8085 and verify for : a. 16. Check for minimum number of additions and test for typical data. 15. 5.bit numbers by repeated subtraction method and test for typical data.bit numbers by bit rotation method and test for typical data. 2. . Write a program using 8086 for finding the square root of a given number and verify. 7. Write a program using 8086 for division of a defined double word (stored in a data segment) by another double Word division and verify. Write a program using 8086 and verify for: a. Write a program to interface a two digit number using seven-segment LEDs. Finding the smallest number from an array. Write a program using 8086 for arranging an array of numbers in descending order and verify. 8-bit subtraction (display borrow) b. Write a program using 8086 for copying 12 bytes of data from source to destination and verify. Write a program using 8085 for multiplication of two 8.

17. NOTE: At least ten experiments have to be performed in the semester out of which seven experiments should be performed from above list. Write a program to control the operation of stepper motor using 8085/8086 microprocessor and 8255 PPI. Remaining three experiments may either be performed from the above list or designed & set by the concerned institution as per the scope of the syllabus of EE-309-C. .

single process.UDP). socket options elementary UDP sockets.Richard Stevens • Internet working with TCP/IP Vol-1. Students will be required to attempt five questions in all. ICMP its purpose . . concurrent servers multiprotocol servers (TCP. elementary TCP sockets. ROUTE. dynamic port mapping . Iterative. connection oriented servers (TCP). select& poll functions. analogy between RPC of client and server. Vol II Note: Eight questions will be set in all by the examiners taking at least one question from each unit. TRACERT. Doubles e-commer. TC/IP Protocol architecture. UDP and TCP/data grams . Unit-2: Socket introduction.authentication. their multiple versions and mutual exclusion communication semantics. IP datagram format. Unit-5: Network file system concept of data link access. debugging techniques .IT-302 E Network Programming L 3 T 1 P - Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. Unit-3: Algorithm and issues in server software design :iterative connectionless servers. elementary node and address conversions. • Internetworking TCP/IP Vol III Doubles E comer. RPC retransmits. address resolution Protocol (RAP) and RARP. W. Classful internet addresses. remote programs and procedures. super netting. TCP client sever. subnets. Unit-4: Remote procedure call concept (RCP) :RPC models. Unit-1: Introduction to networking. echo service (TCP and UDP). Text Books: • Unix Network programming Vol -2nd edition. Ping.UDP). NET STAT details & IPconfig. David L. multi service servers (TCP. I/O functions. FINGER.Stevens Reference Book: • Internetworking with TCP/IP.Routing sockets. (UDP). broadcasting to mobile network.

Architectural Design: Software architecture. Behavioral Modeling. refinement. software testing fundamentals: objectives. control flow model. Roger S. Design concepts: Abstraction. Unit-7: Computer Aided software Engineering: CASE. Students will be required to attempt five questions in all. control hierarchy. Mapping requirements into a software architecture. 1991 Narosa. partitioning Software. .CSE-302 E L 3 T 1 P - Principles of Software Engineering Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. the debugging process debugging approaches. • An Integrated Approach to software engineering by Pankaj jalote . defect amplification and removal. Other classical analysis methods. Data Design: Data modeling.M. Functional modeling and information flow: Data flow diagrams. Analyzing alternative Architectural Designs . Prototyping methods and tools. staffing level estimation.restructuring. 1996. Software Testing Strategies: Verification and validation. Unit-4: System Design: Design concepts and principles: the design process: Design and software quality. information hiding. Text Book: • Software Engineering – A Practitioner’s Approach. forward engineering. system modeling and simulation Analysis principles modeling. The design model. Formal approaches to SQA. software life cycle models. Software crisis. COCOMO. Ali Behforooz and Frederick J. formal technical reviews: The review meeting. software architecture. data flow model. project scheduling and tracking. MGH. software reliability: Measures of reliability and availability . data structure. software procedure. alpha and beta testing. The data dictionary. Reference Books: • Fundamentals of software Engineering. Effective modular design: Functional independence. 2002. staffing. prototyping: .A Heuristic estimation techniques.architectural complexity. The mechanics of structured analysis: Creating entity/ relationship diagram. Unit-2 : Software project management:Project management concepts. • Software Engineering – David Gustafson. Transform flow. Statistical software quality assurance. SQA activities. project size estimation metrics. AW. Transaction flow. Unit-1: Introduction: The process. 5 th edition. Unit-3 : Requirements Analysis and specification requirements engineering. repository. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. empirical estimation techniques. team structures. software products. Software re-engineering . Software Characteristics. reverse engineering . Unit testing. principles.. Design documentation. testability. 1999. Representation. performance testing. Software reviews: cost impact of software defects. integrated case environments and architecture. Applications. white box testing. Pressman.H • Software Engineering Fundamentals Oxford University. PHI • Software Engineering by Ian sommerville. Integration testing. Pearson Edu. Rajib Mall. Unit-6 : Software Reliability and Quality Assurance :Quality concepts. the software requirements specification and reviews Analysis Modeling: Data Modeling. software process and project metrics Project planning. Hudson 1995 JW&S. testing for specialized environments . Test case design. Coupling.The ISO 9000 Quality standards: The ISO approach to quality assurance systems. emergence of software engineering. review reporting and record keeping. evolving role of software. Software Configuration Management. Design Heuristics for effective modularity. basis path testing: Control structure testing: Black box testing.architectures and applications. System testing: Recovery testing. T. Software quality assurance . Unit-5 : Testing and maintenance: Software Testing Techniques. risk analysis and management. Validation testing. building blocks. Transform mapping: Refining the architectural design. modularity. project estimation Techniques. review guidelines. security testing. the control and process specification. data structures. databases and the data warehouse. Specification principles. stress testing. structural partitioning. design principles. The art of debugging. The ISO 9001 standard. Cohesion.

Baye’s probabilistic interferences and Dempster shafer theory. learning from examples. partial order planning algorithm. Temporal reasoning. Unit-3: Reasoning under uncertainty. Staurt Russel and peter norvig. Min max algorithms. Unit-4: Planning.Depth first. Expert systems. Prentice Hall.A * algorithm AO* algorithm. Addition Wesley 3rd Ed. 1995. tree. AI application to robotics.alpha beta pruning. Fuzzy reasoning.logic programming. I earning by analogy. • Artificial intelligence. TMH. Reference Books: • Artificial Intelligence. Unit-1: Foundational issues in intelligent systems: Foundation and history of AI. representation for planning. blind search strategies. and current trends in intelligent systems. Ai problems and techniques – AI programming languages. Patrick Henry Winston:. discovery as learning. . Unit-2: Knowledge representation issues. 1991.problem spaces and searches. Heuristic methods. genetic algorithms. PHI.CSE-304 E L 3 T 1 P - Intelligent Systems Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. predicate logic.. Elain Rich and Kevin Knight. 1998. Russell & Norvig. introduction to LISP and PROLOG. knowledge acquisition concepts. review of probability. planning in situational calculus.heuristic search techniques Hill climbing: best first. Unit-5: Principles of Natural language processing. rule based systems architecture. representing knowledge using rules. Students will be required to attempt five questions in all. game playing.. Note: Eight questions will be set in all by the examiners taking at least one question from each unit. symbolic reasoning under uncertainty. Text Book: • Artificial Intelligence: A Modern Approach. • Artificial Intelligence-A modern approach. explanation based learning. semantic netsframes and inheritance. rules based deduction systems. constraint propagation. neural nets. Statistical reasoning. Breadth first. Non monotonic reasoning.

semantic tags for aiding search. Dave Raggett. Delivering multimedia over web pages. Output in JavaScript.M.H • Scott Guelich. Event handling. ordered and unordered lists. Bill Kennedy. WROX press (Indian Shroff Publ. issues and web development. Cassandra Greer. Descriptive markup: Meta tags for common tasks. The standards-HTML. How the browser works-MIME types.307 E L 3 T 1 P - Web Development Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. embedding images and controlling appearance. O’Reilly Associates.M. applications. CGI Programing with Perl 2/e O’Reilly. 2000. Sebastian Schnitzenbaumer & ted Wugofski. Jenny Raggett. 1997. • Doug Tidwell. Marking up for structure and style: basic page markup. • Intranets by James D. SPD) 1 st edition • HTML & XHTML: The Definitive Guide by Chuck Musciano. Programming languages for server Side Scripting. Atul Kahate.H Note: Eight questions will be set in all by the examiners taking at least one question from each unit. Hypertext markup language: The anatomy of an HTML document. O’Reilly. The VRML idea. Unit-2: Separating style from structure with style sheets: Internal style specifications within HTML.CSE. Text books: • Beginning XHTML by Frank Boumpery. XML. . (using PERL/VBSCRIPT/JavaSCIPT) Unit-4: Other dynamic content technologies: introduction to ASP & JSP. page and site design considerations. miscellaneous topics such as cookies. Forms handling. 2000.Cimino. The Java phenomenon-applets and servelets. Unit-5: Introduction to Microsoft . XHTML and the W3C. Gunther Birzniek. 2000 • CGI Programming on the World Wide Web. Client side programming: Introduction to the JavaScript syntax. The world wide web: The idea of hypertext and hyper media. plugins and helper applications. How the web works-HTTP. Unit-1: Introduction to the Internet. hidden fields.NET Technology and its comparison with the competing Technologies. Applications. James Snell. Programming Web services. Pavel Kulchenko. • Internet and Web Technologies – Raj Kamal. 2003. Jaico Publ. Shishir Gundararam. Input/ output operations on the WWW.. Students will be required to attempt five questions in all. 4 th Edi. table creation and use. frames. T. nesting and targeting. absolute and relative links. Forms processing. Reference books: • XHTML Black Book by Steven Holzner. T. and images. External linked style specification using CSS. • Web Technologies By Achyut S Godbole . the JavaScript object model. 2002. the doubling code and RDF. Unit-3: Server side programming: Introduction to Server Side Technologies CGI/ASP/JSP. HTML and URLs. Configuring the server to support CGI.

examples of wireless comm. Cordless telephone systems. channel assignment strategies.C. UNIT 3. McGraw Hill REFERENCE BOOK: 1. Wireless Communications: Theodore S. Interference and system capacity. in-Building Communication. wireless local area networks. packet ratio. 2. Pearsons.Lee. TDMA. basic Cellular Systems. Mobile Communications: Jochen Schiller. space division multiple access. improving coverage and capacity. ELLULAR SYSTEM DESIGN FUNDAMENTALS: Frequency Reuse. FDMA. TEXT BOOKS: 1. wireless data services. CDMA cellular Radio Networks. Blue tooth and Personal Area networks. third generation wireless networks. tracking and grade off service. INTELLIGENT CELL CONCEPT AND APPLICATION: Intelligent cell concept. Pearson NOTE: Eight questions are to be set -one question from each unit. comparison of various wireless systems.Y. applications of intelligent micro-cell Systems. UNIT 6. WIRELESS NETWORKING: Difference between wireless and fixed telephone networks. UNIT 2. traffic routing in wireless networks. development of wireless networks. MODERN WIRELESS COMMUNICATION SYSTEMS: Second generation cellular networks. Operation of cellular systems. Mobile Cellular Telecommunication: W. UNIT 7. performance Criteria. analog cellular systems. common channel signaling. .EE-402-E L T P 3 1 0 WIRELESS COMMUNICATION CLASS WORK EXAM TOTAL DURATION OF EXAM : : : : 50 100 150 3 HRS UNIT 1. systems. INTRODUCTION TO WIRELESS COMMUNICATION SYSTEMS: Evolution of mobile radio communications. digital Cellular Systems. UNIT 4. capacity of a cellular systems. advanced intelligent networks. UNIT 5. paging systems. wireless in local loop. fixed network transmission hierarchy. Rappaport. handoff Strategies. INTRODUCTION TO CELLULAR MOBILE SYSTEMS: Spectrum Allocation. MULTIPLE ACCESS TECHNIQUES FOR WIRELESS COMMUNICATION: Introduction to Multiple Access. Spread Spectrum multiple Access. ISDN (Integrated Services digital Networks). Students have to attempt any five question.

various types of digital filters. UNIT2. frequency domain representation. UNIT3. BASICS OF DIGITAL FILTERS : Fundamentals of digital filtering. representation of sequences by Fourier transform. Digital Signal Processing: Salivahanan. UNIT5. time invariant system. bi-linear transformation and backward difference methods for IIR filter design. properties of the Z-transform. Applications of DSP. applications of Z-transform. finite impulse Response (FIR) system. properties of Fourier transform. energy and power theorems. digital filter banks. design techniques of digital filters : window technique for least one from each unit. DISCRETE-TIME SIGNALS: Signal classifications. Digital Signal Processing: Alon V. infinite impulse response (IIR) system. Z-TRANSFORM : Introduction. UNIT6. application. properties. multistage decimator and interpolators. properties of the region of convergence. filter structures. reconstruction of band limited signal from its samples. Students have to attempt five questions. inversion of the Z-transform. time domain representation. TEXT BOOKS : 1. TMH NOTE: Eight questions are to be set . sampling rate conversion. DISCRETE-TIME SYSTEMS : Classification.TMH REFERENCE BOOKS: 1. Vallavaraj and Gnanapriya. PHI 2. analysis of finite word length effects in DSP. Oppenhelm. frequency domain representation of sampling. discrete time random signals.EE-407-E DIGITAL SIGNAL PROCESSING L T P 3 1 0 CLASS WORK EXAM TOTAL DURATION OF EXAM : : : : 50 100 150 3 HRS UNIT1. discrete time processing of continuous time signals. . UNIT4. Digital Signal Processing : Proakis and Manolakis. Digital Signal processing(II-Edition): Mitra. DSP algorithm implementation consideration. MULTIRATE DIGITAL SIGNAL PROCESSING: Introduction to multirate digital signal processing. SAMPLING OF TIME SIGNALS: Sampling theorem. changing the sampling rate using discrete time processing.PHI 2.

IT-304 E L T P 2 Network Programming Lab. to Make An FTP Client Note: At least 5 to 10 more exercises to be given by the teacher concerned. 2. 4. to Obtain The Local & Remote Socket Address. . 3. to Write A Telnet Client. to Create Sockets For Handling Multiple Connection to Obtain The Information About The (A) Host (B) Network (C) Protocols to Manipulate The IP Address. Write a program 7. Write a program to Create Sockets For Sending And Receiving Data. Write a program 6. Socket programming. Write a program Write a program Write a program Write a program (D) Domains 5. Class Work: Exam: Total: Duration 25 25 50 of Exam: 3 Hrs. The socket programming can be done on Unix/Linux operating or/and Windows. and the language can be C/VC++ and/or Java 1.

Study of PROLOG. Solve any problem using best first search. Solve traveling salesman problem. 3. 2. Note: At least 5 to 10 more exercises to be given by the teacher concerned. 6. 4. 1. Solve 8-puzzle problem using best first search Solve Robot (traversal) problem using means End Analysis. L - T - P 2 Class Work: Exam: Total: Duration 25 25 50 of Exam: 3 Hrs. . Write the following programs using PROLOG. 5. 7. Solve any problem using depth first search. Write a program to solve 8 queens problem.CSE-306 E Intelligent System Lab.

Bailey . TMH.Delhi . Duane A. and data structures such as arrays . T.CSE-311 E L T P 2 Web Development & Core JAVA Lab.M. Bailey. structures and functions. Class Work: Exam: Total: Duration 25 25 50 of Exam: 3 Hrs. Java programs for creating Applets for display of Images .Texts and Animation Programs related to interfaces & packages Input output & Random files programs in java Java programs using Event driven concept Programs related to Network Programming Development of Web site for the college or newspaper agency. 2000. Duane W. Java programs using classes & objects and various control constructs such as loops etc . Books recommended for Lab. N. • Java Elements – Principles of Programming in Java .H • The Java Handbook by Patrick Naughton.