BTECH 6TH SEMESTER COMPUTER SCIENCE ENGG SYLLABUS KURUKSHETRA UNIVERSITY

BTECH 6TH SEMESTER COMPUTER SCIENCE ENGG SYLLABUS KURUKSHETRA UNIVERSITY

*Departmental Elective:1.
CSE-320 Digital Signal Processing


2.
CSE-321 Multimedia Technique


3.
CSE-322 Graph Theory & Combinations


4.
CSE-323 Logic of Programming


5.CSE-324 Advanced Database Systems


6.CSE-325 Parallel Computing


CSE-324 Advanced Database Systems


L T P Theory : 100 Marks


3 2 - Sessional : 50 Marks


Unit 1.


Parallel & Distributed Databases


Architecture for parallel databases, Parallel query evaluation. parallel individual operations. parallel query optimization Introduction to distributed databases. distributed DBMS architectures. storing data in a distributed DBMS. distributed catalog management, distributed query processing. updating distributed data. introduction to distributed transactions. distributed concurrency control. recovery.


Unit 2.


Data Mining


Introduction, counting co-occurrences, mining for rules, tree structured rules. clustering, similarity search over sequences.


Unit 3.


Object Database Systems


User defined ADT. structured types. objects & reference types. inheritance. design for an ORDBMS. challenges in implementing an ORDBMS. ORDBMS. comparison of RDBMS with OODBMS & ORDBMS.


Unit 4.


Advanced Topics


Advanced transaction processing. integrated access to multiple data source. mobile databases main memory databases. multimedia databases. GIS. temporal & sequence databases.


Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students arc required to attempt five questions selecting at least one question from each unit


BOOKS


1. R. Ramakrishnan & J. Gehrks Database Management Systems: MGH.


International Ed. 2000.


2.Korth. Silberschatz. Sudcrshan: Data Base concepts. MGH. 2001.


3. C.I. Date. Database Systems:. 7th Ed.. Addison Wesley. Pearson Education.


2000.


Mobile Computing


CSE-302


L T P Theory : 100 Marks


4 2 - Sessional : 50 Marks


Unit 1.


Introduction: Challenges in mobile computing. coping with uncertainties. Resource poorness, bandwidth, etc. Cellular architecture. co-channel interference. Frequency


r


euse, capacity increase by cell splitting. Evolution of mobile system: CDMA.


FDMA, TDMA,GSM


Mobility Management: Cellular architecture. Co-channel interference. Mobility: handoff. types ofhandoffs; location management. HLR-VLR scheme. Hierarchical scheme. Predictive location management schemes. Mobile IP. cellular IP.


Unit 2.


Publishing & Accessing Data in Air: Pull and push based data delivery models. data dissemination by broadcast, broadcast disks. Directory service in air. Energy efficient indexing scheme for push based data delivery.


File System Support for Mobility: Distributed file sharing for mobility support. Coda and other storage manager for mobility support


Unit 3.


Ad-hoc Network Routing Protocols: Ad hoc network routing protocols. destination sequenced distance vector algorithm. cluster based gateway switch routing. global state routing. Fish-eye state routing. Dynamic source routing, ad hoc on-demand routing, location aided routing. zonal routing algorithm.


Unit 4. .


Mobile Transaction and Commerce: Models for mobile transaction. Kangaroo al1d Joey transactions, team transaction. Recovery model for mobile: transactions. Electronic payment and protocols for mobile commerce.


Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit


Books


1. Mobility: Processes. Computers. and Agcnts. Dejan Milojicic. I-'rederick Douglis.


Richard Wheeler, Addison- Wesley Protess,ional; I st edition (April 19. 1999).


2. Ivan Stojmenovic' (Editor). Handbook of Wireles5 Networks and Mobile


Computing . Wiley, ISBN: 0-471-41902-8. February 2002 .


3. Yi-Bing Lin & Imrich Chlamtac. "Wireless and Mobile Networks Architectures".


John Wiley & Sons. 2001.


4. Raj Pandya. "Mobile and Personal Communication systems and services".


Prentice Hall of India. 200 I.


CSE-304 Computer Hardware Technology


L T P Theory : 100 Marks


4 1 - Sessional : 25 Marks


Unit 1.


Memory


Memory, memory chips. & Modules, memory types, advanced memory technologies. Troubleshooting memory.


Power Supply


Power supply function and operation, power supply quality an&-: specification, power protection and back up. backup power system: UPS; troubleshooting power supply.


Unit 2.


Motherboard


PC family tree, motherboard controllers and system resources. input-output ports. IRQ, I/O bus system: ISA. MCA, EISA. VESA local bus. PCI. AGP. PCIX; 011 board


I/O devices, ROMBIOS, ROM POST. CMOS setup.


Unit 3


Interfaces and I/O Ports


Floppy disk interface:IDE interface: ATA standards, master-slave configuration. data transfer mode: SCSI interface: SCSI bus. SCSI standards: which is better SCSI or IDE: serial ports. parallel ports. USB. Video adapters. Troubleshooting video adapters.


Unit 4.


Device drives and peripherals


Floppy disk drive, hard disk drive, CD ROM drive, DVD ROM drive. Record able drives, keyboards, mice, printers and monitors, tro~lble-shootil1g drives and peripherals.


Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit


BOOKS


1.


Craig Zacker & .John Rourtrc: PC Hardware- The complete reference


2.


Mark Minosi: The complete PC Upgrade & Maintenance Guide


publications.


3.


S.K. Chauhan: PC Upgrading. Maintenance and troubleshooting guide


Network Management and Security (CSE-306)


L T P Theory: 100 Marks


4 1 - Sessional: 50 Marks


Unit 1.


Introduction: need and basic goals for computer security. Security threats etc. Cryptographic building blocks: symmetric and asymmetric key cryptograph). Cryptographic hash functions, digital signature schemes etc. With representative applications for each.


Unit 2.


Operating System Security: low-level protection mechanisms, access control: models for access control. some confidentiality, integrity, and hybrid models of access control such as Bell-La Padula. Biba. Chinese Wall etc. Discretionary v/s mandatory access control.


Case Studies: Java access control policy specifications, SELinux security model


and implementation. Program flaws: bugs which have security implications such as buffer overflows, race conditions etc.


Unit 3.


Malicious code: viruses, Worms, Trojan horses: how they work and how to defend against them.


Network Security: problems in network security; kinds of attacks. PKI. Key exchange protocols, example protocols such as PGP. Kerberos, IPSECIVPN. SSL. S/MIME etc.


Unit 4.


Protocol vulnerabilities: examples or protocol vulnerabilities such as in TCP/IP. Denial of service attacks, etc.


Tools for network security such as firewalls and intrusion detection systems.


Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit


Books


Michael E. Whitman & Herbert J. Mattord. Principles of Information Security.


Vikash Publishing House Pvt. Ltd., New Delhi.


William Stalling "Cryptography and Network Security" Pearson Education.


Charcls P. Pfleegcr "Security in Computing" Prentice Hall.


Jeff Crume "Inside Internet Security" Addison Wesley.


CSE-308 Software Engineering


L T P Theory : 100 Marks


4 1 - Sessional : 25 Marks


Unit 1.Software and Software engineering- Software characteristics, software crisis, software engineering paradigm.


Planning a software project-software cost estimation, project scheduling. Personal planning. Team structure.


Unit 2 Software configuration management. quality assurance. project monitoring. risk management.Software requirement analysis- structured analysis, object oriented analysis and data modeling. software requirement specification, validation,


Unit 3.Design and implementation of software - software design fundamentals. design methodology (structured design and object oriented design). design verification, monitoring and control coding.


Software reliability: metric and specification. fault avoidance and tolerance. exception handling, defensive programming.


Unit 4.Testing - Testing fundamentals. white box and black box testing software testing software testing strategies: unit testing. integration testing. validation testing. system testing. debugging.


Software Maintenance -- maintenance characteristics. maintainability. maintenance tasks. maintenance side effects.CASE tools.


Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit.


Books:


1. Pressman S.Rogcr, Software Engineering. 'Tata McGraw-Hill


2, Jalote Pankaj, An integrated approach to software engineering .Narosa Publishing


House


3. Sommerville Ian. Software Engineering. 5th ed., Addison Wesley-2000


