Professional Ethics qustion Bank All Previous Year Questions

Professional Ethics
Following Year Qustions

PROFESSIONAL ETHICS-2004-NOV-DEC

PROFESSIONAL ETHICS-2005-NOV-DEC

PROFESSIONAL ETHICS-2006-MAY-JUNE

PROFESSIONAL ETHICS-2006-MAY-JUNE-CSE

PROFESSIONAL ETHICS-2007-MAY-JUNE

PROFESSIONAL ETHICS-2007-NOV-DEC

PROFESSIONAL ETHICS-2007-NOV-DEC-[CSE]

PROFESSIONAL ETHICS-2008-NOV-DEC

PROFESSIONAL ETHICS-2010-NOV-DEC-[ECE]

PROFESSIONAL ETHICS-2011-APRIL-MAY-[CSE-IT-EIE]

PROFESSIONAL ETHICS-2011-APRIL-MAY-[EEE-FT-MECH-AERO]

PROFESSIONAL ETHICS-2011-NOV-DEC-[ECE]

PROFESSIONAL ETHICS-2011-NOV-DEC-[SE]



Click To Download

Read More

Open Source Computing Previous Year Question Papers

Open Source Computing - Previous Year Question Papers

OPEN SOURCE COMPUTING-2010-NOV-DEC-[B.SC-M.SC]

OPEN SOURCE COMPUTING-2011-APRIL-MAY-[B.SC-M.SC]





ANSWER ALL QUESTIONS
1. What is an Open Source Software?
2. Name a free web server and browser available in FOSS.
3. Compare free open source software with free software.
4. Write some disadvantages of Open Source Software.
5. What is kernel?
6. List down different modes available in Linux.
7. What is a process?
8. What is scheduling?
9. What is meant by shell?
10. How does a directory be renamed in Solaris?
11. What is the use rlogin?
12. How will you find the length of the string in SOL?
13. What is meta data? Give example.
14. Give any two examples for SHOW Statement.
15. What are the features of MySQL?
16. What is PHP?
17. List any two logical operators used in PHP.
18. How will you concatenate two strings in PHP?
19. What is a web server?
Max.Marks : 100
(20 x 2 = 40 MARKS)
20. Write about Eclips IDE platform.
PART-B
(5 x 12 = 60 MARKS)
ANSWER ANY FIVE QUESTIONS
21. What is the need for open source? Explain in detail
22. Explain in detail about signals.
23. Discuss in detail about accessing directory and files in Solaris.
24 Write down the steps to connect MySql from PHP.
25. Write short note on apache web server.
26. How will be the remote connection made in Solaris operating system?
27. Explain detail about numeric arrays in PHP.
28. Explain the file handling and data storage in open source Programming
Languages.
*****THE END*****



ANSWER ALL QUESTIONS
Max.Marks : 100
(20 x 2 = 40 MARKS)
1. Define open source.
2. Compare windows and linux Operating systems
3. Give the reasons to use linux
4. List out some of the distributions on linux
5. How can you end a process?
6. What is kernel?
7. Define cloning.
8. List the usage of the following commands at, atq and atrm
9. How you create an achieve file in solaris?
10. Write a PHP program to display number 1 to 50 in descending order
11. Write a MYSQL query to update table information.
12. Write down the steps to start and login into MYSQL in linux
13. Give any four data and time functions in MYSQL
14. How to add and remove a user in MySQL
15 How will you remove duplicate values in MySQL
16 Write a PHP program to display the date and time in browser.
17. What is array? How it is used in PHP?
18 Give an example on SQL injection.
19 What purpose Eclipse IDE is used in PHP?
20. How to configure Apache web server for PHP?
PART - B
(5 x 12 = 60 MARKS)
ANSWER ANY FIVE QUESTIONS
21. Explain the advantages of Open source software. Mention any four open source
applications.
22. Explain the various operating modes in Ii nux .
23. i) How the directories and files are handled in solaris (6)
ii) Write short notes on file security in solaris (6)
24. i) Explain signals with example (8)
ii) Give details about the process in linux (4)
25. Brief the features of My SOL with suitable examples
26. i) What is function? Explain with an example (6)
ii) Write short notes on Apache Web server (6)
27. i) Write short notes on Cran and Crantab (8)
ii) Discuss the significance of open sources with respect to today's (4)
requirements.
28. i) Write a php program to retrieve data fram the sql database (6)
ii) Explain Debugging and error handling in PHP (6)
*****THE END*****



Click To Download

Read More

OOSD NOV DEC 2011 question paper

OBJECT ORIENTED SYSTEM DESIGN-2011-NOV-DEC

Time: 3 Hours Max.Marks : 100

ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE
B.E./ B.TECH. DEGREE EXAMINATIONS: NOV / DEC 2011
REGULA TIONS : 2008
SIXTH SEMESTER - CSE
080230028 -






OBJECT ORIENTED SYSTEM DESIGN


PART - A


