FINAL YEAR QUESTION BANK

SRINIVASAN ENGINEERING COLLEGE, PERAMBALUR

COMPUTER SCIENCE & ENGINEERING

CS1011 DATA WAREHOUSING AND MINING YEAR / SEM: IV /VII QUESTION BANK UNIT-I BASICS OF DATA WAREHOUSINGBASICS OF DATA WAREHOUSING PART-A 1. How are organizations using the information from data warehouse? 2. What is discovery-driven exploration of data cubes? 3. Write down the applications of data warehousing? 4. When is data mart appropriate? 5. What are the characteristics of data ware house? 6. Define data model. 7. Compare OLTP and OLAP systems. 8. What is data warehouse metadata? 9. What is the difference between view and materialized view? 10. Explain the difference between star and snowflake schema? 11. Define the cube. Give an example. 12. What is data mart? Which schema is suitable for data mart? 13. List out the components of star schema? 14. What is snowflake schema? 15. List out the components of fact constellation schema? 16. Point out the major difference between the star schema and the Snowflake schema?

17. Which is popular in the data warehouse design, star schema model (or) snowflake schema model? 18. Define fact table? 19. What are lattice of cuboids? PART-B 1 (A) Explain the typical architecture of data warehousing. (B) How are concept hierarchies useful in OLAP? 2. (A) Write note on multi dimensional data model?
(B) What is Meta data repository? Explain

3. (A) with a neat diagram explain the architecture of a data warehouse. (B) Discuss the typical OLAP operations with example. 4. (A) Discuss how computations can be performed efficiently on data cubes. (B) Write short notes on data warehouse Meta data. 5. Explain data ware house architecture and operational data stores with a neat diagram. 6. Discuss the nine decisions in the design of data warehouse in detail. 7. (A) Briefly compare the following concepts. Explain your points with an example (B) Snow flake schema, fact constellation star net query model (C) Data cleaning, data transformation, refresh. (D) Discovery-driven cube, multi feature cube, virtual warehouse 8. What are the differences between three main types of data usage: information processing, analytical processing and data mining? Discuss the motivation behind OLAP mining.

9. Enumerate the building blocks of a data warehouse. Explain the importance of metadata in a data warehouse environment. What are the challenges in metadata management? 10.Distinguish between the entity relationship modeling technique and dimensional modeling. Why is the entity-relational modeling technique not suitable for the data warehouse? 11. Create a star schema diagram that will enable FIT-WORLD GYM INC. To analyze their revenue. The fact table will include fro every instance of revenue taken attribute(s) useful for analyzing revenue. The star schema will include all dimensions that can be useful for analyzing revenue. Formulate query: Find the percentage of revenue generated by members in the last year. How many cuboids are there in the complete data cube? 12. With a neat sketch discuss the data ware house architecture. 13. Discuss the various types of Meta data (i) Differentiate OLTP with OLAP systems. (ii)Explain the operations performed on data warehouse with and examples

UNIT II DATA PREPROCESSING, LANGUAGE, ARCHITECTURES, CONCEPT DESCRIPTION PART-A 1. List the issue s to be considered during data integration. 2. What do you mean by data generalization? 3. What is concept hierarchy? Give an example. 4. What are the various forms of data preprocessing? 5. What are the various forms of data processing? 6. State the significance of hierarchy of data. 7. What is dimensionality reduction? 8. What is concept description? 9. Mention the various tasks to be accomplished as part of dada pre-processing. 10. Define data mining. 11. Write the role of data mining and data warehousing. 12. What is meant by concept description 13. Define Data mining Query Language. 14. What are the different types of coupling? 15. Define Data Integration. 16. Define Data Transformation. 17. What is GIS? 18. What is the Graphical User Interface? 19. What are the ways to control a generalization process? 20. What are the approaches categorized in flexible generalization of large dataset?

PART-B 1. (A) Explain the process of data transformation. (B) List and explain the primitives for specifying a data mining task. 2. (A) Explain the functional components of data mining graphical user interface. (B) Explain the algorithm for attribute oriented induction. 3. (A) Explain various methods of data cleaning in detail. (B) Give an account on data mining query language. 4. How is attribute oriented induction implemented? Explain in detail. 5. Discuss the five primitives for specifying task. 6. Discuss the importance of establishing a standardized data mining query language. What are the potential benefits and challenges involved in such a task? 7. For class characterization, what are the main differences between a data cube based implementation and a relational implementation such as attribute-oriented induction. Discuss Which method is most efficient and under what condition this is so. 8. List and discuss the various data mining primitives. 9. (A) Explain the five steps in the Knowledge Discovery in Databases (KDD) process. (B) Discuss in brief the characterization of the data mining algorithms. (C) Discuss in brief the characterization issues in data mining. 10. Distinguish between statistical inference and expiatory data analysis. Enumerate and discuss various statistical techniques and methods for data analysis. Write a short note on machine learning. What is supervised and unsupervised learning? Write a short note on regression and correlation. 11 Explain the needs and steps involved in Data processing

12. (i)list out and describe the primitives fir specifying a data mining tasks. (ii)Describe how concept hierarchies are useful in data mining 13. Explain the need and step involved in data preprocessing. 14. Describe the concept hierarchies are useful data mining 15. Write short note on Data generalization and summarization based on characterization. 16. Mining descriptive statistical measure in large database. UNIT III ASSOCIATION RULES PART-A 1. Show the ice berg query form. 2. What is single dimensional association rule? 3. Write the two measures of association rule? 4. Define conditional pattern base? 5. What are the interestingness measures of association rule mining? 6. Define multi level association rule. 7. List two interestingness measures for association rules. 8. What are ice berg queries? 9. What is over fitting and what can you do to prevent it? 10. In classification tress, what are surrogate splits, and how they are used? 11. Define (a) Frequent item set (b) Association Rule. 12. Write the use of conditional Patter base in FP-Tree. 13. Define Association Rule Mining. 14. When we can say the association rules are interesting? 15. Explain Association rule in mathematical notations. 16. Define support and confidence in Association rule mining. 17. How is association rules mined from large databases? 18. Describe the different classifications of Association rule mining

PART-B 1. (A) Explain the methods used to improve the effiency apriori algorithm. (B) What are multilevel association rules? Explain. 2. Explain the FP-Growth algorithm. Illustrate with an example. 3. Write and explain the algorithm for mining frequent item sets without candidate generation. Give relevant example. 4. Discuss the approaches for the mining multi level association rules in the transaction databases. Give relevant example. 5. Discuss the single dimensional Boolean association rule mining for transaction database. 6. With an example discuss multilevel association rule. 7. Explain with an algorithm, how to mine single dimensional Boolean association rules from transactional database. Give relevant example. 8. With an algorithm explain constraint based association mining. Give relevant example. 9. Decision tree induction is a popular classification method. Taking one typical decision tree induction algorithm, briefly outline the method of decision tree classification. 10. Consider the following training dataset and the original decision tree induction algorithm (ID3). Risk is the class label attribute. The height values have been already discretized into disjoint ranges. Calculate the information gain if gender is chosen as the test attribute. Calculate the information gain if gender is chosen as the height attribute. Draw the final decision tree (with out any pruning) for the training dataset. Generate all the IF-THEN rules from the decision tree. Gender height risk F (1.5, 1.6) low M (1.9, 2.0) high

F (1.8, 1.9) medium F (1.8, 1.9) medium F (1.6, 1.7) low M (1.8, 1.9) medium F (1.5, 1.6) low M (1.6, 1.7) low M (2.0, 8) high M (2.0, 8) high F (1.7, 1.8) medium M (1.9, 2.0) medium F (1.8, 1.9) medium F (1.7, 1.8) medium F (1.7, 1.8) medium 11. A database has four transactions. Let min_sup=60% and min_conf=80%. TID T100 T200 T300 T400 DATE 10/15/07 10/15/07 10/19/07 10/22/07 ITEMS_bought {K,A,D,B} {D,A,C,E,B} {C,A,B,D,E} {B,A,D}

find all frequent item sets using Apriori and FP-growth, respectively. Compare the efficiency of two mining processes. (5+5+2)

list all of the association rules (with support and confidence c matching the following meta rule, where X is a variable representing customers, and item, denote variable representing items (e.g. A,B, etc)). For all X belongs transaction, buys (X,item1)^buys(X,item2) p buys (X,item3) [s,c] 12. Describe in detail about mining multilevel Association rules from transaction database. 13. Write an algorithm for FP-Tree construction and explain how frequent item sets are generated from FP-Tree. 14. Describe the various steps involved in Apriori algorithm for frequent item set mining with an appropriate example. UNIT IV CLASSIFICATION AND CLUSTERING PART-A 1. Distinguish between supervised and unsupervised learning. 2. What is an outlier? 3. List out the major strength of decision tree method. 4. Distinguish between classification and clustering 5. What are the factors to be considered, when comparing classification methods? 6. Mention the various types of data available in data mining. 7. What is classification? 8. What is cluster analysis? 9. What is the objective function of the k-means algorithm? 10. The naive Bayes classifier makes what assumption that motivates its name? 11. Distinguish between clustering and classification. 12. Why nave Bayesian classification is called naive? 13. What is meant by hierarchical clustering? 14. What do you mean by virtual warehouse?

15. How are concept hierarchies useful in OLAP? 16. What is data mart? Give example. 17. What is data ware house Meta data? 18. State the differences between star schema and snow flake schema. 19. What is a data cube? 20. Why is Nave Bayesian classification is called Nave? 21. What is meant by pruning in a decision tree induction? 22. What are the requirements of clustering? 23. What is Tree pruning?

PART-B 1. Explain the algorithm for induction a decision tree from training samples. 2. (A) list and explain the typical requirements of clustering in data mining. (B) Explain k-medoids algorithm. 3. Explain the following clustering methods in detail: (i) BIRCH (ii) CURE 4. Briefly discuss the major steps involved in the induction trees using the ID# algorithm. 4. What is clustering? How does it differ from classification? Describe the following approaches to clustering methods, partitioning methods and hierarchical methods. Give an example for each. 5. What are Bayesian classifiers? Explain in detail about: (i) Nave Bayesian classification. (ii) Linear and multiple regression. 6. Why is outline important? Briefly describe the different approaches behind stastical based outlier detection, distance-based outlier detection and deviation based outlier detection. 7. Given the following transactional database

1 C, B, H 2 B, F, S 3 A, F, G 4 C, B, H 5 B, F, G 6 B, E, O (i) We want to mine all the frequent item sets in the data using the apriori algorithm. Assume the minimum support level is 30% (you need to give the set of frequent item sets in L1, L2, candidate item sets in C1, C2, ) (ii) Find all the association rules that involve only B, H (in either left or right hand side of the rule). The minimum confidence is 70%.

8. Describe the multi-dimensional association rule, giving a suitable example. 9. Explain an algorithm for constructing a decision tree from training samples. 10. Explain bayes theorem. 11. Discuss in detail about (a)Bayesian classification (b) Linear and multiple regression 12. Write short notes on Partitioning methods and outlier analysis 13. Explain with an Example the various steps in Decision tree induction. 14. Describe the various techniques for improving classifier accuracy and K means clustering with an example. 15. Briefly outline the major steps of decision tree classification

16. What are the advantages and disadvantages of decision tree over other classification techniques? 17. Discuss the different types of clustering methods and also describe the working of PAM algorithm. 18. What is warehouse and explain the steps for the design and construction of data ware house? 19. Explain the process of data warehouse design and architecture. 20. Explain in different types of OLAP server. 21. How do data warehousing and OLAP relate to mining? 22. What is data warehouse? Distinguish warehouse. 23. How are concept hierarchies useful in OLAP? Mention various OLAP tools. 24. Explain the data model which is suitable for data ware house with examples. UNIT V RECENT TRENDS 1. List the types of dimensions used in a spatial data cube. 2. What is sequential pattern mining? 3. Define the spatial database? 4. List out any two various commercial data mining levels. 5. List the some applications of data mining. 6. What is web usage mining? 7. What is visual data mining? 8. What is the frequent item set property? 9. Mention the advantages of hierarchical clustering. 10. What is audio data mining? between operational database system and data three -tier data warehousing

11. Write short notes on text mining.s 12. What kind of association can be mined for multimedia data? 13. What are the advantages of spatial databases? 14. What is text mining? 15. What kind of association can be mined from multimedia data? 16. What do you mean by DB Miner? 17. Give the examples of data mining tools. 18. What is spatial data mining? Give examples. 19. What is data security? 20. Write down some applications of data mining. PART-B 1. (A) Explain how to construct a data cube for multimedia data analysis. (B) Describe about similarity search in time series analysis 2. Discuss in detail about the application of data mining. 3. What is a multimedia database? Explain the methods of mining multimedia database? 4. (A) discuss the social impact of data mining. (B) Discuss spatial data mining. 5. Describe the applications and trends in data mining in detail. 6. Write short notes on: (i) Data mining for retail industry. (ii) Visual and audio data mining. 7. (A) what is multidimensional analysis? Discuss the same with an example. (B) Discuss how data mining is done is spatial databases. 8. (A) discuss data mining in multimedia databases. (B) What is time series analysis? Discuss the same with an example.

9. BIRCH and CLARANS are two interesting clustering algorithms that perform effective clustering in large data sets. (i) Outline how BIRCH performs clustering in large data sets. (ii) Compare and outline the major differences of the two scalable clustering algorithms: BIRCH and CLARANS. 10. Write a short note on web mining taxonomy. Explain the different activities of text mining. Discuss and elaborate the current trends in data mining 11. Explain in detail about mining text databases. 12. Discuss about various data mining tools. 13. Explain the role of data mining in financial data analysis. 14. What is information retrieval? What is keyword-based association analysis? 15. What are the various data mining tasks supported by the DB Miner system? 16. Explain about text data analysis and the features of spatial databases. 17. Write the difference between direct query processing and intelligent query processing. Give examples. 18. Discuss the applications of data mining in business. 19. What is web mining? Discuss the various web mining techniques. 20. Discuss in detail of application of data mining for biomedical and DNA data analysis and telecommunication industry.

IT1402 MIDDLEWARE TECHNOLOGIES UNIT-I MIDDLEWARE CONCEPTS PART-A 1. What is client client-server? 2. What is meant by middleware? 3. What is object server? 4. What is transaction server? 5. What is database server? 6. What are the most typical functional units of client/server applications? 7. What is web server? 8. What is TP monitor? 9. What are the building blocks of client/server? 10. What are the functions of typical server program? 11. What is meant by symmetric multiprocessing? 12. What is message oriented middleware? 13. What is service specific middleware? 14. What are general purpose middleware? 15. What is meant by asymmetric multiprocessing? 16. What is OLTP? 17. What is meant by 2-Tier architecture? 18. What is meant by 3-Tier architecture? 19. What is load balancing? 20. What are fat clients and servers? 21. What do you meant by horizontal and vertical scaling? 22. What is group ware server? 23. What are the types of servers? 24. What is file server? 25. What are the major technologies that can be used to create client/server applications? 26. List out the benefits of using client server oriented TCP monitors? 27. Compare RPC and MOM. 28. Draw 2-tier architecture of a typical client/server system? 29. What is right sizing? 30. Draw the diagram that depicts the building block of client server. PART-B 1. Explain the role of middleware in distributed applications. 2. Write short notes on Peer to peer and general purpose middleware? 3. How servers classified?Describe. 4. How RPC implemented in client/server environment? 5. Explain the development of RMI application for arithmetic operation.

UNIT-II EJB ARCHITECTECTURE PART-A 1. What is EJB? 2. What are the three values of EJB? 3. How EJB used in business solutions? 4. Draw a neat diagram about the parties of EJB?

PART-B 1. Difference between java and enterprise bean. 2. What do you mean by EJB Ecosystem? 3. Explain about EJB Architecture? 4. Explain about EJB architecture componenets? 5. Explain about EJB object interface? 6. Explain about entity beans. UNIT-III EJB APPLICATIONS PART-A 1. What is java role in J2EE? 2. What are the key features of EJB technology? 3. What are the key benefits of EJB technology? 4. What are the implicit services supported by EJB? 5. Classify enterprise beans? 6. What is message driven bean? 7. What is entity bean? 8. What is seesion bean? 9. What is deployment descriptor? 10. What is re-entrant? 11. What is EJB container? 12. What is EJB server?

13. Why does EJB needs two interfaces? 14. What is EJB Context? 15. What is interface? 16. What is marshaling? 17. What are states of entity bean? 18. What is unmarshaling? 19. List out four exceptions raised in EJB?

PART-B 1. Explain deployment descriptors. 2. Describe the sequence steps for deploying J2EE based EJB applications. 3. Discuss the steps involved in building and deploying EJB in bank transactions. UNIT-IV CORBA PART-A 1. What is CORBA? 2. What is IDL? 3. Why CORBA used? 4. What is ORB? 5. What are the responsibities of an ORB? 6. What are IDL stubs and skeletons? 7. Define DSI. 8. Define DII. 9. What is an object reference? 10. What is serialization? 11. What is deserialization? 12. What is BOA? 13. What is server activation policy? 14. Write about CORBA services. 15. Define Mapping.

16. Define GIOP. 17. What is partitioning?

PART-B 1. Explain about the issues involved in CORBA. 2. What are the services offered by CORBA? 3. Describe the layered achitecture of CORBA? 4. Write short notes on CORBA IDL.

UNIT-V COM PART-A 1. What is COM? 2. What are the requirements of COM interface? 3. What is dispatch table? 4. What is type library? 5. What is object handles? 6. What is COM factory? 7. What are the functions of CTS? 8. What is CLI? 9. What is AppDomain? 10. What is CLR?

PART-B 1. What are the fundamental traits of dis ributed object sysem? 2. Write most frequently used datatypes? 3. Compare COM & CORBA. 4. How do you implement interfaces in COM. Explain. 5. Describe object lifecycle of COM.

TOTAL QUALITY MANAGEMENT DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING QUESTION BANK Subject Code: MG1301

Unit 1 Introduction Part A (2 Marks)

1. Define the term quality. 2. Define TQM. 3. Name dimensions of quality? 4. Name any four prominent TQM pioneers. 5. What are the necessary characteristics of a good quality product? 6. What is serviceability? 7. What is durability? 8. What is quality planning? 9. What are the objectives of quality planning? 10. What is meant by quality costs? 11. Give examples of internal failure costs? 12. Give examples of external failure costs? 13. What do you mean by total cost of quality? 14. List the techniques used for analyzing the quality costs. 15. Define strategic planning. 16. Name any four role of senior management. 17. What is a quality council? 18. What is a quality policy statement? 19. List any four characteristics of a quality policy statement. 20. Mention any four duties and responsibilities of the quality council. 21. What is mission statement? 22. Define leadership? 23. What is management by wandering? 24. Name any four tangible benefits of TQM. 25. Name any two popular awards for quality.

Part B (12 Marks) 1. List and discuss the dimensions of quality in detail. 2. What are basic concepts of TQM? Explain each. 3. What are the characteristics of quality leaders? 4. Explain seven habits of successful people? 5. What are quality statements? Discuss with examples. 6. Explain the Deming Philosophy for improving quality, productivity and competitiveness. 7. Define quality cost. Explain the different types of quality costs. 8. What are the barriers for implementing TQM in industries? Explain. 9. Explain the roles of senior management in successful implementation of TQM. 10. Describe the process of strategic planning and state its importance.

Unit 2 Part A (2 Marks)

1. What is customer satisfaction? 2. Name the five important principle of TQM. 3. What do you mean by customer perceived quality? 4. What is service quality? 5. What are the components of service quality? 6. What do you mean by customer defection? 7. Define customer retention. 8. What is employee motivation? 9. What do you mean by safety needs? 10. Define empowerment. 11. Give any two benefits of empowerment. 12. Define a team and teamwork. 13. List the stages of team building. 14. List out the characteristics of a successful team. 15. Name types of teams?

