CS2351 / CS61 / 10144 CS601 - ARTIFICIAL INTELLIGENCE April May 2015

Anna University Questions - CS2351 / CS61 / 10144 CS601 - ARTIFICIAL INTELLIGENCE April may 2015, Computer Science and Engineering, Sixth semester, Regulation 2008/2010, Previous year university exam question papers

Exam	B.E/B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS
Academic Year	April May 2015
Subject Code	CS2351 / CS61 / 10144 CS601
Subject Name	Artificial Intelligence
Branch	Computer Science and Engineering
Semester	Sixth Semester
Regulation	2008/2010

B.E / B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS, APRIL / MAY 2015

Computer Science and Engineering

Sixth Semester

CS2351 / CS61 / 10144 CS601 - ARTIFICIAL INTELLIGENCE

(Regulations 2008/2010)

Time : 3 Hours                      Answer A L L Questions                Max. Marks 100

PART-A (10 x 2 = 20 Marks)

1. Define Ideal Rational agents.

2. Why problem formulation must follow goal formulation?

3. Differentiate forward chaining and backward chaining.

4. What is the use of online search agent in unknown environment?

5. Define partial order planner.

6. What are the differences and similarity in problem solver and planner?

7. List down the applications of Bayesian network.

8. Define uncertainty. How it is solved?

9. What are the methods of statistical learning?

10. State the advantages of Inductive learning.

Part-B (5* 16 = 80 Marks)

11. (a) (i) Explain any two informed search strategies. (10)

(ii) Discuss about constraint satisfaction problem. (6)

Or

(b) Explain the following uninformed search strategies;

(i) Depth first search (6)

(ii) Iterative Deepening Depth First Search. (6)

(iii) Bidirectional search (4)

12. (a) Explain forward chaining and backward chaining algorithms with an example.

Or

(b) (i) Illustrate the use of first order logic to represent knowledge. (10)

(ii) Write short note on unification. (6)

13. (a) Explain the concept of planning with state space search using suitable examples. (16)

Or

(b) Explain the use of planning graph in providing better heuristic estimation with suitable example. (16)

14. (a) (i) Explain the inference in temporal models. (10)

(ii) Write short note on Hidden Markov model. (6)

Or

(b) Explain about the exact inference in Bayesian networks. (16)

15. (a) The following table consists of training data from an employee database. The data have been generalized. Let status be the class label attribute. Construct decision tree from the given data. (16)

Department	Age	Salary	Count	Status
Sales	31..35	46K..50K	30	Senior
Sales	26..30	26K..30K	40	Junior
Sales	31..35	31K..35K	40	Junior
Systems	21..25	46K..50K	20	Junior
Systems	31..35	66K..70K	5	Senior
Systems	26..30	46K..50K	3	Junior
Systems	41..45	66K..70K	3	Senior
Marketing	36..40	46K..50K	10	Senior
Marketing	31..35	41K..45K	4	Junior
Secretary	46..50	36K..40K	4	Senior
Secretary	26..30	26K..30K	6	Junior

Or

(b) Explain in detail about Active and Passive reinforcement learning. (16)

************************

CS6302 Database Management Systems November December 2014

Anna University Questions with Answers - CS6302 Database Management Systems November December 2014, Computer Science and Engineering, Information Technology Questions, Third semester, Regulation 2013

Exam	B.E/B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS
Academic Year	November December 2014
Subject Code	CS6302
Subject Name	Database Management Systems
Branch	Computer Science and Engineering
Semester	Third Semester
Regulation	2013

B.E / B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS, NOVEMBER / DECEMBER 2014

Computer Science and Engineering

Third Semester

CS6302 – DATABASE MANAGEMENT SYSTEMS

(Common to Computer and Communication Engineering and Information Technology)

(Regulations 2013)

Time : 3 Hours                      Answer A L L Questions                Max. Marks 100

PART-A (10 x 2 = 20 Marks)

1. Why 4NF in normal form is more desirable than BCNF?

2. What is the purpose of Database Management System?

3. Differentiate between Dynamic SQL and Static SQL.

4. Give a brief description on DCL command.

5. Define the properties of Transaction.

6. What is Serializability? How it is tested?

7. Differentiate between Static and Dynamic Hashing.

8. Define Data Mining and Data Warehousing.

9. What is Crawling and Indexing the web?

10. What is Relevance Ranking?

Part-B (5* 16 = 80 Marks)

11. (a) Write Short Notes on; (16)

(i) Data Model and its Types.

(ii) E-R. Diagram for Banking System.

Or

