Assignment 3 Class XII (Computer Science 083) Topic Array
|
|
- Jerome Hubbard
- 5 years ago
- Views:
Transcription
1 Assignment 3 Class XII (Computer Science 083) Topic Array 1. What is meant by base address of an array? 2. What are the preconditions for Binary Search to be performed on a single dimension array? 3. Calculate the address X[4,3] in a two dimensional array X[1.5, 1..4] stored in row major order in the main memory. Assume the base address to be 1000 and that each element requires 4 words of storage. 4. Given a two dimensional array A[10][20], base address of A being 100 and width of each element is 4 bytes, find the location of A[8][15], when the array is stored as a) Column Major b) Row Major. 5. Each element of an array A[ , ] requires 1 byte of storage. If the array is stored in column major order beginning location 500, determine the location of A[0,30]. 6. Each element of an array A[ , ] requires 1 byte of storage. If the array is stored in row major order beginning location 1000, determine the location of A[0,40]. 7. If 2 dimensional array C[5..10, -5..9] is stored using row major representation, then calculate the address if C[8,-2], if the base address is 10 and each array element requires 2 bytes of memory. 8. The following numbers: (25, 64, 48, 15, 34, 91, 88) are required to be sorted using a)selection Sort b) Insertion Sorts c) Bubble Sort, show how the list would appear at the end of each pass. 9. Write a program to display those elements of a two dimensional array T[4][4] which are divisible by Write a user defined function in c++ to find and display the sum of both the diagonals elements of a two dimensional array MATRIX[6][6] containing integers. 11. Write a menu driven program in C++ which will take 10 number and then sort the numbers using any sorting method of users choice like a) Insertion b) Selection c) Bubble. 12. Suppose A,B and C are arrays of size 8,9 and 17 respectively. Array A is stored in ascending order and array B is in descending order. WAP to produce a third array C, containing all the data of array s A and B in ascending order. 13. Given two arrays A and B, copy last five elements of B after first five elements of A to create another array C. Assume length of A and B is greater than five. 14. Write a C++ function (using most efficient searching method) to search for an item X in a sorted array of integers. 15. Given an array A[50] with base address 300 and element size 4 bytes. Find the address of A[10], A[25] and A[40] 16. Given an array named A with the following elements: 3, -5, 1, 3, 7, 0, -15, 3, -7, -8 write a c++ function to shift the negative to left and positive numbers to right so that the resultant array will look like: -5, -15, -7, -8, 3, 1, 3, 7, 0, Write a program in C++ to interchange the values of the row and column. 18. Write a program in C++ to find the inverse of the matrix.
2 Assignment 6 Class XII (Computer Science 083) Topic Stack and Queues 1. Define a) Stack b) Queues 2. What is the difference between LIFO list and FIFO list? 3. What is the application of a) Stack b) Queue 4. What is the order of evaluations of arithmetic operator s? 5. What is the situation called when Deletion is attempted in an empty list? 6. What is the situation called when Insertion is attempted in a full list? 7. Given a stack as an array of 7 elements STACK: K, P, S, T, U, Y, B a) When will overflow and underflow occur? b) Can K be deleted before S, Why? 8. Write a menu driven program to Push, Pop and see the contents of stack (implementing array). 9. Write a menu driven program to Insert, delete and see the contents of queue (implementing array). 10. What is the difference between a general queue and the circular queue in the case of arrays? What is the advantage of circular queue and disadvantage of general queue? 11. Define a LINKED LIST. 12. What is the difference between STATIC and DYNAMIC Memory. 13. Write a menu driven program to Insert, delete and see the contents of stack (implementing linked list). 14. Write a menu driven program to Insert, delete and see the contents of queue (implementing linked list). 15. Distinguish between infix, prefix and postfix algebraic expressions giving examples of each. 16. Convert the following infix to postfix expression a) (A B) * (C / D) + E b) X + Y * Z ^ P - (X / Y + Z) c) A ^ B P / (Q * (A C + P * D) / B) d) A + B + C * D F G 17. Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation. a) t, f, t, f, NOT, OR, t, OR, OR, AND c) 12, 45, 82, *, d) 7, 87, 3, 2, ^, *, +, 15, 6, /, 8, +, d) 160, 6, 7, *, 4, 8, +, *, e) A + B * C + D * N ^ E / G H f) 60, 5, 9, /, 3, 8, +, *, 18. Define a) Singly Linked List b) Doubly Linked List c) Circular Linked List d) Dequeues 19. For a circular queue with 5 memory locations show diagrammatically the status of the front and rear after each of the following operations: i) 5, 4 and 3 inserted ii) 5 deleted iii) 9, 11 inserted iv) 4, 3 deleted v) 8, 6 inserted vi) 9 deleted vii) 25, 10 inserted viii) 11,4 deleted ix) 27 inserted x) 25, 10 deleted 20. Consider a queue of size 7 insert name Harsh, Nishu and then delete first name insert Chetan, Ankur, and delete first two names. Show the status of front and rear after each step.
3 Assignment 7 Class XII (Computer Science 083) Topic DBMS and SQL 1. Differentiate between SQL commands a) DROP Table and DROP View. b) Create table and Create View. 2. What is a relation? What is the difference between a tuple and an attribute? 3. Differentiate between DML (Data manipulation language) and DDL (Data definition language). 4. What is data redundancy? What are the problems associated with it? 5. What are the advantages of Relational Data Model? 6. Differentiate between Primary Key and Candidate Key. 7. What will be the precondition for applying Drop Table command? 8. What are the three different levels from the data can be abstracted? Explain all the Differentiate between Projection and Union operation. 10. Write the command to make the table a having following column heading and data types: - Name char(10) dob date roll number(2) sex char(1) best_sub char(9) 11. After entering at-least 10 records in the above table write the commands to: - a) Show the list of tables created earlier. b) Show the heading and their data types from the table a. c) Add a new column hobby having data type char and width 9. d) Add cooking in the hobby column for sex female. e) Add reading in the hobby column for sex male. f) Make a backup of table a by name b. g) Make a backup of table a by name c without best_sub column. h) Insert a new row in table as Srijan, 19/11/1987, 12, m, comp, reading. i) Remove the table c. j) Remove only those rows whose name starts with the character H. k) Delete all the rows of table b. l) Show the contents of name, roll and hobby column from table a. m) Show the contents of name and best subject of female students. n) Show the contents of name, hobby, date of birth and sex of female students or whose date of birth is less than o) Show the entire information of all the female students whose name starts with the character N. p) Show the entire information of all the male students whose name not starts with the character N. q) Display the list of best subject. r) Display the name, roll and hobby of those students whose roll is more than five and less than 10. (Without and with and command) s) Show the entire information of Nishu, Chetan and Harsh from the table.
4 t) Make two table Khushi and Snehal from table a. Table Khushi contains Roll, Name and date of birth while table Snehal contains Roll, Sex, Best Subject and Hobby columns. u) Delete the table a. v) Display Roll, Name, Sex, Date of birth, Best Subject and Hobby by combining the table Khushi and Snehal. w) Show Name and Sex from the table (Khushi and Snehal) by arranging the name in descending order Guess the output of the SQL commands based from the table Anu given below: - Roll Name Sex Phy Chem Comp. Total 10 Nishu F Anshu F Neha F Chetan M Harsh M Pupul M Ankur M Preety F Snehal F Anuradha F Gourav M Before guessing the output please fill the total column using the suitable command x) Select avg(comp) from anu; y) Select max(phy+chem+math) from anu; z) Select name, max(total) from anu group by name; aa) Select name, max(total) from anu group by sex; bb) Select name, max(total) from anu group by total; cc) Select name, sex, max(total) from anu group by sex; dd) Select name, sex, max(total) from anu group by name, sex; ee) Select name, sex, max(total) from anu group by sex, name; ff) Select max(comp) from anu group by chem having chem<60; gg) Select max(comp) from anu group by chem having chem<=60; hh) Select max(comp) from anu group by chem having chem<=70; ii) Select * from anu order by name; jj) Select * from anu order by name, phy; kk) Select * from anu order by phy; ll) Select * from anu order by phy, name desc; mm) Select name, sex from anu group by sex, name; nn) Select phy from anu group by phy; oo) pp) Select distinct (phy) from anu; Select name, total, (total/210)*100 as Percent from anu order by Percent desc.
5 Assignment -8 XII File Handling Comp. 1. What are the different methods of opening a file? Explain in brief. 2. Differentiate between the functions write() and put() of the ostream class. 3. How can the end of file be detected? Explain in brief. 4. Differentiate between the function get(), put() and getline(). 5. How can you send an output to a printer? 6. WAP that counts the number of records in a given file. 7. WAP that appends the contents of one file to another. 8. WAP to add new objects at the bottom of a binary file STUDENT.DAT, assuming the binary file is containing the objects of the following class: - class STUD int Rno; char Name[20]; void enter() cin>>rno; gets(name); void display() cout<<rno<<name<<endl; ; 9. WAP to search for a book number from a binary file BOOK.DAT, assuming the binary file is containing the objects of the following class: - class BOOK int Bno; char title[20]; int Rbno() return Bno; void enter() cin>>bno; gets(title); void display() cout<<bno<<title<<endl; ; 10. WAP that reads 15 bytes from 35 th byte onwards from the file NIBBLE.
6 11. Assuming class OUTSTAND given below, write program to write objects having outamt more than Rs. 10,000 into CRITICAL file. class OUTSTAND int memno; float outamt; void getit() cin>>memno>>outamt; void putit() cout<<memno<<outamt; float getamt() return outamt; ; 12. Differentiate between ifstream class and outstream class. 13. Assuming the class STOCK, write program to perform following: - a) Write the objects of STOCK to a binary file. b) Read the objects of STOCK from binary file and display them on screen. class STOCK int ITNO; char ITEM[10]; void GETIT() cin>>itno; gets(item); void SHOWIT() cout<<itno<<item<<endl; ; 14. Explain the difference between put and write function. 15. Explain the difference between get and read function. 16. Why binary file is better than text file? 17. Explain seekg(), seekp(), tellg() and tellp() using suitable example for each. 18. WAP to count the number of lines present in a text file STORY.TXT. 19. WAP that reads a character from the keyboard one by one. All lower case characters get stored in a file LOWER, All upper case characters get stored in a file UPPER and all other characters get stored in the file OTHER. S.K.Jha (Faculty of Computer Science DAV) Sweet and Sour with Files
Sample Question Paper
Scheme - I Sample Question Paper Marks : 70 Time: 3 Hrs. Q.1) Attempt any FIVE of the following. 10 Marks a. Write any four applications of data structure. b. Sketch the diagram of circular queue. c. State
More informationSPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session
SPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session 2008-09 Sr.No. Duration Number of Working Days From To Topic to be Covered Nos. of Periods required CAL/TAL
More informationList of Practical for Class XII Computer Science
List of Practical for Class XII Computer Science P.01. Write a complete C++ program to define class Garment with following description: Private members: Code - type string Type - type string Size - type
More informationDATA STRUCTURE : A MCQ QUESTION SET Code : RBMCQ0305
Q.1 If h is any hashing function and is used to hash n keys in to a table of size m, where n
More informationBharati Vidyapeeth s College Of Engineering for Women Pune-43 Department E & TC. SE- Unit Test I Subject-DS
Bharati Vidyapeeth s College Of Engineering for Women Pune-43 SE- Unit Test I Subject-DS Date: 25/02/2010 Q-1 a) What is sorting? State different types of sorting and write a function in C to implement
More informationR10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May
www.jwjobs.net R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 *******-****** 1. a) Which of the given options provides the
More informationCode No: R Set No. 1
Code No: R05010106 Set No. 1 1. (a) Draw a Flowchart for the following The average score for 3 tests has to be greater than 80 for a candidate to qualify for the interview. Representing the conditional
More informationFORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE
TED (10)-3071 Reg. No.. (REVISION-2010) Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours (Maximum marks: 100)
More informationLinked List. April 2, 2007 Programming and Data Structure 1
Linked List April 2, 2007 Programming and Data Structure 1 Introduction head A linked list is a data structure which can change during execution. Successive elements are connected by pointers. Last element
More informationDEEPIKA KAMBOJ UNIT 2. What is Stack?
What is Stack? UNIT 2 Stack is an important data structure which stores its elements in an ordered manner. You must have seen a pile of plates where one plate is placed on top of another. Now, when you
More informationR13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)
SET - 1 II B. Tech I Semester Supplementary Examinations, May/June - 2016 PART A 1. a) Write a procedure for the Tower of Hanoi problem? b) What you mean by enqueue and dequeue operations in a queue? c)
More informationMULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR
STUDENT IDENTIFICATION NO MULTIMEDIA COLLEGE JALAN GURNEY KIRI 54100 KUALA LUMPUR FIFTH SEMESTER FINAL EXAMINATION, 2014/2015 SESSION PSD2023 ALGORITHM & DATA STRUCTURE DSEW-E-F-2/13 25 MAY 2015 9.00 AM
More informationFundamental of I.T. (c) Application of computer *************
Paper I Fundamental of I.T 1. What is an output device? Discuss the type of output device used in computer. 2. What is Secondary memory? Discuss the type of secondary memory used in computer. 3. Explain
More informationA6-R3: DATA STRUCTURE THROUGH C LANGUAGE
A6-R3: DATA STRUCTURE THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF
More informationEnd-Term Examination Second Semester [MCA] MAY-JUNE 2006
(Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1.
More information17CS33:Data Structures Using C QUESTION BANK
17CS33:Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C Learn : Usage of structures, unions - a conventional tool for handling a group of logically
More information1 P age DS & OOPS / UNIT II
UNIT II Stacks: Definition operations - applications of stack. Queues: Definition - operations Priority queues - De que Applications of queue. Linked List: Singly Linked List, Doubly Linked List, Circular
More informationObjective Questions for Online Practical Exams under CBCS Scheme Subject: Data Structure-I (CS-113)
Objective Questions for Online Practical Exams under CBCS Scheme Subject: Data Structure-I (CS-113) 1. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort (A)
More informationPreface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS
Contents Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS 1.1. INTRODUCTION TO COMPUTERS... 1 1.2. HISTORY OF C & C++... 3 1.3. DESIGN, DEVELOPMENT AND EXECUTION OF A PROGRAM... 3 1.4 TESTING OF PROGRAMS...
More informationCBSE GUESS PAPER. Roll No. Computer Sc. XII(083)/
Roll No. CBSE GUESS PAPER Computer Sc. XII(083)/2011-12 Time Allowed 3 Hours Maximum Marks- 70 General Instructions: (i) All questions are compulsory. (ii) The paper contains 7 questions. (iii) Programming
More informationFORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours
TED (10)-3071 Reg. No.. (REVISION-2010) (Maximum marks: 100) Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours PART
More informationKENDRIYA VIDYALYA CLRI CHENNAI AUTUMN BREAK HOLIDAY HW MARKS QUESTIONS : DATA STRUCTURE
KENDRIYA VIDYALYA CLRI CHENNAI AUTUMN BREAK HOLIDAY HW 8 MARKS QUESTIONS : DATA STRUCTURE. Write a function in C++ which accepts an integer array and its size as arguments and change all the even number
More informationM.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75
(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2012 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section - A Answer any Three of the following (3 15 = 45) 1) Define the
More informationPA3 Design Specification
PA3 Teaching Data Structure 1. System Description The Data Structure Web application is written in JavaScript and HTML5. It has been divided into 9 pages: Singly linked page, Stack page, Postfix expression
More informationSCHOOL OF COMPUTER AND COMMUNICATION ENGINEERING. EKT224: ALGORITHM AND DATA STRUCTURES (Stack, Queue, Linked list)
ASSIGNMENT 2 SCHOOL OF COMPUTER AND COMMUNICATION ENGINEERING EKT224: ALGORITHM AND DATA STRUCTURES (Stack, Queue, Linked list) Date: 30/9/2015 Due Date: 30/10/2015 Early Bird Date: 23/10/2015 QUESTION
More informationWhere does the insert method place the new entry in the array? Assume array indexing starts from 0(zero).
Suppose we have a circular array implementation of the queue,with ten items in the queue stored at data[2] through data[11]. The current capacity of an array is 12. Where does the insert method place the
More informationDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT-1
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : I / II Section : CSE - 1 & 2 Subject Code : CS6202 Subject Name : Programming and Data Structures-I Degree & Branch : B.E C.S.E. 2 MARK
More informationData Abstractions. National Chiao Tung University Chun-Jen Tsai 05/23/2012
Data Abstractions National Chiao Tung University Chun-Jen Tsai 05/23/2012 Concept of Data Structures How do we store some conceptual structure in a linear memory? For example, an organization chart: 2/32
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION
Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in themodel answer scheme. 2) The model answer and the answer written by candidate may
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK B.E. - Electrical and Electronics Engineering IV SEMESTER CS6456 - OBJECT ORIENTED
More informationTypes of Data Structures
DATA STRUCTURES material prepared by: MUKESH BOHRA Follow me on FB : http://www.facebook.com/mukesh.sirji4u The logical or mathematical model of data is called a data structure. In other words, a data
More informationR10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May
Code No: R21051 R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 DATA STRUCTURES (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 Answer any FIVE Questions All Questions carry
More informationKENDRIYA VIDYALAYA SANGATHAN BHUBANESWAR REGION SPLITUP SYLLABUS FOR COMPUTER SCIENCE CLASS XII
KENDRIYA VIDYALAYA SANGATHAN BHUBANESWAR REGION SPLITUP SYLLABUS FOR COMPUTER SCIENCE 2015-16 CLASS XII MONTH PORTION TO BE COVERED THEORY PRACTICAL April-May 2015 June-July 2015 Aug-2015 REVIEW: C++ covered
More informationIndex for C++ Programming
Computer Science (083) Practical File for Class XII Session 2018-19 Index for C++ Programming Name: Section: Roll No.: SN. Program Description Date Sign. 1. Write a C++ program to calculate the multiplication
More informationStacks & Queues. Kuan-Yu Chen ( 陳冠宇 ) TR-212, NTUST
Stacks & Queues Kuan-Yu Chen ( 陳冠宇 ) 2018/10/01 @ TR-212, NTUST Review Stack Stack Permutation Expression Infix Prefix Postfix 2 Stacks. A stack is an ordered list in which insertions and deletions are
More informationPrepared By: Ms. Nidhi Solanki (Assist. Prof.) Page 1
QUESTION BANK ON COURSE: 304: PRELIMINARIES: 1. What is array of pointer, explain with appropriate example? 2 2. Differentiate between call by value and call by reference, give example. 3. Explain pointer
More informationINSTITUTE OF AERONAUTICAL ENGINEERING
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Name Course Code Class Branch DATA STRUCTURES ACS002 B. Tech
More informationFirst Semester - Question Bank Department of Computer Science Advanced Data Structures and Algorithms...
First Semester - Question Bank Department of Computer Science Advanced Data Structures and Algorithms.... Q1) What are some of the applications for the tree data structure? Q2) There are 8, 15, 13, and
More informationReg. No. : Question Paper Code : 27157
WK 3 Reg. No. : Question Paper Code : 27157 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Time : Three hours Second Semester Computer Science and Engineering CS 6202 PROGRAMMING AND DATA STRUCTURES
More information1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \
BSc IT C Programming (2013-2017) Unit I Q1. What do you understand by type conversion? (2013) Q2. Why we need different data types? (2013) Q3 What is the output of the following (2013) main() Printf( %d,
More informationStudy Material for Class XII. Data File Handling
Study Material for Class XII Page 1 of 5 Data File Handling Components of C++ to be used with handling: Header s: fstream.h Classes: ifstream, ofstream, fstream File modes: in, out, in out Uses of cascaded
More informationPESIT Bangalore South Campus Department of MCA Course Information for
1. GENERAL INFORMATION: PESIT Bangalore South Campus Department of MCA Course Information for Data Structures Using C(13MCA21) Academic Year: 2015 Semester: II Title Code Duration (hrs) Lectures 48 Hrs
More informationQueues. Kuan-Yu Chen ( 陳冠宇 ) TR-212, NTUST
Queues Kuan-Yu Chen ( 陳冠宇 ) 2018/10/03 @ TR-212, NTUST Review Stack FILO Algorithms to covert Infix to Postfix Infix to Prefix Queue FIFO 2 Homeork1: Expression Convertor. Given a infix expression, please
More information1) What is information system? Describe the basic concepts of information systems.
(DMSIT 01) ASSIGNMENT - 1, DEC - 2018. PAPER- I : BASICS OF 1) What is information system? Describe the basic concepts of information systems. 2) Discuss about input and output technologies of computer
More informationData Structure using C++ Lecture 04. Data Structures and algorithm analysis in C++ Chapter , 3.2, 3.2.1
Data Structure using C++ Lecture 04 Reading Material Data Structures and algorithm analysis in C++ Chapter. 3 3.1, 3.2, 3.2.1 Summary Infix to Postfix Example 1: Infix to Postfix Example 2: Postfix Evaluation
More informationMIDTERM EXAMINATION Spring 2010 CS301- Data Structures
MIDTERM EXAMINATION Spring 2010 CS301- Data Structures Question No: 1 Which one of the following statement is NOT correct. In linked list the elements are necessarily to be contiguous In linked list the
More informationTable of Contents. Chapter 1: Introduction to Data Structures... 1
Table of Contents Chapter 1: Introduction to Data Structures... 1 1.1 Data Types in C++... 2 Integer Types... 2 Character Types... 3 Floating-point Types... 3 Variables Names... 4 1.2 Arrays... 4 Extraction
More informationSubject: Computer Science
Subject: Computer Science Topic: Data Types, Variables & Operators 1 Write a program to print HELLO WORLD on screen. 2 Write a program to display output using a single cout statement. 3 Write a program
More informationContent: Learning Objectives
1 BLOOM PUBLIC CHOOL Vasant Kunj, New Delhi Lesson Plan Class: XII ubject: Computer cience Month : July No of s: 21 Chapter:Data structure: Linked List TTT: 8 WT: 12 Content: Learning Objectives At the
More informationDraw a diagram of an empty circular queue and describe it to the reader.
1020_1030_testquestions.text Wed Sep 10 10:40:46 2014 1 1983/84 COSC1020/30 Tests >>> The following was given to students. >>> Students can have a good idea of test questions by examining and trying the
More informationDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS 1. Define global declaration? The variables that are used in more
More informationRevision Statement while return growth rate asymptotic notation complexity Compare algorithms Linear search Binary search Preconditions: sorted,
[1] Big-O Analysis AVERAGE(n) 1. sum 0 2. i 0. while i < n 4. number input_number(). sum sum + number 6. i i + 1 7. mean sum / n 8. return mean Revision Statement no. of times executed 1 1 2 1 n+1 4 n
More informationAdvanced C Programming and Introduction to Data Structures
FYBCA Semester II (Advanced C Programming and Introduction to Data Structures) Question Bank Multiple Choice Questions Unit-1 1. Which operator is used with a pointer to access the value of the variable
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)
WINTER 18 EXAMINATION Subject Name: Data Structure Model wer Subject Code: 17330 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in
More informationData Structures. Chapter 06. 3/10/2016 Md. Golam Moazzam, Dept. of CSE, JU
Data Structures Chapter 06 1 Stacks A stack is a list of elements in which an element may be inserted or deleted only at one end, called the top of the stack. This means that elements are removed from
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK III SEMESTER CS8391-Data Structures Regulation 2017 Academic Year 2018 19(odd Semester)
More informationKUWAIT SAHODAYA EXAMINATION FIRST TERM SUBJECT : COMPUTER SCIENCE (083) : CLASS - XII SET - 3 Time : 3 Hours
KUWAIT SAHODAYA EXAMINATION FIRST TERM 08-09 SUBJECT : COMPUTER SCIENCE (08) : CLASS - XII SET - Time : Hours MM=70 Instructions- (Based on the model of CBSE Exams). a) Find and write the output of the
More informationEC8393FUNDAMENTALS OF DATA STRUCTURES IN C Unit 3
UNIT 3 LINEAR DATA STRUCTURES 1. Define Data Structures Data Structures is defined as the way of organizing all data items that consider not only the elements stored but also stores the relationship between
More information2 SEMESTER EXAM CLASS : 12 DECEMBER 2016 TIME : 3 Hrs MAX MARKS : 70
SEMESTER EXAM CLASS : DECEMBER 06 TIME : Hrs MAX MARKS : 70. a) A D array MAT[40][0] is stored in memory as row wise. If the address of MAT[4][8] is 9 and width (W) is bytes find the address of MAT[0][9].
More informationBachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24
Prepared By ASCOL CSIT 2070 Batch Institute of Science and Technology 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass
More informationDC104 DATA STRUCTURE JUNE Q.2 a. If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
Q.2 a. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? The heterogeneous linked list contains different data types in its nodes and we need a link
More informationKENDRIYA VIDYALAYA SANGATHAN. Regional Office Delhi Split-up Syllabus Session Subject:-Computer Science Subject Code:-083
KENDRIYA VIDYALAYA SANGATHAN Regional Office Delhi Split-up Syllabus Session-2017-18 Subject:-Computer Science Subject Code:-083 COMPUTER SCIENCE (083)-Theory CLASS XII Unit wise Weightage of Marks Duration:3
More informationCLASS XII COMPUTER SCIENCE(083) TimeAllowed : 3 HrsMax Marks : 70
1 CLASS XII COMPUTER SCIENCE(083) TimeAllowed : 3 HrsMax Marks : 70 General Instructions- (i) All questions are compulsory (ii) Programming Language: C++ 1. (a) Differentiate between call-by-value and
More informationName :. Roll No. :... Invigilator s Signature :.. CS/B.TECH (NEW)/SEM-2/CS-201/ BASIC COMPUTATION & PRINCIPLES OF COMPUTER PROGRAMMING
Name :. Roll No. :..... Invigilator s Signature :.. CS/B.TECH (NEW)/SEM-2/CS-201/2012 2012 BASIC COMPUTATION & PRINCIPLES OF COMPUTER PROGRAMMING Time Allotted : 3 Hours Full Marks : 70 The figures in
More information12 Abstract Data Types
12 Abstract Data Types 12.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT). Define
More informationPRINCE PUBLIC SCHOOL PRE-BOARD EXAMINATION ( ) SAMPLE PAPER-1 COMPUTER SCIENCE XII TIME ALLOWED: 3 HOURS
PRINCE PUBLIC SCHOOL PRE-BOARD EXAMINATION (2018-19) SAMPLE PAPER-1 COMPUTER SCIENCE XII TIME ALLOWED: 3 HOURS MAXIMUM MARKS: 70 General Instructions 1. This question paper contains 7 questions. 2. SECTION
More informationvoid main() { int global=7 ; func( ::global,global) ; cout<<global<<, <<::global<< \n ; func(global,::global) ; cout<<global<<, <<::global<< \n ; }
K.V.NO.3 AFS CHAKERI AUTUMN BREAK HOME WORK 2017-18 CLASS-XII 1. a) Differentiate between an identifier and keywords. b) Name the header files, to which following inbuilt function belong to: a) abs( )
More informationSAMPLE PAPER. Class: XII SUBJECT COMPUTER SCIENCE. Time: 3 Hours MM: 70
SAMPLE PAPER Class - XII SUBJECT COMPUTER SCIENCE Subject: Computer Sc. Class: XII Time: 3 Hours MM: 70 1. (a) Differentiate between a global variable and a local variable. (b) Name the Header file(s)
More information4. BOOLEAN ALGEBRA 8 5. NETWORKING AND OPEN SOURCE SOFTWARE 10
SPLIT UP SYLLABUS SUBJECT : COMPUTER SCIENCE (083) SESSION:2014-15 Class XII (Theory) - C++ Duration: 3 hours Total Marks: 70 Unit No. Unit Name MARKS 1 OBJECT ORIENTED PROGRAMMING IN C++. 2. DATA STRUCTURE
More informationProgramming and Data Structure Solved. MCQs- Part 2
Programming and Data Structure Solved MCQs- Part 2 Programming and Data Structure Solved MCQs- Part 2 Unsigned integers occupies Two bytes Four bytes One byte Eight byte A weather forecasting computation
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)
WINTER 18 EXAMINATION Subject Name: Data Structure using C Model wer Subject Code: 22317 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given
More informationMID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct.
MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct. In linked list the elements are necessarily to be contiguous In linked list the elements may locate at far positions
More informationE.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu.
17CA 104DATA STRUCTURES Academic Year : 018-019 Programme : MCA Year / Semester : I / I Question Bank Course Coordinator: Mrs. C.Mallika Course Objectives The student should be able to 1. To understand
More informationIMPORTANT QUESTIONS WITH ANSWERS FOR II PU FINAL EXAMINATION
IMPORTANT QUESTIONS WITH ANSWERS FOR II PU FINAL EXAMINATION Chapter 1: Configuring a computer system ONE mark questions 1. What is a motherboard? Ans.: A Printed Circuit Board (PCB) used to connect all
More informationDepartment of Computer Science and Technology
UNIT : Stack & Queue Short Questions 1 1 1 1 1 1 1 1 20) 2 What is the difference between Data and Information? Define Data, Information, and Data Structure. List the primitive data structure. List the
More informationSTACKS AND QUEUES. Problem Solving with Computers-II
STACKS AND QUEUES Problem Solving with Computers-II 2 Stacks container class available in the C++ STL Container class that uses the Last In First Out (LIFO) principle Methods i. push() ii. iii. iv. pop()
More informationKENDRIYA VIDYALAYA SANGATHAN TINSUKIA REGION PRE BOARD EXAMINATION SUBJECT COMPUTER SCIENCE
CLASS- XII MAX MARKS-70 KENDRIYA VIDYALAYA SANGATHAN TINSUKIA REGION PRE BOARD EXAMINATION 01-15 SUBJECT COMPUTER SCIENCE TIME- HOURS Q1 a) What is the Difference between Global Variable and Local Variable?
More informationGUJARAT TECHNOLOGICAL UNIVERSITY COMPUTER ENGINEERING (07) / INFORMATION TECHNOLOGY (16) / INFORMATION & COMMUNICATION TECHNOLOGY (32) DATA STRUCTURES
GUJARAT TECHNOLOGICAL UNIVERSITY COMPUTER ENGINEERING () / INFMATION TECHNOLOGY (6) / INFMATION & COMMUNICATION TECHNOLOGY (32) DATA STRUCTURES Type of course: Compulsory SUBJECT CODE: 2302 B.E. 3 rd Semester
More informationDATA STRUCTURE UNIT I
DATA STRUCTURE UNIT I 1. What is Data Structure? A data structure is a mathematical or logical way of organizing data in the memory that consider not only the items stored but also the relationship to
More informationA Programming Approach with C DHARMENDER SINGH KUSHWAHA
DATA STRUCTURES A Programming Approach with C SECOND EDITION DHARMENDER SINGH KUSHWAHA Associate Professor Department of Computer Science and Engineering Motilal Nehru National Institute of Technology
More informationLecture No.04. Data Structures
Lecture No.04 Data Structures Josephus Problem #include "CList.cpp" void main(int argc, char *argv[]) { CList list; int i, N=10, M=3; for(i=1; i
More informationCS 206 Introduction to Computer Science II
CS 206 Introduction to Computer Science II 07 / 26 / 2016 Instructor: Michael Eckmann Today s Topics Comments/Questions? Stacks and Queues Applications of both Priority Queues Michael Eckmann - Skidmore
More informationa) State the need of data structure. Write the operations performed using data structures.
Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model answer and the answer written by candidate
More informationCS301 - Data Structures Glossary By
CS301 - Data Structures Glossary By Abstract Data Type : A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT Algorithm
More informationDATA STRUCTURES AND ALGORITHMS
LECTURE 8 Babeş - Bolyai University Computer Science and Mathematics Faculty 2017-2018 In Lecture 7... ADT Queue ADT Matrix ADT List ADT Stack Today ADT Queue 1 ADT Queue 2 3 4 Note ADT Queue We will not
More informationCS8391-DATA STRUCTURES QUESTION BANK UNIT I
CS8391-DATA STRUCTURES QUESTION BANK UNIT I 2MARKS 1.Define data structure. The data structure can be defined as the collection of elements and all the possible operations which are required for those
More informationComputer Programming C++ (wg) CCOs
Computer Programming C++ (wg) CCOs I. The student will analyze the different systems, and languages of the computer. (SM 1.4, 3.1, 3.4, 3.6) II. The student will write, compile, link and run a simple C++
More informationIntroduction to Data Structure
Introduction to Data Structure Introduction to Data Structure Computer is an electronic machine which is used for data processing and manipulation. When programmer collects such type of data for processing,
More informationProgramming in C++ 5. Integral data types
Programming in C++ 5. Integral data types! Introduction! Type int! Integer multiplication & division! Increment & decrement operators! Associativity & precedence of operators! Some common operators! Long
More informationGovernment of Karnataka SYLLABUS FOR SECOND PUC - COMPUTER SCIENCE (41) SUB-UNITS
SL No NAME OF THE UNIT/CHAPTER 1 Typical configuration of Computer system Organisation 5 Hrs/ 4 Marks BOOLEAN ALGEBRA 15 Hrs/ 13 Marks Government of Karnataka SYLLABUS FOR 014-015 SECOND PUC - COMPUTER
More informationMAHARASHTRASTATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)
Subject Code: 17330 Model Answer Page 1/ 22 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
More informationSolution: The examples of stack application are reverse a string, post fix evaluation, infix to postfix conversion.
1. What is the full form of LIFO? The full form of LIFO is Last In First Out. 2. Give some examples for stack application. The examples of stack application are reverse a string, post fix evaluation, infix
More informationAutumn Break 2017 Exam Oriented Assignment Class-XII B, Computer Science
Autumn Break 2017 Exam Oriented Assignment Class-XII B, Computer Science S.No. 1 Name of Chapter/Topic CLASSES AND OBJECTS HOT Questions 1. What do you understand by member function? 2. Differentiate between
More informationName :. Roll No. :... Invigilator s Signature : INTRODUCTION TO PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70
Name :. Roll No. :..... Invigilator s Signature :.. 2011 INTRODUCTION TO PROGRAMMING Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give
More informationCOMPUTER SCIENCE Paper 1
COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------
More informationDATA STRUCTURES USING C
Govt. of Karnataka, Department of Technical Education Diploma in Computer Science & Engineering Third Semester Subject: DATA STRUCTURES USING C Contact Hrs / week: 4 Total hrs: 64 Table of Contents Chapter
More informationSECOND SEMESTER BCA : Syllabus Copy
BCA203T: DATA STRUCTURES SECOND SEMESTER BCA : Syllabus Copy Unit-I Introduction and Overview: Definition, Elementary data organization, Data Structures, data structures operations, Abstract data types,
More informationKENDRIYA VIDYALAYA SANGATHAN BHUBANESWAR REGION SECOND PREBOARD EXAMINATION FOR CLASS XII SUBJECT: COMPUTER SCIENCE
KENDRIYA VIDYALAYA SANGATHAN BHUBANESWAR REGION SECOND PREBOARD EXAMINATION 2014-15 FOR CLASS XII SUBJECT: COMPUTER SCIENCE SET-I F.M. 70 General Instructions: Programming Language C++ All Questions are
More informationSAURASHTRA UNIVERSITY
SAURASHTRA UNIVERSITY RAJKOT INDIA Accredited Grade A by NAAC (CGPA 3.05) CURRICULAM FOR B.Sc. (Computer Science) Bachelor of Science (Computer Science) (Semester - 1 Semester - 2) Effective From June
More informationADVANCED DATA STRUCTURES USING C++ ( MT-CSE-110 )
ADVANCED DATA STRUCTURES USING C++ ( MT-CSE-110 ) Unit - 2 By: Gurpreet Singh Dean Academics & H.O.D. (C.S.E. / I.T.) Yamuna Institute of Engineering & Technology, Gadholi What is a Stack? A stack is a
More information