16. What is performance appraisal? 17. What is PDSA? 18. What is 5 S? 19. What is sourcing? 20. What are the types of sourcing? 21. What is Muda? 22. What do you mean by continuous process improvement? 23. Define Kaizen. 24. Define partnering. 25. What is Malcolm Balridge National Quality Award?

Part B (12 Marks)

1. Who are customers? Explain the roles of different types of customers in a TQM effort. 2. Is customer complaint necessary for an Organization? If yes, list the various tools used for collecting customer complaints. 3. Explain the customer supplier chain model. 4. Explain the service quality with its characteristics and expectations. 5. Discuss the characteristics of the empowered employees. 6. What are teams? What are the characteristics of successful teams? 7. Describe the Juran Trilogy in detail. 8. Explain the phases of PDSA cycle with suitable example. And list out the benefits of PDSA cycle. 9. Discuss the various steps in the development of performance appraisal system. 10. Explain the different ways to recognize people. 11. Discuss the important elements to achieve customer/supplier partnering relationship. 12. Enumerate the various stages in supplier selection and evaluation.

Unit 3 Part A (2 Marks)

1. What do you mean by measure of central tendency? 2. What do you mean by measures of dispersion? 3. Define population. 4. Define data and information. 5. 3, 4, 5, 6, 8, 8 and 10, what are average, median, and mode? 6. List seven quality control tools. 7. Give examples of vital few. 8. Give examples of useful many. 9. What is Pareto diagram? 10. A company collected data on the reasons for returned shipments during a quarter. Results are: wrong selection 50,000; refused 195,000; wrong address 68000; order cancelled 5000; and others 15000. Construct a Pareto diagram. 11. What is a fish bone diagram? 12. What is a check sheet? 13. What is a histogram? 14. What is process capability and process capability index? 15. What is the standard deviation and the average for the normal curve shown below?

16. What are x and R charts? 17. Upper limit and lower limit are +4 and - 4 respectively and the process capability is 3 , what is the process capability index Cp? 18. What does a negative Cpk mean? 19. What is an attribute? 20. What are p charts and np charts? 21. Write down the difference between a defect and defective. 22. What is six sigma? 23. List any two merits of six sigma. 24. What is relationship diagram? 25. What is matrix diagram?

Part B (12 Marks)

1. Write short notes on the seven tools of quality. 2. Write about objectives of control charts and the procedure used to generate them. 3. Discuss process capability, process capability index, and C pk. 4. An organization that fills shampoo tries to maintain a specific weight of the product. The table below gives weight of 110 bottles that were checked at random intervals. Make a tally of these weights and construct a frequency histogram. ( weights in kg) 6.00 5.98 5.97 6.01 6.00 6.00 5.97 6.02 5.96 6.00 5.98 5.99 6.01 6.03 5.98 5.98 6.01 5.99 5.99 5.99 6.01 5.99 6.00 6.01 6.05 6.00 6.04 6.01 6.00 5.98 6.01 6.03 5.96 5.99 6.00 5.94 6.02 5.98 6.00 5.99 5.97 5.99 6.00 5.99 6.00 5.99 6.01 5.99 6.01 6.03 5.99 6.01 5.97 6.02 5.98 6.02 5.97 6.00 5.99 5.99 5.98 5.98 5.95 6.00 5.99 6.00 5.99 6.02 5.96 6.02 6.01 5.99 5.99 5.98 6.00 5.98 6.02 5.99 6.01 5.98 5.99 5.97 5.99 6.01 5.97 6.02 5.99 6.02 6.00 6.02 5.98 6.01 6.01 5.98 6.00 6.01 6.02 5.95 6.01 6.02 5.96 5.98 5.98 5.99 6.00 6.00 5.99 6.02 5.98 5.97

5. Control charts for x and R are to be established on a certain dimension part were collected in sub group size 6 and are given below. limits. Assume assignable causes and

measured in mm. Data

Determine the trial central line and control

revise the central line and limits.

Sub Group number 1 2 3 4 5 6 7 8 9 10 11 12 13

Sub Group number

20.35 20.40 20.36 20.65 20.20 20.40 20.43 20.37 20.48 20.42 20.39 20.38 20.40

0.34 0.36 0.32 0.36 0.36 0.35 0.31 0.34 0.30 0.37 0.29 0.30 0.33

14 15 16 17 18 19 20 21 22 23 24 25

20.41 20.45 20.34 20.36 20.42 20.50 20.31 20.39 20.39 20.40 20.41 20.40

0.36 0.34 0.36 0.37 0.73 0.38 0.35 0.38 0.33 0.32 0.34 0.30

6. Calculate mean, median, mode and standard deviation for the following distribution of TQM out of 100marks for 80 students.

marks in

Marks No. of students

0 - 20 4

20 - 40 26

40 - 60 22

60 - 80 16

80- 100 12

7. The mean weight of 500 male students at a certain college is 65.6 Kg and the standard

deviation is

10 Kg. Assuming that the weights are normally distributed, find how many students weigh (i) more than 75.5 Kg, and (ii) between 55.5 and 75.5 Kg.

8. The number of defectives in lots for a particular item is shown below. Each lot consists Lot No. No. of defects per lot a) Compute trial control limits for np-chart. b) State whether the process is in control or not? c) Calculate the revised control limits for np-chart. 9. Describe 7 new tools of quality management. 10. Describe in detail the steps of achieving the six sigma state. 1 24 2 3 4 5 36 6 30 7 42 8 52 9 20 10 16

of 400 items.

11 12 20 24

38 52 26

Unit 4 Part A (2 Marks)

1. What is Bench Marking? 2. What is product Bench Marking? 3. List any four objectives for benchmarking. 4. Why site visits are necessary in a benchmarking process? 5. What is house of quality? 6. What are the objectives of QFD? 7. List any three benefits of QFD. 8. What is target? 9. What is TPM? 10. What are the objectives of TPM? 11. What is meant by availability? 12. What is meant by performance efficiency?

13. Why TPM is required? 14. What are the objectives of FMEA? 15. What is down time? 16. What is FMEA? 17. Define risk priority number. Also state its significance. 18. Define reliability. 19. What is Quality function deployment? 20. What is meant by detection? 21. Define maintenance. 22. Define predictive maintenance. 23. List the types of maintenance. 24. Write down the philosophy of quality loss function. 25. What are the types of loss measurements in TPM?

Part B (12 Marks)

1. Write the step by step procedure of implementing a benchmarking process in an 2. a) Discuss the different types of benchmarking. b) List out the benefits of benchmarking. 3. List out the step by step procedure to build the house of quality. 4. What are the benefits of QFD? 5. Briefly explain the Taguchis quality lost function with an illustration 6. Write the step by step procedure to develop a TPM programme in an organization. 7. Explain the different types of maintenance techniques in detail. 8. Write the step by step procedure for implementing a FMEA of a product. 9. a) List out the benefits of the FMEA. b) Discuss the different types of FMEA.

organization.

10. (a) The specifications of a particular product are 25 3 and the average repair cost is Rs.90. Determine the quality loss function and the loss when X = 23. (b) A product has a constant failure rate of 0.018 per hour. What is the probability

that the product will survive or be reliable during the first 120 hours of operations?

UNIT V: Quality Systems

Part A (2 marks) 1. What is a quality system? 2. What is ISO? 3. What are the areas of applications of ISO 9000 series of standards? 4. What are the benefits of documentation? 5. Define quality audit. 6. What does ISO 9000 refer to? 7. What is ISO 14000 series of standards? 8. What do you mean by Environmental policy? 9. What is EMS audit? 10. Define the environmental effect. 11. Give an example of standard quality management system. 12. Why is ISO 9000 adopted by thousands of companies in all over the countries? 13. What are ISO 9000: 2000 quality management principles? 14. What is internal auditing? 15. Who is third party registrar? 16. What is QS 9000? 17. What is EMS? 18. What do you mean by two party quality system? 19. What are the documents required for the implementation of quality system? 20. What is the responsibility of Management Representative? 21. Define the environmental impact. 22. What are the two main ISO 14000 series of standards? 23. What are the types of quality audit? 24. What are the objectives of environmental auditing? 25. How ISO 14000 standards differ from ISO 9000 series of quality system.

Part B (12 marks)

1. Describe the twenty elements of ISO 9000 standards. 2. Explain the steps followed to get ISO-9000 certification for an educational institute. 3. Explain in detail about the documentation of quality system. 4. Explain the various stages of quality auditing. 5. Write short notes on the structure of QS-9000. 6. Discuss the various elements of ISO-14000 standards. 7. Enumerate the basic approach to environmental management system, showing a 8. What are the benefits of ISO 14000? 9. Describe the purpose of ISO 9000quality system? What are the benefits of ISO 10. Why is documentation the most common reason for noncompliance? -------------Certification? EMS Model.

Srinivasan engineering college

1401-INTERNET COMPUTING

Department of Computer Science & Engineering QUESTION BANK Subject Code/Name: CS1401-Internet Computing Year/Sem : IV / VII UNIT I FUNDAMENTALS PART-A 1. List out the devices used to form Internet and specify each one of its purpose. 2. What is an IP address? How it is relevant in Internet? 3. What is the difference between node and host? 4. What is the difference between an absolute pathname and a relative pathname? 5. What is the purpose of routers? 6. What is the purpose of MIME? 7. Define protocol. 8. Why are the protocols layered? 9. Define encapsulation. 10. Define port. 11. What do you mean by well-known ports? 12. What is meant by Name Resolution? 13. Define protocol tunneling. 14. Define URI, URL and URN.

15. What are the components of HTTP URL? 16. Define URL encoding. 17. What are the issues of next generation IP?

18. What is the difference between TCP and UDP? 19. What does ICMP provide? 20. Define IGMP. 21. What is the need for client side scripting? 22. What is the benefit of using JavaScript code in an HTML document? 23. List out the objects involved in JavaScript with its purpose. 24. List the goals of SGML. PART B Give short notes on the following: a. Internet Standards. (8) b. Internet Address Classes (8) 2. Discuss about the client/server strategies in Internet. (16) 3. Explain in detail the TCP and UDP Protocols. (16) 4. Elaborate on URL, URN, URI and MIME. (16) 5. List the five layers used by internet. For each layer you list, give the general purpose of each layer as well as a current implementation. (16) 6. Write short notes on the scripting languages Java Script and VB Script with examples. (16) 7. Classify the various types of Internet servers and give short notes on the same. (16) 8. Give brief notes on IP Addresses, Domain Names and Ports. (16) 9. Explain the steps involved in making the communication using TCP/IP with neat diagram. (16) 10. Explain in detail about CSS with suitable examples. (16) 1.

UNIT II SERVER SIDE PROGRAMMING PART-A 1. What is the role of server? 2. What are the necessities of using HTML forms? 3. What are the sequences of steps for each HTTP request from a client to the server? 4. Define MIME. 5. List the predefined MIME content types. 6. Define HTML. 7. What is meant by loop back address? 8. Define CGI -Common Gateway Interface. 9. Write a note on Internet Information Server (IIS). 10. What are ISAPI (Internet Server API) and NSAPI (Netscape Server API) 11. What is API -Application Program Interface? 12. What are Servlets? 13. What are Applets? 14. What do you mean by Server-side?

15. What is a protocol? 16. What is ActiveX? 17. Write a note on ActiveX controls. 18. Explain about HTTP Connection. 19. What is meant by Stateless Connection? 20. Write a note on Environment variables. 21. What are STDIN and STDOUT? 22. What are the two commonly used Request methods? 23. Explain about URL Encoding. 24. List the advantages of CGI scripting? 25. Explain about Session tracking. 26. Define packet switched networks. 27. Define socket. 28. What are the basic operations of client sockets? 29. What are the basic operations of Server socket? 30. List all the socket classes in java. 31. What is meant by Server Socket? 32. What do you mean by DatagramSocket and DatagramPacket? PART-B

CS1401-INTERNET COMPUTING

1. What are servlets? How can you deploy a simple servlet? Explain with example. (16) 2. Give the basic structure of a servlet along with its life cycle. (16)

3. How can you use the servlet session tracking API to keep track of visitors as they move around at your site? (16) 4. Give the advantages of Servlets over CGI. Describe shortly Servlet Containers (16) 5. Explain java networking using Sockets with your own example program. 6. Write short notes on Servlet Containers and Exceptions. 7. Elaborate on the life cycle of Servlet. 8. Give detailed notes on Servlet chaining and communications. 9. Give detailed notes on JSP scripting elements. 10. Describe three main capabilities for including files and applets into a JSP document. (16) (16) (16) (16) (16) (16)

CS1401-INTERNET COMPUTING

UNIT III XML TECHNOLOGY FAMILY PART-A 1. What are the XML rules for distinguishing between the content of a document and the XML markup element? 2. What is the use of XML? 3. What do you mean by DTD in XML? 4. What is the use of XML Namespace? 5. What are the uses of XML? 6. What is the usage of CSS? 7. State the commands in cascading style sheet used for grouping of elements. 8. Define DHTML Event bubbling. 9. What is meant by data bound control? Give example. PART-B 1. How is XML useful in extending the Enterprise? Elaborate on the XML Technolgy Family. (16) 2. Elaborate on the following presentation technologies: i. XSL ii. XFORMS iii.XHTML iv. Voice XML 3. Give short notes on the following Trandformation technologies:: i. XSLT ii. XLINK iii. XPATH iv. XQuery 4. Explain DTD and XML Schemas in detail. 5. Write short notes on the following processing technologies: i. DOM ii. SAX UNIT IV SOAP PART-A 1. What is SOAP? 2. Define scriptlets. 3. Define ASP. 4. What are the ASP objects? 5. What is global.asa file? 6. Define response object and list its methods. 7. Define JSP. (8) (8) (16)

(16) (16)

CS1401-INTERNET COMPUTING

PART-B

1. Explain in detail SOAP, its overview and its importance. (16)

2. Describe the following technologies that existed before the emergence of SOAP: (16) i. HTTP ii. XML-RPC

3. Elaborate on XML-RPC.

(16)

4 Explain the SOAP Protocol, its message structure with a messaging example. (16) 5. Elaborate on the SOAP Intermediaries, Actors, Design Patterns and Faults. (16)

6. Describe in detail SOAP with Attachments.

(16)

UNIT V WEB SERVICES PART-A

1.Define web services. 2. What qualifies as web services? 3. What is meant by firewall? 4. Write a note on proxy server. 5. What does DHTML refer? 6. Define SSI. 7. What does data binding mean? 8. What is meant by Plug-in? 9. What do you mean by JDBC? 10. Define ODBC. 11. List any two keyboard events? 12. List any two mouse events? 13. Define virtual organization. 14. List the major approaches to form virtual organization? 15. What do mean by search engine? 16. List the features of online shopping. 17. How do search engine work? P A R T B 1. Give a detailed overview of Web Services, its architecture and key technologies. (16) 2. Elaborate on UDDI. (16) 3. Elaborate on WSDL. (16) 4. Write short notes on i. ebXML Technologies. (8) ii. Overview of.NET and J2EE ( 8) 5. Explain how SOAP and web services have opened up new options for E- Commerce ( 16)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING YEAR/SEM : IV/VII SUB CODE/SUB NAME : CS1310 - OBJECT ORIENTED ANALYSIS AND DESIGN

QUESTION BANK

UNIT-I INTRODUCTION PART-A (2 marks)

1. Write about the traditional development methodologies? 2. Define object. 3. Give a brief note on object behavior 4. What do you mean by information hiding? 5. Define class hierarchy. 6. Write briefly about inheritance and explain the types of inheritance. 7. What do you mean by polymorphism? 8. Explain object relationship and associations. 9. What do you mean by consumer-producer association? 10. Write about static and dynamic binding? 11. Define object persistence 12. Define meta-classes. 13. What do you mean by software development process? 14. Explain briefly the waterfall approach. 15. Define collaboration. 16. Write the 80-20 rule.

17. Define Prototype. Give the types of prototype. 18. Write a brief note on RAD. 19. Write about CBD? 20. Why do we go for object oriented systems development? 21. What is horizontal prototype? 22. Explain the domain prototype? 23. Write about the Vertical prototype? 24. Explain Analysis prototype? 25. What is waterfall SDLC? 26. What are the advantages of object-oriented development? 27. What is data abstraction? 28. What is dynamic inheritance? 29. Differentiate between Unified Approach and Unified Modified Language. 30. Define software system. 31. Differentiate between algorithm-centric methodology and data-centric methodology. 32. What is object oriented design? 33. Give the characteristics of object oriented system. 34. What is object? Given example. 35. What is meant by software development methodology?

PART-B

1. Describe about an overview of Object Oriented Systems Development (16) 2. Describe about an Object Basics. (16) 3. Describe the Object oriented Systems Development Life Cycle? (16)

UNIT-II OBJECT ORIENTED METHODOLOGIES

PART-A (2 marks)

1. Write about the four phases in OMT? 2. What do you mean by object diagram? 3. What are the primary symbols used in Data Flow Diagrams? 4. What are the diagrams used in Booch methodology? 5. Give the steps involved in Macro development process in Booch methodology. 6. Give the steps involved in Micro development process in Booch methodology. 7. Write briefly about Use Cases. 8. Write short note on Objectory. 9. Define patterns and its necessity. 10. Define patterns template. Give some examples for components in pattern. 12. Define anti-patterns. 13. Define pattern mining. Give the steps involved in capturing pattern. 14. Define frame work. Give the differences between design patterns and frameworks. 15. Why do we go for unified approach? 16. Write short note on UA proposed Repository. 17. Define model. Explain about the types of model. 18. What are the advantages of Modeling? 19. Define UML. Mention the primary goals in the design of the UML. 20. Give the nine UML graphical diagrams. 21. What is a Package? 22. Define method and Process. 23. Describe the difference between method and process.

24. What is an Object Model? 25. What are the main Advantages of DFD? 26. What is objectory? 27. What is the purpose of state transition diagram of Booch Method? 28. Mention the models in object modeling Techniques in Rambaugh Methodology and its role for describing the system? 29. What is Object Model? 30. What is static model? 31. What is dynamic model? 32. Name the phases of OMT? 34. What is interaction diagram? Mention the types of interaction diagram.

PART-B

1. a. Describe Rum Baughs Object Modeling Technique? (12) b. Explain about Object Oriented Modeling (4) 2. Give detailed notes about the Booch Methodology? (16) 3. a. Give a detailed account of Jacobson methodology? (12) b. Explain in detail about the Component Diagram (4) 4. Describe patterns and the various pattern templates and Frameworks? (16) 5. Explain in detail about the Unified approach? (16) 6. Describe the UML Class diagram? (16) 7. Draw a State Diagram, Activity Diagram and Package Diagram for Via Net Bank ATM System. (16)

UNIT-III OBJECT ORIENTED ANALYSIS

PART-A (2marks)

1. What is the purpose of analysis? Why do we need analysis? 2. Why analysis is a difficult activity? 3. What do you mean by business object analysis? 4. Write a short note on use-case model? 5. Define use-case. 6. When extends association is used between two use-cases? 7. Define uses association. 8. What is meant by railroad paradox? What do you infer from railroad paradox? 9. Give the two-three rules? 10. What is the 80-20 rule? 11. Why is documentation an important part of analysis? 12. List the approaches for identifying classes? 13. What do you mean by relevant, fuzzy and irrelevant classes? 14. How would you select candidate classes for the list of relevant and fuzzy classes? 15. What is the common class patterns strategy? Give the list of patterns used. 16. What is CRC? 17. What are the three steps in CRC process? 18. Give the guidelines for naming a class. 19. What is an association? 20. What is generalization hierarchy? Give the advantage. 21. What are some common associations? 22. How to eliminate unnecessary associations? How would you know it? 23. What do you mean by aggregation? What are the major properties of a-part-of relation?

24. What guidelines would you see to identify a-part-of structures? 25. How use association is different from extends association? 26. What is generalization? 27. What is classification? 28. Name some sources of difficulties for collecting requirements. 29. Give the hint to identify the attributes of a class? 30. What is purpose of analysis? 31. What is a use case model?

