Categories
r2013 notes

CS6501 Internet Programming Notes Regulation 2013 Anna University

CS6501 Internet Programming Notes

CS6501 Internet Programming Notes Regulation 2013 Anna University free download. Internet Programming CS6501 Notes pdf free download.

OBJECTIVES: CS6501 Internet Programming Notes

The student should be made to:

 Learn Java Programming.

 Understand different Internet Technologies.

 Be exposed to java specific web services architecture.

OUTCOMES: CS6501 Internet Programming Notes

At the end of the course, the student should be able to:

 Implement Java programs.

 Create a basic website using HTML and Cascading Style Sheets.

 Design and implement dynamic web page with validation using JavaScript objects and by applying different event handling mechanisms.

 Design rich client presentation using AJAX.

 Design and implement simple web page in PHP, and to present data in XML format.

 Design and implement server side programs using Servlets and JSP.

TEXT BOOKS: CS6501 Internet Programming Notes

1. Deitel and Deitel and Nieto, “Internet and World Wide Web – How to Program”, Prentice Hall, 5th Edition, 2011.

2. Herbert Schildt, “Java-The Complete Reference”, Eighth Edition, Mc Graw Hill Professional, 2011.

REFERENCES: CS6501 Internet Programming Notes

1. Stephen Wynkoop and John Burke “Running a Perfect Website”, QUE, 2nd Edition,1999.

2. Chris Bates, Web Programming – Building Intranet Applications, 3rd Edition, Wiley Publications, 2009.

3. Jeffrey C and Jackson, “Web Technologies A Computer Science Perspective”, Pearson Education, 2011.

4. Gopalan N.P. and Akilandeswari J., “Web Technology”, Prentice Hall of India, 2011.

5. Paul Dietel and Harvey Deitel, “Java How to Program”, , 8th Edition Prentice Hall of India.

6. Mahesh P. Matha, “Core Java A Comprehensive Study”, Prentice Hall of India, 2011.

7. Uttam K.Roy, “Web Technologies”, Oxford University Press, 2011.

Subject Name Internet Programming
Subject code CS6501
Regulation 2013

CS6501 Internet Programming Notes click here to download

CS6501 Internet Programming Syllabus


CS6501 Internet Programming Important questions


CS6501 Internet Programming Question Bank


Categories
UG syllabus R 2013

CS6501 Internet Programming Syllabus Regulation 2013 Anna University

CS6501 Internet Programming Syllabus

CS6501 Internet Programming Syllabus Regulation 2013 Anna University free download. Internet Programming CS6501 Syllabus pdf free download.

UNIT I JAVA PROGRAMMING CS6501 Internet Programming Syllabus

An overview of Java – Data Types – Variables and Arrays – Operators – Control Statements – Classes – Objects – Methods – Inheritance – Packages – Abstract classes – Interfaces and Inner classes – Exception handling – Introduction to Threads – Multithreading – String handling – Streams and I/O – Applets.

UNIT II WEBSITES BASICS, HTML 5, CSS 3, WEB 2.0 CS6501 Internet Programming Syllabus

Web 2.0: Basics-RIA Rich Internet Applications – Collaborations tools – Understanding websites and web servers: Understanding Internet – Difference between websites and web server- Internet technologies Overview –Understanding the difference between internet and intranet; HTML and CSS: HTML 5.0 , XHTML, CSS 3.

UNIT II I CLIENT SIDE AND SERVER SIDE PROGRAMMING CS6501 Internet Programming Syllabus

Java Script: An introduction to JavaScript–JavaScript DOM Model-Date and Objects,-Regular Expressions- Exception Handling-Validation-Built-in objects-Event Handling- DHTML with JavaScript. Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session Handling- Understanding Cookies- Installing and Configuring Apache Tomcat Web Server;- DATABASE CONNECTIVITY: JDBC perspectives, JDBC program example – JSP: Understanding Java Server Pages-JSP Standard Tag Library(JSTL)-Creating HTML forms by embedding JSP code.

