Name of the University : Alagappa University
Degree : B.Sc
Department : Information Technology
Subject Code/Name : Principles Of Information Technology
Semester : I
Document Type : Model Question Papers
Website : alagappauniversity.ac.in
Download Model/Sample Question Paper : APRIL 2011 : https://www.pdfquestion.in/uploads/alagappauniversity.ac.in/4053.-B.Sc.%20I.T..pdf
Alagappa Principles Of Information Technology Question Paper
1. Define the term Computer.
2. What do you mean by Communication System –
3. Define : Database.
Related / Similar Question Paper :
Alagappa University B.Sc Digital Computer Fundamentals Question Paper
4. What do you meant by homepage –
5. Define Telnet.
6. Specify the uses of MODEM.
7. Define Database.
8. List any two storage media.
9. Define Compiler.
10. What are the functions loader –
11. (a) Explain the various generation of computers.
12. (a) Write down the features of word processor package.
13. (a) Distinguish between Digital and Analog signal .
14. (a) Write down the features of magnetic tape.
15. (a) Explain the features of good programming language.
16. What are the six elements of computer system – Discuss in brief.
17. What is an internet – Explain the various applicationsof internet.
18. Shortly describe about LAN. Briefly discuss about video conferencing.
19. What is DBMS – Discuss about various types of DBMS.
PROGRAMMING IN C & DATA STRUCTURES
1. List out the four basic data types.
2. How do variables and symbolic names differ –
3. Explain how the arrays are initialised –
4. Explain the need for pointers.
5. Define a ‘ union’ data type.
6. Explain how structure is initialized.
7. Name various ways of representing stacks in ‘C ’.
8. Explain how a list is represented using arrays in C.
9. Explain the representations of a Binary tree briefly.
10. Name the two applications of a Binary tree.
11. (a) Explain relational operation available in C with an example.
12. (a) What is meant by concatenation – Explain.
13. (a) Explain with example, the array of structures.
14. (a) Write an algorithm to delete an element from a QUEUE.
15. (a) State the conditions to form a Binary tree.
16. Write a ‘ C ’ program to find the roots of a Quadratic
17. Explain the difference between Static and Dynamic
18. Write a C’ program to read a sequential file and delete
19. Write an algorithm to convert an infix expression
20. Explain the linked representation of Binary trees in detail.
PROGRAMMING IN C++ & ALGORITHMS
1. Define the terms : Class, Objects.
2. What do you mean by friend function –
3. Define Destructor.
4. What is a parameterized constructor –
5. What do you mean by pure virtual function –
6. Define inheritance.
7. What do you mean by backtracking –
8. Compare depth-first with breadth-first.
9. What is longest-Common sequence problem –
10. What for Dijkstra’s algorithm –
11. (a) Explain the Switch statement with example.
12. (a) Write down the characteristics of constructors.
13. (a) Describe the concept of multilevel inheritance with example.
14. (a) Write a program to perform Binary search.
15. (a) Explain the Prim’s algorithm..
16. Discuss about the following :
17. Explain about multiple constructors in a class with suitable example.
18. Write a C++ program to illustrate the use of multiple inheritance.
19. Discuss in detail about quick sort.
20. What is coin changing problem – How do you apply Kanaspack technique to solve it –
DATABASE MANAGEMENT SYSTEM
Time : 3 Hours
Maximum : 75 Marks
Part A : (10 × 2 = 20)
Answer all the questions.
1. Define DBMS.
2. What is mapping cardinality ?
3. When is a domain atomic ?
4. Define Snapshot.
5. What is meant by response time ?
6. Define Range query.
7. Give the advantages of indexes.
8. List the uses of synonyms.
9. What are the uses of packages ?
10. Define Trigger.
Part B : (5 × 5 = 25)
Answer all the questions.
11. (a) Describe the different attribute types. (Or)
(b) Explain the various data models.
12. (a) Discuss the Armstrong ’s axioms. (Or)
(b) What are the uses of attributes closure algorithm ?
13. (a) Compare Page shipping and Item shipping. (Or)
(b) Define Scaleup. What are the different types of scaleup ?
14. (a) Write sown the SQL statement for creating a table and explain it. (Or)
(b) What are the uses of views ?
15. (a) Discuss the PL/SQL data types. (Or)
(b) Write notes on transactions.
Part C : (3 × 10 = 30)
Answer any three questions.
16. Describe the major disadvantages of file processing systems.
17. Write notes on BCNF.
18. Explain the various network types.
19. Write note on sequences and user privileges.
20. With an example, explain stored procedures.
JAVA PROGRAMMING
Time : 3 Hours
Maximum : 75 Marks
Part A (10 × 2 = 20)
Answer all the questions.
1. What is the relationship between objects and classes ?
2. Define Bytecode.
3. What is a compound relational expression ?
4. List the different segments of a program loop.
5. What is meant by instantiating an object ?
6. How would you create a variable size array ?
7. What is the advantage of packages ?
8. What is meant by concurrency ?
9. Define Remote applet.
10. Name the method which is used to fetch the information about the current font.