Principles of Analog and Digital
Circuits (PADC) |
|||
N.B: | (1) | Question no 1 is compulsory. | |
(2) | Attempt any three questions from remaining questions. | ||
(3) | Assume suitable data wherever required. | ||
1. | (a) | Explain Friis transmission formula. | |
(b) | What are the energy signal and power signals. | ||
(c) | Explain ASK system. | ||
(d) | Compare pcm and delta modulation. | ||
2. | (a) | Explain the operating principle, working of transmitter and receiver of BPSK system. | |
(b) | An amplitude modulated ware form has a form. Xc(t) = 10 (1 + 0.6 Cos2000 ∏ + 0.4 Cos400 ∏ ) Cos2000∏) (i) Sketch the amplitude spectrum of Xe(t) (ii) Find the power content of each spectral component including currier. (iii) Find total power and sideband power. (iv) What is modulation index. |
||
3. | (a) | What is meant by sensitivity of a receiver and How it is improved . | |
(b) | Find the mathematical expression of FM signal. | ||
4. | (a) | State and prove the sampling theorem for low pass and limited signal. Explain aliasing error. | |
(b) | Explain the working of foster seeley discriminator with neat ckt diagram and pharos diagram. | ||
5. | (a) | What is meant byt sensitivity of a radio receiver and how it is imporved. | |
(b) | What are the advantages of QPSK system. | ||
(c) | Compare analog and digital communication system. | ||
6. | (a) | What are advantages and dis-advantages of digital command also draw block diagram of pcm and explain it. | |
(b) | Explain the following in relation of radio receiver (i) Selectivity (ii) Sensitive (iii) Double spotting. |
Monday, June 30, 2014
Principles of Analog and Digital Circuits (PADC) Semester 3 (3 Hours) May 2014
Saturday, June 28, 2014
Object Oriented Software Engineering (OOSE) Semester 6 (3 Hours) December 2013
Object Oriented Software Engineering (OOSE) |
|||
LJ-11473 |
|||
N.B: | (1) | Question no 1 is compulsory. | |
(2) | Out of remaining six questions, attempt any four questions. | ||
(3) | Assume suitable data wherever required. | ||
1. | (a) | For construction company software is to be
developed with following specification :- Company undertakes many
projects each project is at particular location. Each project is
supervised by project manager, assigned by COE of the company. Record
related to start of the project, completion of it is maintained. Under
each PM there is a team of people of different category like designer,
plumber, electrician, Architect, labour etc. Each project is marketed by
team of Marketing Executives. (i) Draw class diagram for it (ii) Draw use-case diagram. |
10 |
(b) | Explain agile process with its advantages. Explain any one agile process. | 10 | |
2. | (a) | How to map following associations to code?
(i) Realization of unidirectional one-to-one associations. (ii) Bidirectional on-to-many associations (iii) Bidirectional on-to-many associations. (iv) Generalization. |
10 |
(b) | Explain coupling and choesion types in detail. | 10 | |
3. | (a) | Why FTR is necessary? How FTR is conducted? | 10 |
(b) | Explain version control and change control with the help of suitable example. | 10 | |
4. | (a) | What is sequence diagram? What are the elements used in Sequence diagram, explain each. | 10 |
(b) | Explain Integration and Regression Testing. | 10 | |
5. | (a) | Explain Singleton Pattern in detail. | 10 |
(b) | Explain the following with suitable examples
:- Composition, Association, Generalization, Aggregation. |
10 | |
6. | (a) | Explain Function Point based Metrices. | 10 |
(b) | Draw the activity diagram of ATM activities. | 10 | |
7. | Write short notes (any two) :- | 20 | |
(a) | CMM levels. | ||
(b) | Task Network and Timeline Chart | ||
(c) | Change Control. |
Friday, June 27, 2014
DATA WAREHOUSE AND DATA MINING (DWDM) DECEMBER 2011 COMPUTER SCIENCE SEMESTER 6
1. (a) | What is dimentional modeling ? Explain in detail. | 10 |
(b) | What is datamining ? What are techniques and applications of datamining ? | 10 |
Explain the architecture of typical datamining system. | ||
2. (a) | Explain how Apriori algorithm is useful in identifying frquent item set ? | 10 |
(b) | Explain major factors related to performance of DT based datamining | 10 |
techniques. | ||
3. (a) | Explain in detail HITS algorithm. | 10 |
(b) | Explain Architecture of data warehouse. | 10 |
4. (a) | Design Star Schema for autosales analysis of the company. | 10 |
(b) | Explain the techniques for web structure mining. | 10 |
5. (a) | Explain Snowflake Schema with example. | 10 |
(b) | Explain in detail metadata and its various types. | 10 |
6. (a) | Explain ID3 algorithm. What are the pros and cones of it ? | 10 |
(b) | Explain ETL of data warehousing in detail. | 10 |
7. | Write short notes on:- | |
(a) Similarity and distance measures in datamining | 10 | |
(b) Advanced Association rules. | 10 |
OBJECT ORIENTED SOFTWARE ENGINEERING (OOSE), B.E. Computer Science (CS), Semester 6, May 2013.
N. B.: (1) Question no 1 is compulsory.
(2) Attempt any four questions out of the remaining six questions.
(3) Figure to the right indicates full marks.
1. Consider the following online shopping portal: - ---- (20 Marks)
A customer visits the online shopping portal. A customer may buy item or just visit the page and logout. The customer can select a segment, then a category and brand to get different products in the desired brand.
The customer can select product for purchasing. The process can be repeated for more items. Once the customer finishes selecting the products, the cart can be viewed. If the customer wants to edit the final cart it can be done here. For final payment the customer has to login the portal. If the customer is visiting for the first time he must register with the site, else the customer must use the login page to proceed.
Final cart is submitted for payment and card details and address are to be confirmed by the customer. Customer is confirmed with a shipment ID delivery of goods within 15 Days. Draw a detailed class diagram and use case diagram for the above case study.
2. (a) “Requirements are Fixed” Which model will you prefer and why? --- (5 Marks)
(b) Write the advantages of PERT chart. ---- (5 Marks)
(c) Explain COCOMO used for software estimation. --- (5 Marks)
(d) Explain Task Network. --- (5 Marks)
3. (a) What is an analysis model? List the objects of analysis model? How do you identify these objects? --- (10 Marks)
(b) Explain Agile process with its advantages. Explain any one Agile process model. --- (10 Marks)
4. (a) How to map following associations to code? ---- (10 Marks)
(i) Realization of unidirectional one-to-one associations
(ii) Bidirectional one-to-one associations
(iii) Bidirectional one-to-many associations
(iv) Generalisation.
(b) Explain the object oriented testing strategies. ---- (10 Marks)
5. (a) Draw an activity diagram from any one scenario of Airline reservation system. --- (10 Marks)
(b) Explain coupling and cohesion. How are the concepts of coupling and cohesion useful in arriving at good software design? ---- (10 Marks)
6. (a) What is software quality Assurance? Explain different quality matrices. ---- (10 Marks)
(b) What is need of software maintenance? Explain types of software maintenance. --- (10 Marks)
7. Write short notes on any two: --- (20 Marks)
(a) Software configuration management
(b) Project scheduling and Tracking
(c) Software Architectural styles.
OBJECT ORIENTED SOFTWARE ENGINEERING (OOSE), B.E. Computer Science (CS), Semester 6, December 2012.
N. B.: (1) Question no 1 is compulsory.
(2) Attempt any four questions out of the remaining six questions.
(3) Assume suitable if necessary.
1. Consider the problem statement of Online Railway Reservation System:
(a) Draw Use Case Diagram ------ (6 Marks)
(b) Draw Activity Diagram for Make Reservation ------ (8 Marks)
(c) Draw Class Diagram ------ (6 Marks)
2. (a) What are the different types of maintenance and also explain steps for creating a maintenance log? --- (10 Marks)
(b) What are the objectives of testing? Explain black box testing a unit testing. --- (10 Marks)
3. (a) Explain how project scheduling and tracking is done for software projects. --- (10 Marks)
(b) Describe COCOMO model in detail. ---- (10 Marks)
4. (a) Why FTR is necessary? How FTR is conducted? ---- (10 Marks)
(b) What do you mean by requirements? Explain Functional and Non – Functional Requirements in detail. ---- (10 Marks)
5. (a) Explain version control and change control with the help of suitable example. --- (10 Marks)
(b) Explain Open Source Software Life Cycle. --- (10 Marks)
6. (a) Discuss waterfall and Spiral Model of Software developments with merits and demerits. ---- (10 Marks)
(b) What is an Agile Process? Explain any one Agile Process in detail. ---- (10 Marks)
7. Write short note on any two: ---- (20 Marks)
(a) Types of Maintenance
(b) Risk Management
(c) Beta Testing and Regression Testing.
DATA WAREHOUSE AND DATA MINING (DWDM) MAY 2010 COMPUTER SCIENCE SEMESTER 6
DATA WAREHOUSE AND DATA MINING (DWDM) MAY 2010 COMPUTER SCIENCE SEMESTER 6
Con. 3881-10. (REVISED COURSE) AN-4472(3 Hours) [Total Marks :- 100]
N.B. (1) Question No.1 is compulsory.
(2) Attempt any four questions out of remaining six questions.
1. (a) Define Data Warehouse. Explain the architecture of data warehouse with suitable block
diagram. [10 Marks]
(b) Explain data mining as a step in KDD. Give the architecture of typical DM system. [10 Marks]
2. (a) How are top-down and bottom up approaches of building data warehouse differ? Discuss the
merits and limitation of each approach. [10 Marks]
(b) What is K-means clustering? Confer the K-means algorithm with the following data for two
clusters. Data set {10, 4, 2, 12, 3, 20, 30, 11, 25, 31}[10 Marks]
3. (a) Give information package for recording information requirement for"Hotel Occupancy"
considering dimensions like time, Hotel etc. Design star schema from the information
package. [10 Marks]
(b) Explain HITS algorithm. [10 Marks]
4. (a) What is classification? What are the issues in classification? Apply statistical based algorithm
to obtain the actual probabilities of each event to classify the new tuple as a tall. Use the
following data. [10 Marks]
(b) Define Metadata. What are the different types of metadata stored in a data warehouse?
Illustrate with a simple customer sales data warehouse. [10 Marks]
5. (a) What is Clustering Techniques? Discuss the Agglomerative algorithm using following data and
plot a Dendrogram using single link approach. The following figure contains sample data
items the distance between the elements:- [10 Marks]
(b) All electronics company have sales department sales consider three dimensions
namely. [10 Marks]
(i) Time (ii) Product (iii) Store
The schema contain a central fact table sales with to measures.
(i) dollars-cost and (ii) units-sold
Using the above example describe the following OLAP operations: -
(i) Dice (ii) Slice (iii) Roll-up (iv) Drill-down
6. (a) Explain ETL of data warehousing in detail. [10 Marks]
(b) Consider the following transactions:- [10 Marks]
Apply the Apriori Algorithm with minimum support of 30% and minimum confidence of 75%
and find the large item set L. [10 Marks]
7. Write short notes on any four:- [20 Marks]
(a) Trends in data warehousing
(b) Decision Tree based classification approach.
(c) Key restructuring
(d) Crawlers
(e) Web personlization.
Information Theory and Coding (ITC) Semester 4 (3 Hours) May 2014
Information Theory and Coding (ITC) |
|||
NP-19886 |
|||
N.B: | (1) | Question no 1 is compulsory. | |
(2) | Solve any three questions out of the remaining questions. | ||
1. | (a) | Explain the physical significance of Entropy in information theory | 02 |
(b) | What is compression? List different Compression algorithms. | 03 | |
(c) | Describe Fermat's Little Theorem. | 03 | |
(d) | Find the generator and parity check matrices of a (7, 4) cyclic code with generator polynomial g (X) = 1 + X + X3. | 03 | |
(e) | What is Random Number Generation and when it is needed. | 03 | |
(f) | What are the security goals? Define Cryptography. | 03 | |
(g) | Write about Convolution Codes. | 03 | |
2. | (a) | Name the source coding techniques used in
the following types of files and classify them ad lossy or lossless. (i) .zip (ii) .jpg (iii) .mpg (iv) .bmp (v) .gif |
10 |
(b) | Define generator and parity check matrices of a (7, 4) linear block code. Explain how to generate a linear block code using G-matrix. Explain with example. | 10 | |
3. | (a) | Describe about Discrete probability and logarithms. | 10 |
(b) | Given Xi = {X1, X2, X3, X4, X5, X6}
with probability as below: p(Xi) = {0.3, 0.25, 0.2, 0.12, 0.08, 0.05}. Make Huffman code. Find efficiency of this code. |
10 | |
4. | (a) | What do you mean by Symmetric key cryptography? Explain DES in detail. | 10 |
(b) | A (7, 4) cyclic code has a generator polynomial: g(X) =
X3 + X + 1. (i) Draw the block diagram of encoder and syndrome calculator. (ii) Find generator and parity check matrices in systematic form. |
10 | |
5. | (a) | Describe with example Modular Arithmetic, Exponentiation and Congruencies. | 10 |
(b) | Explain Diffie-Hellman Algorithm. Which attack, is it vulnerable to? | 10 | |
6. | Write short notes on :- | 20 | |
(a) | Types of Entropy | ||
(b) | Digital Signature | ||
(c) | RLF | ||
(d) | Prime Number Generation |
Thursday, June 26, 2014
Web Programming (WP) Semester 4 (3 Hours) May 2014
Web Programming (WP) |
|||
NP-19851 |
|||
N.B: | (1) | Question no 1 is compulsory. | |
(2) | Write any three questions out of remaining. | ||
(3) | Assume suitable data if required. | ||
1. | (a) | Differentiate between GET and POST | 05 |
(b) | Explain issues in web designing. | 05 | |
(c) | Explain PHP string functions. | 05 | |
(d) | Explain XMD DTD. | 05 | |
2. | (a) | Write Javascript program to change background colour continuously. | 10 |
(b) | What is CSS? Explain the ways by which CSS is included in HTML. | 10 | |
3. | (a) | Explain page life cycle of JSP application. | 10 |
(b) | Write an ASP.NET program to insert a new record in database. | 10 | |
4. | (a) | What is XML and XSLT? Explain which an example. | 05 |
(b) | Write a HTML code to illustrate use of table and lists | 05 | |
(c) | What is session tracking? What are the ways to do session tracking? how session tracking is done in PHP. | 10 | |
5. | (a) | Write a JSP program to display todays date. | 05 |
(b) | Explain JavaScript objects Window and Document. | 10 | |
(c) | What is JQUERY ? Illustrate the use of JQUERY with a program. | 05 | |
6. | (a) | List various events on various HTML elements and explain Event handling in JavaScript with example. | 10 |
(b) | Explain ADO.NET with example. | 10 |
OBJECT ORIENTED SOFTWARE ENGINEERING (OOSE), B.E. Computer Science (CS), Semester 6, May 2012.
1. For Hospital Management Information System: --- (20 Marks)
(a) Write down the functional and non- functional requirement.
(b) Drew Use Case Diagram
(c) Draw Class Diagram.
2. (a) Realized Inheritance to database table for the given model. --- (12 Marks)
(1) Do Vertical Mapping
(2) Do Horizontal Mapping
(3) Advantage and Trade-off between these two methods.
(b) Following is the Bidirectional many- to- many association – Object design model before transformation. ---- (8 Marks)
Write java code after transformation for Mapping Association.
3. (a) Explain in detail about different levels of CMM with their characteristics. --- (10 Marks)
(b) Explain all phases of the SDLC. ---- (10 Marks)
4. (a) Explain with an example Cohesion and Coupling. ---- (10 Marks)
(b) Explain in detail RAD software life cycle model. ---- (10 Marks)
5. (a) Explain and compare FTR and Walkthrough. --- (10 Marks)
(b) What is SCM? Explain in detail Software Configuration Item identification. --- (10 Marks)
6. (a) Compare Forward Engineering, Reverse Engineering and Re – Engineering. ---- (10 Marks)
(b) Explain in detail COCOMO model. ---- (10 Marks)
7. Write short notes on any two: ---- (20 Marks)
(a) Integration Testing
(b) Types of Maintenance
(c) Design Pattern
(d) Risk Management.
OBJECT ORIENTED SOFTWARE ENGINEERING (OOSE), B.E. Computer Science (CS), Semester 6, December 2011.
N. B.: (1) Question no 1 is compulsory.
(2) Attempt any four questions out of the remaining six questions.
1. (a) Draw the detailed class diagram for the following scenario:- --- (10 Marks)
A product is to be installed to control elevators in a building with m floors. The problem concerns the logic required to move elevators between floors according to the following constraints.
Each elevator has a set of m buttons, one for each floor. These illuminates when pressed & cause the elevator to visit the corresponding floor. The illumination is cancelled when the elevator visit the corresponding floor.
Each floor except the first floor & top floor has two buttons, one to request the up elevator and one to request the down elevator. These buttons illuminate when pressed. The illumination is cancelled when an elevator visits the floor & then moves in the desired direction.
(b) Explain COCOMO model used for software estimation. --- (10 Marks)
2. (a) Explain the following with suitable example: --- (10 Marks)
Aggregation, Generalization, Association, Role, Dependency.
(b) What is sequence diagram? What are the elements used in sequence diagram, explain each. --- (10 Marks)
3. (a) Explain coupling & cohesion. Explain different types of coupling and cohesion. --- (10 Marks)
(b) Explain how to map different types of association and generalization relationship to code. --- (10 Marks)
4. (a) Construct an Activity Diagram for processing the mortgage requests. --- (10 Marks)
(b) Explain RAD and Spiral Model for Software development. --- (10 Marks)
5. (a) What is requirement ? Explain the different types of requirements in detail. --- (10 Marks)
(b) Explain debugging process in details. --- (10 Marks)
6. (a) Explain version control and change control. --- (10 Marks)
(b) Explain Reverse & Re- Engineering. ---- (10 Marks)
7. Write short notes on any two: --- (20 Marks)
(a) Types of Maintenance
(b) Regression Testing
(c) Task Network and Timeline Chart.
DATA WAREHOUSE AND DATA MINING (DWDM) DECEMBER 2013 COMPUTER SCIENCE SEMESTER 6
Con. 9243-13. LJ-11650
(3 Hours) [Total Marks : 100]
N.B.: (1) Question No. 1 is compulsory.
(2) Answer any four questions out of remaining six questions.
(3) Assume data if required, and state clearly.
Q1. (A) | What is a Data ware house? Explain the three tire architecture of Data Ware | 10 |
(B) | Explain Data mining as a step in KDD. Explain the architecture of a typical DM | 10 |
system. | ||
Q2. (A) | What is meant by market-basket analysis? Explain with an example. State and | 10 |
explain with formula the meaning of following terms | ||
(i) Support (ii) Confidence | ||
(iii) Iceberg Queries | ||
Hence explain how to mine multilevel Association rules from transaction datavases, with | ||
examples. | ||
(B) | What is meant by Web Mining? Explain any one Web mining Algorithm. | 10 |
Q3. (A) | All Electronic company have department sales, consider three dimensions | 10 |
namely | ||
(i) Time (ii) Product (iii) Store | ||
The schema contains central fact table sales with two measures | ||
(i) Dollars-cost and (ii) Units-sold | ||
Using the above example, describe the following OLAP operations | ||
(i) Dice (ii) Slice (iii) Roll-up (iv) Drill-Down | ||
(B) | Explain ETL (Extract Transform Load) cycle in a Data Warehouse in detail | 10 |
Q4. (A) | Compare between OLAP and OLTP | 10 |
(B) | Explain in detail the HITS Algorithm | 10 |
Q5. (A) | What is meant by information package Diagram, For recording the information | 10 |
requirements for "Hotel Occupancy" having dimensions like time, hotel etc., give the | ||
information package diagram for the same, also draw the star schema and snowflake | ||
schema | ||
(B) | Consider the following transactions:- | 10 |
Apply the Apriori Algorithm with minimum support of 30% and minimum confidence of 75 | ||
and find the large item set L | ||
Q6. (A) | Give five examples of application that can use clustering. Describe any one clustering | 10 |
algorithm with an example. | ||
(B) | What is meant by meta data? Explain with example. Explain the different types of | 10 |
meta data stored in a data ware house. Illustrate with examples. | ||
Q7. | Write short Notes on (any Two) | 20 |
(a) Web personalization | ||
(b) Decision Tree based classification Approach | ||
(c) Trens in Data Ware Housing | ||
(d) Attribute Oriented Induction |
System Programming and Compiler Construction (SPCC) Semester 6 (Revised Course) (3 Hours) December 2013
System Programming and Compiler
Construction (SPCC) |
|||
LJ-11568 |
|||
N.B: | (1) | Question No. 1 is compulsory. | |
(2) | Attempt any four from the remaining. | ||
(3) | Assume suitable data if wherever necessary. | ||
1. | (a) | Differentiate between a system program and an application program with example. | 05 |
(b) | Explain the different ways of parameter passing in macros. | 05 | |
(c) | What are the different error handling techniques used in a compiler. | 05 | |
(d) | Explain the various function of a loader. | 05 | |
2. | (a) | Explain the working of single pass assembles. Show the structure of its database used. | 10 |
(b) | Differentiate Top-Down and Bottom-up passing techniques. Explain shift-reduce passes in detail. | 10 | |
3. | (a) | Explain the working of Direct Linking Loader with neat flow charts. | 10 |
(b) | Explain the different code optimization techniques in compiler design. | 10 | |
4. | (a) | What do you mean by ambiguity in grammar? How will you remove ambiguity from a grammar? use suitable examples. | 10 |
(b) | Show whether the following grammar is LL (1). Construct
the passing table. S → AB / y Da A → ab / c B → dC C → yC / y D → xD/y |
10 | |
5. | (a) | What is binding? Explain static and dynamic binding. | 10 |
(b) | Explain the features of JAVA Compiter Environment. | 10 | |
6. | (a) | Explain syntax directed translation. Give the syntax directed translation equations. for infix to prefix conversion. | 10 |
(b) | With examples explain the different forms of intermediate code generated. | 10 | |
7. | Write short notes on (any two) :- | 20 | |
(a) | Compiler - compiter | ||
(b) | Finite automata | ||
(c) | SPARC assembler | ||
(d) | Garbage collection and compaction. |
System Programming and Compiler Construction (SPCC) Semester 6 (Revised Course) (3 Hours) May 2013
System Programming and Compiler
Construction (SPCC) |
|||||
GS-1078 |
|||||
N.B: | (1) | Question No. 1 is compulsory. | |||
(2) | Attempt any four questions out of remaining six questions. | ||||
(3) | Assume suitable data if necessary and justify the same. | ||||
(4) | Figures to right indicate full marks. | ||||
1. | (a) | Differentiate between Application program
and system program. Indicate the order in which following system program
are used, from developing program upto its execution. Assemblers, loaders, linker, microprocessor, Compiler, editor. |
05 | ||
(b) | Eliminate left recursion present in following grammar
(Remove Direct and Indirect recursion both) S → Aa | b A → Ac | Sd | ∈ |
10 | |||
(c) | What is activation record? Draw the diagram of General Activation record and explain the purpose of different fields of an activation record. | 05 | |||
(d) | What are the different functions of loader explain in brief. | 05 | |||
2. | (a) | With reference to assembler explain the
following tables with suitable example. (i) POT (ii) MOT (iii) ST (iv) LT |
10 | ||
(b) | Let L be the language consisting of string of a's and
b's having same number of a's and b's : (i) Construct LL (1) grammar for L (ii) Construct a predictive parsing table for the grammar obtained in (i). |
10 | |||
3. | (a) | Explain different psudo-ops used for conditional macro expansion, along with example. | 10 | ||
(b) | What are the different phase of compiler? Illustrate
compiler internal presentation fo source program for following statement
after each phase position = initial + rate * 60 |
10 | |||
4. | (a) | Explain working of a direct linking loader with a proper example. Clearly show the entries in different databases built by the direct linking loader. | 10 | ||
(b) | Generate three address code for given expression while (a < b) do if (c < d) then x = y + z else x = y + z |
10 | |||
5. | (a) | For the given grammar below, construct
operator precedence relations matrix, assuming *, + are binary operators
and id as terminal symbol and E as non terminal symbol. E → E + E E → E * E E → id Apply operator precedence parsing algorithm to obtain skeletal syntax tree for the statement id + id * id | 10 | ||
(b) | Explain role of code optimization in compiler designing with suitable example. | 10 | |||
6. | (a) | For regular expression (a | b)* abb construct NFA and construct it into DFA. | 10 | ||
(b) | With reference to stack allocation and help allocation explain runtime storage organization. | 10 | |||
7. | (a) | Write a note on JAVA compiler environment. | 05 | ||
(b) | Explain synthesized and inherited attributes used in syntax directed definitions. | 05 | |||
(c) | Explain DAG. | 05 | |||
(d) | Find first and follow set for given grammar below.
|
05 |
Wednesday, June 25, 2014
System Programming and Compiler Construction (SPCC) Semester 6 (Revised Course) (3 Hours) December 2012
System Programming and Compiler
Construction (SPCC)
Semester 6 (Revised Course) (3 Hours) December 2012 |
|||
KR-8954
[Total Marks : 100] |
|||
N.B: | (1) | Question No. 1 is compulsory. | |
(2) | Attempt any four questions out of remaining six questions. | ||
(3) | Assume suitable data if necessary. | ||
(4) | Draw Diagrams where required. | ||
1. | (a) | Explain with the help of flowchart the working of two-pass assembler along with the database used. | 10 |
(b) | Modify the given grammar and construct a predictive
parser table explaining each step :- E → E + T | T T → T * V|V V → Id |
10 | |
2. | (a) | Explain the different error recovery techniques used in compilers. | 10 |
(b) | Detail the different features used in macro processing. | 10 | |
3. | (a) | What is the need of linkage editor in System Programming? Explain its. working in detail. | 10 |
(b) | Explain the working of Recursive Descent Parser and Operator Precedence Parser with example. | 10 | |
4. | (a) | Explain Run time storage Organization in detail. | 10 |
(b) | Explain the different types of Garbage collection and compaction in compilers. | 10 | |
5. | (a) | Explain with flowchart the working of multiphase microprocessor and the database used. | 10 |
(b) | What are the different types of intermediate Codes? Explain their implementation techniques. | 10 | |
6. | (a) | Distinguish between :- (i) Syntax tree and Parse trees (ii) LL Parser and LR Parser. |
10 |
(b) | Explain the handling of control structure and procedures in code generation phase of compilers. | 10 | |
7. | Write notes on any four :- | 20 | |
(a) | Dynamic loading and linking | ||
(b) | Java compiler Environment | ||
(c) | SPARC Assembler | ||
(d) | Code Optimization Techniques | ||
(e) | Syntax Directed Translation. |
Tuesday, June 24, 2014
System Programming and Compiler Construction (SPCC) Semester 6 (Revised Course) (3 Hours) May 2012
System Programming and Compiler
Construction (SPCC) |
|||
GN-7202 |
|||
N.B: | (1) | Question No. 1 is compulsory. | |
(2) | Attempt any four questions out of remaining six questions. | ||
1. | Answer the following:- | 20 | |
(a) | What is System Software and application software? | ||
(b) | What is the use of ORG (ORIGIN)? | ||
(c) | What is positional parameter in macro? | ||
(d) | Differentiate between Parse tree and syntax tree. | ||
2. | (a) | For a regular expression (0+1) * 01, construct an NFA for this expression and convert this NFA into DFA. | 10 |
(b) | Explain various phases of compiler with suitable example. | 10 | |
3. | (a) | Explain two pass assembler with flowchart. | 10 |
(b) | What are different functions of Loader? Explain difference between linkage editor and linkage loader. | 10 | |
4. | (a) |
Test whether following grammar is LL (1) or not. Construct LL (1) Parse
table. S → AB | g Da A → ab | c B → dC C → gC | g D → fD | g |
10 |
(b) | Explain runtime storage organization in detail. | 10 | |
5. | (a) | Draw syntax tree and Directed Acylic Graph (DAG)
for expression (a * b) + (c - d) * ( a * b) + b | 10 |
(b) | What is binding ? Explain Static and dynamic binding. | 10 | |
6. | (a) | Explain two pass macro processor with flowchart and databases. | 10 |
(b) | Explain various forms of intermediate code used by compiler. | 10 | |
7. | Write detailed notes on any two :- | 20 | |
(a) | SPARC assembler | ||
(b) | LEX and YACC | ||
(c) | Debug monitor | ||
(d) | Macro assembler. |
ADVANCED MICROPROCESSOR (AMP) MAY 2012 COMPUTER SCIENCE SEMESTER 6
Con. 3999-12. GN-7208
(3 Hours) [Total Marks : 100]
(2) Out of remaining six questions, attempt any four questions.
(3) In all 5 questions to be attempted.
(4) Figures to the right indicate marks.
1. (a) | Enlist the instruction pairing rules of U and V pipeline in Pentium. | 5 | |
(b) | Write short note on Intel's Net burst micro architecture. | 5 | |
(c) | Draw the data flow graph for computation of integer power Z = Xn of an | 5 | |
input number X. | |||
(d) | State the use of following x 86 flags : | 5 | |
RF, TF, VM, NT, IOPL. | |||
2. (a) | Explain how the flushing of pipeline is minimized in Pentium architecture. | 10 | |
(b) | Explain in brief integer instruction pipeline stages of Pentium processor. List the | 10 | |
steps instruction issue algorithm. | |||
3. (a) | differentiate between Pentium and Pentium pro-processors wrt size of address/data | 10 | |
bus, addressable memory virtual memory, L2 cache, generation, SMP support, | |||
integer pipeline stages, no. of integer pipes, floating point pipeline stages, no. of | |||
floating point pipes. | |||
(b) | State the features of Intel ltanium processor. Draw the block diagram of ltanium | 10 | |
processor and explain in brief. | |||
4. (a) | Explain segmentation and paging in protected mode of 80386 processor. | 10 | |
(b) | Explain the Debug registers of 80386 DX processor. | 10 | |
5. (a) | Consider the following reservation table for a unifunction pipeline :- |
(i) Find the forbidden set of latencies | 2 | |
(ii) State the collision vector | 1 | |
(iii) Draw the state transition diagram | 5 | |
(iv) List simple cycles and greedy cycles | 1 | |
(v) Calculate MAL (minimal average latency). | 1 | |
(b) | Explain static data flow computer architecture with example. | 10 |
6. (a) | Differentiate between real mode and protected mode of X 86 family. | 10 |
(b) | Explain Cache organization of Pentium. | 10 |
7. | Write short notes on :- | |
(a) Structure of segment descriptor | 5 | |
(b) USB | 5 | |
(c) Layered architecture of SCSI | 5 | |
(d) EISA. | 5 |
System Programming and Compiler Construction (SPCC) Semester 6 (Revised Course) (3 Hours) December 2011
System Programming and Compiler
Construction (SPCC) |
|||
|
|||
1. | Solve any four- | 20 | |
(a) | State the reason for the assembler to be a multi program. | ||
(b) | Explain the concept of macro definition within a macro. | ||
(c) | Explain dynamic linking loader. | ||
(d) | Explain different phases of compiler. | ||
(e) | Differentiate between machine dependent and machine independent code optimization. | ||
2. | (a) | What is forward reference problem? How is it handled in two-pass assembler? Explain with the help of neat flowchart the working of a two-pass assembler. Clearly showing the organization and uses of the databases. | 15 |
(b) | Distinguish between DFA and NFA. | 05 | |
3. | (a) | How is macro defined, called and expanded? Explain the working of a single pass microprocessor. | 10 |
(b) | What is the need of linkage editor in system programming? Explain its working in brief. | 10 | |
4. | (a) | What is code optimization? What are various strategies for code optimization? | 10 |
(b) | Define and explain the following terms with suitable
example. (i) Parse tree (ii) Syntax tree (iii) Context Free Grammar (iv) Regular expression (v) Handles. |
10 | |
5. | (a) | Differentiate between Top-down and Bottom-up parsing. Explain each of them with suitable example. | 10 |
(b) | Explain the run time storage Organization in detail. | 10 | |
6. | (a) | Explain three-address code, its types and also implementation of three address statements. | 10 |
(b) | Explain Syntax Directed Translation. Give syntax directed definition to translate infix expression to postfix expression. | 10 | |
7. | Short notes on :- | 20 | |
(a) | Loading and linking scheme. | ||
(b) | Error recovery techniques used by compiler. | ||
(c) | Role of finite state automata in compiler theory. | ||
(d) | Syntax trees and their usage. | ||
(e) | Java compiler environment. |