12.07.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.Tech. (Info. Tech.) V-VI Sem.


5IT1 COMPUTER ARCHITECTURE (Common to Comp. Engg. & Info. Tech) Class: V Sem. B.Tech. Branch: I.T. Schedule per Week Lectures: 3, Tutorial: 1 Units Contents of the subject Introduction to Computer Architecture and Organization. Von Neuman Architecture, Flynn Classification. Register Transfer and Micro operations: Register transfer language, Arithmetic Micro-operations, Logic Micro-operations, Shift Micro-operations, Bus and memory transfers. Computer Organization and Design: Instruction cycle, computer registers, common bus system, computer instructions, addressing modes, design of a basic computer Central Processing Unit: General register organization, stack organization, Instruction formats, Data transfer and manipulation, program control. RISC, CISC characteristics. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)]




IV V References:

Pipeline and Vector processing: Pipeline structure, speedup, efficiency, throughput and bottlenecks. Arithmetic pipeline and Instruction pipeline. Computer Arithmetic: Adder, Ripple carry Adder, carry look Ahead Adder, Multiplication: Add and Shift, Array multiplier and Booth Multiplier, Division: restoring and Non-restoring Techniques. Floating Point Arithmetic: Floating point representation, Add, Subtract, Multiplication, Division. Memory Organization: RAM, ROM, Memory Hierarchy, Organization, Associative memory, Cache memory, and Virtual memory: Paging and Segmentation. Input-Output Organization: Input-Output Interface, Modes of Transfer, Priority Interrupt, DMA, IOP processor.

1. Computer Organization and Architecture - William Stallings (Pearson Education Asia) 2. Computer Organization and Architecture -John P. Hayes (McGraw -Hill) 3. Computer Organization -V. Carl. Hamacher (McGraw-Hill)

12.07.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.Tech. (Info. Tech.) V-VI Sem. 2010-11

5IT2 Digital Signal Processing ( Info. Tech.) Class: V Sem. B.Tech. Branch: I.T. Schedule per Week Lectures: 3 Units Contents of the subject I Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)]


INTRODUCTION: Discrete time signals and systems, properties of discrete time systems, Linear time invariant systems - discrete time. Properties of LTI systems and their block diagrams. Convolution, Discrete time systems described by difference equations. Fourier Transform: Discrete time Fourier transform for periodic and aperiodic signals. Properties of DTFT. Z-transform: The region of convergence for the Ztransform. The Inverse Z-transform. Properties of Z transform. SAMPLING: Mathematical theory of sampling. Sampling theorem. Ideal & Practical sampling. Interpolation technique for the reconstruction of a signal from its samples. Aliasing. Sampling in freq. domain. Sampling of discrete time signals. THE DISCRETE FOURIER TRANSFORMS (DFT): Properties of the DFT, Linear Convolution using DFT. Efficient computation of the DFT: Decimation– in-Time and Decimation-in frequency FFT Algorithms. FILTER DESIGN TECHNIQUES: Structures for discrete-time systems- Block diagram and signal flow graph representation of LCCD (LCCD – Linear Constant Coefficient Difference) equations, Basic structures for IIR and FIR systems, Transposed forms. Introduction to filter Design: Butterworth & Chebyshev. IIR filter design by impulse invariance & Bilinear transformation. Design of FIR filters by Windowing: Rectangular, Hamming & Kaiser.




References: 1. Oppenheim, Discrete-Time Signal Processing, 2/e, Pearson Education 2. Proakis, Digital Signal Processing, 4/e, Pearson Education 3. S.K.Mitra, Digital Signal Processing, 2/e, Tata McGraw Hill

12.07.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.Tech. (Info. Tech.) V-VI Sem. 2010-11

5IT3 TELECOMMUNICATION FUNDAMENTALS (Common to Comp. Engg. & Info. Tech)
Class: V Sem. B.Tech. Evaluation

Branch: I.T. Examination Time = Three (3) Hours Schedule per Week Maximum Marks = 100 Lectures: 3 [Mid-term (20) & End-term (80)] I Data Transmission: Terminology, Frequency, spectrum, bandwidth, analog and digital transmission, Transmission impairments, channel capacity including sampling theorem and Fourier series. Transmission Media: Transmission of signals through Twisted pair, Coaxial cable, optical fibre (SM, MM, Graded Index). Wireless Transmission: Antenna and antenna gain, introduction to terrestrial and satellite microwave, Propagation of wireless signals, free space loss for LOS communication. Review of Line Encoding Schemes. Concept of bit period, effect of clock skew, Synchronous and Asynchronous communication Network Reference Models (OSI/ISO and TCP/IP) II Data Link Layer: Functions performed by data link layer, Data link Layer design issues Error Control Coding: Error Detection, Two Dimensional Parity Checks, Internet Checksum. Polynomial Codes, Standardized polynomial codes, error detecting capability of a polynomial codes. Linear codes, performance of linear codes, error detection & correction using linear codes. Flow Control: Flow control in loss less and lossy channels using stop-and-wait, sliding window protocols. Performance of protocols used for flow control. III Data Link Control: HDLC & PPP including frame structures, MAC sublayer: Pure and slotted Aloha, CSMA, CSMA/CD, collision free multiple access. Throughput analysis of pure and slotted Aloha, delay & throughput analysis of CSMA and CSMA/CD IV Multiplexing: Frequency division, time division (Synchronous and statistical) multiplexing. ADSL, DS1 and DS3 carriers. Multiple Accesses: Performance of FDMAFM-FDMA, Single channel per carrier. TDMA frame structure, TDMA Burst Structure, TDMA Frame efficiency, TDMA Superframe structure, Frame acquisition and synchronization, Slip rate and in digital terrestrial networks. Switching: Qualitative description of Space division, time division and space-time-space division switching. V Spread Spectrum Techniques :Direct sequence(DSSS) & frequency hopping(FHSS); Performance consideration in DSSS & FHSS; Code division Multiple access (CDMA) :frequency & channel specifications, forward & reverse CDMA channel, pseudo noise(PN) sequences, m-sequence, gold sequence, orthogonal code, gold sequences, Walsh codes synchronization, power control, handoff ,capacity of CDMA system , IMT2000, WCDM References: 1. Stallings, Data and computer communication, 8th ed. Pearson 2. Tri.T.Ha, Digital Satellite Communications, 2/e, Tata McGraw Hill 3. Alberto Leon-Garcia, Indra Widjaja, COMMUNICATION NETWORKS, 2nd ed., TMH 4. Wireless communications,2/e, Rappaport, PHI 5. Analysis of Computer and Communication Networks, ISBN: 0387744363, Fayez Gebali, 2008, Springer-Verlag, 1st Ed.