4. Fairley Richard, Software. Software Engineering Concepts. Tata Mcgraw-Hill


CSE-312 Computer Hardware & Troubleshooting (Pr.)


L T P Practical : 50 Marks


- - 3 Sessional : 50 Marks


I. To solder and de-solder various components.


2. To check and measure various supply voltages of Pc.


3. To make comparative study of motherboards: 386,486, PI. PII. PIII.


4. To observe and study various cables, connections and parts used in computer


Communication.


5. To study various cards used in a system viz. display card, LA1'rbrd etc.


6. To remove, study and replace Floppy disk drive.


7. To remove, study and replace hard disk.


8. To remove, study and replace CD ROM drive.


9. To study monitor, its circuitry and various presets and some elementary fault


Detection.


10. To study printer assembly and elementary fault detection of DMP and laser


Printers.


11.To observe various cables and connectors used in networking.


12.To study pa!1S of keyboard and mouse.


13.To assemble a Pc.


14.Troubleshooting exercises related to various components of computer like


monitor. drives, memory, and printers etc.


BOOKS


1.


Mark Mines Complete PC upgrade & maintenance guide, BPB publications.


2.


Craig Zacker & John Rouske, PC Hard ware: The Complete Reference. TMH.


3.


Scott Mueller, Upgrading and Repairing PCs, PHI, 1999


CSE-314 Mobile Computing (Pr.)


L T P Practical : 50 Marks


- - 3 Sessional : 50 Marks


1. Design a prototype that implements the Cache management for a mobile


computing environment?


2. Design a System: The challenges or developing high performance. high reliability. and high quality software systems arc too much for ad hoc and informal engineering techniques that might have worked in the past on less demanding systems. New techniques for managing these growing complexities are required to meet today's time-to-market. productivity and quality demands.


3. Peer-to-peer communication system: As computers become more pervasive and homes become better connected. a new generation of applications will be deployed over the Internet. In this model. peer-to-peer applications become very attractive because they improve scalability and enhance performance by enabling direct and real-time communication among the peers. We need to propose a decentralized management system that manages the peer-to-peer applications and the system resources in an integrated way: monitors the behavior of the peer-to-peer applications transparently and obtains accurate resource projections. Manages the connections between the peers and distributes the objects in response to the user requests and changing processing and networking conditions.


4.


Write programs that implement the few sorting algorithms (bubble,selection, etc.)for


n data. It stops the operation when the counter for sorting index is at 100, 1000. 10000 and so on, stores the contents of the registers, program counter and partially sorted list of data, etc. It resumes the operation after 30 sec from the point of the termination.


5. Write a program that implements the bubble sort for n data. It stops the operation when the counter for sorting index is at 100, 1000, 10000. and so on. Stores the contents of the registers, program counter and partially sorted list of data. etc. It transfers the code and data - across the network on the new destination and resumes the operation from the point of termination on the previous node. Finally the result from the last node in the itinerary is sent back to the process-initiating node.


6. Develop a prototype that perform parallel computation of the same task on different nodes. Finally process initiator (master node)- receive Yes the result It and computation time required to complete the task on an each node and displays to the user. Compare the computing power of different nodes.


Books


1. Mobility: Processes, Computers. and Agents. Dejan Milojieie. federick


Douglis, Richard Wheeler, Addison-Wesley Professional; 1st edition (April


19, 1999).


2. Ivan Stojmenovic' (Editor), Handbook of Wireless Networks and Mobile


Computingm. Wiley, ISBN: 0-471-41902-8, February 2002


3. Core Java Volume I and II from Sun Micro Systems.


4. Huges. Java Networking, Hut Publication. Pune


5.


Java 2: The Complete Reference 4/c: Herbert Schildt, TMH Delhi.


6.


Java Beans Programming from the Ground Up: Joseph Q'Neil, TMH. Delhi


7.


Java Servlets: Application Development; Karl Moss. TMH, Delhi.


CSE-316 Software Engineering (Pr.)


L T P Theory : 50 Marks


- - 3 Sessional : 50 Marks


1. (i) Implement Receipt Acknowledgement and updation of Inventory (RAUP)


a) Find unadjusted Functional points (UFP)


b) Calculate FPC by Mark II Method


(ii) To estimate effort and schedule


Calculate the compression factor and the manpower required based on given


information of software.


2. Suggest an action plan for the following risks without compromising the


project, process or product parameters


a) Language skills inadequate in two people in a team of five.


b) Specially ordered hardware and software likely to be delivered three


Months late.


c) Customer and end user not convinced on new technology implementation


as a correct choice.


d) Software required interface with other technologies on which the project team has


no experience.


3. Implement a Testing strategy for the following software development cases:


(a) Rule based deterministic closed large but simple payroll system for a


company.


(b) Development or a customer relation management system lor a retail


distribution chain. The retail organization is not sure about the scope, and failure


feature.


(c) Modification to existing order processing system for a multi location,multi-product


company.


4. Build a work breakdown structure for the following


a) Delivery orthe software, initiation to development covering lifecycle.


b) Development of prototype


c) Development of a process for a function


5. In a hospital management system develop the following diagrams for a Ward Service


Management System (SMW).


(a) Work Flow


(b) System Flow


(c) DFD


Develop on effective modular design of SMW using these diagrams.


6. Draw three level DFD’s for CLPS. Modl1larize the CLPS and structure them


top-down as functional model.


7. Conduct a task analysis for the following users:


(a) officer at railway ticket reservation window


(b) officer at insurance claim settlement desk.


(c) clerk at call center. answering queries of customers who have purchased


cars from the company.


8.


Based on the business model of DEL develop a modular structure for a business


system model. Draw a complete system flowchart.


Books


1.


W. S. Jawadekar, Software Engineering Principle and Approaches. TMH. 2004.


2.


Pressman S.Roger. Software Engineering. Tata McGraw-Hill


3. Jalote Pankaj. An integrated approach to software engineering. Narosa Publishing


House


4. Sommerville Lan. Software Engineering. 5th ed. Addison Wesley-2000


5. Fairley Richard, Software. Software Engineering Concepts. Tala McGraw-Hill


CSE-321 Multimedia Techniques(Department Elective I)


L T P Theory : 100 Marks


3 2 - Sessional : 50 Marks


Unit 1.


Basics of Multimedia Technology


Computers, Communication and Entertainment: Multimedia -An introduction: Framework for multimedia systems; multimedia devices CD Audio. CD-ROM. CD-I: presentation devices and the user interface; multimedia presentation and authoring; professional development tools: LANs & multimedia. Internet, World Wide Web & Multimedia; distribution network ATM & ADSL; multimedia servers & databases: vector graphics; 3-D graphics programs; animation techniques; shading; anti-aliasing; morphing: video on demand


Unit 2.


Image Compression & Standards


Making still images: editing and capturing images; scanning images; computer color models: color palettes; vector drawing; 3-D drawing and rendering; JPEG-objectives and architecture: JPEG-DCT encoding and quantization, JPEG statistical coding; JPEG predictive loss less coding; JPEG performance; Overview of other image file formats as GIF, TIFF. BMP. PNG etc.


Unit 3.


Audio & Video


Digital representation of sound: time domain sampled representation; method of encoding the analog signals; sub-band coding; Fourier method: transmission of digital sound; digital audio signal processing; stereophonic & quadraphonic signal processing; editing sampled sound: MPEG Audio; audio compression & decompression: brief survey of speech recognition and generation; audio synthesis; Musical Instrument Digital Interface (MIDI); digital video and image Compression; MPEG Motion video compression standard; DVI technology: time based media representation and delivery.


Unit 4.


Virtual Reality


Applications of multimedia, Intelligent multimedia system, Desktop Virtual Reality (VR). VR operating System, Virtual environment displays and orientation tracking; visually coupled system requirements; intelligent VR software systems.


Applications of environments in various fields viz. Entertainment. manufacturing. Business, education, etc.


Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit


BOOKS


1.


Villamil & Molina Multimedia: An Introduction. PHI.


2.


Lozano. Multimedia: Sound & Video PHI.


3. Villamil & Molina Multimedia: Production. Planning and Delivery, PHI


4. Sinclair. Multimedia on the Pc. BPB.


