This action might not be possible to undo. Are you sure you want to continue?
CSE-401 E L 3 T 1 P
Advanced Computer Architecture Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs.
Unit–1: Architecture And Machines: Some definition and terms, interpretation and microprogramming. The instruction set, Basic data types, Instructions, Addressing and Memory. Virtual to real mapping. Basic Instruction Timing. Unit–2: Time, Area And Instruction Sets: Time, cost-area, technology state of the Art, The Economics of a processor project: A study, Instruction sets, Professor Evaluation Matrix Unit-3: Cache Memory Notion: Basic Notion, Cache Organization, Cache Data, adjusting the data for cache organization, write policies, strategies for line replacement at miss time, Cache Environment, other types of Cache. Split I and D-Caches, on chip caches, Two level Caches, write assembly Cache, Cache references per instruction, technology dependent Cache considerations, virtual to real translation, overlapping the Tcycle in V-R Translation, studies. Design summary. Unit–4: Memory System Design: The physical memory, models of simple processor memory interaction, processor memory modeling using queuing theory, open, closed and mixed-queue models, waiting time, performance, and buffer size, review and selection of queueing models, processors with cache. Unit–5: Concurrent Processors: Vector Processors, Vector Memory, Multiple Issue Machines, Comparing vector and Multiple Issue processors. Shared Memory Multiprocessors: Basic issues, partitioning, synchronization and coherency, Type of shared Memory multiprocessors, Memory Coherence in shared Memory Multiprocessors. Text Book: • Advance computer architecture by Hwang & Briggs, 1993, TMH.
Reference Books: • Pipelined and Parallel processor design by Michael J. Fiynn – 1995, Narosa.
Eight questions will be set in all by the examiners taking at least one question from each unit. Students will be required to attempt five questions in all.
Log on to http://ululu.in for Free Engineering Sample Papers and Study Material | Ululu India
Pressman (5th edi). estimate efforts each activity. analyzing project characteristics. acceptance. Ramesh. Unit-3: Project Evaluation & Estimation: Cost benefit analysis. product versus process quality management. identifying project infrastructure. identifying project scope and objectives. identifying activity risk. selecting the right person for the job. the place of software quality in project planning. structured methods. Roger S. sequencing and scheduling activities. Walker Royce. TMH. managing risk. instruction in the best methods. organizational structures. the importance of software quality. categorizing SPs. • Project Management 2/c. TMH Reference Books: • Software Engineering – A Practitioner’s approach. choice of process model. reducing the risks. by Bob Hughes and Mike Cotterell. the nature of resources. Managing people and organizing terms: Introduction. adding the time dimension. motivation. project schedule. Practical software quality measures. representation of lagged activities.. Prototyping. change control. allocate resources. identifying project products and activities. requirement specification. further exercises. Monitoring the control: Introduction. external standards. selecting a project. contract management. Unit-2: Stepwise Project planning: Introduction. SP Vs.models. shortening project ..in CSE-403 E L 3 T 1 P Software Project Management Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. calculating the z values. 2001. typical terms of a contract. Addison Wesley. conclusion. backward and forward pass. MGH • Software Project Management. leadership. scheduling resources creating critical paths. ISO 9126. techniques to help enhance software quality. earned value. Selection of an appropriate project report. evaluating risks to the schedule. 2001. Unit-5: Resource allocation &Monitoring the control: Introduction. information and control in organization. spiral. placement. risk analysis. understanding behavior. becoming a team. project as a system. Choosing technologies.http://ululu. getting the project back to target. 1999. rapid application development. risk identification. creating the frame work. Albrecht function point analysis. Maylor • Managing Global software Projects. water fall-. decision making. stages in contract. V-process-. precedence networks. review/ publicize plan. activity throat.in for Free Engineering Sample Papers and Study Material | Ululu India . identifying critical path. 1998. prioritizing monitoring. cost schedules. working in groups. Unit-1: Introduction to Software Project Management (SPM): Definition of a Software Project (SP). risk evaluation. other types of projects activities covered by SPM. identifying resource requirements. management control. types of contract. network planning model. cost monitoring. Unit-8: Study of Any Software Project Management software: viz Project 2000 or equivalent Text Book: • Software Project Management (2nd Edition). projects and activities. the nature of risk. counting the cost. cost benefit evaluation techniques. delivery. Unit-6: Managing contracts and people: Introduction. being specific. 2 Log on to http://ululu. organizational behavior: a back ground. Unit-7: Software quality: Introduction. defining software quality. collecting the data. visualizing progress. Unit-4: Activity planning & Risk Management: Objectives of activity planning. the scheduling sequence. cash flow forecasting. publishing the resource schedule. Risk Management: Introduction.
in for Free Engineering Sample Papers and Study Material | Ululu India . 3 Log on to http://ululu.in Note: Eight questions will be set in all by the examiners taking at least one question from each unit.http://ululu. Students will be required to attempt five questions in all.
• System software by Dhamdae. trees. Unit–7: Symbol Table & Error Detection And Recovery: Symbol tables. Mc. quadruples and triples. three address code.D. linked lists. Compiler construction tools. AHO. A language specifying lexical analyzer. top down par sing. Implementation of lexical analyzer. Unit–6: Syntax Directed Translations: Syntax directed definition. design of lexical analyzer. semantic error. SLR.Alfread V. Students will be required to attempt five questions in all. predictive parsing. Unit–5: LR parsers. conversion from regular expression to finite automata. Errors. Kakde. • Compiler Design by O. Unit–2: Lexical Analysis: Role of lexical analyzer. minimizing number of states of DFA. 1995. Specification and recognition of tokens. syntax directed translation scheme.in CSE-405-E L P3 T Compiler Design Class Work: 50 Exam: 100 Total: 150 Duration of Exam: 3 Hrs. MGH. Narosa Publication Note: Eight questions will be set in all by the examiners taking at least one question from each unit. 1986.G. structure of compiler :its different phases. Reference Books: • Theory and practice of compiler writing. • Principles of compiler Design. 1 - Unit–1: Introduction To Compilers: Compilers and translators. syntactic phase error. construction of syntax trees. -1998Addison Wesley. 1985. and vice versa. implementation of syntax directed translation. Graw Hill. Ullman. input buffering. definition of parsing. LALR and Canonical LR parser. machine dependent code. Unit–8: Code Optimization & Code Generation: Code generation.in for Free Engineering Sample Papers and Study Material | Ululu India . arrays.http://ululu. optimization. its contents and data structure for symbol tables. lexical phase error. Tremblay & Sorenson. 4 Log on to http://ululu. hash tables. context free grammars. Laxmi Publ. Text Books: • Compilers Principle. forms of objects code. operator precedence parsing. Techniques & Tools .reduce parsing. register allocation for temporary and user defined variables. need of translators. Unit–4: Parsing Technique: Shift. Finite automata. regular expressions . Ravi Sethi & J. Unit–3: Syntax Analysis: Role of parsers.
2. Write a program to check whether a string belong to the grammar or not. 10. 5.e. Write a program to remove left factoring. 9. 1. 3. Write a program to find leading terminals. Write a program to find trailing terminals. Note : At least 10 programs are required to be developed in the semester. Write a program to check whether a grammar is left Recursion and remove left Recursion.E COMPILER DESIGN LAB L - - T 3 P Class Work: 25 Exam: 50 Total: 75 Duration of Exam: 3Hrs.in for Free Engineering Sample Papers and Study Material | Ululu India . To show all the operations of a stack.http://ululu. 7. 5 Log on to http://ululu. 8.in CSE-411. write and modify in a text file. 6. 11. To show various operations i. 12. 4. Write a program to check whether a grammar is operator precedent. Write a program to generate a parse tree. Practice of LEX/YACC of compiler writing. red. Write a program to compute FOLLOW of non-terminal. Write a program to compute FIRST of non-terminal.
NET. Write a program in VC++ to create archive class object from CFile class that reads and stores a simple structure (record). Create a DLL in VB.http://ululu.view architecture) VC++ Program and their relationship with each other. Create a simple database in MS Access Database /Oracle and a simple database application in VB that shows database connectivity through DAO and ADO. disabled and appended at run time. Create a simple database in MS Access Database and a simple database application in VC++ that shows database connectivity through ADO model. 4) 5) 6) 7) 8) 9) 10) 11) 12) 13) Bright 14) 15) 16) 17) 18) 6 Log on to http://ululu. If the user tries to draw more than 20 rectangles. Write a program in VB to create a notepad. Create an SDI application in VC++ that adds a popup menu to your application which uses File drop down menu attached with the menu bar as the pop-up menu. Get familiar with essential classes in a typical (Document. Find out their relationship with MFC classes. Appreciate how they are helpful in finding complexities of windows programming.in CSE-409 E L PVisual Programming Lab. Write a program in VC++ to create a static link library and a dynamic link library. students may do the following exercises: Write a program in VC++ to implement a simple calculator. The pop-up menu should be displayed on the right click of the mouse. Class Work: Exam: Total: Duration of 25 50 75 Exam: 3 Hrs.0.NET and Visual C++ 6. All the rectangles that are drawn should remain visible on the screen even if the window is refreshed. Create an SDI application in VC++ using which the user can draw atmost 20 rectangles in the client area. Write a program in VB to implement a simple calculator. Make an Active X control of your own using VB. 1) 2) 3) Study Windows API’s. With the help of VB. Rectangle should be drawn on the second click of the left mouse button out of the two consecutive clicks. Make an Active X control in VC++ derived from a standard control. Write a program in VC++ to implement serialization of inbuilt and user defined objects. Write a simple program that displays an appropriate message when the illegal operation is performed using error handling technique in VB.in for Free Engineering Sample Papers and Study Material | Ululu India .0. create an object of excel application and implement any action on it. 3 - T Study of Visual Basic 6. a message should get displayed in the client area that “ No more rectangles can be drawn” Create an application in VC++ that shows how menu items can be grayed.
Error back-propagation training. Delta learning rule for multi-perceptron layer.K. Widrow-Hoff learning rule. Basic Concepts of recurrent Auto associative memory: rentrieval algorithm. Hebbian learning rule.in CSE-407. 2002. storage algorithm. PHI. Unit-6: Associative memories: Linear Association. Reference Books: • “Neural Networks :A Comprehensive formulation”. winner-take-all learning. Initialisation of weights. • “Neural Network Fundamentals” – N. learning rules. Simon Haykin. algorithm. Kosko. Unit-3: Single layer Perception Classifier: Classification model. etc. perception learning rule.M. Architecture. delta learning rule. Unit-2: Fundamental concepts of Artificial Neural Networks: Models of ANNs. House.H Note: Eight questions will be set in all by the examiners taking at least one question from each unit. single layer continuous perceptron networks for linearlyseperable classifications. training & classification using discrete perceptron. Association encoding & decoding. Liang. 1992. Features & Decision regions. Jaico Publ. Feedforward & feedback networks. P. Winner –lake all elarning rule. T. 1994. 7 Log on to http://ululu. recall mode.E L T P Neural Networks Class Work: 50 4 - - Exam: Total: 100 150 Duration of Exam: 3 Hrs. learning factors. Students will be required to attempt five questions in all. correction learning rule. Unit-4: Multi-layer Feed forward Networks: linearly non-seperable pattern classification. By directional associative memory. Unit-7: Self organizing networks: UN supervised learning of clusters. 1998.in for Free Engineering Sample Papers and Study Material | Ululu India .http://ululu. AW • “Neural Networks”. Examples. Unit-1: Overview of biological neurons: Structure of biological neurons relevant to ANNs. Training & Examples. seperability limitations Text Books: • Introduction to artificial Neural systems by Jacek M. Hopfield networks. Stability. Generalized delta learning rule. Zurada. Bose . Unit-5: Single layer feed back Networks: Basic Concepts.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.