PART-B

1. Demonstrate the guidelines for finding use cases and developing effective documentation?(16) 2. Give detailed notes about the Noun phrase approach? (16) 3. a. Describe the CRC approach? (12) b. Write the rules for Naming the Classes (04) 4. Give a detailed note about Associations? (16) 5. a. Explain in Detail about the identifying relationships? (06) b. Give a detailed note on Super-sub class relationship and a-part-of relationship? (10)

UNIT-IV OBJECT ORIENTED DESIGN

PART-A (2marks)

1. What is the need for axiomatic approach? 2. What are the main activities in design process? 3. Define axiom? What are the two design axioms applied to object-oriented design? 4. Define corollary? Give the corollaries derived from design axioms. 5. What do you mean by coupling? 6. What do you mean by degree of coupling? 7. What are the two types of coupling? 8. What do you mean by cohesion? Give the types of cohesion. 9. Differentiate coupling and cohesion? 10. What do you mean by design patterns? 11. Define OCL? 12. What do you mean by expressions? Give the syntax for some common expressions. 13. What are private, public and protected protocols? 14. What is encapsulation leakage? 15. What are the three basic types of attributes? 16. How do you present UML attribute? 17. What are the different types of methods provided by a class? 18. What are some characteristics of a bad design? 19. How do you present UML operation? 20. Define Package 21. What do you mean by persistence? Give some persistent data. 22. Define transient data? Give some transient data? 23. What are the essential elements in providing a persistent store? 24. Define schema or meta-data?

25. What is meant by database model? Give the different database models. 26. How will you define object constraint language ? 27. What is meant by an axiom? 28. Define axiom along with its types. 29. For the schema employee ( emp-id,emp-name,street,city) give the class representation along with the attribute types. 30. List out the characteristics of a bad design. 31. Differentiate object-oriented databases and traditional databases. 32. State the object-oriented design axioms. 33. Define persistence.

PART-B

1. Describe in detail about Object oriented database management systems. (16) 2. State the differences between OODBMS and traditional database. (16) 3. Explain the steps involved in designing the access layer classes (16) 4. What are the different models involved in designing access layer. (16) 5. Describe in detail about design axioms and corollaries (16)

UNIT-V SOFTWARE QUALITY AND USABILITY

PART-A (2marks)

1. What is the purpose of debugging? 2. What are the types of errors that you could find in your program? 3. Discuss Error-based testing? 4. Discuss Scenario-based testing/usage-based testing? 5. Name some testing strategies? 6. What is the Impact of Object orientation on Testing? 7. Discuss Black-Box testing? 8. Discuss White- Box testing? 9. What do you mean by Top- down Testing? 10. Discuss about the Statement testing coverage and Branch testing coverage? 11. What is Path testing? 12. What is Bottom - Up Testing? 13. What is the objective of testing? 14. What is the necessary of a test plan? 15. List the steps needed for a test plan? 16. Define regression testing? 17. Define Beta testing and Alpha testing? 18. What is the purpose of configuration control system? 19. When is testing said to be successful? 20. Define Usability? 21. What are the issues in software quality? 22. What is Usability testing? 23. What are the guidelines for developing usability testing? 24. Explain user satisfaction testing?

25. Explain COTS and USTS? 26. Write about the user satisfaction cycle? 27. What is Quality? 28. Why do we need usability Testing? 29. What is the objective of usability testing? 30. Define Test plan and test case. 31. How will you measure user satisfaction? 32. What is Quality assurance? 33. Why do you need to prototype the user interface? 34. What is a graphical user interface? 35. What is debugging? 36. What are the types of errors that you could find in your program.? 37. What is the need of a test plan? 38. What are client/server computing ? Give two applications which work on this basis? 39. Mention the purpose of view layer interface. 40. What are the principal objectives of the user satisfaction test. 41. How will you define validation?

PART-B 1. Describe quality assurance test and testing strategies (16) 2. Describe test cases and the impacts of object orientation on testing (16) 3. Illustrate test plan and continuous testing (16) 4. (a) Describe Usability Testing (12) (b) Describe about Quality Assurance (4) 5. (a) Describe user satisfaction (12) (b) How do you measure the user satisfaction in your project (4) 6. Explain the steps involved in designing the view layer classes? (16) 7. Describe the purpose of view layer interface? (16)

SRINIVASAN ENGINEERING COLLEGE PERAMBALUR-621212 DEPARTMENT OF COMPUTER SCIENCE ENGINEERING UNIX INTERNALS QUESTION BANK SEMESTER: VII PART-A UNIT-1 1. What are the three ways to configure the devices? 2. What is DMA? 3. List the building block primitives of unix with example. 4. Kernel is said to be non-preemptive. Comment. 5. What are the important fields of U area? 6. What are the services provided by the kernel? 7. What is uarea? 8. What is the use of buffer cache? 9. State the services of an operating system. 10. Define Inode. 11. Differentiate user mode & kernel mode 12. Define shell and mention the properties of UNIX OS 13. Mention the use of the fork System call and command Passwd 14. Differentiate between Exceptions & interrupts. 15. Define System call interface 16. What are the advantages and disadvantages of kernel data Structure? 17. What are the subsystems of UNIX OS? 18. Define pathname component. 19. Explain Assumption about Hardware 20. Explain the details about system concepts UNIT-2 1. 2. 3. 4. 5. 6. 7. Write the syntax for lseek system calls Define file systems What does the kernel in buffer read-ahead? State the advantages and disadvantages of buffer cache. What are the fields of super block and give its use? Give the formula for computing the block number and byte offset of an inode in a block. What should happen if the kernel attempts to awaken all processes sleeping on a event,but no processes are asleep on the event at the time of wakeup? 8. What are signals? 9. What is super block? 10. What is page stealer? 11. Define buffer cache 12. Mention the use of LSEEK System call 13. Write the I/O parameters saved in the U area 14. Define Inode Cache 15. .List out the various status of the buffer CLASS: IV CSE

16. List the data structures and their relationship when a regular file is opened. 17. Define free list 18. Explain the system call used for creating the special files 19. Define directories 20. Explain the structure of buffer pool. UNIT-3 1. What is race conditions? 2. What is dup? 3. List the data structures and their relationships when regular file is opened. 4. Is-1|wc-1 Discuss the pipe system call in this command. 5. Write the syntax of mount and dismount system calls. 6. Give the functionality of lseek(). 7. What is close system call? 8. What is the use FORK system call? 9. What is page stealer? 10. What is context switch? 11. Define pipes 12. Define named and unnamed pipe 13. Define major and minor number 14. Explain file and record locking 15. Define close system call and their syntax. 16. Define write system call and their syntax 17. Define open system call and their syntax 18. What is a system call and give 2 egs. 19. Explain file creation concepts. 20. Explain the algorithm for converting the path name to inode. UNIT-4

1. What is the difference between named pipes and unnamed pipes? 2. Define pregion 3. How does a regular grow in size? 4. What are signals? What system calls use signals in UNIX? 5. What are the components of register context? 6. What are signals? List any four types of signals. 7. What are special files? 8. What is the use of shell? 9. Briefly explain the activities of an INIT process. 10. Define Clist. 11. Define signals 12. Define context of the process 13. Define init process 14. What are the first 3 steps of process states and transition 15. What are the fields of process table 16. Define pages and page tables 17. Define interrupts 18. Define Exception 19. Give one example of Exit 20. Describe how the area is maintained with the help of register triples.

UNIT-5

1. Define context switch 2. What is nice value? 3. Discuss briefly the parameters related to process scheduling. 4. Write a brief note on the page stealer process. 5. What is demand paging policy? 6. What is a device driver? Give one example. 7. What are streams? 8. What is character device switch table? 9. What are the memory management policies in UNIX? 10. What is IPC? Explain. 11. Define scheduling 12. Define swapping 13. Define demand paging 14. Examples of process scheduling 15. Explain real time processing 16. Discuss briefly the parameter related to process scheduling 17. Write a brief note on the Page stealer process 18. What is the process of swapping process out. 19. Write short notes on allocations of swap space. 20. Explain the concepts involved in driver interface

PART-B UNIT-1 1. Explain in detail about driver interfaces in the I/O Subsystem 2. Explain in detail about memory management policies 3. List out the reasons for popularity of unix os 4. Explain the architecture of UNIX. 5. Explain about file sub system 6. Explain about kernel data structures 7. Discuss the file subsystem concept of the Unix operating system 8. Give the operating system services and also mention the difference between user Mode and kernel mode 9. What is a process? Explain process state transition with neat diagram 10. Explain about Unix kernel architecture. Elaborate on the various issues on administration 11. List out the reasons for popularity of UNIX system

12. Discuss the high-level architecture of the Unix system with a diagram. 13.i) What are the expected operating system services? (6) ii) What are the assumptions of the hardware in UNIX? (10) 14. Explain the components of the kernel along with a block diagram depicting the relationships between them. 15. Detail the file subsystem specifying the structure as well as the data structures related to the file system. 16. Explain the details about the User perspective 17. Explain Assumption about Hardware 18. Explain the details about system concepts 19. Explain the details about Operating System services 20. Explain the building block primitives of UNIX with Examples. UNIT-2 1. What is process and explain in detail about to create a new process? 2. What is pipe and explain the types of pipes with suitable algorithm? 3. Explain about the organization of buffer header 4. Discuss about algorithms for reading and writing disk blocks 5. Explain how byte offset is converted to block number in the file system. 6. i) Write a note on superblock. (4) ii) Explain the structure of the buffer pool(12) 7. Discuss the advantages and disadvantages of buffer cache 8. Discuss the race condition in assigning inode 9. Write and explain the algorithm for conversion of a path name to an Inode 10. Explain about incore inode and getblk algorithm in detail. 11. Explain about structure of a regular file and bmap algorithm in detail. 12. Describe the structure and functioning of the buffer pool. 13. Assume a hashing for buffer cache in UNIX. Describe the buffer retrieval process with all your assumptions and the algorithm. 14. What does the super block constitute? Detail any 2 algorithm that are invoked when a file is created. 15. Assume 1KB per block. If a process wants to access byte offset 425000 in a file, specify the calculation to find the block number and the byte offset into the block Also, describe the algorithm that uses this calculation. 16. Explain in detail about the structure of regular file 17. Explain the algorithm for converting the path name to inode

18. Write notes on (a) Directories (8) (b) Super blocks (8) 19. Explain the details about buffer headers 20. Explain the system call used for creating the special files

UNIT-3 1. What is kernel and write short notes on architecture of the UNIX kernel? 2. Explain in detail about the booting process 3. Write a program to copy the content from one file to another 4. Write short notes on i) Pipes(8) ii) STAT and FSTAT (8) 5. Discuss about file and record locking 6. Explain about DUP system call 7. Write a program to read data from a file and write data into a file 8. Discuss the process of unmounting a file system 9. Explain in detail about opening and closing of pipes 10. Discuss in detail about DUP system call 11. Explain about pipes. 12. Elaborate on the various operations of a file system and give the related system calls. 13. Explain about mounting and unmounting file systems in detail. 14. How is opening a file and reading its contents done in Unix? Write code segments to open file.txt in write mode and append few lines to it. Then open the same file in and display all the lines on the moniter.Hence the error if the file is current directory 14. How is the status of a file queried by a system call? Write code segment to display the status information of the file.txt 15. What system call allows another system to be attached to your file system? What is the attachment point? What table maintains all these information? 16. Can two files the same inode? If so, specify the system call and its algorithm. 17. Discuss the concepts of pipes and DUP system call 18. Discuss the open system call and algorithm 19. Briefly explain file creation concepts 20. Explain about File locking & Record Locking read mode not available on the

UNIT-4 1. What is buffer header and draw the structure of the buffer pool 2. Explain in detail about the structure of the process 3. Explain in detail about the structure of the UNIX operating System 4. Explain about process context 5. Write notes on process creation 6. Explain about attachreg algorithm 7. Discuss about system boot and init process 8. Explain in detail about the manipulation of process address space 9. How fork() system call influenced on a process creation 10. Discuss in detail about awaiting process termination 11. With an example, explain process states and transitions with a neat sketch . 12. What is a shell? List out any four shell commands with clear explanation. 13. Explain about signals and its handling in UNIX. 14. What is a region? State any 3 region system calls that are invoked by a process, one when getting hold of a region, one during execution and one while relinquishing it back. 15. Describe the state transitions that a process undergoes during its lifetime. 16. Every process maintains private u area. Describe how the u areas in maintained with the help of register triples. 17. Write the algorithm involved in creating a new process and explain it 18. Write and explain the algorithm for booting the system 19. Discuss the context of a process in detail 20. Describe the state transition that a process undergoes during its lifetime UNIT-5 1. What are the reasons for the popularity and success of the UNIX operating System (8) (ii) Write short notes on (8) 1. Boot Block 2. Super Block 3. Inode 4. File table 2. Define scheduling and explain in detail about the process scheduling 3. Explain about swapping in detail 4. Discuss about fair share scheduler

5. Explain demand paging in detail 6. Discuss in detail about driver interfaces 7. What is meant by process scheduling? Explain with its algorithm. 8. Describe in detail about allocation of swap space 9. What is a page fault? Explain any one method of page fault handling 10. Discuss the operations on the clists and cblock with examples 11. Explain demand paging in UNIX. 12. Write about process scheduling in UNIX 13. What are the functions of a clock interrupt handler? Detail any 3 functions along with the system calls and their data structures. 14. Suppose Unix uses the formula: decay (CPU)=8*CPU; Priority=CPU /10+base level priority Specify the first 3 seconds of the process scheduling if processes A,B&C are created with initial priority 60,the clock interrupts the system 70 times a second, the kernel processes no system calls and no other processes are ready to run. Also assume processes A and B are in group 1 and process C is in group 2.Specify the assignment of CPU to the processes 15. What are the data structures related to paging? 16. What is a page fault? Discuss the page fault related to validity fault and detail all the cases the page is faulted. 17. Write detail notes on disk drivers 18. Write detail notes on terminal drivers 19. Explain about swapping processes out 20. Explain briefly the concepts involved in driver interface

CSE III YEAR QUESTION BANK

SRINIVASAN ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CS1302-COMPUTER NETWORKS

QUESTION BANK

UNIT I DATA COMMUNICATIONS

PART - A 1. Describe the need and use of Data communication. 2. List out the 5 components of Data communication. 3. Define Network. 4. State the categories of networks. 5. Mention the types of connections. 6. Define Topology. 7. Specify the types of topologies. 8. Define Protocol. 9. List out the OSI Layers. 10. Distinguish between Protocols and Standards. 11. How are the guided media differing from unguided transmission media? 12. List out the disadvantages of optical fiber.

13. Write down the propagation types. 14. Describe the need and use of modems. 15. Write a note on space propagation. 16. List out the specifications of the Bell modems. 17. Write down the advantages of optical fiber. 18. Write down the advantages of Mesh topology. 19. Describe the need and use of Bus topology. 20. Write a note on line configuration. 21. Expand UTP. 22. Write down the 2 relationships of topologies. 23. List out the 3 characteristics of data communications. 24. Describe the need and use of real time transmission. 25. List the categories of standards. PART B

1. Discuss in detail about Data Communication. 2. Describe in detail about categories of networks. 3. Explain in detail about Topologies. 4. With a neat sketch explain OSI layers. 5. Briefly explain about classifications of transmission media. 6. Write a note on the following: i) Coaxial Cable ii) Optical Fiber iii) Twisted Pair 7. Illustrate the concepts of modems. 8. Discuss in detail about types of connections. 9. Briefly explain about distributed processing and network criteria. 10. Describe in detail about protocols and standards.

UNIT II DATA LINK LAYER PART A

1. List the responsibilities of data link layer. 2. Specify the types of errors. 3. Expand VRC. 4. Describe the need and use of Hamming Code. 5. Mention the function of go-back N-ARQ. 6. Specify the different kinds of Ethernet networks. 7. Expand CRC. 8. Mention the types of error correcting methods. 9. How does a single bit error differ from a burst error? 10. Specify the function of stop and wait flow control. 11. Specify the function of token passing. 12. Expand FDDI. 13. Define checksum. 14. Expand SONET. 15. List the SONET devices. 16. Write down the SONET layers. 17. Mention the function of photonic layer. 18. Specify the types of Bridges. 19. Write a note on transparent bridge. 20. Expand and define CSMA/CD. 21. Write a note on twisted-pair Ethernet. 22. Specify the function of switched Ethernet. 23. How is CRC superior to LRC? 24. Specify the functions of CRC performance. 25. Mention the function of burst error.

PART B

1. Describe in detail about data link layer in IEEE project 802. 2. Explain error detection and error correction techniques. 3. Discuss in detail about FDDI. 4. Illustrate the concept of Ethernet 802.3 in detail. 5. Briefly explain about 802.11 in details. 6. Describe in detail about sliding window protocol. 7. Illustrate the concepts of SONET. 8. Discuss in detail about Bridges.

9. Briefly explain the concept of CRC.

UNIT III NETWORK LAYER

PART A 1. Specify the responsibilities of network layer. 2. Define Inter network. 3. List the four internetworking devices? 4. Write down the functions of MAC. 5. What is PDU? 6. Distinguish between adaptive and non adaptive routing algorithms. 7. Write the keys for understanding the distance vector routing. 8. Define IP address. 9. Specify various addressing schemes in IP. 10. Write the keys for understanding the link state routing. 11. Describe the need and use of datagrams. 12. Define Subnetting 13. Expand LSP 14. Define adaptive routing. 15. Write down the functions of least-cost routing. 16. Expand SVC. 17. Define Packet switching. 18. List the functions of Repeaters. 19. Expand and define PVC. 20. Distinguish between packet switching and circuit switching. 21. Write the keys for understanding the link state routing. 22. Expand and define LSD. 23. Write a note on shortest path tree. 24. Mention the functions of Router. 25. In routing, what does the term shortest mean?

PART B 1. Discuss in detail about link state routing. 2. Briefly explain about Distance vector routing. 3. Illustrate the concepts of Routers. 4. Explain IP addressing method. 5. Illustrate the concept of subnetting. 6. Describe in detail about the two approaches of packet switching techniques. 7. Illustrate the concept of internetworking devices. 8. Discuss in detail about Repeaters. 9. With the help of block diagram explain in detail about gateways. 10. Explain in detail about packet switching approaches.

UNIT IV TRANSPORT LAYER

PART A

1. Mention the duties of the transport layer. 2. What is meant by end-to-end delivery? 3. Define error control. 4. Write a note on flow control. 5. Define segmentation. 6. Write short notes about integrated services. 7. List the types of multiplexing? 8. Describe the need and use of sockets. 9. Define Multiplexing. 10. Distinguish between logical address and a port address. 11. Draw the UDP header and explain its fields. 12. Name the timers used by TCP. 13. List out the scheduling techniques designed to improve the quality of service. 14. Mention the two categories of QoS attributes. 15. Distinguish between TCP and UDP. 16. Define congestion control.

17. Expand BECN. 18. Define addressing. 19. Write a note on reliable delivery. 20. Define concatenation. 21. Describe the need and use of duplication control. 22. When is upward multiplexing used? 23. When is a three way handshaking used? PART B 1. Illustrate the concepts of duties of transport layer. 2. Distinguish between TCP and UDP in detail. 3. Describe in detail about User Datagram Protocol. 4. Explain about congestion control. 5. Briefly explain about leaky bucket and token bucket algorithm. 6 Discuss in detail about Quality of Service. 7. Explain details about Transmission Control Protocol. 8. Write short notes on the following: i) Reliable delivery ii) Error control iii) Flow control 9. Explain in detail about Multiplexing. 10. Answer Briefly: i) End-to-End Delivery ii) Addressing iii) Reliable Delivery UNIT V APPLICATION LAYER PART - A 1. Discuss the three main division of the domain name space. 2. What is the use of local part? With example. 3. Discuss the TCP connections needed in FTP. 4. Discuss the basic model of FTP. 5. What is the function of SMTP? 6. Give the format of HTTP request message. 7. Define POP3. 8. Write down the three types of WWW documents.

9. Name four factors needed for a secure network. 10. What is a digital signature? 11. Give the format of HTTP response message. 12. List out the 2 components of SMTP. 13. Define UA. 14. What do you meant by MIME? 15. What is meant by Hypermedia? 16. Define static documents. 17. List out the structure of a web page. 18. Define CGI. 19. Write a note on URL. 20. Define Cryptography. PART B 1. Explain the functions of SMTP. 2. Write short notes on FTP. 3. Discuss in detail about HTTP. 4. Briefly explain the concept of WWW in detail. 5. Illustrate the concepts of Cryptography. 6. Describe in detail about DNS concepts. 7. List out the protocols in application layer, explain with example. 8. Explain the following in detail a) User Agent b) Mail Transfer Agent 9. Discuss in detail about CGI. 10. Illustrate the concepts of static & dynamic document in World Wide Web.

SOFTWARE ENGINEERING QUESTION BANK

UNIT 1-SOFTWARE PROCESS

PART A 1. What is software engineering? 2. What is Software? 3. Write out the reasons for the Failure of Water Fall Model. 4. What are the characteristics of the software? 5. Define the terms: i. Agility ii. Agile Team 6. What are the various categories of software? 7. What are the challenges in software? 8. Define software process 9. What are the fundamental activities of a software process? 10.What are the umbrella activities of a software process? 10.What are the merits of incremental model? 11.List the task regions in the Spiral model.13.What are the drawbacks of spiral model? 12.What is System Engineering? 13.List the process maturity levels in SEIs CMM. 14.What is an effectors process? 15.Define the computer based system. 16.What does Verification represent? 17.What does Validation represent? 18.What is the difference between the Known Risks and Predictable Risks? 19.What are the steps followed in testing? PART B

1. Explain iterative waterfall and spiral model for software life cycle and various activities in each phase. (16) 2. Explain about the incremental model. (16) 3. Explain in detail about the software process. (16) 4. Explain in detail about the life cycle process. (16) 5. Explain Spiral model and win-win spiral model in detail? (16)

UNIT II-SOFTWARE REQUIREMENTS PART A (2 marks)

1. What is the use of CMM? 2. Name the Evolutionary process Models. 3. What are the Objectives of Requirement Analysis? 4. What is requirement engineering? 5. What are the various types of traceability in software engineering? 6. Define software prototyping. 7. What are the Requirements Engineering Process Functions? 8. What are the benefits of prototyping? 9. What are the prototyping approaches in software process?

10.What are the Difficulties in Elicitation? 11.What are the advantages of evolutionary prototyping? 12.What are the various Rapid prototyping techniques? 13.What is the use of User Interface prototyping? 14.What is System Modeling? 15.What are the characteristics of SRS? 16.What are the objectives of Analysis modeling? 17.What is data modeling? 18.What is a data object? 19.What are attributes? 20.What is cardinality in data modeling? 21.What does modality in data modeling indicates? 22.What is ERD? 23.What is DFD? 24.What does Level0 DFD represent? 25.What is a state transition diagram? 26.Define Data Dictionary.

PART B

1. Explain in detail about Functional Modeling. (16) 2. Explain in detail about Structural Modeling. (16) 3. Explain in detail about data modeling. (16) 4. Explain about rapid prototyping techniques. (16) 5. Explain the prototyping approaches in software process. (16)

UNIT III-DESIGN CONCEPTS AND PRINCIPLES

PART A

1. What are the elements of Analysis model? 2. What are the elements of design model? 3. How the Architecture Design can be represented? 4. Define design process. 5. List the principles of a software design. 6. What is the benefit of modular design? 7. What is a cohesive module? 8. What are the different types of Cohesion? 9. What is coupling? 10.What are the various types of coupling? 11.What are the common activities in design process? 12.What are the benefits of horizontal partitioning? 13.What is vertical partitioning? 14.What are the advantages of vertical partitioning? 15.What are the various elements of data design? 16.List the guidelines for data design. 17.Name the commonly used architectural styles. 18.What is Transform mapping?

PART B

1. Explain in detail the design concepts. (16) 2. Explain the design principles. (16) 3. Explain the design steps of the transform mapping. (16) 4. Explain in detail about the real time systems. (16) 5. Explain in detail about SCM. (16)

UNIT IV-TESTING

PART A (2 marks)

1. What is a Real time system? 2. What is SCM? 3. What is SCI? 4. Define software testing? 5. Define Smoke Testing ? 6. What are the objectives of testing? 7. What are the testing principles the software engineer must apply while performing the software testing? 8. Define White Box Testing? 9. What are the two levels of testing? 10.What are the various testing activities? 11.Write short note on black box testing. 12.What is equivalence partitioning? 13.What is Regression Testing? 14.What is a boundary value analysis? 15.What are the reasons behind to perform white box testing? 16.What is cyclomatic complexity? 17.How to compute the cyclomatic complexity? 18.Distinguish between verification and validation. 19.What are the various testing strategies for conventional software? 20.Write about drivers and stubs. 21.What are the approaches of integration testing? 22.What are the advantages and disadvantages of big-bang? 23.What are the benefits of smoke testing? 24.What are the conditions exists after performing validation testing?

25.Distinguish between alpha and beta testing. 26.What are the various types of system testing?

PART B

1. Explain the types of software testing. (16) 2. Explain in detail about Black box testing. (16) 3. Explain about the software testing strategies. (16) 4. Explain in detail about Integration testing. (16) 5. Explain in detail about system testing. (16)

UNIT V-SOFTWARE PROJECT MANAGEMENT PART A (2 marks)

1. Define debugging. 2. What are the common approaches in debugging? 3. Write about the types of project plan. 4. Define measure. 5. Define metrics. 6. What are the types of metrics? 7. What are the advantages and disadvantages of size measure? 8. Write short note on the various estimation techniques. 9. What is the Objective of Formal Technical Reviews? 10.What is COCOMO model? 11.Give the procedure of the Delphi method. 12.What is the purpose of timeline chart? 13.What is EVA? 14.What are the metrics computed during error tracking activity? 15.Why software change occurs? 16.Write about software change strategies.

17.Define CASE Tools. 18.What is software maintenance? 19.Define maintenance. 20.What are the types of software maintenance? 21.What is architectural evolution? 22.How the CASE tools are classified? 23.What are the types of static testing tools? PART B

1. Explain about software cost estimation. (16) 2. Explain in detail about COCOMO model. (16) 3. Explain in detail about Delphi Method. (16) 4. Explain in detail about software Maintenance. (16) 5. Explain about CASE tools. (16)

CS1303 Theory of Computation

Srinivasan Engineering College, Perambalur. Department of Computer Science and Engineering QUESTION BANK

Subject Code /Title: CS1303 Theory of Computation Year / Sem: V UNIT-I AUTOMATA PART-A(2MARKS)

1. List any four ways of theorem proving. 2. Define Alphabets. 3. Write short notes on Strings. 4. What is the need for finite automata? 5. What is finite automata? Give two examples. 6. Define DFA. 7. Explain how DFA process strings. 8. Define transition diagram. 9. Define transition table. 10. Define the language of DFA. 11. Construct a finite automata that accepts {0,1}+ . 12. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings ending in 00. 13. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings with three consecutive 0s. 14. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings with 011 as a substring. 15. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings whose 10th symbol from the right end is 1.

16. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings such that each block of 5 consecutive symbol contains at least two 0s. 17. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings that either begins or end(or both) with 01. 18. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings such that the no of zeros is divisible by 5 and the no of 1s is divisible by 3. 19. Find the language accepted by the DFA given below. 20. Define NFA. 21. Define the language of NFA. 22. Is it true that the language accepted by any NFA is different from the regular language? Justify your Answer. 23. Define -NFA. 24. Define closure. 25. Find the closure for each state from the following automata.

CS1303 Theory of Computation

PART-B

1.a)If L is accepted by an NFA with -transition then show that L is accepted by an NFA without -transition. (8)

b)Construct a DFA equivalent to the NFA. M=({p,q,r},{0,1}, ,p,{q,s}) Where is defined in the following table.

(8)

P Q R S

0 {q,s} {r} {s} -

1 {q} {q,r} {p} {p} (6)

2. a)Show that the set L={an bn/n>=1} is not a regular.

b)Construct a DFA equivalent to the NFA given below:

(10)

P Q R S

0 {p,q} r s s

1 P R S

3.a)Check whether the language L=(0n 1n /n>=1) is regular or not? Justify your answer. (6)

b)Let L be a set accepted by a NFA then show that there exists a DFA that accepts L. (10)

4.Define NFA with -transition. Prove that if L is accepted by an NFA with -transition then L is also accepted by a NFA without transi tion. (16)

5.a)Construct a NDFA accepting all string in {a,b}+ with either two consecutive as or two consecutive bs. (8)

b)Give the DFA accepting the following language: set of all strings beginning with a 1 that when interpreted as a binary integer is a multiple of 5. (8)

6.Draw the NFA to accept the following languages.

(i) Set of Strings over alphabet {0,1,.9} such that the final digit has appeared before. (8)

CS1303 Theory of Computation

(ii)Set of strings of 0s and 1s such that there are two 0s separated by a number of positions that is a multiple of 4. (8)

7.a)Let L be a set accepted by an NFA.Then prove that there exists a deterministic finite automaton that accepts L.Is the converse true? Justify your answer. (10)

b)Construct DFA equivalent to the NFA given below:

(6)

8.a)Prove that a language L is accepted by some NFA if and only if L is accepted by some DFA. (8)

b)Consider the following NFA.Compute the closure of each state and find its equivalent DFA. (8)

p q *r {q} {r}

A {p}

b {q}

C {r}

9.a)Prove that a language L is accepted by some DFA if L is accepted by some NFA. (8)

b)Convert the following NFA to its equivalent DFA.

(8)

0 P Q R *s {p,q} {r} {s} {s}

1 {p} {r} {s}

CS1303 Theory of Computation

10.a)Explain the construction of NFA with transition from any given regular expression. (8)

b)Let A=(Q,, , q0 ,{qf ) be a DFA and suppose that for all a in we have (q0, a)= (qf ,a). Show that if x is a non empty string in L(A), then for all k>0,xk is also in L(A). (8)

UNIT-II REGULAR EXPRESSIONS AND LANGUAGES PART-A(2-MARKS) 1. Define Regular expression. Give an example. 2. What are the operators of RE. 3. Write short notes on precedence of RE operators. 4. Write Regular Expression for the language that have the set of strings over {a,b,c} containing at least one a and at least one b. 5. Write Regular Expression for the language that have the set of all strings of 0s and 1s whose 10th symbol from the right end is 1. 6. Write Regular Expression for the language that has the set of all strings of 0s and 1s with at most one pair of consecutive 1s. 7. Write Regular Expression for the language that have the set of all strings of 0s and 1s such that every pair of adjacent 0s appears before any pair of adjacent 1s. 8. Write Regular Expression for the language that have the set of all strings of 0s and 1s whose no of 0s is divisible by 5. 9. Write Regular Expression for the language that has the set of all strings of 0s and 1s not containing 101 as a substring. 10. Write Regular Expression for the language that have the set of all strings of 0s and 1s such that no prefix has two more 0s than 1s, not two more 1s than 0s. 11. Write Regular Expression for the language that have the set of all strings of 0s and 1s whose no of 0s is divisible by 5 and no of

1s is even. 12. Give English descriptions of the languages of the regular expression (1+ )(00*1)*0*. 13. Give English descriptions of the languages of the regular expression (0*1*)*000(0+1)*. 14. Give English descriptions of the languages of the regular expression (0+10)*1*. 15. Convert the following RE to -NFA.01*. 16. State the pumping lemma for Regular languages. 17. What are the application of pumping language? 18. State the closure properties of Regular language. 19. Prove that if L and M are regular languages then so is LUM. 20. What do you mean by Homomorphism?

Subject Code : Subject Name : Year/Semester :

QUESTION BANK CS1305 Visual Programming III/V

UNIT- I WINDOWS PROGRAMMING

PART A: 1. What is a window procedure in Windows Programming? 2. Write a simple windows program to print Hello World 3. When the WM_PAINT message is invoked in a Windows Program? 4. Define Registering of Window Class. 5. What are the events generating WM_PAINT message? 6. Define Event Driven Programming? 7. What are GDI primitives? 8. Mention any two functions provided by Windows for text output. 9. Explain in brief the Windows MSG structure. 10. Write notes on drawing lines and curves 11. What is Hungarian Notation? 12. What is Windows Programming? 13. List the main header files in Windows Programming? 14. What is Window? Give its types. 15. What are the steps required to create a Window. 16. What are the steps to display a Window? 17. Define Message Loop? 18. Define Device Context? 19. What are the methods for getting a DC handles 20. What is the use of Get Message, Translate Message and Dispatch Message? 21. What is WM_DESTROY message? 22. How a window program is terminated? 23. What is WM_CHAR message? 24. Define Child window? 25. List out some window styles which are related to child windows. PART B: 1. Write a program to create a window & display it. Explain the functions and parameter used. 2. Explain the architecture of a windows program. Explain the various structures used in the windows program. 3. Explain GDI function and GDI primitives and also explain the various methods 4. Write aWin32 program to draw different shapes using different colors and fill styles. 5. Explain in detail the GDI objects. 6. Write a program for Keyboard and Mouse events. 7. Write a program on Scroll bar. 8. Explain Child window controls. 9. Explain the various methods available to get the DC handle. 10. Explain Painting and Repainting?

UNIT- II VISUAL C++ PROGRAMMING- FUNDAMENTALS

PART A: 1. Define Application framework? 2. What are the mapping modes? 3. What are the device context classes? 4. What is MFC? 5. Differentiate modal and modeless dialog boxes? 6. List out the various ways to construct the frame window? 7. What is resource compiler and resource editor? 8. What is appWizard and classWizard? 9. What is event handling? 10. What are the attributes of a device context? 11. What is Resource -Definition statement? 12. What is resource script file? Describe the information that the script file can contain? 13. What is Message box? 14. What are the types of control in a Dialog Box? 15. Mention some of windows common controls? 16. What is bitmap and types of windows bitmaps? 17. What is color bitmap and monochrome bitmap? 18. What are the VC++ components? 19. What are GDI objects? 20. Define font? What are the types of GDI fonts? 21. Describe the resources available in VC++. 22. What are dialog controls? 23. Define message map? 24. Define parent-child window relationship? 25. Describe windows common dialogs? 26. Define ATL. PART B: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. Explain VC++ components in detail? Explain the application framework with example program. Explain Model and Modeless dialog boxes with example. Explain the different mapping modes. Compare and construct Write short notes on event handling Explain MFC library in detail. Explain windows common controls in detail. Write a VC++ program to draw a rectangle and ellipse. What is Bitmap? Explain in detail how bitmaps loading into your application. Write a VC++ program to illustrate use of different Colors and Fonts in window. Write a program to create Modal dialog box. Explain MFC classes in detail.

UNIT-III THE DOCUMENT AND VIEW ARCHITECTURE

PART A: 1. What are the features of document view architecture? 2. Differentiate SDI and MDI. 3. What is serialization? 4. What is Serialize function? 5. Hoe to make a class serialize.

6. Define splitter window. 7. Differentiate Static and Dynamic splitter window. 8. Define DLL and types of DLLs. 9. What are the major benefits of using run time linking? 10. Differentiate implicit linkage and explicit linkage. 11. How to debug a DLL. 12. What is tool bar and tool tip? 13. What are the applications of multiple views? 14. What is a menu? What are its types? 15. Mention two text editing tools. 16. Explain CFrameWnd? 17. Write the application of MDI. 18. What are the functions used to load a menu. 19. What is an accelerator? 20. What is rich edit control? 21. What is status bar? 22. What is reusable frame window? 23. What are the steps to be followed to build floating popup menus? 24. What are the characteristic of SDI frame window? 25. What is windows registry? 26. What is LoadLibrary() function 27. What is GetProcAddress() function PART B: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. Write a VC++ program to create a tool bar. Explain SDI and MDI applications in detail. Write a VC++ program to implement DLL Explain the document view architecture with a program. Develop a calculator using dialog based application. What is DLL? Explain its types and advantages in detail? Write a program to create a user defined DLL? Explain how the static splitter window is created in VC++. Explain splitter window and multiple views. What is Keyboard accelerator? Explain how to implement the accelerator in a Toolbar? Write a VC++ program to display mouse coordinates. Write a VC++ program to create a menu bar. Create a DLL to add and multiply two numbers and how it can be used in application.

UNIT- IV ACTIVEX AND OBJECT LINKING AND EMBEDDING (OLE)

PART A: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. What is an ActiveX control? List out the similarities and difference b/w ActiveX control and ordinary window control? Why ActiveX controls important? Define COM. List out the key features of COM. What is containment? What is Aggregation? What is OLE? Name two applications of OLE? What is object linking and object embedding? What is OLE Drag and Drop? Define DCOM?

12. 13. 14. 15. 16. 17. 18. 19. 20.

List out OLE features and specification. What is OLE containers and servers. What is COM class factory? What are the two methods in reference counting system to every COM interface? What is ActiveX Interface? How a COM Client calls out of process components? What is marshalling? Write short notes on Versioning? Define object model.

PART B: 1. What is an ActiveX control? Ho w to build an application that uses a calendar control in a dialog? 2. Write down the steps of MFC OLE drag and drop processing with a neat diagram? 3. What is OLE? Explain in detail. 4. Explain about OLE drag and drop. 5. Explain how COM calls component of In-process and Out-process? 6. Explain in detail container-component interaction? 7. Explain COM 8. Highlight the features of COM and write a program to implement COM? 9. Explain how you will add an ActiveX control during runtime with necessary program? 10. Explain Containment and Aggregation Vs Inheritance 11. Explain the steps involved in the creation of ActiveX Control? 12. Explain how COM works in detail.

UNIT-V ADVANCED CONCEPTS

PART A: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. What are the advantages of using a real DBMS? Define ODBC What is a Database Application: Define DAO. What are the types of Recordset used in ODBC? List out the components of ODBC Write down the steps to create Database Application using AppWizard? What is a thread? What are the two kinds of threads in windows? How to create a worker thread? Write down the situation that causes a thread to terminate? Define socket? What is Winsock? Define IIS and its function? Define WinInet. Mention any four differences b/w process and thread List out the components of OLEDB Architecture

17. 18. 19. 20.

Define ISAPI server extensions. What is RFX and where it is used. What are the applications of multithreading? What is the use of CRecordSet::dymanic?

PART B: 1. Explain how Database connectivity can be achieved using ODBC? Write necessary coding and also write coding to query the database. 2. Explain chat application? 3. State and explain about the classes in WININET. 4. Explain the multithreading concept in VC++ 5. Explain VC++ networking issues 6. Write a program in MFC to create a worker thread and explain how messages can be sending b/w main and worker thread? 7. How to add, modify and delete records in a Database? 8. Explain the following: a) DBMS b) SQL c) DAO d) ODBC 9. Explain the ODBC classes of MFC 10. Explain how threading is achieved in VC++ and write a single threaded program with implementing Progress bar. 11. Explain IIS with suitable example. 12. Explain how to use ISAPI extensions

CS1303 Theory of Computation

21. Suppose H is the homomorphism from the alphabets {0,1,2} to the alphabets {a,b} defined by h(0)=a h(1)=ab h(2)=ba. What is h(0120) and h(21120). 22. Suppose H is the homomorphism from the alphabets {0,1,2} to the alphabets {a,b} defined by h(0)=a h(1)=ab h(2)=ba. If L is the language L(01*2) what is h(L). 23. Let R be any set of regular languages is U Ri regular?Prove it. 24. Show that the compliment of regular language is also regular. 25. What is meant by equivalent states in DFA.