5. Tay Vaughan. Multimedia :Making it work. TMH


CSE-322 Graph Theory & Combinatorics (Department Elective I)


L T P Theory : 100 Marks


3 2 - Sessional : 50 Marks


Unit 1.


Introduction


Basic concepts, sub graphs, vertex, degrees. walks. paths, circuits, cycles, trees. spanning trees, cut vertices and cut edges. connectivity, Euler tours and Hamiltonian cycles. matching perfect matching, connectivity. and


separability, network flows. I-isomorphism and 2-isomorphism.


Unit 2.


Advanced Features


Vertex coloring, chromatic polynomial. edge coloring, planar and non-planar graphs. Euler's formula Kuratowski's theorem. test for planarity. directed graphs. tournaments, networks. max now, min cut theorems. graph enumeration, Polya's counting theorem.


Unit 3.


Graph Algorithms


Computer representation of graph. shortest path algorithms, minimal spanning tree. fundamental circuit. depth first search. planarity testing. directed circuits. isomorphism. performance of graph theoretic algorithms.


Unit 4.


Combinatorics


Basic combination numbers. recurrence relations. generating functions. multinomial. counting principles, Polya' s theorem, inclusion and exclusion principles. block design and error correcting codes, Hadamard matrices, finite geometry.


Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit


BOOKS


1. Deo N.: Graph Theory and Applications. Prentice Hall


2. D.B.West: Introduction to Graph Theory. Prentice Hall


3.


S.A.Choudum: A First Course in Graph Theory, MacMillan [India]


4.


V.Krishnamurthy: Combinatorics-- Theory and Applications. Affiliated East-West


5.


Alan Tucker: Applied combinatories. Wiley. .


CSE-323 Logic of Programming (Departmental Elective I)


L T P Theory : 100 Marks


3 2 - Sessional : 50 Marks


Unit 1.


Fundamentals


Propositions. Tautologies, Precedence rules. System definition. J~easoning using Transformations. Formal Systems, Axioms, Inference Rules. Predicates. Quantification, Free and bound identifiers. Data Values & Types. Generators. semantic definitions of functions. Generator Induction, defined ness condition.


Unit 2.


Semantics


Predicate Transformers, various commands. Alternative and Iterative commands. Procedure call, The characterization of semantics. The semantic characterization of programming language. Two Theorems. Design of Properly terminating constructs. Euclid's Algorithms.. Interrupts. spin locks.


Unit 3.


Communicating Sequential Processes (CSP)


Parallel commands. Co routines. Subroutines and data representation. monitors and scheduling. Integer semaphore. Dining Philosophers Problcm


Note: - There will be 8 questions in all. At least two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit


BOOKS


1.


David Cries. The Science of Programming. Narosa Publishing House


2.


E.W..Dijkstra. A Discipline of Programming PHI


3. Hoare and .lones, Essays in Computing Science, TMH.


CSE-324 Advanced Database Systems (Departmental Elective I)


L T P Theory : 100 Marks


3 2 - Sessional : 50 Marks


Unit 1.


Parallel & Distributed Databases


Architecture for parallel databases, Parallel query evaluation. parallel individual operations. parallel query optimization Introduction to distributed databases. distributed DBMS architectures. storing data in a distributed DBMS. distributed catalog management, distributed query processing. updating distributed data. introduction to distributed transactions. distributed concurrency control. recovery.


Unit 2.


Data Mining


Introduction, counting co-occurrences, mining for rules, tree structured rules. clustering, similarity search over sequences.


Unit 3.


Object Database Systems


User defined ADT. structured types. objects & reference types. inheritance. design for an ORDBMS. challenges in implementing an ORDBMS. ORDBMS. comparison of RDBMS with OODBMS & ORDBMS.


Unit 4.


Advanced Topics


Advanced transaction processing. integrated access to multiple data source. mobile databases main memory databases. multimedia databases. GIS. temporal & sequence databases.


Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students arc required to attempt five questions selecting at least one question from each unit


BOOKS


1. R. Ramakrishnan & J. Gehrks Database Management Systems: MGH.


International Ed. 2000.


2.Korth. Silberschatz. Sudcrshan: Data Base concepts. MGH. 2001.


3. C.I. Date. Database Systems:. 7th Ed.. Addison Wesley. Pearson Education.


2000.


CSE-325 Parallel Computing (Departmental Elective I)


L T P Theory : 100 Marks


3 2 - Sessional : 50 Marks


Unit 1.


Introduction: Paradigms of parallel computing: Synchronous - vector/array. SIMD, Systolic; Asynchronous - MIMD, reduction paradigm.


Hardware taxonomy: Flynn's classifications, Handler's classifications.


Software taxonomy: Kung's taxonomy. SPMD.


Unit 2.


Abstract parallel computational models: Combinational circuits, Sorting network. PRAM models, Interconnection RAMs. Parallelism approaches - data parallelism, control parallel ism


Performance Metrics: Laws governing performance measurements. Metrics speedups, efficiency. utilization. communication overheads. single/multiple program performances. bench marks.


Unit 3.


Parallel Processors: Taxonomy and topology - shared memory multiprocessors, distributed memory networks. Processor organization - Static and dynamic interconnections. Embeddings and simulations.


Parallel Programming: Shared memory programming. distributed memory programming, object oriented programming, data parallel programming. functional and dataflow programming.


Unit 4.


Scheduling and Parallelization: Scheduling parallel programs. Loop scheduling. Parallelization of sequential programs. Parallel programming support environments.


Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit.


Books


1. M. J. Quinn. Parallel Computing: Theory and Practice. McGraw Hill. New


York,1994.


2. T. G. Lewis and H. EI-Rewini. Introduction to Parallel Computing. Prentice Hall,


New Jersey, 1992. .


3. T. G. Lewis. Parallel Programming: A Machine-Independent Approach, 1EEE


Computer Society Press, Los A lamitos, 1994





THIS SERVICE IS PRODUCED BY UNIQUE GROUP.www.uniqueinstitutes.org ,for job www.uniqueinstitutes.blogspot.com,
FOR FREE ADVERTISEMENT www.pathakadvertisement.blogspot.com

»»  read more

Read more...

BTECH 5TH SEMESTER COMPUTER SCIENCE ENGG SYLLABUS KURUKSHETRA UNIVERSITY

FUNDAMENTALS OF MANAGEMENT (HUT-302 E)




L T P Theory : 100


3 1 - Sessional : 50


Note to the paper setter: The number of questions to be set will be seven, one from each unit. Out of these one question will be compulsory. The examinees will be required to attempt the compulsory one and any other four questions. All questions shall carry equal marks.


Unit 1: Financial Management


Introduction of financial management ,Objectives of financial decisions, status and duties of financial Executives. Financial Planning tools of financial planning, Management of working capital, Factors affecting requirements of working capital, Capital structure decision, Features of appropriate capital structure , Sources of finance.


Unit 2: Personnel Management


Personnel management – Meaning. nature and importance. Functions of personnel Management (a) Managerial Functions and (b) Operative functions. Job analysis- Meaning and importance. Process of Job analysis, job Description and job specification. Human Resource Development – Meaning and Concept.


Unit 3: Production Management


Production Management – Definition and Objectives,


Plant Location: Ideal Plant Location, Factors affecting plant Location.


Plant Layout : Ideal Plant Layout, Factors affecting plant layout


Work Measurement: Meaning , Objectives and Essentials of work Measurement


Production Control: Meaning and importance of production control and steps involved in production control.


Unit 4: Marketing Management


Nature, Scope and importance of marketing management Modern marketing concepts, Role of marketing in economic development. Marketing information system, Meaning nature and scope of international Marketing.


CSE-301 (Design and Analysis of Algorithms)


L T P Theory: 100


4 1 - Sessional: 25


Unit 1


Introduction


Review of elementary data structures, analysing algorithms, asymptotic notation, recurrence relations, hash tables, Binary search trees.


Sorting and Order Statistics


Heapsort, Priority queues,Quicksort, Sorting in linear time, medians and order statistics, dynamic order statistics.


Unit 2
Advanced Design and analysis Techniques


Dynamic programming – Elements, Matrix-chain multiplication, longest common subsequence, optimal polygon traingulation, Greedy algorithms- Elements , activity- selection problem, Huffman codes, task scheduling problem.


Advanced data Structures


Operations in B-Trees, Binomial heaps, Fibonacci heaps, data structures for disjoint sets, strings.


Unit 3
Graph Algorithms
Review of graph algorithms, topological sort, strongly connected components,minimum spanning trees- Kruskal and prims,Single source shortest paths, relaxation, Dijkstras algorithm, Bellman- Ford algorithm, Single source shortest paths for directed acyclic graphs, difference constraints and shortest paths, All pairs shortest paths- shortest paths and matrix multiplication, Floyd-Warshall algorithm, Johnsons algorithm.


Unit 4
 Sorting Networks


Flow networks, Ford- Fulkerson method, Maximum bipartite matching, Sorting Networks, Comparison network, The zero- one principle, Bitonic sorting network, merging network


Note:- There will be 8 questions in all. Two Questions will be set from each unit. Students are required to attempt five questions selecting at least one question from each unit.


Books :
1 Corman, Leiserson and Rivest : Introduction to Algorithms, 2/e, PHI
2 Horowitz, Ellis and Sahni, Sartaj : Fundamentals of Computer Algorithms. Galgotia Publications
3 Aho, Hopcroft and Ullman : The Design and Analyses of Computer Algorithms. Addison Wesley.


4 R.B.Patel, Expert Data Structures with C, Khanna Publications , Delhi, India, 2nd Edition 2004, ISBN 81-87325-07-0, pp.1-909


5 R.B.Patel & M.M.S Rauthan, Expert Data Structures with C++, Khana Publications, Delhi , India, 2nd Edition 2004,ISBN : 87522-03-8, pp.1-752


COMPUTER NETWORKS (CSE –303)


THEORY: 75


SESSIONAL: 50
UNIT 1


Network functions, Network Topologies, Network Services, Switching approaches, Transmission media and systems, multiplexing and signaling techniques, Error detection and correction, ISDN and BISDN.


Layered architectures


Example OSI Reference Model, Overview of TCP/IP architecture, Socket System calls, SMTP, Electronic mail.


UNIT 2
Peer-To-Peer Protocols


Protocols, Service Models and end-to-end requirements, ARQ, Sliding window, RTP, HDLC, PPP protocols, Statistical multiplexing


MAC and LAN Protocols
Multiple access communication ,Random Access – ALOHA, Slotted ALOHA,CSMA, CSMA/CD, Channelization : FDMA,TDMA,CDMA , Channelization in cellular networks, LAN standards 0 802.11,LAN Bridges.


UNIT 3
Packet Switching Networks


Packet Network topology, Datagrams and Virtual Circuits – Structure of Switch / Router, Connectionless abd virtual circuit packet switching,X.25,Routing Algorithms, ATM Networks, Traffic Management and QoS – FIFO, Priority Quessues, Fair Quieing, Congestion control techniques.


UNIT 4
TCP/IP


Architecture, Internet Protocols – IP packet, addressing, Subnet Addressing, IP routing, CIDR, ARP, RARP, ICMP, Reassembly, IPv6, UDP, Transmission control Protocol – TCP, Reliable stream service, Operation Protocol, DHCP, Mobile IP, Internet Routing Protocols, Multicast routing.


NOTE There will be 8 questions in all. 2 questions will be set from each unit. Students have to attempt five questions selecting at least one from each unit.


BOOKS1.
Leon Garrcia and Indra Widjaja: communication Networks – Fundamentals and Concepts and Key Architectures – TMH 2000.


2.
A.S. Tanenbaum: Computer Networks 3/e .PHI, 1997.


3.
Frozen, Coombs and Fagan: Introduction to Data Communication and Networks.TMH, 1999.
4.
William Stallings: Data and Communication 5/e .PHI.


Automata Theory


CSE-305


L T P Theory: 100


4 2 - Sessional: 50


Unit-1


Finite Automata and Regular Expression: Finite State System, Basic Definition Non-Deterministic finite Automata (NDFA). Deterministic finite Automata (DFA), Equivalence of DFA and NDFA, Finite Automata with E-moves. Regular Expression, Equivalence of finite Automata and expression. Regular expression conversion and Vice-Versa.
Unit-2
Introduction to Machines: Concept of basic machines, Properties and limitations of FSM, Moore and Mealy Machines, Equivalence of Moore and Mealy Machines. Conversion of NFA and DFA by Arden’s method.


Unit-3
Grammars: Definitions, Context free and Context sensitive Grammar, Ambiguity, Regular Grammar, Reduced forms, Removal of useless symbols and unit production, Chomsky Normal form (CNF), Griebach Normal Form (GNF).


Pushdown Automata: Introduction to push-down machines, Application of push down machines.


Unit-4
Turing Machines, Deterministic and Non-Deterministic Turing Machines, Design of T.M., Halting Problem of T.M. PCP problem.


Chomsky Hierarchy: Chomsky hierarchies of grammars, unrestricted grammar, Context sensitive Language, Relation between Languages of classes.


Computability: Basic Concepts, Primitive Recursive Functions.


Note: There will be 8 questions in all. Two Questions will be set from each umit. Students are required to attempt five questions selecting at least on question from each unit.


Text Books
1.
R.B. Patel, & Prem Nath, Theory of Automata and Formal Languages, Umesh Publication, New Delhi, Ist Edition 2005, ISBN-81-88114-53-7, pp. 1-496.
2.


John C. Martin: Introduction to Language and the Theory of Computation, MGH.


Books
1.
Lewis & Papadimitriou: Elements of the Theory of Computation. PHI.


2.
Daniel I.A. Cohen: Introduction to Computer Theory: John Wiley.


3.
J.E. Hoproft and J.D. Ullman: Introduction to Automata Theory Languages and Computation, Narosa.


4.
Introduction to Automata Theory, Language & computations –Hoproaft & O.D. Ullman, R. Motwani.


5.Theory of Computer Sc. (Automata, Languages & Computation): K.I..P. Mishra & N. Chandershekaran.


6.Introduction to formal language & Automata- Peter Linz.


Operating System(CSE-307)


L T P Theory: 75


3 1 - Sessionals:25


UNIT 1


File and CPU Management:


Operating system functions and characterstics,historical evalution of operating system,Real time systems,Distributed systems,Methodologies for implementation of o/s service system calls,system programs,interrupt mechanisms,concept of threading.


File System: Functions of the systems,file access and allocation methods,Directory system:structured organization,Directory and file protection mechanism,implementation issues;hierarichy of file and device management.


CPU Scheduling: Levels of scheduling,comparative study of scheduling algorithms,multiple processor scheduling.


UNIT 2


Storage and Device Management:


Storage Management: Storage allocation methods:single contiguous allocation,multiple contiguous allocation,Paging, Segmentation,Combination of Paging and Segmentation,Virtual memory concepts,Demand paging,Page replacement algorithms,Thrashing


Device Management:Hardware organization,device scheduling,policies and I/O Management.


Protection: Mechanism and Policies, implementation.


UNIT 3


Deadlocks and Cuncurrency Control:


Deadlock:Deadlock characterization,Deadlock prevention and avoidance,Deadlock detection and recovery,practical considerations.


Concurrent Processes: Critical section problem,Semaphores,Classical process coordination,problems and their solutions,interprocess communication,multithreading.


UNIT 4 CaseStudies:


DOS: Study of DOS with reference to storage management,device management,file system,interrupt mechanism.


UNIX:study of UNIX,with reference to storage management,file system,concurrency control,CPU scheduling.


Note: there will be 8 questions in all.Two questions will be set from each unit.Students are required to attempt five questions selecting atleast one question from each unit.


Books


1.Peterson,J.L.&Silbersehatz.A,Operating System concepts,Addison,Wesley.


2.Brinneh,Hansen,operating system principles:Prentiee Hall of India


3.Haberman,A.N.introduction to operating system,design Galgotia Publication, New Delhi.


4.Tanenbaum,A.N.:introduction to operating system


5.Hansen,P.B.Architecture of concurrent programs.PHI


6.Shaw,A.C.,Logic design of operating systems,PHI.


Algorithm Design (CSE-315)(Pr.)


L T P Practical: 25


- - 3 Sessionals:50


EXPERIEMENT


