Deprecated: Optional parameter $i declared before required parameter $data is implicitly treated as a required parameter in /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php on line 4

Deprecated: Optional parameter $i declared before required parameter $data is implicitly treated as a required parameter in /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php on line 245

Deprecated: Optional parameter $output declared before required parameter $attr is implicitly treated as a required parameter in /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/snippets.php on line 431

Deprecated: Using ${var} in strings is deprecated, use {$var} instead in /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/mega-menu.php on line 147

Warning: Cannot modify header information - headers already sent by (output started at /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php:4) in /home4/aipsa9vw/public_html/blogs/wp-includes/rest-api/class-wp-rest-server.php on line 1909

Warning: Cannot modify header information - headers already sent by (output started at /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php:4) in /home4/aipsa9vw/public_html/blogs/wp-includes/rest-api/class-wp-rest-server.php on line 1909

Warning: Cannot modify header information - headers already sent by (output started at /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php:4) in /home4/aipsa9vw/public_html/blogs/wp-includes/rest-api/class-wp-rest-server.php on line 1909

Warning: Cannot modify header information - headers already sent by (output started at /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php:4) in /home4/aipsa9vw/public_html/blogs/wp-includes/rest-api/class-wp-rest-server.php on line 1909

Warning: Cannot modify header information - headers already sent by (output started at /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php:4) in /home4/aipsa9vw/public_html/blogs/wp-includes/rest-api/class-wp-rest-server.php on line 1909

Warning: Cannot modify header information - headers already sent by (output started at /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php:4) in /home4/aipsa9vw/public_html/blogs/wp-includes/rest-api/class-wp-rest-server.php on line 1909

Warning: Cannot modify header information - headers already sent by (output started at /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php:4) in /home4/aipsa9vw/public_html/blogs/wp-includes/rest-api/class-wp-rest-server.php on line 1909

Warning: Cannot modify header information - headers already sent by (output started at /home4/aipsa9vw/public_html/blogs/wp-content/themes/voice/include/modules.php:4) in /home4/aipsa9vw/public_html/blogs/wp-includes/rest-api/class-wp-rest-server.php on line 1909
{"id":272,"date":"2023-01-09T17:18:48","date_gmt":"2023-01-09T17:18:48","guid":{"rendered":"https:\/\/aipsacademy.com\/blogs\/?p=272"},"modified":"2023-03-18T16:25:48","modified_gmt":"2023-03-18T16:25:48","slug":"jac-12th-computer-science-vvi-important-questions-2023","status":"publish","type":"post","link":"https:\/\/aipsacademy.com\/blogs\/2023\/01\/09\/jac-12th-computer-science-vvi-important-questions-2023\/","title":{"rendered":"JAC 12th Computer Science Questions 2023 Solution"},"content":{"rendered":"\n

In this , I am going to provide and practice JAC 12th Computer Science vvi important Questions 2023. It will will be very helpful to all those students who are going to appear JAC examination 2023. Lets begin.<\/p>\n\n\n\n

COMPUTER SCIENCE XII<\/strong> 2023<\/h4>\n\n\n\n
Choose the correct alternative for the following: 2*35=70<\/p>\n\n\n\n
C++ is a\/an \u2026\u2026\u2026\u2026Language.<\/li><\/ol>\n\n\n\n
(1) English\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) High Level Language<\/strong><\/p>\n\n\n\n
(3) Assembly\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
2. main ( ) is a\/an<\/p>\n\n\n\n
(1) Literal \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2)Function<\/strong><\/p>\n\n\n\n
(3) Identifier\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
3. A set of logical operator is <\/p>\n\n\n\n
(1) +,-,*,\/,%\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) &&,||,!<\/strong><\/p>\n\n\n\n
(3) ?\u00a0 :\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
4. void data type represents<\/p>\n\n\n\n
(1) \u00a0\u00a0int data\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) float data<\/p>\n\n\n\n
(3) empty data<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
5.In C++, cin, cout, cerr are predefined stream<\/p>\n\n\n\n
(1) Operator\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) function<\/p>\n\n\n\n
(3) Object\u00a0<\/strong> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) none of these<\/p>\n\n\n\n
6.’A’ is an example of<\/p>\n\n\n\n
(1) Integer literal\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0 (2) String literal<\/p>\n\n\n\n
(3) Character literal<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) bool literal<\/p>\n\n\n\n
7.A variable that holds memory address is called<\/p>\n\n\n\n
(1) Array \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Class<\/p>\n\n\n\n
(3) Function\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) Pointer<\/strong><\/p>\n\n\n\n
8. The prefix increment \/ decrement operators follow the rule<\/p>\n\n\n\n
(1) Change then use<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) use then change<\/p>\n\n\n\n
(3) save and delete\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
9.The order of the evolution of the expression A \/ B * C -D + E will be <\/p>\n\n\n\n
(1) *,\/,+,-<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) *,-,*,\/<\/p>\n\n\n\n
(3) \/,*,-,*\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
10. Which of the following concepts means wrapping up of data and function together ?<\/p>\n\n\n\n
(1) Inheritance\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Encapsulation<\/strong><\/p>\n\n\n\n
(3) Construction\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(4) 3<\/p>\n\n\n\n
11. Which of the following is not the member of class?<\/p>\n\n\n\n
(1) Static function\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0 (2) Friend function<\/strong><\/p>\n\n\n\n
(3) Constructor function \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
12. Which of the following is not a feature of C++ ?<\/p>\n\n\n\n
(1) Polymorphism (2) Inheritance<\/p>\n\n\n\n
(3) Abstraction (4) Reflection<\/p>\n\n\n\n
13.Object Oriented Programming follows<\/p>\n\n\n\n
(1) Top Down approach (2) Bottom up approach<\/p>\n\n\n\n
(3) Left-Right approach (4) Right \u2013Left approach<\/p>\n\n\n\n
14. Wrapping up of data and functions into a single unit is called<\/p>\n\n\n\n
(1) Inheritance (2) Polymorphism<\/p>\n\n\n\n
(3) Encapsulation (4) None of these<\/p>\n\n\n\n
15.Instance of a class is called<\/p>\n\n\n\n
(1) File (2) object<\/p>\n\n\n\n
(3) Keyword (4) None of these<\/p>\n\n\n\n
16. By default the members of a class are<\/p>\n\n\n\n
(1) Public (2) Private<\/p>\n\n\n\n
(3) Protected (4) None of these<\/p>\n\n\n\n
17.A class can have the \u2026\u2026\u2026\u2026\u2026\u2026members<\/p>\n\n\n\n
(1) Data (2) Member functions<\/p>\n\n\n\n
(3) Bothe (1) and (2) (4) None of these<\/p>\n\n\n\n
18. The operation of processing each element in the list is known as<\/p>\n\n\n\n
(1) Sorting (2) Merging<\/p>\n\n\n\n
(3) Inserting (4) Traversal<\/p>\n\n\n\n
19. Beginning address of an array is called<\/p>\n\n\n\n
(1) Top address (2) Base address<\/p>\n\n\n\n
(3) File address (4) None of these<\/p>\n\n\n\n
20. A line of people waiting for their turn to vote is an example of<\/p>\n\n\n\n
(1) Stack (2) Queue<\/p>\n\n\n\n
(3) Linked list (4) None of these<\/p>\n\n\n\n
21.Stack follows.<\/p>\n\n\n\n
(1) GIGO Technique (2) FIFO Technique<\/p>\n\n\n\n
(3) LIFO Technique (4) None of these<\/p>\n\n\n\n
22.The elements are inserted in a queue from the end called<\/p>\n\n\n\n
(1) Top (2) middle<\/p>\n\n\n\n
(3) Rear (4) Front<\/p>\n\n\n\n
23. If a class X inherits from class Y, then Y is called ……………………of X.<\/p>\n\n\n\n
(1) Super class\u00a0 \u00a0<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Sub class<\/p>\n\n\n\n
(3) Abstract class \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
24.in Public inheritance, a protected data member of the base class will be treated in derived class as <\/p>\n\n\n\n
(1) Public\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0 \u00a0 (2) Private<\/p>\n\n\n\n
(3) Protected<\/strong> \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) none of these<\/p>\n\n\n\n
25.A stream is a sequence of <\/p>\n\n\n\n
(1) loops\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) bytes<\/strong><\/p>\n\n\n\n
(3) files \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
26. fstream class supports<\/p>\n\n\n\n
(1) Input operation \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Output operation<\/p>\n\n\n\n
(3) Input \/ Output operation\u00a0\u00a0<\/strong>\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
27.The rows of a relation are known as<\/p>\n\n\n\n
(1) Attribute\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Tuple<\/strong><\/p>\n\n\n\n
(3) Columns\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
28.SQL means<\/p>\n\n\n\n
(1) Simple Query Language \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Structure Query Language<\/strong><\/p>\n\n\n\n
(3) Standard Query Language\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
29.Duplication of data is known as <\/p>\n\n\n\n
(1) Default\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0 (2) Delta<\/p>\n\n\n\n
(3) Data Redundancy\u00a0\u00a0\u00a0<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
30.A Boolean expression that always results in false is called <\/p>\n\n\n\n
(1)Fallacy <\/strong> \u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Tautology\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/p>\n\n\n\n
(3)Stack \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
31.Distributive law states<\/p>\n\n\n\n
(1) X+(Y+Z)=(X+Y)+Z\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) X+Y=Y+X<\/p>\n\n\n\n
(3) X+YZ=(X+Y)(X+Z)\u00a0\u00a0\u00a0<\/strong>\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0 (4) None of these<\/p>\n\n\n\n
32.Minterm designation of A B’CD’<\/p>\n\n\n\n
(1) M10\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0 (2) m10<\/p>\n\n\n\n
(3) m5\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/strong><\/p>\n\n\n\n
33.First Network was<\/p>\n\n\n\n
(1) ARPA net\u00a0<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) NSF net<\/p>\n\n\n\n
(3) Internet\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0 (4) None of these<\/p>\n\n\n\n
34.The pattern of interconnection of nodes in a network is called<\/p>\n\n\n\n
(1) Protocol \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (2) Topology<\/strong><\/p>\n\n\n\n
(3) Modulation\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (4) None of these<\/p>\n\n\n\n
35.XML means<\/p>\n\n\n\n
(1) Exempted Markup Language\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/p>\n\n\n\n
(2) Extensible Module Language<\/p>\n\n\n\n
(3) Extensible Markup Language<\/strong><\/p>\n\n\n\n
(4) None of these<\/p>\n\n\n\n
\ufeff<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
COMPUTER SCIENCE XII<\/strong><\/h3>\n\n\n\n
\n
2023<\/strong><\/p>\n\n\n\n
(PRACTICAL)<\/strong><\/p>\n\n\n\n
Full marks-30<\/strong><\/p>\n\n\n\n
Pass marks -10<\/strong><\/p>\n\n\n\n
Time -3 Hours<\/strong><\/p>\n\n\n\n
 <\/strong>GROUP- A<\/strong><\/strong><\/p>\n<\/div><\/div>\n\n\n\n
Figures in the margin indicate full marks.<\/strong> <\/strong><\/strong><\/p>\n\n\n\n
1<\/strong>.Answer any two of the following questions: 5*2=10<\/strong><\/strong><\/p>\n\n\n\n
a) Write a program in C++ to calculate the sum of the following series.<\/p>\n\n\n\n
<\/p>\n\n\n\n
$\"\"$ <\/figure>\n\n\n\n
<\/p>\n\n\n\n
$\"\"$ <\/figure>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
$\"\"$ <\/figure>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
$\"\"$ <\/figure>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
$\"\"$ <\/figure>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
$\"\"$ <\/figure>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n\n\n\n
COMPUTER SCIENCE XII<\/strong><\/h3>\n\n\n\n
\n
202<\/strong>2<\/p>\n\n\n\n
(PRACTICAL)<\/strong><\/p>\n\n\n\n
Full marks-30<\/strong><\/p>\n\n\n\n
Pass marks -10<\/strong><\/p>\n\n\n\n
Time -3 Hours<\/strong><\/p>\n\n\n\n
 <\/strong>GROUP- A<\/strong><\/strong><\/p>\n<\/div><\/div>\n\n\n\n
Figures in the margin indicate full marks.<\/strong> <\/strong><\/strong><\/p>\n\n\n\n
1<\/strong>.Answer any two of the following questions: 5*2=10<\/strong><\/strong><\/p>\n\n\n\n
a) Write a program in C++ to calculate the sum of the following series.<\/p>\n\n\n\n
 Sum=1^{2<\/sup>+2^{2<\/sup>+3^{2<\/sup>+\u2026\u2026\u2026\u2026\u2026\u2026\u2026..+n^{2<\/sup><\/strong><\/p>\n\n\n\n}}}}