PART-B

1.a)Construct an NFA equivalent to (0+1)*(00+11)

(16)

2.a)Construct a Regular expression corresponding to the state diagram given in the following figure. (10)

b)Show that the set E={0i 1i |i>=1} is not Regular.

(6)

3.a)Construct an NFA equivalent to the regular expression (0+1)*(00+11)(0+1)*. (8)

b)Obtain the regular expression that denotes the language accepted by the following DFA. (8)

4.a)Construct an NFA equivalent to the regular expression ((0+1)(0+1)(0+1))* (8)

b)Construct an NFA equivalent to 10+(0+11)0*1

(8)

5.a)Obtain the regular expression denoting the language accepted by the following DFA

(8)

CS1303 Theory of Computation

b)Obtain the regular expression denoting the language accepted by the following DFA by using the formula Rijk . (8)

6.a)Show that every set accepted by a DFA is denoted by a regular Expression (8)

b)Construct an NFA equivalent to the following regular expression 01*+1. (8)

7.a)Define a Regular set using pumping lemma Show that the language L={0i2 / i is an integer,i>=1} is not regular (8)

b)Construct an NFA equivalent to the regular expression 10+(0+11) 0*1 (8) 8.a) Show that the set L={On2/n is an integer,n>=1} is not regular. (6)

b)Construct an NFA equivalent to the following regular expression ((10)+(0+1)* 01. (10)

9.a)Prove that if L=L(A) for some DFA A,then there is a regular expression R such that L=L(R). b) Show that the language {0p,p is prime} is not regular. 10.Find whether the following languages are regular or not. (ii) L={0n 1m 2n+m,n,m>=1} (iii) L={1k|k=n2,n>=1} . (4) (4) (10) (6)

CS1303 Theory of Computation

(iv) L1/L2={x | for some y L2,xy L1},where L1 and L2 are any two languages and L1/L2 is the quotient of L1 and L2. (4)

11.a) Find the regular expression for the set of all strings denoted by R213 from the deterministic finite automata given below: (8)

b)Verify whether the finite automata M1 and M2 below are equivalent over {a,b}.

given (8)

12.a)Construct transition diagram of a finite automaton corresponding to the regular expression (ab+c*)*b.

(8)

b)Construct a minimum state automaton equivalent to agiven automaton M whose transition table is given below. State Input a b

q1 q2 q3 q4 q5 q3 q0 q0 q1

q2 q4 q5 q6 q4

q5

(8)

CS1303 Theory of Computation

13.a)Find the regular expression corresponding to the finite automaton given below.

(8)

b)Find the regular expression for the set of all strings denoted by R223 from the deterministic finite automata given below. (8)

14.a)Find whether the languages {ww,w is in (1+0)*} and {1k | k=n2 , n>=1} are regular or not. (8)

b)Show that the regular languages are closed under intersection and reversal. (8)

UNIT- III CONTEXT FREE GRAMMARS AND LANGUAGES PART-A(2-MARKS) 1. Define CFG. 2.Find L(G)where G=({S},{0,1},{S->0S1,S->},S). 3. Define derivation tree for a CFG(or)Define parse tree. 4. Construct the CFG for generating the language L={an bn /n>=1}. 5. Let G be the grammar S->aB/bA,A->a/aS/bAA,B->b/bS/aBB.for the string aaabbabbba find the left most derivation. 6. Let G be the grammar S->aB/bA,A->a/aS/bAA,B->b/bS/aBB.obtain parse tree for the string aaabbabbba. 7. For the grammar S->aCa,C->aCa/b.Find L(G). 8. Show that id+id*id can be generated by two distinct leftmost derivation in the grammar E->E+E | E*E | (E) | id . 9. For the grammar S->A1B,A->0A | , B-> 0B | 1B| ,give leftmost and rightmost derivations for the string 00101.

10. Find the language generated by the CFG G=({S},{0,1},{S>0/1/ , S->0S0/1S1},S).

CS1303 Theory of Computation

11. Obtain the derivation tree for the grammar G=({S,A},{a,b},P,S) where P consist of S->aAS / a, A->SbA / SS / ba.

12. Consider the alphabet ={a,b,(,),+,*, . , } .Construct the context free grammar that generates all strings in * that are regular expression over the alphabet {a,b}.

13. Write the CFG to generate the set {am bn cp | m + n=p and p>=1}.

14. Construct a derivation tree for the string 0011000 using the grammar S->A0S | 0 | SS , A-> S1A | 10.

15. Give an example for a context free grammar.

16. Let the production of the grammar be S-> 0B | 1A, A-> 0 | 0S | 1AA, B-> 1|1S | 0BB.for the string 0110 find the right most derivation.

17. What is the disadvantages of unambiguous parse tree. Give an example.

18. Give an example of PDA.

19. Define the acceptance of a PDA by empty stack. Is it true that the language accepted by a PDA by empty stack or by that of final state are different languages. 20. What is additional feature PDA has when compared with NFA? Is

PDA superior over NFA in the sense of language acceptance? Justify your answer.

21. Explain what actions take place in the PDA by the transitions (moves)

(q,a,Z)={(p1,1),(p2, 2),..(pm, m)} and (q, ,Z)= {(p1,1),(p2, 2),..(pm, m)}.

22. What are the different ways in which a PDA accepts the language? Define them.

23. Is a true that non deterministic PDA is more powerful than that of deterministic PDA? Justify your answer.

24. Explain acceptance of PDA with empty stack.

25. Is it true that deterministic push down automata and non deterministic push down automata are equivalent in the sense of language of acceptances? Justify your answer.

26. Define instantaneous description of a PDA.

27. Give the formal definition of a PDA.

CS1303 Theory of Computation

28. Define the languages generated by a PDA using final state of the PDA and empty stack of that PDA.

29. Define the language generated by a PDA using the two methods of accepting a language.

30. Define the language recognized by the PDA using empty stack.

PART-B

1.a)Let G be a CFG and let a=>w in G. Then show that there is a leftmost derivation of w. (6)

b)Let G=(V,T,P,S) be a Context free Grammar then prove that if S=> then there is a derivation tree in G with yield . (10)

2.a)Let G be a grammar s->OB/1A, A->O/OS/1AA, B->1/1S/OBB. For the string 00110101 find its leftmost derivation and derivation tree. (4) b)If G is the grammar S->Sbs/a, Show that G is ambiguous. (6)

c)Give a detailed description of ambiguity in Context free grammar.(6)

3.a)Show that E->E+E/E*E/(E)/id is ambiguous.

(6)

b)Construct a Context free grammar G which accepts N(M), where

M=({q0, q1},{a,b},{z0,z},,q0,z0,) and where is given by (q0,b,z0)={(q0,zz0)} (q0, ,z0)={(q0, )}

(q0,b,z)={(q0,zz )} (q0,a,z)={(q1,z) } (q1,b,z)={(q1, )}

(q1,a,z0)={(q0,z0)}

(10)

4.a)If L is Context free language then prove that there exists PDA M such that L=N(M). (10)

b)Explain different types of acceptance of a PDA.Are they equivalent in sense of language acceptance? Justify your answer. (6)

CS1303 Theory of Computation

15.Construct a PDA accepting {anbman/m,n>=1} by empty stack. Also construct the corresponding context-free grammar accepting the same set. (16)

16.a)Prove that L is L(M2 ) for some PDA M2 if and only if L is N(M1) for some PDA M1. (10)

b)Define deterministic Push Down Automata DPDA. Is it true that DPDA and PDA are equivalent in the sense of language acceptance is concern? Justify Your answer. (4)

17.a)Construct a equivalent grammar G in CNF for the grammar G1 where G1 =({S,A,B},{a,b},{S->bA/aB,A->bAA/aS/a, B->aBB/bS/b},S) (12)

b)Find the left most and right most derivation corresponding to the tree. (4)

18.a)Find the language generated by a grammar G=({S},{a,b},{S>aSb, S->ab},S) (4)

b)Given G=({S,A},{a,b},P,S) where P={S->AaS|S|SS,A->SbA|ba} S-Start symbol. Find the left most and right most derivation of the string w=aabbaaa. Also construct the derivation tree for the

string w. (8) c)Define a PDA. Give an Example for a language accepted by PDA by empty stack. ` (4)

19.G denotes the context-free grammar defined by the following rules. ` S>ASB/ab/S S A->aA/A B->bB/A (i)Give a left most derivation of aaabb in G. Draw the associated parse tree. (ii)Give a right most derivation of aaabb in G. Draw the associated parse tree.

CS1303 Theory of Computation

(iii) Show that G is ambiguous. Explain with steps. (iv) Construct an unambiguous grammar equivalent to G. Explain. (4x4=16 ) 20a)Construct the grammar for the following PDA. M=({q0, q1},{0,1},{X,z0},,q0,Z0,) and where is given by

(q0,0,z0)={(q0,XZ0)}, (q0,1,X)={(q1, )}, (q1, ,X)={(q1, )},

(q0,0,X)={(q0,XX)}, (q1,1,X)={(q1, )}, (q1, , Z0 )={(q1, )}. (12)

b)Prove that if L is N(M1) for some PDA M1 then L is L(M2 ) for some PDA M2. (8)

21.a)Construct a PDA that recognizes the language

{ai bj ck| i,j,k>0 and i=j or i=k}.

(8)

b)Discuss about PDA acceptance

(1) From empty Stack to final state. (2) From Final state to Empty Stack. (8)

UNIT-IV PROPERTIES OF CONTEXTFREE LANGUAGES PART-A(2-MARKS) 1. Define multitape Turing Machine.

2. Explain the Basic Turing Machine model and explain in one move. What are the actions take place in

TM?

3. Explain how a Turing Machine can be regarded as a computing device to compute integer functions.

4. Describe the non deterministic Turing Machine model. Is it true the non deterministic Turing Machine models are more powerful than the basic Turing Machines? (In the sense of language Acceptance).

5. Explain the multi tape Turing Machine mode. Is it more power than the basic turing machine? Justify your answer.

6. Using Pumping lemma Show that the language L={ an bn cn |n>=1} is not a CFL.

7. What is meant by a Turing Machine with two way infinite tape.

8. Define instantaneous description of a Turing Machine.

CS1303 Theory of Computation

9. What is the class of language for which the TM has both accepting and rejecting configuration? Can this be called a Context free Language?

10. The binary equivalent of a positive integer is stored in a tape. Write the necessary transition to multiply that integer by 2.

11. What is the role of checking off symbols in a Turing Machine?

12. State Pumping lemma for Context free language.

13. Define a Turing Machine.

14. Mention any two problems which can only be solved by TM.

15. State Pumping lemma and its advantages.

16. What are useless symbols in a grammar.

PART-B

1.a)Find a grammar in Chomsky Normal form equivalent to S->aAD; A->aB/bAB; B->b, D->d. (6)

b)Convert to Greibach Normal Form the grammar G=({A1, A2, A3},{a,b},P,A1 ) where P consists of the following. A1 ->A2 A3, A2 ->A3 A1 /b,A3 ->A1 A2 /a. (10)

2.a)Show that the language {0n1n22/n>=1} is not a Context free

language. (6)

b)Convert the grammar S->AB, A->BS/b, B->SA/a into Greibach Normal Form. (10)

3.a)Construct a equivalent grammar G in CNF for the grammar G1 where G1 =({S,A,B},{a,b},{S->bA/aB,A->bAA/aS/a, B->aBB/bS/b},S) (12)

b)Obtain the Chomsky Normal Form equivalent to the grammar S->bA/aB, A->bAA/aS/a, B->aBB/bS/b. (4)

4.a)Begin with the grammar

S>0A0/1B1/BB A->C B->S/A C->S/ and simplify using the safe order Eliminate -Productions Eliminate unit production Eliminate useless symbols Put the (resultant) grammar in Chomsky Normal Form (10)

CS1303 Theory of Computation

b)Let G=(V,T,P,S) be a CFG. Show that if S=, then there is a derivation tree in a grammar G with yield . (6)

5.a)Let G be the grammar S->aS/aSbS/ . Prove that L(G)={x/each prefix of x has atleast as many a's as b's} (6)

b)Explain the Construction of an equivalent grammar in CNF for the grammar G=({S,A,B}{a,b},P,S)

where P={S->bA|aB, A->bAA|aS|a, B->aBB|bS|b}

(10)

6.a)Find a Context free grammar with no useless symbol equivalent to

S->AB/CA, B->BC/AB A->a, C->aB/b. (6)

b)Show that any CFL without can be generated by an equivalent grammar in Chomsky Normal Form. (10)

7.a)Convert the following CFG to CNF S->ASA|aB A->B|S B->b| (12)

b)Explain about Greibach Normal Form.

(4)

8.a)Is L={an bn cn /n>=1} a context free language? Justify Your answer. (8)

b)Prove that for every context free language L without there exists an equivalent grammar in Greibach Normal Form. (8)

9.State and Prove pumping lemma for Context free languages.

(16)

10.a)State Pumping Lemma for context free language. Show that (6) b)State Pumping lemma for context free language show anguage that l (6) {ai bj ci dj/i>=1, and j>=1} is not context-free. 11.a)Design a Turing Machine M to implement the function multipl using the subroutine copy. ication

CS1303 Theory of Computation

b)Explain how a Turing Machine with the multiple tracks of the tape can be used to determine the given number is prime or not. (4)

12.a)Design a Turing Machine to compute f(m+n)=m+n, V m,n>=0 and simulate their action on the input 0100. (10)

b)Describe the following Turing machine and their working. Are they more powerful than the Basic Turing Machine? Multi-tape Turing Machine Multi-Dimensional Turing Machine (3) Non-Deterministic Turing Machine. (6)

13.a) Define Turing machine for computing f(m,n)=m-n ( proper subtr actio n). (10) b)Explain how the multiple tracks in a Turing Machine can be used for testing given positive integer is a prime or not. (6)

14.a)Explain in detail: The Turing Machine as a Computer of integer functions. (8)

b)Design a Turing Machine to accept the language L={0n 1n/n>=1} (8)

15.a)What is the role of checking off symbols in a Turing Machine? (4)

b)Construct a Turing Machine that recognizes the language

{wcw/w in {a+b}+ }

(12)

16.Prove that the language L is recognized by a Turing Machine with a two way infinite tape if and only if it is recognized by a Turing Machine with a one way infinite tape. (16)

17.For each of the following Context free languages L, find the smallest pumping length that will satisfy the statement of the Context free pumping lemma. In each case, Your answer should include a number(the minimum pumping length), a detailed explanation of why that the number is indeed a valid pumping length for the given language L, and a detailed explanation of why no smaller number qualifies as a valid pumping length for that particular language L.

(i) L={an bn|n>=0} (ii) L={w in {a,b}*|w has the same number of as and bs} (iii)L={w in {a,b}*| w has twice as many as as bs.}

(6) (6) (4)

18.Design a Turing Machine M that decides A={0k /n>0 and k=2n } the language consisting of all strings of 0s whose length is a power of 2. (16)

CS1303 Theory of Computation

19.a)Give a High level implementation description with a neat sketch of a Turing Machine M that performs the following computation.M=on input w: writes a copy of w on the tape immediately after w,leaving the string w#w on the tape.Assume that the input string initially appears at the left most end of the tape and that the input alphabet does not contain the blank character : The end of the input string is therefore determined by the location of the first blank cell on the input tape. The symbol # is assumed to be in the tape alphabet,and the input alphabet is {a,b}. (12)

b)Demonstrate the working of your TM with an example.

(4)

20.a)Show that the language{0n 1n 2n/n>=1}is not context free. (8) b)Show that the context free languages are closed under union operation but not under intersection. (8)

UNIT-V UNDECIDABILITY PART-A (2-MARKS) 1. When a recursively enumerable language is said to be recursive. 2. Is it true that the language accepted by a non deterministic Turing Machine is different from recursively enumerable language? 3. When we say a problem is decidable? Give an example of undecidable problem?

4. Give two properties of recursively enumerable sets which are undecidable.

5. Is it true that complement of a recursive language is recursive? Justify your answer.

6. When a language is said to be recursive or recursively enumerable?

7. When a language is said to be recursive? Is it true that every regular set is not recursive?

8. When a problem is said to be decidable or undecidable? Give an example of an undecidable.

9. What do you mean by universal Turing Machine?

10. When a problem is said to be undecidable? Give an example of an decidable problem.

11. Show that the union of recursive language is recursive.

CS1303 Theory of Computation

12. Show that the union of two recursively enumerable languages is recursively enumerable.

13. What is undecidability problem?

14. Show that the following problem is undecidable.Given two CFGs G1 and G2, is L(G1)L(G2)=?.

15. Define Ld.

16. Define recursively enumerable language.

17. Give an example for a non recursively enumerable language.

19. Differentiate between recursive and recursively enumerable languages.

20. Mention any two undecidability properties for recursively enumerable language.

21. Define Diagonal languages. 22. Give an example for an undecidable problem.

PART-B

1.a)Show that union of recursive languages is recursive. b)Define the language Ld and show that Ld is not recursively

(4)

enumerable language.

(8)

c)Explain the Halting problem. Is it decidable or undecidable problem (4)

2.Define Universal language Lu.Show that Lu is recursively enumerable but not recursive.

(16)

3.a)Obtain the code for the TM M=({q1,q2,q3},{0,1},{0,1,B}, ,q1,B,{q2}) With the moves (q1,1)=(q3,0, R) (q3,0)=(q1,1,R ) (q3,1)=(q2,0,R ) (q3,B)=(q3,1,L ) (q3,B)=(q3,1,L) (4)

b)Show that Ln is recursively enumerable.

(12)

CS1303 Theory of Computation

4.a)Define Ld and show that Ld is not recursively enumerable.

(12)

b)Whether the problem of determining given recursively enumerable language is empty or not? Is decidable? Justify your answer. (4)

5.Define the language Lu. Check whether Lu is recursively enumerable? or Lu is recursive? Justify your answer. (16)

6.a)Show that the language Ld is neither recursive nor recursively enumerable.

(12)

b)Describe how a Turing Machine can be encoded with 0 and 1 and give an example. (4)

7.a)Show that any non trivial property J of the recursively enumerable languages is undecidable.

(8)

b)Show that if L and L are recursively enumerable then L and L recursive. (8)

8.Define the universal language and show that it is recursively enumerable but not recursive. (16)

9.Prove that the universal language Lu is recursively enumerable.

(16)

10.State and Prove Rices Theorem for recursive index sets.

(16)

11.a)Show that the following language is not decidable.

L={<M>| M is a TM that accepts the string aaab}.

(8)

b)Discuss the properties of Recursive and Recursive enumerable languages.

(8)

12.a)Define Post correspondence problem with an example.

(8)

b)Prove that the function f(n)=2n does not grow at a polynomial rate, in other words, it does not satisfy f(n)=O(np ) for any finite exponent p. (8)

13.a)Define the language Ld.Show that Ld is neither recursive nor recursively enumerable. (12)

b)Show that if a language L and its complement L are both recursively enumerable then L is recursive.

(4)

CS1303 Theory of Computation

14.a)What are the features of a Universal Turing Machine?

(4)

b)Show that If a language L and its compliment L are both recursively enumerable,then both languages are recursive. (6)

c)Show that halting problem of Turing Machine is undecidable. (6)

15.a)Does PCP with two lists x=(b,b ab3,ba) and y=(b3 ,ba , a)have a solution?.

(6)

b)Show that the characteristic function of the set of all even numbers is recursive. (6)

c)Let ={0,1}.Let A and B be the lists of three strings each,defined as

List A

List B

i Wi 1 1 2 10111 3 10 Does this PCP have a solution?

Xi 111 10 0 (4)

16.a)Show that it is undecidable for arbitrary CFGs G1 and G2 whether L(G1)L(G2)Is a CFL. (8)

b)Show that finding whether the given CFG is ambiguous or not is undecidable by reduction technique. (8)

17.Find whether the following languages are recursive or recursively enumerable. (i) Union of two recursive languages. (4)