UNIT IV PHP and XML CS6501 Internet Programming Syllabus

An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in functions-Connecting to Database – Using Cookies-Regular Expressions; XML: Basic XML- Document Type Definition- XML Schema DOM and Presenting XML, XML Parsers and Validation, XSL and XSLT Transformation, News Feed (RSS and ATOM).

UNIT V INTRODUCTION TO AJAX and WEB SERVICES CS6501 Internet Programming Syllabus 

AJAX: Ajax Client Server Architecture-XML Http Request Object-Call Back Methods; Web Services: Introduction- Java web services Basics – Creating, Publishing ,Testing and Describing a Web services (WSDL)-Consuming a web service, Database Driven web service from an application –SOAP.

Subject Name Internet Programming
Subject code CS6501
Regulation 2013

CS6501 Internet Programming Syllabus click here to download

CS6501 Internet Programming Notes


CS6501 Internet Programming Important questions


CS6501 Internet Programming Question Bank


Categories
question bank

MA6566 Discrete Mathematics Question Bank Regulation 2013 Anna University

MA6566 Discrete Mathematics Question Bank

MA6566 Discrete Mathematics Question Bank Regulation 2013 Anna University free download. Discrete Mathematics MA6566 Question Bank pdf free download.

Sample MA6566 Discrete Mathematics Question Bank:

PART A 2 Marks MA6566 Discrete Mathematics Question Bank

1. Define conjunction and draw a truth table for it.

2. Define disjunction and draw a truth table for it.

3. Define disjunction and draw a truth table for it.

4. Give the truth table for conditional statement.

5. Write the truth table for bi-conditional statement.

6. Define a tautology.

7. Define a contradiction. MA6566 Discrete Mathematics Question Bank

8. Define functionally complete set of connectives

9. State De Morgan laws.

10. Negate and simplify the statement ( p q)  r

11. State the truth value of “ If tigers have wings then the earth travels round the sun”.

12. Write the negation of the following preposition: “To enter into the country you need a passport or a voter registration card”.

PART B 16 Marks MA6566 Discrete Mathematics Question Bank 

20) a)All educated persons are well behaved.
b) Ram is educated.
c)No well behaved person is quarrelsome,
d) Therefore Ram is not quarrelsome”.

21) a)If Abraham works hard then either Bob or Caroline will enjoy themselves.
b) If Bob enjoys himself then Abraham will not work hard.
c)If Daryl enjoys himself the Caroline will not. S.T “ If Abraham works hard, then Daryl will not enjoy himself ”
d) It is not sunny this afternoon and it is colder than yesterday
e) we will go swimming only if it is sunny
f) If we do not go swimming then we will take a canoe trip and
g) if we take a canoe trip, then we will be home by sunset” lead to the conclusion “ we will be home by sunset” MA6566 Discrete Mathematics Question Bank

Subject Name Discrete Mathematics
Subject code MA6566
Regulation 2013

MA6566 Discrete Mathematics Question Bank click here to download

MA6566 Discrete Mathematics Syllabus


MA6566 Discrete Mathematics Notes


MA6566 Discrete Mathematics Important questions


 

 

Categories
Important question

MA6566 Discrete Mathematics Important questions Regulation 2013 Anna University

MA6566 Discrete Mathematics Important questions

MA6566 Discrete Mathematics Important questions Regulation 2013 Anna University free download. Discrete Mathematics MA6566 Important questions pdf free download.

Sample MA6566 Discrete Mathematics Important questions:

3. Define a tautology. With an example.

A statement that is true for all possible values of its propositional variables is called
a tautology universely valid formula or a logical truth.
Example: p ∨ ¬q is a tautology.

4. When do you say that two compound statement proposition are equivalent.

Two compound proposition are said to be equivalent if then the have identical truth tables. (MA6566 Discrete Mathematics Important questions)