#include<iostream.h>\n#include<conio.h>\nvoid main() \n{\nclrscr();\nint n,i,s=0;\t\ncout<<\u201dEnter value of n=\u201d;\ncin>>n;\nfor(i=1;i<=n;i++)\n{\ncout<<(i*i)<<\u201d\\t\u201d;\ns=s+(i*i);\n}\ncout<<\u201d\\nsum of series=\u201d<<s;\ngetch();\n}\n<\/code><\/pre>\n\n\n\nOutput <\/p>\n\n\n\n Enter value of n=5<\/p>\n\n\n\n 1 4 9 16 25 <\/p>\n\n\n\n sum of series=55<\/p>\n\n\n\n b) Write a program in C++ to display the following pattern.<\/p>\n\n\n\n \n 1<\/strong><\/p>\n\n\n\n 1 2<\/strong><\/p>\n\n\n\n 1 2 3<\/strong><\/p>\n\n\n\n 1 2 3 4 <\/strong><\/p>\n\n\n\n 1 2 3 4 5<\/strong><\/p>\n\n\n\n #include<iostream.h>\n#include<conio.h>\nvoid main() \n{\nclrscr();\nint i,j;\nfor(i=1;i<=5;i++)\n{\nfor(j=1;j<=i;j++)\n{\ncout<<j<<\u201d \\t\u201d;\n}\ncout<<\u201d\\n\u201d;\n}\ngetch();\n}\n<\/code><\/pre>\n<\/div><\/div>\n\n\n\n<\/p>\n\n\n\n c)Write a program in C++ to show the concept of single Inheritance.<\/strong><\/p>\n\n\n\n #include<iostream.h>\n#include<conio.h>\nclass nips\n{\npublic:\nint a,b,c;\nvoid input();\nvoid process();\nvoid show();\n};\nvoid nips::input()\n{\na=10;\nb=5;\n}\nvoid nips::process()\n{\nc=a+b;\n}\nvoid nips::show()\n{\ncout<<\"Sum=\"<<c;\n}\n\n\nvoid main()\n{\nclrscr();\nnips n1;\nn1.input();\nn1.process();\nn1.show();\ngetch();\n}<\/code><\/pre>\n\n\n\nOutput<\/strong><\/p>\n\n\n\n Sum=15<\/p>\n\n\n\n d) Write a program in C++ to enter any 10 integers in 1 D Array<\/strong> and display the total sum of those digits.<\/p>\n\n\n\n #include<iostream.h>\n#include<conio.h>\nvoid swap(int &,int &);\nvoid main() \n{\nclrscr();\nint a,b;\na=10;\nb=20;\ncout<<\u201dBefore swapping a=\u201d<<a<<\u201d\\tb=\u201d<<b;\nswap(a,b);\ncout<<\u201d\\nAfter swapping in main a=\u201d<<a<<\u201d\\tb=\u201d<<b;\ngetch();\n}\nvoid swap(int &x,int &y)\n{\nint z;\nz=x;\nx=y;\ny=z;\ncout<<\u201d\\n After swapping in function a=\u201d<<x<<\u201d\\tb=\u201d<<y;\n}\n<\/code><\/pre>\n\n\n\nOutput<\/strong><\/p>\n\n\n\n \nBefore swapping a=10 b=20<\/p>\n\n\n\n After swapping in function a= 20 b=10<\/p>\n\n\n\n After swapping in main a=20 b=10<\/p>\n<\/div><\/div>\n\n\n\n <\/p>\n\n\n\n GROUP- B<\/strong><\/p>\n\n\n\n 2. Write SQL commands for (a) to (e) on the basis of FAMILY relation given below: 1*5=5<\/strong><\/p>\n\n\n\n No.<\/strong><\/td> Name<\/strong><\/td> Female Members<\/strong><\/td> Male Members<\/strong><\/td> Income (Rs.)<\/strong><\/td> Occupation<\/strong><\/td><\/tr> 1<\/strong><\/td> Mishra<\/strong><\/td> 3<\/strong><\/td> 2<\/strong><\/td> 7,000<\/strong><\/td> Service<\/strong><\/td><\/tr> 2<\/strong><\/td> Gupta<\/strong><\/td> 4<\/strong><\/td> 1<\/strong><\/td> 50,000<\/strong><\/td> Business<\/strong><\/td><\/tr> 3<\/strong><\/td> Khan<\/strong><\/td> 6<\/strong><\/td> 3<\/strong><\/td> 8,000<\/strong><\/td> Mixed<\/strong><\/td><\/tr> 4<\/strong><\/td> Chadda<\/strong><\/td> 2<\/strong><\/td> 2<\/strong><\/td> 25,000<\/strong><\/td> Business<\/strong><\/td><\/tr> 5<\/strong><\/td> Yadav<\/strong><\/td> 7<\/strong><\/td> 2<\/strong><\/td> 20,000<\/strong><\/td> Mixed<\/strong><\/td><\/tr> 6<\/strong><\/td> Joshi<\/strong><\/td> 3<\/strong><\/td> 2<\/strong><\/td> 14,000<\/strong><\/td> Service<\/strong><\/td><\/tr> 7<\/strong><\/td> Maurya<\/strong><\/td> 6<\/strong><\/td> 3<\/strong><\/td> 5,000<\/strong><\/td> Farming<\/strong><\/td><\/tr> 8<\/strong><\/td> Rao<\/strong><\/td> 5<\/strong><\/td> 2<\/strong><\/td> 10,000<\/strong><\/td> Service<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n a) To select all the information of family whose occupation is service .<\/p>\n\n\n\n SQL> SELECT * From FAMILY where Occupation=’Service’;<\/strong><\/p>\n\n\n\n b) To list the names of family, where female members are more than 3.<\/p>\n\n\n\n SQL> SELECT Name From FAMILY <\/strong>Where Female Members >3;<\/strong><\/p>\n\n\n\n c) To list the names of family with income in ascending order.<\/p>\n\n\n\n SQL> SELECT Name From FAMILY ORDER BY Income;<\/strong><\/p>\n\n\n\n d) To list family\u2019s name, number of male members and their business of business family.<\/p>\n\n\n\n SQL> SELECT COUNT(*) From SPORTS where Game=’Tennis’;<\/strong><\/p>\n\n\n\n e) To count the number of family, whose income is less than Rs. 10,000.<\/p>\n\n\n\n SQL> SELECT DISTINCT Game From SPORTS’;<\/strong><\/p>\n\n\n\n <\/p>\n\n\n\n GROUP- C<\/strong><\/p>\n\n\n\n 3)Practical File 5<\/p>\n\n\n\n 4)Project Work 5<\/p>\n\n\n\n 5)Viva-voce 5<\/p>\n\n\n\n <\/p>\n\n\n\n <\/p>\n\n\n\n <\/p>\n\n\n\n \n<\/iframe>\n<\/div><\/figure>\n\n\n\n<h3 class=\"wp-block-heading\">JAC 12th Computer Science #2021<\/strong><\/h3>\n\n\n\n<h4 class=\"wp-block-heading\"> COMPUTER SCIENCE XII<\/strong> 2021<\/u><\/strong><\/h4>\n\n\n\nChoose the correct alternative for the following:                       2*35=70<\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\" type=\"1\"><li>C++ is developed by<\/li><\/ol>\n\n\n\n(1) Dennis Ritchie                                                              (2) Ken Thompson<\/p>\n\n\n\n(3) Martin Richard                                                             (4) B jarne Stroustru<\/strong><\/p>\n\n\n\n2. The smallest individual unit in a program is called<\/p>\n\n\n\n(1) Token   <\/strong>                                                                       (2) Keyword<\/p>\n\n\n\n(3) Operator                                                                       (4) None of these<\/p>\n\n\n\n3. \u201cReema\u201d is an example of<\/p>\n\n\n\n(1) Integer literal                                                               (2) Character literal<\/p>\n\n\n\n(3) String literal<\/strong>                                                                 (4) None of these<\/p>\n\n\n\n4. Relational operators are<\/p>\n\n\n\n(1) +,-,*,\/,%                                                                       (2) &&,||,!<\/p>\n\n\n\n(3) ?  :                                                                                (4) >,<,>=,<=,==,!=<\/strong><\/p>\n\n\n\n5.Every C++ program must contain a \u2026\u2026\u2026\u2026\u2026\u2026function.<\/p>\n\n\n\n(1) main( )<\/strong>                                                                         (2) strlen( )<\/p>\n\n\n\n(3) getch( )                                                                       (4) none of these<\/p>\n\n\n\n6.Char ,int , float , double and void are<\/p>\n\n\n\n(1) User defined data type                                          (2) Fundamental data type<\/p>\n\n\n\n(3) Derived data type                                                         (4) None of thes<\/p>\n\n\n\n7.x=++y +2y evaluates to (if y=6)<\/p>\n\n\n\n(1) 18                                                                                 (2) 21<\/p>\n\n\n\n(3) 20                                                                                (4) None of these<\/p>\n\n\n\n8. While loop checks condition on<\/p>\n\n\n\n(1) Top                                                                              (2) Bottom<\/p>\n\n\n\n(3) Left                                                                              (4) None of these<\/p>\n\n\n\n9.Jump statement(s) is \/ are<\/p>\n\n\n\n(1) go to                                                                            (2) continue<\/p>\n\n\n\n(3) break                                                                            (4) All of these<\/p>\n\n\n\n10. In C++, array index always starts from<\/p>\n\n\n\n(1) 0                                                                                  (2) 1<\/p>\n\n\n\n(3) 2                                                                                  (4) 3<\/p>\n\n\n\n11. In C++ programming strcat( ) function is used for<\/p>\n\n\n\n(1) count length of a string                                          (2) Converting string to character<\/p>\n\n\n\n(3) comparing two strings                                                  (4) concatenating two strings<\/p>\n\n\n\n12. Which of the following is not a feature of C++ ?<\/p>\n\n\n\n(1) Polymorphism                                                              (2) Inheritance<\/p>\n\n\n\n(3) Abstraction                                                                  (4) Reflection<\/p>\n\n\n\n13.Object Oriented Programming follows<\/p>\n\n\n\n(1) Top Down approach                                                    (2) Bottom up approach<\/p>\n\n\n\n(3) Left-Right approach                                                     (4) Right \u2013Left approach<\/p>\n\n\n\n14. Wrapping up of data and functions into a single unit is called<\/p>\n\n\n\n(1) Inheritance                                                                   (2) Polymorphism<\/p>\n\n\n\n(3) Encapsulation                                                               (4) None of these<\/p>\n\n\n\n15.Instance of a class is called<\/p>\n\n\n\n(1) File                                                                               (2) object<\/p>\n\n\n\n(3) Keyword                                                                                (4) None of these<\/p>\n\n\n\n16. By default the members of a class are<\/p>\n\n\n\n(1) Public                                                                           (2) Private<\/p>\n\n\n\n(3) Protected                                                                      (4) None of these<\/p>\n\n\n\n17.A class can have the \u2026\u2026\u2026\u2026\u2026\u2026members<\/p>\n\n\n\n(1) Data                                                                             (2) Member functions<\/p>\n\n\n\n(3) Bothe (1) and (2)                                                         (4) None of these<\/p>\n\n\n\n18. The operation of processing each element in the list is known as<\/p>\n\n\n\n(1) Sorting                                                                         (2) Merging<\/p>\n\n\n\n(3) Inserting                                                                       (4) Traversal<\/p>\n\n\n\n19. Beginning address of an array is called<\/p>\n\n\n\n(1) Top address                                                                 (2) Base address<\/p>\n\n\n\n(3) File address                                                                  (4) None of these<\/p>\n\n\n\n20. A line of people waiting for their turn to vote is an example of<\/p>\n\n\n\n(1) Stack                                                                            (2) Queue<\/p>\n\n\n\n(3) Linked list                                                                    (4) None of these<\/p>\n\n\n\n21.Stack follows.<\/p>\n\n\n\n(1) GIGO Technique                                                         (2) FIFO Technique<\/p>\n\n\n\n(3) LIFO Technique                                                          (4) None of these<\/p>\n\n\n\n22.The elements are inserted in a queue from the end called<\/p>\n\n\n\n(1) Top                                                                              (2) middle<\/p>\n\n\n\n(3) Rear                                                                             (4) Front<\/p>\n\n\n\n23. A linked list is a collection of data elements, called<\/p>\n\n\n\n(1) Array                                                                           (2) Pointer<\/p>\n\n\n\n(3) Nodes                                                                          (4) None of these<\/p>\n\n\n\n24.Binary search works on only on<\/p>\n\n\n\n(1) Unsorted array                                                             (2) Sorted array<\/p>\n\n\n\n(3) int array                                                                        (4) none of these<\/p>\n\n\n\n25.ABC* + D \u2013 EF\/* is a\/ an<\/p>\n\n\n\n(1) Infix expression                                                           (2) Prefix expression<\/p>\n\n\n\n(3) Postfix expression                                                        (4) None of these<\/p>\n\n\n\n26. Duplication of data is known as<\/p>\n\n\n\n(1) Delta                                                                            (2) Dque<\/p>\n\n\n\n(3) Data redundancy                                                          (4) None of these<\/p>\n\n\n\n27.A relational data model organizes the data into tables known as<\/p>\n\n\n\n(1) Relation                                                                        (2) Network<\/p>\n\n\n\n(3) File                                                                               (4) None of these<\/p>\n\n\n\n28.A row in a relation is called<\/p>\n\n\n\n(1) Data                                                                             (2) Tuple<\/p>\n\n\n\n(3) Domain                                                                        (4) None of these<\/p>\n\n\n\n29.Which of the following searching algorithms is of divide and conquer type?<\/p>\n\n\n\n(1) Linear Search                                                               (2) Binary search<\/p>\n\n\n\n(3) File searching                                                               (4) None of these<\/p>\n\n\n\n30.DBMS stands for<\/p>\n\n\n\n(1)Database Management system                   (2) Database Manual System                   <\/p>\n\n\n\n(3)Define Management Solution                    (4) None of these<\/p>\n\n\n\n31.The\u2026\u2026\u2026\u2026\u2026\u2026\u2026.command creates a new table.<\/p>\n\n\n\n(1) CREATE TABLE                                              (2) CREATE VIEW<\/p>\n\n\n\n(3) CREATE EMPLOYEE                                      (4) None of these<\/p>\n\n\n\n32.COUNT( ) is used to<\/p>\n\n\n\n(1) Count total number of rows                               (2) Count total number of columns<\/p>\n\n\n\n(3) Count total number of files                                (4) None of these<\/p>\n\n\n\n33.Network devices (s) is \/are<\/p>\n\n\n\n(1) Modem                                                                        (2) Hub<\/p>\n\n\n\n(3) Router                                                                          (4) All of these<\/p>\n\n\n\n34.The pattern of interconnection of nodes in a network is called<\/p>\n\n\n\n(1) Protocol                                                                       (2) Topology<\/p>\n\n\n\n(3) E-mail                                                                          (4) None of these<\/p>\n\n\n\n35.HTTP means<\/p>\n\n\n\n(1) Height type Transfer protocol                                                         <\/p>\n\n\n\n(2) Hyper Text Transfer Protocol<\/p>\n\n\n\n(3) Hyper Text Transfer Power<\/p>\n\n\n\n(4) None of these<\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #2009<\/strong> Questions<\/h4>\n\n\n\n1) <\/strong>. (a) Write the name of the header files on which the following belongs:<\/p>\n\n\n\n (i) abs()                           (ii) setw()<\/strong><\/p>\n\n\n\nAns:- #include<math.h> #include<iomanip.h><\/p>\n\n\n\n(b) Differentiate between datatype and Data Structure.<\/strong><\/p>\n\n\n\n(c) Find the output:<\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\nvoid main()\n{\nint i=5;\nfor(;i<10;)\ncout<<i++<<\" \"<<endl;\n}<\/code><\/pre>\n\n\n\n      <\/strong> Output: <\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n5<\/p>\n\n\n\n6<\/p>\n\n\n\n7<\/p>\n\n\n\n8<\/p>\n\n\n\n9<\/p>\n<\/div><\/div>\n\n\n\n(e) Explain the following in brief:<\/p>\n\n\n\n<ol class=\"wp-block-list\"><li>Data abstraction <\/li><li>Encapsulation<\/li><\/ol>\n\n\n\n(f)Write the output of the following program:<\/p>\n\n\n\n2.(a) Write the output of the following program segment:<\/p>\n\n\n\n(b) Write a program in C++ to check the input number is prime or not.<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid main()\n{\nclrscr();\nint n,i;\ncout<<\"Enter any number=\";\ncin>>n;\nfor(i=2;i<n;i++)\n{\n\nif(n%i==0)\nbreak;\n\n}\n\nif(i= = n)\ncout<<\"Number is prime\";\nelse\ncout<<\"Number is not prime\";\n\ngetch();\n}<\/code><\/pre>\n\n\n\n<\/p>\n\n\n\n<\/p>\n\n\n\n(d) Write a program in C++ to generate Fibonacci series between 1-100.<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code><\/code><\/pre>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 14\/08\/202<\/strong>1<\/h4>\n\n\n\n1) STACK follows<\/strong><\/p>\n\n\n\n      <\/strong> i) GIGO Technique                                                      ii) FIFO  Technique   <\/p>\n\n\n\n      iii) LIFO Technique<\/strong>                                                     iv) None of these<\/p>\n\n\n\n2) A set of  conditional\/ ternary operator(s) is\/are<\/strong><\/p>\n\n\n\n       i) +,-,*,\/,%                                                                    ii) >,<,>=,<=,==,!=             <\/p>\n\n\n\n      iii) &&,||,!                                                                      iv) ?:<\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 13\/08\/202<\/strong>1<\/h4>\n\n\n\n1)\u2026\u2026\u2026. is a Browser.<\/strong><\/p>\n\n\n\n   <\/strong>       i) C++                                                                         ii) Firefox<\/p>\n\n\n\n          iii) Telnet                                                                    iv) Cookies<\/strong><\/p>\n\n\n\n2) People standing in a line is an example of<\/strong><\/p>\n\n\n\n       i) STACK<\/strong>                                                                     ii) QUEUE<\/strong>  <\/p>\n\n\n\n      iii) ARRAY<\/strong>                                                                   iv) Linked list<\/strong><\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 12\/08\/202<\/strong>1<\/h4>\n\n\n\n1) Main is a\/an<\/strong><\/p>\n\n\n\n       i) Object                                                                      ii) Function<\/p>\n\n\n\n      iii) Literal                                                                       iv) None of these<\/p>\n\n\n\n2) A set of logical operators is<\/strong><\/p>\n\n\n\n       i) +  –  *  \/  %                     <\/strong>                                          ii) ? :<\/strong><\/p>\n\n\n\n      iii) >  <   >=  <=                                       <\/strong>                      iv) None of these<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 11\/08\/202<\/strong>1<\/h4>\n\n\n\na) C++ is developed by<\/strong><\/p>\n\n\n\n       i) Dennis Ritchie                                                           ii)Ken Thompson             <\/p>\n\n\n\n      iii) Martin Richard                                                         iv) B jarne Stroustrup<\/p>\n\n\n\nb) String Terminator character is<\/strong><\/p>\n\n\n\n   <\/strong>    i) \u2018\\0\u2019                                                                            ii) \u2018\\n\u2019<\/p>\n\n\n\n      iii) \u2018\\b\u2019                                                                    iv) None of these<\/p>\n\n\n\nc) DBMS stands for<\/strong><\/p>\n\n\n\n       i) Database Management System                     ii) Database Manual System          <\/p>\n\n\n\n      iii) Define Management Solution                                   iv) None of these<\/p>\n\n\n\nd) The smallest individual unit is<\/strong><\/p>\n\n\n\n       i) Semicolon                                                                ii) Data type  <\/p>\n\n\n\n      iii) Token                                                                       iv) Keyword<\/p>\n\n\n\n<\/p>\n\n\n\n<\/p>\n\n\n\n<\/p>\n\n\n\n<\/p>\n\n\n\n<h3 class=\"has-text-align-center wp-block-heading\">COMPUTER SCIENCE XII<\/strong><\/h3>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n        2021<\/strong><\/p>\n\n\n\n(PRACTICAL)<\/strong><\/p>\n\n\n\nFull marks-30<\/strong><\/p>\n\n\n\nPass marks -10<\/strong><\/p>\n\n\n\nTime -3 Hours<\/strong><\/p>\n\n\n\n    <\/strong>GROUP- A<\/strong><\/strong><\/p>\n<\/div><\/div>\n\n\n\nFigures in the margin indicate full marks.<\/strong>         <\/strong><\/strong><\/p>\n\n\n\n1<\/strong>.Answer any two of the following questions:                                       5*2=10<\/strong><\/strong><\/p>\n\n\n\na) Write a program in C++ to display the following pattern.<\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n 1<\/strong><\/p>\n\n\n\n2  2<\/strong><\/p>\n\n\n\n3  3  3<\/strong><\/p>\n\n\n\n4  4  4  4  <\/strong><\/p>\n\n\n\n 5  5  5  5  5<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid main() \n{\nclrscr();\nint i,j;\nfor(i=1;i<=5;i++)\n{\nfor(j=1;j<=i;j++)\n{\ncout<<i<<\u201d \\t\u201d;\n}\ncout<<\u201d\\n\u201d;\n}\ngetch();\n}\n<\/code><\/pre>\n<\/div><\/div>\n\n\n\nb) Write a program in C++ to calculate the sum of the following series.<\/p>\n\n\n\n   Sum=12<\/sup>+22<\/sup>+32<\/sup>+\u2026\u2026\u2026\u2026\u2026\u2026\u2026..+n2<\/sup><\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid main() \n{\nclrscr();\nint n,i,s=0;\t\ncout<<\u201dEnter value of n=\u201d;\ncin>>n;\nfor(i=1;i<=n;i++)\n{\ncout<<(i*i)<<\u201d\\t\u201d;\ns=s+(i*i);\n}\ncout<<\u201d\\nsum of series=\u201d<<s;\ngetch();\n}\n<\/code><\/pre>\n\n\n\nOutput <\/p>\n\n\n\nEnter value of n=5<\/p>\n\n\n\n1 4 9 16 25 <\/p>\n\n\n\nsum of series=55<\/p>\n\n\n\nc)Write a program in C++ to show the concept of Encapsulation(class & object).<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nclass nips\n{\npublic:\nint a,b,c;\nvoid input();\nvoid process();\nvoid show();\n};\nvoid nips::input()\n{\na=10;\nb=5;\n}\nvoid nips::process()\n{\nc=a+b;\n}\nvoid nips::show()\n{\ncout<<\"Sum=\"<<c;\n}\n\n\nvoid main()\n{\nclrscr();\nnips n1;\nn1.input();\nn1.process();\nn1.show();\ngetch();\n}<\/code><\/pre>\n\n\n\nOutput<\/strong><\/p>\n\n\n\nSum=15<\/p>\n\n\n\nd) Write a program in C++ to swap the values of two integer variables using call by reference method.<\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid swap(int &,int &);\nvoid main() \n{\nclrscr();\nint a,b;\na=10;\nb=20;\ncout<<\u201dBefore swapping a=\u201d<<a<<\u201d\\tb=\u201d<<b;\nswap(a,b);\ncout<<\u201d\\nAfter swapping in main a=\u201d<<a<<\u201d\\tb=\u201d<<b;\ngetch();\n}\nvoid swap(int &x,int &y)\n{\nint z;\nz=x;\nx=y;\ny=z;\ncout<<\u201d\\n After swapping in function a=\u201d<<x<<\u201d\\tb=\u201d<<y;\n}\n<\/code><\/pre>\n\n\n\nOutput<\/strong><\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\nBefore swapping a=10 b=20<\/p>\n\n\n\nAfter swapping in function a= 20 b=10<\/p>\n\n\n\nAfter swapping in main a=20 b=10<\/p>\n<\/div><\/div>\n\n\n\n<\/p>\n\n\n\nGROUP- B<\/strong><\/p>\n\n\n\n2. Write SQL commands for  (a) to (e) on the basis of  SPORTS  relation given below:                                                                               1*5=5<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td> Student      No.<\/strong><\/td><td>Class<\/strong><\/td><td>Name<\/strong><\/td><td>Game<\/strong><\/td><td>Grade<\/strong><\/td><td>Sex<\/strong><\/td><\/tr><tr><td>10<\/strong><\/td><td>7<\/strong><\/td><td>Samir<\/strong><\/td><td>Cricket<\/strong><\/td><td>B<\/strong><\/td><td>M<\/strong><\/td><\/tr><tr><td>11<\/strong><\/td><td>8<\/strong><\/td><td>Sujit<\/strong><\/td><td>Tennis<\/strong><\/td><td>A<\/strong><\/td><td>M<\/strong><\/td><\/tr><tr><td>12<\/strong><\/td><td>7<\/strong><\/td><td>Kamal<\/strong><\/td><td>Swimming<\/strong><\/td><td>B<\/strong><\/td><td>M<\/strong><\/td><\/tr><tr><td>13<\/strong><\/td><td>7<\/strong><\/td><td>Vina<\/strong><\/td><td>Tennis<\/strong><\/td><td>C<\/strong><\/td><td>F<\/strong><\/td><\/tr><tr><td>14<\/strong><\/td><td>9<\/strong><\/td><td>Archana<\/strong><\/td><td>Basketball<\/strong><\/td><td>A<\/strong><\/td><td>F<\/strong><\/td><\/tr><tr><td>15<\/strong><\/td><td>10<\/strong><\/td><td>Arpita<\/strong><\/td><td>Cricket<\/strong><\/td><td>A<\/strong><\/td><td>F<\/strong><\/td><\/tr><tr><td>16<\/strong><\/td><td>9<\/strong><\/td><td>Alok<\/strong><\/td><td>Swimming<\/strong><\/td><td>C<\/strong><\/td><td>M<\/strong><\/td><\/tr><tr><td>17<\/strong><\/td><td>8<\/strong><\/td><td>Nitu<\/strong><\/td><td>Tennis<\/strong><\/td><td>A<\/strong><\/td><td>F<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n a) To display the names of students who have opted the game \u2018Cricket\u2019<\/p>\n\n\n\nSQL> SELECT Name From SPORTS where Game=’Cricket’;<\/strong><\/p>\n\n\n\nb) To display the details of all students in descending order of number of students.<\/p>\n\n\n\nSQL> SELECT * From SPORTS <\/strong> ORDER BY Student_No Desc’;<\/strong><\/p>\n\n\n\nc) To display the names of female students who got grade \u2018A\u2019.<\/p>\n\n\n\nSQL> SELECT Name From SPORTS where Grade=’A’ AND Sex=’F’;<\/strong><\/p>\n\n\n\nd) To display the number of students having game \u2018Tennis\u2019.<\/p>\n\n\n\nSQL> SELECT COUNT(*) From SPORTS where Game=’Tennis’;<\/strong><\/p>\n\n\n\ne) To display distinct game from \u2018Sports\u2019 relation.<\/p>\n\n\n\nSQL> SELECT DISTINCT Game From SPORTS’;<\/strong><\/p>\n\n\n\n<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience2021 |Computer Science 12 Set 2B Computer Science 11th 12th BCA||#ErAmrendra Mehta\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/JCUXMCwvA_I?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">Q. What do you understand by Object Oriented Approach?<\/h4>\n\n\n\nObject Oriented Approach is a way of computer Programming that allows modularization of a program by forming separate memory area for Data as well as function.<\/p>\n\n\n\n<ul class=\"wp-block-list\"><li>It works with Bottom up approach.<\/li><li>Program is divided in to classes and objects.<\/li><li>It is suitable for most business applications, Game development projects etc.<\/li><li>It allows Reusability of code using Inheritance.<\/li><li>It supports other features of OOP like Class, Object, Polymorphism, Encapsulation, Inheritance etc.<\/li><\/ul>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Q. Give the output of the following:<\/h4>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\nvoid main()\n{\nint i;\nfor(i=1;i<=10;i++)\n{\ncout<<10<<\u201dx\u201d<<i<<\u201d=\u201d<<i*5<<endl;\n}\n}\n<\/code><\/pre>\n\n\n\nOutput<\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n10 X 1=5<\/p>\n\n\n\n10 X 2=10<\/p>\n\n\n\n10 X 3=15<\/p>\n\n\n\n10 X 4=20<\/p>\n\n\n\n\u2026\u2026\u2026\u2026\u2026<\/p>\n\n\n\n\u2026\u2026\u2026\u2026\u2026<\/p>\n\n\n\n10 X 10=50<\/p>\n<\/div><\/div>\n\n\n\n<\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\nQ. Given the values of x, y and z, evaluate the following (Answer in true \/ false)<\/p>\n\n\n\n(x>=y)||(!(z==y)&&(z<x))<\/p>\n\n\n\n<ol class=\"wp-block-list\" type=\"a\"><li>x=10, y=5, z=1 (1 True)<\/li><li>x=9, y=10, z=2 (0 False)<\/li><\/ol>\n<\/div><\/div>\n\n\n\n<h4 class=\"wp-block-heading\">Q. Given the following family relation. Write SQL commands for the following.<\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>NO<\/td><td>NAME<\/td><td>FEMALE MEMBERS<\/td><td>MALE MEMBERS<\/td><td>INCOME<\/td><td>OCCUPATION  <\/td><\/tr><tr><td>1<\/td><td>MISHRA<\/td><td>3<\/td><td>2<\/td><td>10000<\/td><td>SERVICES<\/td><\/tr><tr><td>2<\/td><td>GUPTA<\/td><td>4<\/td><td>1<\/td><td>25000<\/td><td>BUSINESS<\/td><\/tr><tr><td>3<\/td><td>KHAN<\/td><td>6<\/td><td>3<\/td><td>15000<\/td><td>MIXED<\/td><\/tr><tr><td>4<\/td><td>YADAV<\/td><td>7<\/td><td>2<\/td><td>18000<\/td><td>MIXED<\/td><\/tr><tr><td>5<\/td><td>JOSHI<\/td><td>3<\/td><td>2<\/td><td>14000<\/td><td>SERVICES<\/td><\/tr><tr><td>6<\/td><td>MORYA<\/td><td>5<\/td><td>2<\/td><td>10000<\/td><td>SERVICES<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\na) To Select all the information of family whose occupation is services.<\/p>\n\n\n\n<\/p>\n\n\n\nb) To list the name of family where female are more than 3.<\/p>\n\n\n\n<\/p>\n\n\n\nc) To list all the name of family with income in ascending order.<\/p>\n\n\n\n d) To display the family name, male member and occupation of mixed family.<\/p>\n\n\n\ne) To count the number of family whose income is less than 15000.<\/p>\n\n\n\nf) To insert  a new records in the family table with the following data<\/p>\n\n\n\n\u201camit\u201d, 2, 1, 15000,\u201dServices\u201d<\/p>\n\n\n\n<\/p>\n\n\n\ng) Add a new field phno in the table family.<\/p>\n\n\n\n<\/p>\n\n\n\n<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Computer Science 12th 2021 | Viral Model Set Computer Science 12th 2021| VVI Questions 12th computer\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/kTLdBAvkC2k?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">Q. Differentiate between class and object.<\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>A class is a blueprint from which we can create the instance (objects).<\/td><td>An object is the instance of the class, which helps to use variables and methods from inside the class.<\/td><\/tr><tr><td>Class is a group of similar objects.<\/td><td>Object is a real world entity such as pen, chair, mobile, laptop etc.<\/td><\/tr><tr><td>Class does not exist physically, i.e., it exists logically.<\/td><td>Object has physical existence.  <\/td><\/tr><tr><td>Class does not allocate memory spaces when it is created.<\/td><td>Object allocates memory when it is created.<\/td><\/tr><tr><td>Class is declared only once.<\/td><td>Objects can be declared several times depending on the need.<\/td><\/tr><tr><td>class nips { private: \u2026\u2026. public: \u2026\u2026. protected: \u2026\u2026.. };<\/td><td>class nips { private: \u2026\u2026. public: \u2026\u2026. protected: \u2026\u2026.. }; void main() { nips n1;  \/\/ n1 is object }<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Q. How is an Entry controlled loop is different from Exit controlled loop?<\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Entry control loop<\/td><td>Exit control loop<\/td><\/tr><tr><td>Entry control loop checks the condition first then the body of the loop is executed.<\/td><td>Exit control loop first executes the body of the loop then checks the condition at last.<\/td><\/tr><tr><td>The body of the loop may or may not be executed at all.<\/td><td>The body of the loop will be executed at least once because condition is checked at last.<\/td><\/tr><tr><td>for,while are an example of entry control loop.<\/td><td>do-while loop is an example of exit control loop.<\/td><\/tr><tr><td>for(i=1;i<=5;i++) { cout<<\u201d\\nNIPS ACADEMY\u201d; }     i=1; while(i<=5) { cout<<\u201d\\nNIPS\u201d; i++; }  <\/td><td>i=1; do { cout<<\u201d\\nNIPS ACADEMY\u201d; i++; }while (i<=5);<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Q. Differentiate between DDL and DML.<\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>DDL<\/td><td>DML<\/td><\/tr><tr><td>It stands for Data Definition language which is used to define database structure or schema.<\/td><td>It stands for Data Manipulation Language which is used to manipulate data in database.<\/td><\/tr><tr><td>It basically defines the columns (Attributes) of the table.<\/td><td>It adds or updates the row of the table.<\/td><\/tr><tr><td>It does not use WHERE clause in its statement.<\/td><td>DML uses WHERE clause in its statement.<\/td><\/tr><tr><td>Ex:- CREATE, DROP, RENAME,ALTER etc.<\/td><td>Ex:- INSERT, UPDATE, DELETE, SELECT,MERGE etc.<\/td><\/tr><tr><td>Changes done by DDL command can\u2019t be rolled back.<\/td><td>Changes can be rolled back.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"12th Computer Science Model set 2021 | #JACComputerScience 2021 | Computer Science model set\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/4clolHB9Ah8?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h3 class=\"wp-block-heading\">Find Output<\/h3>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\n#include<math.h>\nvoid main()\n{\nclrscr();\nint r;\nfor(int i=2;i<5;i++)\n{\nr=pow(i,i);\ncout<<\"\\n\"<<i<<\"\\t\"<<r;\n}\n\ngetch();\n}<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\">Database Management System(DBMS)<\/strong><\/h3>\n\n\n\nCardinality:- the total number of tuples in a relation is called the cardinality of a relation.<\/p>\n\n\n\nDegree:- The total number of attribute in a relation is called  the degree of a relation.<\/p>\n\n\n\nDomain:- A domain is a set of possible values that are designed to each column of a table.<\/p>\n\n\n\nCardinality:- the total number of tuples in a relation is called the cardinality of a relation.<\/p>\n\n\n\nDegree:- The total number of attribute in a relation is called  the degree of a relation.<\/p>\n\n\n\nDomain:- A domain is a set of possible values that are designed to each column of a table.<\/p>\n\n\n\n<\/p>\n\n\n\n12th C++ Revision <\/strong><\/p>\n\n\n\n <\/strong>Q.Write a program to print your name five times using while loop.<\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid main() \n{\nclrscr();\nint i;\t\ni=1;\nwhile(i<=5)\n{\ncout<<\u201d\\n NIPS ACADEMY\u201d;\ni++;\n}\ngetch();\n}\n<\/code><\/pre>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 6\/10\/2020<\/strong><\/h4>\n\n\n\nQ1. Write a program to find 10% discount on input amount if amount is greater than 1000.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Day-7 C++ Conditional statement Practice | Computer Science 11th 12th BCA Best YouTube Channel\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/iQTTuNmU-yQ?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 5\/10\/2020<\/strong><\/h4>\n\n\n\nQ1. write a program to find sum of five numbers using constructor.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 4\/10\/2020<\/strong><\/h4>\n\n\n\nQ1. Write a program in C++ to check number is even or odd using conditional operator.<\/p>\n\n\n\nQ2.Write a program in C++ to check number is even or odd using simple if.<\/p>\n\n\n\nQ3.Write a program in C++ to check number is even or odd using if else.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Day-5 |Number is Even or Odd using conditional or Ternary operator |Simple if |if else |C++ Program\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/cr2LZQQCSig?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 3\/10\/2020<\/strong><\/h4>\n\n\n\nQ1. Write a program to find simple interest in C++.<\/p>\n\n\n\nQ2. Write a program to find compound interest in C++.<\/p>\n\n\n\nQ3. Write a program to find simple and compound interest in C++.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Day - 4 ComputerScience 12th 11th BCA | C++ Program for Simple and Compound interest Best concept\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/NYq6B5RJMFg?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 2\/10\/2020<\/strong><\/h4>\n\n\n\nQ1. Write a program to find area and perimeter of a Rectangle.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Day- 3 #ComputerScience 12th 11th BCA | C++ Programming Course with best Notes | C++ Best concept\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/fnKCyeF3jb0?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\nJAC 12th Computer Science #Test 1\/10\/2020<\/strong><\/p>\n\n\n\nQ1. Draw a logic circuit diagram for NAND to AND gate.<\/p>\n\n\n\nQ2. Draw a Logic circuit diagram for NAND to OR gate.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 30\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Define Truth Table?<\/p>\n\n\n\nQ2. Write Identity Law.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 29\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Define Literals.<\/p>\n\n\n\nQ2. Define Minterm.<\/p>\n\n\n\nQ3. Define Maxterm.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 28\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. How many gates would be required to implement the following Boolean expression after simplification? XY+X(X+Z)+Y(X+Z)<\/strong><\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 27\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Obtain a simplified form for the following Boolean Expression using Karnaugh Map: F(A,B,C,D)=\u2211 (0,1,2,4,5,6,8,9,10,12,13,14)<\/strong><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 26\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. State and verify the De Morgan\u2019s law in Boolean algebra using truth table .<\/strong><\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 25\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Obtain a simplified form for the following Boolean Expression using Karnaugh Map: F(A,B,C,D)=\u2211 (0,1,2,3,4,5,6,7,8,9,10,11)<\/strong><\/p>\n\n\n\n<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"JAC 12th Previous Year Important Questions|Objective Questions Computer Science 12th with Answer\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/B5Z4G76SV5Y?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 24\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Obtain a simplified form for the following Boolean Expression using Karnaugh Map: F(A,B,C,D)=\u2211 (0,2,5,7,8,1013,15)<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"How to solve Karnaugh Map four variable|K Map four variable Best trick|K Map Solution 12th JAC 2019\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/zEX95ipX0Oc?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 19\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. State and verify the De Morgan\u2019s law in Boolean algebra using truth table .<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience State and verify the De Morgan\u2019s law in Boolean algebra using truth table .\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/qCQgDFhTI5A?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 18\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. What is logic gate? Explain fundamental logic gates with circuit diagram and truth table.<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#Computer What is logic gate? Explain fundamental logic gates with circuit diagram and truth table.\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/crYJ_K_kSYQ?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 17\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Write Identity Law.<\/p>\n\n\n\nQ2. Write Inverse(Complementary Law)<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 16\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Prepare a truth table for XY+Y Z’+X ‘Z’<\/strong><\/p>\n\n\n\n<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience1th12th BCA| Boolean Algebra Truth table Previous Year Questions #ErAmrendra Mehta|\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/qioPPhSJ1Jc?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 15\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Prepare a truth table for XY+Y Z’+X ‘Z’<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience1th12th BCA| Boolean Algebra Truth table Previous Year Questions #ErAmrendra Mehta|\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/qioPPhSJ1Jc?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 14\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Prepare a truth table for XYZ+Y Z’+X’ Z’<\/strong><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 13\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Draw the circuit and truth table of X+X’ Y<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Truth Table and Circuit Diagram Boolean Algebra | Computer Science Solved Previous Paper 2020\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/-jA5kC_IcX4?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 12\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Prepare a truth table for ABC’+BC<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience 12th important Question Computer Science 2021 | Boolean Algerbra Previous Questions\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/aErKYbjShKw?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 11\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. For a given variable \u201ca=, initialized by 10, what is the difference between statements a++ and ++a? Explain briefly.<\/strong><\/p>\n\n\n\nAnswer:- <\/p>\n\n\n\nif we use a++(as Postfix) then original value of \u2018a\u2019 is returned first then, \u2018a\u2019 is incremented by 1.<\/strong><\/p>\n\n\n\nIf we use ++a(as Prefix) then the value of \u2018a\u2019 is incremented by 1 then, it returns the value.<\/strong><\/strong><\/p>\n\n\n\n<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"what is the difference between statements a++ and ++a? 12th vvi Important Questions C++ computer\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/2C_3md-8fIw?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 10\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Evaluate the following C++ expression s where a,b,c are integers and d,f are floating point numbers .The values are a=4,b=4 and d=1.5. a) c=a+++++b*++d<\/strong><\/p>\n\n\n\nb) f=++ b*b++ – ++a<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Computer Science Important Question 12th 11th|C++ Programming | Amrendra Sir NIPS ACADEMY Daltonganj\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/v9rObi7pE7Q?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 9\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Evaluate the following C++ expression s where a,b,c are integers and d,f are floating point numbers .The values are a=3,b=5 and d=1.5. a) c=a++ +b++d <\/strong><\/p>\n\n\n\nb)<\/em> f= b*b++ – ++a<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Increment Decrement | Prefix Postfix Important Questions| Computer Science Best YouTube Channel\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/KniqEX1iurQ?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 8\/09\/2020<\/strong><\/h4>\n\n\n\nQ1.Evaluate the following C++ expressions where a,b,c are integers and d,f are floating point numbers .The values are a=5,b=6 and d=3.5.<\/p>\n\n\n\na) c=a++ – (b ++) * (- -d)<\/strong> b) f=(++b) * b \u2013 a++<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"12th VVI Questions Computer Science 2021 | Best YouTube Channel for Computer Science 11th 12th BCA|\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/AIukmw2wxf4?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 7\/09\/2020<\/strong><\/h4>\n\n\n\nWrite a program to create a class RESORT <\/strong>in C++ with the following description: Private Members:<\/strong> Rno <\/strong> Room no.<\/p>\n\n\n\nName<\/strong> Customer name Charges<\/strong> Per day charges Days<\/strong> no. of days stay Compute<\/strong> A function to calculate and return amount as DaysCharges and if the value of Days<\/em>Charges is more than 11000 then as 1.02Days<\/em>Charges. Public Member:<\/strong> Getinfo ( )<\/strong> A function to enter the content rno, name, charges and days. Dispinfo ( )<\/strong> A function to display rno, name, charges, days and amount. (Amount to be displayed by calling function compute ( ) )<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"JAC 12th Computer Science Important C++ Program |Best YouTube Channel for Computer Science 12th 11\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/hIk9vjg8XwU?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 6\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. Compare and contrast between Bubble sort and Selection sort.<\/p>\n\n\n\nAns:- <a href=\"https:\/\/www.nipsacademy.com\/blogs\/sorting-algorithms-and-programs-in-c\/\">Sorting Algorithms and Programs in C++<\/a><\/em><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 5\/09\/2020<\/strong><\/h4>\n\n\n\nQ1. An electricity board charges according to following rates: For the First 100 units—— Rs 2 per unit<\/strong> For the Next 200 units—— Rs 3 per unit<\/strong><\/p>\n\n\n\nBeyond 300 units—— Rs 4 per unit.<\/strong> All users are charged meter charge also, which is Rs 50. Write a program in C++ to read the number of units consumed and print out the charges.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"C++ Electricity board Question | 12th JAC vvi important Questions 2021 | NIPS Amrendra ACADEMY\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/TdqBISDLRt4?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"30 Days 30 Videos for 11th 12th BCA| | JAC Computer Science 12th vvi Important | NIPSAmrendraACADEMY\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/XL0SjUt3aYw?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\nJAC 12th Computer Science #Test 4\/09\/2020<\/strong><\/p>\n\n\n\nQ1. Obtain postfix notation for the following infix notation manually:<\/p>\n\n\n\na) A+C-D*B<\/em><\/strong> <\/em><\/p>\n\n\n\nb) <\/em>(A+B)*C+D\/E-F<\/strong><\/p>\n\n\n\n<h5 class=\"wp-block-heading\">JAC 12th Computer Science #Test 3\/09\/2020<\/strong><\/h5>\n\n\n\nQ1. Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation: 120, 45, 20, +, 25, 15,-, +,*<\/p>\n\n\n\n<h5 class=\"wp-block-heading\">JAC 12th Computer Science #Test 2\/09\/2020<\/strong><\/h5>\n\n\n\nQ1, What data types would you use to represent the following items? i) The average marks in a class ii) The number of students in the class iii) The registration letter of a car iv) The population of a city<\/p>\n\n\n\n<h5 class=\"wp-block-heading\">JAC 12th Computer Science #Test 1\/09\/2020<\/strong><\/h5>\n\n\n\nQ1. What data types would you use to represent the following items? i) The number of employees in a Department ii) The salary of an employee iii) The identification number of an employee iv)The registration number of a vehicle<\/p>\n\n\n\n<\/p>\n\n\n\n<h5 class=\"wp-block-heading\">JAC 12th Computer Science #Test 15 \/08\/2020<\/strong><\/h5>\n\n\n\nQ1.What is array in C++? Explain its types.[JAC 2020]<\/p>\n\n\n\nQ2.Define Single inheritance and explain with suitable example. [JAC2020]<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 14 \/08\/2020<\/strong><\/h4>\n\n\n\nQ1.What is Inheritance?<\/p>\n\n\n\nQ2.Define Data type. Explain different types of data type with example<\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 13 \/08\/2020<\/strong><\/h4>\n\n\n\nQ1.Write the difference between Unary operator and Ternary operator. [JAC 2020]<\/p>\n\n\n\nQ2. ) Give the output of the following:<\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n void main( )\n{\nint x;\nfor(x=1;x<=12;x*=2)\ncout<<x<<endl;\n}\n<\/code><\/pre>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 12 \/08\/2020<\/strong><\/h4>\n\n\n\nQ1. What is Token? What are the names of different types of Token?[JAC 2020]<\/p>\n\n\n\nQ2. Write the difference between Data and Information.[JAC 2020]<\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 11 \/08\/2020<\/strong><\/h4>\n\n\n\nQ1. Write a program in C++ to find the sum of any five odd numbers<\/strong>.<\/p>\n\n\n\nQ2. Write a program in C++ to find the product of any five numbers using constructor member<\/strong> functions.<\/p>\n\n\n\nJAC 12th Computer Science #Test 10 \/08\/2020<\/strong><\/p>\n\n\n\nTrue and False Questions<\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\"><li>Push and Pop term are related to stack data structure. T<\/em><\/strong><\/li><li>Enqueue and Dequeue are terms related to queue data structure. T<\/em><\/strong><\/li><li>The postfix conversion of a infix expression and recursion are internally implemented through stack. T<\/em><\/strong><\/li><li>The circular queue better utilises the space in a fixed size queue. T<\/em><\/strong><\/li><li>Pushing in a full fixed size stack results into an error.T<\/em><\/strong><\/li><li>Popping from an empty stack results into an error. T<\/em><\/strong><\/li><li>Inserting in a full fixed size queue results into an error. T<\/em><\/strong><\/li><li>Deleting from an empty queue results into an error. T<\/em><\/strong><\/li><li>For reversing the order of a list of values , queues are internally used.F<\/em><\/strong><\/li><li>Like circular and double -ended queues , implementation formats of stacks may also be varied. F<\/em><\/strong><\/li><\/ol>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 09 \/08\/2020<\/strong><\/h4>\n\n\n\nQ1. Obtain postfix notation for the following infix notation manually:<\/p>\n\n\n\n          <\/strong>a)  A+C-D*B<\/strong><\/p>\n\n\n\nAnswer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Symbol<\/strong><\/td><td>  Stack<\/strong><\/td><td>Expression<\/strong><\/td><\/tr><tr><td>A<\/strong><\/td><td> <\/strong><\/td><td>A<\/strong><\/td><\/tr><tr><td>+<\/strong><\/td><td>+<\/strong><\/td><td>A<\/strong><\/td><\/tr><tr><td>C<\/strong><\/td><td> <\/strong><\/td><td>AC+<\/strong><\/td><\/tr><tr><td>–<\/strong><\/td><td>–<\/strong><\/td><td>AC+<\/strong><\/strong><\/td><\/tr><tr><td>D<\/strong><\/td><td> <\/strong><\/td><td>AC+D-<\/strong><\/strong><\/td><\/tr><tr><td>*<\/strong><\/td><td>*<\/strong><\/td><td>AC+D-<\/strong><\/strong><\/td><\/tr><tr><td>B<\/strong><\/td><td> <\/strong><\/td><td>AC+D-B*<\/strong><\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nPostfix= AC+D-B*<\/strong><\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\nCheck       AC+D-B*<\/strong><\/p>\n\n\n\n                  A+C D-B*<\/strong><\/p>\n\n\n\n                A+C-D B*<\/strong><\/p>\n\n\n\n                A+C-D*B                <\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"How to convert Infix to Postfix | Data Structure class 12th vvi Questions ||# ErAmrendraMehta\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/SLDspEdXMYs?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n<\/div><\/div>\n\n\n\n        <\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Best Trick for Infix to Postfix Coversion Class 12 important Question| #ErAmrendraMehta | CMS12th\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/tOzyTvUTeV4?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n  <\/strong>b)  (A+B)*C+D\/E-F<\/strong><\/p>\n\n\n\nAnswer<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Symbol<\/strong><\/td><td>Stack<\/strong><\/td><td>Expression<\/strong><\/td><\/tr><tr><td>(<\/strong><\/td><td>(<\/strong><\/td><td> <\/strong><\/td><\/tr><tr><td>A<\/strong><\/td><td>(<\/strong><\/td><td>A<\/strong><\/td><\/tr><tr><td>+<\/strong><\/td><td>(+<\/strong><\/td><td>A<\/strong><\/td><\/tr><tr><td>B<\/strong><\/td><td>(+<\/strong><\/td><td>A B<\/strong><\/td><\/tr><tr><td>)<\/strong><\/td><td> <\/strong><\/td><td>AB+<\/strong><\/td><\/tr><tr><td>*<\/strong><\/td><td>*<\/strong><\/td><td>AB+<\/strong><\/td><\/tr><tr><td>C<\/strong><\/td><td> <\/strong><\/td><td>AB+C*<\/strong><\/td><\/tr><tr><td>+<\/strong><\/td><td>+<\/strong><\/td><td>AB+C*<\/strong><\/td><\/tr><tr><td>D<\/strong><\/td><td> <\/strong><\/td><td>AB+C*D+<\/strong><\/td><\/tr><tr><td>\/<\/strong><\/td><td>\/<\/strong><\/td><td>AB+C*D+<\/strong><\/td><\/tr><tr><td>E<\/strong><\/td><td> <\/strong><\/td><td>AB+C*D+E\/<\/strong><\/td><\/tr><tr><td>–<\/strong><\/td><td>–<\/strong><\/td><td>AB+C*D+E\/<\/strong><\/td><\/tr><tr><td>F<\/strong><\/td><td> <\/strong><\/td><td>AB+C*D+E\/F-<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nPostfix:  AB+C*D+E\/F-<\/strong><\/p>\n\n\n\nCheck:  <\/strong><\/p>\n\n\n\nAB+C*D+E\/F-<\/strong><\/p>\n\n\n\nA+B<\/strong> C*D+E\/F-<\/strong><\/p>\n\n\n\nA+B*C<\/strong> D+E\/F-<\/strong><\/p>\n\n\n\nA+B*C+D<\/strong> E\/F-<\/strong><\/p>\n\n\n\nA+B*C+D\/E<\/strong> F-<\/strong><\/p>\n\n\n\nA+B*C+D\/E-F<\/strong><\/strong><\/p>\n\n\n\nQ2. Transform each of the following expressions to prefix and postfix<\/strong> form:<\/p>\n\n\n\n          <\/strong>a)  (A-B*(C+D))\/E*F<\/strong><\/p>\n\n\n\nAnswer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Symbol<\/strong><\/td><td>Stack<\/strong><\/td><td>Expression<\/strong><\/td><\/tr><tr><td>(<\/strong><\/td><td>(<\/strong><\/td><td> <\/strong><\/td><\/tr><tr><td>A<\/strong><\/td><td>(<\/strong><\/td><td>A<\/strong><\/td><\/tr><tr><td>–<\/strong><\/td><td>(-<\/strong><\/td><td>A<\/strong><\/td><\/tr><tr><td>B<\/strong><\/td><td>(-<\/strong><\/td><td>A   B<\/strong><\/td><\/tr><tr><td>*<\/strong><\/td><td>(-*<\/strong><\/td><td>A  B<\/strong><\/td><\/tr><tr><td>(<\/strong><\/td><td>(-*(<\/strong><\/td><td>A  B<\/strong><\/td><\/tr><tr><td>C<\/strong><\/td><td>(-*(<\/strong><\/td><td>A  B  C<\/strong><\/td><\/tr><tr><td>+<\/strong><\/td><td>(-*(+<\/strong><\/td><td>A  B  C<\/strong><\/td><\/tr><tr><td>D<\/strong><\/td><td>(-*(+<\/strong><\/td><td>A  B  C  D<\/strong><\/td><\/tr><tr><td>)<\/strong><\/td><td>(-*(+)<\/strong><\/td><td>A  B  CD+<\/strong><\/td><\/tr><tr><td>)<\/strong><\/td><td>(-*)<\/strong><\/td><td>ABCD+*-<\/strong><\/td><\/tr><tr><td>\/<\/strong><\/td><td>\/<\/strong><\/td><td>ABCD+*-<\/strong><\/td><\/tr><tr><td>E<\/strong><\/td><td> <\/strong><\/td><td>ABCD+*- E\/<\/strong><\/td><\/tr><tr><td>*<\/strong><\/td><td>*<\/strong><\/td><td>ABCD+*- E\/<\/strong><\/td><\/tr><tr><td>F<\/strong><\/td><td> <\/strong><\/td><td>ABCD+*- E\/F*<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nPostfix: ABCD+*- E\/F*<\/strong><\/p>\n\n\n\nCheck<\/strong><\/p>\n\n\n\nABCD+*- E\/F*<\/strong><\/p>\n\n\n\nABC+D*-E\/F*<\/strong><\/p>\n\n\n\nAB*C+D-E\/F*<\/strong><\/p>\n\n\n\nA-B*C+D<\/strong> E\/F*<\/strong><\/p>\n\n\n\nA-B*C+D\/E<\/strong> F*<\/strong><\/p>\n\n\n\nA-B*C+D\/E*F<\/strong><\/strong><\/p>\n\n\n\n          <\/strong>b)  (A+B)-C*D<\/strong><\/p>\n\n\n\nAnswer:<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Symbol<\/strong><\/td><td>Stack<\/strong><\/td><td>Expression<\/strong><\/td><\/tr><tr><td>(<\/strong><\/td><td>(<\/strong><\/td><td> <\/strong><\/td><\/tr><tr><td>A<\/strong><\/td><td>(<\/strong><\/td><td>A<\/strong><\/td><\/tr><tr><td>+<\/strong><\/td><td>(+<\/strong><\/td><td>A<\/strong><\/td><\/tr><tr><td>B<\/strong><\/td><td>(+<\/strong><\/td><td>A   B<\/strong><\/td><\/tr><tr><td>)<\/strong><\/td><td> <\/strong><\/td><td>AB+<\/strong><\/td><\/tr><tr><td>–<\/strong><\/td><td>–<\/strong><\/td><td>AB+<\/strong><\/td><\/tr><tr><td>C<\/strong><\/td><td> <\/strong><\/td><td>AB+ C-<\/strong><\/td><\/tr><tr><td>*<\/strong><\/td><td>*<\/strong><\/td><td>AB+C-<\/strong><\/td><\/tr><tr><td>D<\/strong><\/td><td> <\/strong><\/td><td>AB+C-D*<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nPostfix:  <\/strong>AB+C-D*<\/strong><\/p>\n\n\n\nCheck<\/strong><\/p>\n\n\n\nAB+C-D*<\/strong><\/p>\n\n\n\nA+B<\/strong> C \u2013 D *<\/strong><\/p>\n\n\n\nA+B-C<\/strong> D*<\/strong><\/p>\n\n\n\nA+B-C*D<\/strong><\/strong><\/p>\n\n\n\n <\/p>\n\n\n\nQ3. Transform each of the following expressions to infix form:<\/p>\n\n\n\n          <\/strong>a)  <\/strong>+ * ABC<\/strong><\/p>\n\n\n\n          <\/strong>b)  <\/strong>–<\/strong> +\/AC^D\/EFG<\/strong><\/p>\n\n\n\nQ4.Transform each of the following expressions to infix form:<\/p>\n\n\n\n <\/strong>a)  + – ABC<\/strong><\/p>\n\n\n\n <\/strong>b)  +A-BC<\/strong><\/p>\n\n\n\nc)  +-\/AC*D^EFG<\/strong><\/p>\n\n\n\nQ5. Transform each of the following expressions to infix form:<\/p>\n\n\n\n <\/strong>a)  + – ABC<\/strong><\/p>\n\n\n\n <\/strong>b)  +A-BC<\/strong><\/p>\n\n\n\nc)  <\/strong>+-\/<\/strong>AC*D^EFG<\/strong><\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 08 \/08\/2020<\/h4>\n\n\n\nObjective Type Questions:<\/strong><\/p>\n\n\n\n1.Data structure stack is also known as \u2026\u2026\u2026\u2026list<\/strong>.<\/p>\n\n\n\n(i) First In First Out<\/p>\n\n\n\n(ii) First In Last Out<\/p>\n\n\n\n(iii) Last In First Out<\/em><\/strong><\/p>\n\n\n\n(iv) All of these<\/p>\n\n\n\n2. Data Structure Queue is also known as \u2026\u2026\u2026.list<\/strong>.<\/p>\n\n\n\n(i) First In First Out<\/em><\/strong><\/p>\n\n\n\n(ii) First In Last Out<\/p>\n\n\n\n(iii) Last In First Out<\/p>\n\n\n\n(iv) All of these<\/p>\n\n\n\n3.In a Stack, all insertions take place at\u2026\u2026\u2026.end(s)<\/strong>.<\/p>\n\n\n\n (i) Top<\/em><\/strong><\/p>\n\n\n\n(ii) Front<\/p>\n\n\n\n(iii) Rear<\/p>\n\n\n\n(iv) Any<\/p>\n\n\n\n4.In a Queue, all insertions take place at\u2026\u2026\u2026.end(s)<\/strong>.<\/p>\n\n\n\n (i) Front<\/p>\n\n\n\n(ii) Top<\/p>\n\n\n\n(iii) Rear<\/em><\/strong><\/p>\n\n\n\n(iv) Any<\/p>\n\n\n\n5.In a Queue, deletions take place at\u2026\u2026\u2026.end(s)<\/strong>.<\/p>\n\n\n\n (i) Front<\/em><\/strong><\/p>\n\n\n\n(ii) Top<\/p>\n\n\n\n(iii) Rear<\/p>\n\n\n\n(iv) Any<\/p>\n\n\n\n6.In a Stack, deletions take place at\u2026\u2026\u2026.end<\/strong>.<\/p>\n\n\n\n (i) Front<\/p>\n\n\n\n(ii) Top<\/em><\/strong><\/p>\n\n\n\n(iii) Rear<\/p>\n\n\n\n(iv) Any<\/p>\n\n\n\n7.The term Push and Pop are related to<\/strong><\/p>\n\n\n\n (i)Queue<\/p>\n\n\n\n (ii)Stack<\/em><\/strong><\/p>\n\n\n\n (iii)Both<\/p>\n\n\n\n (iv)None<\/p>\n\n\n\n8.Choose correct output for the following sequence of operations(* signifies top)<\/strong><\/p>\n\n\n\nPust(5),Pust(8),Pop,Pust(2),Pust(5),Pop,Pust(1),<\/p>\n\n\n\n (i)8 5 2 5 1<\/em><\/strong><\/p>\n\n\n\n (ii)8 5 52 1<\/em><\/strong><\/p>\n\n\n\n (iii)2 5 51<\/em><\/strong><\/p>\n\n\n\n (iv)5 2 1<\/strong><\/p>\n\n\n\n9.In which data structure element is inserted at one end called Rear and deleted at other end called Front.<\/strong><\/p>\n\n\n\n (i)Stack<\/p>\n\n\n\n (ii)Queue<\/em><\/strong><\/p>\n\n\n\n (iii)Both<\/p>\n\n\n\n (iv)Tree<\/p>\n\n\n\n10.Insertion and Deletion operations in queue are known as ……………<\/strong><\/p>\n\n\n\n (i)Push and Pop<\/p>\n\n\n\n (ii)Enqueue and Dequeue<\/em><\/strong><\/p>\n\n\n\n (iii)Insert and Delete <\/p>\n\n\n\n (iv)None<\/p>\n\n\n\n11.…………Form the access is used to add and remove nodes from a queue.<\/strong><\/p>\n\n\n\n (i)LIFO, Last In First Out<\/p>\n\n\n\n (ii)FIFO, First In First Out<\/em><\/strong><\/p>\n\n\n\n (iii)Both (a) and (b)<\/p>\n\n\n\n (iv)None of these<\/p>\n\n\n\n12.…………form of access is used to add\/remove nodes from a stack.<\/strong><\/p>\n\n\n\n (i)LIFO<\/em><\/strong><\/p>\n\n\n\n (ii)FIFO<\/p>\n\n\n\n (iii)Both (a) and (b)<\/p>\n\n\n\n (iv)None of these<\/p>\n\n\n\n13.Stack follows the strategy of ………………<\/strong><\/p>\n\n\n\n (i)LIFO<\/em><\/strong><\/p>\n\n\n\n (ii)FIFO<\/p>\n\n\n\n (iii)LRU<\/p>\n\n\n\n (iv)Random<\/p>\n\n\n\n14.Which of the following is an application of stack?<\/strong><\/p>\n\n\n\n (i)Finding Factorial <\/p>\n\n\n\n (ii)Reversing of a a string<\/p>\n\n\n\n (iii) Infix to Postfix<\/p>\n\n\n\n(iv)All of the above<\/em><\/strong><\/p>\n\n\n\n15.When a stack, implemented as an array\/list of fixed size, is full and no new element can be accommodated, it is called an…………….<\/strong><\/p>\n\n\n\n (i)OVERFLOW<\/em><\/strong><\/p>\n\n\n\n (ii)UNDERFLOW<\/p>\n\n\n\n (iii) EXTRANFLOW<\/p>\n\n\n\n(iv)NOFLOW<\/p>\n\n\n\n16.When a stack is empty and an element’s deletion is tried from the stack , it is called an…………….<\/strong><\/p>\n\n\n\n (i)OVERFLOW<\/p>\n\n\n\n (ii)UNDERFLOW<\/em><\/strong><\/p>\n\n\n\n (iii) EXTRANFLOW<\/p>\n\n\n\n(iv)NOFLOW<\/p>\n\n\n\n17.If a user tries to remove an element from empty queue, it is called an…………….<\/strong><\/p>\n\n\n\n (i)Underflow<\/em><\/strong><\/p>\n\n\n\n (ii)Empty collection<\/p>\n\n\n\n (iii)Overflow<\/p>\n\n\n\n(iv)Garbage Collection<\/p>\n\n\n\n18.Pushing an element into stack already having five elements and stack has fixed size of 5 , then …………….occurs.<\/strong><\/p>\n\n\n\n (i)Overflow<\/em><\/strong><\/p>\n\n\n\n (ii)Cash<\/p>\n\n\n\n(iii)Underflow <\/p>\n\n\n\n(iv)User flow<\/p>\n\n\n\n19.What is the term for inserting into a full queue known as ?<\/strong><\/p>\n\n\n\n (i)Overflow<\/em><\/strong><\/p>\n\n\n\n (ii)Cash<\/p>\n\n\n\n(iii)null pointer exception<\/p>\n\n\n\n(iv)program won’t be compiled<\/p>\n\n\n\n20.A queue in which elements get added in empty area in the front of a queue is called…………..<\/strong><\/p>\n\n\n\n (i)Full queue<\/p>\n\n\n\n (ii)Circular queue<\/em><\/strong><\/p>\n\n\n\n(iii)rounded queue<\/p>\n\n\n\n(iv)rotated queue<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Data Structure Important Objective Questions|Class 12th|Stack & Queue Objective | #ErAmrendraMehta |\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/qiYfi320RHY?start=19&feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h5 class=\"wp-block-heading\">JAC 12th Computer Science #Test 07 \/08\/2020<\/h5>\n\n\n\n Q1. Evaluate the following postfix expression using a stack and show the contents of  stack after execution  of each operation:<\/strong><\/p>\n\n\n\n          300, 10, 30, +, 20, *, +<\/strong><\/p>\n\n\n\nAnswer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Sl. No<\/strong><\/td><td>Stack<\/strong><\/td><td>Output<\/strong><\/td><\/tr><tr><td>1<\/strong><\/td><td>300<\/strong><\/td><td>300<\/strong><\/td><\/tr><tr><td>2<\/strong><\/td><td>10<\/strong><\/td><td>300,10<\/strong><\/td><\/tr><tr><td>3<\/strong><\/td><td>30<\/strong><\/td><td>300,10,30<\/strong><\/td><\/tr><tr><td>4<\/strong><\/td><td>+<\/strong><\/td><td>300,40<\/strong><\/td><\/tr><tr><td>5<\/strong><\/td><td>20<\/strong><\/td><td>300,40,20<\/strong><\/td><\/tr><tr><td>6<\/strong><\/td><td>*<\/strong><\/td><td>300,800<\/strong><\/td><\/tr><tr><td>7<\/strong><\/td><td>+<\/strong><\/td><td>1100<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nOutput= 1100<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"JAC 12th Computer Science VVI important Questions l VVI Questions Computer |ErAmrendraMehta | 12th\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/yGTay8YuSuo?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\nQ2. Evaluate the following postfix expression using a stack and show the contents of  stack after execution  of each operation:<\/p>\n\n\n\n          500, 20, 30, 10, *, +<\/strong><\/p>\n\n\n\nQ3. Evaluate the following postfix expression using a stack and show the contents of  stack after execution  of each operation:<\/p>\n\n\n\n          120, 45, 20, +, 25, 15,-, +,*<\/strong><\/p>\n\n\n\nAnswer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Sl. No<\/strong><\/td><td>Stack<\/strong><\/td><td>Output<\/strong><\/td><\/tr><tr><td>1<\/strong><\/td><td>120<\/strong><\/td><td>120<\/strong><\/td><\/tr><tr><td>2<\/strong><\/td><td>45<\/strong><\/td><td>120,45<\/strong><\/td><\/tr><tr><td>3<\/strong><\/td><td>20<\/strong><\/td><td>120,45,20<\/strong><\/td><\/tr><tr><td>4<\/strong><\/td><td>+<\/strong><\/td><td>120,65<\/strong><\/td><\/tr><tr><td>5<\/strong><\/td><td>25<\/strong><\/td><td>120,65,25<\/strong><\/td><\/tr><tr><td>6<\/strong><\/td><td>15<\/strong><\/td><td>120,65,25,15<\/strong><\/td><\/tr><tr><td>7<\/strong><\/td><td>–<\/strong><\/td><td>120,65,10<\/strong><\/td><\/tr><tr><td>8<\/strong><\/td><td>+<\/strong><\/td><td>120,75<\/strong><\/td><\/tr><tr><td>9<\/strong><\/td><td>*<\/strong><\/td><td>9000<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nOutput= 9000<\/strong><\/p>\n\n\n\nQ4. Evaluate the following postfix operation:AB + C * D \/      <\/strong> if    A=2,B=3,C=4 & D=5 <\/strong>using stack<\/p>\n\n\n\nAnswer:<\/strong><\/p>\n\n\n\n                A B + C * D \/<\/strong><\/p>\n\n\n\nGiven      2,3,+,4,*,5,\/<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Sl. No<\/strong><\/td><td>Stack<\/strong><\/td><td>Output<\/strong><\/td><\/tr><tr><td>1<\/strong><\/td><td>2<\/strong><\/td><td>2<\/strong><\/td><\/tr><tr><td>2<\/strong><\/td><td>3<\/strong><\/td><td>2,3<\/strong><\/td><\/tr><tr><td>3<\/strong><\/td><td>+<\/strong><\/td><td>5<\/strong><\/td><\/tr><tr><td>4<\/strong><\/td><td>4<\/strong><\/td><td>5,4<\/strong><\/td><\/tr><tr><td>5<\/strong><\/td><td>*<\/strong><\/td><td>20<\/strong><\/td><\/tr><tr><td>6<\/strong><\/td><td>5<\/strong><\/td><td>20,5<\/strong><\/td><\/tr><tr><td>7<\/strong><\/td><td>\/<\/strong><\/td><td>4<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n   Output=4<\/strong><\/p>\n\n\n\nQ5. Evaluate the following postfix expression using a stack and show the contents of  stack after execution  of each operation:<\/p>\n\n\n\n          120, 45, 20, +, 25, 15,-, +,*<\/strong><\/strong><\/p>\n\n\n\nAnswer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Sl. No<\/strong><\/td><td>Stack<\/strong><\/td><td>Output<\/strong><\/td><\/tr><tr><td>1<\/strong><\/td><td>120<\/strong><\/td><td>120<\/strong><\/td><\/tr><tr><td>2<\/strong><\/td><td>45<\/strong><\/td><td>120,45<\/strong><\/td><\/tr><tr><td>3<\/strong><\/td><td>20<\/strong><\/td><td>120,45,20<\/strong><\/td><\/tr><tr><td>4<\/strong><\/td><td>+<\/strong><\/td><td>120,65<\/strong><\/td><\/tr><tr><td>5<\/strong><\/td><td>25<\/strong><\/td><td>120,65,25<\/strong><\/td><\/tr><tr><td>6<\/strong><\/td><td>15<\/strong><\/td><td>120,65,25,15<\/strong><\/td><\/tr><tr><td>7<\/strong><\/td><td>–<\/strong><\/td><td>120,65,10<\/strong><\/td><\/tr><tr><td>8<\/strong><\/td><td>+<\/strong><\/td><td>120,75<\/strong><\/td><\/tr><tr><td>9<\/strong><\/td><td>*<\/strong><\/td><td>9000<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\nOutput= 9000<\/strong><\/p>\n\n\n\n<\/p>\n\n\n\n<h5 class=\"wp-block-heading\">What is the Difference Between Stack and Queue<\/strong><\/h5>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Stack<\/strong><\/td><td>Queue<\/strong><\/td><\/tr><tr><td>1. It is a collection of elements that follows Last In First Out (LIFO) order.<\/td><td>1.  <\/strong>It is a collection of elements that follows First In First Out (FIFO) order.<\/td><\/tr><tr><td>2. In Stack insertion and deletion is performed from same End called \u2018Top\u2019.<\/td><td>2. In Queue insertion and deletion is performed from different end called \u2018Rear\u2019 and \u2018Front\u2019.<\/td><\/tr><tr><td>3. Top is incremented by one when the new element is inserted and this term is known as PUSH.<\/td><td>3.  Rear is incremented by one when the new element is inserted and this term is known as Enqueue.<\/td><\/tr><tr><td>4. Top is Decremented by one when an element is deleted and this term is known as POP.<\/td><td>4.  Front is incremented by one when an element is deleted and this term is known as Dequeue.<\/td><\/tr><tr><td>5. A collection of dinner plates at a wedding Party is an example of stack.<\/td><td>5.People standing for boarding a bus is an example of Queue.<\/td><\/tr><tr><td> Diagram….<\/td><td> <\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"C++ Program to Represent Stack as an Array | Implementation of stack using Array in C++|Stack in C++\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/pT9wL9bv5SQ?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2022\/08\/07\/hello-world\/\">12th Computer Science Important Program<\/a><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">C++ Programming <\/h4>\n\n\n\n<\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/c-programming-language-tutorial\/\">C++ Programming Language Tutorial<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/translators-in-programming-languages\/\">Translators in Programming languages<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/tokens-in-c-programming-language\/\">Tokens in C++ Programming Language<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/operators-in-c-programming-language\/\">Operators in C++ Programming Language<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/conditional-statements-in-c-language\/\">Conditional statements in C++ Language<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/switch-statement-in-c-language\/\">Switch Statement in C++ Language<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/loops-iteration-statement-in-c-language\/\">Loops \/ Iteration statement in C++ Language<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/jump-statements-in-c-with-best-example\/\">Jump statements in C++ with best example<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/arrays-in-c-programming-language\/\">Arrays in C++ Programming Language<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/functions-in-c-programming-language-2\/\">Functions in C++ Programming Language<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/passing-arguments-in-functions\/\">Passing Arguments in Functions<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/method-function-overloading-in-c\/\">Method \/ Function overloading in C++<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/23\/string-functions-in-c-with-example\/\">String Functions in C++ with Example<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/10\/character-handling-functions-in-c-with-example\/\">Character Handling Functions in C++ with Example<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/12\/how-to-create-own-header-file-in-c-with-example\/\">How to create own Header File in C++ with example<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/12\/console-input-output-in-c-with-example\/\">Console Input Output in C++ with Example<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/12\/class-and-object-in-c-programming-best-concept\/\">Class and Object in C++ Programming Best concept<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/concept-of-object-oriented-programming-in-c\/\">Concept of Object Oriented Programming in C++<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/c-development-environment-setup-with-vs-code\/\">C++ Development Environment Setup with VS Code<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/constructor-and-destructor-in-c-with-example\/\">Constructor and Destructor in C++ with Example<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/inheritance-in-c-with-example-program\/\">Inheritance in C++ with Example Program<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/friend-function-and-friend-class-in-c-with-example\/\">Friend Function and Friend Class in C++ with example<\/a><\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Data Structure <\/h4>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/data-structure-class-12th-computer-science-best-concept\/\">Data Structure class 12th Computer Science Best Concept<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/stack-data-structure-in-cintroduction-algorithm-program\/\">Stack Data structure in C++(Introduction, Algorithm, Program)<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/queue-data-structure-in-c-best-example\/\">Queue Data structure in C++ Best example<\/a><\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Boolean Algebra<\/h4>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/introduction-to-boolean-algebra-best-concepts\/\">Introduction to Boolean Algebra- Best concepts<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/important-law-of-boolean-algebra-with-best-concepts\/\">Important Law of Boolean algebra with Best concepts<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/logic-gates-and-their-types-best-concept\/\">Logic Gates and their types -Best Concept<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/de-morgrans-law-and-their-applications\/\">De Morgan\u2019s Law and their Applications<\/a><\/p>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/applications-of-boolean-algebra-in-computer-science\/\">Applications of Boolean Algebra in Computer Science<\/a><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">DBMS<\/h4>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/introduction-to-dbms-database-management-system\/\">Introduction to DBMS | Database Management System<\/a><\/p>\n\n\n\n<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Communication and Network Concept<\/h4>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/introduction-to-communication-and-networks\/\">Introduction to Communication and Networks<\/a><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">11th Computer Science<\/h4>\n\n\n\n<a href=\"https:\/\/aipsacademy.com\/blogs\/2022\/08\/21\/c-basic-program-for-11th-computer-science\/\">C++ Basic Program for 11th Computer Science<\/a><\/p>\n\n\n\nTo be continued… Please check daily for more updates..<\/p>\n","protected":false},"excerpt":{"rendered":"In this , I am going to provide and practice JAC 12th Computer Science vvi important Questions 2023. It will will be very helpful to all those students who are going to appear JAC examination 2023. Lets begin. COMPUTER SCIENCE XII 2023 Choose the correct alternative for the following:                       2*35=70 C++ is a\/an \u2026\u2026\u2026\u2026Language. […]<\/p>\n","protected":false},"author":1,"featured_media":274,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,9,8],"tags":[],"class_list":["post-272","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-12th-computer-science","category-cbse-12th-computer-science","category-jac-12th-computer-science"],"_links":{"self":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/272","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/comments?post=272"}],"version-history":[{"count":60,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/272\/revisions"}],"predecessor-version":[{"id":561,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/272\/revisions\/561"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media\/274"}],"wp:attachment":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media?parent=272"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/categories?post=272"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/tags?post=272"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