(ii) Union of two recursively enumerable languages.

(4)

(iii) L if L and complement of L are recursively enumerable. (4) (iv)Lu 18. Consider the Turing Machine M and w=01, where M=({q1,q2,q3},{0,1},{0,1,B},,q1,B,{q3}) and is given by (4)

CS1303 Theory of Computation

qi Q1 q2 q3

(qi, 0) (q2,1,R) (q3, 0,L) 0,R) --

(qi, 1) (q2, 0,L) (q1, 0,R)

(qi, B) (q2, 1,L) (q2,

--

--

Reduce the above problem to Posts correspondence Problem and find whether that PCP has a solution or not. (16)

19. Explain the Posts Correspondence Problem with an example 20. Find the languages obtained from the following operations: (i) Union of two enumerable languages (ii) Union of two recursively recursive languages. (iii) L if L and complement of L are recursively enumerable

(16)

(6) (4)

**********

CSE II YEAR QUESTION BANK

SRINIVASAN ENGINEERING COLLEGE, PERAMBALUR-621212 DEPARTMENT OF ECE
SUB. CODE/SUB. NAME: CS2204 ANALOG AND DIGITAL COMMUNICATION BRANCH/SEM/YEAR: CSE/III/II UNIT - I FUNDAMENTALS OF ANALOG COMMUNICATION PART-A (2 Marks) 1. Define amplitude modulation 2. Define modulation Index. 3. What is the highest modulation Index and percent modulation possible with a Conventional AM system without causing excessive distortion? 4. For 100% modulation what is the relationship between the voltage amplitudes of the side band frequencies and the carrier? 5. What does AM-DSBFC stand for? 6. Describe the relationship between the carrier and sideband powers in an AM DSBFC wave. 7. Draw The Amplitude Modulation Wave Forms With Modulation Index (m) =1, m<1, m>1. 8. The antenna current of an AM transmitter is 8A when only carrier is sent. It increases to 8. when The carrier is modulated by a single sine wave. Find the percentage modulation. 9. Compare AM with DSB-SC and SSB-SC. 10. Define image frequency 11. Define Angle modulation 12. Draw the FM and PM waveforms 13. Draw The Phasor Diagram Of Narrow Band FM. 14. What is the need of Pre-emphasis and de-emphasis in FM transmission?. 15. Name Different Types of FM Detectors. 16. Define Modulation Index for FM and PM. 17. Compare FM with AM. 18. State Carsons general rule for determining the bandwidth for an angle modulated wave. PART-B (16 Marks) 19. Define AM. Derive the expression for AM wave (16) 20. Explain about coherent detection of AM with carrier. (16) 21. Draw the block diagram of AM Superhetrodyne receiver and explain function of each block. (16) 22. Define FM. Derive the equation of FM wave. (16) UNIT - II DIGITAL COMMUNICATION PART-A (2 Marks) 1. State shannons Hartley law of information capacity. 2. Differentiate bit rate and baud rate. 3. Give the expression of peak frequency deviation of FSK.

4. 5. 6. 7. 8. 9.

Define modulation index of FSK. What is M-ary encoding What is QAM. Define Bandwidth efficiency. List the methods of achieving carrier recovery. Give the principles of PLL.

PART-B (16 Marks) 10. 11. 12. 13. 14. What is frequency shift keying? Explain in detail about FSK transmitter and receiver.(16) With a neat schematic diagram, explain the Balanced ring modulator of BPSK (16) Briefly explain the BPSK transmitter and BPSK receiver (16) Explain the operation of QPSK transmitter and receiver. (16) (i)Describe the two techniques of achieving carrier recovery circuit. (16) (ii)Discuss in detail about the DPSK transmitter and DPSK receiver 15. Explain in detail about 8 QAM transmitter and receiver. (16)

UNIT - III DIGITAL TRANSMISSION PART-A (2 Marks) 1. What is the purpose of sample and hold circuit 2. What is the difference between natural sampling and flat top sampling 3. What is Nyquist Sampling rate. 4. Define quantization and quantization error 5. Define A law companding and law companding 6. Define the term Aliasing 7. Give the concept of delta modulation 8. Define eye pattern 9. Define forward error correction 10. Define CRC 11. What is ISI? 12. What you mean by slope over load distortion 13. How the granular noise can be reduced. 14. What is meant by Pulse Amplitude Modulation (PAM) PART-B (16 Marks) 15. Explain in detail about the operation of PCM transmitter and receiver. (16) 16. (i) Explain delta modulation with the help of transmitter and receiver diagrams. (12) (ii) What is Quantizing error? Illustrate with an example. (4) 17. (i) Explain the operation of DPCM transmitter and receiver (8) (ii) Explain in detail about ISI & Eye diagram (8) 18. What is meant by companding , Describe the concept of analog companding. (16) 19. With a neat sketch explain the operations of digital companding (16)

UNIT - IV DATA COMMUNICATIONS PART-A (2 Marks) 1. List some standard organization for data communication 2. What is meant by DTE and DCE? 3. What are the types of data transmission? 4. What is the difference between serial and parallel transmission? 5. What is meant by transmission modes and give its types. 6. What are the types of characters used in data communication codes. 7. What is meant by Baudot code? 8. What is meant by the term Checkcum 9. What is the use of scrambler and descrambler.. 10. What is the difference between synchronous and asynchronous modem

PART-B (16 Marks) 11. Give brief note on the various data communication codes used in the network (16) 12. With an equivalent example, explain the various error detection techniques (16) 13. What is meant by UART ? Explain the operation of UART transmitter & receiver (16) 14. What is meant by RS232 serial interface ? Explain the operation and pin diagram. (16) 15. With a neat block diagram, explain the concept of UART transceiver operation (16) 16. With an equivalent example, explain the various error detection techniques (16) 17. What are parallel interfaces? Describe in detail about centronics parallel interface (16) 18. (i) Describe in detail about medium and high speed modems. (8) (ii) Differentiate between Synchronous and Asynchronous modem. (8) UNIT V SPREAD SPECTRUM AND MULTIPLE ACCESS TECHNIQUES PART-A (2 Marks) 1. What is the need for spread spectrum? 2. List out Characteristics of Spread Spectrum Modulation. 3. Define frequency hopping spread spectrum. 3. What is Spread Spectrum? 4. What are the types of Spread Spectrum? 5. Define and express PN sequence using bipolar sequence. 6. Define Hand off technique. 7. Define CDMA 8. Define multi path propagation 9. Define GSM 10. Draw the frame structure of GSM 11. What is source coding of speech? List the types of Predictive coding 12. Define processing gain. 13. What are the roles of mobile switching center. PART-B (16 Marks) 12. (i)Describe direct sequence spread spectrum with coherent BPSK (8) (ii) Derive Processing gain for spread spectrum system (8) 14. (i) Describe Slow and Fast Frequency Hopping (8) (ii) Draw the block diagram of RAKE receiver and explain the operation (8) 15 (i) Give the advantages associated with spreading a signal spectrum. (6) (ii) Describe the structure of feedback shift register for generating PN sequences. (10)

16 (i) Explain FH-CDMA acquisition and tracking with neat sketches. (8) (ii) Compare TDMA,FDMA and CDMA multiple access techniques. (8)

CS2201 DATASTRUCTURES UNIT I LINEAR STRUCTURES Part-A 1. Define data structures. 2. Define primary data structures. 3. Define static data structures. 4. Define linear data structures. 5. Define non linear data structures. 6. List the basic operations carried out in a linked list. 7. List the advantages in using linked list. 8. List out the disadvantages in using linked list. 9. List out the applications of a linked list. 10. 11. 12. 13. State the difference between arrays and linked list. Define ADT. What are the advantages of doubly linked list over singly List the applications of List ADT.

linked list?

14. 15. 16. 17. 18. 19. 20. 21. 22. 23.

Write a procedure for polynomial different iation. What is multilist? What is the principle of radix sort? List the applications of Stack? Define queue data structure and give applications of it? What is Dequeue? What is circular queue? What is priority queue? Define stack. Differentiate Stack and queue.

Part B 1. What are the various linked list operations? Explain. 2. Explain cursor implementation of List. 3. Write the operations performed on singly linked list? 4. Write the recursive function of tower of Hanoi? 5. Explain the array and linkedlst implementation of stack. 6. Explain the array and linkedlst implementation of queue. 7. What are the various linked list operations? 8. Explain polynomial ADT in detail. 9. What are the types of notations to represent arithmetic expression? 10. How to balancing the symbols in using stack.Explain with neat diagram.

UNIT II&III TREE STRUCTURES& BALANCED TREES Part-A

1. Compare general tree and binary tree. 2. Define the following terminologies in a tree a. Siblings b. Depth,Path c. Height 3. What is complete binary tree? 4. Define binary search tree. 5. Give the array and lnked list representation of tree with an example. 6. Define tree traversals. 7. Write a routine to find the maximum element in a given tree. 8. Write the recursive procedure for inorder traversals? 9. How is a binary tree represented using an array? 10. 11. 12. 13. 14. 15. 16. 17. 18. Define AVL tree. What are the two properties o a binary heap. Define B-tree. What do you mean by self adjusting tree? Write a routine to perform single rotate with left. List the operations performed on priority queue. Differenitiate between binary tree and binary search tree. Differentiate between general tree and binary tree. What is threaded binary tree?

Part-B 1. Write an algorithm to find an element from binary search tree. 2. Write a program to insert and delete an element from binary search tree 3. Write a routine to generate the AVL tree. 4. What are the different tree traversal techniques? Explain with examples.

5. Write a function to perform insertion and delete min in a binary heap? 6. Write a routine to perform insertion into a B-tree. 7. Explain the operations performed on a threaded binary tree in detail.

UNIT IV HASHING & SETS Part-A 1. Define hashing. 2. Write a routine to find to perform hash function. 3. What is collision? What are the different collision resolving techniques? 4. What is open addressing? 5. What is separate chaining? 6. What do you mean by resolving? 7. What is an extendible hashing? 8. Define equivalence relation. 9. What are the two strategies to solve dynamic equivalence problem? 10. List out the different types of algorithm to perform the union operations.

11. 12. 13. ADT? 14. ADT? 15.

What is path compression? Write the code to find an element with path compression? Write the routine to perform union operation in disjoint set Write the routine to perform find operation in disjoint set Define equivalence class.

Part-B 1. Define hash function. Write routines to find and insert an element in separate chaining. 2. Explain re-hashing techniques to avoid collision. 3. Explain extendible hashing to resolve collision. 4. Write a note an dynamic equivalence problem. 5. Explain the basic data structure for disjoint set ADT. 6. Write routine to perform union by rank.

UNITV GRAPHS

Part-A 1. Define graph.

2. Comapre directed and undirected graph. 3. Define path,dgree,cycle in a graph. 4. What is an adjancency matrix? 5. Define toplogical sort. 6. Define shortest path algorithm. 7. Define minimum spanning tree and its properties. 8. What is DAG? Write its purpose. 9. What are various applications of depth first search? 10. 11. 12. 13. 14. 15. 16. 17. 18. What is an articulation point? When a graph is said to be bi-connected? Define class _NP. What is meant by NP_Complete problem? Define euler oath. Define euler circuit. Write routine for BFS? Write down recursive routine for DFS. Write a procedure to check the bioonnectivity of the graph

using DFS.

Part-B 1. Write down pseudocode to perform topological sort. 2. Explain Prims algorithm. 3. Explain BFS in detail? 4. Explain krusals algorithm? 5. Expalin DFS in detail? 6. Explain about euler circuit in detail?

SRINIVASAN ENGINEERING COLLEGE

DEPARTMENT Sub Name Branch/Sem

: : :

ECE CS1202-Digital Principles and System Design CSE/II

Question Bank Unit I Boolean algebra and Logic Gates

Part A 1. Find the hexadecimal equivalent of the decimal number 256 2. Find the octal equivalent of the decimal number 64 3. What is meant by weighted and non-weighted coding? 4. Convert A3BH and 2F3H into binary and octal respectively 5. Find the decimal equivalent of (123)9 6. Find the octal equivalent of the hexadecimal number AB.CD 7. Encode the ten decimal digits in the 2 out of 5 code 8. Show that the Excess 3 code is self complementing 9. Find the hexadecimal equivalent of the octal number 153.4 10. Find the decimal equivalent of (346)7

11. A hexadecimal counter capable of counting up to at least (10,000)10 is to be constructed? What is the minimum number of hexadecimal digits that the counter must have? 12. Convert the decimal number 214 to hexadecimal 13. Convert 231.3 4 to base 7 14. Give an example of a switching function that contains only cyclic prime implicant 15. Give an example of a switching function that for which the MSP from is not unique. 16. Express x+yz as the sum of minterms 17. What is prime implicant? 18. Find the value of X = A B C (A+D) if A=0; B=1; C=1 and D=1 19. What are minterms and maxterms? 20. State and prove Demorgans theorem 21. Find the complement of x+yz 22. Define the following : minterm and term 23. State and prove Consensus theorem 24. What theorem is used when two terms in adjacent squares of K map are combined? 25. How will you use a 4 input NAND gate as a 2 input NAND gate? 26. How will you use a 4 input NOR gate as a 2 input NOR gate? 27. Show that the NAND connection is not associative 28. What happens when all the gates is a two level AND-OR gate network are replaced by NOR gates?

29. What is meant by multilevel gates networks? 30. Show that the NAND gate is a universal building block 31. Show that a positive logic NAND gate is the same as a negative logic NOT gate 32. Distinguish between positive logic and negative logic 33. Implement AND gate and OR gate using NAND gate 34. What is the exact number of bytes in a system that contains (a) 32K byte, (b) 64M bytes, and (c) 6.4G byte? 35. List the truth table of the function: F = x y + x y + y z

Part B 1. (a) Explain how you will construct an (n+1) bit Gray code from an n bit Gray code (b) Show that the Excess 3 code is self complementing 2. (a) Prove that (x1+x2).(x1. x3+x3) (x2 + x1.x3) =x1x2 (b) Simplify using K-map to obtain a minimum POS expression: (A + B+C+D) (A+B+C+D) (A+B+C+D) (A+B+C+D) (A+B+C+D) (A+B+C+D) 3. Reduce the following equation using Quine McClucky method of minimization F (A,B,C,D) = _m(0,1,3,4,5,7,10,13,14,15) 4. (a) State and Prove idempotent laws of Boolean algebra. (b) using a K-Map ,Find the MSP from of F= _(0,4,8,12,3,7,11,15) +_d(5)

5 (a) With the help of a suitable example , explain the meaning of an redundant prime implicant (b) Using a K-Map, Find the MSP form of F= _ (0-3, 12-15) + _d (7, 11) 6 (a) Simplify the following using the Quine McClusky minimization technique D = f(a,b,c,d) = (0,1,2,3,6,7,8,9,14,15).Does Quine McClusky take care of dont care conditions? In the above problem, will you consider any dont care conditions? Justify your answer (b) List also the prime implicants and essential prime implicants for the above case 7 (a) Determine the MSP and MPS focus of F= (0, 2, 6, 8, 10, 12, 14, 15) (b) State and Prove Demorgans theorem 8 Determine the MSP form of the Switching function F= ( 0,1,4,5,6,11,14,15,16,17,20-

22,30,32,33,36,37,48,49,52,53,56,63) 9. (a) Determine the MSP form of the Switching function F( a,b,c,d) = (0,2,4,6,8) + d(10,11,12,13,14,15)

(b) Find the Minterm expansion of f(a,b,c,d) = a(b+d) + acd 10. Simplify the following Boolean function by using the Tabulation Method F= (0, 1, 2, 8, 10, 11, 14, 15)

11. State and Prove the postulates of Boolean algebra 12. (a) Find a Min SOP and Min POS for f = bcd + bcd + acd + abc + abcd 13. Find an expression for the following function usingQuine McCluscky method F= (0, 2, 3,5,7,9,11,13,14,16,18,24,26,28,30)

14 State and Prove the theorems of Boolean algebra with illustration 15 Find the MSP representation for F(A,B,C,D,E) = _m(1,4,6,10,20,22,24,26) + _d (0,11,16,27) using K-Map method Draw the circuit of the minimal expression using only NAND gates 16. (a) Show that if all the gates in a two level AND-OR gate networks are replaced by NAND gates the output function does not change (b) Why does a good logic designer minimize the use of NOT gates? 17 Simplify the Boolean function F(A,B,C,D) = _ m (1,3,7,11,15) + _d (0,2,5) .if dont care conditions are not taken care, What is the simplified Boolean function .What are your comments on it? Implement both circuits 18. (a) Show that if all the gate in a two level OR-AND gate network are replaced by NOR gate, the output function does not change. (b) Implement Y = (A+C) (A+D) ( A+B+C) using NOR gates only 19. (a) F3 = f(a,b,c,d) = _(2,4,5,6) F2 = f(a,b,c,d) = (2,3,,6,7) F1 = f(a,b,c,d) = (2,5,6,7) .Implement the above Boolean functions (i) When each is treated separately and (ii)When sharing common term (b) Convert a NOR with an equivalent AND gate 20. Implement the Switching function whose octal designation is 274 using NAND gates only

21. Implement the Switching function whose octal designation is 274 using NOR gates only 22. (a) Show that the NAND operation is not distributive over the AND operation (b) Find a network of AND and OR gate to realize f(a,b,c,d) = m (1,5,6,10,13,14) 23. What is the advantages of using tabulation method? Determine the prime implicants of the following function using tabulation method F( W,X,Y,Z) = (1,4,6,7,8,9,10,11,15)

23. (a) Explain about common postulates used to formulates various algebraic structures (b) Given the following Boolean function F= AC + AB + ABC + BC Express it in sum of minterms & Find the minimal SOP expression

Unit II Combinational Logic

Part A 1. How will you build a full adder using 2 half adders and an OR gate? 2. Implement the switching function Y= BC + AB + D 3. Draw 4 bit binary parallel adder 4. Write down the truth table of a full adder 5. Write down the truth table of a full sub tractor 6. Write down the truth table of a half sub tractor 7. Define Combinational circuits

8. Define Half and Full adder 9. Give the four elementary operations for addition and subtraction 10. Design the combinational circuit with 3 inputs and 1 output. The output is 1 when the binary value of the inputs is less than 3.The output is 0 otherwise 11. Define HDL 12. What do you mean by carry propagation delay? 13. What is code converter? 14. Give short notes on Logic simulation and Logic synthesis 15. What do you mean by functional and timing simulation? 16. What do you mean by test bench? 17. Give short notes on simulation versus synthesis 18. Define half sub tractor and full sub tractor

Part B 1. Design a 4 bit magnitude comparator to compare two 4 bit number 2. Construct a combinational circuit to convert given binary coded decimal number into an Excess 3 code for example when the input to the gate is 0110 then the circuit should generate output as 1001 3. Design a combinational logic circuit whose outputs are F1 = abc + abc and F2 = a + bc + bc 4. (a) Draw the logic diagram of a *-bit 7483 adder (b) Using a single 7483, Draw the logic diagram of a 4 bit adder/sub tractor

5. (a) Draw a diode ROM, which translates from BCD 8421 to Excess 3 code (b) Distinguish between Boolean addition and Binary addition 6. Realize a BCD to Excess 3 code conversion circuit starting from its truth table 7. (a) Design a full sub tractor (b) How to it differ from a full sub tractor 8. Design a combinational circuit which accepts 3 bit binary number and converts its equivalent excess 3 codes 9. Derive the simplest possible expression for driving segment a through g in an 8421 BCD to seven segment decoder for decimal digits 0 through 9 .Output should be active high (Decimal 6 should be displayed as 6 and decimal 9 as 9) 10. Write the HDL description of the circuit specified by the following Boolean function (i) Y= (A+B+C) (A+B+C) (ii) F= (AB + AB) (CD+CD) (iii) Z = ABC + AB + A(D+B) (iv) T= [(A+B} {B+C+D)] 11. Design 16 bit adder using 4 7483 ICs

Unit III Design with MSI Devices

Part A

1. What is a decoder and obtain the relation between the number of inputs n and outputs m of a decoder? 2. Distinguish between a decoder and a demultiplexer 3. Using a single IC 7485 ; draw the logic diagram of a 4 bit comparator 4. what is decoder 5. What do you mean by encoder? 6. Write the short notes on priority encoder 7. What is multiplexer? Draw the logic diagram of8 to 1 line multiplexer 8. What do you mean by comparator? 9. Write the HDL description of the circuit specified by the following Boolean function X=AB+ACD+BC 10. How does ROM retain information? 11. Distinguish between PAL and PLA 12. Give the classification of memory 13. What is refreshing? How it is done? 14. What is Hamming code? 15. Write short notes on memory decoding 16. List the basic types of programmable logic devices 17. What is PAL? How it differ from PROM and PLA? 18. Write a short notes on PROM, EPROM, EEPROM

19. How many parity bits are required to form Hamming code if massage bits are 6? 20. How to find the location of parity bits in the Hamming code? 21. Generate the even parity Hamming codes for the following binary data 1101, 1001 22. A seven bit Hamming code is received as 11111101. What is the correct code? 23. Compare static RAMs and dynamic RAMs 24. Define Priority encoder 25. Define PLDs

Part B 1. Implement the switching function F= (0,1,3,4,7) using a 4 input MUX and explain 2. Explain how will build a 64 input MUX using nine 8 input MUXs 3. State the advantages of complex MSI devices over SSI gates 4. Implement the switching function F(A,B,C) = ( ,2,4,5) using the DEMUX 74156 5. Implement the switching function F= (0,1,3,4,12,14,15) using an 8 input MUX 6. Explain how will build a 16 input MUX using only 4 input MUXs 7. Explain the operation of 4 to 10 line decoder with necessary logic diagram

8. Draw a neat sketch showing implementation of Z1 = abde + abce + bc + de , Z2 = ace, Z3 = bc +de+cde+bd and Z4 = ace +ce using a 5*8*4 PLA 9. Implement the switching functions: Z1 = abde + abce + bc + de , Z2 = ace, Z3 = bc +de+cde+bd and Z4 = ace +ce Using a 5*8*4 PLA 10. Design a switching circuit that converts a 4 bit binary code into a 4 bit Gray code using ROM array 11.Design a combinational circuit using a ROM ,that accepts a 3- bit number and generates an output binary number equal to the square of the given input number

Unit IV Synchronous Sequential Logic

Part A 1. Derive the characteristic equation of a D flip flop 2. Distinguish between combinational and sequential logic circuits 3. What are the various types of triggering of flip-flops? 4. Derive the characteristic equation of a T flip flop 5. Derive the characteristic equation of a SR flip flop

6. What is race round condition? How it is avoided? 7. List the functions of asynchronous inputs 8. Define Master slave flip flop 9. Draw the state diagram of T FF, D FF 10. Define Counter 11. What is the primary disadvantage of an asynchronous counter? 12. How synchronous counters differ from asynchronous counters? 13. Write a short note on counter applications 14. Compare Moore and Mealy models 15. When is a counter said to suffer from lock out? 16. What is the minimum number of flip flops needed to build a counter of modulus z 8? 17. State the relative merits of series and parallel counters 18. What are Mealy and Moore machines? 19. When is a counter said to suffer from lockout? 20. What is the difference between a Mealy machine and a Moore Machines? 21. Distinguish between synchronous and asynchronous sequential logic circuits 22. Derive the characteristic equation of a JK flip flop 23. How will you convert a JK flip flop into a D flip flop 24. What is mean by the term edge triggered?

25. What are the principle differences between synchronous and asynchronous networks 26. What is lockout? How it is avoided? 27. What is the pulse mode operation of asynchronous sequential logic circuits not very popular? 28. What are the advantages of shift registers? 29. What are the applications of a shift register? 30. How many flip flops are needed to build an 8 bit shift register? 31. A shift register comprises of JK flip-flops. How will you complement of the counters of the register 32. List the basic types of shift registers in terms of data movement. 33. Write a short notes on PRBS generator 34. Give the HDL dataflow description for T flip - flop 35. Give the HDL dataflow description for JK flip flop

Part B

1. Draw the state diagram and characteristics equation of T FF, D FF and JK FF 2. (a) What is race around condition? How is it avoided? (b) Draw the schematic diagram of Master slave JK FF and input and output waveforms.Discuss how it prevents race around condition

3. Explain the operation of JK and clocked JK flip-flops with suitable diagrams 4. Draw the state diagram of a JK flip- flop and D flip flop 5. Design and explain the working of a synchronous mod 3 counter 6. Design and explain the working of a synchronous mod 7 counter 7. Design a synchronous counter with states 0,1, 2,3,0,1 . Using JK FF 8. Using SR flip flops, design a parallel counter which counts in the sequence 000,111,101,110,001,010,000 . 9. Using JK flip flops, design a parallel counter which counts in the sequence 000,111,101,110,001,010,000 . 10. (a) Discuss a decade counter and its working principle (b) Draw as asynchronous 4 bit up-down counter and explain its working 11. (a) How is the design of combinational and sequential logic circuits possible with PLA? (b) Mention the two models in a sequential circuit and distinguish between them 12. Design a modulo 5 synchronous counter using JK FF and implement it. Construct its timing diagram 13. A sequential machine has one input line where 0s and 1s are being incident. The machine has to produce a output of 1 only when exactly two 0s are followed by a 1or exactly two 1s are followed by a 0.Using any state assignment and JK flipflop,synthesize the machine

14. Using D flip flop ,design a synchronous counter which counts in the sequence 000, 001, 010, 011, 100, 1001,110,111,000 15. Using JK flip-flops, design a synchronous sequential circuit having one and one output. the output of the circuit is a 1 whenever three consecutive 1s are observed. Otherwise the output is zero 16. Design a binary counter using T flip flops to count in the following sequences: (i) 000,001,010,011,100,101,110,111,000 (ii) 000,100,111,010,011,000 17. (a) Design a synchronous binary counter using T flip flops (b) Derive the state table of a serial binary adder 18. Design a 3 bit binary Up-Down counter 19. (i) Summarize the design procedure for synchronous sequential circuit (ii) Reduce the following state diagram

Unit V Asynchronous Sequential Logic

Part A 1. Distinguish between fundamental mode and pulse mode operation of asynchronous sequential circuits 2. What is meant by Race? 3. What is meant by critical race? 4. What is meant by race condition in digital circuit? 5. Define the critical rate and non critical rate 6. What are races and cycles? 7. What is the significance of state assignment? 8. What are the steps for the analysis of asynchronous sequential circuit? 9. What are the steps for the design of asynchronous sequential circuit? 10. Write short notes on (a) Shared row state assignment (b) One hot state assignment 11. What are Hazards? 12. What is a static 1 hazard? 13. What is a static 0 hazard? 14. What is dynamic hazard? 15. Define static 1 hazard, static 0 hazards, and dynamic hazard?

16. Describe how to detect and eliminate hazards from an asynchronous network? 17. What is static hazard? 18. List the types of hazards? 19. How to eliminate the hazard? 20. Draw the wave forms showing static 1 hazard? Part B

1. What is the objective of state assignment in asynchronous circuit? Give hazard free realization for the following Boolean function f(A,B,C,D) = M(0,2,6,7,8,10,12) 2. Summarize the design procedure for asynchronous sequential circuit a. Discuss on Hazards and races b. What do you know on hardware descriptive languages? 3. Design an asynchronous sequential circuit with 2 inputs X and Y and with one output Z Wherever Y is 1, input X is transferred to Z .When Y is 0; the output does not change for any change in X.Use SR latch for implementation of the circuit 4. Develop the state diagram and primitive flow table for a logic system that has 2 inputs,x and y and an output z.And reduce primitive flow table. The behavior of the circuit is stated as follows. Initially x=y=0. Whenever x=1 and y = 0 then z=1, whenever x = 0 and y = 1 then z = 0.When x=y=0 or x=y=1 no change in z ot remains in the previous state. The logic system has edge triggered inputs with out having a clock .the logic system changes

state on the rising edges of the 2 inputs. Static input values are not to have any effect in changing the Z output 5. Design an asynchronous sequential circuit with two inputs X and Y and with one output Z. Whenever Y is 1, input X is transferred to Z.When Y is 0,the output does not change for any change in X. 6. Obtain the primitive flow table for an asynchronous circuit that has two inputs x,y and one output Z. An output z =1 is to occur only during the input state xy = 01 and then if the only if the input state xy =01 is preceded by the input sequence. 7. A pulse mode asynchronous machine has two inputs. It produces an output whenever two consecutive pulses occur on one input line only .The output remains at 1 until a pulse has occurred on the other input line. Draw the state table for the machine. 8. (a) How will you minimize the number of rows in the primitive state table of an incompletely specified sequential machine (b) State the restrictions on the pulse width in a pulse mode asynchronous sequential machine 9. Construct the state diagram and primitive flow table for an asynchronous network that has two inputs and one output. The input sequence X1X2 = 00,01,11 causes the output to become 1.The next input change then causes the output to return to 0.No other inputs will produce a 1 output --------------------------------------------------------*************---------------------------------------------------------

SRINIVASAN ENGINEERING COLLEGE, PERAMBALUR

Environmental science and engineering

Question Bank (8 marks)

UNIT-I 1. a) Explain in detail the causes, effects and control measures of Deforestation b) Discuss the problems of fertilizers and pesticides of modern agriculture 2. a) Discuss the effects of dams on forests and tribal people b) Discuss the various types of land degradation with its causes and solutions. 3. Write short notes on causes effects and control measures of soil erosion 4. Write short notes on environmental impacts of mining 5. Write short notes on renewable energy resources

UNIT-II 1. Explain in detail the structure and component of an eco system. 2. Explain the characteristic features and functions of forest eco system and aquatic eco system 3. Explain the characteristic features and functions of Grassland eco system and Desert eco system 4. Write short notes on food chain and food web 5. Write short notes on ecological succession and ecological pyramids 6. Write short notes on i)Genetic diversity ii) Species diversity iii) Ecosystem diversity 7. Write short notes on threats to bio diversity 8. Write short notes on hotspots of biodiversity 9. Discuss Indias mega-diverse biodiversity 10. a)Explain the In-situ and Ex-situ conservation of biodiversity b) Discuss the values of Bio-diversity UNIT-III 1. Explain in detail the causes and effects of air and water pollution 2. Explain in detail the causes and effects of marine and noise pollution 3. Write short notes on (i) Bhopal gas tragedy and (ii) Chernobyl disaster 4. Write short notes on Disaster management 5. What is an earth quake? Enumerate its effects. What measures should be taken to mitigate this disaster? 6. Explain in detail the causes, effects and control measures of NOISE and THERMAL pollution.

7. Explain in detail the process of solid waste management

UNIT-IV 1. What is sustainable development? Discuss in brief the concept of sustainable development. 2. What are waste lands? Name and discuss the various methods of waste land reclamation. 3. Write notes on (i) Global warming (ii)Ozone layer depletion (iii)Acid rain 4. Write notes on Water shed management 5. What is rain water harvesting? Name and discuss in brief the types of rain Water harvesting. 6. Write note on salient features of Environmental protection act and wild life protection act 7. Discuss the salient features of Forest act 8. Write note on salient features of water act and air act

UNIT-V 1. Explain the term population explosion. Enumerate its effects. 2. What is value education? Discuss the concept of value education. 3. Discuss in detail the role of Information technology in environmental management and human health. 4. Explain the activities of family welfare programme. 5. Discuss the problems, diagnosis and control of AIDS. 6. Write a note on women and child welfare.

2 Mark Question with answer

UNIT-I

1. State the significance and scope of environmental education? Importance/Significance of the Environmental Studies: Environmental studies is concerned with the importance of wild life and its protection explains the significant role of biodiversity in establishing ecological balance deals with different types of ecosystems, biotic and abiotic factors and their role in the significance and sustenance of ecosystems. gives information relating to population explosion, growth and development, impact of population growth on the resource consumption and national economy. Explains the significance of forests and their products in the human routine and in country's economy. Gives information about water conservation, watershed management.

2. What is deforestation? The destruction of forest resources by many natural or man-made activities is called deforestation.

3. What is soil erosion? The detachment and movement of topsoil by the action of wind and flowing water.

4. What do you mean by overgrazing? Overgrazing is grazing by livestock or wildlife to the point where the grass cover is depleted, leaving bare, unprotected patches of soil.

5. List the important causes of water conflicts?

Severe water shortages construction of a dam. the use of shared rivers Fishing Pollution

6. What is land degradation? Land degradation refers to loss of fertility or productive capacity of the soil.

7. What do you mean by desertification? Desertification is a slow process of land degradation that leads to desert formation.

8. What are land slides? Rapid down ward movement of a mass of rock,earth or artificial fill or plant debris on a slope is called land slide.

9. What are renewable and non renewable energy resources? Renewable energy resources are those natural resources which are in exhaustible and can be used to produce energy again and again.

Non renewable energy resources are those natural resources which are exhaustible and cannot be replaced once they are used.

10. State the role and responsibility of an individual in the prevention of pollution?

Plant trees, shrubs, and groundcover on your property to benefit the environment. If you are on a septic tank system, prevent leakage by making sure it is regularly inspected and properly maintained. Avoid the usage of two wheelers or four wheelers, instead use public transport systems like bus or train. Use bicycle or travel by foot while going to near by places Buy recycled products

UNIT-II

1. Define eco system? An ecosystem can be defined as an area with in the natural environment consisting of community of living beings and the physical environment, both interacting and exchanging materials between them.

2. Define food chain and food web? Food chain is defined as the sequence of organisms directly dependent on one food in an eco system.

another for

Food web is defined as an interconnection of many food chains in an ecosystem.

3. What is ecological succession? The gradual process of change in an ecosystem brought about by the progressive replacement of one community by another in a definite order until a stable community is established over a period of time.

4. What is ecological pyramid? A pyramid-shaped diagram representing quantitatively the numbers of organisms, energy relationships, and biomass of an ecosystem;

5. What is bio diversity? 'Biodiversity' is defined as the variety of all biological life such as plants, animals, and microorganisms, the genes they contain and the ecosystems they live in.

6. Define genetic diversity and species diversity? Genetic diversity refers to bio diversity due to genetic variation with in each species.

Species diversity refers to the variety of different types of living things on earth.

7. What do you mean by hot spots of bio diversity? Hot spots are the areas that are extremely rich in bio-diversity, have high level of endemism and are under constant threat of species extinctions and habitat destruction.

8. What is red data book? Red Data Book is a book that provides data on population status of the endangered species of plants and animals.

9. What are endemic species? Endemic species are those species of plants & animals which are found exclusively in a particular area and not anywhere else.

10. What are endangered species? Endangered species are those species of plants & animals which are present in such numbers that it is at risk of extinction.

small

11. What is flora and fauna?

All forms of plant life that live in a particular geographic region at a particular time in history is called flora.

All animal life that lives in a particular geographic region at a particular time in history is called fauna.

12. Give few examples of endangered and endemic species of india? Endemic species 1 INDIAN DARTER or SNAKE BIRD 2. LITTLE CORMORANT Endangered species 1. Lion 2. Tiger

UNIT-III

1. Define environmental pollution? Lowering of the quality of environment caused by natural and human activities is called environmental pollution.

2. What is air pollution? The contamination of the air with dust, fumes, gas, mist, odor, smoke, or vapor which causes harmful effects on living organisms is called air pollution.

3. What do you understand by the term smog? Smog is mixture of smoke and fog containing particulates.

4. Define photo chemical smog? Smog produced by the reaction of nitrogen oxides with hydrocarbons in the presence of ultraviolet light from the sun is called photo chemical smog.

5. Define water pollution? Water pollution is defined as any physical,chemical or biological change in quality of water which causes harmful effects on living organisms.

6. Define marine pollution? Addition of harmful chemical substances and waste materials to ocean that makes it harmful to aquatic life is called marine pollution.

7. Define thermal pollution or heat pollution? Addition of excess of undesirable heat to water that makes it harmful to aquatic life is called thermal pollution.

8. Define C.O.D& B.O.D? C.O.DChemical Oxygen Demand B.O.DBiochemical Oxygen Demand

The amount of oxygen in water consumed for chemical oxidation of pollutants is called C.O.D

The amount of oxygen taken up by microorganisms that decompose organic waste matter in water is called B.OD

9. What is soil pollution? The contamination of soil by chemical or other waste materials resulting in the reduction of its fertility is called soil pollution.

10. What is incineration? It is a treatment technology involving destruction of waste by controlled burning at high temperatures.

11. What is composting? Composting is a process in which biodegradable materials are broken down by microorganisms in the presence of oxygen. The stable granular decayed material obtained in this process is called compost. It is used as a fertilizer or soil additive.

12. Differentiate recycling from reusing? Recycling involves collecting used and waste materials from waste streams and using those materials to manufacture new products.

Reusing involves using a product more than once in its original form.

15. What is disaster management? Disaster management is the process of preparing, supporting, and rebuilding society when natural or human-made disasters occur.

16. Define earth quake? Shaking and vibration at the surface of the earth resulting from underground movement along a fault plane or from volcanic activity is called earth quake.

17. Define Tsunami? Tsunami is a series of large seismic sea waves that can cause major destruction in coastal regions.

18. What are particulates? Particulates are dispersed solid or liquid particles of microscopic size in gas media.

19. What is Noise pollution? The unwanted, unpleasant or disagreeable sound of high decibels which causes harmful effect on human health is called noise pollution.

20. What is eutrophication? The process by which body of water, commonly a lake or pond is enriched by nutrients which leads to excessive plant growth and oxygen depletion.

21. Define flood and cyclone? Flood is the rising of a body of water and its overflowing onto normally dry land

A cyclone is an area of low pressure in the centre and high pressure outside.

22. What are primary and secondary air pollutants? Primary air pollutants are those which are emitted directly to the atmosphere Example: Carbon monoxide (CO), Oxides of sulphur (SOX) and Oxides of nitrogen ( NOX ) etc

Secondary air pollutants are those which are produced in the air by the interaction among two or more primary air pollutants or by reaction with normal atmospheric constituents. Example: Ozone, photochemical smog etc.

23. Define pollutant? Any substance which causes lowering the quality of environment is called pollutant.

24. What is meant by point and non point pollution? Pollution from a single identifiable source such as a factory or a sewage-treatment plant is called point pollution

Pollution that does not come from a single, identifiable source is called non-point pollution.

25. What are the various sources of radioactive pollution or nuclear pollution?

Cosmic rays from outer space Emissions from radioactive materials on the earths crust Mining and processing of radioactive ores Use of radioactive isotopes in medical ,industrial and research applications Use of radioactive materials in nuclear weapons.

26. Define solid waste? Solid waste is a waste type that includes predominantly household waste (domestic waste) with sometimes the addition of commercial wastes collected by a municipality within a given area.

27. What is hazardous waste? A substance, such as nuclear waste or an industrial byproduct, which is potentially damaging to the environment and harmful to humans and other living organisms, is called hazardous waste.

28. Classify air pollutants with suitable examples? Air pollutants can be classified in to two types namely primary and secondary air pollutants. Primary air pollutants are those which are emitted directly to the atmosphere.

Example: Carbon monoxide (CO), Oxides of sulphur (SOX) and Oxides of nitrogen ( NOX ) etc

Secondary air pollutants are those which are produced in the air by the interaction among two or more primary air pollutants or by reaction with normal atmospheric constituents. Example: Ozone, photochemical smog etc.

29. Write any two examples for water conflicts? 1. Conflict between Karnataka and Tamil Nadu for Kaveri river 2. Conflict between Kerala and Tamil Nadu for Mullaiperiyar dam

Unit IV

1. Define sustainable development? The development that meets the needs of the present without compromising the ability of future generations to meet their own needs.

