#1
14th November 2014, 10:49 AM
| |||
| |||
Previous year computer science solved question papers?
From where I can get the previous year computer science solved question papers of class 12th will you please provide me that??????????
|
#2
14th November 2014, 02:02 PM
| |||
| |||
Re: Previous year computer science solved question papers?
As you want to get the previous year computer science solved question papers of class 12th so, here I am providing you the same. ![]() ![]() ![]() ![]() ![]() Here is an attachment for the previous year computer science solved question papers you can download that. Here for you I am providing you the syllabus of the Computer Science: Syllabus: UNIT 1: OBJECT ORIENTED PROGRAMMING WITH PYTHON (50 theory + 41 practical) periods REVIEW: Python covered in class XI Concept of Object Oriented Programming: Data Hiding , Data Encapsulation, Class and object, polymorphism, inheritance, advantages of Object Oriented Programming over earlier programming methodologies Classes: Defining classes(attributes,methods),creating instance objects, accessing attributes and methods, using built in class attributes (dict,doc,name,module,bases), constructor(_ _init()_ _), _ _del()_ _ and _ _str()_ _ methods in a class, private attributes, importance of self, operator overloading with methods Inheritance: Concept of base class and derived class, Single, mutilevel and multiple inheritance – overriding methods, using super() in derived class to invoke _ _init()_ _ or overrriden methods of parent class UNIT 2: ADVANCE PROGRAMMING IN PYTHON (42 theory + 35 practical) periods Linear List Manipulation: Sequential allocation and address calculation, traversal, insertion of an element in assorted list, deletion of an element from the list, searching (linear, binary), sorting (insertion, selection, bubble) Stacks (List Implementation): introduction to stack (LIFO operation), operations on stack (PUSH and POP) and its implementation in Python Converting expressions from infix to postfix notation and evaluation of postfix expression Queues (List implementation) – introduction to Queue (FIFO) operations on Queue (INSERT and DELETE) and its implementation in Python Data File: Need for data file ,types of data file –text and binary, Opening and closing files – open(), close(), file object, access modes (output,input,default), reading and writing a file read(), readline(), readlines(), write(), file positions (seek(), tell()), renaming and deleting a file, writelines(), flush(), Implementation of basic file operations on text and binary file in Python: creating/writing data into file, reading and displaying data from file, searching for particular data from a file, insertion and deletion of data from an already existing file, modification of data in file 195 Errors and Exceptions - NameError, IndexError, Typeerror, IOError, ImportError, ValueError, EOFError. Generator Function using yield UNIT 3: DATABASES AND SQL (20 Theory + 20 Practical) Periods Data base Concepts: Introduction to data base concepts and its need. Relational data model: Concept of domain, tuple, relation, key, primary key, alternate key, candidate key; Relational algebra: Selection, Projection, Union and Cartesian product; Structured Query Language: General Concepts: Advantages of using SQL, Data Definition Language and Data Manipulation Language; Data Types: NUMBER/DECIMAL, CHARACTER/VARCHAR/VARCHAR2, DATE; SQL COMMANDS:CREATE TABLE, DROP TABLE, ALTER TABLE, UPDATE ….SET…., INSERT, DELETE; SELECT, DISTINCT, FROM, WHERE, IN, BETWEEN, GROUPBY, HAVING, ORDERBY; SQL functions: SUM, AVG, COUNT, MAX AND MIN; Obtaining results (SELECT query) from 2 tables using equi-join and Union Note: Implementation of the above mentioned commands could be done on any SQL supported software onone or two tables. UNIT 4: BOOLEAN ALGEBRA (16 Theory + 0 Practical) Periods Role of Logical Operations in Computing. Binary-valued Quantities, Boolean Variable, Boolean Constant and Boolean Operators: AND, OR, NOT; Truth Tables; Closure Property, Commutative Law, Associative Law, Identity law, Inverse Law, Principle of Duality, Idem potent Law, Distributive Law, Absorption Law, Involution Law, DeMorgan's Law and their applications; Obtaining Sum of Product (SOP) and Product of Sum (POS) form from the Truth Table, Reducing Boolean Expression (SOP and POS) to its minimal form, Use of Karnaugh Map for minimization of Boolean expressions (up to 4 variables); Application of Boolean Logic: Digital electronic circuit design using basic Logic Gates (NOT, AND, OR, NAND, NOR) Use of Boolean operators (AND, OR) in search engine queries. UNIT 5: COMMUNICATION TECHNOLOGIES (16 Theory + 0 Practical) Periods Evolution of Networking: ARPANET, Internet, Interspace Different ways of sending data across the network with reference to switching techniques (Circuit and Packet switching); Data Communication terminologies: Concept of Channel, Bandwidth (Hz, KHz, MHz) and Data transfer rate (bps, kbps, Mbps, Gbps, Tbps); 196 Transmission media: Twisted pair cable, coaxial cable, optical fiber, infrared, radio link, microwave link and satellite link; Network devices: Modem, RJ45 connector, Ethernet Card, Router, Repeater, Switch, Gateway, wifi card; Network Topologies and types: Bus, Star, Tree, PAN, LAN, WAN, MAN; Network Protocol: TCP/IP, File Transfer Protocol (FTP), PPP, SMTP, POP3, Remote Login (Telnet), Internet Wireless/Mobile Communication protocol such as GSM, CDMA, GPRS, WLL, Mobile Telecommunication Technologies: 1G, 2G, 3G and 4G Protocols for Chat and Video Conferencing VOIP Wireless technologies such as Wi-Fi and WiMax Network Security Concepts: Threats and prevention from Viruses, Worms, Trojan horse, Spams Use of Cookies, Protection using Firewall; India IT Act, Cyber Law, Cyber Crimes, IPR issues, Hacking; Introduction To Web services: WWW, Hyper Text Markup Language (HTML), eXtensible Markup Language (XML); Hyper Text Transfer Protocol (HTTP); Domain Names; URL; Website, Web browser, Web Servers; Web Hosting, Web Scripting - Client side (VB Script, Java Script, PHP) and Server side (ASP, JSP, PHP), Web 2.0 (for social networking) Class XII (Practicals) – Python Duration: 3 hours Total Marks: 30 1. Programming in Python 12 One programming problem in Python to be developed and tested in Computer during the examination. Marksare allotted on the basis of following: Logic : 7 Marks Documentation/Indentation : 2 Marks Output presentation : 3 Marks Notes: The types of problems to be given will be of application type from the following topics • String • Lists/Tuples • Dictionary • File Operations 2. SQL Commands 05 Five Query questions based on a particular Table/Reaction to be tested practically on Computer during theexamination. The command along with the result must be written in the answer sheet. 3. A digital circuit design (after reduction using K-map) to be given during the examination. The question must be written in the answer sheet 02 4. Project Work 05 The project has to be developed in Python language with Object Oriented Technology. (The project is required to be developed in a group of 2-4 students) 197 • Presentation on the computer • Project report (Listing, Sample, Outputs, Documentation) • Viva 4. Practical File 03+013 Must have minimum 20 programs from the following topics • Lists (general, stack, queue) • Dictionary • Tuple • File Handling • Programs based on Object Oriented Concepts • 15 SQL commands along with the output based on any table/relation 5. Viva Voce 02 Viva will be asked from syllabus covered in class XII and the project developed by student. GUIDELINES FOR PROJECTS (Class XI and XII) 1. Preamble 1.1 The academic course in Computer Science includes one Project in each year. The Purpose behind this isto consolidate the concepts and practices imparted during the course and to serve as a record of competence. 1.2 A group of 2-4 students as team may be allowed to work on one project. 2. Project content 2.1 Project for class XI can be selected from the topics mentioned in the syllabus or domains on the similarlines. 2.2 Project for class XII should ensure the coverage of following areas of curriculum: a. Problem Solving b. Object Oriented Programming in Python c. File Handling Theme of the project can be • Any Scientific or a fairly complex algorithmic situation • Quizzes/Games • Tutor/Computer Aided Learning Systems 2.3 The aim of the project is to highlight the abilities of algorithmic formulation, modular programming, systematic documentation and other associated aspects of software development. 2.4 The assessment would be through the project demonstration and the Project Report, which should portrayProgramming Style, Structured Design, Minimum Coupling, High Cohesion, Good documentation of thecode to ensure readability and ease of maintenance. OR 1 mark is for innovating while developing programmes. 198 Class XII (Theory) - C++ Duration: 3 hours Total Marks: 70 Unit No. Unit Name Marks 1. OBJECT ORIENTED PROGRAMMING IN C++ 30 2. DATA STRUCTURE 14 3. DATABASE MANAGEMENT SYSTEM AND SQL 8 4. BOOLEAN ALGEBRA 8 5. COMMUNICATION TECHNOLOGIES 10 |
|