5. Give an indirect proof of the theorem if 3n+2 is odd, then n is odd.
Solution:

P: 3n+2 is odd
Q: n is odd
Hypothesis: Assume that ? → q is false.
Assume that ? ?? ???? ??? q is false.
i.e, n is not odd ⇒ n is even.
Analysis: If n is even then n=2k for some integer k.
3n+2= 3(2k)+2.
= 6k+2.
= 2(3k+1) (MA6566 Discrete Mathematics Important questions)

6. Define a universal specification.
(x)A(x) ⇒ ? ?

If a statement of the form (x)A(x) is assumed to be true , then the universal quantifier can be
dropped to obtain A(y) is true for any arbitrary object y in the universe.

7.Show that {∨,∧} is not functionally complete.

Solution: ¬? cannot be expressed using the connectives {∨,∧} .since no sets contribution of the
statement exists {∨,∧} as input if T and the output is F. (MA6566 Discrete Mathematics Important questions)

8. Write the converse, inverse, contra positive of „If you work hard then you will be rewarded‟
Solution:

p: you will be work hard.
q: you will be rewarded.
¬p: You will not be work hard.
¬ q: You will no tbe rewarded.
Converse: q→ p, If you will be rewarded then you will be work hard
Contrapositive: ¬ q→ p,if You will not be rewarded then You will not be work hard.
Inverse: ¬ p→ ¬ q, if You will not be work hard then You will no tbe rewarded.

(MA6566 Discrete Mathematics Important questions)

Subject Name Discrete Mathematics
Subject code MA6566
Regulation 2013

MA6566 Discrete Mathematics Important questions click here to download

MA6566 Discrete Mathematics Syllabus


MA6566 Discrete Mathematics Notes


MA6566 Discrete Mathematics Question Bank


 

Categories
r2013 notes

MA6566 Discrete Mathematics Notes Regulation 2013 Anna University

MA6566 Discrete Mathematics Notes

MA6566 Discrete Mathematics Notes Regulation 2013 Anna University free download. Discrete Mathematics MA6566 Notes pdf free download.

TEXT BOOKS: MA6566 Discrete Mathematics Notes

1. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, 7th Edition, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.

2. Tremblay J.P. and Manohar R, “Discrete Mathematical Structures with Applications to Computer Science”, Tata Mc Graw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.

REFERENCES: MA6566 Discrete Mathematics Notes

1. Ralph.P.Grimaldi., “Discrete and Combinatorial Mathematics: An Applied Introduction”, 4th Edition, Pearson Education Asia, Delhi, 2007.

2. Thomas Koshy., “Discrete Mathematics with Applications”, Elsevier Publications, 2006.

3. Seymour Lipschutz and Mark Lipson., “Discrete Mathematics”, Schaum‟s Outlines, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.

PROPOSITION (OR) STATEMENT: MA6566 Notes Discrete Mathematics

Proposition is a declarative statement that is either true or false but not both. The truth value of proposition is true or false.

Truth table

It displays the relationship between the truth values of proposition.

Negation of a proposition

If P is a proposition, then its negation is denoted by ¬P or ~p and is defined by the following truth table.

COMPOUND PROPOSITION MA6566 Discrete Mathematics Notes

It is a proposition consisting of two or more simple proposition using logical operators.

LOGICAL CONNECTIVES MA6566  Notes Discrete Mathematics

DISJUNCTION (OR)

The disjunction of two proposition P and Q is the proposition P˅Q [read as P or Q] and is defined by the following truth table.

Subject Name Discrete Mathematics
Subject code MA6566
Regulation 2013

MA6566 Discrete Mathematics Notes click here to download

MA6566 Discrete Mathematics Syllabus


MA6566 Discrete Mathematics Important questions


MA6566 Discrete Mathematics Question Bank


 

Categories
UG syllabus R 2013

MA6566 Discrete Mathematics Syllabus Regulation 2013 Anna University

MA6566 Discrete Mathematics Syllabus

MA6566 Discrete Mathematics Syllabus Regulation 2013 Anna University free download. Discrete Mathematics MA6566 Syllabus pdf free download.

OBJECTIVES: MA6566 Discrete Mathematics Syllabus

To extend student‟s Logical and Mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.

UNIT I LOGIC AND PROOFS MA6566 Discrete Mathematics Syllabus

Propositional Logic – Propositional equivalences – Predicates and Quantifiers – Nested Quantifiers – Rules of inference – Introduction to proofs – Proof methods and strategy.

UNIT II COMBINATORICS MA6566 Discrete Mathematics Syllabus

Mathematical induction – Strong induction and well ordering – The basics of counting – The pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear recurrence relations – Generating functions – Inclusion and exclusion principle and its applications.

UNIT III GRAPHS MA6566 Syllabus Discrete Mathematics

Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.

UNIT IV ALGEBRAIC STRUCTURES MA6566 Syllabus Discrete Mathematics

Algebraic systems – Semi groups and monoids – Groups – Subgroups – Homomorphism‟s – Normal subgroup and cosets – Lagrange‟s theorem – Definitions and examples of Rings and Fields.

UNIT V LATTICES AND BOOLEAN ALGEBRA MA6566 Discrete Mathematics Syllabus

Partial ordering – Posets – Lattices as posets – Properties of lattices – Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.

OUTCOMES: MA6566 Discrete Mathematics Syllabus

At the end of the course, students would:
 Have knowledge of the concepts needed to test the logic of a program.
 Have an understanding in identifying structures on many levels.
 Be aware of a class of functions which transform a finite set into another finite set which relates to input and output functions in computer science.
 Be aware of the counting principles.
 Be exposed to concepts and properties of algebraic structures such as groups, rings and fields.

Subject Name Discrete Mathematics
Subject code MA6566
Regulation 2013

MA6566 Discrete Mathematics Syllabus click here to download

MA6566 Discrete Mathematics Notes


MA6566 Discrete Mathematics Important questions


MA6566 Discrete Mathematics Question Bank


 

Categories
question bank

CS6304 Analog and Digital Communication Question Bank Regulation 2013 Anna University

CS6304 Analog and Digital Communication Question Bank

CS6304 Analog and Digital Communication Question Bank Regulation 2013 Anna University free download. Analog and Digital Communication CS6304 Question Bank pdf free download.

Sample CS6304 Analog and Digital Communication Question Bank:

PART A 2 Mark

1. What is Modulation?

2. What is the use of Modulation index?

3. What are the types of Analog Modulation Techniques?

4. Define Amplitude Modulation.

5. Define Frequency Modulation.

6. Define Phase Modulation. (CS6304 Analog and Digital Communication Question Bank)

7. Define Angle modulation.

8. Define the modulation index for AM, FM and PM.

9. Write the mathematical expressions for Amplitude modulated wave.

10. Write the mathematical expressions for Angle modulated wave.

11. Write the mathematical expression for Frequency Modulated wave.

12. Write the mathematical expression for Phase Modulated wave.

13. What is the function of limiter in FM receiver?

14. Write the relation between carrier power and side band power of an AM-DSBFC signal.

15. In FM as the modulation index increases the required bandwidth also increases. Why?

16. What is capture effect in FM receivers? [Ans: Ability of FM to diminish the effects of interfering signal is called capture effect.]

17. Distinguish between narrow band FM and wideband FM.

18. Draw the frequency spectrum and mention the bandwidth of AM signal.

19. Define amplitude modulation.

20. What is meant by RF?

21. What are the inputs to an amplitude modulator? (CS6304 Analog and Digital Communication Question Bank)

22. In an AM communications system, define modulating signal, carrier, modulated wave and AM envelope (CS6304 Analog and Digital Communication Question Bank)