2. Define Acid rain? Rain containing relatively high concentrations of acids produced by sulfur dioxide, nitrogen dioxide, and other such gases that result from the combustion of fossil fuels and from certain industrial processes.

3. Define Green house effect? The phenomenon whereby the earth's atmosphere traps solar radiation, caused by the presence in the atmosphere of gases such as carbon dioxide, water vapor, and methane that allow incoming sunlight to pass through but absorb heat radiated back from the earth's surface.

4. What are Green house gases? Any of the atmospheric gases that contribute to the greenhouse effect are called Green house gases. These gases include carbon dioxide (CO2), methane (CH4), nitrous oxide (NO2), and water vapor.

5. What is global warming? Global warming is the increase in the average temperature of Earth which causes more changes on the climate.

6. What is ozone hole or ozone layer depletion? Ozone hole is an area of the upper atmosphere where the ozone layer is absent or has become unusually thin.

7. What is rain water harvesting? Rainwater harvesting is a technology used for collecting and storing rainwater from rooftops, the land surface or rock catchments. 8. What is watershed management? Watershed management is the process of creating and implementing plans, programs, and projects to sustain and enhance watershed functions

9.What is environmental ethics? Environmental ethics is the ethical realtionship between human beings and the environment in which they live.

Unit V

1. Define population explosion? A rapid increase in the size of a population caused by a sudden decrease in death rate or an increase in birth rate is called population explosion.

2. What is value education? Value education is an education which teaches: How to live life well? How to find happiness? How to make others happy? How to behave and communicate with others? How to manage all kinds of people as well as happenings? How to grow and succeed in the right manner? 3. Write the expansion for HIV and AIDS? HIV- Human Immuno-Deficiency Virus

AIDS- Acquired Immuno-Deficiency Syndrome

4. What is doubling time? The doubling time is the period of time required for a given population to double in size.

5. What are the objectives of family welfare programmes? To increase the female literacy rate. To enhance child survival through universal immunization. To reduce the birth rate 6. What do you mean by human rights? Human rights are those basic rights which are essential for the development of human personality such as right to life, liberty, property and security of an individual.

CS2203 OBJECT ORIENTED PROGRAMMING UNIT I PART-A 1. State the characteristics of procedure oriented programming. 2. What are the features of Object Oriented Programming? 3. Distinguish between Procedure Oriented Programming and Object Oriented Programming. 4. List out the basic concepts of Object Oriented Programming. 5. Define Objects. 6.Define Class. 7.Define Encapsulation and Data Hiding. 8.Define Data Abstraction. 9.Define data members and member functions. 10.State Inheritance. 11.State Polymorphism. 12.List and define the two types of Polymorphism.

13.State Dynamic Binding. 14.Define Message Passing. 15.List out some of the benefits of OOP. 16.List out the applications of OOP. 17.What are the input and output operators used in C++? 18.List out the four basic sections in a typical C++ program. 19.Define token. What are the tokens used in C++? 20.Explain the difference between Structure and Class. 21.Define identifier. What are the rules to be followed for identifiers? 22.Define an enumeration data type. 23.List out the new operators introduced in C++. 24.What is the use of scope resolution operator? 25.Define the 2 memory management operators. 26.List out the advantages of new operator over malloc (). 27.Define manipulators. What are the manipulators used in C++? 28.What are inline functions? 29.Explain typecasting. 30.Define function overloading. 31.List out the limitations of function overloading 32.State the difference between structures and class. 33.List the access modes used within a class. 34.How can we access the class members? 35.What is a nested class? What is its use? 36.Where can we define member functions? 37.What is static data member? 38.What is static member function? 39.What is a constant function? 40.Define reference variable in C++. 41.What is overriding? 42.What is a volatile function? 43.Define friend function? 44.What are constant objects? 45.How can we use pointers with an object? 46.What is a local class? PART-B 1.Explain in detail about the Basic Concepts of object oriented programming. 2.Explain the elements of object oriented programming. 3.Explain in detail about the reference variables. 4.What are the difference between reference variables and normal variables? 5.Explain about call-by-reference and return by reference. 6. Describe the advantages of OOP. 7. What are the difference between pointers to constants and constant to pointers? 8. Describe the applications of OOP technology. 9. What is function overloading? Explain briefly with program.

10.Write a program to demonstrate how a static data is accessed by a static member function. 11.What is friend function? What is the use of using friend functions in c++? Explain with a program. 12. Discuss in detail about default arguments with an example. 13. Explain about constant and volatile functions with an example. 14.Describe Abstract class. Illustrate an example to explain it. 15.Write a program to implement nested classes using c++. 16.Write a program to get the employee details and print the same using pointers to objects and pointers to members of a class. Create a class employee. And use appropriate functions and data members.

UNIT II PART-A

1. Define Constructor. 2. List some of the special characteristics of constructor. 3. Give the various types of constructors. 4. What are the ways in which a constructor can be called? 5. Define default constructor 6. Define parameterized constructor 7. Define default argument constructor 8. Define copy constructor 9. Define dynamic constructor 10. Define multiple constructors 11. State dynamic initialization of objects. 12. Define Destructor. 13. Give the general form of an operator function. 14. List some of the rules for operator overloading. 15. What are the types of type conversions? 16. What is an explicit constructor? 17. What is operator overloading? 18. How are operators overloaded? 19. Why are they overloaded? 20. List out the operators that cannot be overloaded. 21. List out the operators that cannot be overloaded using Friend function. 22. Explain basic to class type conversion with an example. 23. Explain class to basic type conversion with an example. 24. Explain one class to another class conversion with an example. PART-B 1. Explain copy constructor and destructor with suitable C++ coding. 2. Explain about Implementation of simple ADTs.

3. 4. 5. 6. 7. 8. 9.

Explain with the program about multiple constructors. Explain in detail about constructor with dynamic allocation. With an example explain about operator overloading through friend functions. What is a virtual destructor? Explain the use of it. Explain about Unary Operator and Binary Operator Overloading with program. List out the rules for overloading operators with example. Define a supplier class. Assume that the items supplied by any given supplier are different and varying in number. Use dynamic memory allocation in the constructor function to achieve the solution. 10. Define an examiner class. Provide all necessary data and function members to provide the following: The examiner must access answer sheets of at least one subject; He may examine answer sheets of multiple subjects; The examiner represents a college and also a university; Most of the examiners are local and represent local university; and have more than one constructor including one default and one with default argument. Provide a meaningful copy constructor. 11. Define a person class with more than three constructors. Define data and function members in the class such a way that all three constructors are meaningful

UNIT III PART-A 1. 2. 3. 4. 5. 6. What is generic programming? How it is implemented in C++? What are function templates? What is the need for function templates? How are they created? How is a function template overridden for a specific data type? What are class templates? What is the need for class templates? How are they created? 7. What is the difference between template function and template class? 8. What is exception handling? 9. What is the need for exception handling? 10. What is the difference between macro and templates? 11. Which three keywords are provided by c++ for implementing exception handling? 12. Why nested exception classes needed? 13. How are uncaught exception caught? 14. What are the limitations of exception handling in c++? PART-B 1. 2. 3. 4. What is the need of Templates? Explain. Explain about function templates? Implement selection sort as a generic function. Implement quick sort as a generic function.

5. Write a program for generic queue class with two member functions, insert and delete. Use the array to implement the queue. 6. Define a stack. The class should throw an exception when the stack underflow and overflow takes place. 7. Using the Time class, throw an exception when invalid time is input, write set_terminate to provide your own terminate function, which care of this problem. 8. What is uncaught exception function? Give an example. 9. What are the use of terminate () and Unexpected functions? Explain with a program. 10. How to use multiple catch functions inside a program? Explain with a program. 11. Write all blocks of exception handling? Explain with a program. UNIT IV PART-A 1. What is meant by inheritance? 2. Give the syntax for inheritance. 3. What are the types of inheritance? 4. Define single inheritance. 5. Define multi-level inheritance. 6. Define multiple inheritance. 7. Define Hierarchical inheritance. 8. Define Hybrid inheritance. 9. What is a virtual base class? 10. What is an abstract class? 11. Define Polymorphism? 12. What are the types of polymorphism? 13. Define this pointer. 14. What is a virtual function? 15. What is a pure virtual function? 16. How can a private member be made inheritable? 17. What do you mean by inline function? 18. What are virtual classes? 19. Difference between realloc () and free? 20. What is RTTI? What are its practical uses? 21. How can typeid operator be used to find the type of a particular object? 22. What is dynamic casting? 23. What is cross casting? 24. What is down casting? 25. What are the advantages of inheritance? 26. What are polymorphic objects? 27. What is role of typeid operator in RTTI? PART-B 1. What are the different forms of inheritance supported in c++? Explain with an example. 2. Discuss on the visibility of base class members in privately and publicly inherited classes.

3. 4. 5. 6.

Explain in detail about virtual base class with an example. Explain in detail about multiple inheritance with an example. Explain how pure virtual function is implemented. What are abstract classes? Give an example (with the program) to illustrate the use of abstract classes. 7. Explain in detail about Virtual function with example. 8. Explain about Exceptions Handlers and Standard Exceptions. 9. When working with templates do we need to use RTTI? Explain with example. 10. Discuss in detail about Dynamic Casting.

UNIT V PART-A 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. What are streams? Why they are useful? What are input and output streams? Briefly describe the class hierarchy provided by c++ for stream handling. What is the difference between a text file and a binary file? How can a file be opened for both reading and writing? Describe the following manipulators setw(), setprecision(), setfill(), Setiosflags(),resetiosflags(). What is a file pointer? What is a command-line argument? How will you create manipulators? Write the syntax and use of getline () and write () functions. What are the differences between manipulators and ios functions? What is the need for string objects? Compare C strings with C++ strings. What is meant by object serialization? What is name conflict problem? How can it be solved using namespaces? How can we define our own namespace? How can we define our functions inside the namespace and use them outside? What is unnamed namespace? What is the use of unnamed namespace? How can we extend a namespace already defined? What is its advantage? What is std namespace? How it is different from other namespaces? What is STL? How it is different from C++ standard library? List the three types of containers. What is the major difference between sequence container and an associative container? What is an iterator? What are the its characteristics? Explain how sequence iterators work. Explain how sorted associative containers work. How are the STL algorithms implemented? Distinguish between the following: a. Lists and vectors b. Sets and maps

c. d. e.

Maps and multimaps Queue and deque Arrays and vectors PART-B

1. 2. 3. 4. 5. 6.

Discuss about C++ Stream classes hierarchy. Write notes on Formatted and Unformatted Console I/O Operations. Explain about File Pointers and their manipulations with example. Give the differences between Manipulators and ios Functions. How can we determine errors while dealing with files. Explain in detail about the facilities available for substring operations on the string object? 7. Explain in detail about Sorted Associative Containers. 8. Discuss about different ways of defining namespaces. 9. Explain in detail about Adapted Containers.

Question Bank CS2201-Data Structures Unit 1 Linear structures PART -A 1.What are the main objectives of Data structure? 2.Need of a Data structure? 3.Define data structure with example. 4.Define abstract data type and list its advantages.

5.What are the two basic types of Data structures? 6. What are the four basic Operations of Data structures? 7. List out the different ways to implement the list? 8. Define singly linked list with neat diagram. 9. List the operations of single linked list. 10. Write the routine for insertion operation of singly linked list. 11. Write the routine for deletion operation of singly linked list. 12. List out the advantages and disadvantages of singly linked list. 13. Define doubly linked linked list with neat diagram. 14. Define circularly linked list with neat diagram. 15. Write the difference between Singly and doubly linked list. 16. Write the difference between doubly and circularly linked list. 17. Write the difference between cursor and pointer implementation of singly linked list. 18. Define stack ADT with example. 19. State the operations on stack. Define them and give the diagrammatic representation. 20. Write the routine for push and pop of linked list. 21. What is the purpose of top and pop? 22. State the disadvantages of linked list implementation of stack. 23. State the applications of stack. 24. Write the algorithm for balancing symbols. 25. Give the Features of balancing symbols. 26. Convert the given infix to postfix. 27. Convert into postfix and evaluate the following expression. 28. Write the features of representing calls in a stack. 29. Define queue with examples. 30. List the operations of queue. 31. What are the prerequisites for implementing the queue ADT using array? 32. How the enqueue and dequeue operations are performed in queue. 33. Write the routines for enqueue operation in queue. 34. Write the routines for dequeue operation in queue. 35. List the Applications of queue? 36. Define priority queue with diagram and give the operations. 37. Give the applications of priority queues. 38.What are the advantages of Linked List over arrays? 39.What are the advantages of doubly Linked List over singly linked list? 40.List the applications of List ADT. 41.List the applications of Stack and Queue. 42.What is Dequeue? 43.Convert the infix expression (a+b*c-d)/(e*f-g) 44.What is circular queue? 45.Write a routine to return the top element of stack. 46.What is the working principle of Radix sort? 47.What do you mean by cursor implementation of List? PART -B 1. Explain the array and linked list implementation of Stack.

2. 3. 4. 5. 6.

Explain the array and linked list implementation of Queue. What are the various linked list operations? Explain Write routines to implement addition, subtraction & differentiation of two polynomials. Explain how stack is applied for evaluating an arithmetic expression. Explain cursor implementation of list. UNIT II TREE STRUCTURES

PART-A 1. Define Tree .Give an example. 2. Define depth of a node in a tree. Give example. 3. Define length of the path in a tree with an example. 4. Define a path in a tree. Give example. 5. Define height of the node in a tree. Give example. 6. Write the routine for node declaration in trees. 7. List the applications of trees. 8. Define Binary tree. 9. List the tree traversal applications. 10. Define binary tree ADT with an example. 11. Define binary search tree? 12. List the Types of binary search trees 13. List the Operations of binary search tree? 14. Define Threaded Binary tree. 15. List the uses of binary tree. 16. Draw the expression tree for the given postfix expression using stack. 17. Define binary search tree ADT with an example. 18. How deletion is performed in a binary search tree. 19. Define internal path length. 20. What is the average depth of all nodes in an equally likely tree? 21. List out the disadvantages of Binary search tree. 22. Define tree traversal. 23. List out the types of Tree traversal? 24. Write the steps and routine for the postorder traversal. 25. Write the steps and routine for the preorder traversal. 26. Write the steps and routine for the inorder traversal. 27.Compare General tree with binary tree. 28.Define the following terminologies.:Sibling,Parent,Depth,height,Level,leaf,Degree. 29.What is Full and Complete binary tree? 30. Define binary search tree. 31. Give the array and linked list representation of tree with example. 32. Define tree traversal.

33. Give the preorder, inorder and post order traversal for the following

34. Draw the binary search tree for the following inputs. 70,15,29,33,44,12,79 35. Differentiate binary tree and binary search tree. 36. What is threaded binary tree? 37. Show the maximum number of nodes in an binary tree of height H is 2H+1-1 38. List the steps involved in deleting a node from a binary search tree. 39. A full node is a node with two children. Prove that the number of full nodes plus one is equal to the number of leaves in a non empty binary tree. PART B 1. Write an algorithm to find an element from binary search tree. 2. Write an algorithm to insert, delete, Find minimum and maximum element from a binary search tree. 3. What are the tree traversal techniques? Explain with an example. 4. Explain the operations performed on threaded binary tree in detail. UNIT III BALANCED TREE PART-A 1. Define AVL Tree. Give Example. 2. Define Balance factor. 3. Give the balance factor of each node for the following tree. 4. When AVL tree property is violated and how to solve it? 5. Mention the four cases to rebalance the AVL tree. 6. Define Rotation in AVL tree. Mention the two types of rotations. 7. Define Splay Tree. 8. List the Operations of Splay tree. 9. List the Operations on B-Trees. 10. List the B-Trees Applications. 11. Define B-Tree. 12. Define binary heaps. 13. List the Operations on Binary heap. 14. List the Applications of Binary heap 15.What are the 2 properties of a binary heap?

16.What is percolating Up and percolating down? 17.What do you mean by self adjusting tree? 18.Difference between B tree and B+ tree. 19.List the different ways of implementing priority queue. 20.What is Min heap and Max heap? PART -B 1. Explain the AVL rotations. 2. Construct splay tree for the following values. 1,2,3,4,5,6,7,8,9 3. Explain the Basic operations performed in a Binary heap. 4. Construct a Min and MAX heap for the following values. 23,67,1,45,7,89,56,35 5. Write a routine to perform insertion in a B-tree.

UNIT IV HASHING AND SET PART-A 1. Define hashing. 2. Define a Key in hashing. 3. Define Hash table. Give an example. 4. Define table size of a hash table. 5. List the types of hash function. 6. Define a Hash function with an example. 7. Properties of a hash function. 8. What is collision in hashing? 9. What are the methods of resolving collision in hashing? 10. Define separate chaining hashing 11. What are the operations of separate chaining? 12. List out the applications of hashing. 13. What are the advantages of separate chaining? 14. What are the disadvantages of separate chaining? 15. What is open addressing? 16. What are the types of open addressing hashing? 17. Differentiate between linear probing and quadratic probing 18. Define primary clustering. 19. Define double hashing. 20. Define rehashing. 21. List out the advantages and disadvantages of rehashing. 22. What are the ways in which rehashing can be implemented. 23. Define Extendible hashing.

24. What is heap order property? 25. What is meant by Expression Tree? 26. List the applications of set. 27. Define Disjoint set. 28.Define Equivalence relation. 29.List the basic data structures for Disjoint Set ADT. 30.What is path compression? 31.Define equivalence class. 32.Show the result of the following sequence of instructions performed by size. Union (1,2) ,Union (3,4), Union (3,5) 34.What is collision? What are the different collision resolving techniques? 35.Write a routine to perform the hash function. PART -B 1. 2. 3. 4. 5. Define Hash function. Write routines to find and insert an element in separate chaining. Explain extendible hashing to resolve collision. Explain open addressing with example. Write a note on Dynamic equivalence problem. Write short notes on Smart Union algorithm. UNIT V GRAPHS PART A 1. Define Graph. 2. Define Directed Graph. 3. What do you mean by Undirected Graph? 4. What do you mean by weighted graph? 5. Define adjacent vertices. 6. Define path. 7. Define Length of the Path. 8. Define cycle. 9. Define simple cycle. 10. Define Simple Path. 11. Define Acyclic graph. 12. What do you mean by a strongly connected graph? 13. What do you mean by weakly connected graph? 14. Define complete graph. 15. Mention the ways of representing a graph? 16.What do you mean by Adjacency Matrix representation? 17. What do you mean by adjacency List representation? 18. What do you mean by indegree and outdegree of a graph?

19. Define Topological sort. 20. Explain the principle of topological sort. 21. What is the disadvantage of topological sort? 22. What is the running time for topological sort? 23. State the shortest path problem OR Single source shortest path problem. 24. Explain weighted path length. 25. Explain unweighted path length 26. What do you mean by Negative edge? 27. What do you mean by negative cost cycle? 28. Give examples for problems solved by shortest path algorithm. 29. What is the running time for the weighted and unweighted shortest path? 30. What is the advantage of unweighted shortest path algorithm? 31. What are the applications of graphs? 32. What is a cyclic graph? 33. What is a connected graph? 34.Define path,degree,cycle,loop,directed graph, undirected graph,bigraph, weighted graph. 35.Define minimum spanning tree. 36.What is an articulation point? 37.When a graph is said to be bi connected? 38.Write the routine for Depth first and breadth first traversal. 39. List the graph traversal techniques. 40.List the applications of depth first traversal. 41.List the applications of graph. 42.What is an adjacency matrix? What are the different ways for implementing it? 43.Name and find the in degree and out degree of the following graph

PART -B 1. What is Topological sort? Write down the pseudo code to perform topological sort and apply the same to the following graph.

2. Explain Dijistras algorithm and find the shortest path from a to all other vertices in a graph.

3. Explain Prims and Kruskals algorithm. Find the minimum spanning tree for the following graph.