Categories
Important question

CE8351 Important Questions Surveying Regulation 2017 Anna University

CE8351 Important Questions Surveying 

CE8351 Important Questions Surveying Regulation 2017 Anna University free download. Surveying Important Questions CE8351 pdf free download.

Sample CE8351 Important Questions Surveying:

1. Define Surveying. What are the fundamental principles of surveying?

Surveying is an art of determining the relative positions of various points on, above or below the surface of the earth by means of direct or indirect measurement of distance, direction and elevation. The principles of surveying are: (i). Working from whole to part. (ii). To locate a new station by at least two measurements (angular, linear) from fixed reference points. (CE8351 Important Questions Surveying)

2. What is the object or purpose of surveying?

The primary object of surveying is to prepare a plan or map to show the relative position of the objects on the surface of the earth. It is also used to determine the areas, volumes and other related quantities. (CE8351 Important Questions Surveying)

3. Name the different ways of classification of surveys.

a.Primary classification (i). Plane surveying (ii). Geodetic surveying. b. Secondary classification (i). Based on instruments used (ii). Based on methods. (iii). Based on object (iv). Based on nature of the field (CE8351 Important Questions Surveying)

4. Differentiate between plane and geodetic surveying.

Plane surveying The curvature of the earth is neglected. A line joining any two points is considered straight. The triangle formed by any three points is considered as plane triangle. It is done on a area less than 250 Km 2 Geodetic surveying.The curvature of the earth is taken. A line joining any two points is considered as curved line. The triangle formed by any three points is considered as spherical triangle. It is done on a area greater than 250 Km 2

5. Classify surveying based on the equipments.

1 Chain surveying 2 Compass surveying 3 Plane table surveying 4 Theodolite surveying 5 Tacheometric surveying 6 Photogram metric surveying 7 Aerial surveying. (CE8351 Important Questions Surveying)

Subject name Surveying
Semester 3
Subject Code CE8351
Regulation 2017 regulation

CE8351 Important Questions Surveying Click here to download

CE8351 Important 16 marks Questions Surveying


CE8351 Syllabus Surveying


CE8351 Notes Surveying


CE8351 Question Bank Surveying

Categories
Important question

Anna University Important Questions Regulation 2013

Anna University Important questions Regulation 2013:

Anna University Important Questions Regulation 2013 Download for free department wise the Important Questions are available in pdf format.

UG Anna University Important questions Regulation 2013:

Civil Engineering Regulation 2013 Important questions

Students of Civil Engineering can download their respective Subject Important Questions from the above link.


Mechanical Engineering Regulation 2013 Important questions

Students of Mechanical Engineering (mech Engg) can download their respective Subject Important Questions from the above link.


Electrical and Electronics Engineering EEE Regulation 2013 Important questions

Students of Electrical and Electronics Engineering (EEE Engg) can download their respective Subject Important Questions from the above link.


Electronics and Communication Engineering ECE Regulation 2013 Important questions

Students of Electronics and Communication Engineering (ECE Engg) can download their respective Subject Important Questions from the above link.


Computer Science and Engineering CSE Regulation 2013 Important questions

Students of Computer Science and Engineering (CSE Engg) can download their respective Subject Important Questions from the above link.


Information Technology IT Regulation 2013 Important questions

Students of Information Technology (B.tech IT) can download their respective Subject Important Questions from the above link

Categories
Important question

Anna University Important Questions Regulation 2017

Anna University Important questions Regulation 2017:

Anna University Important Questions Regulation 2017 Download for free department wise the Important Questions are available in pdf format.

UG Anna University Important questions Regulation 2017:

Civil Engineering Regulation 2017 Important questions

Students of Civil Engineering can download their respective Subject Important Questions from the above link.


Mechanical Engineering Regulation 2017 Important questions

Students of Mechanical Engineering (mech Engg) can download their respective Subject Important Questions from the above link.


Electrical and Electronics Engineering EEE Regulation 2017 Important questions

Students of Electrical and Electronics Engineering (EEE Engg) can download their respective Subject Important Questions from the above link.


Electronics and Communication Engineering ECE Regulation 2017 Important questions

Students of Electronics and Communication Engineering (ECE Engg) can download their respective Subject Important Questions from the above link.


Computer Science and Engineering CSE Regulation 2017 Important questions