No.<\/strong><\/td>	Name<\/strong><\/td>	Female Members<\/strong><\/td>	Male Members<\/strong><\/td>	Income (Rs.)<\/strong><\/td>	Occupation<\/strong><\/td><\/tr>
1<\/strong><\/td>	Mishra<\/strong><\/td>	3<\/strong><\/td>	2<\/strong><\/td>	7,000<\/strong><\/td>	Service<\/strong><\/td><\/tr>
2<\/strong><\/td>	Gupta<\/strong><\/td>	4<\/strong><\/td>	1<\/strong><\/td>	50,000<\/strong><\/td>	Business<\/strong><\/td><\/tr>
3<\/strong><\/td>	Khan<\/strong><\/td>	6<\/strong><\/td>	3<\/strong><\/td>	8,000<\/strong><\/td>	Mixed<\/strong><\/td><\/tr>
4<\/strong><\/td>	Chadda<\/strong><\/td>	2<\/strong><\/td>	2<\/strong><\/td>	25,000<\/strong><\/td>	Business<\/strong><\/td><\/tr>
5<\/strong><\/td>	Yadav<\/strong><\/td>	7<\/strong><\/td>	2<\/strong><\/td>	20,000<\/strong><\/td>	Mixed<\/strong><\/td><\/tr>
6<\/strong><\/td>	Joshi<\/strong><\/td>	3<\/strong><\/td>	2<\/strong><\/td>	14,000<\/strong><\/td>	Service<\/strong><\/td><\/tr>
7<\/strong><\/td>	Maurya<\/strong><\/td>	6<\/strong><\/td>	3<\/strong><\/td>	5,000<\/strong><\/td>	Farming<\/strong><\/td><\/tr>
8<\/strong><\/td>	Rao<\/strong><\/td>	5<\/strong><\/td>	2<\/strong><\/td>	10,000<\/strong><\/td>	Service<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n a) To select all the information of family whose occupation is service .<\/p>\n\n\n\n *SQL> SELECT From FAMILY where Occupation=’Service’;<\/strong><\/p>\n\n\n\n b) To list the names of family, where female members are more than 3.<\/p>\n\n\n\n SQL> SELECT Name From FAMILY <\/strong>Where Female Members >3;<\/strong><\/p>\n\n\n\n c) To list the names of family with income in ascending order.<\/p>\n\n\n\n SQL> SELECT Name From FAMILY ORDER BY Income;<\/strong><\/p>\n\n\n\n d) To list family\u2019s name, number of male members and their business of business family.<\/p>\n\n\n\n SQL> SELECT COUNT() From SPORTS where Game=’Tennis’;<\/strong><\/p>\n\n\n\n* e) To count the number of family, whose income is less than Rs. 10,000.<\/p>\n\n\n\n SQL> SELECT DISTINCT Game From SPORTS’;<\/strong><\/p>\n\n\n\n <\/p>\n\n\n\n GROUP- C<\/strong><\/p>\n\n\n\n 3)Practical File 5<\/p>\n\n\n\n 4)Project Work 5<\/p>\n\n\n\n 5)Viva-voce 5<\/p>\n\n\n\n <\/p>\n\n\n\n <\/p>\n\n\n\n <\/p>\n\n\n\n \n<\/iframe>\n<\/div><\/figure>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #2021<\/strong><\/h3>\n\n\n\n<h4 class=\"wp-block-heading\"><strong> COMPUTER SCIENCE XII<\/strong> 2<strong><u>021<\/u><\/strong><\/h4>\n\n\n\n<p>Choose the correct alternative for the following:                       235=70<strong><\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\" type=\"1\"><li>C++ is developed by<\/li><\/ol>\n\n\n\n<p>(1) Dennis Ritchie                                                              (2) Ken Thompson<\/p>\n\n\n\n<p>(3) Martin Richard                                                             (4) <strong>B jarne Stroustru<\/strong><\/p>\n\n\n\n<p>2. The smallest individual unit in a program is called<\/p>\n\n\n\n<p>(1) <strong>Token   <\/strong>                                                                       (2) Keyword<\/p>\n\n\n\n<p>(3) Operator                                                                       (4) None of these<\/p>\n\n\n\n<p>3. \u201cReema\u201d is an example of<\/p>\n\n\n\n<p>(1) Integer literal                                                               (2) Character literal<\/p>\n\n\n\n<p>(3) <strong>String literal<\/strong>                                                                 (4) None of these<\/p>\n\n\n\n<p>4. Relational operators are<\/p>\n\n\n\n<p>(1) +,-,,\/,%                                                                       (2) &&,\|\|,!<\/p>\n\n\n\n<p>(3) ?  :                                                                                (4) <strong>>,<,>=,<=,==,!=<\/strong><\/p>\n\n\n\n<p>5.Every C++ program must contain a \u2026\u2026\u2026\u2026\u2026\u2026function.<\/p>\n\n\n\n<p>(1) <strong>main( )<\/strong>                                                                         (2) strlen( )<\/p>\n\n\n\n<p>(3) getch( )                                                                       (4) none of these<\/p>\n\n\n\n<p>6.Char ,int , float , double and void are<\/p>\n\n\n\n<p>(1) User defined data type                                          (2) Fundamental data type<\/p>\n\n\n\n<p>(3) Derived data type                                                         (4) None of thes<\/p>\n\n\n\n<p>7.x=++y +2y evaluates to (if y=6)<\/p>\n\n\n\n<p>(1) 18                                                                                 (2) 21<\/p>\n\n\n\n<p>(3) 20                                                                                (4) None of these<\/p>\n\n\n\n<p>8. While loop checks condition on<\/p>\n\n\n\n<p>(1) Top                                                                              (2) Bottom<\/p>\n\n\n\n<p>(3) Left                                                                              (4) None of these<\/p>\n\n\n\n<p>9.Jump statement(s) is \/ are<\/p>\n\n\n\n<p>(1) go to                                                                            (2) continue<\/p>\n\n\n\n<p>(3) break                                                                            (4) All of these<\/p>\n\n\n\n<p>10. In C++, array index always starts from<\/p>\n\n\n\n<p>(1) 0                                                                                  (2) 1<\/p>\n\n\n\n<p>(3) 2                                                                                  (4) 3<\/p>\n\n\n\n<p>11. In C++ programming strcat( ) function is used for<\/p>\n\n\n\n<p>(1) count length of a string                                          (2) Converting string to character<\/p>\n\n\n\n<p>(3) comparing two strings                                                  (4) concatenating two strings<\/p>\n\n\n\n<p>12. Which of the following is not a feature of C++ ?<\/p>\n\n\n\n<p>(1) Polymorphism                                                              (2) Inheritance<\/p>\n\n\n\n<p>(3) Abstraction                                                                  (4) Reflection<\/p>\n\n\n\n<p>13.Object Oriented Programming follows<\/p>\n\n\n\n<p>(1) Top Down approach                                                    (2) Bottom up approach<\/p>\n\n\n\n<p>(3) Left-Right approach                                                     (4) Right \u2013Left approach<\/p>\n\n\n\n<p>14. Wrapping up of data and functions into a single unit is called<\/p>\n\n\n\n<p>(1) Inheritance                                                                   (2) Polymorphism<\/p>\n\n\n\n<p>(3) Encapsulation                                                               (4) None of these<\/p>\n\n\n\n<p>15.Instance of a class is called<\/p>\n\n\n\n<p>(1) File                                                                               (2) object<\/p>\n\n\n\n<p>(3) Keyword                                                                                (4) None of these<\/p>\n\n\n\n<p>16. By default the members of a class are<\/p>\n\n\n\n<p>(1) Public                                                                           (2) Private<\/p>\n\n\n\n<p>(3) Protected                                                                      (4) None of these<\/p>\n\n\n\n<p>17.A class can have the \u2026\u2026\u2026\u2026\u2026\u2026members<\/p>\n\n\n\n<p>(1) Data                                                                             (2) Member functions<\/p>\n\n\n\n<p>(3) Bothe (1) and (2)                                                         (4) None of these<\/p>\n\n\n\n<p>18. The operation of processing each element in the list is known as<\/p>\n\n\n\n<p>(1) Sorting                                                                         (2) Merging<\/p>\n\n\n\n<p>(3) Inserting                                                                       (4) Traversal<\/p>\n\n\n\n<p>19. Beginning address of an array is called<\/p>\n\n\n\n<p>(1) Top address                                                                 (2) Base address<\/p>\n\n\n\n<p>(3) File address                                                                  (4) None of these<\/p>\n\n\n\n<p>20. A line of people waiting for their turn to vote is an example of<\/p>\n\n\n\n<p>(1) Stack                                                                            (2) Queue<\/p>\n\n\n\n<p>(3) Linked list                                                                    (4) None of these<\/p>\n\n\n\n<p>21.Stack follows.<\/p>\n\n\n\n<p>(1) GIGO Technique                                                         (2) FIFO Technique<\/p>\n\n\n\n<p>(3) LIFO Technique                                                          (4) None of these<\/p>\n\n\n\n<p>22.The elements are inserted in a queue from the end called<\/p>\n\n\n\n<p>(1) Top                                                                              (2) middle<\/p>\n\n\n\n<p>(3) Rear                                                                             (4) Front<\/p>\n\n\n\n<p>23. A linked list is a collection of data elements, called<\/p>\n\n\n\n<p>(1) Array                                                                           (2) Pointer<\/p>\n\n\n\n<p>(3) Nodes                                                                          (4) None of these<\/p>\n\n\n\n<p>24.Binary search works on only on<\/p>\n\n\n\n<p>(1) Unsorted array                                                             (2) Sorted array<\/p>\n\n\n\n<p>(3) int array                                                                        (4) none of these<\/p>\n\n\n\n<p>25.ABC* + D \u2013 EF\/* is a\/ an<\/p>\n\n\n\n<p>(1) Infix expression                                                           (2) Prefix expression<\/p>\n\n\n\n<p>(3) Postfix expression                                                        (4) None of these<\/p>\n\n\n\n<p>26. Duplication of data is known as<\/p>\n\n\n\n<p>(1) Delta                                                                            (2) Dque<\/p>\n\n\n\n<p>(3) Data redundancy                                                          (4) None of these<\/p>\n\n\n\n<p>27.A relational data model organizes the data into tables known as<\/p>\n\n\n\n<p>(1) Relation                                                                        (2) Network<\/p>\n\n\n\n<p>(3) File                                                                               (4) None of these<\/p>\n\n\n\n<p>28.A row in a relation is called<\/p>\n\n\n\n<p>(1) Data                                                                             (2) Tuple<\/p>\n\n\n\n<p>(3) Domain                                                                        (4) None of these<\/p>\n\n\n\n<p>29.Which of the following searching algorithms is of divide and conquer type?<\/p>\n\n\n\n<p>(1) Linear Search                                                               (2) Binary search<\/p>\n\n\n\n<p>(3) File searching                                                               (4) None of these<\/p>\n\n\n\n<p>30.DBMS stands for<\/p>\n\n\n\n<p>(1)Database Management system                   (2) Database Manual System                   <\/p>\n\n\n\n<p>(3)Define Management Solution                    (4) None of these<\/p>\n\n\n\n<p>31.The\u2026\u2026\u2026\u2026\u2026\u2026\u2026.command creates a new table.<\/p>\n\n\n\n<p>(1) CREATE TABLE                                              (2) CREATE VIEW<\/p>\n\n\n\n<p>(3) CREATE EMPLOYEE                                      (4) None of these<\/p>\n\n\n\n<p>32.COUNT( ) is used to<\/p>\n\n\n\n<p>(1) Count total number of rows                               (2) Count total number of columns<\/p>\n\n\n\n<p>(3) Count total number of files                                (4) None of these<\/p>\n\n\n\n<p>33.Network devices (s) is \/are<\/p>\n\n\n\n<p>(1) Modem                                                                        (2) Hub<\/p>\n\n\n\n<p>(3) Router                                                                          (4) All of these<\/p>\n\n\n\n<p>34.The pattern of interconnection of nodes in a network is called<\/p>\n\n\n\n<p>(1) Protocol                                                                       (2) Topology<\/p>\n\n\n\n<p>(3) E-mail                                                                          (4) None of these<\/p>\n\n\n\n<p>35.HTTP means<\/p>\n\n\n\n<p>(1) Height type Transfer protocol                                                         <\/p>\n\n\n\n<p>(2) Hyper Text Transfer Protocol<\/p>\n\n\n\n<p>(3) Hyper Text Transfer Power<\/p>\n\n\n\n<p>(4) None of these<\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #2009<\/strong> Questions<\/h4>\n\n\n\n<p><strong>1) <\/strong>. (a) Write the name of the header files on which the following belongs:<\/p>\n\n\n\n<p> (i) <strong>abs()                           (ii) setw()<\/strong><\/p>\n\n\n\n<p>Ans:- #include<math.h> #include<iomanip.h><\/p>\n\n\n\n<p>(b)<strong> Differentiate between datatype and Data Structure.<\/strong><\/p>\n\n\n\n<p>(c) Find the output:<\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\nvoid main()\n{\nint i=5;\nfor(;i<10;)\ncout<<i++<<\" \"<<endl;\n}<\/code><\/pre>\n\n\n\n<p><strong>      <\/strong> Output: <\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n<p>5<\/p>\n\n\n\n<p>6<\/p>\n\n\n\n<p>7<\/p>\n\n\n\n<p>8<\/p>\n\n\n\n<p>9<\/p>\n<\/div><\/div>\n\n\n\n<p>(e) Explain the following in brief:<\/p>\n\n\n\n<ol class=\"wp-block-list\"><li>Data abstraction <\/li><li>Encapsulation<\/li><\/ol>\n\n\n\n<p>(f)Write the output of the following program:<\/p>\n\n\n\n<p>2.(a) Write the output of the following program segment:<\/p>\n\n\n\n<p>(<strong>b) Write a program in C++ to check the input number is prime or not.<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid main()\n{\nclrscr();\nint n,i;\ncout<<\"Enter any number=\";\ncin>>n;\nfor(i=2;i<n;i++)\n{\n\nif(n%i==0)\nbreak;\n\n}\n\nif(i= = n)\ncout<<\"Number is prime\";\nelse\ncout<<\"Number is not prime\";\n\ngetch();\n}<\/code><\/pre>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><strong>(d) Write a program in C++ to generate Fibonacci series between 1-100.<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code><\/code><\/pre>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 14\/08\/202<\/strong>1<\/h4>\n\n\n\n<p><strong>1) STACK follows<\/strong><\/p>\n\n\n\n<p><strong>      <\/strong> i) GIGO Technique                                                      ii) FIFO  Technique   <\/p>\n\n\n\n<p>      iii) <strong>LIFO Technique<\/strong>                                                     iv) None of these<\/p>\n\n\n\n<p><strong>2) A set of  conditional\/ ternary operator(s) is\/are<\/strong><\/p>\n\n\n\n<p>       i) +,-,,\/,%                                                                    ii) >,<,>=,<=,==,!=             <\/p>\n\n\n\n<p>      iii) &&,\|\|,!                                                                      iv) ?:<\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 13\/08\/202<\/strong>1<\/h4>\n\n\n\n<p><strong>1)\u2026\u2026\u2026. is a Browser.<\/strong><\/p>\n\n\n\n<p><strong>   <\/strong>       i) C++                                                                         ii) Firefox<\/p>\n\n\n\n<p>          iii) Telnet                                                                    iv) Cookies<strong><\/strong><\/p>\n\n\n\n<p><strong>2) People standing in a line is an example of<\/strong><\/p>\n\n\n\n<p>       i) <strong>STACK<\/strong>                                                                     ii)<strong> QUEUE<\/strong>  <\/p>\n\n\n\n<p>      iii) <strong>ARRAY<\/strong>                                                                   iv) <strong>Linked list<\/strong><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 12\/08\/202<\/strong>1<\/h4>\n\n\n\n<p><strong>1) Main is a\/an<\/strong><\/p>\n\n\n\n<p>       i) Object                                                                      ii) Function<\/p>\n\n\n\n<p>      iii) Literal                                                                       iv) None of these<\/p>\n\n\n\n<p><strong>2) A set of logical operators is<\/strong><\/p>\n\n\n\n<p>       i) <strong>+  –    \/  %                     <\/strong>                                          ii) <strong>? :<\/strong><\/p>\n\n\n\n<p>      iii) <strong>>  <   >=  <=                                       <\/strong>                      iv) None of these<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 11\/08\/202<\/strong>1<\/h4>\n\n\n\n<p>a) <strong>C++ is developed by<\/strong><\/p>\n\n\n\n<p>       i) Dennis Ritchie                                                           ii)Ken Thompson             <\/p>\n\n\n\n<p>      iii) Martin Richard                                                         iv) B jarne Stroustrup<\/p>\n\n\n\n<p>b)<strong> String Terminator character is<\/strong><\/p>\n\n\n\n<p><strong>   <\/strong>    i) \u2018\\0\u2019                                                                            ii) \u2018\\n\u2019<\/p>\n\n\n\n<p>      iii) \u2018\\b\u2019                                                                    iv) None of these<\/p>\n\n\n\n<p>c) <strong>DBMS stands for<\/strong><\/p>\n\n\n\n<p>       i) Database Management System                     ii) Database Manual System          <\/p>\n\n\n\n<p>      iii) Define Management Solution                                   iv) None of these<\/p>\n\n\n\n<p>d)<strong> The smallest individual unit is<\/strong><\/p>\n\n\n\n<p>       i) Semicolon                                                                ii) Data type  <\/p>\n\n\n\n<p>      iii) Token                                                                       iv) Keyword<\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h3 class=\"has-text-align-center wp-block-heading\"><strong>COMPUTER SCIENCE XII<\/strong><\/h3>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n<p class=\"has-text-align-center\"><strong>        2021<\/strong><\/p>\n\n\n\n<p class=\"has-text-align-center\"><strong>(PRACTICAL)<\/strong><\/p>\n\n\n\n<p class=\"has-text-align-center\"><strong>Full marks-30<\/strong><\/p>\n\n\n\n<p class=\"has-text-align-center\"><strong>Pass marks -10<\/strong><\/p>\n\n\n\n<p class=\"has-text-align-center\"><strong>Time -3 Hours<\/strong><\/p>\n\n\n\n<p class=\"has-text-align-center\"><strong>    <\/strong><strong>GROUP- A<\/strong><strong><\/strong><\/p>\n<\/div><\/div>\n\n\n\n<p><strong>Figures in the margin indicate full marks.<\/strong><strong>         <\/strong><strong><\/strong><\/p>\n\n\n\n<p><strong>1<\/strong>.Answer any two of the following questions:                                       <strong>52=10<\/strong><strong><\/strong><\/p>\n\n\n\n<p>a) Write a program in C++ to display the following pattern.<\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n<p> <strong>1<\/strong><\/p>\n\n\n\n<p><strong>2  2<\/strong><\/p>\n\n\n\n<p><strong>3  3  3<\/strong><\/p>\n\n\n\n<p><strong>4  4  4  4  <\/strong><\/p>\n\n\n\n<p><strong> 5  5  5  5  5<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid main() \n{\nclrscr();\nint i,j;\nfor(i=1;i<=5;i++)\n{\nfor(j=1;j<=i;j++)\n{\ncout<<i<<\u201d \\t\u201d;\n}\ncout<<\u201d\\n\u201d;\n}\ngetch();\n}\n<\/code><\/pre>\n<\/div><\/div>\n\n\n\n<p>b) Write a program in C++ to calculate the sum of the following series.<\/p>\n\n\n\n<p>   <strong>Sum=1<sup>2<\/sup>+2<sup>2<\/sup>+3<sup>2<\/sup>+\u2026\u2026\u2026\u2026\u2026\u2026\u2026..+n<sup>2<\/sup><\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid main() \n{\nclrscr();\nint n,i,s=0;\t\ncout<<\u201dEnter value of n=\u201d;\ncin>>n;\nfor(i=1;i<=n;i++)\n{\ncout<<(ii)<<\u201d\\t\u201d;\ns=s+(ii);\n}\ncout<<\u201d\\nsum of series=\u201d<<s;\ngetch();\n}\n<\/code><\/pre>\n\n\n\n<p>Output <\/p>\n\n\n\n<p>Enter value of n=5<\/p>\n\n\n\n<p>1 4 9 16 25 <\/p>\n\n\n\n<p>sum of series=55<\/p>\n\n\n\n<p>c)Write a program in C++ to show the concept of <strong>Encapsulation(class & object).<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nclass nips\n{\npublic:\nint a,b,c;\nvoid input();\nvoid process();\nvoid show();\n};\nvoid nips::input()\n{\na=10;\nb=5;\n}\nvoid nips::process()\n{\nc=a+b;\n}\nvoid nips::show()\n{\ncout<<\"Sum=\"<<c;\n}\n\n\nvoid main()\n{\nclrscr();\nnips n1;\nn1.input();\nn1.process();\nn1.show();\ngetch();\n}<\/code><\/pre>\n\n\n\n<p><strong>Output<\/strong><\/p>\n\n\n\n<p>Sum=15<\/p>\n\n\n\n<p>d) Write a program in C++ to swap the values of two integer variables using call by reference method.<\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid swap(int &,int &);\nvoid main() \n{\nclrscr();\nint a,b;\na=10;\nb=20;\ncout<<\u201dBefore swapping a=\u201d<<a<<\u201d\\tb=\u201d<<b;\nswap(a,b);\ncout<<\u201d\\nAfter swapping in main a=\u201d<<a<<\u201d\\tb=\u201d<<b;\ngetch();\n}\nvoid swap(int &x,int &y)\n{\nint z;\nz=x;\nx=y;\ny=z;\ncout<<\u201d\\n After swapping in function a=\u201d<<x<<\u201d\\tb=\u201d<<y;\n}\n<\/code><\/pre>\n\n\n\n<p><strong>Output<\/strong><\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n<p>Before swapping a=10 b=20<\/p>\n\n\n\n<p>After swapping in function a= 20 b=10<\/p>\n\n\n\n<p>After swapping in main a=20 b=10<\/p>\n<\/div><\/div>\n\n\n\n<p><\/p>\n\n\n\n<p class=\"has-text-align-center\"><strong>GROUP- B<\/strong><\/p>\n\n\n\n<p class=\"has-text-align-center\">2. Write SQL commands for  (a) to (e) on the basis of  SPORTS  relation given below:                                                                               <strong>15=5<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong> Student      No.<\/strong><\/td><td><strong>Class<\/strong><\/td><td><strong>Name<\/strong><\/td><td><strong>Game<\/strong><\/td><td><strong>Grade<\/strong><\/td><td><strong>Sex<\/strong><\/td><\/tr><tr><td><strong>10<\/strong><\/td><td><strong>7<\/strong><\/td><td><strong>Samir<\/strong><\/td><td><strong>Cricket<\/strong><\/td><td><strong>B<\/strong><\/td><td><strong>M<\/strong><\/td><\/tr><tr><td><strong>11<\/strong><\/td><td><strong>8<\/strong><\/td><td><strong>Sujit<\/strong><\/td><td><strong>Tennis<\/strong><\/td><td><strong>A<\/strong><\/td><td><strong>M<\/strong><\/td><\/tr><tr><td><strong>12<\/strong><\/td><td><strong>7<\/strong><\/td><td><strong>Kamal<\/strong><\/td><td><strong>Swimming<\/strong><\/td><td><strong>B<\/strong><\/td><td><strong>M<\/strong><\/td><\/tr><tr><td><strong>13<\/strong><\/td><td><strong>7<\/strong><\/td><td><strong>Vina<\/strong><\/td><td><strong>Tennis<\/strong><\/td><td><strong>C<\/strong><\/td><td><strong>F<\/strong><\/td><\/tr><tr><td><strong>14<\/strong><\/td><td><strong>9<\/strong><\/td><td><strong>Archana<\/strong><\/td><td><strong>Basketball<\/strong><\/td><td><strong>A<\/strong><\/td><td><strong>F<\/strong><\/td><\/tr><tr><td><strong>15<\/strong><\/td><td><strong>10<\/strong><\/td><td><strong>Arpita<\/strong><\/td><td><strong>Cricket<\/strong><\/td><td><strong>A<\/strong><\/td><td><strong>F<\/strong><\/td><\/tr><tr><td><strong>16<\/strong><\/td><td><strong>9<\/strong><\/td><td><strong>Alok<\/strong><\/td><td><strong>Swimming<\/strong><\/td><td><strong>C<\/strong><\/td><td><strong>M<\/strong><\/td><\/tr><tr><td><strong>17<\/strong><\/td><td><strong>8<\/strong><\/td><td><strong>Nitu<\/strong><\/td><td><strong>Tennis<\/strong><\/td><td><strong>A<\/strong><\/td><td><strong>F<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p> a) To display the names of students who have opted the game \u2018Cricket\u2019<\/p>\n\n\n\n<p><strong>SQL> SELECT Name From SPORTS where Game=’Cricket’;<\/strong><\/p>\n\n\n\n<p>b) To display the details of all students in descending order of number of students.<\/p>\n\n\n\n<p><strong>SQL> SELECT * From SPORTS <\/strong> <strong>ORDER BY Student_No Desc’;<\/strong><\/p>\n\n\n\n<p>c) To display the names of female students who got grade \u2018A\u2019.<\/p>\n\n\n\n<p><strong>SQL> SELECT Name From SPORTS where Grade=’A’ AND Sex=’F’;<\/strong><\/p>\n\n\n\n<p>d) To display the number of students having game \u2018Tennis\u2019.<\/p>\n\n\n\n<p><strong>SQL> SELECT COUNT() From SPORTS where Game=’Tennis’;<\/strong><\/p>\n\n\n\n<p>e) To display distinct game from \u2018Sports\u2019 relation.<\/p>\n\n\n\n<p><strong>SQL> SELECT DISTINCT Game From SPORTS’;<\/strong><\/p>\n\n\n\n<p><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience2021 \|Computer Science 12 Set 2B Computer Science 11th 12th BCA\|\|#ErAmrendra Mehta\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/JCUXMCwvA_I?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">Q. What do you understand by Object Oriented Approach?<\/h4>\n\n\n\n<p>Object Oriented Approach is a way of computer Programming that allows modularization of a program by forming separate memory area for Data as well as function.<\/p>\n\n\n\n<ul class=\"wp-block-list\"><li>It works with Bottom up approach.<\/li><li>Program is divided in to classes and objects.<\/li><li>It is suitable for most business applications, Game development projects etc.<\/li><li>It allows Reusability of code using Inheritance.<\/li><li>It supports other features of OOP like Class, Object, Polymorphism, Encapsulation, Inheritance etc.<\/li><\/ul>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Q. Give the output of the following:<\/h4>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\nvoid main()\n{\nint i;\nfor(i=1;i<=10;i++)\n{\ncout<<10<<\u201dx\u201d<<i<<\u201d=\u201d<<i5<<endl;\n}\n}\n<\/code><\/pre>\n\n\n\n<p>Output<\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n<p>10 X 1=5<\/p>\n\n\n\n<p>10 X 2=10<\/p>\n\n\n\n<p>10 X 3=15<\/p>\n\n\n\n<p>10 X 4=20<\/p>\n\n\n\n<p>\u2026\u2026\u2026\u2026\u2026<\/p>\n\n\n\n<p>\u2026\u2026\u2026\u2026\u2026<\/p>\n\n\n\n<p>10 X 10=50<\/p>\n<\/div><\/div>\n\n\n\n<p><\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n<p>Q. Given the values of x, y and z, evaluate the following (Answer in true \/ false)<\/p>\n\n\n\n<p>(x>=y)\|\|(!(z==y)&&(z<x))<\/p>\n\n\n\n<ol class=\"wp-block-list\" type=\"a\"><li>x=10, y=5, z=1 (1 True)<\/li><li>x=9, y=10, z=2 (0 False)<\/li><\/ol>\n<\/div><\/div>\n\n\n\n<h4 class=\"wp-block-heading\">Q. Given the following family relation. Write SQL commands for the following.<\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>NO<\/td><td>NAME<\/td><td>FEMALE MEMBERS<\/td><td>MALE MEMBERS<\/td><td>INCOME<\/td><td>OCCUPATION  <\/td><\/tr><tr><td>1<\/td><td>MISHRA<\/td><td>3<\/td><td>2<\/td><td>10000<\/td><td>SERVICES<\/td><\/tr><tr><td>2<\/td><td>GUPTA<\/td><td>4<\/td><td>1<\/td><td>25000<\/td><td>BUSINESS<\/td><\/tr><tr><td>3<\/td><td>KHAN<\/td><td>6<\/td><td>3<\/td><td>15000<\/td><td>MIXED<\/td><\/tr><tr><td>4<\/td><td>YADAV<\/td><td>7<\/td><td>2<\/td><td>18000<\/td><td>MIXED<\/td><\/tr><tr><td>5<\/td><td>JOSHI<\/td><td>3<\/td><td>2<\/td><td>14000<\/td><td>SERVICES<\/td><\/tr><tr><td>6<\/td><td>MORYA<\/td><td>5<\/td><td>2<\/td><td>10000<\/td><td>SERVICES<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>a) To Select all the information of family whose occupation is services.<\/p>\n\n\n\n<p><\/p>\n\n\n\n<p>b) To list the name of family where female are more than 3.<\/p>\n\n\n\n<p><\/p>\n\n\n\n<p>c) To list all the name of family with income in ascending order.<\/p>\n\n\n\n<p> d) To display the family name, male member and occupation of mixed family.<\/p>\n\n\n\n<p>e) To count the number of family whose income is less than 15000.<\/p>\n\n\n\n<p>f) To insert  a new records in the family table with the following data<\/p>\n\n\n\n<p>\u201camit\u201d, 2, 1, 15000,\u201dServices\u201d<\/p>\n\n\n\n<p><\/p>\n\n\n\n<p>g) Add a new field phno in the table family.<\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Computer Science 12th 2021 \| Viral Model Set Computer Science 12th 2021\| VVI Questions 12th computer\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/kTLdBAvkC2k?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\">Q. Differentiate between class and object.<\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>A class is a blueprint from which we can create the instance (objects).<\/td><td>An object is the instance of the class, which helps to use variables and methods from inside the class.<\/td><\/tr><tr><td>Class is a group of similar objects.<\/td><td>Object is a real world entity such as pen, chair, mobile, laptop etc.<\/td><\/tr><tr><td>Class does not exist physically, i.e., it exists logically.<\/td><td>Object has physical existence.  <\/td><\/tr><tr><td>Class does not allocate memory spaces when it is created.<\/td><td>Object allocates memory when it is created.<\/td><\/tr><tr><td>Class is declared only once.<\/td><td>Objects can be declared several times depending on the need.<\/td><\/tr><tr><td>class nips<br> {<br> private: <br>\u2026\u2026. <br>public:<br> \u2026\u2026. <br>protected:<br> \u2026\u2026.. <br>};<\/td><td>class nips <br>{<br> private:<br> \u2026\u2026. <br>public:<br> \u2026\u2026. <br>protected:<br> \u2026\u2026.. <br>};<br> void main()<br> {<br> nips n1;  \/\/ n1 is object<br> }<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Q. How is an Entry controlled loop is different from Exit controlled loop?<\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Entry control loop<\/td><td>Exit control loop<\/td><\/tr><tr><td>Entry control loop checks the condition first then the body of the loop is executed.<\/td><td>Exit control loop first executes the body of the loop then checks the condition at last.<\/td><\/tr><tr><td>The body of the loop may or may not be executed at all.<\/td><td>The body of the loop will be executed at least once because condition is checked at last.<\/td><\/tr><tr><td>for,while are an example of entry control loop.<\/td><td>do-while loop is an example of exit control loop.<\/td><\/tr><tr><td>for(i=1;i<=5;i++) <br>{<br> cout<<\u201d\\nNIPS ACADEMY\u201d; <br>} <br><br>    i=1; <br>while(i<=5)<br> {<br> cout<<\u201d\\nNIPS\u201d; <br>i++;<br>}  <\/td><td>i=1;<br> do<br> { <br>cout<<\u201d\\nNIPS ACADEMY\u201d; <br>i++;<br>}while (i<=5);<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Q. Differentiate between DDL and DML.<\/h4>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>DDL<\/td><td>DML<\/td><\/tr><tr><td>It stands for Data Definition language which is used to define database structure or schema.<\/td><td>It stands for Data Manipulation Language which is used to manipulate data in database.<\/td><\/tr><tr><td>It basically defines the columns (Attributes) of the table.<\/td><td>It adds or updates the row of the table.<\/td><\/tr><tr><td>It does not use WHERE clause in its statement.<\/td><td>DML uses WHERE clause in its statement.<\/td><\/tr><tr><td>Ex:- CREATE, DROP, RENAME,ALTER etc.<\/td><td>Ex:- INSERT, UPDATE, DELETE, SELECT,MERGE etc.<\/td><\/tr><tr><td>Changes done by DDL command can\u2019t be rolled back.<\/td><td>Changes can be rolled back.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"12th Computer Science Model set 2021 \| #JACComputerScience 2021 \| Computer Science model set\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/4clolHB9Ah8?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h3 class=\"wp-block-heading\">Find Output<\/h3>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\n#include<math.h>\nvoid main()\n{\nclrscr();\nint r;\nfor(int i=2;i<5;i++)\n{\nr=pow(i,i);\ncout<<\"\\n\"<<i<<\"\\t\"<<r;\n}\n\ngetch();\n}<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Database Management System(DBMS)<\/strong><\/h3>\n\n\n\n<p>Cardinality:- the total number of tuples in a relation is called the cardinality of a relation.<\/p>\n\n\n\n<p>Degree:- The total number of attribute in a relation is called  the degree of a relation.<\/p>\n\n\n\n<p>Domain:- A domain is a set of possible values that are designed to each column of a table.<\/p>\n\n\n\n<p>Cardinality:- the total number of tuples in a relation is called the cardinality of a relation.<\/p>\n\n\n\n<p>Degree:- The total number of attribute in a relation is called  the degree of a relation.<\/p>\n\n\n\n<p>Domain:- A domain is a set of possible values that are designed to each column of a table.<\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><strong>12th C++ Revision <\/strong><\/p>\n\n\n\n<p><strong> <\/strong>Q.Write a program to print your name five times using while loop.<\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n#include<conio.h>\nvoid main() \n{\nclrscr();\nint i;\t\ni=1;\nwhile(i<=5)\n{\ncout<<\u201d\\n NIPS ACADEMY\u201d;\ni++;\n}\ngetch();\n}\n<\/code><\/pre>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 6\/10\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Write a program to find 10% discount on input amount if amount is greater than 1000.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Day-7 C++ Conditional statement Practice \| Computer Science 11th 12th BCA Best YouTube Channel\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/iQTTuNmU-yQ?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 5\/10\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. write a program to find sum of five numbers using constructor.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 4\/10\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Write a program in C++ to check number is even or odd using conditional operator.<\/p>\n\n\n\n<p>Q2.Write a program in C++ to check number is even or odd using simple if.<\/p>\n\n\n\n<p>Q3.Write a program in C++ to check number is even or odd using if else.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Day-5 \|Number is Even or Odd using conditional or Ternary operator \|Simple if \|if else \|C++ Program\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/cr2LZQQCSig?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 3\/10\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Write a program to find simple interest in C++.<\/p>\n\n\n\n<p>Q2. Write a program to find compound interest in C++.<\/p>\n\n\n\n<p>Q3. Write a program to find simple and compound interest in C++.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Day - 4 ComputerScience 12th 11th BCA \| C++ Program for Simple and Compound interest Best concept\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/NYq6B5RJMFg?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 2\/10\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Write a program to find area and perimeter of a Rectangle.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Day- 3 #ComputerScience 12th 11th BCA \| C++ Programming Course with best Notes \| C++ Best concept\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/fnKCyeF3jb0?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<p><strong>JAC 12th Computer Science #Test 1\/10\/2020<\/strong><\/p>\n\n\n\n<p>Q1. Draw a logic circuit diagram for NAND to AND gate.<\/p>\n\n\n\n<p>Q2. Draw a Logic circuit diagram for NAND to OR gate.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 30\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Define Truth Table?<\/p>\n\n\n\n<p>Q2. Write Identity Law.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 29\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Define Literals.<\/p>\n\n\n\n<p>Q2. Define Minterm.<\/p>\n\n\n\n<p>Q3. Define Maxterm.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 28\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. How many gates would be required to implement the following Boolean expression after<br>simplification?<br><strong>XY+X(X+Z)+Y(X+Z)<\/strong><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 27\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Obtain a simplified form for the following Boolean Expression<br>using Karnaugh Map:<br><strong>F(A,B,C,D)=\u2211 (0,1,2,4,5,6,8,9,10,12,13,14)<\/strong><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 26\/09\/2020<\/strong><\/h4>\n\n\n\n<p><strong>Q1. State and verify the De Morgan\u2019s law in Boolean algebra using<br>truth table .<\/strong><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 25\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. <strong>Obtain a simplified form for the following Boolean Expression<br>using Karnaugh Map:<br>F(A,B,C,D)=\u2211 (0,1,2,3,4,5,6,7,8,9,10,11)<\/strong><\/p>\n\n\n\n<p><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"JAC 12th Previous Year Important Questions\|Objective Questions Computer Science 12th with Answer\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/B5Z4G76SV5Y?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 24\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. <strong>Obtain a simplified form for the following Boolean Expression<br>using Karnaugh Map:<br>F(A,B,C,D)=\u2211 (0,2,5,7,8,1013,15)<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"How to solve Karnaugh Map four variable\|K Map four variable Best trick\|K Map Solution 12th JAC 2019\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/zEX95ipX0Oc?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 19\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. <strong>State and verify the De Morgan\u2019s law in Boolean algebra using<br>truth table .<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience State and verify the De Morgan\u2019s law in Boolean algebra using truth table .\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/qCQgDFhTI5A?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 18\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. <strong>What is logic gate? Explain fundamental logic gates with circuit diagram and truth table.<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#Computer What is logic gate? Explain fundamental logic gates with circuit diagram and truth table.\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/crYJ_K_kSYQ?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 17\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Write Identity Law.<\/p>\n\n\n\n<p>Q2. Write Inverse(Complementary Law)<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 16\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Prepare a truth table for <strong>XY+Y Z’+X ‘Z’<\/strong><\/p>\n\n\n\n<p><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience1th12th BCA\| Boolean Algebra Truth table Previous Year Questions #ErAmrendra Mehta\|\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/qioPPhSJ1Jc?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 15\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Prepare a truth table for <strong>XY+Y Z’+X ‘Z’<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience1th12th BCA\| Boolean Algebra Truth table Previous Year Questions #ErAmrendra Mehta\|\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/qioPPhSJ1Jc?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 14\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Prepare a truth table for <strong>XYZ+Y Z’+X’ Z’<\/strong><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 13\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. <strong>Draw the circuit and truth table of X+X’ Y<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Truth Table and Circuit Diagram Boolean Algebra \| Computer Science Solved Previous Paper 2020\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/-jA5kC_IcX4?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 12\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. <strong>Prepare a truth table for ABC’+BC<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"#ComputerScience 12th important Question Computer Science 2021 \| Boolean Algerbra Previous Questions\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/aErKYbjShKw?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 11\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. <strong>For a given variable \u201ca=, initialized by 10, what is the difference between statements a++ and ++a? Explain briefly.<\/strong><\/p>\n\n\n\n<p>Answer:- <\/p>\n\n\n\n<p><strong>if we use a++(as Postfix) then original value of \u2018a\u2019 is returned first then, \u2018a\u2019 is incremented by 1.<\/strong><\/p>\n\n\n\n<p><strong>If we use ++a(as Prefix) then the value of \u2018a\u2019 is incremented by 1 then, it returns the value.<\/strong><strong><\/strong><\/p>\n\n\n\n<p><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"what is the difference between statements a++ and ++a? 12th vvi Important Questions C++ computer\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/2C_3md-8fIw?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 10\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Evaluate the following C++ expression s where a,b,c are integers and d,f are floating point numbers .The values are a=4,b=4 and d=1.5.<br>a)<strong> c=a+++++b++d<\/strong><\/p>\n\n\n\n<p>b) <strong>f=++ bb++ – ++a<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Computer Science Important Question 12th 11th\|C++ Programming \| Amrendra Sir NIPS ACADEMY Daltonganj\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/v9rObi7pE7Q?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 9\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Evaluate the following C++ expression s where a,b,c are integers and d,f are floating<br>point numbers .The values are a=3,b=5 and d=1.5.<br>a) <strong>c=a++ +b++d <\/strong><\/p>\n\n\n\n<p><em>b)<\/em><strong> f= bb++ – ++a<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Increment Decrement \| Prefix Postfix Important Questions\| Computer Science Best YouTube Channel\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/KniqEX1iurQ?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 8\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1.Evaluate the following C++ expressions where a,b,c are integers and d,f are floating point numbers .The values are a=5,b=6 and d=3.5.<\/p>\n\n\n\n<p>a) <strong>c=a++ – (b ++) (- -d)<\/strong><br>b)<strong> f=(++b) * b \u2013 a++<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"12th VVI Questions Computer Science 2021 \| Best YouTube Channel for Computer Science 11th 12th BCA\|\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/AIukmw2wxf4?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 7\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Write a program to create a class <strong>RESORT <\/strong>in C++ with the following description:<br><strong>Private Members:<\/strong><br><strong>Rno <\/strong> Room no.<\/p>\n\n\n\n<p><strong>Name<\/strong> Customer name<br><strong>Charges<\/strong> Per day charges<br><strong>Days<\/strong> no. of days stay<br><strong>Compute<\/strong> A function to calculate and return amount as<br>Days<em>Charges and if the value of Days<\/em>Charges is<br>more than 11000 then as 1.02<em>Days<\/em>Charges.<br><strong>Public Member:<\/strong><br><strong>Getinfo ( )<\/strong> A function to enter the content rno, name, charges<br>and days.<br><strong>Dispinfo ( )<\/strong> A function to display rno, name, charges, days and<br>amount.<br>(Amount to be displayed by calling function<br>compute ( ) )<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"JAC 12th Computer Science Important C++ Program \|Best YouTube Channel for Computer Science 12th 11\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/hIk9vjg8XwU?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 6\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Compare and contrast between Bubble sort and Selection sort.<\/p>\n\n\n\n<p>Ans:- <em><a href=\"https:\/\/www.nipsacademy.com\/blogs\/sorting-algorithms-and-programs-in-c\/\">Sorting Algorithms and Programs in C++<\/a><\/em><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 5\/09\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. An electricity board charges according to following rates:<br><strong>For the First 100 units—— Rs 2 per unit<\/strong><br><strong>For the Next 200 units—— Rs 3 per unit<\/strong><\/p>\n\n\n\n<p><strong>Beyond 300 units—— Rs 4 per unit.<\/strong><br>All users are charged meter charge also, which is Rs 50. Write a program in C++ to read the number of units consumed and print out the charges.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"C++ Electricity board Question \| 12th JAC vvi important Questions 2021 \| NIPS Amrendra ACADEMY\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/TdqBISDLRt4?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"30 Days 30 Videos for 11th 12th BCA\| \| JAC Computer Science 12th vvi Important \| NIPSAmrendraACADEMY\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/XL0SjUt3aYw?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<p><strong>JAC 12th Computer Science #Test 4\/09\/2020<\/strong><\/p>\n\n\n\n<p>Q1. Obtain postfix notation for the following infix notation manually:<\/p>\n\n\n\n<p>a) <strong>A+C-D<em>B<\/em><\/strong><em> <\/em><\/p>\n\n\n\n<p><em>b) <\/em><strong>(A+B)C+D\/E-F<\/strong><\/p>\n\n\n\n<h5 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 3\/09\/2020<\/strong><\/h5>\n\n\n\n<p>Q1. Evaluate the following postfix expression using a stack and show the contents of stack<br>after execution of each operation:<br>120, 45, 20, +, 25, 15,-, +,<\/p>\n\n\n\n<h5 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 2\/09\/2020<\/strong><\/h5>\n\n\n\n<p>Q1, What data types would you use to represent the following items?<br>i) The average marks in a class<br>ii) The number of students in the class<br>iii) The registration letter of a car<br>iv) The population of a city<\/p>\n\n\n\n<h5 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 1\/09\/2020<\/strong><\/h5>\n\n\n\n<p>Q1. What data types would you use to represent the following items?<br>i) The number of employees in a Department<br>ii) The salary of an employee<br>iii) The identification number of an employee<br>iv)The registration number of a vehicle<\/p>\n\n\n\n<p><\/p>\n\n\n\n<h5 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 15 \/08\/2020<\/strong><\/h5>\n\n\n\n<p>Q1.What is array in C++? Explain its types.[JAC 2020]<\/p>\n\n\n\n<p>Q2.Define Single inheritance and explain with suitable example. [JAC2020]<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 14 \/08\/2020<\/strong><\/h4>\n\n\n\n<p>Q1.What is Inheritance?<\/p>\n\n\n\n<p>Q2.Define Data type. Explain different types of data type with example<\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 13 \/08\/2020<\/strong><\/h4>\n\n\n\n<p>Q1.Write the difference between Unary operator and Ternary operator. [JAC 2020]<\/p>\n\n\n\n<p>Q2. ) Give the output of the following:<\/p>\n\n\n\n<pre class=\"wp-block-code language-cpp line-numbers\"><code>#include<iostream.h>\n void main( )\n{\nint x;\nfor(x=1;x<=12;x=2)\ncout<<x<<endl;\n}\n<\/code><\/pre>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 12 \/08\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. What is Token? What are the names of different types of Token?[JAC 2020]<\/p>\n\n\n\n<p>Q2. Write the difference between Data and Information.[JAC 2020]<\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 11 \/08\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. <strong>Write a program in C++ to find the sum of any five odd numbers<\/strong>.<\/p>\n\n\n\n<p>Q2. Write a program in C++ to find the product of any five numbers using <strong>constructor member<\/strong> functions.<\/p>\n\n\n\n<p><strong>JAC 12th Computer Science #Test 10 \/08\/2020<\/strong><\/p>\n\n\n\n<p><strong>True and False Questions<\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\"><li>Push and Pop term are related to stack data structure. <strong><em>T<\/em><\/strong><\/li><li>Enqueue and Dequeue are terms related to queue data structure. <strong><em>T<\/em><\/strong><\/li><li>The postfix conversion of a infix expression and recursion are internally implemented through stack. <strong><em>T<\/em><\/strong><\/li><li>The circular queue better utilises the space in a fixed size queue. <strong><em>T<\/em><\/strong><\/li><li>Pushing in a full fixed size stack results into an error.<strong><em>T<\/em><\/strong><\/li><li>Popping from an empty stack results into an error. <strong><em>T<\/em><\/strong><\/li><li>Inserting in a full fixed size queue results into an error. <strong><em>T<\/em><\/strong><\/li><li>Deleting from an empty queue results into an error. <strong><em>T<\/em><\/strong><\/li><li>For reversing the order of a list of values , queues are internally used.<strong><em>F<\/em><\/strong><\/li><li>Like circular and double -ended queues , implementation formats of stacks may also be varied. <strong><em>F<\/em><\/strong><\/li><\/ol>\n\n\n\n<h4 class=\"wp-block-heading\"><strong>JAC 12th Computer Science #Test 09 \/08\/2020<\/strong><\/h4>\n\n\n\n<p>Q1. Obtain postfix notation for the following infix notation manually:<\/p>\n\n\n\n<p><strong>          <\/strong>a)<strong>  A+C-DB<\/strong><\/p>\n\n\n\n<p><strong>Answer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Symbol<\/strong><\/td><td><strong>  Stack<\/strong><\/td><td><strong>Expression<\/strong><\/td><\/tr><tr><td><strong>A<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>A<\/strong><\/td><\/tr><tr><td><strong>+<\/strong><\/td><td><strong>+<\/strong><\/td><td><strong>A<\/strong><\/td><\/tr><tr><td><strong>C<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AC+<\/strong><\/td><\/tr><tr><td><strong>–<\/strong><\/td><td><strong>–<\/strong><\/td><td><strong>AC+<\/strong><strong><\/strong><\/td><\/tr><tr><td><strong>D<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AC+D-<\/strong><strong><\/strong><\/td><\/tr><tr><td><strong><\/strong><\/td><td><strong><\/strong><\/td><td><strong>AC+D-<\/strong><strong><\/strong><\/td><\/tr><tr><td><strong>B<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AC+D-B<\/strong><strong><\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>Postfix=<strong> AC+D-B<\/strong><\/p>\n\n\n\n<div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container is-layout-flow wp-block-group-is-layout-flow\">\n<p><strong>Check       AC+D-B<\/strong><\/p>\n\n\n\n<p><strong>                  A+C D-B<\/strong><\/p>\n\n\n\n<p><strong>                A+C-D B<\/strong><\/p>\n\n\n\n<p><strong>                A+C-DB                <\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"How to convert Infix to Postfix \| Data Structure class 12th vvi Questions \|\|# ErAmrendraMehta\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/SLDspEdXMYs?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n<\/div><\/div>\n\n\n\n<p><strong>        <\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Best Trick for Infix to Postfix Coversion Class 12 important Question\| #ErAmrendraMehta \| CMS12th\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/tOzyTvUTeV4?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<p><strong>  <\/strong>b)<strong>  (A+B)C+D\/E-F<\/strong><\/p>\n\n\n\n<p><strong>Answer<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Symbol<\/strong><\/td><td><strong>Stack<\/strong><\/td><td><strong>Expression<\/strong><\/td><\/tr><tr><td><strong>(<\/strong><\/td><td><strong>(<\/strong><\/td><td><strong> <\/strong><\/td><\/tr><tr><td><strong>A<\/strong><\/td><td><strong>(<\/strong><\/td><td><strong>A<\/strong><\/td><\/tr><tr><td><strong>+<\/strong><\/td><td><strong>(+<\/strong><\/td><td><strong>A<\/strong><\/td><\/tr><tr><td><strong>B<\/strong><\/td><td><strong>(+<\/strong><\/td><td><strong>A B<\/strong><\/td><\/tr><tr><td><strong>)<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AB+<\/strong><\/td><\/tr><tr><td><strong><\/strong><\/td><td><strong><\/strong><\/td><td><strong>AB+<\/strong><\/td><\/tr><tr><td><strong>C<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AB+C<\/strong><\/td><\/tr><tr><td><strong>+<\/strong><\/td><td><strong>+<\/strong><\/td><td><strong>AB+C<\/strong><\/td><\/tr><tr><td><strong>D<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AB+CD+<\/strong><\/td><\/tr><tr><td><strong>\/<\/strong><\/td><td><strong>\/<\/strong><\/td><td><strong>AB+CD+<\/strong><\/td><\/tr><tr><td><strong>E<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AB+CD+E\/<\/strong><\/td><\/tr><tr><td><strong>–<\/strong><\/td><td><strong>–<\/strong><\/td><td><strong>AB+CD+E\/<\/strong><\/td><\/tr><tr><td><strong>F<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AB+CD+E\/F-<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>Postfix:  AB+CD+E\/F-<\/strong><\/p>\n\n\n\n<p><strong>Check:  <\/strong><\/p>\n\n\n\n<p><strong>AB+CD+E\/F-<\/strong><\/p>\n\n\n\n<p><strong>A+B<\/strong><strong> CD+E\/F-<\/strong><\/p>\n\n\n\n<p><strong>A+BC<\/strong><strong> D+E\/F-<\/strong><\/p>\n\n\n\n<p><strong>A+BC+D<\/strong><strong> E\/F-<\/strong><\/p>\n\n\n\n<p><strong>A+BC+D\/E<\/strong><strong> F-<\/strong><\/p>\n\n\n\n<p><strong>A+BC+D\/E-F<\/strong><strong><\/strong><\/p>\n\n\n\n<p>Q2. Transform each of the following expressions to <strong>prefix and postfix<\/strong> form:<\/p>\n\n\n\n<p><strong>          <\/strong>a)<strong>  (A-B(C+D))\/EF<\/strong><\/p>\n\n\n\n<p><strong>Answer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Symbol<\/strong><\/td><td><strong>Stack<\/strong><\/td><td><strong>Expression<\/strong><\/td><\/tr><tr><td><strong>(<\/strong><\/td><td><strong>(<\/strong><\/td><td><strong> <\/strong><\/td><\/tr><tr><td><strong>A<\/strong><\/td><td><strong>(<\/strong><\/td><td><strong>A<\/strong><\/td><\/tr><tr><td><strong>–<\/strong><\/td><td><strong>(-<\/strong><\/td><td><strong>A<\/strong><\/td><\/tr><tr><td><strong>B<\/strong><\/td><td><strong>(-<\/strong><\/td><td><strong>A   B<\/strong><\/td><\/tr><tr><td><strong><\/strong><\/td><td><strong>(-<\/strong><\/td><td><strong>A  B<\/strong><\/td><\/tr><tr><td><strong>(<\/strong><\/td><td><strong>(-(<\/strong><\/td><td><strong>A  B<\/strong><\/td><\/tr><tr><td><strong>C<\/strong><\/td><td><strong>(-(<\/strong><\/td><td><strong>A  B  C<\/strong><\/td><\/tr><tr><td><strong>+<\/strong><\/td><td><strong>(-(+<\/strong><\/td><td><strong>A  B  C<\/strong><\/td><\/tr><tr><td><strong>D<\/strong><\/td><td><strong>(-(+<\/strong><\/td><td><strong>A  B  C  D<\/strong><\/td><\/tr><tr><td><strong>)<\/strong><\/td><td><strong>(-(+)<\/strong><\/td><td><strong>A  B  CD+<\/strong><\/td><\/tr><tr><td><strong>)<\/strong><\/td><td><strong>(-)<\/strong><\/td><td><strong>ABCD+-<\/strong><\/td><\/tr><tr><td><strong>\/<\/strong><\/td><td><strong>\/<\/strong><\/td><td><strong>ABCD+-<\/strong><\/td><\/tr><tr><td><strong>E<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>ABCD+- E\/<\/strong><\/td><\/tr><tr><td><strong><\/strong><\/td><td><strong><\/strong><\/td><td><strong>ABCD+- E\/<\/strong><\/td><\/tr><tr><td><strong>F<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>ABCD+- E\/F<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>Postfix: ABCD+- E\/F<\/strong><\/p>\n\n\n\n<p><strong>Check<\/strong><\/p>\n\n\n\n<p><strong>ABCD+- E\/F<\/strong><\/p>\n\n\n\n<p><strong>ABC+D-E\/F<\/strong><\/p>\n\n\n\n<p><strong>ABC+D-E\/F<\/strong><\/p>\n\n\n\n<p><strong>A-BC+D<\/strong><strong> E\/F<\/strong><\/p>\n\n\n\n<p><strong>A-BC+D\/E<\/strong><strong> F<\/strong><\/p>\n\n\n\n<p><strong>A-BC+D\/EF<\/strong><strong><\/strong><\/p>\n\n\n\n<p><strong>          <\/strong>b)<strong>  (A+B)-CD<\/strong><\/p>\n\n\n\n<p>Answer:<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Symbol<\/strong><\/td><td><strong>Stack<\/strong><\/td><td><strong>Expression<\/strong><\/td><\/tr><tr><td><strong>(<\/strong><\/td><td><strong>(<\/strong><\/td><td><strong> <\/strong><\/td><\/tr><tr><td><strong>A<\/strong><\/td><td><strong>(<\/strong><\/td><td><strong>A<\/strong><\/td><\/tr><tr><td><strong>+<\/strong><\/td><td><strong>(+<\/strong><\/td><td><strong>A<\/strong><\/td><\/tr><tr><td><strong>B<\/strong><\/td><td><strong>(+<\/strong><\/td><td><strong>A   B<\/strong><\/td><\/tr><tr><td><strong>)<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AB+<\/strong><\/td><\/tr><tr><td><strong>–<\/strong><\/td><td><strong>–<\/strong><\/td><td><strong>AB+<\/strong><\/td><\/tr><tr><td><strong>C<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AB+ C-<\/strong><\/td><\/tr><tr><td><strong><\/strong><\/td><td><strong><\/strong><\/td><td><strong>AB+C-<\/strong><\/td><\/tr><tr><td><strong>D<\/strong><\/td><td><strong> <\/strong><\/td><td><strong>AB+C-D<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>Postfix:  <\/strong><strong>AB+C-D<\/strong><\/p>\n\n\n\n<p><strong>Check<\/strong><\/p>\n\n\n\n<p><strong>AB+C-D<\/strong><\/p>\n\n\n\n<p><strong>A+B<\/strong><strong> C \u2013 D <\/strong><\/p>\n\n\n\n<p><strong>A+B-C<\/strong><strong> D<\/strong><\/p>\n\n\n\n<p><strong>A+B-CD<\/strong><strong><\/strong><\/p>\n\n\n\n<p> <\/p>\n\n\n\n<p>Q3. Transform each of the following expressions to infix form:<\/p>\n\n\n\n<p><strong>          <\/strong>a)<strong>  <\/strong><strong>+ ABC<\/strong><\/p>\n\n\n\n<p><strong>          <\/strong>b)<strong>  <\/strong><strong>–<\/strong><strong> +\/AC^D\/EFG<\/strong><\/p>\n\n\n\n<p>Q4.Transform each of the following expressions to infix form:<\/p>\n\n\n\n<p><strong> <\/strong>a)<strong>  + – ABC<\/strong><\/p>\n\n\n\n<p><strong> <\/strong>b)<strong>  +A-BC<\/strong><\/p>\n\n\n\n<p>c)<strong>  +-\/ACD^EFG<\/strong><\/p>\n\n\n\n<p>Q5. Transform each of the following expressions to infix form:<\/p>\n\n\n\n<p><strong> <\/strong>a)<strong>  + – ABC<\/strong><\/p>\n\n\n\n<p><strong> <\/strong>b)<strong>  +A-BC<\/strong><\/p>\n\n\n\n<p>c)<strong>  <\/strong><strong>+-\/<\/strong><strong>ACD^EFG<\/strong><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">JAC 12th Computer Science #Test 08 \/08\/2020<\/h4>\n\n\n\n<p><strong>Objective Type Questions:<\/strong><\/p>\n\n\n\n<p>1.<strong>Data structure stack is also known as \u2026\u2026\u2026\u2026list<\/strong>.<\/p>\n\n\n\n<p>(i) First In First Out<\/p>\n\n\n\n<p>(ii) First In Last Out<\/p>\n\n\n\n<p class=\"has-very-dark-gray-color has-text-color\">(iii) <strong><em>Last In First Out<\/em><\/strong><\/p>\n\n\n\n<p>(iv) All of these<\/p>\n\n\n\n<p>2. <strong>Data Structure Queue is also known as \u2026\u2026\u2026.list<\/strong>.<\/p>\n\n\n\n<p class=\"has-very-dark-gray-color has-text-color\">(i) <strong><em>First In First Out<\/em><\/strong><\/p>\n\n\n\n<p>(ii) First In Last Out<\/p>\n\n\n\n<p>(iii) Last In First Out<\/p>\n\n\n\n<p>(iv) All of these<\/p>\n\n\n\n<p>3.I<strong>n a Stack, all insertions take place at\u2026\u2026\u2026.end(s)<\/strong>.<\/p>\n\n\n\n<p> (i)<strong><em> Top<\/em><\/strong><\/p>\n\n\n\n<p>(ii) Front<\/p>\n\n\n\n<p>(iii) Rear<\/p>\n\n\n\n<p>(iv) Any<\/p>\n\n\n\n<p>4.<strong>In a Queue, all insertions take place at\u2026\u2026\u2026.end(s)<\/strong>.<\/p>\n\n\n\n<p> (i) Front<\/p>\n\n\n\n<p>(ii) Top<\/p>\n\n\n\n<p>(iii) <strong><em>Rear<\/em><\/strong><\/p>\n\n\n\n<p>(iv) Any<\/p>\n\n\n\n<p>5.<strong>In a Queue, deletions take place at\u2026\u2026\u2026.end(s)<\/strong>.<\/p>\n\n\n\n<p> (i) <strong><em>Front<\/em><\/strong><\/p>\n\n\n\n<p>(ii) Top<\/p>\n\n\n\n<p>(iii) Rear<\/p>\n\n\n\n<p>(iv) Any<\/p>\n\n\n\n<p>6.<strong>In a Stack, deletions take place at\u2026\u2026\u2026.end<\/strong>.<\/p>\n\n\n\n<p> (i) Front<\/p>\n\n\n\n<p>(ii) <strong><em>Top<\/em><\/strong><\/p>\n\n\n\n<p>(iii) Rear<\/p>\n\n\n\n<p>(iv) Any<\/p>\n\n\n\n<p>7.<strong>The term Push and Pop are related to<\/strong><\/p>\n\n\n\n<p> (i)Queue<\/p>\n\n\n\n<p> (ii)<strong><em>Stack<\/em><\/strong><\/p>\n\n\n\n<p> (iii)Both<\/p>\n\n\n\n<p> (iv)None<\/p>\n\n\n\n<p>8.<strong>Choose correct output for the following sequence of operations(* signifies top)<\/strong><\/p>\n\n\n\n<p>Pust(5),Pust(8),Pop,Pust(2),Pust(5),Pop,Pust(1),<\/p>\n\n\n\n<p> (i)8 5 2 5 <strong><em>1<\/em><\/strong><\/p>\n\n\n\n<p> (ii)8 5 52 <strong><em>1<\/em><\/strong><\/p>\n\n\n\n<p> (iii)2 5 5<strong><em>1<\/em><\/strong><\/p>\n\n\n\n<p> (iv)<strong>5 2 1<\/strong><\/p>\n\n\n\n<p>9.<strong>In which data structure element is inserted at one end called Rear and deleted at other end called Front.<\/strong><\/p>\n\n\n\n<p> (i)Stack<\/p>\n\n\n\n<p> (ii)<strong><em>Queue<\/em><\/strong><\/p>\n\n\n\n<p> (iii)Both<\/p>\n\n\n\n<p> (iv)Tree<\/p>\n\n\n\n<p>10.<strong>Insertion and Deletion operations in queue are known as ……………<\/strong><\/p>\n\n\n\n<p> (i)Push and Pop<\/p>\n\n\n\n<p> (ii)<strong><em>Enqueue and Dequeue<\/em><\/strong><\/p>\n\n\n\n<p> (iii)Insert and Delete <\/p>\n\n\n\n<p> (iv)None<\/p>\n\n\n\n<p>11.<strong>…………Form the access is used to add and remove nodes from a queue.<\/strong><\/p>\n\n\n\n<p> (i)LIFO, Last In First Out<\/p>\n\n\n\n<p> (ii)<strong><em>FIFO, First In First Out<\/em><\/strong><\/p>\n\n\n\n<p> (iii)Both (a) and (b)<\/p>\n\n\n\n<p> (iv)None of these<\/p>\n\n\n\n<p>12.<strong>…………form of access is used to add\/remove nodes from a stack.<\/strong><\/p>\n\n\n\n<p> (i)<strong><em>LIFO<\/em><\/strong><\/p>\n\n\n\n<p> (ii)FIFO<\/p>\n\n\n\n<p> (iii)Both (a) and (b)<\/p>\n\n\n\n<p> (iv)None of these<\/p>\n\n\n\n<p>13.<strong>Stack follows the strategy of ………………<\/strong><\/p>\n\n\n\n<p> (i)<strong><em>LIFO<\/em><\/strong><\/p>\n\n\n\n<p> (ii)FIFO<\/p>\n\n\n\n<p> (iii)LRU<\/p>\n\n\n\n<p> (iv)Random<\/p>\n\n\n\n<p>14.<strong>Which of the following is an application of stack?<\/strong><\/p>\n\n\n\n<p> (i)Finding Factorial <\/p>\n\n\n\n<p> (ii)Reversing of a a string<\/p>\n\n\n\n<p> (iii) Infix to Postfix<\/p>\n\n\n\n<p>(iv)<strong><em>All of the above<\/em><\/strong><\/p>\n\n\n\n<p>15.<strong>When a stack, implemented as an array\/list of fixed size, is full and no new element can be accommodated, it is called an…………….<\/strong><\/p>\n\n\n\n<p> (i)<strong><em>OVERFLOW<\/em><\/strong><\/p>\n\n\n\n<p> (ii)UNDERFLOW<\/p>\n\n\n\n<p> (iii) EXTRANFLOW<\/p>\n\n\n\n<p>(iv)NOFLOW<\/p>\n\n\n\n<p>16.<strong>When a stack is empty and an element’s deletion is tried from the stack , it is called an…………….<\/strong><\/p>\n\n\n\n<p> (i)OVERFLOW<\/p>\n\n\n\n<p> (ii)<strong><em>UNDERFLOW<\/em><\/strong><\/p>\n\n\n\n<p> (iii) EXTRANFLOW<\/p>\n\n\n\n<p>(iv)NOFLOW<\/p>\n\n\n\n<p>17.<strong>If a user tries to remove an element from empty queue, it is called an…………….<\/strong><\/p>\n\n\n\n<p> (i)<strong><em>Underflow<\/em><\/strong><\/p>\n\n\n\n<p> (ii)Empty collection<\/p>\n\n\n\n<p> (iii)Overflow<\/p>\n\n\n\n<p>(iv)Garbage Collection<\/p>\n\n\n\n<p>18.<strong>Pushing an element into stack already having five elements and stack has fixed size of 5 , then …………….occurs.<\/strong><\/p>\n\n\n\n<p> (i)<strong><em>Overflow<\/em><\/strong><\/p>\n\n\n\n<p> (ii)Cash<\/p>\n\n\n\n<p>(iii)Underflow <\/p>\n\n\n\n<p>(iv)User flow<\/p>\n\n\n\n<p>19.<strong>What is the term for inserting into a full queue known as ?<\/strong><\/p>\n\n\n\n<p> (i)<strong><em>Overflow<\/em><\/strong><\/p>\n\n\n\n<p> (ii)Cash<\/p>\n\n\n\n<p>(iii)null pointer exception<\/p>\n\n\n\n<p>(iv)program won’t be compiled<\/p>\n\n\n\n<p>20.<strong>A queue in which elements get added in empty area in the front of a queue is called…………..<\/strong><\/p>\n\n\n\n<p> (i)Full queue<\/p>\n\n\n\n<p> (ii)<strong><em>Circular queue<\/em><\/strong><\/p>\n\n\n\n<p>(iii)rounded queue<\/p>\n\n\n\n<p>(iv)rotated queue<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Data Structure Important Objective Questions\|Class 12th\|Stack & Queue Objective \| #ErAmrendraMehta \|\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/qiYfi320RHY?start=19&feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h5 class=\"wp-block-heading\">JAC 12th Computer Science #Test 07 \/08\/2020<\/h5>\n\n\n\n<p> Q1. <strong>Evaluate the following postfix expression using a stack and show the contents of  stack after execution  of each operation:<\/strong><\/p>\n\n\n\n<p>          <strong>300, 10, 30, +, 20, , +<\/strong><\/p>\n\n\n\n<p><strong>Answer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Sl. No<\/strong><\/td><td><strong>Stack<\/strong><\/td><td><strong>Output<\/strong><\/td><\/tr><tr><td><strong>1<\/strong><\/td><td><strong>300<\/strong><\/td><td><strong>300<\/strong><\/td><\/tr><tr><td><strong>2<\/strong><\/td><td><strong>10<\/strong><\/td><td><strong>300,10<\/strong><\/td><\/tr><tr><td><strong>3<\/strong><\/td><td><strong>30<\/strong><\/td><td><strong>300,10,30<\/strong><\/td><\/tr><tr><td><strong>4<\/strong><\/td><td><strong>+<\/strong><\/td><td><strong>300,40<\/strong><\/td><\/tr><tr><td><strong>5<\/strong><\/td><td><strong>20<\/strong><\/td><td><strong>300,40,20<\/strong><\/td><\/tr><tr><td><strong>6<\/strong><\/td><td><strong><\/strong><\/td><td><strong>300,800<\/strong><\/td><\/tr><tr><td><strong>7<\/strong><\/td><td><strong>+<\/strong><\/td><td><strong>1100<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>Output= 1100<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"JAC 12th Computer Science VVI important Questions l VVI Questions Computer \|ErAmrendraMehta \| 12th\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/yGTay8YuSuo?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<p>Q2. Evaluate the following postfix expression using a stack and show the contents of  stack after execution  of each operation:<\/p>\n\n\n\n<p>          <strong>500, 20, 30, 10, , +<\/strong><\/p>\n\n\n\n<p>Q3. Evaluate the following postfix expression using a stack and show the contents of  stack after execution  of each operation:<\/p>\n\n\n\n<p>          <strong>120, 45, 20, +, 25, 15,-, +,<\/strong><\/p>\n\n\n\n<p><strong>Answer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Sl. No<\/strong><\/td><td><strong>Stack<\/strong><\/td><td><strong>Output<\/strong><\/td><\/tr><tr><td><strong>1<\/strong><\/td><td><strong>120<\/strong><\/td><td><strong>120<\/strong><\/td><\/tr><tr><td><strong>2<\/strong><\/td><td><strong>45<\/strong><\/td><td><strong>120,45<\/strong><\/td><\/tr><tr><td><strong>3<\/strong><\/td><td><strong>20<\/strong><\/td><td><strong>120,45,20<\/strong><\/td><\/tr><tr><td><strong>4<\/strong><\/td><td><strong>+<\/strong><\/td><td><strong>120,65<\/strong><\/td><\/tr><tr><td><strong>5<\/strong><\/td><td><strong>25<\/strong><\/td><td><strong>120,65,25<\/strong><\/td><\/tr><tr><td><strong>6<\/strong><\/td><td><strong>15<\/strong><\/td><td><strong>120,65,25,15<\/strong><\/td><\/tr><tr><td><strong>7<\/strong><\/td><td><strong>–<\/strong><\/td><td><strong>120,65,10<\/strong><\/td><\/tr><tr><td><strong>8<\/strong><\/td><td><strong>+<\/strong><\/td><td><strong>120,75<\/strong><\/td><\/tr><tr><td><strong>9<\/strong><\/td><td><strong><\/strong><\/td><td><strong>9000<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>Output= 9000<\/strong><\/p>\n\n\n\n<p>Q4. Evaluate the following postfix operation:<strong>AB + C D \/      <\/strong> if<strong>    A=2,B=3,C=4 & D=5 <\/strong>using stack<\/p>\n\n\n\n<p><strong>Answer:<\/strong><\/p>\n\n\n\n<p><strong>                A B + C * D \/<\/strong><\/p>\n\n\n\n<p><strong>Given      2,3,+,4,,5,\/<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Sl. No<\/strong><\/td><td><strong>Stack<\/strong><\/td><td><strong>Output<\/strong><\/td><\/tr><tr><td><strong>1<\/strong><\/td><td><strong>2<\/strong><\/td><td><strong>2<\/strong><\/td><\/tr><tr><td><strong>2<\/strong><\/td><td><strong>3<\/strong><\/td><td><strong>2,3<\/strong><\/td><\/tr><tr><td><strong>3<\/strong><\/td><td><strong>+<\/strong><\/td><td><strong>5<\/strong><\/td><\/tr><tr><td><strong>4<\/strong><\/td><td><strong>4<\/strong><\/td><td><strong>5,4<\/strong><\/td><\/tr><tr><td><strong>5<\/strong><\/td><td><strong><\/strong><\/td><td><strong>20<\/strong><\/td><\/tr><tr><td><strong>6<\/strong><\/td><td><strong>5<\/strong><\/td><td><strong>20,5<\/strong><\/td><\/tr><tr><td><strong>7<\/strong><\/td><td><strong>\/<\/strong><\/td><td><strong>4<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>   Output=4<\/strong><\/p>\n\n\n\n<p>Q5. Evaluate the following postfix expression using a stack and show the contents of  stack after execution  of each operation:<\/p>\n\n\n\n<p>          <strong>120, 45, 20, +, 25, 15,-, +,<\/strong><strong><\/strong><\/p>\n\n\n\n<p><strong>Answer:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Sl. No<\/strong><\/td><td><strong>Stack<\/strong><\/td><td><strong>Output<\/strong><\/td><\/tr><tr><td><strong>1<\/strong><\/td><td><strong>120<\/strong><\/td><td><strong>120<\/strong><\/td><\/tr><tr><td><strong>2<\/strong><\/td><td><strong>45<\/strong><\/td><td><strong>120,45<\/strong><\/td><\/tr><tr><td><strong>3<\/strong><\/td><td><strong>20<\/strong><\/td><td><strong>120,45,20<\/strong><\/td><\/tr><tr><td><strong>4<\/strong><\/td><td><strong>+<\/strong><\/td><td><strong>120,65<\/strong><\/td><\/tr><tr><td><strong>5<\/strong><\/td><td><strong>25<\/strong><\/td><td><strong>120,65,25<\/strong><\/td><\/tr><tr><td><strong>6<\/strong><\/td><td><strong>15<\/strong><\/td><td><strong>120,65,25,15<\/strong><\/td><\/tr><tr><td><strong>7<\/strong><\/td><td><strong>–<\/strong><\/td><td><strong>120,65,10<\/strong><\/td><\/tr><tr><td><strong>8<\/strong><\/td><td><strong>+<\/strong><\/td><td><strong>120,75<\/strong><\/td><\/tr><tr><td><strong>9<\/strong><\/td><td><strong><\/strong><\/td><td><strong>9000<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>Output= 9000<\/strong><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h5 class=\"wp-block-heading\">What is the D<strong>ifference Between Stack and Queue<\/strong><\/h5>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Stack<\/strong><\/td><td><strong>Queue<\/strong><\/td><\/tr><tr><td>1. It is a collection of elements that follows Last In First Out (LIFO) order.<\/td><td><strong>1.  <\/strong>It is a collection of elements that follows First In First Out (FIFO) order.<\/td><\/tr><tr><td>2. In Stack insertion and deletion is performed from same End called \u2018Top\u2019.<\/td><td>2. In Queue insertion and deletion is performed from different end called \u2018Rear\u2019 and \u2018Front\u2019.<\/td><\/tr><tr><td>3. Top is incremented by one when the new element is inserted and this term is known as PUSH.<\/td><td>3.  Rear is incremented by one when the new element is inserted and this term is known as Enqueue.<\/td><\/tr><tr><td>4. Top is Decremented by one when an element is deleted and this term is known as POP.<\/td><td>4.  Front is incremented by one when an element is deleted and this term is known as Dequeue.<\/td><\/tr><tr><td>5. A collection of dinner plates at a wedding Party is an example of stack.<\/td><td>5.People standing for boarding a bus is an example of Queue.<\/td><\/tr><tr><td> Diagram….<\/td><td> <\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"C++ Program to Represent Stack as an Array \| Implementation of stack using Array in C++\|Stack in C++\" width=\"810\" height=\"456\" src=\"https:\/\/www.youtube.com\/embed\/pT9wL9bv5SQ?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<p><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2022\/08\/07\/hello-world\/\">12th Computer Science Important Program<\/a><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">C++ Programming <\/h4>\n\n\n\n<p><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/c-programming-language-tutorial\/\">C++ Programming Language Tutorial<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/translators-in-programming-languages\/\">Translators in Programming languages<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/tokens-in-c-programming-language\/\">Tokens in C++ Programming Language<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/operators-in-c-programming-language\/\">Operators in C++ Programming Language<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/conditional-statements-in-c-language\/\">Conditional statements in C++ Language<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/18\/switch-statement-in-c-language\/\">Switch Statement in C++ Language<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/loops-iteration-statement-in-c-language\/\">Loops \/ Iteration statement in C++ Language<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/jump-statements-in-c-with-best-example\/\">Jump statements in C++ with best example<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/arrays-in-c-programming-language\/\">Arrays in C++ Programming Language<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/functions-in-c-programming-language-2\/\">Functions in C++ Programming Language<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/passing-arguments-in-functions\/\">Passing Arguments in Functions<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/method-function-overloading-in-c\/\">Method \/ Function overloading in C++<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/23\/string-functions-in-c-with-example\/\">String Functions in C++ with Example<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/10\/character-handling-functions-in-c-with-example\/\">Character Handling Functions in C++ with Example<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/12\/how-to-create-own-header-file-in-c-with-example\/\">How to create own Header File in C++ with example<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/12\/console-input-output-in-c-with-example\/\">Console Input Output in C++ with Example<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/12\/class-and-object-in-c-programming-best-concept\/\">Class and Object in C++ Programming Best concept<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/concept-of-object-oriented-programming-in-c\/\">Concept of Object Oriented Programming in C++<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/c-development-environment-setup-with-vs-code\/\">C++ Development Environment Setup with VS Code<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/constructor-and-destructor-in-c-with-example\/\">Constructor and Destructor in C++ with Example<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/inheritance-in-c-with-example-program\/\">Inheritance in C++ with Example Program<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/friend-function-and-friend-class-in-c-with-example\/\">Friend Function and Friend Class in C++ with example<\/a><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Data Structure <\/h4>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/data-structure-class-12th-computer-science-best-concept\/\">Data Structure class 12th Computer Science Best Concept<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/stack-data-structure-in-cintroduction-algorithm-program\/\">Stack Data structure in C++(Introduction, Algorithm, Program)<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/02\/13\/queue-data-structure-in-c-best-example\/\">Queue Data structure in C++ Best example<\/a><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Boolean Algebra<\/h4>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/introduction-to-boolean-algebra-best-concepts\/\">Introduction to Boolean Algebra- Best concepts<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/important-law-of-boolean-algebra-with-best-concepts\/\">Important Law of Boolean algebra with Best concepts<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/logic-gates-and-their-types-best-concept\/\">Logic Gates and their types -Best Concept<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/de-morgrans-law-and-their-applications\/\">De Morgan\u2019s Law and their Applications<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/applications-of-boolean-algebra-in-computer-science\/\">Applications of Boolean Algebra in Computer Science<\/a><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">DBMS<\/h4>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/introduction-to-dbms-database-management-system\/\">Introduction to DBMS \| Database Management System<\/a><\/p>\n\n\n\n<p><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Communication and Network Concept<\/h4>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2023\/01\/08\/introduction-to-communication-and-networks\/\">Introduction to Communication and Networks<\/a><\/p>\n\n\n\n<h4 class=\"wp-block-heading\">11th Computer Science<\/h4>\n\n\n\n<p><a href=\"https:\/\/aipsacademy.com\/blogs\/2022\/08\/21\/c-basic-program-for-11th-computer-science\/\">C++ Basic Program for 11th Computer Science<\/a><\/p>\n\n\n\n<p>To be continued… Please check daily for more updates..<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this , I am going to provide and practice JAC 12th Computer Science vvi important Questions 2023. It will will be very helpful to all those students who are going to appear JAC examination 2023. Lets begin. COMPUTER SCIENCE XII 2023 Choose the correct alternative for the following:                       2*35=70 C++ is a\/an \u2026\u2026\u2026\u2026Language. […]<\/p>\n","protected":false},"author":1,"featured_media":274,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,9,8],"tags":[],"class_list":["post-272","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-12th-computer-science","category-cbse-12th-computer-science","category-jac-12th-computer-science"],"_links":{"self":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/272","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/comments?post=272"}],"version-history":[{"count":60,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/272\/revisions"}],"predecessor-version":[{"id":561,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/272\/revisions\/561"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media\/274"}],"wp:attachment":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media?parent=272"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/categories?post=272"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/tags?post=272"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}