Welcome to my blog
go to my homepage
Go to homepage

Your Title

FILL THE FORM FOR ONLINE ADVERTISEMENT

You have the maximum number of forms in the free plan ( 5 forms ).

Name
Email Address
AD TITLE
YOUR AD
WEBSITE
CONTACT
Image Verification
Please enter the text from the image
[ Refresh Image ] [ What's This? ]

BTECH 7TH SEMESTER COMPUTER SCIENCE ENGG SYLLABUS KURUKSHETRA UNIVERSITY

Friday, April 16, 2010


Department Elective-II





1. CSE-441 Software Project Management


2. CSE-443 Embedded System Design


3. CSE-445 Artificial Intelligence


4. CSE-447 Image Processing


Departmental Elective-III


1. CSE-471 Unix & Linux Programming


2. CSE-473 Security & Cryptography


Compiler Design


CSE-401 Theory : 100


L T P Sessional : 25


4 1 -


Unit-1


Assemblers, linkers, loaders, compilers and translators, the structure of compiler, different states in the construction of a compiler, Design of lexical analyzer, Basic Parsing Techniques, Parsers, shift-reduce parsing, operator-precedence parsing, top-down parsing predictive parsers, L.R. Parsers, the canonical collection of L.R (O) items, construction of SLR parsing tables, construction canonical L.R. Parsing tables, Constructing LALR parsing tables implementation of L.R. Parsing tables.


Unit-2


Syntax-Directed Translation: Syntax-directed translation schemes, implementation of syntax directed translators, intermediate code, postfix notation, parse trees and syntax trees, three address code, quadruples, and triples, translation of assignment statements. Boolean expressions, control statements.


Symbol Labels


The contents of a symbol table data structures for symbol tables representing scope information.


Unit-3


Run time storage Administration : Implementation of a simple stack allocation scheme, implementation of block structured languages, storage allocation in block structured languages.


Error Detection and Recovery : Error, Lexical-phase errors, syntactic-phase errors, semantic errors.


Unit-4


Code Optimization: The Principle sources of optimization, loop optimization, the DAG representation of basic blocks, value number and algebraic laws, global dataflow analysis.


Code Generation: Object programs, problems in code generation, a machine model, a single code generator, register allocation and assignment, code generation from DAGs, peephole optimization.


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


Books :


1.


Aho A.V. and ullaman J.D.Principles of Compiler Design, Addison Wesley


2.


Donovan, j, System Programming, TMH


3.


D.M. Dhamdhere: Compiler Construction- Principles and practice Mc Milan India


4.


David Grics : Compiler Construction for digital computer


Web Engineering


CSE-403 Theory : 75


L T P Sessional : 25


3 1 -


Unit-1


Information Architecture : The role of information Architect, Collaboration and communication, Organizing information, organizational challenges, Organizing web sites and Intranets, Creating cohesive organization systems, designing navigation systems, types of navigation systems, Integrated navigation elements, designing elegant navigation systems, Searching systems, Searching your web site, designing the search interface, Indexing the right stuff, To search or not to search grouping content, conceptual design, High level Architecture Blueprint, Architectural Page Mockups, Design Sketches.


Unit-2


Dynamic HTML and Web Designing : HTML Basic concepts, Good web design, process of web publishing phases of web site development, STRUCTURE OF HTML documents, HTML elements-Core attributes, Language attributes, Core events, Block level events, Text level events, Linking basics, Linking in HTML, Images and Anchors, Anchor Attributes, Image maps, Semantic linking meta information, image preliminaries, Image download issues, Images and buttons, introduction to layout: Backgrounds, color and text, fonts, layout with tables, Advance layout: frames and layers, HTML and other media types. Audio support in browsers, video support, other binary formats. Style sheets, positioning with style sheets. Basic interactivity and HTML: FORM, form control, new and emerging form elements.


Unit-3


CGI Using PERL: Introduction to CGI, Alternative technologies, the Hypertext transport protocol , URLs, HTTP, Browser requests, Server responses, proxies, connects negotiation, the common gateway interface , the CGI environment, Environment variables, CGI output, forms and CGI, sending data to the server , form Tags ,Decoding from input, Architectural Guidelines ,Coding Guidelines Efficiency and optimization .


Unit –4


Java server pages : Basics, Integrating Scripts n JSPs, JSP object and components , comforting and troubleshooting, JSP : Request and response objects, retrieving the contents of an HTML format, retrieving a Query string, Working with Beans, Cookies, Creating and Reading Cookies, Using Application Objects and Events


XML : Relationship between HTML, SGML and XML, Basic XML, Valid documents, ways to use XML, XML for data files, embedding XML into HTML documents, Converting XML to HTML for Display, Displaying XML using CSS and XSL, rewriting HTML as XML, the future of XML.


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


BOOKS


1.


Thomas A Powell, HTML The Complete Reference, Tata McGraw Hill Publications.


2.


SCSEt Guelich, Shishir Gundavaram, Gunther Birzneik; CGI Programming with PERL 2/e, O’ Reilly.


3.


Doug Tidwell, James Snell, Pavel Kulchenko; Programming web services with SOAP, O’ Reilly.


4.


Pardi, XML in Action, Web Technology, PHI


5.


Yong, XML step by step, PHI


6.


Aaron, Weiss, Rebecca Taply, Kim Daniels, Stuven Mulder, Jeff Kaneshki, Web Authoring Desk reference. Techmedia publications


Statistical Models for Computer Science


CSE-405 Theory : 100


L T P Sessional : 25


4 1 -


Unit-1


Probability Models, Sample Space, Events, their algebra, graphical methods of representing events, Probability Axioms and their applications, Condition probability, Independence of Events, Bayes’ Rule and Bernoulli Trials.


Unit-2


Random variable, and their event space, probability mass function, Distribution functions, some discrete distributions (Bernoulli, Binomial, Geometric, Negative Binomial, Poisson, Hyper Geometric and Uniform), Probability Generating Function, Discrete random vectors. Continuous random variables: some continuous distributions (Exponential, Hyperexponential, Erlang, Gamma, Normal), Functions of random variables, jointly distributed random variables, Expectation, Expectation of functions of more than one random variable, Brief introduction to Conditional pmf: pdf and expectation, Moments and transforms of some distributions (Uniform, Bernoulli, Binomial, Geometric, Poisson, Exponential, Gamma, Normal), Computation of mean time to failure.


Unit –3


Stochastic Processes,Classification of stochastic processes,the Bernoulli process,the possion process,renewal process,renewal model of program behaviour


Unit-4


Markov Chains, Computation of n-step transition probabilities, Stat classification and limiting distributions, Distribution of times between state changes, Irreducible finite chains with aperiodic states, M/G/I queuing system, Discrete parameter Birth-Death processes, Analysis of program execution time. Continuous parameter Markov Chains, Birth-Death process with special cases, Non-Birth-Death Processes.


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


BOOKS


1.


K.S. Trivedi, Probability, Statistics with Reliability, Queuing and Computer Science Applications, PHI, 2001.


2.


J.F. Hayes Modeling of Computer Communication Networks, Khanna Publishing, Delhi


3.


W. Feller, An Introduction to Probability Theory and its applications. 2vols. Wiley Eastern, 1975


4.


L. Kleinroek, Queuing Systems, 2vols, John Wiley, 1976.


Unix & Linux Programming (Pr)


CSE-407 Theory : 50


L T P Sessional : 50


- - *1+2


1.


Familiarize with Unix/Linux logging/logout and simple commands.


2.


Familiarize with vi editor.


3.


Using Bash shell develop simple shell programs.


4.


develop advanced shell programs using grep, fgrep & egrep.


5.


Comile and debug various C programs using different options.


6.


learning of installation and upgradation of Linux operating system.


7.


Install, Linux on a PC having some other previously installed operating system. All Oss should be usable.


8.


As supervisor create and maintain user accounts, learn package installation, taking backups, creation of scripts for file and user management, creation of startup and shutdown scripts using at, cron etc.


Note: Atleast 5 to 10 more exercises are to be given by the teacher concerned.


Teacher are supposed to devote I period for giving instructions to clear the concepts UNIX & Linux and 2 periods for the lab work.


Web Engineering(pr.)


CSE-409 Theory : 25


L T P Sessional : 25


- - 2


1.


Chalk out the storyboard and design of Diary Food Limited. As the name reflects your site diary products and aims at opening an online store. Your story board should cover all the features that you plan to have on the site.


2.


Create your own page with your favorite hobbies.


3.


Create a menu or a table of content web page. Each menu item or section of the table of content should load a different web page. For example, if the user clicks on menu one or section I then the link should take him to respective menu html or section and so on.


4.


Create a web site for your college.


5.


Create a frameset that is divided into three sections. The frameset should have three zones.





The Topmost section of the frameset should take up about just 15% of the browser window. Name this frame title.





The middle section should be 70% of the browser window. Name this frame title.





The lower section should be 15% of the browser window. Name this frame menu. Crteate pages for each section. For the lowermost section, create page that loads the content into the middle section. The topmost section should contain a page describing the web page itself.


6.


Create a web page, which displays the map of your country Link, each city/state on the image map, such that the respective HTML page of the city/state is displayed when the user selects an area.


7.


Add the tickertape applet to your page by customizing it for the following settings:





Increase the count by one.





Accordingly update the message count.





Change the text color to (237, 192, 171)





Experiment with changing the scrolling speed.





Customize the message text as per your page requirement.


8.


Incorporate a quest book into the Diary Food Webpage and use Java Script to build validations into the form.


9.


Use Style sheet to modify the following:





Change background to modify the following.





Change font type, face and color.





Align Text.





Remove underlines from hyperlinks.


10. Use Microsoft’s Personal Web Server to set up your Website.


Software Project Management


CSE-441


(Departmental Elective II)


L T P Theory : 75


3 1 - Sessional : 50


Unit-1


Conventional Software Management : Evolution of software economics, Improving software economics: reducing product size, software processes, team effectiveness, automation through, Software environments, Principles of modem software management.


Unit-2


Software Management Process : Framework,: Life cycle phases- inception, elaboration, construction and training phase. Artifacts of the process- the artifact sets, management artifacts, engineering artifacts, and pragmatics artifacts, Model based software architectures, Workflows of the process, Checkpoints of the process.


Unit-3


Software Management Disciplines : Iterative process planning, Project organizations and responsibilities, Process automation, Project control and process instrumentation core metrics, management indicators, life cycle expectations, Process discriminates.


NOTE : There will be 8 questions in all. Two questions will be set from each unit.


Books


1.


Software Project Management, Walker Royee, Addison Wesley, 1998


2.


Project management 2/e, Maylor.


3.


Managing the Software Process, Humphrey.


4.


Managing Global Software Projects. Ramesh, TMfH, 2001


Embedded System Design


CSE-443


(Departmental Elective II)


L T P Theory : 75


3 1 - Sessional : 50


Unit-1


Introduction to an embedded systems and its design : Introduction to ES & its applications. Design parameters of an ES and its significance (with respect to all parameter), Present trends in ES, Embedded system design life cycle, product specifications and hardware, software partitioning, Co-design.


RTOS & its overview:


Spell of OS 2 difference between OS 2 RTOS, Role of RTOS in ES 2 its process models (Process transition diagram), Course structure, Overview Window, CE, Unix, Mino Kernnel, UCOs & RT linux, Interrupt Roatining in RTOS & Inblow response cycle, Different IPC machines in RTOS, Scheduling construm in RTOS (hand 2 soft), Memory sowing and its protechan, Encapsulation of Semephores and Queues, Timon in RTOS (Watch dog timer)


Unit-2


Processor Selection : Role of processor selection in ES (MP V/s Uc), Mino control-8051, 16232 bit mino controller 2 its processor, More about micro controller applications with respect to embedded system design, DSP’s in ES, New trends in processing and DSP’s.


Cost Compiler and cross assembly for embedded systems


Why we need cross compiler/ Assemble, Embedded software development take chain and software development tool chain, Compiler linker, locators, cross assembles, GCC compiler.


Unit-3


Basic Concepts of Device Driving : Device drives introduction & how device are different from the normal ports, Sevical Communication enterface device drivers.


System Synthesis and Debugging Techniques:


Introduction to system synthesis & Hardware and Software, Biomulation & methods to improve to speed of simulations, Emulators (ICE) and its type, How emolutors an difference for simulations, Introduction JTAG and OCP (on chich and debugging)


Unit-4


Communication Protocols with reference to ES: Introduction to protocol, why we need in Es, Overview TCP(IP), UDD< wings protocols, IrDA, Blue Box, IEEE 8811


Other design issues and current trends on its application of ES


Memory optimization, Poorer optimization. Co-similation of its system on chip and SOS (System on Slices), Revision of Cost


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


Books


1.


John Catosulis, “Designing Embedded Hardware”, O’ reilly


2.


An Embedded Software Primer”, David E. Simon, Pearson Education


3.


Frank Vahid, Tony Givargis, “Embedded System Design” John Wiley & Sons, Inc


4.


Karim Yaghmour, “Building Embedded Linux System”, O’reilly


5.


Michael Barr, “Programming Embedded Systems”, O’reilly.


6.


Aian C. Shaw, “Real-time system & Software”, John Wiley & sons, Inc.


7.


Wayne Wolf, “Computers as Components”, Harcourt India Pvt. Ltd.


Artificial Intelligence


CSE-445


(Departmental Elective II)


L T P Theory : 75


3 1 - Sessional : 50


Unit-1


Introduction: Definition of Artificial Intelligence (AI), Evolution of Computing History of AI, Classical Romantic and modern period, Subject area, Architecture of AI machines, logic family, classification of logic.


Production System: Production rules, the working memory, Recognize-act cycle, conflict resolution by meta rules, Architecture of production system.


Unit-2


Propositional Logic: Proposition, tautologies, Theorem proving, Semantic method of theorem proving, forward chaining, backward chaining standard theorems, method of substitution, Theorem proving using Wang’s algorithm.


Predicate Logic: Alphabet of first order logic(FOL), predicate, well formed formula, clause form, algorithm for writing sentence into clause form, Unification of predicates, unification algorithm, resolution Robinson’s interface rule, Scene interpretation using predicate logic.


Unit-3


Default and Non monotonic Logic: Axiomatic theory, Monotonicity, non-atomic reasoning using McDermott’s NML-I, problems with NML-I, reasoning with NML-II, Case study of Truth Maintenance System(TMS), neural network fundamentals.


Imprecision and Uncertainty: Definition, Probabilistic techniques, Certainty factor based reasoning, conditional probability, Medical diagnosis problem, Baye’s Theorem and its limitations, Bayesian belief network, propagation of belief, Dumpster-Shafer theory of uncertainty management, belief interval, Fuzzy relation, inverse Fuzzy relations, Fuzzy post inverse, Fuzzy Inversion,


Unit-4


Intelligent Search Techniques: Heuristic function, AND-OR graph, OR Graph, Heuristic search, A* algorithm and examples.


Logic Programming with Prolog: Logic program, Horn clause, program for scene interpretation, unification of goals, SLD resolution, SLD tree, flow of satisfaction, controlling back track using CUT, Command use of CUT, implementation of backtracking using stack, risk of using cuts, fail predicate, application of cut-fail combination, replacing cut-fail by not.


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


Books


1.


A.Konar: Artificial Intelligence and Soft Computing-Behavioral and Cognitive Modeling of Human Brain, CRC Press, USA.


2.


E. Charniak and D.McDermott: Introduction to Artificial Intelligence, Addison Welley Longman.


3.


Rich and Knight: Artificial Intelligence, 2/e 1992


Image Processing


CSE-447


(Departmental Elective II)


L T P Theory : 75


3 1 - Sessional : 50


Unit-1


Image Processing Fourier Transform and Z-Transform, Causality and Stability, Toeplit and Circulate Metrics, orthogonal and unitary Matrices and Kroenker product, Markov Processes KI Transform Mean Square Estimates and Orthogonal Principles.


Image Sampling quantization, Band Limited Image Sampling Versus Replication, Reconstruction of image from samples Sampling Theorem, Sampling Theorem for Random Fields, Sampling Optimal Sampling, Nonrectangular Grid Sampling, Sampling Aperture, Display Aperture/Interpolation Functions, Lang range Interpolation, Moire Effect, Image Quantization Uniform Optimal Quantizer, Properties of Mean Square Quantizer, Commands Design Visual Quantization.


Unit-2


Image Transforms: Two Dimensional Orthogonal and Unitary Transforms and their properties. One Dimensional and Two Dimensional DFT Cosine and Sine Transforms Iiadmard, slant, IIARR and KI, Transforms and their properties, Approximation to KI Transforms. Image representation by stochastic model, One Dimensional Causal Models, AR and ARMA models, Non Causal Representation Spectral factorization, Image Decomposition


Unit-3


Image Enhancement and Restoration: Point Operation, Histogram Modeling, Spatial Operations, Transform Operations. MultiSpeciral Image Enhancement. Image Observation Models, Inverse and Wiener Filtering FIR wiener Filters, Filtering using Image Transform Casual Models and recursive filtering Maximum entropy restoration. Extrapolation of band limited signal.


Unit-4


Image Analysis and Image Compression: Spatial feature extraction, Edge detection and boundary extraction boundary, region and moment representations structures, Texture, Image Segmentation, Reconstruction from Projections, Pixel Coding, Productive Techniques, Transform Coding Theory, Coding of Image, Coding of two-tone image.


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.


Anil Jain: Digital Image Processing


2.


Gonzalez Woods: Image Processing


Unix & Linux Programming


CSE-471


(Departmental Elective - III)


L T P Theory : 75


3 1 - Sessional : 25


Unit-1


Linux Startup: User accounts, accessing Linux – starting and shutting processes, Logging in and Logging out, Command Line, simple commands.


Shell Programming: Unix file system: Linux/Unix files, I-nodes and structure and file system related commands, Shell as command processor, shell variables, creating command substitution, scripts, functions, conditionals, loops, customizing environment.


Unit-2


Regular Expressions and Filters: Introducing regular expressions patterns, syntax, character classes, quantifiers, introduction to egrep, sed, programming with awk and perl.


Unit-3


The C Environment: The C compiler, vi editor, compiler options, managing projects, memory management, use of makefiles, dependency calculations, memory management – dynamic and static memory, building and using static and dynamic libraries, using ldd, soname, dynamic loader, debugging with gdb.


Unit-4


Processes in Linux : Processes, starting and stopping processes, initialization processes, re and init files, job control – at, batch, cron, time, network files, security, privileges, authentication, password administration, archiving, Signals and signal handlers, Linux I/O system.


Note:- There will be 8 questions an 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.


John Goerzen: Linux Programming Bible, IDG Books, New Delhi, 2000.


2.


Sumitabha Das: Your Unix – The Ultimate Guide, TMH, 2000.


3.


Mathew Professional Linux Programming, vol. 1 & 2, Wrox-Shroff, 2001.


4.


Welsh & Kaufimanm Running Linux, O’Relley & Associates, 2000.


Security and Cryptography


CSE-473 Theory : 75


L T P Sessional : 50


3 1 -


Unit-1


Traditional Cryptography: Crypto analysis, substitution and transposition ciphers, eryptographic principles, secret-key algorithms: DES, DES chaining, Breaking DES, IDEA, Differential and Linear crypto analysis Public-key algorithms: RSA, Knapsack.


Unit-2


Authentication protocols: KDC protocols, shared secret key, Diffle-Hellman key exchange, Needham-n Schroeder protocol, Using Kerbros, interlock protocol, digital signatures-Secret key and public key signatures, DSS, message digest, MD5 and Secure Hash algorithms.


Unit-3


Computer security Mechanisms: Role of different security mechanisms, passwords-technology and administration, principles of database system security, epidemic of viruses: types of viruses, study of different virus codes, means of spread, prevention from virus. Life cycle of a virus, immunization, Trojan horse and bombs with examples, writing antivirus/ Trojan codes.


Unit-4


Network security: Basics, Security Function, preventing loss and damage, securing local area network-authorization, security plan and policy, Securing enterprise network-setting priorities, Security plans, securing network components, hardware security, levels of access control and authorization.


Note:- There will be 8 questions an 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.


Richard H.Backer, Network Security, Mcgraw Hill International Ed. 1996


2.


D.Schneier, Applied Cryptography, John Wiley, New York, 1996


3.


C.Kaufman et. AI, Network Security, Prentice Hall International, 1998




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 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...
Related Posts with Thumbnails

FREE BANNER

Business Affiliate ProgramsOffersPersonalsAdvertisingShopping
Locations of visitors to this page

hr

Website Designing India
H K Digital Online is the Online Marketing Company provide creative Website design, SEO Services,Website Development, Software Development, Multimedia Solutions, Networking Solutions, Print Designing and Web Hosting needs in India.

plazzo

RSS Search

ad

Advertising

bloglistist

Bloglisting.net - The internets fastest growing blog directory

  © Blogger template The Professional Template II by Ourblogtemplates.com 2009

Add to myAOL

Back to TOP  

Top Blogs