Students of Computer Science and Engineering (CSE Engg) can download their respective Subject Important Questions from the above link.


Information Technology IT Regulation 2017 Important questions

Students of Information Technology (B.tech IT) can download their respective Subject Important Questions from the above link

Categories
Important question

CS6704 Important Questions Resource Management Techniques Regulation 2013 Anna University

CS6704 Important Questions Resource Management Techniques

CS6704 Important Questions Resource Management Techniques Regulation 2013 Anna University free download. Resource Management Techniques CS6704 Important Questions pdf free download.

Sample CS6704 Important Questions Resource Management Techniques:

1. What is linear programming?
Linear programming is a technique used for determining optimum utilization of limited resources to meet out the given objectives. The objective is to maximize the profit or minimize the resources (men, machine, materials and money)

2. Write the general mathematical formulation of LPP. CS6704 Important Questions Resource Management Techniques
1. Objective function

3. What are the characteristic of LPP? CS6704 Important Questions Resource Management Techniques
 There must be a well defined objective function.
 There must be alternative course of action to choose.
 Both the objective functions and the constraints must be linear equation or inequalities.

4. What are the characteristic of standard form of LPP? CS6704 Important Questions Resource Management Techniques
 The objective function is of maximization type.
 All the constraint equation must be of equal type by adding slack or surplus variables
 RHS of the constraint equation must be positive type
 All the decision variables are of positive type

5. What are the characteristics of canonical form of LPP? (NOV ’07) CS6704 Important Questions Resource Management Techniques
In canonical form, if the objective function is of maximization type, then all constraints are of ≤ type. Similarly if the objective function is of minimization type, then all constraints are of ≥ type. But non-negative constraints are ≥type for both cases. CS6704 Important Questions Resource Management Techniques

6. A firm manufactures two types of products A and B and sells them at profit of Rs 2 on type A and Rs 3 on type B. Each product is processed on two machines M1 and M2.Type A requires 1 minute of processing time on M1 and 2 minutes on M2 Type B requires 1 minute of processing time on M1 and 1 minute on M2. Machine M1 is available for not more than 6 hours 40 minutes while machine M2 is available for 10 hours during any working day. Formulate the problem as a LPP so as to maximize the profit. (MAY ’07)
Maximize z =2×1 +3×2
Subject tot the constraints:
x1 + x2 ≤ 400
2×1 + x2 ≤ 600
x1 ,x2≥ 0 CS6704 Important Questions Resource Management Techniques

 

Subject Name Resource Management Techniques
Subject code CS6704
Regulation 2013

CS6704 Important Questions RMT Resource Management Techniques click here to download 

CS6704 Syllabus Resource Management Techniques


CS6704 Notes Resource Management Techniques


CS6704 Question Bank Resource Management Techniques

Categories
Important question

CS6703 Important Questions Grid and Cloud Computing Regulation 2013 Anna University

CS6703 Important Questions Grid and Cloud Computing

CS6703 Important Questions Grid and Cloud Computing Regulation 2013 Anna University free download. Grid and Cloud Computing CS6703 Important Questions pdf free download.

Sample CS6703 Important Questions Grid and Cloud Computing:

1. Define cloud computing
Cloud computing is the delivery of computing as a service rather than a product, hereby shared resources, software, and information are provided to computers and other devices as a utility.

2. What is Distributed computing CS6703 Important Questions Grid and Cloud Computing
This is a field of computer science/engineering that studies distributed systems. A distributed system consists of multiple autonomous computers, each having its own private memory, communicating through a computer network. Information exchange in a distributed system is accomplished through message passing. A computer program that runs in a distributed system is known as a distributed program. The process of writing distributed programs is referred to as distributed programming. CS6703 Important Questions Grid and Cloud Computing

3. Difference between distributed and parallel computing. CS6703 Important Questions Grid and Cloud Computing
Each processor has its own private memory (distributed memory). Information is exchanged by passing messages between the processors.
It is loosely coupled.
An important goal and challenge of distributed systems is location transparency.
All processors may have access to a shared memory to exchange information between processors.
It is tightly coupled.
Large problems can often be divided into smaller ones, which are then solved concurrently (“in parallel”).

4. What is mean by service oriented architecture? CS6703 Important Questions Grid and Cloud Computing
In grids/web services, Java, and CORBA, an entity is, respectively, a service, a Java object, and a CORBA distributed object in a variety of languages. These architectures build on the traditional seven Open Systems Interconnection (OSI) layers that provide the base networking abstractions. On top of this we have a base software environment, which would be .NET or Apache Axis for web services, the Java Virtual Machine for Java, and a broker network for CORBA.

 

Subject Name Grid and Cloud Computing
Subject code CS6703
Regulation 2013

CS6703 Important Questions Grid and Cloud Computing click here to download 

CS6703 Syllabus Grid and Cloud Computing


CS6703 Notes Grid and Cloud Computing


CS6703 Question Bank Grid and Cloud Computing

Categories
Important question

CS6702 Important Questions Graph Theory and Applications Regulation 2013 Anna University

CS6702 Important Questions Graph Theory and Applications

CS6702 Important Questions Graph Theory and Applications Regulation 2013 Anna University free download. Graph Theory and Applications CS6702 Important Questions pdf free download.

Sample CS6702 Important Questions Graph Theory and Applications:

1. Define Graph.
A graph G = (V, E) consists of a set of objects V={v1, v2, v3, … } called vertices (also called points or nodes) and other set E = {e1, e2, e3, …….} whose elements are called edges (also called lines or arcs).
The set V(G) is called the vertex set of G and E(G) is the edge set of G.
For example : CS6702 Important Questions Graph Theory and Applications
A graph G is defined by the sets V(G) = {u, v, w, x, y, z} and E(G) = {uv, uw, wx, xy, xz}.
A graph with p-vertices and q-edges is called a (p, q) graph. The (1, 0) graph is called trivial
graph.

2. Define Simple graph. CS6702 Important Questions Graph Theory and Applications
 An edge having the same vertex as its end vertices is called a self-loop.
 More than one edge associated a given pair of vertices called parallel edges.
 A graph that has neither self-loops nor parallel edges is called simple graph.

3. Write few problems solved by the applications of graph theory. CS6702 Important Questions Graph Theory and Applications
Konigsberg bridge problem
Utilities problem
Electrical network problems
Seating problems

4. Define incidence, adjacent and degree. CS6702 Important Questions Graph Theory and Applications
When a vertex vi is an end vertex of some edge ej, vi and ej are said to be incident with each other. Two non parallel edges are said to be adjacent if they are incident on a common vertex. The number of edges incident on a vertex vi, with self-loops counted twice, is called the degree (also called
valency), d(vi), of the vertex vi. A graph in which all vertices are of equal degree is called regular graph.

Subject Name Graph Theory and Applications
Subject code CS6702
Regulation 2013

CS6702 Important Questions Graph Theory and Applications click here to download 

CS6702 Syllabus Graph Theory and Applications


CS6702 Notes Graph Theory and Applications


CS6702 Question Bank Graph Theory and Applications


 

 

Categories
Important question

CS6701 Important 16 marks Questions Cryptography and Network Security Regulation 2013 Anna University

CS6701 Important 16 marks Questions Cryptography and Network Security

CS6701 Important 16 marks Questions Cryptography and Network Security Regulation 2013 Anna University free download. Cryptography and Network Security CS6701 Important 16 marks Questions pdf free download.

Sample CS6701 Important 16 marks Questions Cryptography and Network Security:

1. (i) Briefly explain Deffie Hellman key exchange with an example. (16)
2. (i) Write and explain the digital signature algorithm. (8) (ii) Explain in detail Hash Functions.(8)  CS6701 Important 16 marks Questions Cryptography and Network Security
3. (i) Compare the Features of SHA-1 and MD5 algorithm. (8)
(ii) Discuss about the objectives of HMAC and it security features. (8)
4. Users A and B use the Diffie Hellman key exchange technique, a common prime q=11 and a
primitive root alpha=7.
(i) If user A has private key XA=3.What is A’s public key YA? (4)
(ii) If user B has private key XB=6 What is B’s public key YB? (4) (iii) What is the shared secret
key? Also write the algorithm. (4) CS6701 Important 16 marks Questions Cryptography and Network Security
(iv) How man in middle attack can be performed in Diffie Hellman algorithm.(4)
5. (i) Explain in detail EIGamal Public key cryptosystem. (8)
(ii) Discuss clearly Secure Hash Algorithm(SHA) (8)
6. Describe the MD5 message digest algorithm with necessary block diagrams. (16)
Unit-IV
Part-B (16 Marks) CS6701 Important 16 marks Questions Cryptography and Network Security
1. How does PGP provide confidentiality and authentication service for e-mail and file storage
applications? Draw the block diagram and explain its components. (16)
2. Write Short notes on S/MIME .
3. Explain the architecture of IP Security (16) CS6701 Important 16 marks Questions Cryptography and Network Security
4. (i) Describe the SSL Specific protocol – Handshake action in detail. (8)
(ii) Explain Secure Electronic transaction with neat diagram. (8)
5. (i) What is Kerberos? Explain how it provides authenticated service. (8)
(ii)Explain the format of the X.509 certificate. (8)

 