Subject Name Computer Architecture
Subject Code CS6304
Regulation 2013

CS6304 Analog and Digital Communication Question Bank click here to download

CS6304 Analog and Digital Communication Syllabus


CS6304 Analog and Digital Communication Notes


CS6304 Analog and Digital Communication Important questions


 

Categories
Important question

CS6304 Analog and Digital Communication Important questions Regulation 2013 Anna University

CS6304 Analog and Digital Communication Important questions

CS6304 Analog and Digital Communication Important questions Regulation 2013 Anna University free download. Analog and Digital Communication CS6304 Important questions pdf free download.

Sample CS6304 Analog and Digital Communication Important questions:

1. Define noise and noise figure.

Noise is defined as any unwanted form of energy, which tends to interfere with proper reception and reproduction of wanted signal.
Noise figure is defined as the ratio between Signal to Noise ratio at the output to the Signal to Noise ratio at the input

2. What are the types of external noise and internal noise? (CS6304 Analog and Digital Communication Important questions)

External noise can be classified into Atmospheric noise, Extraterrestrial noises,Man –made noises or industrial noises.Internal noise can be classified into Thermal noise, Shot noise, Transit time noise, Miscellaneous internal noise.

3. What are the types of extraterrestrial noise and write their origin.

The two type of extraterrestrial noise are solar noise and cosmic noise Solar noise is the electrical noise emanating from the sun. Cosmic noise is the noise received from the center part of our galaxy, other distant galaxies and other virtual point sources.

4. Explain thermal noise. (CS6304 Analog and Digital Communication Important questions)

Thermal noise is the name given to the electrical noise arising from the random motion of electrons in a conductor.

5. Give the expression for noise voltage in a resistor.

The mean square value of thermal noise voltage is given by Vn2 = 4 K T B R where K – Boltz man constant, R – resistance, T – Absolute temperature, B – Bandwidth

6. Explain White Noise. (CS6304 Analog and Digital Communication Important questions)

Many types of noise sources are Gaussian and have flat spectral density over a wide frequency range. Such spectrum has all frequency components in equal portion, and is therefore called white noise. The power spectral density of white noise is independent of the operating frequency. (CS6304 Analog and Digital Communication Important questions)

Subject Name Computer Architecture
Subject Code CS6304
Regulation 2013

CS6304 Analog and Digital Communication Important questions click here to download

CS6304 Analog and Digital Communication Syllabus


CS6304 Analog and Digital Communication Notes


CS6304 Analog and Digital Communication Question Bank


 

Categories
r2013 notes

CS6304 Analog and Digital Communication Notes Regulation 2013 Anna University

CS6304 Analog and Digital Communication Notes

CS6304 Analog and Digital Communication Notes Regulation 2013 Anna University free download. Analog and Digital Communication CS6304 Notes pdf free download.

OBJECTIVES: CS6304 Analog and Digital Communication Notes

The student should be made to: Understand analog and digital communication techniques. Learn data and pulse communication techniques. Be familiarized with source and Error control coding. Gain knowledge on multi-user radio communication.

OUTCOMES: CS6304 Analog and Digital Communication Notes

At the end of the course, the student should be able to: Apply analog and digital communication techniques. Use data and pulse communication techniques. Analyze Source and Error control coding. Utilize multi-user radio communication.

TEXT BOOK: CS6304 Analog and Digital Communication Notes

1. Wayne Tomasi, “Advanced Electronic Communication Systems”, 6th Edition, Pearson Education, 2009.

REFERENCES: CS6304 Analog and Digital Communication Notes

1. Simon Haykin, “Communication Systems”, 4th Edition, John Wiley & Sons, 2004

2. Rappaport T.S, “Wireless Communications: Principles and Practice”, 2nd Edition, Pearson Education, 2007

3. H.Taub, D L Schilling and G Saha, “Principles of Communication”, 3rd Edition, Pearson Education, 2007.

