Laboratory Manual. B. Sc. (Hons.) Computer Applications III Semester. Laboratory Course III: CCB 3P1
|
|
- Steven Lamb
- 6 years ago
- Views:
Transcription
1 Laboratory Manual B. Sc. (Hons.) Computer Applications III Semester Laboratory Course III: CCB 3P1 Department of Computer Science Aligarh Muslim University, Aligarh
2 Credits Lab Manual Design Committee: Prof. Mohammad Ubaidullah Bokhari Dr. Arman Rasool Faridi Dr. Faisal Anwar Dr. Aasim Zafar (Convener) The Committee thankfully acknowledges the efforts and contributions of the following teachers: Dr. Mohammad Nadeem Mr. Sunil Kumar Sharma Mr. Imshad Ahmad Khan Mr. Naved Iqbal Design & Compilation: Mr. Sunil Kumar Sharma First Edition: July 2017 Approved by BoS, Dated 31/07/2017 Department of Computer Science, A.M.U., Aligarh, (U.P.), India LAB MANUAL/CCB 3P1/DoCS- Page 2
3 COURSE TITLE: Laboratory Course-III COURSE CODE: CCB 3P1 CREDIT: 2 PERIODS PER WEEK: 3 CONTINUOUS ASSESSMENT: 40 EXAMS: 60 COURSE DESCRIPTION This course is designed to review the concepts of C++ language, studied in previous semester and implement the various algorithms related to different data structures. CONTENT This course is designed to provide the students the opportunity of learning both concepts of C++ and then implementing algorithms and data structures. This course is indented to develop a deep understanding of various operations on data structure such as searching, sorting, insertion, deletion and traversing. This course is designed to help students in: Learning OOP concepts using C++. Learning different sorting (Bubble Sort, Insertion Sort, Merge Sort, Heap Sort, Quick Sort) and searching (Linear and Binary) techniques using C++. Learning Linked List, Queue, Stack and their operations using C++. Learning non-linear data structures such as Binary Tree, Binary Search Tree etc. and their operations using C++. Learning Graphs and their operations using C++. LAB MANUAL/CCB 3P1/DoCS- Page 3
4 After completing this course, the students would be able to: Understand and implement OOP concepts using C++. Understand and implement different sorting (Bubble Sort, Insertion Sort, Merge Sort, Heap Sort, Quick Sort) and searching (Linear and Binary) techniques using C++. Understand and implement Linked List, Queue, Stack and their operations using C++. Understand and implement non-linear data structures such as Binary Tree, Binary Search Tree etc. and their operations using C++. Understand and implement Graphs and their operations using C++. RULES AND REGULATIONS Students are required to strictly adhere to the following rules. The students must complete the weekly activities/assignments well in time (i.e., within the same week). The students must maintain the Lab File of their completed activities/assignments in the prescribed format (Appendix-1). The students must get the completed weekly activities/assignments checked and signed by the concerned teachers in the Lab in the immediate succeeding week. Failing LAB MANUAL/CCB 3P1/DoCS- Page 4
5 which the activities/assignments for that week will be treated as incomplete. At least TEN (10) such timely completed and duly signed weekly activities/assignments are compulsory, failing which students will not be allowed to appear in the final Lab Examination. The students need to submit the following three deliverables for each exercise duly signed by the Teacher: Algorithm Flow Chart Coding Input /Output Each question will be evaluated on a scale of 10 points, 4 for Algorithm, 3 for Flow Chart and 3 for Coding part. The students need to ensure that each question is assessed and signed by the Teacher in the week/time. Late submission would not be accepted after the due date. Cooperate, collaborate and explore for the best individual learning outcomes but copying is strictly prohibited. LAB MANUAL/CCB 3P1/DoCS- Page 5
6 WEEK #3 WEEK #2 WEEK #1 APPENDIX-1 Template for the Index of Lab File S. No. S DATE OF SUBMISSION SIGNATURE OF THE TEACHER REMARKS 1# 1 2# 3# 1# 2 2# 3# 1# 3 2# 3# Note: The students should use Header and Footer mentioning their roll no. & name in footer and page no in header. LAB MANUAL/CCB 3P1/DoCS- Page 6
7 WEEK #1 LAB To understand concept of control construct, arrays, recursion, string functions and pointers. the concepts of control construct arrays, recursion, string functions and pointers. Scenario: A courier company has number of items to be delivered to its intended customers through its salesman. The salesman visits following cities to deliver the respective items: S. NO. CITIES NO. OF ITEMS 1. Aligarh Agra Baroda Banaras Chennai 8 6. New Delhi New Jalpaiguri Howrah Kolkata Mumbai 33 Solve the following problems based on the above mentioned scenario using C++: 1. Write a program to store and display the above mentioned cities and corresponding items using arrays. LAB MANUAL/CCB 3P1/DoCS- Page 7
8 2. Write a program to display name of cities where salesman has delivered maximum and minimum number of items. 3. Write a program to search the number of items to be delivered of a user supplied city. LAB MANUAL/CCB 3P1/DoCS- Page 8
9 WEEK #2 LAB To understand concept of control construct, arrays, recursion, string functions and pointers (continues...). the concepts of control construct arrays, recursion, string functions and pointers (continues...). Based on the previous scenario, do the followings: 1. Write a program to find total number of items delivered using recursive function additem(). 2. Write a program to display name of the cities along with their length, and identity cities composed of two words. 3. The number of items of Agra and Kolkata are accidently interchanged. Correct them by writing a swap function using pointers. LAB MANUAL/CCB 3P1/DoCS- Page 9
10 WEEK #3 LAB To understand concept of class, inheritance, operator overloading and file handling. the concepts of class, inheritance, operator overloading and file handling. Scenario: A university has different entities such as Department, Programs and Student whose data members and member functions are given below: Teacher- { Data Members: Name, department, hours, programstaught; Member Function: setdetails(), getdetails()} Program- {Data Members: Name, department, duration; Member Functions: setdetails(), getdetails()} Student- {Data Members: Name, RollNo, Program, Department} Member Function: setdetails(), getdetails()} Solve the following problems based on the above mentioned scenario using C++: 1. Write a program to create Teacher, Program and Student Classes with above mentioned data members and member functions. 2. Add following functionalities in the above program; the default department of Teacher, Program and Student should be Computer Science ; however a different department could be assigned at run time. 3. Write a program to overload + operator to add the hours of two teachers. 4. Write a program to create two subclasses Residential Student and Non- Residential Student inherited from Student class. Residential Student would LAB MANUAL/CCB 3P1/DoCS- Page 10
11 have a data member Hall of Residence and Non-Residential Student would have Address as its data member. LAB MANUAL/CCB 3P1/DoCS- Page 11
12 WEEK #4 LAB To understand concept of class, inheritance, operator overloading and file handling (continues ). the concepts of class, inheritance, operator overloading and file handling (continues ). Based on the previous scenario, do the followings: 1. Write a friend function to determine number of hours taught by a particular teacher. 2. Write a program to store details of Teacher, Program and Student, each in a separate file. 3. Write a program to read details of Student from file whose Roll No is given by the user? LAB MANUAL/CCB 3P1/DoCS- Page 12
13 WEEK #5 LAB To understand concept of function template and class template. the concepts of function template and class template. 1. Write a function to swap two numbers using function template. The numbers could be Integer or float that depends on the user inputs. 2. Create a class Matrix that has matric data members and getvalue(), setvalue() as member functions. Write a program to perform Matrix operations (2-D array implementation), Add and Multiplication using class template. LAB MANUAL/CCB 3P1/DoCS- Page 13
14 WEEK #6 LAB To learn linear and binary search techniques. and implement linear and binary search methods in a given list. 1. Write a C++ program to search an element in a given 2D array of integers. 2. Write a C++ program to implement Binary search on 1D array of Employee structure (contains employee_name, emp_no, emp_salary), with key as emp_no. And count the number of comparison happened. LAB MANUAL/CCB 3P1/DoCS- Page 14
15 WEEK #7 LAB To learn Bubble and Selection sorting techniques. and implement Bubble and Selection sort. 1. Write a C++ Program to sort a given list of Integers using Bubble sort technique. 2. Write a C++ Program to sort a given list of Integers using Selection sort technique. LAB MANUAL/CCB 3P1/DoCS- Page 15
16 WEEK #8 LAB To learn Insertion and Quick sorting techniques. and implement Insertion and Quick sort. 1. Write a C++ Program to sort a given list of Integers using Insertion sort technique. 2. Write a C++ Program to sort a given list of Integers using Quick sort technique. LAB MANUAL/CCB 3P1/DoCS- Page 16
17 WEEK #9 LAB To learn how to create a linked list and perform different operations on it using pointer concepts. and implement linked list and perform its different operations using pointer concepts. 1. Write a C++ program to create a Linked List and perform the following operations: a. Function called InsertAtMiddle to add node in the middle of list. b. Function called InsertBefore to add node before Nth node. c. Function called InsertEnd to add node at the tail of linked list. d. Function called DeleteAfter to delete node after Nth node. e. Function called DeleteNode to delete a node having specific value. 2. Write a C++ program to append a Linked List L2 into a given Linked List L1. L1 contains N1 nodes with header H1 and L2 contains N2 nodes with header H2. LAB MANUAL/CCB 3P1/DoCS- Page 17
18 WEEK #10 LAB To learn how to create a linked list and perform different operations on it using pointer concepts (continues ). and implement linked list and perform its different operations using pointer concepts (continues...). 1. Write a C++ program that reverses a given list L with header H while traversing it only once. Each node should point to the node that was previously its predecessor; the head should point to the node that was previously at the end and the node that was previously at beginning should be last node. 2. Write a C++ program to implement circular doubly linked list and perform the following operations: a. Adding node to the linked list b. Traversing the whole list c. Deleting nodes from the list LAB MANUAL/CCB 3P1/DoCS- Page 18
19 WEEK #11 LAB To learn how to create Stack and perform its different operations. and implement Stack and perform its different operations. 1. Write a C++ program to create a Stack and perform the following operations: a. push an Element to the stack b. pop an element from stack 2. Write a C++ program to implement a 4-stacks of size m in an array of size n with all the basic operations such as IsEmpty(i), Push(i), Pop(i), IsFull(i) where i denotes the stack number (1,2,3,4), m n/4. Stacks are not overlapping each other. Leftmost stack facing the left direction and other three stacks are facing in the right direction. LAB MANUAL/CCB 3P1/DoCS- Page 19
20 WEEK #12 LAB To learn some of the applications of Stack. the practical usage of Stack with the help of implementing its some applications. 1. Write a C++ program to check whether an expression has balanced parentheses using array implementation of a stack. 2. Write a C++ program to evaluate a postfix expression using array implementation of a stack. LAB MANUAL/CCB 3P1/DoCS- Page 20
21 WEEK #13 LAB To learn how to create Queue and perform its different operations. and implement Queue and perform its different operations. 1. Write a C++ program to create a Queue and perform the following operations: a. Insert an Element from Queue b. Delete an element from Queue 2. Write a C++ program to move all the items from a queue onto stack. LAB MANUAL/CCB 3P1/DoCS- Page 21
22 WEEK #14 LAB To learn the concept of Binary tree, Binary Search Tree and their different functions. and implement Binary tree, Binary Search Tree and their different functions. 1. Write a C++ program to implement Binary tree insertion. 2. Write a C++ program to implement Post-order, pre-order and In-order traversal of the Binary tree. LAB MANUAL/CCB 3P1/DoCS- Page 22
23 WEEK #15 LAB To learn the concept of Binary Tree, Binary Search Tree and their different functions (continues ). and implement Binary Tree, Binary Search Tree and their different functions (continues ). 1. Write a C++ program for Binary Search Tree to implement following operations: a. Insertion b. Finding an element c. Finding Min element d. Finding Max element. LAB MANUAL/CCB 3P1/DoCS- Page 23
24 WEEK #16 LAB To learn the concepts of Graph and their different functions. and implement Graph and their different functions. 1. Write a C++ program to implement graph using array and linked-list. 2. Write a C++ program to implement Breadth-First and Depth-First Traversal of Graphs. 3. Write a C++ program to implement Dijkstra s Single Source Shortest Path Algorithm. LAB MANUAL/CCB 3P1/DoCS- Page 24
Laboratory Manual. B.Sc. Laboratory Course II II Semester. Department of Computer Science. Aligarh Muslim University Aligarh (CCB-2P1)
Laboratory Manual 2017-18 Laboratory Course II (CCB-2P1) B.Sc. (Computer Applications) II Semester Department of Computer Science Aligarh Muslim University Aligarh CREDITS Lab Manual Design Committee:
More informationLaboratory Manual MCA I Semester
Laboratory Manual MCA I Semester Laboratory Course I: CSM 11P1 Department of Computer Science Aligarh Muslim University, Aligarh Credits Lab Manual Design Committee: Prof. Mohammad Ubaidullah Bokhari Dr.
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 informationLab Manual B.Sc. (CA) SEMESTER - VI CCB-6P1: LABORATORY COURSE - VI DEPARTMENT OF COMPUTER SCIENCE ALIGARH MUSLIM UNIVERSITY ALIGARH
2019 Look forward, learn modern knowledge, and do not waste time in studies of old subjects of no values. Lab Manual B.Sc. (CA) SEMESTER - VI CCB-6P1: LABORATORY COURSE - VI DEPARTMENT OF COMPUTER SCIENCE
More informationIntroduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis
Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis p. 5 Statement Constructs p. 5 Pseudocode Example p.
More informationLaboratory Manual. Department of Computer Science Aligarh Muslim University, Aligarh. B. Sc. (Hons.) Computer Application I Semester
Laboratory Manual B. Sc. (Hons.) Computer Application I Semester Laboratory Course I: CCB 1P1 Department of Computer Science Aligarh Muslim University, Aligarh Credits Lab Manual Design Committee: Prof.
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 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 informationSection I. 1 Review of user defined function,recursion, pointer, structure 05 2 Introduction to Data Structures and stack
6 Course Title Course Code Data Structures CE307 Theory :03 Course Credit Practical :01 Tutorial :00 Credits :04 Course Learning Outcomes On the completion of the course, students will be able to : Understand
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 informationTIME: 3 HOURS MARKS: a. Develop a java program to sort an array of N numbers in ascending order. (40)
ANNA UNIVERSITY: CHENNAI-600 025 B.E/B.TECH DEGREE EXAMINATIONS, OCT/NOV. 2013 Regulations -2008 Fifth Semester B.TECH INFORMATION TECHNOLOGY IT2305 JAVA PROGRAMMING LAB TIME: 3 HOURS MARKS: 100 1. a.
More informationSyllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II
Subject Code: 01CE0301 Subject Name: Data Structure B.Tech. Year - II Objective: Data structure has high importance in the field of Computer & IT. Organization of data is crucial for implementation and
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 informationDATA STRUCTURES THROUGH C++
II Year I Semester DATA STRUCTURES THROUGH C++ L T P C 4 0 0 3 OBJECTIVES: To be familiar with basic techniques of object oriented principles and exception handling using C++ To be familiar with the concepts
More informationSai Nath University. Assignment For MCA 2nd Sem.
Sai Nath University Assignment For MCA 2nd Sem. The Assignment will consist of two parts, A and B. will have 5 short answer questions(40-60 words) of 4 marks each. will have 4 long answer questions of
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 informationPROGRAMMING 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 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 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 informationCSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid. Fall 2018
CSCE 20/220 Data Structures and Algorithms Prof. Amr Goneid Fall 208 CSCE 20/220 DATA STRUCTURES AND ALGORITHMS Dr. Amr Goneid Course Goals To introduce concepts of Data Models, Data Abstraction and ADTs
More informationDYNAMIC MEMORY ALLOCATION AND DEALLOCATION
COURSE TITLE DATA STRUCTURE DETAILED SYLLABUS SR.NO NAME OF CHAPTERS & DETAILS HOURS ALLOTTED 1 USER DEFINED DATATYPE /STRUCTURE About structure Defining structure Accessing structure element Array of
More informationHome Works and Assignments
Course Title: Course Code: Credit Hours Theory: Credit Hours Lab (If Applicable): Instructor Name with Qualification: Course Objectives: Course Learning Outcomes: Contents (Catalog Description): Recommended
More informationSchool of Computing & Information Technology. Department of Computer Science & Engineering LAB MANUAL CS-1331 DATA STRUCTURES LAB
School of Computing & Information Technology Department of Computer Science & Engineering LAB MANUAL CS-1331 DATA STRUCTURES LAB Program : B. Tech. Semester : III Semester CS/IT Session : 2016-17 Subject
More informationCS 445: Data Structures Final Examination: Study Guide
CS 445: Data Structures Final Examination: Study Guide Java prerequisites Classes, objects, and references Access modifiers Arguments and parameters Garbage collection Self-test questions: Appendix C Designing
More informationTime: 3 HOURS Maximum Marks: 100
ANNA UNIVERSITY:CHENNAI 600 025 M.E/M.Tech. DEGREE EXAMINATIONS, NOV./DEC. 2014 Regulations 2013 Third Semester B.E. Computer Science and Engineering CS6311: PROGRAMMING AND DATA STRUCTURES LABORATORY
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN. Sec. Name Office Office hour Mail id
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN Course Code Course Title : DATA STRUCTURES AND ALGORITHMS Semester : I Course Time : July Dec 207
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 informationDEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY
DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR (2015-2016 REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR
More informationQuestion Paper Code : 97044
Reg. No. : Question Paper Code : 97044 B.E./B.Tech. DEGREE EXAMINATION NOVEMBER/DECEMBER 2014 Third Semester Computer Science and Engineering CS 6301 PROGRAMMING AND DATA STRUCTURES-II (Regulation 2013)
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 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 informationnamibia UniVERSITY OF SCIEnCE AnD TECHnOLOGY
namibia UniVERSITY OF SCIEnCE AnD TECHnOLOGY Faculty of Computing and Informatics Department of Computer Science QUALIFICATION: Bachelor of Computer Science, Bachelor of Informatics, Bachelor of Engineering
More informationRevised time table of BCA (2011 admission) record submission
Revised time table of BCA (2011 admission) record submission Enrollment Number CA11BCA001 GB11BCA001 - GB11BCA019 Date 01/06/2012 GB11BCA020 - GB11BCA039 02/06/2012 GB11BCA040 - GB11BCA059 04/06/2012 GB11BCA060
More informationCSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid
CSCE 20/220 Data Structures and Algorithms Prof. Amr Goneid Fall 208 / Spring 209 CSCE 20/220 DATA STRUCTURES AND ALGORITHMS Prof. Amr Goneid Instructor: Prof. Amr Goneid E-mail: goneid@aucegypt.edu Office:
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 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 informationUCS-406 (Data Structure) Lab Assignment-1 (2 weeks)
UCS-40 (Data Structure) Lab Assignment- (2 weeks) Implement the following programs in C/C++/Python/Java using functions a) Insertion Sort b) Bubble Sort c) Selection Sort d) Linear Search e) Binary Search
More informationLESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER
DEPARTMENT OF COMPUTER APPLICATIONS LESSON PLAN B.C.A. - FIRST YEAR (2014-2015 REGULATION) SECOND SEMESTER SRM UNIVERSITY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR 603 203 SRM UNIVERSITY
More informationSTRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR
STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR 2000-2001. MCA II SEMESTER Scheme of Evaluation Max. Marks Min. Marks to pass L P C Int. Ext.
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 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 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 informationPRACTICAL LIST FOR EVEN SEMESTERS (PGDCA/MCA/MSC (CS))
PRACTICAL LIST FOR EVEN SEMESTERS (PGDCA/MCA/MSC (CS)) SEMSTER 2 nd Programme: PGDCA/MCA/MSC (CS) Course: Practical (Based on MS-06) Code: MS-10 Max Marks: 100 Data Structure and Algorithms (Based on MS-06)
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 informationCS2013 Course Syllabus Spring 2018 Lecture: Mon/Wed 2:00 P.M. 2:50 P.M. SH C259 Lab: Mon/Wed 2:50 P.M. 4:00 P.M. SH C259
CS2013 Course Syllabus Spring 2018 Lecture: Mon/Wed 2:00 P.M. 2:50 P.M. SH C259 Lab: Mon/Wed 2:50 P.M. 4:00 P.M. SH C259 Instructor Course name Credits Contact hours Text book Course Information Course
More information( ) + n. ( ) = n "1) + n. ( ) = T n 2. ( ) = 2T n 2. ( ) = T( n 2 ) +1
CSE 0 Name Test Summer 00 Last Digits of Student ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. Suppose you are sorting millions of keys that consist of three decimal
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 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 informationAP Computer Science AB
AP Computer Science AB Dr. Tyler Krebs Voice Mail: 431-8938 Classroom: B128 Office: TV Studio Characteristics We Value in This Classroom: 1. Respect. (Show respect for everyone and everything.) 2. Integrity.
More informationDuring the first 2 weeks of class, all students in the course will take an in-lab programming exam. This is the Exam in Programming Proficiency.
Description of CPSC 301: This is a 2-unit credit/no credit course. It is a course taught entirely in lab, and has two required 2-hour 50-minute lab sessions per week. It will review, reinforce, and expand
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 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 informationCISC 3130 Data Structures Spring 2018
CISC 3130 Data Structures Spring 2018 Instructor: Ari Mermelstein Email address for questions: mermelstein AT sci DOT brooklyn DOT cuny DOT edu Email address for homework submissions: mermelstein DOT homework
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 informationCLO Assessment CLO1 Q1(10) CLO2 Q2 (10) CLO3 Q4 (10) CLO4 Q3a (4)
CS210 Data Structures (171) Final Exam Name: ID Instructions: This exam contains four questions with multiple parts. Time allowed: 180 minutes Closed Book, Closed Notes. There are 10 pages in this exam
More informationDelhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web: Ph:
Serial : 1PT_CS_A+C_Programming & Data Structure_230918 Delhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web: E-mail: info@madeeasy.in Ph: 011-45124612 CLASS TEST 2018-19
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 informationSYLLABUS Type of evaluation
SYLLABUS 1. Information regarding the programme 1.1 Higher education Babeș-Bolyai University, Cluj-Napoca institution 1.2 Faculty Faculty of Mathematics and Computer Science 1.3 Department Department of
More informationAlgorithm Class. C C++ DS JAVA DATA STRUCTURES TRAINING INSTITUTE KPHB HYDERABAD. Mobile:
C C++ DS JAVA DATA STRUCTURES TRAINING INSTITUTE KPHB HYDERABAD Algorithm Class Mobile: +91-9963930865 https://sites.google.com/site/algorithmclass Data Structures for interviews Course details By Algorithm
More informationlogn D. Θ C. Θ n 2 ( ) ( ) f n B. nlogn Ο n2 n 2 D. Ο & % ( C. Θ # ( D. Θ n ( ) Ω f ( n)
CSE 0 Test Your name as it appears on your UTA ID Card Fall 0 Multiple Choice:. Write the letter of your answer on the line ) to the LEFT of each problem.. CIRCLED ANSWERS DO NOT COUNT.. points each. The
More informationModel 4.2 Faculty member + student Course syllabus for Advanced programming language - CS313D
Model 4.2 Faculty member + student Course syllabus for Advanced programming language - CS1D 1. Faculty member information: Name of faculty member responsible for the course Dr. Myriam Hadjouni Office Hours
More informationDiscuss the following operations on One-Dimensional array with algorithms.
(i). Searching (ii). Sorting (iii). Traversing (16CS503) DATA STRUCTURES THROUGH C UNIT-I Discuss the following operations on One-Dimensional array with algorithms. 2.Discuss the following operations on
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 information( ) ( ) C. " 1 n. ( ) $ f n. ( ) B. " log( n! ) ( ) and that you already know ( ) ( ) " % g( n) ( ) " #&
CSE 0 Name Test Summer 008 Last 4 Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time for the following code is in which set? for (i=0; i
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 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 informationData_Structures - Hackveda
Data_Structures - Hackveda ( Talk to Live Mentor) Become a Data Structure and Algorithm Professional - (Beginner - Advanced) Skill level: Beginner - Advanced Training fee: INR 15999 only (Topics covered:
More informationCS-301 Data Structure. Tariq Hanif
1. The tree data structure is a Linear data structure Non-linear data structure Graphical data structure Data structure like queue FINALTERM EXAMINATION Spring 2012 CS301- Data Structure 25-07-2012 2.
More information( ). Which of ( ) ( ) " #& ( ) " # g( n) ( ) " # f ( n) Test 1
CSE 0 Name Test Summer 006 Last Digits of Student ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time to multiply two n x n matrices is: A. "( n) B. "( nlogn) # C.
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 informationData Structures in C++ Using the Standard Template Library
Data Structures in C++ Using the Standard Template Library Timothy Budd Oregon State University ^ ADDISON-WESLEY An imprint of Addison Wesley Longman, Inc. Reading, Massachusetts Harlow, England Menlo
More informationCS DATA STRUCTURES AND ALGORITHMS
Computer Science and Engineering Third Semester CS1211 - DATA STRUCTURES AND ALGORITHMS UNIT-I - INTRODUCTION TO DATASTRUCTURES 1.Write down the definition of data structures? PART -A A data structure
More informationCompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards
CompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards Nevada Course Details: Course Name: Computer Science Primary Cluster: Information and Media Technologies Standards Course Code(s):
More informationGeneral Instructions. You can use QtSpim simulator to work on these assignments.
General Instructions You can use QtSpim simulator to work on these assignments. Only one member of each group has to submit the assignment. Please Make sure that there is no duplicate submission from your
More informationCS503 Advanced Programming I CS305 Computer Algorithms I
Syllabus: CS503 Advanced Programming I CS305 Computer Algorithms I Course Number: CS503-50/CS305-50 Course Title: Advanced Programming I/Computer Algorithms I Instructor: Richard Scherl Office: Howard
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 informationCS302 Data Structures using C++
CS302 Data Structures using C++ Study Guide for the Final Exam Fall 2018 Revision 1.1 This document serves to help you prepare towards the final exam for the Fall 2018 semester. 1. What topics are to be
More informationSECOND SEMESTER JAVA PROGRAMMING
PGDCA-210 SECOND SEMESTER JAVA PROGRAMMING (A) Instructions for the Paper setter: The question paper will consist of five sections: A, B, C, D a E. Sections A, B, C a D will have two questions from the
More informationCS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon
CS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon Instructor Course name Credits Contact hours Text book Course Information Course Goals Jungsoo (Sue)
More informationQuantitative Finance COURSE NUMBER: 22:839:615 COURSE TITLE: Special Topics Oriented Programming 2
Quantitative Finance COURSE NUMBER: 22:839:615 COURSE TITLE: Special Topics Oriented Programming 2 COURSE DESCRIPTION This course assumes a student has prior programming language experience with C++. It
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 informationLargest Online Community of VU Students
WWW.VUPages.com http://forum.vupages.com WWW.VUTUBE.EDU.PK Largest Online Community of VU Students MIDTERM EXAMINATION SEMESTER FALL 2003 CS301-DATA STRUCTURE Total Marks:86 Duration: 60min Instructions
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 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 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 informationNote: Select one full question from each unit
P.E.S COLLEGE OF ENGINEERING, MANDYA-571401 (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Data Structures Using C (P18MCA21) Credits :
More informationKRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology
KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology HOME ASSIGNMENT FOR MASTER OF COMPUTER APPLICATION (MCA) & MASTER OF SCIENCE IN INFORMATION TECHNOLOGY
More informationJuly 2012 Masters in Computer Application (MCA) - Semester 2 MCA 2010 Operating System 4 Credits
MCA 2010 Operating System 4 Credits (Book ID: B1405) Assignment Set 1 (60 Marks) Each question carries Ten marks 6 x 10 = 60 1. Explain a) Multi-programmed Batched Operating Systems b) Real - time Systems
More informationFINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard
FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should Use better data structures
More informationOCR H446 A-Level Computer Science
Name: Class Teacher: Date: OCR H446 A-Level Computer Science REVISION BOOKLET 2.3 ALGORITHMS Content in H446 A-Level Computer Science: 1.1 The characteristics of contemporary processors, input, output
More informationCpt S 122 Data Structures. Course Review FINAL. Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University
Cpt S 122 Data Structures Course Review FINAL Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Final When: Wednesday (12/12) 1:00 pm -3:00 pm Where: In Class
More informationPROGRAMMING IN C AND C++:
PROGRAMMING IN C AND C++: Week 1 1. Introductions 2. Using Dos commands, make a directory: C:\users\YearOfJoining\Sectionx\USERNAME\CS101 3. Getting started with Visual C++. 4. Write a program to print
More information& ( D. " mnp ' ( ) n 3. n 2. ( ) C. " n
CSE Name Test Summer Last Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time to multiply two n " n matrices is: A. " n C. "% n B. " max( m,n, p). The
More informationHrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
Subject Code: CC103-N Subject Title: FUNDAMENTALS OF PROGRAMMING Teaching scheme Total L T P Total Theory Credit Evaluation Scheme Mid Sem Exam CIA Pract. Total Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks
More information1) What is the primary purpose of template functions? 2) Suppose bag is a template class, what is the syntax for declaring a bag b of integers?
Review for Final (Chapter 6 13, 15) 6. Template functions & classes 1) What is the primary purpose of template functions? A. To allow a single function to be used with varying types of arguments B. To
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 informationKRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Chandra Bhuyan School of Science and Technology
KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Chandra Bhuyan School of Science and Technology HOME ASSIGNMENT FOR MASTER OF COMPUTER APPLICATION (MCA) & MASTER OF SCIENCE IN INFORMATION TECHNOLOGY
More informationMCA SEM-II Data Structure
MCA SEM-II Data Structure Timings: 30 Minutes] Objective Questions Keys [ Marks - 40 1. The memory address of the first element of an array is called a. Floor address b. Foundation address c. First address
More informationAnnouncements. Last modified: Thu Nov 29 16:15: CS61B: Lecture #40 1
Announcements Lab sections on December 5, 6, and 7 will be organized as follows: Students will work on an exam-like set of exercises covering linked lists, stacks, queues, binary trees, binary search trees.
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 information