Subject Name Cryptography and Network Security
Subject code CS6701
Regulation 2013

CS6701 Important 16 marks Questions Cryptography and Network Security click here to download 

CS6701 Syllabus Cryptography and Network Security


CS6701 Notes Cryptography and Network Security


CS6701 Question Bank Cryptography and Network Security


 

 

Categories
Important question

CS6701 Important Questions Cryptography and Network Security Regulation 2013 Anna University

CS6701 Important Questions Cryptography and Network Security

CS6701 Important Questions Cryptography and Network Security Regulation 2013 Anna University free download. Cryptography and Network Security CS6701 Important Questions pdf free download.

Sample CS6701 Important Questions Cryptography and Network Security:

1. Distinguish between passive attack and active attack with reference to X.800. (A/M-11)
X.800 categorize the attacks into two, namely passive and active attacks.
Passive attacks: Passive attacks are in the nature of eavesdropping on, or monitoring of, transmissions. It includes release of message contents and Traffic analysis. Passive attacks are very difficult to detect because they do not involve any alteration of data. However, it is feasible to prevent the success of these attacks, usually by means of encryption.
Active attacks: Active attack involves some modification of the data stream or the creation of a false data stream and can be subdivided into four categories namely as a masquerade, replay, modification of messages and the denial of service attack.

2. Define –Key and Plaintext (M/J-09) CS6701 Important Questions Cryptography and Network Security
In cryptography, a key is defined as a piece of information that determines the functional output of a cryptographic algorithm or cipher. In encryption, a key specifies the particular transformation of plaintext into ciphertext or vice versa during decryption. Plaintext is ordinary readable text before being encrypted into ciphertext or after being decrypted.

3. Find the GCD of 2740 and 1760, using Euclidean algorithm. (N/D-08) CS6701 Important Questions Cryptography and Network Security
The GCD of two numbers say a and b can be found using the following formula
gcd(a,b) =gcd(b,a mod b)
GCD(2740,1760) = gcd(1760, 2740 mod 1760)= gcd(1760,980)=980

4. What is encipherment? (A/M-12) CS6701 Important Questions Cryptography and Network Security
The use of mathematical algorithms to transform data into a form that is not readily intelligible. The transformation and subsequent recovery of the data depend on an algorithm and zero or more encryption keys.

5. What is a passive attack? (M/J-09) CS6701 Important Questions Cryptography and Network Security
Passive attacks are in the nature of eavesdropping on, or monitoring of, transmissions. The goal of the opponent is to obtain information that is being transmitted. Two types of passive attacks are the release of message contents and traffic analysis.

 

Subject Name Cryptography and Network Security
Subject code CS6701
Regulation 2013

CS6701 Important Questions Cryptography and Network Security click here to download 

CS6701 Important 16 marks Questions Cryptography and Network Security


CS6701 Syllabus Cryptography and Network Security


CS6701 Notes Cryptography and Network Security


CS6701 Question Bank Cryptography and Network Security


 

 

Categories
Important question

CS6504 Important Questions COMPUTER GRAPHICS Regulation 2013 Anna University

CS6504 Important Questions COMPUTER GRAPHICS

CS6504 Important Questions COMPUTER GRAPHICS Regulation 2013 Anna University free download. COMPUTER GRAPHICS CG CS6504 Important Questions pdf free download.

Sample CS6504 Important Questions COMPUTER GRAPHICS:

1.Define Computer Graphics.
Computer Graphics remains one of the most existing and rapidly growing computer fields. Computer graphics
may be defined as the pictorial representation or graphical representation of objects in a computer cs6504 important questions computer graphics