Tuple Relational Calculus. Null Values. SQL-Clauses. Relationship and Relationship Sets. Bitmap Indices. Schedule per Week Lectures: 3 Tech) Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Units Contents of the subject Introduction: Introduction Applications. [1] Database Failure and Recovery: Database Failures.) V-VI Sem. Attributes and Entity Sets.12. Transaction properties. Design issues. Purpose.07. Comparison of Ordered Indexing and Hashing. [1] Algebra: Relational Algebra: Operations: Selection. DDL. Transaction Manager. File System v/s DBMS. Domain Relational Calculus. View Serializability. B. Weak Entity Set. Timestamp-based protocols. Projection. Tech. Third Normal Form. [2] Schema Refinement And Normal Forms: Introductions to Schema Refinement. case study of an Enterprise. Class: V Sem.Single Row Function.Tech. Recovery Schemes: Shadow Paging and Log-based Recovery. Relational calculus. Embedded SQL. Concurrent Executions. Extended Features. Recovery with Concurrent transactions. Recoverable Schedules. Static Hashing. B+ -Tree Index Files. Engg. Validation-based protocols. Deadlock handling. Functional Dependencies. Normalization-Decomposition into BCNF Decomposition into 3-NF. Joints. Triggers. Set Operations. SQL Functions. Renaming. Multigroup Functions. Aggregate Operators. Integrity Constraints. B-Tree Index Files. [2] Transaction Processing: Introduction-Transaction State. Dynamic SQL. Data Models Introduction-Network Model. Structure of a DBMS-Query Processor. Division. Branch: I. [1] I II III IV V References: . DCL and DML. [1] Hashing: Indexing and Hashing Basic Concepts. Cascadeless Schedules. & Info.Tech. Denormalization. Ordered Indices. [2] Concurrency Control: Implementation of Concurrency: Lock-based protocols. Data Dictionary. Nested Queries.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Set. Participation Constraints (Mapping Cardinalities). Conflict vs. (Info. Multiple Key Access. Database Users and Administrator. Entity Relationship Model and Object Oriented Model. Storage Manager. [2] Query Languages: Procedural and Non Procedural. Relational Model. Testing for Serializability. Data Abstraction (views). Index Definition in SQL.T. Entities. 2010-11 5IT4 DATABASE MANAGEMENT SYSTEMS (Common to Comp. Dynamic Hashing.Aggregation. Hierarchical Model. Boyce-Codd Normal Forms. Key Constraints. Generalization and Specialization. Need of Serializability. [1] Model: Entity Relationship Model Structure of RDMS and Database Schema.

Navathe: Fundamentals of Database Systems. C.B. Addison Wesley. Tech.J. Date: Data Base Design. (Info. H. Ramakrishnan and Gehrke: Database Management System.07. Hansen and Hansen : DBM and Design. McGraw Hill 2. 5.12.) V-VI Sem. Almasri and S.Tech. 3. Korth and Silberschatz: Database Systems Concepts. PHI . McGraw Hill 4. 2010-11 Text/References: 1.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.f.

overview of file system in Linux & windows. Input/Output subsystems. multilevel queue scheduling. resource types.concepts.processes versus threads. LRU.) V-VI Sem. memory mapped files.preemptive and non-preemptive. methods for deadlock handling. pure segmentation and segmentation with paging scheme hardware support and implementation details. memory protection and sharing. models. (Info. Branch: I. memory allocation schemes. page size. TSL instructions.FCFS. context switching.T.approximation clock. threading. C-scan schedule. TLB ( translation look aside buffer) reach. busy waiting. distance string. long-term.BIOS. shared libraries. design issues for paging system.12. I/O interlock. benefits. CPU scheduler. types. hierarchical/tree. disk structure & operation. demand paging. process implementation. hierarchy. working set model. deadlock characterization. semaphore.short. disk scheduling algorithm. functions. operations. pre-paging.bitmap. disk attachment. acyclic graph. multilevel feedback queue scheduling. virtual address space. deadlock avoidance. deadlock problem. Peterson’s solution. process control block. shared pages. MemoryVirtual Memory concept. degree of multiprogramming.disabling interrupts. Free space management. communicationInterprocess communication Introduction to message passing. dispatcher. SSTF. memory fragmentation. Firmware. CPU and I/O bound. termination. scheduling:. page fault handling. functions/goals. input/output devices. file organization & access(Sequential. strict alteration.block and character. B. logical and physical address space. static & dynamic linking. separate instruction and data spaces. classical IPC problems. shortest remaining time. loading. file sharing.Tech. OS services. second chance. LRU. FIFO. next fit. worst fit. thread usage.Tech. SystemFile System concepts. BIOS. creation. 2010-11 5IT5 OPERATING SYSTEMS (Common to Comp.07. Type of OS. page replacement algorithms. medium. Threads.FCFS. System Calls/Monitor Calls. deadlock detection.Index Sequential) methods.Linux & Windows. two level. paging scheme. naming. & Info. program structure. Fair share scheduling. monitors. Round robin. directory operations. inverted page table. Race condition. mutual exclusion with busy waiting. attributes. buddy’s system. Boot Strap Loader. critical section problem. Tech) Class: V Sem. directory structuresone level. DeadlockDeadlock System model. Static and Dynamic Priority.optimal. Basic idea of MM in Linux & windows. Criteria/Goals/Performance Metrics. disk storage capacity. schedulingProcess scheduling Basic concepts. lock variables. scheduling algorithms. Tech. deadlock prevention.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] II III IV V Text/Reference Books: . operating system as resource manager and virtual machine. cleaning policy. classification. multithreading models. managementMemory management concepts. Direct .local versus global allocation policies.creating a load module. structure. Basic System calls. file system mounting. Process managementProcess management Process model. concepts. static & dynamic loading. load control. layered architecture/logical structure of operating system. scan scheduling. recovery from deadlock. relocation and address translation. best fit. Belady’s anomaly. WS clock. Schedule per Week Lectures: 3 Units I Contents of the subject Introduction and need of operating system. Priority scheduling. address binding. swapping. general graph.first fit. path name. sleep and wakeup calls. NRU. page fault frequency. thrashing. Co-operative & Non-cooperative. kernel & user level threads. Engg. link list/free list. SJFS. states & transitions. quick fit. spooling.

A.12. Ltd. Silberschatz and Peter B Galvin: Operating System Principals. Prentice Hall. Tata McGraw Hill 5.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. . 4. Charles Crowly: Operating System A Design – Oriented Approach. Tata McGraw Hill. Tata McGraw Hill 3. Wiley India Pvt.Tech. Achyut S Godbole: Operating Systems. Tanenbaum: Modern Operating System. 2010-11 1.07. (Info. DM Dhamdhere: Operating Systems – A Concepts Based Approach. Tech.) V-VI Sem. 2.

Operations on Weight Balanced Trees (Huffman Trees). NUMBER THEORITIC ALGORITHM: Number theoretic notions. Implementing Binomial Heaps and its Operations. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] II V References: 1. 2-3-4. GCD.07. Ford-Fulkerson Max Flow Algorithms. III GRAPH THEORY ALGORITHMS: Algorithms for Connectedness. primality Testing and Integer Factorization. Prentice Hall of India.V .1 ADVANCED DATA STRUCTURE (Common to Comp. Dictionaries. Chinese Remainder Theorem.12. & Info. Tech.Vertices Planer and Dual graphs. Finding all Spanning Trees in a Weighted Graph. Cut-sets. B.T. Spanning Trees. Aho A. Modular arithmetic. . Leiserson. 2010-11 5IT6. (Info. Implementing Fibonacci Heap. J. Tech) Class: V Sem. SORTING NETWORK: Comparison network. IV Priority Queues and Concatenable Queues using 2-3 Trees. Schedule per Week Lectures: 3 Units I Contents of the subject ADVANCED TREES: Definitions. Operations on Disjoint sets and its union-find problem. Trees and 2-3-4 Heaps. GRAPH THEORY DEFINITIONS: Definitions of Isomorphic Components. Solving Modular Linear equation. Cormen. Implementing Sets. Engg. Amortization analysis and Potential Function of Fibonacci Heap. Addison Wesley 4. MERGEABLE HEAPS: Mergeable Heap Operations. 2-3 Trees and Red. Horowitz and Sahani: Fundamental of Computer algorithms. 3. power of an element. Fundamental Circuits. Interval Tree. Branch: I. Cut. Division theorem. Circuits. Topological Sort. Dynamic Order Statistics. PHI. recursion. Computation of Discrete Logarithms. Kuratovski's two Graphs.D Ulman: Design and analysis of Algorithms. Rivest: Introduction to Algorithms. 2.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Binomial Trees.Tech.Black Trees. Single Min-Cut Max-Flow theorem of Network Flows. bitonic sorting and merging network sorter. zero-one principle.Tech. Strongly Connected Components and Articulation Point. Breadth First and Depth First Search. Brassard : Fundamental of Algorithmics.) V-VI Sem.

Digital Token based Electronics payment System. Mobile Commerce: Introduction to Mobile Commerce. . Tech. 2.12.T. (Info. Transaction security. and Consumer to Business Electronic Commerce. Architectural framework. Market forces behind I Way. Online Banking. Forces behind E-Commerce Industry Framework. Legal requirement in E – Commerce. Secret Key Encryption. Mobile Information Devices. Encryption. The Business of e-commerce: Paul May. Wireless Application Protocols. Implementation Management Issues. EDI Application in Business. Component of I way Access Equipment. 2010-11 5IT6. Cambridge University Press. Emerging financial Instruments. Jaico book. Paul A Murphy. Encryption: World Wide Web & Security. Smart Cards. WAP Technology. B. Credit Card I Debit Card based EPS.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Public Key Encryption. Virtual Private Network (VPM). issues in Customer Relationship Management. Tech. Electronic Payments: Overview of Electronics payments. Network Infrastructure for E-Commerce Network Infrastructure for ECommerce. firewalls & Network Security. CRM.Tech. Brief history of Ecommerce. Inter Organizational E-Commerce Intra Organizational ECommerce. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III IV V References: 1. Emerging Client Server Security Threats.07. Net Commerce: EDA. Global Information Distribution Network. Branch: I. Introduction to supply Chain Management.Tech. 2 E-Commerce (Info. Home Banking. Web Security.) V-VI Sem. Mobile Computing Application. Firewalls & Transaction Security. Electronic e-commerce II Edition: Pete Loshin. Client Server Network. Introduction to Web security. Schedule per Week Lectures: 3 Units Contents of the subject Introduction: Motivation.) Class: V Sem. Broad band Telecommunication.

Magic Tees. Modulation. Geostationary orbit.Ha. Simon Haykin. 2/e.) Class: V Sem.) V-VI Sem. Rectangular cavity and circular cavity resonators. TEM mode of propagation. Directional couplers. . (Info. effects of orbital inclination.07. Broadband Wireless 802. B.Tech. Waveguide corners. Branch: I. Communication Systems.T. low-noise amplifier. Microwave Devices and Circuits. 3/e. down converter. Power transmission and Power losses. monitoring and control. Liao. Tri. Earth Station: Antenna. field patterns.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Multiple access techniques. Coverage angle and slant range.12. Satellite Link: basic link analysis. Waveguide Tees. Circulators and isolators. Digital Satellite Communications. 2010-11 5IT6. Azimuth and elevation. Hybrid rings. Bends and twists. Satellite orbit and description. Rectangular Waveguides. Transmission and multiplexing. reliability.16 Elements of satellite communication: Frequency bands. Tech. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III IV V References: 1. Schedule per Week Lectures: 3 Units Contents of the subject WAVE GUIDES: Introduction of Microwaves and their applications. Solution of Wave equation in TE and TM modes.T. WAVEGUIDE COMPONENTS : Scattering matrix representation of networks. highpower amplifier.orbital period and velocity. Tech.Tech. Satellite description: Communications subsystems. up converter. Tata McGraw Hill 3. John Wiley.3 SATELLITE & MICROWAVE COMMUNICATION (Info. circular waveguides : Basic idea of TE and TM modes. Excitation of modes in Rectangular waveguides. Pearson Education 2.

the students should have clearly understood and implemented the following: 1.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Preparing ER diagram 3. 5. Visual FoxPro or any similar database having both the database and manipulation language may be used.12. Engg. Finding the data fields to be used in the database. it is expected that each students will chose one problem. . normalization and finally manipulation of the database including generation of reports. However.: 3 Evaluation Examination Time = Four (4) Hours Maximum Marks = 100 [Sessional/Mid-term (60) & End-term (40)] Objectives: At the end of the semester.Net. Installing and configuring the database server and the front end tools. 2010-11 5IT7 DATABASE LAB (Common to Comp. 4. any other database may also be used. Java. Student information system for your college.) V-VI Sem. For multi-user application. In order to achieve the above objectives. transaction roll back. VB. The implementation shall being with the statement of the objectives to be achieved. Normalizing the dependencies.07. Branch: I. 8. 2. One exercise may be assigned on creation of table. 7.Tech. views etc. Designing database and writing applications for manipulation of data for a stand alone and shared data base including concepts like concurrency control. & Info. designing of database. B. manipulation of data and report generation using SQL. For front end. Tech) Class: V Sem. logging. The problem may first be implemented for a standalone system to be used by a single user. Selecting fields for keys. Tech. All the above steps may then be followed for development of a database application to be used by multiple users in a client server environment with access control. The application shall NOT use web techniques. database including analysis of functional 6. preparing ER diagram. Suggested Tools: For standalone environment.Tech. Stating a database design problem. report generation etc. (Info. MYSql is suggested. VB Script or any other convenient but currently used by industry may be chosen.T. Get acquainted with SQL. Schedule per Week Practical Hrs. Indicative List of exercises: 1.

3. 6.07.) V-VI Sem. 4. Guarantee management system for the equipments in your college. Inventory management system for your college. Student grievance registration and redressal system.Tech. 5.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. A video library management system for a shop. (Info. 2010-11 2.12. . Tech. Inventory management system for a hardware/ sanitary item shop.

3.Tech. (Info. guide wavelength. power. Tech) Class: V Sem. 8. B. 2. Measurement of frequency. No. (Info. Schedule per Week Practical Hrs : 2 Evaluation Examination Time = Four (4) Hours Maximum Marks = 75 [Sessional/Mid-term (45) & End-term (30)] S. 9. (b) Measurement of power division and isolation characteristics of a microstrip 3 dB power divider. 6. 2010-11 5IT8 ADVANCE COMMUNICATION LAB. 5. 1.07. 10. VSWR and attenuation in a microwave test bench Measurement of directivity and gain of antennas: Standard dipole (or printed dipole). 4.Tech. List of Experiments TDM of two band limited signals. Branch: I. Determination of coupling and isolation characteristics of a stripline (or microstrip) directional coupler (a) Measurement of resonance characteristics of a microstrip ring resonator and determination of dielectric constant of the substrate.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. ASK and FSK generation and detection PSK generation and detection DPSK generation and detection QPSK generation and detection PCM generation and detection using a CODEC Chip Measurement of losses in a given optical fiber ( propagation loss. 11 . 7.) V-VI Sem.12. Tech. bending loss) and numerical aperture Analog and Digital (with TDM) communication link using optical fiber.T. microstrip patch antenna and Yagi antenna (printed).

MOSS preferably on Linux platform. 2010-11 5IT9 OPERATING SYSTEMS SIMULATION LAB (Common to Comp. Recommended Excercises: A.12.T. Tech. B.Tech.Tech. . The simulation results such as average latency. Develop aptitude for carrying out research in the area of operating system. Tech) Class: V Sem. (Info. B. One exercise shall be on simulation of algorithms reported in the recent conferences/ journals and reproducing the results reported therein. Following modules of the simulator may be used: Scheduling Deadlock Memory Management Systems File system simulator Algorithms described in the text may be assigned. hit & Miss Ratios or other performance parameters may be computed.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Schedule per Week Practical Hrs : 3 Evaluation Examination Time = Four (4) Hours Maximum Marks = 100 [Sessional/Mid-term (60) & End-term (40)] Objectives: Understand the basic functions of operating systems.) V-VI Sem. Engg. & Info. In depth knowledge of the algorithms used for implementing the tasks performed by the operating systems. Suggested Tools: Operating system simulator. Exercises shall be given on simulation of algorithms used for the tasks performed by the operating systems. Understand & simulate strategies used in Linux & Windows operating systems. Branch: I.07.

& Info. Suggested Exercises • Create a microprocessor from ALU 74181. Schedule per Week Practical Hrs : 3 Evaluation Examination Time = Four (4) Hours Maximum Marks = 75 [Sessional/Mid-term (45) & End-term (30)] Objectives: At the end of course. Tech) Class: VI Sem. manuals of Digital IC families have to be placed in the laboratories for reference by students. Tech. Library of digital ICs have to be built.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. the students shall be able to • • • • • Should be able to design datapath for digital systems Create a digital system using discrete digital ICs Design a hard wired / micro-programmed control circuit Simulate a digital datapath in Hardware Description Language Understand IC descriptions and select proper IC in a given circuit based on its timing characteristics Suggested Methodology and tools: Hardware description language like verilog /VHDL can be used for simulation. B.Tech. The exercise shall involve design of datapath.12. (Info.) V-VI Sem. the students may design a small instruction set and attach necessary registers and suitable control unit to realize a microprocessor. Simulate & realize a Four bit Adder o Design and simulation of a 4-bit Adder o VHDL/verilog HDL (Hardware description language) o Interfacing 7-segment decoder • Combinational Multiplier o 4x4-bit multiplier o Binary-to-BCD conversion o Timing Constraints CRC checksum generator & verifier Realizing a carry look ahead adder • • • • . Engg. Simulate and realize a Cordic calculator. its simulation and finally realization on breadboard. Branch: I. For this.07. 2010-11 5IT10 DIGITAL HARDWARE DESIGN LAB (Common to Comp.T.Tech. Similarly.

4th Ed. TCP delay modeling. congestion control in Datagram subnets. timer management. Fragmentation Network layer in the Internet: IPV4. Examination Time = Three (3) Hours Schedule per Week Maximum Marks = 100 Lectures: 3 [Mid-term (20) & End-term (80)] NOTE: The first 2 lectures shall be devoted to review of the basis architectures and responsibilities of different layers. responsibilities of client and server sides. Kurose. MIME message formats. BGP. World Wide Web: Architecture. TCP Congestion Control: Fairness. Pearson.Network layer design issue. RTP. Transactional TCP. B. resource record. SMTP. Crash Recovery. Channel with bit errors and Lossy Channel with bit errors. not included). congestion prevention policies. 3. connectionless internetworking. resolution process. Broadcast routing. TCP Header and segment structure. connecting networks. flooding. ELSEVIER . Transport service primitives. Computer Network..2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. OSPF. TCP connection establishment and release. 2010-11 6IT1 COMPUTER NETWORKS (Common to Comp. 2. UDP. Multiplexing. Principles of Reliable Data Transfer: Reliable data transfer over a perfectly reliable channel. TCP service Model. Computer Networking. name servers. RARP. concatenated virtual circuit. Evaluation Branch: I. load shedding. performance enhancement. ICMP. packet headers etc. exploiting heterogeneity.. IGMP. Flow control & Buffering. Query flooding. HTTP. 3rd Ed.12. connection release. Internetwork routing. Electronic Mail: Architecture and services. IMAP. I II III IV V References: 1. RPC. Transport Layer in the Internet: Introduction to TCP.Tech. (Info. DHCP(only working and purpose. Domain Name System: Name Space.) V-VI Sem. Tanenbaum. & Info. Computer Networks. Internetworking: Differences in networks.Tech. Tech. Pearson. Units Contents of the subject Network layer. routing algorithms: Optimally principle short path. Application Layer: Service needs. IP addressing including Subnet addressing CIDR. Engg. Distance vector. introduction to DNS poisoning. 4th Ed.T.. Congestion control: General principle of congestion control. Tech) Class: VI Sem. Peterson. BOOTP. transmission policy. POP3. link state. Davie. connection Establishment. NAT. Tunneling. ARP.07. hierarchical. P2P File Sharing: Centralized Directory. jitter control Quality of service: requirements and techniques. Differences in IPV6 over IPV4 Transport layer: Services provided. Elements of Transport protocols: addressing.

Tech. RANDOMIZED ALGORITHMS.V . Cook's Theorem. Monte Carlo algorithms.07. 2. GREEDY METHOD: Knapsack Problem.Satisfiability problem and Vertex Cover Problem. Problem definition of Multicommodity flow. . Branch: I. 2010-11 6IT 2 DESIGN AND ANALYSIS OF ALGORITHMS (Common to Comp. Leiserson. NP-HARD AND NP-COMPLETE: Definitions of P.12. KMP Matcher and Boyer Moore Algorithms. Tech. PATTERN MATCHING ALGORITHMS: Naïve and Rabin Karp string matching algorithms.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. II III IV V References: 1. B. I DIVIDE AND CONQUER METHOD: Binary Search. PROBLEM CLASSES NP.) V-VI Sem. randomized algorithm for Min-Cut. Flow shop scheduling and Network capacity assignment problems. Optimal Merge Patterns and Minimal Spanning Trees. Brassard : Fundamental of Algorithmics. Horowitz and Sahani: Fundamental of Computer algorithms. Longest Common Subsequence and 0/1 Knapsack Problem.Tech. Cormen. Las Vegas algorithms. Backtracking Algorithms and queens problem. (Info. Merge Sort. Approximation Algorithms for Vertex Cover and Set Cover Problem. BRANCH AND BOUND: Traveling Salesman Problem and Lower Bound Theory.D Ulman: Design and analysis of Algorithms. Tech) Class: VI Sem. 3. & Info. Decision Problems. Job Sequencing. AddisonWesley 4. Order Notations: definitions and calculating complexity. Quick sort and strassen's matrix multiplication algorithms. Aho A. DYNAMIC PROGRAMMING: Matrix Chain Multiplication. Prentice Hall of India.T. ASSIGNMENT PROBLEMS: Formulation of Assignment and Quadratic Assignment Problem. PHI. NPHard and NP-Complete Problems. Engg. Rivest: Introduction to Algorithms. randomized algorithm for 2-SAT. Proving NPComplete Problems . J. Schedule per Week Lectures: 3 Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Units Contents of the subject BACKGROUND: Review of Algorithm Complexity.

Papadimitriou. Context Free Languages& Pushdown Automata: Context Free Grammars – Derivations and Languages – Relationship between derivation and derivation trees – ambiguity – simplification of CEG – Greiback Normal form – Chomsky normal forms – Problems related to CNF and GNF Pushdown Automata: Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata – Pushdown automata and CFL . Turing Machines: Turing machines – Computable Languages and functions – Turing Machine constructions – Storage in finite control – multiple tracks – checking of symbols – subroutines – two way infinite tape. Tutorial:1 Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Units Contents of the subject Finite Automata & Regular Expression: Basic Concepts of finite state system.07. Introduction to Computer Theory.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Undecidability: Properties of recursive and Recursively enumerable languages – Universal Turing Machines as an undecidable problem – Universal Languages – Rice’s Theorems. Deterministic and non-deterministic finite automation and designing regular expressions. Cohen. Tech) Class: VI Sem. Branch: I. closure proportion of regular sets. Engg. decision Algorithms for regular sets.pumping lemma for CFL Applications of pumping Lemma. Formal Languages and Computation. Introduction to Theory of Computing.Tech.12. Basic Definition & descriptions of Theory & Organization of Linear bounded Automata Properties of context-sensitive languages I II III IV V References 1. (Info. Linear bounded Automata Context Sensitive Language: Chomsky Hierarchy of Languages and automata. Myhell_Nerod Theory & Organization of Finite Automata. & Info. B. Prentice Hall. Pumping lemma for regular sets. relationship between regular expression & Finite automata minimization of finite automation mealy & Moore Machines. Introduction to Automata Theory. Schedule per Week Lectures: 3. Addison Wesley.) V-VI Sem. 3.Tech. 2010-11 6IT3 THEORY OF COMPUTATION (Common to Comp. . Regular Sets of Regular Grammars: Basic Definition of Formal Language and Grammars. Aho. Tech. Narosa 2. Hopcropt and Ullman. Regular Sets and Regular Grammars.T.

EXCEPTION HANDLING: Exception handling fundamentals. the assignment operators. special string operations. string Buffer class. concept of CLASSPATH. access modifiers. relational operators. searching and comparing strings. Joseph O'Neil and Herb Schildt: Teach Yourself JAVA. Using continue. do-while. usage of super. Decision and control statements. Defining and Starting a Thread. STRING HANDLING: String constructors. CONTROL STATEMENTS: Java’s Selection Statements.07. Deitel: How to Program JAVA. Wheeler Publishing. Using break. switch statement. Tech. Arithmetic operators. B.The Complete Reference. Access Control. Overloading and overriding methods. Iteration Statements. constructors. Delhi. catch and multiple catch statements. while. for-each. arithmetic. Engg. III IV V References 1. File I/O. importing package. Abstraction. 2010-11 6IT4 PROGRAMMING IN JAVA (Common to Comp. Java Virtual machine. Features of JAVA. TMH. Jump Statements. Nested Loops. . Defining and implementing interfaces.K.12. Interrupts. Delhi. using paint method and drawing polygons. Synchronization. APPLET: Applet Fundamentals. I PROGRAM ELEMENTS: Primitive data types. variables. 4. Dastidar: Software and Systems – An Introduction. (Info. Usage of throw. if statement. Exception types. II OBJECTS AND CLASSES: Objects. Nested and inner classes. U. short circuit logical operators.G. Schedule per Week Lectures: 3 Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Units Contents of the subject JAVA: Introduction to Object Orientated Programming.Tech. Single and Multilevel Inheritance. operator precedence. PHI 3. Branch: I. Object Oriented Programming Principles. Thread Objects.) V-VI Sem. Boolean logic operators. PACKAGE AND INTERFACES: Defining package. arrays. Tech) Class: VI Sem. Abstract classes. try. character extraction. Chakraborty and D.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.T. Delhi 2. Herbert Schildt: JAVA 2 . Introduction to Java byte code. Extended classes. Joins. for. throws and finally FILE HANDLING: I/O streams. return. TMH. Pausing Execution with Sleep.Tech. Using final with inheritance. uncaught exceptions. returning and passing objects as parameter. assignment. CONCURRENCY: Processes and Threads. bit wise operators. & Info.

Information measures for continuous random variables. Source coding schemes for data compaction: Prefix code. coding & decoding of linear block code. Digital Communication. Channel coding theorem. source coding theorem. Shannon limit.07. Tech. Cyclic Code: Code Algebra.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Maximum likelihood decoding of convolutional code: The viterbi Algorithm fee distance of a convolutional code. Schedule per Week Lectures: 3 Units Contents of the subject Introduction to information theory. parity check polynomial. Convolutional Code: Convolutional encoders of different rates. Simon Haykin. Mutual information. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III IV V References 1.12. Code Tree. Uncertainty.T. . Huffman code. Encoder & decoder for cyclic codes. (Info. Branch: I. conversion of non systematic form of matrices into systematic form. Discrete Memory less channels. Trllis and state diagram. B. Shanon-Fane code & Hempel-Ziv coding channel capacity. Tech) Class: VI Sem.Tech. Linear Block Code: Introduction to error connecting codes. minimum distance consideration.) V-VI Sem. generating cyclic code by generating polynomial. 2010-11 6IT5 INFORMATION THEORY & CODING (Info. Conditional entropy. Information and Entropy.Tech. Basic properties of Galois fields (GF) polynomial operations over Galois fields.

mailboxes. signal handling. Introduction to threading issues. bad block. Implementation–buffering and delivery. Design Principles. boot block. virtual file system. Linux threads.Hardware Abstraction layer. System Security: Security Problems. 2010-11 6IT6. process management and thread. File System structure & implementation. Network File System. An overview of. Program Threats. Overview of security in Windows. Process Scheduling in Linux. POSIX subsystem. [4] The Linux OS: Unix Vs Linux. Schedule per Week Lectures: 3 Tech) Units Contents of the subject Operating system structures – policies & mechanism. Implementing Security Defenses. II system: I/O system device drivers/ controllers.USB. Memory Management.1 ADVANCE TOPICS IN OPERATING SYSTEMS (Common to Comp.Tech. thread pool. SystemFile System. components Kernel Modules.[3] The Window OS: Design Principles. contagious allocation. indexed allocation. Structures. thread specific data. Booting and login process. Computer Security Classifications. System Network Threats. Windows.monolithic. & Info. disk caching and buffering. Branch: I. virtual machines.server model. IDE. Kernel. B. (Info. Thread Management and Scheduling.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.Tech. Examples from Linux & Windows. system calls. RAID Structure. win32 threads.12. Examples Systems – Linux. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I III IV V . Exception and Interrupts. I/O Management. Tech. Java threads. Class: VI Sem. Process Scheduling in Windows.T. client. Inter-process Communications.linear list and hash table. busses and interfaces. synchronization. RAID system. security. naming.usage. exokernels. Massage Passing System – Need of Message Passing Systems. Firewalling to Protect Systems and Network. OS organizations.) V-VI Sem. FAT and NTFS. recovery. Volume Management and Fault Tolerance.MS-DOS Environment. RPC & RMI. types. link list allocation. Executives. Concepts– Threads Advance Concepts Libraries. file allocation table. Environmental Subsystems. design issues. window registry. User Authentication.Pthreads.07. Security features. Cryptography as a Security Tool. directory implementation. micro kernel. Engg.Process Management. Solaris Threads. 16-bit Windows Environment. file system implementation. swap-space management. disk management-disk formatting. Kernel Structure. File Systems: Internal Layout. IEEE1394. Shell. Win32 API. window threads. SCSI.file system layouts. An overview of-memory management.[3] Multiprocessor Operating Systems: Architecture of Multiprocessor Systems. cancellation. layered. System Components. File System reliability and integrity.

2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.Queued Lock.Tech. Multimedia file storage mechanisms. Spin Lock. A. 5.concepts. JAVA card. Sleep Lock.) V-VI Sem. 2010-11 Overview of Multiprocessor OS. Process Scheduling. Process management. Multos. Tata McGraw Hill 2. Kernal Structure and Multiprocessing support in Linux & Windows. Operating SystemMultimedia Operating System. Charles Crowly: Operating System A Design – Oriented Approach. Bach. Multimedia file systems. 6. Tata McGraw Hill 3. . Tata McGraw Hill. common graphics file formats. Process Synchronization.real time scheduling. common audio file formats. Wiley India Pvt. Achyut S Godbole: Operating Systems.07. (Info. Palm OS. Tanenbaum: Modern Operating System.Introduction to Multimedia & Data Compression.12. Design of Unix Operating Systems. DM Dhamdhere: Operating Systems – A Concepts Based Approach. Tech. Text/Reference Books: 1. Prentice Hall 4. Video sever organization. Symbian OS. Video server. Silberschatz and Peter B Galvin: Operating System Principals. Ltd.[2] SystemMobile Operating System Windows CE.

Tech. preservation and improvement of industrial micro-organisms for overproduction of primary and secondary metabolites. aromatics etc. Antibiotics-beta-lactams (penicillins.). microbial growth kinetics. amylases. Medium formulation.Tech. Vitamins and steroids.3. Energy flow in biological systems.12. (Info. Batch and continuous heat sterilisation of liquid media.2 BIO INFORMATICS (Info. itaconic acid. Reactive and non-reactive processes. Raw materials for fermentation process: Isolation. Bryan Bergerson.).). amino acids (glutamic acid.07. Equations of state. processes products and market economics relating to modern industrial biotechnology. acetic acid. Energetic of metabolic path ways. Coupled reactions. aspartic acid. quinines. Oxygen consumption and heat evolution in aerobic cultures. nitrogen.Tech. Bioinformatics Computing. minerals. Bioremediation. Thermodynamic efficiency of growth. cellulases. butanediol etc. V Production of commercially important enzymes and recombinant proteins: Proteases. macrolides (erythromycin). Requirements for process utilities (compressed air. Role of a bio-process engineer in the biotechnology industry. 2010-11 6IT6. cephalosporins etc. Material and energy balances for downstream processing and waste water treatment processes. Medium requirements for fermentation process carbon.) V-VI Sem. cooling water. Thermodynamic properties of pure substances.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.) and alcohols (ethanol 2. Correlations for physical and transport properties. Yield and maintenance coefficients. lysine. phenylalanine etc. Schedule per Week Lectures: 3 Units Contents of the subject Principles of mass and energy conservation. kanamycin etc. .T. Production of primary metabolites: A brief outline of processes for the production of some commercially important organic acids (e. lactic acid.). Tech) Class: VI Sem. lipases.g. Production of recombinant poteins having therapeutic and diagnostic applications.) Production of secondary metabolites: Study of production processes for various classes of low molecular weight secondary metabolites. isomerases and other commercially important enzymes for the food and pharmaceutical industries. Outline of the various unit operations involved in an integrated bio-process. Process calculations for design of typical industrial fermentation processes. Pearson Education. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III IV References 1. A brief survey of organisms. Introduction to industrial bio-process: A historical overview of industrial fermentation processes and products. citric acid. gluconic acid etc. steam etc. aminoglycosides (streptomycin. B. Process flow sheeting. Design of a an industrial fermented. Examples of simple and complex media. pectinases. Production of vaccines. vitamins and other nutrients. Introduction to fermentation. Branch: I. Material and energy balances for steady state processes involving single and multiphase systems. Stoichiometry and energetic analysis of cell growth and product formation.

David W. Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Ewens & Gregory R. Bioinformatics: Sequence and Genome Analysis. Mount. 2010-11 2. (Info. Francis Ouellette.07. Cold Spring Harbor Laboratory 4. F. Wiley Interscience . Warren J. Tech. Grant. Statistical Methods in Bioinformatics. Second Edition (Adaptive Computation and Machine Learning).) V-VI Sem. Bioinformatics: The Machine Learning Approach.12. Baxevanis & B.Tech. MIT Press 3. Andreas D. Springer Verlag 5. Pierre Baldi.

HCI patterns. B. physical and device models. group working. Schedule per Week Lectures: 3 Units Contents of the subject The Human: input-output channels.07. task decomposition. elements of WIMP interfaces. Pearson . standards. Task Analysis: Differences between task analysis and other techniques.T. rules and heuristics. psychology and the design of interactive systems. approaches. ER based analysis. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III IV V References: 1. Evaluation Techniques: Definition and goals of evaluation. Communications and collaborations models: Face to Face communication. ergonomics. Alan Dix et. cognitive architectures. Usability Engineering Design rules: Principles to support usability. evaluation through expert analysis and user participation. interactivity. knowledge based analysis. use of task analysis.12.Tech. iteration & prototyping. navigation design screen design and layout. pointing and drawing. designing user support systems Cognitive methods: Goals and task hierarchies. challenges of display based systems. conversations. Tech. Branch: I. Tech) Class: VI Sem. User support.al.) V-VI Sem. Paradigms for Interaction. Engg.. The Interaction: Models of interaction. sources of information and data collection.Tech. adaptive help systems.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. requirement. linguistic models. emotions. interaction styles. engagement and fun. Design Process: The process of design. experience. user focus. (Info. Human memory. Human Computer Interaction. individual differences. & Info. 3rd ed. scenarios. The Computer: Text entry devices with focus on the design of key boards. Text based communication. 2010-11 6IT6. thinking. positioning. display devices.3 HUMAN COMPUTER INTERFACE (Common to Comp. choosing an evaluation method. guidelines.

special string operations.) V-VI Sem. 2.g. 3. such as application for electricity department. Development of a project to demonstrate various file handling concepts.07. final with inheritance Overloading and overriding methods. Write Object Oriented programs in Java: Objects. uncaught exceptions. File I/O. Joins.: 3 Evaluation Examination Time = Five (4) Hours Maximum Marks = 100 [Sessional/Mid-term (60) & End-term (40)] Objectives: At the end of the semester. arrays. 3. concept of CLASSPATH. B. Thread Objects. payroll system etc. matrix arithmetic. 4. variables. Develop applications involving file handling I/O streams. Classes constructors. such as complex arithmetic. operators. Programs to demonstrate basic concepts e. access modifiers. Development of programs/projects to demonstrate concepts like inheritance. using paint method and drawing polygons. Abstract classes. Development of a project to demonstrate various applet concepts. Defining and implementing interfaces. Schedule per Week Practical Hrs. Using continue. 5. . the students should have clearly understood and implemented the following: 1. try. constructors. and Synchronization. Branch: I. control & iteration statements. Develop an in depth understanding of programming in Java: data types. interfaces etc. operators. switch statement. handling: 6. It is expected that each laboratory assignments to given to the students with an aim to In order to achieve the above objectives Indicative List of exercises: 1. packages.12. Using break. Tech) Class: VI Sem. Exception types. operator precedence. 4. (Info. Extended classes. Defining and Starting a Thread. 2010-11 6IT7 JAVA PROGRAMMING LAB (Info. Pausing Execution with Sleep. classes. Iteration Statements. Develop understanding to developing packages & Interfaces in Java: Package. Tech. Decision and control statements. Access Control. tower of Hanoi problem etc. importing package. 2. catch and multiple catch statements. Inheritance. Using super. Exception handling fundamentals. searching and comparing strings. recursion etc. Jump Statements. Usage of throw. returning and passing objects as parameter. Develop understanding to developing Strings and exception handling: String constructors.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. ticket reservation system. Develop applications involving concurrency: Processes and Threads. library management.Tech. Interrupts. exception handling. throws and finally. character extraction. string Buffer class.Tech.T. Develop applications involving Applet: Applet Fundamentals. return. 7.

Queries (filtering and ordering) Printing and Print Preview I. I. 1. 6. Tech. Database-style reports II Common Dialog interface 8.Tech. (Info. and the CDC class II. Event Handling III. 7.12. I.) V-VI Sem.07. Interacting with the user II. DAO II.T. edit fields. Completion Database Classes 5. (Info. Responding to events from different control types Implementing View class functions I. Drawing shapes IV. Branch: I. No. Schedule per Week Practical Hrs : 3 Evaluation Examination Time = Four (4) Hours Maximum Marks = 100 [Sessional/Mid-term (60) & End-term (40)] S. and the CDC class (Text. ODBC vs. 2.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. . Tech) Class: VI Sem. Databases and Record sets III. Bitmaps ) Implementing View class functions 4. 3.Tech. Drawing shapes. List of Experiments Adding buttons. Bitmaps Implementing Dialog Block class Creating a Dialog box Invoking and displaying Setting and retrieving values from a dialog box Implementing Dialog Boxes. GDI Functions. and other child-window components Implement the CObject debugging ability and Common MFC problems Implement GDI Functions. 2010-11 6IT8 GUI DESIGN LAB. B. Text III.

copy the two files at $USER/CSC/2007 directory. 3. file. cd. words and characters in its input(do not use wc). & Info. Shell Programming: Shell script exercises based on following (i) Interactive shell scripts (ii) Positional parameters (iii) Arithmetic (iv) ifthen-fi. 12. Commands related to inode. for loops. touch. . until.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. mkdir. dfspace. cut. (ii) Printing Column list of files in your home directory (iii) Listing your job with below normal priority (iv) Continue running your job after logging out. Write a shell script to print end of a Glossary file in reverse order using Array. Engg. Follow the instructions (i) Input a page profile to yourself. Write a shell script to compute gcd lcm & of two numbers.07. use of break (viii) Metacharacters (ix) System administration: disk management and daily administration Write a shell script to create a file in $USER /class/batch directory. 7. B. Write a shell script to change data format . Tech. rmdir. Take a large number such as 15 digits or higher and use a proper algorithm. Write a shell script to find whether a given number is prime. du. (ii) Start printing file at certain line (iii) Print all the difference between two file. 5. 8. 1. 10. List of Experiments Use of Basic Unix Shell Commands: ls. 2010-11 6IT9 SHELL PROGRAMMING LAB (Common to Comp. ulimit. dd. Schedule per Week Practical Hrs : 2 Evaluation Examination Time = Four (4) Hours Maximum Marks = 50 [Sessional/Mid-term (30) & End-term (20)] S. cat. wc. case structure (vii) while. Tech) Class: VI Sem. 9. 6. (Use awk tail) Write a shell script to check whether Ram logged in.Tech. Use the basic function to find gcd & lcm of N numbers. (Info. Write a shell script to count lines. Continue checking further after every 30 seconds till success. nested if-else (v) Logical operators (vi) else + if equals elif. Write shell script for(i) Showing the count of users logged in.T. grep. 2. Branch: I. process control commands. banner. mails. if-then-else-fi. 11. 4. sort. I/O redirection and piping. (iv) Print lines matching certain word pattern. No. copy it into other existing file.12.Show the time taken in execution of this script Write a shell script to print files names in a directory showing date of creation & serial number of the file.Tech.) V-VI Sem.

2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Wood .07.) V-VI Sem. By Stephen G. Patrick H.Tech. Tech. 2010-11 Ref: UNIX Shell programming. (Info.12. Kochan.

storing m and n elements respectively. Every node u also stores height of the subtree rooted at it. You have to perform a sequence of the following online operations : 1. Every element of tree T is smaller than every element of tree T'. Analyze the complexities of various problems in different domains. Tech. You have to determine whether the kth largest element of the heap is greater than x or not. Your algorithm must take O(k) time.x) which adds x to the entry A[i]. Schedule per Week Practical Hrs : 3 Engg. Using this extra information how can you merge the two trees in time O(log m + log n) (preserving both the height balance and the order)? 3.) V-VI Sem. It is expected that teachers will assign algorithms to the students for estimation of time & space complexity. Class: VI Sem. Tech) Objectives: Upon successful completion of this course.12. (Info.Tech. For example. You are given a positive integer k < n and a number x.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. students should be able to: • • • Prove the correctness and analyze the running time of the basic algorithms for those classic problems in various domains.T. Complete binary tree as an efficient data-structure: You are given an array of size n (n being a power of two). 2010-11 6IT10 DESIGN AND ANALYSIS OF ALGORITHMS (Common to Comp. Apply the algorithms and design techniques to solve problems. B. Evaluation Examination Time = Four (4) Hours Maximum Marks = 100 [Sessional/Mid-term (60) & End-term (40)] Suggested Tools: For implementation and estimation of running time on various sizes of input(s) or output(s) as the case may be. & Info. analysis and implementation for transposing a sparse matrix requiring not more than one pass from the original matrix may be assigned. Algorithms reported in various research journals may be chosen by the teachers. Merging two search trees: You are given two height balanced binary search trees T and T'. Problem on designing algorithms to meet complexity constraints may be assigned. C. Exploring a Binary Heap: Consider a binary heap containing n numbers (the root stores the greatest number). . B. a problem on design. A guide to such problems is given below: 1. 2. Suggested Exercises: A. (i) Add(i. All the entries of the array are initialized to zero. You may use O(k) extra storage. Linux platform is suggested.Tech. Branch: I.07.

Give an O(|E|) time algorithm to count all the paths from u to v.wk. b... If there is no such path then your algorithm must report that "no such path exists". (ii) Report sum(i.. 5. S and D are two disjoint subsets of the set of vertices. where edges have nonnegative weights. Give an O(|V| log |V| + |E|) time algorithm to find the shortest path among the set of paths possible from any node in S to any node in D. Computing a spanning tree having smallest value of largest edge weight: Describe an efficient algorithm that.E).12. given an undirected graph G. 2010-11 2. From a subset of vertices to another subset of vertices a. b. the root storing the smallest element. Shortest Path Problems: i. Counting the number of paths Given two nodes u. Paths in Directed Acyclic Graph a. It can be seen easily that we can perform the first operation in O(1) time whereas the second operation may cost O(n) in worst case.. Your objective is to perform these operations efficiently. Path passing through a subset of nodes Given two nodes u.. You have to walk to your friend and the total distance traveled by . 6. 7. Suggest a valid potential function so that the amortized cost of insertion is O( log n) whereas amortized cost of deleting the smallest element is O( 1).v in a directed acyclic graph G(V. w2. Give an O(|E|) time algorithm to output a path(if exists) from u to v which passes through each of the nodes w1.E). Delete-min in constant time !!! Consider a binary heap of size n .. Searching for a friend: You are standing at a crossing from where there emerge four roads extending to infinity. Show how to implement a queue with two ordinary stacks so that the amortized cost of each Enqueue and each Dequeue operation is O(1).) V-VI Sem. Give a datastructure which will guarantee O(log n) time per operation. Given a directed graph G(V. determines a spanning tree of G whose largest edge weight is minimum over all spanning trees of G. Implementing a queue by two stack c.E). Your friend is somewhere on one of the four roads.. We know that the cost of insertion of an element in the heap is O( log n) and the cost of deleting the smallest element is also O( log n). Tech.07. Problems on Amortized Analysis a.Tech.v and a set of vertices w1. (Info.j) = sum of the entries in the array from indices i to j for any 0 < i < j <= n.wk in a directed acyclic graph G(V. ii. 4.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.. You do not know on which road he is and how far he is from you.

Tech. How fast can you locate the first one in the array? 11. Find the celebrity by asking only O(n) questions. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. You can ask questions of the form Does Mr.) V-VI Sem. Finding the first one: You are given an array of infinite length containing zeros followed by ones. you should traverse O(d) distance. where d is the distance of your friend from you. 9. Y ?. Some of the feet may be connected to other feet. 2010-11 you must be at most a constant times the actual distance of your friend from you. The list either terminates at null pointer or it loops back to some .12. Searching for the Celebrity: Celebrity is a person whom everybody knows but he knows nobody. There are total n persons in the party. 13.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Give an O(n) time algorithm to determine if the given array has a decimal dominant. A simple problem on sorted array: Design an O(n)-time algorithm that. given a real number x and a sorted array S of n numbers. Design an algorithm that decides whether a given adjacency matrix represents a scorpion by examining only O(n) entries. 8. determines whether or not there exist two elements in S whose sum is exactly x .07. You have gone to a party. Checking the Scorpion: An n-vertex graph is a scorpion if it has a vertex of degree 1(the sting) connected to a vertex of degree two (the tail) connected to a vertex of degree n-2 (the body) connected to the other n-3 (the feet). In terminology of algorithms. Endless list: You are having a pointer to the head of singly linked list. X know Mr. 12. You will get a binary answer for each such question asked. Your job is to find the celebrity in the party.Tech. Finding the decimal dominant in linear time: You are given n real numbers in an array. 10. (Info.

You have to determine whether the list loops back or ends at a null location in time proportional to the length of the list.Tech.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. (Info. Your objective is to preprocess the tree in O(n) time to get a data structure of size O(n) so that you can answer any such query in O(log n) time. You can use at most a constant amount of extra storage. . You receive a series of online queries: "Give nearest common ancestor of u.07.) V-VI Sem. 2010-11 previous location(not necessarily to the head of the list). v ".12. Tech. Nearest Common Ancestor: Given a rooted tree of size n. 14.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.