Note: Select one full question from each unit
|
|
- Mavis Cunningham
- 5 years ago
- Views:
Transcription
1 P.E.S COLLEGE OF ENGINEERING, MANDYA (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Data Structures Using C (P18MCA21) Credits : 4 Max. Marks : 0 Time : 3 hrs Note: Select one full question from each unit 1.a) 2.a) 3. a) 4.a) 5.a) 6.a) UNIT - I What is Abstract Data Type? Give ADT for Rational numbers with following operations: making-rational, add-rational, equality-rational Discuss different types of data types used in C Demonstrate the row-major representation of a two-dimensional array with an example. Write a C program to compute Total and Average marks to a student by taking % Subject Marks, Student name and USN UNIT - II Write algorithm for PUSH, POP and DISPLAY operations on stack. Transform each of the following expression to Prefix and Postfix expressions i) (A+B) *(C+D) $ E * F ii) (A+B) * (C $ (D-E) + F ) - G) iii) A + (((B-C) * ( D - E) + F) / G) $ ( H - J) iv) (A+B+C) / ( P - Q + R) * G v) A ^ B * (H - J * K ) + P / K * G Write a C function to evaluate postfix expression and trace for the expression (A+B)*C Write a recursive C program to search a given number using Binary search method. UNIT - III Demonstrate with a neat diagram, the working of a linear queue. Write C functions to add a node at the front, delete a node from the end and display the elements of list operations on doubly linked list. Write a C program to implement the linked stack and its operations along with exceptional conditions using SLL. Write a C program to implement the circular queue operations.
2 7.a) 8 a) 9. a).a) UNIT - IV Define Indexed sequential search. Create a table and search for a record in the table using the same. What are hashing? How collision are resolved in hashing. Construct a Binary Search Tree for given numbers and carryout Inorder, Preorder and Postorder traversals What is AVL tree? Explain its operations. UNIT - V Write a C program to sort N umbers using bubble sort method. Write C functions to sort numbers using Quick sort and Merge sort methods. Write a C program to sort numbers using Shell sort method. Write a C functions using Selection Sort **********************
3 P.E.S COLLEGE OF ENGINEERING, MANDYA (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Object Oriented Programming using C++ (P18MCA22) Credits : 04 Max. Marks : 0 Time : 3 hrs Note: Select one full question from each unit Unit I 1 a) Explain the important features of OOPS Write the general structure of c++ program with an example 05 c) Write a short note on reference variables 05 2 a) Explain the methods of argument passing with an example program What is function overloading? Explain with an example program. Unit II 3 a) Explian different access specifiers supported by c++ Explain static data members and static member functions of a class 4 a) What is a constructor? Explain different types of constructor with an example each. Write a c++ program to generate Fibonacci series using copy constructor 06 c) List the uses of scope resolution operator. 04 Unit III 5 a) Explain the characteristics of friend function 05 List any five rules for overloading operators 05 c) Write a c++ program to perform addition of 2 complex numbers by overloading + operator. 6 a) Write a c ++ program to overload unary + operator Write a c++ program to create a template function for bubble sort and demonstrate sorting of integers and doubles Unit IV 7 a) What is inheritance? Explain different types of inheritance with an example Explain the following with their characteristics i) Virtual functions ii) Pure virtual functions
4 8 a) Explain how to pass parameters to base class constructor through derived class. write a c++ program to demonstrate the same Write a c++ program to create a class STUDENT with data members USN, name and age. Using inheritance, create the classes UGSTUDENT and PGSTUDENT having fields as semester, fees and stipend. Find the semester wise average age for all UG and PG students separately. Unit V 9 a) What are iostream? Explain the stream class hierarchy with the neat diagram Explain different manipulators supplied by C++ a) Define exception. Explain try, throw and catch constructs in c++ With an example, explain container and vectors ******************
5 P.E.S COLLEGE OF ENGINEERING, MANDYA (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Operating Systems (P18MCA23) Credits : 4 Max. Marks : 0 Time : 3 hrs Note: Selecte one full question from each unit Unit-1 1. a. Discuss the activities connected with process management, memory management and file management. 6 b. List and Explain Operating System Sevices. 8 c. Explain Vmware architecture with figure 6 2. a. Describe Multiprogramming and Dual-Mode operation 12 b. Name different catgories of System Programs 4 c. Compare simple structure of operating system with layered approach 4 Unit-2 3. a. With diagram explain different state of process 6 b. List and Explain challenges in programming for multicore system c. What is Processor Affinity? Compare soft affinity and hard affinity 4 4. a. Explain different types of Schedulers 8 b. Consider the following set of process with the length of CPU-burst time Given in milli seconds. Process Burst time Priority P1 8 3 P2 1 1 P3 2 3 P4 1 4 P5 4 2 The above processes are arrived at time 0. Draw Gantt chart illustrating the execution of the above processing using FCFS, SJF, non-preemptive priority (a smaller number implies higher priority) and Round Robin (quantum=2) scheduling. Calculate average waiting time and turn around time for each of the above scheduling. Algorithms. 12 Unit-3 5. a. What are Semaphores? Explain its two Primitive operations 6 b. Write safety algorithm. 4 c. Consider the following snapshot of system: Process Allocation Max Available A B C D A B C D A B C D P P P P P
6 Answer the following question using Bankers algorithm; i) What is the content of the need matrix ii) Is the system in a safe state? 6. a. List Classic Problems of Synchronization and explain any one 8 b. Discuss Deadlock Prevention 12 Unit-4 7. a. With respect to Memory Management, Define i) First fit ii) Best fit and iii) Worst fit Algorithms 6 b. Explain paging hardware with translation look aside buffer. 8 c. Compare Page Replacement Algorithms 6 8. a. Differentiate between Paging and Segmentation. 4 b. What do you mean by fragmentation? List out the differences between Internal and External fragmentation. 6 c. What is page fault? What actions does the operating system take when a page f ault occurs explain? Unit-5 9. a. Describe any two different allocation methods with respect to file systems b. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37,122,14,124,65,67 In that order. If the disk head is initially at cylinder 53, find the number of head Movements using the following algorithms i) FCFS ii) SSTF.. a. What is a file? Explain different file attributes and various operations on a file that could be performed. b. Discuss Two-Level and Tree-Structured Directories *************
7 P.E.S COLLEGE OF ENGINEERING, MANDYA (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Database Management Systems (P18MCA24) Credits : 04 Max. Marks : 0 Time : 3 hrs Note: Select one full question from each unit UNIT - I 1. a) Explain the advantages of using a Database Management System. What is meant by Data Independence? Explain briefly different Types of it. 06 c) Briefly explain, when not to use a DBMS? a) Explain the component modules of DBMS and their interactions with the help of a diagram. Explain Three Schema architecture. 05 c) Explain the Client Server architecture. 05 UNIT - II 3. a) Define the steps for following terms with an example with respect to an ER model. i) Entity Set ii) Relationship Instance iii) Cardinality Ratio iv) Participation v) Weak entity set Explain the different types of symbols used in the ER diagram. 4. a) Construct an ER diagram for COMPANY database. The company keeps track of company s employees, project, department. A department controls a number of projects and employee can work for any number of projects. The company keeps track of dependents of each employee for insurance company. For the ER diagram develop the relational database scheme. Briefly explain the different types of attributes occur in ER model. UNIT - III 5. a) Explain the following relational algebra operations: i) SELECT ii) PROJECT iii) Cartesian product iv) Union v) Set difference. Describe left outer join, Right outer join and full outer join with examples.
8 6. a) Consider the following relational schema and answer the following queries using relational algebra. EMP (Name, SSN, Bdate, Address, Sex, Salary, SSSN, DNO) Department (Dname, DNO, MSSN, Msdate) Dept-Ioc (DNO, DLOC), Project (Pname, Pno, PLOC, DNO) Works - ON (ESSN, PNO, HOURS) Dependent (ESSN, Dname, Sex, Bdate, relationship) i) Retrieve the names of all Employees in dno = 5 who work more than hrs/week on product 'X' project. ii) For each department retrieve the department name, and the average salary of all the Employees working in that department. iii) List the names of all department managers who have no dependents. iv) Retrieve the average salary of all female Employees. Explain the ER to relational mapping algorithm. UNIT-IV 7. a) Explain all options of SELECT statement in SQL.Give example for each. Briefly explain the different domain types used in SQL. 04 c) Explain ON DELETE CASCADE, ON UPDATE CASCADE and 06 CHECK clauses. 8. a) Consider the following relations S(SNo, Sname, status, city) P(PNo, Pname, colour, weight, city) SP(SNo, PNO, Qty). Solve the following queries in SQL. i) Get PNO for parts, which have more than two shipments. ii) Get SNO for suppliers who supply at least one part supplied by S2. iii) Retrieve the details of shipments whose quantity is known. iv) Retrieve all the parts cities and supplier cities. v) Create a view to select part name, color and Quantity supplied by the supplier 0. Explain the following with suitable examples i) Views in SQL ii) Describe Aggregate functions in SQL. UNIT- V 9. a) What is functional dependency? Give Armstrong Inferences rules for functional dependencies. Define normalization. Explain 1NF, 2NF and 3NF with suitable examples.. a) Discuss ACID properties of database transaction. Describe locking techniques for concurrency control. ********
PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a
More information(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY
(DMCA101) M.C.A. DEGREE EXAMINATION, MAY - 2017 First Year INFORMATION TECHNOLOGY Time : 3 Hours Maximum Marks : 70 SECTION - A (3 15 = 45) Answer any three of the following Q1) Discuss business pressures
More informationMC7204 OPERATING SYSTEMS
MC7204 OPERATING SYSTEMS QUESTION BANK UNIT I INTRODUCTION 9 Introduction Types of operating systems operating systems structures Systems components operating systems services System calls Systems programs
More informationB.C.A DATA BASE MANAGEMENT SYSTEM MODULE SPECIFICATION SHEET. Course Outline
B.C.A 2017-18 DATA BASE MANAGEMENT SYSTEM Course Outline MODULE SPECIFICATION SHEET This course introduces the fundamental concepts necessary for designing, using and implementing database systems and
More information5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register
General Concepts 1. (a) What are combinational circuits? (b) Perform the following: (i) Convert (0.5625) 10 = ( ) 2 (ii) (010010) 2 (100011) 2 = ( ) 2 2. (a) Using truth table prove that A B= A+ B (b)
More informationSNS COLLEGE OF ENGINEERING
SNS COLLEGE OF ENGINEERING Coimbatore. Department of Computer Science and Engineering Question Bank- Even Semester 2015-2016 CS6401 OPERATING SYSTEMS Unit-I OPERATING SYSTEMS OVERVIEW 1. Differentiate
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 informationDepartment of Computer applications. [Part I: Medium Answer Type Questions]
Department of Computer applications BBDNITM, Lucknow MCA 311: OPERATING SYSTEM [Part I: Medium Answer Type Questions] UNIT 1 Q1. What do you mean by an Operating System? What are the main functions of
More informationKRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology
HOME ASSIGNMENT FOR BACHELOR OF COMPUTER APPLICATIONS (BCA) THIRD SEMESTER, 2014 N.B. The learners will have to collect receipt after submitting the assignment with the signature and seal of the collector
More informationDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT I
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year and Semester : II / IV Subject Code : CS6401 Subject Name : Operating System Degree and Branch : B.E CSE UNIT I 1. Define system process 2. What is an
More informationQUESTION BANK UNIT I
QUESTION BANK Subject Name: Operating Systems UNIT I 1) Differentiate between tightly coupled systems and loosely coupled systems. 2) Define OS 3) What are the differences between Batch OS and Multiprogramming?
More informationVALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK
VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK Degree & Branch : B.E E.C.E. Year & Semester : II / IV Section : ECE 1, 2 &
More informationTotal No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.
(DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)
More informationM.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.
Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors
More informationM.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75
M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 First Year Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY (DMSIT01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE III SEMESTER - B.E COMPUTER SCIENCE AND ENGINEERING QUESTION BANK - CS6302 DATABASE MANAGEMENT SYSTEMS UNIT I 1. What are the disadvantages of file processing system? 2.
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 information1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.
(DMCA 101) ASSIGNMENT - 1, MAY-2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. 3) What is software?
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 informationSankalchand Patel College of Engineering, Visnagar B.E. Semester III (CE/IT) Database Management System Question Bank / Assignment
Sankalchand Patel College of Engineering, Visnagar B.E. Semester III (CE/IT) Database Management System Question Bank / Assignment Introductory concepts of DBMS 1. Explain detailed 3-level architecture
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 informationSYED AMMAL ENGINEERING COLLEGE CS6401- OPERATING SYSTEM
Part-A SYED AMMAL ENGINEERING COLLEGE 1. What is an Operating system? CS6401- OPERATING SYSTEM QUESTION BANK UNIT-I 2. List the services provided by an Operating System? 3. What is the Kernel? 4. What
More informationANDHRA MAHILA SABHA ARTS & SCIENCE COLLEGE FOR WOMEN (AUTONOMOUS), NAAC Accredited O.U. CAMPUS, HYDERABAD.
ANDHRA MAHILA SABHA ARTS & SCIENCE COLLEGE FOR WOMEN (AUTONOMOUS), NAAC Accredited O.U. CAMPUS, HYDERABAD. Ist Year I Semester Programming in C Subject Code: Csc 101 Instruction 4 Hrs/ Week Duration of
More informationM.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75
M.C.A. DEGREE EXAMINATION, MAY - 2013 First Year Paper - I : INFORMATION TECHNOLOGY (DMCA 101) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) What is the
More informationOperating Systems Comprehensive Exam. Spring Student ID # 2/17/2011
Operating Systems Comprehensive Exam Spring 2011 Student ID # 2/17/2011 You must complete all of Section I You must complete two of the problems in Section II If you need more space to answer a question,
More informationASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology
ASSIGNMENT-1 () Basics of Information Technology (DMSIT01) Q1) Discuss in detail about IT support at different organizational levels. Q2) Explain about hierarchy of computers. Q3) Discuss different categories
More informationINSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad COMPUTER SCIENCE AND ENGINEERING QUESTION BANK OPERATING SYSTEMS
INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING QUESTION BANK Title Code Regulation Structure Coordinator Team of Instructors OPERATING SYSTEMS A50510
More informationMadhya Pradesh Bhoj (Open) University, Bhopal
Subject- Computer Organisation & System Software Maximum Marks: 20 Q.1 What is Number System? Explain Its Types? Q.2 What is Program Interrupt? Explain it. Q.3 Explain the Floating Point Representation?
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 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 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 informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 INFORMATION TECHNOLOGY TUTORIAL QUESTION BANK Course Name Course Code Class Branch OPERATING SYSTEMS ACS007 IV Semester
More informationOperating System(16MCA24)
PESIT- Bangalore South Campus Hosur Road (1km Before Electronic city) Bangalore 560 100 Department of MCA COURSE INFORMATION SHEET Operating System(16MCA24) 1. GENERAL INFORMATION Academic Year: 2017 Semester(s):I
More informationQuery optimization. Elena Baralis, Silvia Chiusano Politecnico di Torino. DBMS Architecture D B M G. Database Management Systems. Pag.
Database Management Systems DBMS Architecture SQL INSTRUCTION OPTIMIZER MANAGEMENT OF ACCESS METHODS CONCURRENCY CONTROL BUFFER MANAGER RELIABILITY MANAGEMENT Index Files Data Files System Catalog DATABASE
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 informationCLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS UNIT I OPERATING SYSTEMS OVERVIEW
CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS SYLLABUS UNIT I OPERATING SYSTEMS OVERVIEW Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory
More informationChendu College of Engineering & Technology
Chendu College of Engineering & Technology (Approved by AICTE, New Delhi and Affiliated to Anna University) Zamin Endathur, Madurantakam, Kancheepuram District 603311 +91-44-27540091/92 www.ccet.org.in
More informationCOSC344 Database Theory and Applications. σ a= c (P) S. Lecture 4 Relational algebra. π A, P X Q. COSC344 Lecture 4 1
COSC344 Database Theory and Applications σ a= c (P) S π A, C (H) P P X Q Lecture 4 Relational algebra COSC344 Lecture 4 1 Overview Last Lecture Relational Model This Lecture ER to Relational mapping Relational
More informationPart A (Compulsory) (Marks : 10) Answer all ten questions (20 words each). Each question carries equal marks.
Post Graduate Diploma in Computer Application EXAMINATION, 2011 Paper-DCA 101 Introduction to I.T. and P.C. Productivity Tools Time allowed: Three Hours Maximum Marks : 80 Part A (Compulsory) (Marks :
More informationDATABASE MANAGEMENT SYSTEMS
www..com Code No: N0321/R07 Set No. 1 1. a) What is a Superkey? With an example, describe the difference between a candidate key and the primary key for a given relation? b) With an example, briefly describe
More informationOBJECT ORIENTED DATA STRUCTURE & ALGORITHMS
OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS C++ PROGRAMMING LANGUAGE CONTENT C++ Language Contents: Introduction to C++ Language Difference and Similarities between C and C++ Role Of Compilers and Assemblers
More informationR13 SET - 1 2. Answering the question in Part-A is compulsory 1 a) Define Operating System. List out the objectives of an operating system. [3M] b) Describe different attributes of the process. [4M] c)
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 informationWITH C+ + William Ford University of the Pacific. William Topp University of the Pacific. Prentice Hall, Englewood Cliffs, New Jersey 07632
DATA STRUCTURES WITH C+ + William Ford University of the Pacific William Topp University of the Pacific Prentice Hall, Englewood Cliffs, New Jersey 07632 CONTENTS Preface xvii CHAPTER 1 INTRODUCTION 1
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 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 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 informationAnswer any Five Questions. All questions carry equal marks.
PART II, PAPER XII (Object Oriented Analysis and Design) 1. What are the benefits of object oriented development over structure development. How one way association is different than two way association.
More information. : B.Sc. (H) Computer Science. Section A is compulsory. Attempt all parts together. Section A. Specialization lattice and Specialization hierarchy
' This question paper contains 8 printed pages] Roll No. I I I I I I I I I I ( 1 S. No. of Question Paper : 6074 Unique Paper Code Name of the Paper Name of the Course Semester Duration : 3 Hours : 234305
More informationMAHARAJA KRISHNAKUMARSINHJI BHAVNAGAR UNIVERSITY NAAC Accreditation Grade B (With effect from Academic Year: )
BACHELOR OF COMPUTER APPLICATIONS (B.C.A.) Structure for B.C.A. CBCS Programme Semester-III (SY) COURSE NO. COURSE TYPE SUBJECT CREDIT BCA-EC-301 ELECTIVE 02 BCA-FC-301 FOUNDATION 02 BCA-CC-301 CORE Operating
More informationRajiv GandhiCollegeof Engineering& Technology, Kirumampakkam.Page 1 of 10
Rajiv GandhiCollegeof Engineering& Technology, Kirumampakkam.Page 1 of 10 RAJIV GANDHI COLLEGE OF ENGINEERING & TECHNOLOGY, KIRUMAMPAKKAM-607 402 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING QUESTION BANK
More informationFifth Semester B.E. Degree Examination, December Software Engineering
10IS51 Software Engineering Time: 3 hrs. Note: Answer FIVEfull questions, selecting at least TWO questions from each part. Max. Marks: 100 1 a. What are the attributes of a good software? Explain. Also
More informationCSC 742 Database Management Systems
CSC 742 Database Management Systems Topic #16: Query Optimization Spring 2002 CSC 742: DBMS by Dr. Peng Ning 1 Agenda Typical steps of query processing Two main techniques for query optimization Heuristics
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 informationM.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES
(DMCS 01) M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2014 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer
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 informationTribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:
Tribhuvan University 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSC. 154) Pass Marks: 24 (Data Structure and Algorithm) Time:
More informationVIEW OTHER QUESTION PAPERS
VIEW OTHER QUESTION PAPERS E B4E0562 Reg No.: Name: Total Pages: 2 APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY FOURTH SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 Course Code: CS208 Course Name: PRINCIPLES
More informationAlgorithms for Query Processing and Optimization. 0. Introduction to Query Processing (1)
Chapter 19 Algorithms for Query Processing and Optimization 0. Introduction to Query Processing (1) Query optimization: The process of choosing a suitable execution strategy for processing a query. Two
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 informationBACHELOR OF COMPUTER APPLICATIONS (BCA)
BACHELOR OF COMPUTER APPLICATIONS (BCA) BCA/ASSIGN/III/YEAR/14-15 ASSIGNMENTS (For July, 2014 and Jan., 2015 sessions) (3 rd Semester (Revised Syllabus)) (MCS-014, MCS-021, MCS-023, BCS-031, BCSL-032,
More informationGet Unique study materials from
Downloaded from www.rejinpaul.com VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : IV Section : EEE - 1 & 2 Subject Code
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 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 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 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 informationSYED AMMAL ENGINEERING COLLEGE
CS6302- Database Management Systems QUESTION BANK UNIT-I INTRODUCTION TO DBMS 1. What is database? 2. Define Database Management System. 3. Advantages of DBMS? 4. Disadvantages in File Processing System.
More informationKRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology
HOME ASSIGNMENT FOR BACHELOR OF COMPUTER APPLICATIONS (BCA) THIRD SEMESTER, 2017 N.B. The learners will have to collect receipt after submitting the assignment with the signature and seal of the collector
More informationChapter 3. Algorithms for Query Processing and Optimization
Chapter 3 Algorithms for Query Processing and Optimization Chapter Outline 1. Introduction to Query Processing 2. Translating SQL Queries into Relational Algebra 3. Algorithms for External Sorting 4. Algorithms
More informationCMSC 461 Final Exam Study Guide
CMSC 461 Final Exam Study Guide Study Guide Key Symbol Significance * High likelihood it will be on the final + Expected to have deep knowledge of can convey knowledge by working through an example problem
More informationINSTITUTE OF AERONAUTICAL ENGINEERING
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Title Course Code Regulation Course Structure Course Coordinator
More informationIntroduction to Query Processing and Query Optimization Techniques. Copyright 2011 Ramez Elmasri and Shamkant Navathe
Introduction to Query Processing and Query Optimization Techniques Outline Translating SQL Queries into Relational Algebra Algorithms for External Sorting Algorithms for SELECT and JOIN Operations Algorithms
More informationCHAPTER NO - 1 : Introduction:
Sr. No L.J. Institute of Engineering & Technology Semester: IV (26) Subject Name: Operating System Subject Code:21402 Faculties: Prof. Saurin Dave CHAPTER NO - 1 : Introduction: TOPIC:1 Basics of Operating
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 informationIndian Institute of Technology, Kharagpur
1 Indian Institute of Technology, Kharagpur End-Spring Semester 2017-18 Date of Examination: 24-04-2018 Session: AN (2-5 pm) Duration: 3 hrs Subject No.: CS31702 Subject: COMPUTER ARCHITECTURE AND OPERATING
More informationOperating Systems Comprehensive Exam. Spring Student ID # 3/16/2006
Operating Systems Comprehensive Exam Spring 2006 Student ID # 3/16/2006 You must complete all of part I (60%) You must complete two of the three sections in part II (20% each) In Part I, circle or select
More informationQ 1. (10 Points) Assume that a process executes the following pseudo codes:
CS630: Operating System Design Second Exam, Spring 2014 Q 1. (10 Points) Assume that a process executes the following pseudo codes: #4 #5 #6 #7 #10 main (int argc, char *argv[ ]) { int I, *input; n = argc
More informationSILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY
BE - SEMESTER III MID SEMESTER-I EXAMINATION WINTER 2017 SUBJECT: ENGINEERING ECONOMICS AND MANAGEMENT (2130004) (CE/IT/EC/EE) DATE: 04/08/2017 TIME: 10:00 am to 11:30 am TOTAL MARKS:40 Instructions: 1.
More informationQuery Processing & Optimization. CS 377: Database Systems
Query Processing & Optimization CS 377: Database Systems Recap: File Organization & Indexing Physical level support for data retrieval File organization: ordered or sequential file to find items using
More informationCGS 2405 Advanced Programming with C++ Course Justification
Course Justification This course is the second C++ computer programming course in the Computer Science Associate in Arts degree program. This course is required for an Associate in Arts Computer Science
More information1. Draw and explain program flow of control without and with interrupts. [16]
Code No: R05310503 Set No. 1 1. Draw and explain program flow of control without and with interrupts. [16] 2. Explain the following transitions: (a) Blocked Blocked/Suspended. (b) Blocked/Suspended Ready/Suspended.
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 information(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:
(DMTCS 01) M.Tech. DEGREE EXAMINATION, DECEMBER - 2015 (Examination at the end of First Year) COMPUTER SCIENCE Paper - I : Data structures Time : 03 Hours Maximum Marks : 75 Answer Question No.1 is compulsory
More informationTotal No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C
CSE/IT 216 (CR) Total No. of Questions :09] [Total No. of Pages : 02 Time: Three Hours 1. a. ADT II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC- 2015 First Semester CSE/IT DATA STRUCTURES USING C Answer Question
More informationCIS 330: Applied Database Systems. ER to Relational Relational Algebra
CIS 330: Applied Database Systems ER to Relational Relational Algebra 1 Logical DB Design: ER to Relational Entity sets to tables: ssn name Employees lot CREATE TABLE Employees (ssn CHAR(11), name CHAR(20),
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 informationM.C.A. FIRST YEAR DEGREE
(DMCA 101) ASSIGNMENT - 1, DEC - 2018. PAPER- I : INFORMATION TECHNOLOGY 1) What is MIS? Explain role of MIS in an organisation. 2) Explain in detail about input and output technologies. 3) Discuss about
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
Course Name Course Code Class Branch INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 04 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK : DATABASE MANAGEMENT SYSTEMS
More informationPESIT Bangalore South Campus
PESIT Bangalore South Campus 10CS54: DATABASE MANAGEMENT SYSTEM Faculty : Mrs. Surbhi Agrawal No of Hours : 52 Chapter Title / Class No. Reference Topics to be covered Literature 1 Introduction, Characteristics
More informationKing Fahd University of Petroleum and Minerals. Write clearly, precisely, and briefly!!
1 King Fahd University of Petroleum and Minerals Information and Computer Science Department ICS 431: Operating System FINAL EXAM DO NOT OPEN UNTIL INSTRUCTED TO DO SO!!!! Write clearly, precisely, and
More informationVALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 60 0 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK III SEMESTER CS89- DATA STRUCTURES Regulation 07 Academic Year 08 9 Prepared by
More informationR. C. TECHNICAL INSTITUTE, SOLA
R. C. TECHNICAL INSTITUTE, SOLA Information Technology Department SEMESTER 3 Assignments list for all subjects Subject Name: DIGITAL MEMORY SYSTEMS Subject Code: 3331601 ASSIGNMENT-1- Digital Memory Systems
More informationASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n))
ASSIGNMENTS Chapter Q. No. Questions Course Outcom e (CO) Progra m Outcom e I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n)) 2 3. What is the time complexity of the algorithm? 4
More informationProcessor : Intel Pentium D3.0 GigaHtz
CHALAPATHI INSTITUTE OF ENGINEERING & TECHNOLOGY CHALAPATHI NAGAR LAM,GUNTUR DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING INTRODUCTION ABOUT 'L2' LAB There are 30 systems (HCL) installed in this Lab.
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 informationCOURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05
COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 Unit 1 : LINEAR DATA STRUCTURES Introduction - Abstract Data Types (ADT), Arrays and its representation Structures, Stack, Queue, Circular
More informationSRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR
SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR 603203 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS QUESTION BANK (2017-2018) Course / Branch : M.Sc CST Semester / Year : EVEN / II Subject Name
More informationCourse Name: B.Tech. 3 th Sem. No of hours allotted to complete the syllabi: 44 Hours No of hours allotted per week: 3 Hours. Planned.
Course Name: B.Tech. 3 th Sem. Subject: Data Structures No of hours allotted to complete the syllabi: 44 Hours No of hours allotted per week: 3 Hours Paper Code: ETCS-209 Topic Details No of Hours Planned
More informationAPJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)
D B3D042 Pages: 2 Reg. No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 Max. Marks: 100 CS205: DATA STRUCTURES (CS, IT) PART A Answer all questions.
More informationBRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE. Sample Final Exam
BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE CSI33 Sample Final Exam NAME Directions: Solve problems 1 through 5 of Part I and choose 5 of the
More information