1Implement the minimum cost spanning tree algorithm.


2Implement the shortest path algorithm.


3Implement the algorithm to compute roots of optimal subtrees.


4An Euler circuit for an undirected graph is a path that starts and ends at the same vertex and uses each edge exactly once. A connected undirected graph G has an Euler Circuit. If and only if every vertex is of even degree. Give an algorithm and implement to find the Euler Circuit in a graph with edges provided one exists .


5Give an algorithm to determine whether a directed graph with positive and negative cost edges has negative cost cycle.


6
Write an algorithm in which given an nxn matrix M of positive integers is given and that finds a sequence of adjacent entries starting from M[n,1] and ending at M[1,n] such that the sum of the absolute values of differences between adjacent entries is minimized. Two entries M[i, j] and M[k, i] are adjacent if


(a)


I-k+-1 and j-1 or


(b)


I=k and j=1+-1


For ex. In the following figure sequence 7,5,8,7,9,6,12 is a solution


1


9


6


12


8


7


3


5


5


9


11


4


7


3


2


6


7.


Write a complete LC branch and bound algorithm for the job sequencing with deadlines problem. Use the fixed tuple size formulation.


8.


Write a LC branch and bound algorithm for the knapsack problem using the fixed tuple size formulation.


9.


The postfix representation of an infix arithmetic expression LDR is defined recusively to the postfix representation of L followed by the postfix representation of R followed by 0. L & R are respectively the left and right periods of 0. considers some examples :


Infix postfix


(i) a+b ab+


(ii) (a+B)*C ab+*


(iii) (a-b)/(e*d) ab-cd*/


(a) Write an algorithm to evaluate a postfix expression E. Assume E is presented as a string and that there exists an algorithm NEXT-TOKEN(E) that returns the next token (i.e. operator or operand) in E. When all tokens in E have been extracted, NEXT TOKEN(E) returns. Assume that the only operators in E are binary +,-,* and /. (Hint: Make a left to right scan off using a stack to store operands and results. When even an operator is run in E, the top two operands on the stack are its right and left operands).


10.


Write an algorithm to obtain the postfix form of an infix expression E. Again assume E has only the binary operators +,-,*, and /. (Hint: Make a left to right scan of E using a stack to store operators until both the left and right operands of an operator have been output in postfix form). Note that E may contain parenthesis.


Operating System (CSE-313)


L T P Practical: 50


- - 3 Sessionals:50


EXPERIMENTS


1Study of H/W & S/W requirement of different operating system.


2
Implementation of contiguous, linked and indirect allocation strategies assuming randomly generated free space list.


3Implementation of worst, best & first fit contiguous allocation assuming randomly generated free space list.


4


Implementation of compaction for the continually changing memory layout & calculate total movement of data.


5


Calculation of external & Internal fragmentation for different program & for different page size.


6


Implementation of resource allocation graph.


7


Implementation of Bnaker’s algorithm.


8


Conversion of response allocation graph to wait for graph.


9


Implementation of Bernstein’s condition for concurrency.


10


Implementation of Fork & Join Construct.


11


Implementation of “ Semaphore “ for concurrency.


Advance Technologies (Pr) (CSE-311)


L T P Practical: 50


- - 3 Sessionals:50


EXPERIMENT


1.Learn Basics of Java language and its development libraries/ tools.


2.Generate an editor screen containing menus, dialog boxes etc using Java.


3.Create an applet with a text field and three buttons. When you press each button, make some different text appear in the text field. Add a check box to the applet created, capture the event and insert different text in the text field.


4.Create an applet with a button and a text field. Write a handleEvent( ) so that if the button has the focus, characters typed into it will appear in the text field.


5.Create your own java bean called VALVE that contains two properties: a Boolean called “on” and an integer called “level”. Create a manifest file, use jar to package your bean then load it into the beanbox or into your own beans enabled program builder tool.


6.Develop a servlet that gets invoked when a form on a Web page in HTML is submitted. Create a cookie object and enter/display value for that Cookie.


7.


Java Networking Java Sockets and RMI.


8.


Programming under development tool ASP.net.


9.


Using JAVA develop a front end for a contact management program using a flat file database. DB needs to be distributed or centralized.






THIS SERVICE IS PRODUCED BY UNIQUE GROUP    http://www.uniqueinstitutes.org/ ,for job www.uniqueinstitutes.blogspot.com,
FOR FREE ADVERTISEMENT www.pathakadvertisement.blogspot.com

»»  read more

Read more...

SYLLABUS OF BTECH 4TH SEM KUK KURUKSHETRA UNIVERTISY COMPUTER SCIENC ENGG

Bachelor of Technology (Computer Engineering/Information Technology)



Scheme of studies / Examination


(Semester- 4)




BASICS OF INDUSTRIAL SOCIOLOGY, ECONOMICS


& MANAGEMENT


HUM – 201 E Sessional : 50 Marks


L T P Theory : 100 Marks


3 1 - Total : 150 Marks


Duration of Exam. : 3 Hrs.


UNIT-I


Meaning of social change, nature of social change, theories of social change. The direction of social change, the causes of social change, the process of social change. Factors of social change –the technological factors, the cultural factors, effects of technology on major social institutions, social need of status system, social relations in industry.


UNIT-II


Meaning of Industrial Economic, Production Function, its types, Least Cost Combination, Law of Variable Proportion, Laws of Return – Increasing, Constant & Diminishing.


Fixed & variable costs in short run & long run, opportunity costs, relation between AC & MC, U-shaped short run AC Curve.


Price & Output Determination under Monopoly in short run & long run. Price Discrimination, Price Determination under Discriminating Monopoly. Comparison between Monopoly & Perfect Competition.


UNIT – III


Meaning of Management, Characteristics of Management, Management Vs. Administration, Management – Art, Science & Profession, Fayol’s Principles of Management.


Personnel Management – Meaning & Functions, Manpower – Process of Manpower Planning, Recruitment & Selection – Selection Procedure.


Training – Objectives & Types of Training, Various Methods of Training. Labour Legislation in India – Main provisions of Industrial disputes Act 1947;


UNIT – IV


Marketing Management – Definition & Meaning, Scope of Marketing Management, Marketing Research – Meaning, Objectives.


Purchasing Management – Meaning & Objectives, Purchase Procedure, Inventory Control Techniques.


Financial Management – Introduction, Objectives of Financial decisions, Sources of Finance.


Note : Eight questions are to be set taking two from each unit. The students are required to attempt five questions in all, taking at least one from each unit.


TEXT BOOKS :


1.


“Modern Economic Theory” Dewett, K.K., S. Chand & Co.


2.


“Economic Analysis” K.P. Sundharam & E.N. Sundharam (Sultan Chand & Sons).


3.


“Micro Economic Theory” M.L. Jhingan (Konark Publishers Pvt. Ltd.).


4.


“Principles of Economics” M.L. Seth (Lakshmi Narain Aggarwal Educational Publishers – Agra).


5.


“An Introduction to Sociology”, D.R. Sachdeva & Vidya Bhusan.


6.


“Society – An Introductory Analysis”, R.M. Maclver Charles H. Page.


7.


“Principles and Practices of Management : R.S. Gupta; B.D. Sharma; N.S. Bhalla; Kalyani.


REFERENCE BOOKS


1.


“Organization and Management : R.D. Aggarwal, Tata McGraw Hill.


2.


Business Organization and Management : M.C. Shukla


CSE- 202 E Computer Architecture & Organization


L T P Sessional: 50 Marks


3 1 - Exam : 100 Marks


Total: 150 Marks


Duration of Exam: 3 Hrs.


Unit-1: General System Architecture: Store program control concept, Flynn’s classification of computers (SISD, MISD, MIMD); Multilevel viewpoint of a machine: digital logic, micro architecture, ISA, operating systems, high level language; structured organization; CPU, caches, main memory, secondary memory units & I/O; Performance metrics; MIPS, MFLOPS.


Instruction Set Architecture: Instruction set based classification of processors (RISC, CISC, and their comparison); addressing modes: register, immediate, direct, indirect, indexed; Operations in the instruction set; Arithmetic and Logical, Data Transfer, Machine Control Flow; Instruction set formats (fixed, variable, hybrid); Language of the machine: 8086 ; simulation using MASM