ANSWER ALL QUESTIONS
1. What is meant by object oriented decomposition?
2. State the importance of model building.
3. Define the parts of a class that supports
inheritance.
4. What is object state?
5. Mention the objectives of Domain analysis.
6. What is meant by system conception?
7. Define concurrency.
8. Specify the purpose of re-factoring.
9. What are the benefits of fine tuning?
10. How robustness of an 00 language is measured?


PART - B


ANSWER ALL QUESTIONS
(10 x 2 = 20 MARKS)
(5 x 16 = 80 MARKS)

11. (a) Explain in detail about the Themes, Evidences and usefulness of 00
development and modeling.
(OR)
softwaretrojans.blogspot.com
11. (b) With a neat sketch of a sample class model, describe the concept of
Generalization and Association.
12. (a) (i) Discuss briefly about Aggregation and constraints with an example.
(ii) Write short notes on Meta data and Derived Data Packages
(OR)
12. (b) Discuss elaborately the procedure of modeling a state diagram with a sample
model.
13. (a) With an example model, analyze the concept of domain interaction and
application interaction.
(OR)
13. (b) Illustrate how a system concept is elaborated and a problem statement is
prepared?
14. (a) Enumerate the issues of handling global resources and boundary conditions.
(OR)
14. (b) Using ATM as example, explain how a class design is organized and
optimized
15. (a) Summarize the practical tips for improving the functionally generation and
association using ATM model.
(OR)
15. (b) Explain in detail about object oriented database and its implementation
issues using ATM model.
*****THE END*****



Click To Download

Read More

Computer Graphics Previous Year Question Papers

Computer Graphics - Previous Year Question Papers

Following Question Papers


COMPUTER GRAPHICS-2007-NOV-DEC-[CT]

COMPUTER GRAPHICS-2007-NOV-DEC-[IT-B.SC-CT]

COMPUTER GRAPHICS-2011-APRIL-MAY

COMPUTER GRAPHICS-2011-MAY-JUNE-[CS-CT]

COMPUTER GRAPHICS-2011-NOV-DEC

Click To Download

Read More

Numerical Methods Previous Year Question Papers

Numerical Methods - Previous Year Question Papers

Qustion For Year 2001 to 2011

Following QustionPapers

NUMERICAL METHODS-2007-MAY-JUNE

NUMERICAL METHODS-2007-MAY-JUNE-[CSE]

NUMERICAL METHODS-2007-NOV-DEC-[CSE]

NUMERICAL METHODS-2008-APRIL-MAY

NUMERICAL METHODS-2008-NOV-DEC

NUMERICAL METHODS-2009-JUNE

NUMERICAL METHODS-2009-MAY-JUNE

NUMERICAL METHODS-2009-NOV-DEC

NUMERICAL METHODS-2010-MAY-JUNE-[REGULATIONS-2007]

NUMERICAL METHODS-2010-MAY-JUNE-[REGULATIONS-2008]

NUMERICAL METHODS-2011-APRIL-MAY-[IT]

NUMERICAL METHODS-2011-APRIL-MAY-[MCT]



Click To Download All Question For One Zip File...

Click To Download:

Read More

Theory of Computation Previous Year Question Papers

Theory of Computation - Previous Year Question Papers

THEORY OF COMPUTATION-2006-MAY-JUNE

THEORY OF COMPUTATION-2007-NOV-DEC

THEORY OF COMPUTATION-2008-NOV-DEC-[CSE]

THEORY OF COMPUTATION-2008-NOV-DEC-[M.SC]

THEORY OF COMPUTATION-2010-NOV-DEC

THEORY OF COMPUTATION-2011-APRIL-MAY-[CSE]

THEORY OF COMPUTATION-2011-APRIL-MAY-[IT]

Download All Qustions Paper Click To Download

Read More

THEORY OF COMPUTATION 2005 NOV DEC Question PAPER

 Maximum: 100 marks

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2005.
 Fifth Semester Computer Science and Engineering
CS 332 - THEORY OF COMPUTATION
Time: Three hours
 Answer ALL questions.

PART A - (10 x 2 = 20 marks)