2.Write short notes on video controller.
Video controller is used to control the operation of the display device.A fixed area of the system is reserved for
the frame buffer and the video controller is given direct access to the frame buffer memory Here, the frame
buffer can be anywhere in the system memory, and the video controller accesses the frame buffer to refresh the
screen. In addition to the video controller, more sophisticated raster systems employ other processors as cs6504 important questions computer graphics
coprocessor sand accelerators to implement various graphics operations.

3.Write notes on Graphics controller?
An application program is input and stored in the system memory along with a graphics package. Graphics
commands in the application program are translated by the graphics package into a display file stored in the
system memory. This display file is then accessed by the display processor to refresh the screen. The display
processor cycles through each command in the display file program once during every refresh cycle. Sometimes
the display processor in a random-scan system is referred to as a display processing unit or a graphics controller cs6504 important questions computer graphics

4.List out a few attributes of output primitives?
Attributes are the properties of the output primitives; that is, an attribute describes how a particular primitive is
to be displayed. They include intensity and color specifications, line styles, text styles, and area-filling patterns.
Functions within this category can be usedto set attributes for an individual primitive class or for groups of
output primitives. cs6504 important questions computer graphics

 

Subject Name COMPUTER GRAPHICS
Subject code CS6504
Regulation 2013

CS6504 Important Questions COMPUTER GRAPHICS click here to download 

CS6504 Syllabus COMPUTER GRAPHICS


CS6504 Notes COMPUTER GRAPHICS


CS6504 Question Bank COMPUTER GRAPHICS


 

Categories
Important question

CS6503 Important Questions Theory of Computation Regulation 2013 Anna University

CS6503 Important Questions Theory of Computation

CS6503 Important Questions Theory of Computation Regulation 2013 Anna University free download. Theory of Computation TOC CS6503 Important Questions pdf free download.

Sample CS6503 Important Questions Theory of Computation:

PART – A
ANSWER ALL QUESTIONS (20 * 2 =40 MARKS)

1. What is Turing machine?

2. Give the difference between FA and TM.

3. Define Multitape Turing Machine. CS6503 Important Questions Theory of Computation

4. What is meant by halting problem?

5. What is Mapping reducibility?

6. Define Turing reducible. CS6503 Important Questions Theory of Computation

7. Give the definition of linear bound automaton.

8. Find a match in the following instance of PCP.
{[ab/abab],[b/a],[aba/b],[aa/a]}

9. What is Time complexity?

10. Define class P and NP completeness.

11. Prove that CLIQUE is in NP.

12. State the True or False for the following statement
(i) n^2=o(log^2 n)
(ii) nlogn=o(n^2) CS6503 Important Questions Theory of Computation

13. Define Probabilistic Turing machine.

14. Define trapdoor function.

15. What is one – way permutation?

16. Prove that CIRCUIT-VALUE is p-complete?

17. What are the classes L and NL? CS6503 Important Questions Theory of Computation

18. Define EXSPACE-complete.

19. Give the proof idea for FORMULA-GAME is PSPACE-complete.

20. Define PSPACE and PSPACE-complete?

PART – B Important question 

ANSWER ANY FIVE QUESTIONS (5 X 12 = 60 MARKS )

21.(i) Give implementation-level description of Turing machines that decide the following language
over the alphabet{0,1}
(a) {w/w contains an equal number of 0s and 1s}. (8)
(ii) Show that a language is Turing-recognizable if and only if some enumerators enumerates it.(4)

22.(i) Prove that every CFL is decidable.(6)
(ii) Show that EQ(DFA) is a decidable language.(6)

23.(i) Prove that Recursive theorem.(6) CS6503 Important Questions Theory of Computation
(ii) Show that MIN(TM) is not Turing-recognizable.(6)

24.(i) Prove that HALT(TM) is decidable.(6)
(ii) Prove that EQ(TM) is neither Turing-recognizable nor Co-Turing-recognizable.(6) CS6503 Important Questions TOC Theory of Computation

25. Prove that HAMPATH is NP-complete.

Subject Name Theory of Computation
Subject code CS6503
Regulation 2013

CS6503 Important Questions Theory of Computation click here to download 

CS6503 Syllabus Theory of Computation


CS6503 Notes Theory of Computation


CS6503 Question Bank Theory of Computation