Unit-2: Basic non pipelined CPU Architecture: CPU Architecture types (accumulator, register, stack, memory/ register) detailed data path of a typical register based CPU, Fetch-Decode-Execute cycle (typically 3 to 5 stage); microinstruction sequencing, implementation of control unit, Enhancing performance with pipelining. Hardwired control design method, Micro programmed control unit.


Unit-3: Memory Hierarchy & I/O Techniques: The need for a memory hierarchy (Locality of reference principle, Memory hierarchy in practice: Cache, main memory and secondary memory, Memory parameters: access/ cycle time, cost per bit); Main memory (Semiconductor RAM & ROM organization,memory expansion, Static & dynamic memory types); Cache memory (Associative & direct mapped cache organizations. Allocation & replacement polices, segments, pages & file organization, virtual memory.


Unit-4: Introduction to Parallelism: Goals of parallelism (Exploitation of concurrency, throughput enhancement); Amdahl’s law; Instruction level parallelism (pipelining, super scaling –basic features); Processor level parallelism (Multiprocessor systems overview).


Computer Organization [80x86]: Instruction codes, computer register, computer instructions, timing and control, instruction cycle, type of instructions, memory reference, register reference. I/O reference, Basics of Logic Design, accumulator logic, Control memory, address sequencing, micro-instruction formats, micro-program sequencer, Stack Organization, Instruction Formats, Types of interrupts; Memory Hierarchy. Programmed I/O, DMA & Interrupts.


Text Books:


•


Computer Organization and Design, 2nd Ed., by David A. Patterson and John L. Hennessy, Morgan 1997, Kauffmann.


•


Computer Architecture and Organization, 3rd Edi, by John P. Hayes, 1998, TMH.


Reference Books:


•


Operating Systems Internals and Design Principles by William Stallings,4th edition, 2001, Prentice-Hall Upper Saddle River, New Jersey


•


Computer Organization, 5th Edi, by Carl Hamacher, Zvonko Vranesic,2002, Safwat Zaky.


•


Structured Computer Organisation by A.S. Tanenbaum, 4th edition, Prentice-Hall of India, 1999, Eastern Economic Edition.


•


Computer Organisation & Architecture: Designing for performance by W. Stallings, 4th edition, 1996, Prentice-Hall International edition.


CSE-204 E Programming Languages


L T P Sessional: 50 Marks


3 1 - Exam: 100 Marks


Total: 150 Marks


Duration of Exam: 3 Hrs.


Unit-1: Introduction: A brief history, Characteristics of a good programming language, Programming language translators compiler & interpreters , Elementary data types –data objects, variable & constants, data types, Specification & implementation of elementary data types, Declarations ,type checking & type conversions , Assignment & initialization, Numeric data types, enumerations, Booleans & characters.


Syntax & Semantics: Introduction, general problem of describing syntax, formal method of describing syntax, attribute grammar dynamic semantic.


Unit-2: Structured data objects: Structured data objects & data types , specification & implementation of structured data types, Declaration & type checking of data structure ,vector & arrays, records Character strings, variable size data structures , Union, pointer & programmer defined data objects, sets, files.


Subprograms and Programmer Defined Data Types:Evolution of data type concept abstraction, encapsulation & information hiding , Subprograms ,type definitions, abstract data types, over loaded subprograms, generic subprograms.


Unit–3: Sequence Control: Implicit & explicit sequence control ,sequence control within expressions, sequence control within statement, Subprogram sequence control: simple call return, recursive subprograms, Exception & exception handlers, co routines, sequence control. Concurrency –subprogram level concurrency, synchronization through semaphores, monitors & message passing


Data Control: Names & referencing environment, static & dynamic scope, block structure, Local data & local referencing environment, Shared data: dynamic & static scope. Parameter & parameter transmission schemes.


Unit-4: Storage Management: Major run time elements requiring storage ,programmer and system controlled storage management & phases , Static storage management , Stack based storage management, Heap storage management ,variable & fixed size elements.


Programming Languages: Introduction to procedural, non-procedural ,structured, logical, functional and object oriented programming language, Comparison of C & C++ programming languages.


Text Book:


•


Programming languages Design & implementation by T.W. .Pratt, 1996, Prentice Hall Pub.


•


Programming Languages – Principles and Paradigms by Allen Tucker & Robert Noonan, 2002, TMH,


Reference Books:


•


Fundamentals of Programming languages by Ellis Horowitz, 1984, Galgotia publications (Springer Verlag),


•


Programming languages concepts by C. Ghezzi, 1989, Wiley Publications.,


•


Programming Languages – Principles and Pradigms Allen Tucker , Robert Noonan 2002,


T.M.H.


Note: Eight questions will be set in all by the examiners taking at least two questions from each


unit .Students will be required to attempt five questions in all at least one from each unit.


IT-252 E Object Oriented Programming Using C++


L T P Sessional: 50 Marks


3 1 - Exam: 100 Marks


Total: 150 Marks


Duration of Exam: 3 Hrs.


Unit–1: Introduction to C++, C++ Standard Library, Basics of a Typical C++ Environment, Pre-processors Directives, Illustrative Simple C++ Programs. Header Files and Namespaces, library files. Concept of objects, basic of object modeling, object classes, associations, behaviors, description, Object Oriented Analysis & Object Modeling techniques,


Object Oriented Concepts : Introduction to Objects and Object Oriented Programming, Encapsulation (Information Hiding), Access Modifiers: Controlling access to a class, method, or variable (public, protected, private, package), Other Modifiers, Polymorphism: Overloading,, Inheritance, Overriding Methods, Abstract Classes, Reusability, Class’s Behaviors.


Classes and Data Abstraction: Introduction, Structure Definitions, Accessing Members of Structures, Class Scope and Accessing Class Members, Separating Interface from Implementation, Controlling Access Function And Utility Functions, Initializing Class Objects: Constructors, Using Default Arguments With Constructors, Using Destructors, Classes : Const(Constant) Object And Const Member Functions, Object as Member of Classes, Friend Function and Friend Classes, Using This Pointer, Dynamic Memory Allocation with New and Delete, Static Class Members, Container Classes And Integrators, Proxy Classes, Function overloading.


Unit-2: Operator Overloading: Introduction, Fundamentals of Operator Overloading, Restrictions On OperatorsOverloading, Operator Functions as Class Members vs. as Friend Functions, Overloading, <<, >> Overloading UnaryOperators, Overloading Binary Operators.


Inheritance: Introduction, Inheritance: Base Classes And Derived Classes, Protected Members, Casting Base-ClassPointers to Derived- Class Pointers, Using Member Functions, Overriding Base –Class Members in a Derived Class,Public, Protected and Private Inheritance, Using Constructors and Destructors in derived Classes, Implicit Derived –Class Object To Base- Class Object Conversion, Composition Vs. Inheritance.


Unit–3: Virtual Functions and Polymorphism: Introduction to Virtual Functions, Abstract Base Classes AndConcrete Classes, Polymorphism, New Classes And Dynamic Binding, Virtual Destructors, Polymorphism, DynamicBinding.


Files and I/O Streams: Files and Streams, Creating a Sequential Access File, Reading Data From A Sequential AccessFile, Updating Sequential Access Files, Random Access Files, Creating A Random Access File, Writing Data RandomlyTo a Random Access File, Reading Data Sequentially from a Random Access File. Stream Input/Output Classes andObjects, Stream Output, Stream Input, Unformatted I/O (with read and write), Stream Manipulators, Stream FormatStates, Stream Error States.


Unit-4: Templates & Exception Handling: Function Templates, Overloading Template Functions, Class Template,Class Templates and Non-Type Parameters, Templates and Inheritance, Templates and Friends, Templates and StaticMembers.


Introduction, Basics of C++ Exception Handling: Try Throw, Catch, Throwing an Exception, Catching an Exception,Re-throwing an Exception, Exception specifications, Processing Unexpected Exceptions, Stack Unwinding,Constructors, Destructors and Exception Handling, Exceptions and Inheritance.


Text Books:


•


C++ How to Program by H M Deitel and P J Deitel, 1998, Prentice Hall


•


Object Oriented Programming in Turbo C++ by Robert Lafore ,1994, The WAITE Group Press.


•


Programming with C++ By D Ravichandran, 2003, T.M.H


Reference books:


•


Object oriented Programming with C++ by E Balagurusamy, 2001, Tata McGraw-Hill


•


Computing Concepts with C++ Essentials by Horstmann, 2003, John Wiley,


•


The Complete Reference in C++ By Herbert Schildt, 2002, TMH.


•


C++ Programming Fundamentals by Chuck Easttom, Firewall Media.


Note: Eight questions will be set in all by the examiners taking at least two questions from each unit .Students will be required to attempt five questions in all at least one from each unit.


B.TECH IVTH SEMESTER


DIGITAL ELECTRONICS


(ECE-204E)


L T P Theory : 100 Marks


3 1 - Sessional : 50 Marks


Total : 150 Marks


Duration of Exam: 3 Hrs.


UNIT 1 FUNDAMENTALS OF DIGITAL TECHNIQUES:


Digital signal, logic gates: AND. OR, NOT. NAND. NOR- EX-OR, EX-NOR, Boolean algebra. Review of Number systems. Binary codes: BCD, Excess-3. Gray codes.


COMBINATIONAL DESIGN USING GATES:


Design using gates. Karnaugh map and Quine Mcluskey methods of simplification.


UNIT 2 COMBINATIONAL DESIGN USING MST DEVICES


Multiplexers and Demultiplexers and their use as logic elements. Decoders. Adders / Subtracters. BCD arithmetic Circuits. Encoders. Decoders / Drivers for display devices.


SEQUENTIAL CIRCUITS:


Flip Flops: S-R- J-K. T. D, master-slave, edge triggered-shift registers, sequence generators. Counters. Asynchronous and Synchronous Ring counters and Johnson Counter, Design of Synchronous and Asynchronous sequential circuits.


UNIT 3 DIGITAL LOGIC FAMILIES:


Switching mode operation of p-n junction, bipolar and MOS-devices. Bipolar logic families: RTL, DTL, DCTL. HTL, TTL, ECL, MOS, and CMOS logic families. Tristate logic. Interfacing of CMOS and TTL families.


UNIT 4 A/D AND D/A CONVERTERS:


Sample and hold circuit, weighted resistor and R -2 R ladder D/A Converters, specifications for


D/A converters. A/D converters: Quantization, parallel -comparator, successive approximation, counting type.


Dual-slope ADC, specifications of ADCs.


PROGRAMMABLE LOGIC DEVICES:


ROM, PLA. PAL, Introduction to FPGA and CPLDs.


TEXT BOOK:


1. Modem Digital Electronics (Edition III): R. P. Jain; TMH


REFERENCE BOOKS:


1. Digital Integrated Electronics: Taub & Schilling: MGH


2. Digital Principles and Applications: Malvino & Leach: McGraw Hill.


3. Digital Design: Morris Mano: PHI,


NOTE: Eight questions are to be set in all by the examiner taking at least one question from each unit. Students will be required to attempt five questions in all.


•


Computer Architecture & Organisation by M. Mano, 1990, Prentice-Hall.


•


Computer Architecture- Nicholas Carter, 2002, T.M.H.


Note: Eight questions will be set in all by the examiners taking at least two questions from each


unit .Students will be required to attempt five questions in all at least one from each unit.


ECE-216 E Microprocessors And Interfacing


L T P Sessional: 50 Marks


3 1 - Exam: 100 Marks


Total: 150 Marks


Duration of Exam: 3 Hrs.


Unit-1:THE 8085 PROCESSOR : Introduction to microprocessor, 8085 microprocessor : Architecture, instruction set, interrupt structure, and assembly language programming.


MEMORY INTERFACING: Semiconductor memory and its types- Static and dynamic RAM, ROM, EPROM, EEROM and NOVRAM- Interfacing memory- Interfacing SRAM, DRAM, EPROM etc. Timing of RAM and ROM signals.


Unit-2 : THE 8086 MICROPROCESSOR ARCHITECTURE : Architecture, block diagram of 8086, details of sub-blocks such as EU, BIU; memory segmentation and physical address computations, program relocation, addressing modes, instruction formats, pin diagram and description of various signals.


INSTRUCTION SET OF 8086 : Instruction execution timing, assembler instruction format, data transfer instructions, arithmetic instructions, branch instructions, looping instructions, NOP and HLT instructions, flag manipulation instructions, logical instructions, shift and rotate instructions, directives and operators, programming examples.


Unit-3 : INTERFACING DEVICE : The 8255 PPI chip: Architecture, control words, modes and examples.Interfacing D/A and A/D converters


Unit-4: DMA : Introduction to DMA process, 8237 DMA controller,


INTERRUPT AND TIMER : 8259 Programmable interrupt controller, Programmable interval timer chips.


Text Books :


•


Microprocessor Architecture, Programming & Applications with 8085 : Ramesh S Gaonkar; Wiley Eastern Ltd.


•


The Intel Microprocessors 8086- Pentium processor : Brey; PHI


Reference Books :


•


Microprocessors and interfacing : Hall; TMH


•


The 8088 & 8086 Microprocessors-Programming, interfacing,Hardware & Applications :Triebel & Singh; PHI


•


Microcomputer systems: the 8086/8088 Family: architecture, Programming & Design : Yu-Chang Liu & Glenn A Gibson; PHI.


•


Advanced Microprocessors and Interfacing : Badri Ram; TMH


Note: Eight questions will be set in all by the examiners taking at least two questions from each


unit .Students will be required to attempt five questions in all at least one from each unit.


IT-256 E C ++ Programming Lab.


L T P Sessional: 50 Marks


- - 3 Exam: 25 Marks


Total: 75 Marks


Duration of Exam: 3 Hrs.


Q1. Raising a number n to a power p is the same as multiplying n by itself p times. Write a function called power ( ) that takes a double value for n and an int value for p, and returns the result as double value. Use a default argument of 2 for p, so that if this argument is omitted, the number will be squared. Write a main ( ) function that gets values from the user to test this function.


Q2. A point on the two dimensional plane can be represented by two numbers: an X coordinate and a Y coordinate. For example, (4,5) represents a point 4 units to the right of the origin along the X axis and 5 units up the Y axis. The sum of two points can be defined as a new point whose X coordinate is the sum of the X coordinates of the points and whose Y coordinate is the sum of their Y coordinates. Write a program that uses a structure called point to model a point. Define three points, and have the user input values to two of them. Than set the third point equal to the sum of the other two, and display the value of the new point. Interaction with the program might look like this:


Enter coordinates for P1: 3 4


Enter coordinates for P2: 5 7


Coordinates of P1 + P2 are : 8, 11


Q 3. Create the equivalent of a four function calculator. The program should request the user to enter a number, an operator, and another number. It should then carry out the specified arithmetical operation: adding, subtracting, multiplying, or dividing the two numbers. (It should use a switch statement to select the operation). Finally it should display the result. When it finishes the calculation, the program should ask if the user wants to do another calculation. The response can be ‘Y’ or ‘N’. Some sample interaction with the program might look like this.


Enter first number, operator, second number: 10/ 3


Answer = 3.333333


Do another (Y/ N)? Y


Enter first number, operator, second number 12 + 100


Answer = 112


Do another (Y/ N) ? N


Q4. A phone number, such as (212) 767-8900, can be thought of as having three parts: the area code (212), the exchange (767) and the number (8900). Write a program that uses a structure to store these three parts of a phone number separately. Call the structure phone. Create two structure variables of type phone. Initialize one, and have the user input a number for the other one. Then display both numbers. The interchange might look like this:


Enter your area code, exchange, and number: 415 555 1212


My number is (212) 767-8900


Your number is (415) 555-1212


Q 5. Create two classes DM and DB which store the value of distances. DM stores distances in metres and centimeters and DB in feet and inches. Write a program that can read values for the class objects and add one object of DM with another object of DB. Use a friend function to carry out the addition operation. The object that stores the results maybe a DM object or DB object, depending on the units in which the results are required. The display should be in the format of feet and inches or metres and cenitmetres depending on the object on display.


Q 6. Create a class rational which represents a numerical value by two double values- NUMERATOR & DENOMINATOR. Include the following public member Functions:


•


constructor with no arguments (default).


•


constructor with two arguments.


•


void reduce( ) that reduces the rational number by eliminating the highest common factor between the numerator and denominator.


•


Overload + operator to add two rational number.


•


Overload >> operator to enable input through cin.


•


Overload << operator to enable output through cout.


Write a main ( ) to test all the functions in the class.


Q 7. Consider the following class definition


class father {


protected : int age;


public;


father (int x) {age = x;}


virtual void iam ( )


{ cout < < “I AM THE FATHER, my age is : ”<< age<< end1:}


};


Derive the two classes son and daughter from the above class and for each, define iam ( ) to write


our similar but appropriate messages. You should also define suitable constructors for these


classes.


Now, write a main ( ) that creates objects of the three classes and then calls iam ( ) for them.


Declare pointer to father. Successively, assign addresses of objects of the two derived classes to


this pointer and in each case, call iam ( ) through the pointer to demonstrate polymorphism in


action.


Q 8. Write a program that creates a binary file by reading the data for the students from the terminal.


The data of each student consist of roll no., name ( a string of 30 or lesser no. of characters) and marks.


Q9. A hospital wants to create a database regarding its indoor patients. The information to store include


a)


Name of the patient


b)


Date of admission


c)


Disease


d)


Date of discharge


Create a structure to store the date (year, month and date as its members). Create a base class to store the above information. The member function should include functions to enter information and display a list of all the patients in the database. Create a derived class to store the age of the patients. List the information about all the to store the age of the patients. List the information about all the pediatric patients (less than twelve years in age).


Q 10. Make a class Employee with a name and salary. Make a class Manager inherit from Employee. Add an instance variable, named department, of type string. Supply a method to toStringthat prints the manager’s name, department and salary. Make a class Executive inherit from Manager. Supply a method to String that prints the string “Executive” followed by the information stored in the Manager superclass object. Supply a test program that tests these classes and methods.


Q11. Imagine a tollbooth with a class called toll Booth. The two data items are a type unsigned int to hold the total number of cars, and a type double to hold the total amount of money collected. A constructor initializes both these to 0. A member function called payingCar ( ) increments the car total and adds


0.50 to the cash total. Another function, called nopayCar ( ), increments the car total but adds nothing to the cash total. Finally, a member function called displays the two totals. Include a program to test this class. This program should allow the user to push one key to count a paying car, and another to count a nonpaying car. Pushing the ESC kay should cause the program to print out the total cars and total cash and then exit.


Q12. Write a function called reversit ( ) that reverses a string (an array of char). Use a for loop that swaps the first and last characters, then the second and next to last characters and so on. The string should be passed to reversit ( ) as an argument.


