Scribd
Upload
84 views

2023 MQP 2341 Computer Science

The document provides the blueprint for the II PU Computer Science examination which assesses students across 17 chapters. It includes the distribution of questions across various sections - VSA (very short answer), SA (short answer) and LA (long answer). A total of 70 questions will be asked from the prescribed textbook covering topics like computer hardware, Boolean algebra, logic gates, data structures, object-oriented programming, databases and more. Sample questions are provided at the end as part of model paper to assess different cognitive levels from students.

Uploaded by

SAWIN N. G SAWIN N. G
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
84 views

2023 MQP 2341 Computer Science

The document provides the blueprint for the II PU Computer Science examination which assesses students across 17 chapters. It includes the distribution of questions across various sections - VSA (very short answer), SA (short answer) and LA (long answer). A total of 70 questions will be asked from the prescribed textbook covering topics like computer hardware, Boolean algebra, logic gates, data structures, object-oriented programming, databases and more. Sample questions are provided at the end as part of model paper to assess different cognitive levels from students.

Uploaded by

SAWIN N. G SAWIN N. G
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

KARNATAKA STATE PRE-UNIVERSITY EDUCATION

II PU Computer Science Blueprint


VSA SA LA E Total
UNIT DESCRIPTION
(1 Mark) (2 Marks) (3 Marks) (5 Marks) Marks
Typical
Chapter 1
configuration of ------ 1 ------- 4
5 Hrs 1(mcq)
Computer system
Chapter 2
Boolean algebra 1(mcq) 2 ----- 1 09+1
10 Hrs
Chapter 3
Logic Gates 1(mcq) ------ 1 ------- 04
5 Hrs
Chapter 4
Data structures 1(mcq) ------ 1 2 14
15 Hrs
Chapter 5 Review of C++ covered in
First PUC ------- ------- ------- ------ ----
3 Hrs
Chapter 6
OOP concepts ---- 1 ---- 1 07
4 Hrs
Chapter 7
Classes and objects 1(mcq) ------ ----- 1 06
6 Hrs
Chapter 8 Function
1(mcq) ------ ------ 1 05+1
3 Hrs Overloading
Chapter 9 Constructors and
1(mcq) 1 ---- 1 07+1
8 Hrs Destructors
Chapter 10
Inheritance 1(mcq) ----- ------ 1 05+1
8 Hrs
Chapter 11
Pointers 1(mcq) ----- 1 ------ 04
7 Hrs
Chapter 12
Data File handling ------- 1 1 ------ 05
6 Hrs
1(mcq)
Chapter 13
Database concepts 5x1-Fill-in 1 1 1 11+5
8 Hrs
blank
Chapter 14
SQL commands 1(mcq) 1 ----- 1 07+1
12 Hrs
Chapter 15 Networking
2(mcq) 1 ---- 1 9
10 Hrs Concepts
Chapter 16 Internet and Open
1(mcq) ---- 1 ----- 4
5 Hrs source concepts
Chapter 17
Web Designing 1(mcq) ----- 1 ------ 4
5 Hrs
Total Marks 10+10 16 24 55 115
Total No of
Questions to be 1x20=20 2x4/8=08 3x4/8=12 5x6/11=30 70/47
answered

NOTE: 1. Questions should be direct


2. The answers should be present in the prescribed textbook by PUE
3. 40% - Simple, 40% - Average and 20% - Difficult questions
4. Questions should be according to Blueprint
II PU COMPUTER SCIENCE – MODEL PAPER

PART – A
Answer all the questions. Each question carries one mark. 1 x 20 = 20

I Select the correct answer from the choices given: (Repeated answers will not be considered)
1. Which among the following is the fastest memory in a computer that holds information?
a) Register b) Cache
c) Main memory d) RAM
2. The other name of Boolean algebra is _____________
a) Switching algebra b) Relational Algebra
c) Digital Algebra d) None of the above
3. The other name of NOT gate is ___________
a) Neglect gate b) Inverter gate
c) XOR gate d) XNOR gate
4. The data structure that allows the insertion, as well as the deletion from both the ends, are:
a) String b) Linked List data structure
c) Stack data structure d) Dequeue data structure
5. What is the other name used for functions inside a class?
a) Member variables b) Member functions
c) Class functions d) Class variables
6. Function cannot be overloaded when ________________
a) Function names are same b) Number of parameters are different
c) Number of parameters are same d) Data types of parameters are different
7. The symbol used with constructor is ________
a) $ b) &
c) Delta c) ~
8. Base class is ___________
a) a sub class b) inherited class
c) Main class d) First class
9. Which of the following is the correct way to declare a pointer?
a) int *ptr b) int ptr
c) int &ptr d) All of the above
10. ____________ is called information.
a) Raw fact b) collection of data
c) Unprocessed data d) Processed data
11. SQL is _______________________.
a) Theoretical Language b) Procedural Language
c) Structured Language d) Unstructured Language
-2-
12. FTP stands for _______________
a) Final Transistor Protocol b) File Transformation Protocol
c) File Transfer Protocol d) File Transaction Protocol
13. Which of the following is not a type of network?
a) LAN b) MAN
c) PAN d) VAN
14. A software and coding which is freely available on internet is ______________.
a) Community Software b) Free Software
c) Open-Source Software d) Unlicensed Software
15. HTML stands for ____________________________________
a) Hyper Text Makeup Language b) Hyper Text Markup Language
c) Hyper Text Marking Language d) Hyper Text Marker Language
II Fill in the blanks choosing the appropriate word/words from those given in brackets.
(Repeated answers will not be considered)
(Security, Redundancy, DBMS, Database, Table)
16. Collection of rows and columns is called as ___________
17. ___________ is a collection of interrelated data.
18. Data duplication is called as ____________________.
19. _____________is a software for creating and managing databases.
20. Protection of data is the _________________.

PART – B
Answer any FOUR questions. Each question carries two marks. 2x4=8
21. Prove ̿
X = X.
22. Define tautology and fallacy.
23. What is encapsulation? Give an example.
24. What is destructor? Give example for destructor.
25. Mention any two functions of ifstream and give their meaning.
26. Give any two advantages of database system.
27. Give the syntax and example for INSERT command in SQL.
28. Briefly explain circuit switching.
-3-
PART – C

Answer any FOUR questions. Each question carries three marks. 3 x 4 = 12


29. Briefly explain any three types of mother board.
30. Write the logic diagram and the truth table for XOR gate.
31. Give the memory representation of stack data structure.
32. Mention any three advantages of pointers.
33. What is a data file? Differentiate between text and binary files.
34. Give the meaning for any three components of E-R diagram.
35. What is e-commerce? Explain any one type of e-commerce.
36. Explain any three table tags in HTML.
PART – D

Answer any SIX questions. Each question carries five marks. 5 x 6 = 30


37. Give the Boolean function F(A,B,C,D) = Σ(0,2,5,7,8,10,13,15).
Reduce it by using Karnaugh map (K-Map).
38. Explain any five operations performed on primitive data structure.
39. Write an algorithm to delete a data element from an array.
40. Give the differences between procedural programming and object-oriented programming.
41. With an example explain member function inside the class definition.
42. What is a friend function? Mention the characteristics of a friend function.
43. What is a parameterized constructor? Mention the advantages of parameterized constructor.
44. What is inheritance? Explain any two types of inheritance.
45. Differentiate between manual and electronic data processing.
46. Explain CREATE and UPDATE commands in SQL.
47. Explain the following:
i. SMS ii. E-mail iii. Voice mail iv. Chat v. Video conference

*****

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy