Typical configuration of Computer system 1
Boolean algebra 1
1 Mark (MCQ + Fill in the blanks) Logic Gates 1
Data structures 1
OOP concepts
Classes and objects 1
Function Overloading 1
Constructors and Destructors 1
Inheritance 1
Pointers 1
Data File handling
Database concepts 1+ 5 Fill in the
blanks
SQL commands 1
Networking Concepts 2
Internet and Open source concepts 1
Web Designing 1
Typical configuration of Computer system
Boolean algebra 1
Logic Gates 1
Data structures
OOP concepts
Classes and objects
2 Marks
Function Overloading
Constructors and Destructors 1
Inheritance
Pointers
Data File handling 1
Database concepts 1
SQL commands 2
Networking Concepts
Internet and Open source concepts
Web Designing
Typical configuration of Computer system 1
Boolean algebra
Logic Gates
Data structures 1
OOP concepts
Classes and objects
3 Marks
Function Overloading
Constructors and Destructors
Inheritance
Pointers 1
Data File handling 1
Database concepts 1
SQL commands
Networking Concepts
Internet and Open source concepts 1
Web Designing 1
Typical configuration of Computer system
Boolean algebra
Logic Gates
Data structures 2
OOP concepts 1
Classes and objects
5 Marks
Function Overloading 1
Constructors and Destructors 1
Inheritance 1
Pointers
Data File handling
Database concepts
SQL commands
Networking Concepts 1
Internet and Open source concepts
Web Designing
Typical configuration of Computer system
Boolean algebra 1
Logic Gates
Data structures
OOP concepts
5 Marks - HOTS
Classes and objects 1
Function Overloading
Constructors and Destructors
Inheritance
Pointers
Data File handling
Database concepts
SQL commands 1
Networking Concepts
Internet and Open source concepts
Web Designing
1. Prove that X + XY = X
2. Define Minterm and Maxterm.
3. State and prove involution law.
4. Prove that (X+Y) (X+Z) = X + YZ using algebraic method.
5. State and prove commutative law using truth table.
6. State the principle of duality. Write the dual of 1+X=1.
7. Find the complement of the expression. F = Y + X Z + X Y
8. State and prove complementarity laws.
9. State and prove De-Morgan’s theorem using truth table.
10.Prove that X ∙ 𝑋ത = 0 by perfect induction method.
11.Prove X ∙ (X + Y) = X algebraically.
12.Prove X ∙ Y = Y ∙ X using truth table.
13.What is tautology and fallacy?
1. Write the logic diagram and the truth table for NOR gate.
2. Write the logic diagram and the truth table for NAND gate.
3. Draw the logic diagram and truth table for two input XOR gate.
4. Write the truth table and standard symbol for XOR gate.
5. Realize OR gate using NAND gate.
6. Realize AND gate using NOR gate.
7. Explain the working of two input NOR gate with symbol and truth
1. What is destructor? Write its syntax.
2. Mention different types of constructors.
3. Write any two rules for constructor.
4. Write the features of default constructors.
5. What is a destructor? Which is the operator used with destructor
function?
6. Define: a) constructor, b) destructor.
7. Mention any two features of parameterized constructor.
1. Differentiate between ifstream and ofstream.
2. What is a stream? Mention any one stream used in C++.
3. Write any two member function belongings to ofstream class.
4. Write any two member functions belonging to ifstream class.
5. Differentiate between read( ) and write( ).
6. Differentiate between text file and binary file.
7. Mention any two ofstream functions.
8. Mention any two ifstream functions.
9. Differentiate between get() and getline() in data files.
1. What is data independence? Mention the types of data independence.
2. Write any advantages of database system.
3. What are the advantages of ISAM.
4. Define primary and secondary keys.
5. Write the difference between data and information.
6. Mention the database users.
7. What is database management system? Give an example for DBMS software.
8. Write any two differences between manual data processing and computerized
(electronic) data processing.
9. Define primary key and candidate key.
10.Mention the types of data independence.
11.What is database management system (DBMS)? Give an example for DBMS software.
1. Give the syntax and example for DELETE command in SQL.
2. Mention any two data types used in SQL.
3. Mention the logical operations used in SQL.
4. Give the syntax and example of UPDATE command in SQL.
5. What is the difference between ORDER BY and GROUP BY clause used
in SQL? Give example for each.
6. Give the syntax and an example for INSERT command in SQL.
7. Differentiate between DELETE and DROP command in SQL.
8. Write the syntax and example for DROP command in SQL.
9. Write the syntax and example for insert command in SQL.
10.Give the syntax and example for CREATE command in SQL.
1. Write an algorithm for PUSH operation in stack.
2. Explain the various operations performed on queue data structure.
3. What is stack? Write an algorithm for POP operation.
4. Write an algorithm for traversal in a linear array.
5. Explain the memory representation of two dimensional arrays.
6. Write an algorithm for insert element into a one dimensional array.
7. Write an algorithm to delete an element from a one-dimensional array.
8. Explain the memory representation of one-dimensional array.
9. Give the memory representation for two dimensional array using Column
Major Ordering.
10.Give the memory representation for two dimensional array using Row major
Order.
11.Explain applications of arrays.
12.Write any three applications of stack.
1. What are the operations performed on pointer
2. What is array of pointers? Give an example.
3. Explain the use of new and delete operators in pointers.
4. What are the advantages of pointers?
5. Define: a) Pointer b) Static memory allocation c) Dynamic memory
allocation.
6. Differentiate between static and dynamic representation of memory.
7. Define an array of pointers. Give an example.
8. Explain dynamic memory allocation in pointers.
9. Explain NEW, DELETE functions with respect to pointers.
1. Give the function of put( ), get( ), and getline( ) with respect to text files.
2. Give the functions of the following. a) get( ) b) getline( ) c) read( )
3. Mention the types of files. Explain.
4. Explain any three modes to open a file in C++.
5. Write the member function belong to ifstream class.
6. Discuss the file mode parameters in C++.
7. What is a file? Differentiate between text file and binary file in C++.
1. Briefly explain one-tier database architecture.
2. Explain relational data model with an example.
3. Define hierarchical model. Give one advantage and disadvantage.
4. Mention database users.
5. Mention any three advantages of random/direct access file organization.
6. Explain the advantages (features) of DBMS.
7. Explain any three applications of DBMS.
8. Mention different database models. Explain any one.
9. Define sequential access, direct access, and indexed sequential access file
organizations.
10.Give the application of database.
1. What is a web browser? Mention any two web browsers.
2. What is web hosting? Mention the different types of web hosting.
3. What is meant by shareware? Write its limitation.
4. Give the services of E-commerce.
5. Define E-commerce. Write the various technologies and services
used in E-commerce.
6. Write the advantages of e-commerce.
7. Define: a) world wide web, b) web browser, c) web page.
8. Explain any three types of e-commerce.
9. What is E-commerce. Mention its types.
1. Explain any three formatting tags in HTML.
2. What is web hosting? Mention various web hosting services.
3. Define the term a) Web page b) Web browser c) WWW
4. Explain any three HTML tags.
5. Explain the general structure of HTML.
6. Discuss any three text formatting tags in HTML.
7. Write the features of DHTML.
1. Give the Boolean function F(W,X,Y,Z) = Σ(0,4,8,9,10,11,12,13,15). Reduce it by using Karnaugh
map.
2. Reduce F(A,B,C,D) = Σ(1,2,3,4,5,7,9,11,12,13,14,15).Using Karnaugh map.
3. Using K-map, simplify the following expression in four variables. F(A, B, C, D) = m1 + m2 + m4
+ m5 + m9 + m11 + m12 + m13
4. Reduce F(A, B, C, D) = Σ(1,5,9,10,11,12,13,14). Using Karnaugh map.
5. Reduce F (A, B, C, D) = Σ (0, 4, 6, 7, 8, 12, 14, 15). Using Karnaugh map.
6. Simplify the following Boolean expression using K-map F (A, B, C, D) = Σ (0, 2, 5, 7, 8, 10, 13,
15).
7. Simplify the given Boolean expression using K-map: F(A,B,C,D)=Σ(1,2,3,5,7,8,9,11,13,15)
8. Simplify the given Boolean expression using map. F(A,B,C,D)=Σ(0,2,4,5,6,7,8,10,12,13,14,15)
9. Given Boolean function. f (a, b, c, d) = Σ(0, 1, 2, 3, 4, 6, 8, 10, 12, 14).Reduce it by using
Karnaugh map.
10.Given Boolean function.F(A, B, C, D) = Σ(0, 1, 2, 3, 5, 6, 9, 10, 13, 14).Reduce it by using
Karnaugh map.
11.Given Boolean function f(A,B,C,D,)=S(0,1, 2, 3, 6, 10, 13, 14, 15) reduce it by using Karnaugh
map.
12.Simplify the following Boolean function. F(A,B,C,B) = ∑ (0, 2, 4, 6, 10, 14)