Write a program to exercise reversit ( ). The program should get a string from the user, call reversit ( ), and print out the result. Use an input method that allows embedded blanks. Test the program with Napoleon’s famous phrase, “Able was I ere I saw Elba)”.


Q13. Create some objects of the string class, and put them in a Deque-some at the head of the Deque and some at the tail. Display the contents of the Deque using the forEach ( ) function and a user written display function. Then search the Deque for a particular string, using the first That ( ) function and display any strings that match. Finally remove all the items from the Deque using the getLeft ( ) function and display each item. Notice the order in which the items are displayed: Using getLeft ( ), those inserted on the left (head) of the Deque are removed in “last in first out” order while those put on the right side are removed in “first in first out” order. The opposite would be true if getRight ( ) were used.


Q 14. Assume that a bank maintains two kinds of accounts for customers, one called as savings account and the other as current account. The savings account provides compound interest and withdrawal facilities but no cheque book facility. The current account provides cheque book facility but no interest. Current account holders should also maintain a minimum balance and if the balance falls below this level, a service charge is imposed.


Create a class account that stores customer name, account number and type of account. From this derive the classes cur_acct and sav_acct to make them more specific to their requirements. Include necessary member functions in order to achieve the following tasks:


a) Accept deposit from a customer and update the balance.


b) Display the balance.


c) Compute and deposit interest.


d) Permit withdrawal and update the balance.


e) Check for the minimum balance, impose penalty, necessary and update the balance.


f) Do not use any constructors. Use member functions to initialize the class members.


Q 15. Create a base class called shape. Use this class to store two double type values that could be used to compute the area of figures. Derive two specific classes called triangle and rectangle from the base shape. Add to the base class, a member function get_data ( ) to initialize baseclass data members and another member function display_area ( ) to compute and display the area of figures. Make display_area ( ) as a virtual function and redefine this function in the derived classes to suit their requirements. Using these three classes, design a program that will accept dimensions of a triangle or a


rectangle interactively and display the area.


Remember the two values given as input will be treated as lengths of two sides in the case of


rectangles and as base and height in the case of triangles and used as follows:


Area of rectangle = x * y Area of triangle = ½ * x * y


ECE-212 E Digital Electronics Lab.


L T P Sessional: 25 Marks


- - 3 Exam: 25 Marks


Total: 50 Marks


Duration of Exam: 3 Hrs.


LIST OF EXPERIMENTS


1. Study of TTL gates – AND, OR, NOT, NAND, NOR, EX-OR, EX-NOR.


2. Design & realize a given function using K-maps and verify its performance.


3. To verify the operation of multiplexer & Demultiplexer.


4. To verify the operation of comparator.


5. To verify the truth tables of S-R, J-K, T & D type flip flops.


6. To verify the operation of bi-directional shift register.


7. To design & verify the operation of 3-bit synchronous counter.


8. To design and verify the operation of synchronous UP/DOWN decade counter using J K flip-


flops & drive a seven-segment display using the same.


9. To design and verify the operation of asynchronous UP/DOWN decade counter using J K flip-


flops & drive a seven-segment display using the same.


10. To design & realize a sequence generator for a given sequence using J-K flip-flops.


11. Study of CMOS NAND & NOR gates and interfacing between TTL and CMOS gates.


12. Design a 4-bit shift-register and verify its operation . Verify the operation of a ring counter


and a Johnson counter.


Note : At least ten experiments are to be performed, atleast seven experiments should be


performed from above list. 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.


ECE-218 E Microprocessors and Interfacing Lab.


L T P Sessional: 25 Marks


- - 3 Exam: 25 Marks


Total: 50 Marks


Duration of Exam: 3 Hrs.


LIST OF EXPERIMENTS


1. Study of 8085 Microprocessor kit.


2. Write a program using 8085 and verify for :


a. addition of two 8-bit numbers.


b. addition of two 8-bit numbers (with carry).


3. Write a program using 8085 and verify for :


a. 8-bit subtraction (display borrow)


b. 16-bit subtraction (display borrow )


4. Write a program using 8085 for multiplication of two 8- bit numbers by repeated addition method. Check for minimum number of additions and test for typical data.


5. Write a program using 8085 for multiplication of two 8- bit numbers by bit rotation method and verify.


6. Write a program using 8085 for division of two 8- bit numbers by repeated subtraction method and test for typical data.


7. Write a program using 8085 for dividing two 8- bit numbers by bit rotation method and test for typical data.


8. Study of 8086 microprocessor kit


9. Write a program using 8086 for division of a defined double word (stored in a data segment) by another double word division and verify.


10. Write a program using 8086 for finding the square root of a given number and verify.


11. Write a program using 8086 for copying 12 bytes of data from source to destination and verify.


12. Write a program using 8086 and verify for:


a. Finding the largest number from an array.


b. Finding the smallest number from an array.


13. Write a program using 8086 for arranging an array of numbers in descending order and


verify.


14. Write a program using 8086 for arranging an array of numbers in ascending order and


verify.


15. Write a program for finding square of a number using look-up table and verify. .


16. Write a program to interface a two digit number using seven-segment LEDs. Use 8085/8086


microprocessor and 8255 PPI.


17. Write a program to control the operation of stepper motor using 8085/8086 microprocessor


and 8255 PPI.


Note: At least ten experiments have to be performed in the semester out of which seven experiments should be performed from above list. 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.


THIS SERVICE IS PRODUCED BY UNIQUE GROUP.www.uniqueinstitutes.org ,for job www.uniqueinstitutes.blogspot.com,
FOR FREE ADVERTISEMENT www.pathakadvertisement.blogspot.com

»»  read more

Read more...