(b) What are Normal forms. Explain thetypes of Normal form with an example. (16)

12. (a) Explain the following with examples:

(i) DDL  (4)

(ii) DML (4)

(iii) Embedded SQL  (8)

Or

(b) Give a detailed description aboutQuery Processing and Optimization. Explain the cost estimation of Query Optimization. (16)

13. (a) What is Concurrency? Explain it in terms of locking mechanism and two phase Commit Protocol.  (16)

Or

(b) Write short notes on: Q.

(i) Transaction concept. (8)

(ii) Deadlock. (8)

14. (a) (i) Explain in detail RAID technology. (8)

(ii) Write short notes on Spatial and Mobile Databases. (8)

Or

(b) Explain in detail about (i) B+ tree index (ii) B tree index Files. (16)

15. (a) (i) Write short notes onDistributed Transactions. (8)

(ii) Explain about Discretionary access Control Based on Granting and Revoking Privileges. (8)

Or

(b) Write Short notes on: (16)

(i) Classification

(ii) Clustering.

************************

 Go back to Anna University DBMS Exam Questions page.

CS2204 / CS36 / EC1207 / 080230008 / 10144 / CS305 Analog and Digital Communication April May 2015

Anna University questions - CS2204 / CS36 / EC1207 / 080230008 / 10144 / CS305 Analog and Digital Communication April May 2015, Computer Science and Engineering (CSE), Third Semester, Regulation 2008 and 2010

Exam	B.E/B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS
Academic Year	April May 2015
Subject Code	CS2204 / CS36 / EC1207 / 080230008 / 10144 / CS305
Subject Name	Analog and Digital Communication
Branch	Computer Science and Engineering
Semester	Third Semester
Regulation	2008/2010

B.E / B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS, APRIL / MAY 2015

Computer Science and Engineering

Third Semester

CS2204 / CS36 / EC1207 / 080230008 / 10144 / CS305 ANALOG AND DIGITAL COMMUNICATION

(Regulations 2008/2010)

Time : 3 Hours                      Answer A L L Questions                Max. Marks 100

PART-A (10 x 2 = 20 Marks)

1. Define repetition rate of the AM envelope.

2. Define frequency deviation and phase deviation.

3. Define information capacity.

4. Compare PSK and QAM.

5. Define companding.

6. Define slope overload and granular noise.

7. Contrast Connection oriented and connectionless protocols.

8. Define Baudot code.

9. What do you mean by Pseudo noise sequence?

10. Define FH spread spectrum.

Part-B (5* 16 = 80 Marks)

11. (a) (i) Describe the basic operation of the AM modulator and explain the phase representation of an AM modulated wave. (8)

(ii) Discuss the relationship between phase deviation and modulation index and frequency deviation and percent modulation. (8)

Or

(b) (i) One input to a conventional AM modulator is 100 KHz carrier with an amplitude of 20 V_p. The second input is 10 KHz modulating signal that is of sufficient amplitude to cause a change in the outpսt wave of ± 6.5 V_p. Determine :

(1) Upper and lower side frequencies

(2) Modulation coefficient and percent modulation

(3) Maximum and Minimum amplitudes of the envelope

(4) Expression for the modulated wave and

(5) Draw the output p? (8)

(ii) Discuss the frequency analysis and bandwidth requirements of angle modulated waves. (8)

12. (a) (i) Discuss the following: (8)

(1) Frequency Shift Keying (FSK) basic principles

(2) FSK Modulator

(3) FSK demodulator

(ii) Describe QAM Transmitter and Receiver with neat sketch. (8)

Or

(b) (i) Describe FSK Transmitter and Receiver with neat sketch. (8)

(ii) Discuss the following terminologies: (8)

(1) Bandwidth efficiency

(2) Carrier recovery

(3) Squaring loop

(4) Costas loop

13. (a) Describe Delta modulation PCM and Adaptive Delta Modulation PCM and compare it. (16)

Or

(b) With neat sketch explain the simplex PCM transmission system and PCM sampling. (16)

14. (a) (i) Discuss the following error correcting methods: (8)

(1) Retransmission,

(2) Forward Error Correction.

(ii) Describe data communication hardware with neat sketch. (8)

Or

(b) (i) Discuss the following error detection techniques:

(1) Redundancy Checking

(2) Checksum

(3) Cyclic redundancy Checking (8)

(ii) Discuss different data communication modems. (8)

15. (a) Discuss and compare CDMA and TDMA in wireless Communication Systems. (16)

Or

(b) Explain Direct Sequence Spread Spectrum with Coherent Binary PSK. (16)

************************