4. B. P.Lathi, “Modern Analog and Digital Communication Systems”, 3rd Edition, Oxford University Press, 2007.

5. Blake, “Electronic Communication Systems”, Thomson Delmar Publications, 2002.

6. Martin S.Roden, “Analog and Digital Communication System”, 3rd Edition, Prentice Hall of India, 2002.

7. B.Sklar, “Digital Communication Fundamentals and Applications” 2nd Edition Pearson Education 2007.

Information: generated by the source may be in the form of voice, a picture or a plain text. An essential feature of any source that generates information is that its output is described in probabilistic terms; that is, the output is not deterministic. A transducer is usually required to convert the output of a source in an electrical signal that is suitable for transmission.

Subject Name Computer Architecture
Subject Code CS6304
Regulation 2013

CS6304 Analog and Digital Communication Notes click here to download

CS6304 Analog and Digital Communication Syllabus


CS6304 Analog and Digital Communication Important questions


CS6304 Analog and Digital Communication Question Bank


 

Categories
UG syllabus R 2013

CS6304 Analog and Digital Communication Syllabus Regulation 2013 Anna University

CS6304 Analog and Digital Communication Syllabus

CS6304 Analog and Digital Communication Syllabus Regulation 2013 Anna University free download. Analog and Digital Communication CS6304 Syllabus pdf free download.

UNIT I ANALOG COMMUNICATION CS6304 Analog and Digital Communication Syllabus

Noise: Source of Noise – External Noise- Internal Noise- Noise Calculation. Introduction to Communication Systems: Modulation – Types – Need for Modulation. Theory of Amplitude Modulation – Evolution and Description of SSB Techniques – Theory of Frequency and Phase Modulation – Comparison of various Analog Communication System (AM – FM – PM).

UNIT II DIGITAL COMMUNICATION CS6304 Analog and Digital Communication Syllabus

Amplitude Shift Keying (ASK) – Frequency Shift Keying (FSK) Minimum Shift Keying (MSK) –Phase Shift Keying (PSK) – BPSK – QPSK – 8 PSK – 16 PSK – Quadrature Amplitude Modulation (QAM) – 8 QAM – 16 QAM – Bandwidth Efficiency– Comparison of various Digital Communication System (ASK – FSK – PSK – QAM).

UNIT III DATA AND PULSE COMMUNICATION CS6304 Analog and Digital Communication Syllabus

Data Communication: History of Data Communication – Standards Organizations for Data Communication- Data Communication Circuits – Data Communication Codes – Error Detection and Correction Techniques – Data communication Hardware – serial and parallel interfaces. Pulse Communication: Pulse Amplitude Modulation (PAM) – Pulse Time Modulation (PTM) – Pulse code Modulation (PCM) – Comparison of various Pulse Communication System (PAM – PTM – PCM).

UNIT IV SOURCE AND ERROR CONTROL CODING CS6304 Analog and Digital Communication Syllabus

Entropy, Source encoding theorem, Shannon fano coding, Huffman coding, mutual information, channel capacity, channel coding theorem, Error Control Coding, linear block codes, cyclic codes, convolution codes, viterbi decoding algorithm.

UNIT V MULTI-USER RADIO COMMUNICATION CS6304 Analog and Digital Communication Syllabus

Advanced Mobile Phone System (AMPS) – Global System for Mobile Communications (GSM) – Code division multiple access (CDMA) – Cellular Concept and Frequency Reuse – Channel Assignment and Hand – Overview of Multiple Access Schemes – Satellite Communication – Bluetooth.

Subject Name Computer Architecture
Subject Code CS6304
Regulation 2013

CS6304 Analog and Digital Communication Syllabus click here to download

CS6304 Analog and Digital Communication Notes


CS6304 Analog and Digital Communication Important questions


CS6304 Analog and Digital Communication Question Bank