1. Obtain (E -closure of each state in the following NFA with E -move.
2. Define regular expression and give an example.
 3. For the grammar S -> aCa , C -> aCa lb, find L(G).
4. Show that id + id * id can be generated by two distinct leftmost derivation in the grammar E -> E + E IE * E I(E)lid.
5. Give an example of a PDA.
6. Explain the acceptance of a PDA with empty stack.
7. Describe the non-deterministic Turing machine model. Is it true the nondeterministic Turing machine model's are more powerful than the Basic Turing machines? (In the sense of language acceptance).
 8. When a language is said to be recursive? Is it true that every regular set is not recursive?
9. When a problem is said to be decidable or undecidable? Give an example of an undecidable.
10. What do you mean by Universal Turing machine? softwaretrojans.blogspot.com



PART B - (5 x 16 = 80 marks)

11. (i) Design Turing machine for computing f(m,n)=m-n (proper subtraction). (10) (ii) Explain how the multiple tracks in a Turing machine can be used for testing given positive integer is a prime or not. (6)

 (ii) Check whether the language L = {on ln /n > 1} is regular or not? Justify your answer. (6) Or (b)(i) Construct an NFA equivalent to the regular expression ((0 + 1)(0 + 1)(0 + 1))*. (8) (ii) Obtain the regular expression denoting the language accepted by the following DFA by using the formula Rij (8)

13. (a) (i) Let G = (V,T,P,S) be a context-free grammar. Then prove that if S =*:>a then there is a derivation tree in G with yield a. (10) (ii) Find a context free grammar with no useless symbols equivalent to S -> AB/CA , B -> BC/AB A ->a, C -> aB/b. (6) Or
(b) (i) Obtain the Chomsky normal form equivalent to the grammar S -> bA/aB, A -> bAA/aS/a, B --> aBB/bS/b. (4) (ii) Convert the grammar S-->AB, A-->BS/b, B->SA/a into Greibach normal form. (12)

14. (a) (i) Prove that L is L(M2) for some PDA M2 if and only if L is N(Mj) for same PDA M,. (12) (ii) 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) Or (b) (i) Construct a context-free grammar G which accepts N(A) where (10) (ii) State pumping lemma for context-free language a show that language (aibjcidj / i ≥1, and j ≥ 1) is not context-free. (6)

15. (a) Define the language Lu Check whether Lu , is recursively enumerable? or Lu is recursive? Justify your answers. (16) Or (b) (i) Show that the language Ld is neither recursive nor recursively enumerable. (12) (ii) Describe how a Turing machine can be encoded with 0 and 1 and give an example. (4)

Click To Download

Read More

OPEN SOURCE SOFTWARE 2011 Question PAPER

ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE
B.E./ B.TECH. DEGREE EXAMINATIONS: NOV / DEC 2011
REGULATIONS· 2008
SIXTH SEMESTER: CSE
080230027 . OPEN SOURCE SOFTWARE
Time: 3 Hours


PART· A

ANSWER ALL QUESTIONS

Max.Marks : 100

(10 x 2 = 20 Marks)

1. Why has the open source software become popular?
2. Where is the network configurations stored? Detail down the steps of accessing
other available partitions from the same Linux Machine.
3. List down the various types of testing variables?
4. What is normalization? State any three normal forms.
5. Give the syntax for Viewing arrays in PHP with example.
6. What is type casting in PHP?
7. Explain Declaration vs. Definition in Python programming.
8. List down the built in function in Python.
9. What are Interprocess Communications in Perl?
10. What is meant by Data Manipulation? Give an example for Perl Data Manipulation
operations.


PART - B

(5 x 16 = 80
Marks)

ANSWER ALL QUESTIONS
11. a) i) Explain the discrete set of process states with example.
ii) Discuss Kernel mode and Linux mode of operations in Linux
Environment.
(OR)
8
8
b) Write short notes on : i) Scheduling ii) Signals. 8+8
12. a)
Write a program to create the various statements for content
management system for accessing MySQL database.
(OR)
b) Write a MySQL program for the following Operations.
• Create a database
• Create a table
• Load data into the table
• Retrieve data from the table in various ways
• Use multiple tables
- 2 -
13 a)
Write a sample PHP program for Substrings handling and Miscellaneous String
Function handling.
(OR)
b) Explain the following Security Functions in PHP.
1. Global Variables and Form data
2. File Name
3. File Uploads
4. File permissions
5. Concealing PHP libraries
6. PHP code
7. Security Redux
14. a) Write a program for
1. Create and Assign Lists
2. Access Values in Lists
3. Update Lists
4. Remove List Elements and Lists
(OR)
b) Explain the Errors and Exception Handling in PYTHON programming
Environment.
15. a)
Discuss the various Perl parsing rules with example.
(OR)
b) What is meant by control structures? Explain it with neat example.
*****THE END*****



Click To Download

Read More

PROBABILITY QUEUEING THEORY PQT QUESTION PAPERs

PROBABILITY QUEUEING THEORY-PQT-COMPLETE QUESTION PAPER COLLECTION

PROBABILITY QUEUEING THEORY-PQT-

COMPLETE QUESTION PAPER COLLECTION

Probability is a way of expressing knowledge or belief that an event will occur or has occurred. The concept has been given an exact mathematical meaning in probability theory, which is used extensively in such areas of study as mathematics, statistics, finance, gambling, science, Artificial intelligence/Machine learning andphilosophy to draw conclusions about the likelihood of potential events and the underlying mechanics ofcomplex systems.

Queueing theory is the mathematical study of waiting lines, or queues. The theory enables mathematical analysis of several related processes, including arriving at the (back of the) queue, waiting in the queue (essentially a storage process), and being served at the front of the queue. The theory permits the derivation and calculation of several performance measures including the average waiting time in the queue or the system, the expected number waiting or receiving service, and the probability of encountering the system in certain states, such as empty, full, having an available server or having to wait a certain time to be served.

PREVIOUS YEAR QUESTION PAPERS

APRIL-MAY-2008

DEC-2009

MAY-JUNE-2007

MAY-JUNE-2010

NOV-DEC-2008

NOV-DEC-2009

NOV-DEC-2010

ClickHere

Read More