SARDAR RAJA COLLEGE OF ENGINEERING
|
|
- Toby Lester
- 6 years ago
- Views:
Transcription
1 SARDAR RAJA COLLEGE OF ENGINEERING RAJA NAGAR, ALANGULAM Department of Electronics & Communication Engineering Subject Name : DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ Subject Code : EC 2202 Year/Branch : II/ECE Semester : III Prepared By, A.Kanagaraj, Asst.prof/CSE.
2 SYLLABUS EC 2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C AIM To provide an in-depth knowledge in problem solving techniques and data structures. OBJECTIVES. To learn the systematic way of solving problems. To understand the different methods of organizing large amounts of data. To learn to program in C++. To efficiently implement the different data structures. To efficiently implement solutions for specific problems UNIT I PRINCIPLES OF OBJECT ORIENTED PROGRAMMING 9 Introduction- Tokens-Expressions-contour Structures Functions in C++, classes and objects, constructors and destructors,operators overloading and type conversions. UNIT II ADVANCED OBJECT ORIENTED PROGRAMMING 9 Inheritance, Extending classes, Pointers, Virtual functions and polymorphism, File Handling Templates, Exception handling, Manipulating strings. UNIT III DATA STRUCTURES & ALGORITHMS 9 Algorithm, Analysis, Lists, Stacks and queues, Priority queues-binary Heap-Application, Heaps hashinghash tables without linked lists UNIT IV NONLINEAR DATA STRUCTURES 9 Trees-Binary trees, search tree ADT, AVL trees, Graph Algorithms-Topological sort, shortest path algorithm network flow problems-minimum spanning tree - Introduction to NP - completeness. UNIT V SORTING AND SEARCHING 9 Sorting Insertion sort, Shell sort, Heap sort, Merge sort, Quick sort, Indirect sorting,bucket sort, Introduction to Algorithm Design Techniques Greedy algorithm (Minimum Spanning Tree), Divide and Conquer (Merge Sort), Dynamic Programming (All pairsshortest Path Problem). Total hours = 45 TEXT BOOKS: T1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 3rd ed, Pearson Education Asia, T2. E. Balagurusamy, Object iented Programming with C++, McGraw Hill Company Ltd., REFERENCES: 1. Michael T. Goodrich, Data Structures and Algorithm Analysis in C++, Wiley student edition, Sahni, Data Structures Using C++, The McGraw-Hill, Seymour, Data Structures, The McGraw-Hill, Jean Paul Tremblay & Paul G.Sorenson, An Introduction to data structures with applications, Tata McGraw Hill edition, II Edition, John R.Hubbard, Schaum s outline of theory and problem of data structure with C++, McGraw-Hill, New Delhi, Bjarne Stroustrup, The C++ Programming Language, Addison Wesley, Robert Lafore, Object oriented programming in C++, Galgotia Publication
3 MICRO LESSON PLAN HOURS LECTURE TOPIC TEXT BOOKS Unit-1 1 Introduction, Tokens T2 2 Expressions, Contour Structures T2 3 4 Functions in C++ T2 5 T2 classes and objects 6 T2 7 constructors and destructors T2 8 operators overloading T2 9 type conversions T2 Unit-2 10 Inheritance T2 11 Extending classes T Pointers T2 14 Virtual functions and polymorphism T2 15 File Handling T2 16 Templates T2 17 Exception handling T2 18 Manipulating strings T2 Unit-3 19 Algorithm, Analysis T Lists T Stacks T1 24 queues T1 25 Priority queues-binary Heap-Application, T1 26 Heaps T1 27 hashing-hash tables without linked lists T1 Unit-4 28 Tree, Binary trees T1 29 search tree ADT T1 30 AVL trees T1 31 Graph Algorithms-Topological sort T1 32 shortest path algorithm T1 33 network flow problems T1 34 T1 minimum spanning tree 35 T1 36 Introduction to NP - completeness. T1 Unit-5 37 Sorting Insertion sort, Shell sort T1 38 Heap sort, T1 39 Merge sort T1 40 Quick sort T1 41 Indirect sorting, Bucket sort, T1 42 Introduction to Algorithm Design Techniques Greedy algorithm (Minimum Spanning Tree) T1 43 Greedy algorithm (Minimum Spanning Tree) T1 44 Divide and Conquer (Merge Sort), T1 45 Dynamic Programming (All pairs Shortest Path Problem). T1
4 QUESTION BANK UNIT I PART-A 1. What is an identifier?give example. 2. What is a token?give example. 3. What is an expression?give example. 4. Mention the use of function? 5. What is a) class b)object? 6. Define a) contructor b)destructor. 7. Mention about operator overloading. 8. What is the use of Operator overloading? 9. What is the use of scope resolution operator? 10. What is a friend function and virtual function? PART B 1.(i)Explain briefly about the various data types used in C++. (ii)explain Tokens and Expressions in detail. 2.(i)Discuss about functions with an eg and their use. (ii)what happens when a function call is made in a program? 3.(i)Explain about classes and objects in C++ with an eg? (ii)how to define a member function in a class? 4.Explain about a Constructor in detail. 5. Explain about operator overloading in detail. 6. Explain about destructors in detail. 7. Explain about the operators used in C++ in detail. 8. Explain about control structures in detail. UNIT-II PART A 1. Define Inheritance.Give Eg. 2. What is an abstract class? 3. What is the use of seekg() and seekp()? 4. What is a pointer? What are the types of pointers? 5. Define Virtual function. 6. Define Polymorphism. 7. Write about Templates. 8. Define Exception handling 9. How strings can be manipulated? 10. What is a pure virtual function? Part B 1. Explain about inheritance and its type in detail with examples. 2. Write in detail about extending classes. 3. Explain the need of pointers,its use, in detail. 4. Explain Virtual function with an example. 5. Briefly explain about i)array of pointer ii)pointer to a function iii)pointer to object iv)this pointer 6. Write a note on Exception handling. 7.Explain about class and function templates? 8.Explain the classes for file stream operations. 9. Explain the working of files.
5 UNIT III PART-A 1. What is an algorithm? Give example 2. What is datastructure? what are its type. 3. What is a stack? 4. Write about Queue datastructure? 5. What are the various types of Linked list? 6. What are priority queues? 7. Define binary heap? 8. Define hashing? 9. What are the applications of binary heaps? 10. Write about heap order property and structure propery. 11.What is a skew heap? 12.Write about leftist heaps. PART-B 1. (i) Explain the insertion and deletion operation in Stacks (ii) Describe the various applications of stack 2. Describe Queue and its operation with suitable eg. 3. Explain about Linked list, its Types,insertion and deletion routines with suitable egs. 4. (i) Briefly explain priority queues (ii)briefly explain about binary heaps and its application. 5. (i) Explain significance of Hashing. (ii)explain about various types of hashing. UNIT-IV PART A 1. Define a tree? 2. Define a binary tree? 3. Give the three types of traversals. 4. Define AVL tree. 5. What is a Graph? Give example. 6. What is a minimum spanning tree? 7. Give the list representation of Graph? 8. What are undecidable and recursively undecidable problem? 9. What is meant by traveling salesman problem? 10. What is NP-completeness? 1. Write notes on i) Implementation of Binary tree. ii) Expression tree. 2. Explain search tree ADT. Part-B 3. Discuss AVL trees with example. 4. i)write in detail about topological sort. ii) Explain Dijkstra s algorithm with example. 5. i)discuss about single source shortest path problem? ii) Discuss about Unweighted shortest path problem? 6. Explain a simple maximum flow algorithm in detail. 7. Explain NP-Completeness problem with suitable example. 8. Explain Prim s Algorithm with Example? 9. Explain Kruskal s Algorithm with Example?
6 UNIT-V PART-A 1. What is sorting? what are its type. 2. What is the difference between internal & external sorting? 3. Give example for Bucket Sort? 4. What is multimerging? 5. What is meant by divide and conquer technique? 6. What is Optimal binary search tree? 7. Mention about insertion sort 8. State the role of pivot element in quick sort. 9. Give examples for internal & external sorting? 10. Describe about dynamic programming. Part-B 1. i)explain insertion sort with example. ii)write a note on shell sort with example. 2. i)discuss briefly about heap sort with example ii)explain Merge sort with Example. 3. Explain Quick sort in detail with an eg. 4. Explain Greedy algorithm with an example. 5. Explain about All pair shortest path algorithm. 6. Explain about Divide and Conquer technique in detail with an example.
7 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010 Third Semester Electronics and Communication Engineering EC 2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ (Regulation 2008) Time : Three hours Maximum : 100 Marks Answer ALL questions PART A (10 2 = 20 Marks) 1. What effects do the visibility labels private, protected and public have on the members of a class? 2. What are the advantages of operator overloading? 3. What is inheritance? What are its advantages? 4. Define virtual function. 5. Define stack. Mention the operations on stack. 6. What is binary heap? What are its types? 7. What is meant by an adjacency matrix? 8. State the properties of binary search tree. 9. What is sorting? How is sorting essential for data base applications? 10. What is meant by dynamic programming? PART B (5 16 = 80 Marks) 11. (a) (i) Compare and contrast Structured Programming and Object iented Programming. (8) (ii) Distinguish between Data Encapsulation and Data Abstraction. (4) (iii) Mention the purpose of Constructor and Destructor functions. (4) (b) (i) Explain the control structures of C++ with suitable examples. (12) (ii) Define function overloading with a simple example. (4) 12. (a) (i) Differentiate inheritance from polymorphism. (6) (ii) Write a C++ program to illustrate the concept of hierarchical inheritance. (10) (b) (i) What is the use of template? Write an overloaded function template called max( ), which will find the maximum of any two given integers. (8) (ii) Explain the exception handling mechanism of C++ in detail. (8) 13. (a) (i) Explain the operations performed on queue in detail. Write a C++ program to implement
8 these queue operations. (10) (ii) Explain insertion, deletion and replacement of nodes in a heap. (6) (b) (i) What are the advantages of linked list over array? (4) (ii) Define Hashing. (2) (iii) Write a C++ program to implement stack through linked list. (10) 14. (a) (i) Write an algorithm to traverse binary tree level by level, with each level of the tree being traversed from left to right. (10) (ii) Explain spanning tree and minimal spanning tree with examples.(6) (b) (i) Define AVL tree. Explain the operations on AVL tree with illustrations. (6) (ii) Explain breadth first search algorithm for the traversal of any graph with suitable examples. Define time complexity of the algorithm. (10) 15. (a) (i) Explain heap sort with an illustration. (8) (ii) Explain the greedy algorithm to find minimum spanning tree. (8) (b) (i) Explain the insertion sort with its time complexity. (8) (ii) Explain as to how divide and conquer technique can be applied for merge sort. (8)
9 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011 Third Semester Electronics and Communication Engineering EC 2202 DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ (Regulation 2008) Time : Three hours Maximum : 100 Marks Answer ALL questions PART A (10 2 = 20 Marks) 1. Define polymorphism 2. What is the use of construction? 3. List the different types of inheritance supported in C Define pointers. 5. What are the disadvantages of DLL over SLL? 6. What is hashing? 7. Define binary tree with example. 8. What is meant by weighted graph? 9. Write the program for insertion sort. 10. Define shell sort. PART B (5 16 = 80 Marks) 11. (a) Explain in detail about classes and objects with example. (16) (b) With general syntax and example describe the operating overloading for unary and binary operators in detail. (16) 12. (a) Describe in detail about virtual classes and abstract classes. (16) (b) (i) Write short notes on virtual functions. (8) (ii) Differentiate Static polymorphism and Dynamic polymorphism. (8) 13. (a) Explain the Basic operations to performed on linked lists in details. (16) (b) Explain stack ADT in detail with suitable examples and general syntax. (16) 14. (a) Describe in detail about the shortest path algotith. (16) (b) Explain Prim s algorithm in detail with proper example. (16) 15. (a) Explain in detail about merge sort and quick sort with examples. (16) (b) Write short notes on (i) Greedy algorithm (8) (ii) Divide and Conquer algorithm (8)
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 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 informationSRI VENKATESWARA COLLEGE OF ENGINEERING. COURSE DELIVERY PLAN - THEORY Page 1 of 6
COURSE DELIVERY PLAN - THEORY Page 1 of 6 Department of Computer Science and Engineering B.E/B.Tech/M.E/M.Tech : B.E(CSE) & B.Tech (IT) Regulation:2016 PG Specialisation : -- : I LP: CS16301 Rev. No: 00
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 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 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 informationDepartment of Information Technology
COURSE DELIVERY PLAN - THEORY Page 1 of 6 Department of Information Technology B.Tech : Information Technology Regulation : 2013 Sub. Code / Sub. Name : CS6301 / Programming and Data Structures II Unit
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 informationVALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : II / III Section : CSE - 1 & 2 Subject Code : CS 6301 Subject Name : Programming
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 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 informationData Structures and Algorithm Analysis in C++
INTERNATIONAL EDITION Data Structures and Algorithm Analysis in C++ FOURTH EDITION Mark A. Weiss Data Structures and Algorithm Analysis in C++, International Edition Table of Contents Cover Title Contents
More informationChapter 1 Introduction
Preface xv Chapter 1 Introduction 1.1 What's the Book About? 1 1.2 Mathematics Review 2 1.2.1 Exponents 3 1.2.2 Logarithms 3 1.2.3 Series 4 1.2.4 Modular Arithmetic 5 1.2.5 The P Word 6 1.3 A Brief Introduction
More informationDepartment of Information Technology. II B.Tech I Sem. DATA STRUCTURES THROUGH C++ (Subject code# 53023) Dept of IT
Department of Information Technology II B.Tech I Sem DATA STRUCTURES THROUGH C++ (Subject code# 53023) Mrs.D.Sravanthi Asst. Professor J.B.Institute of Engg & Technology Yenkapally, Moinabad(Mandal) Himathnagar(post),Hydreabad
More informationSRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN
SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN Course Code : CS0201 Course Title : Data Structures using C++ Semester : III Course Time : JUL DEC
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 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 informationM.C.A DEGREE EXAMINATION,NOVEMBER/DECEMBER 2010 Second Semester MC 9222-OBJECT ORIENTED PROGRAMMING (Regulation 2009)
M.C.A DEGREE EXAMINATION,NOVEMBER/DECEMBER 2010 MC 9222-OBJECT ORIENTED PROGRAMMING (Regulation 2009) Max:100 Marks 1. How are data and function organized in an object oriented programming? 2. Compare
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 informationObject Oriented Programming
Object Oriented Programming Course Title: Object Oriented Programming Full Marks: 60 20 20 Course No: CSC161 Pass Marks: 24 8 8 Nature of Course: Theory Lab Credit Hrs: 3 Semester: II Course Description:
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 informationB.C.A 2017 OBJECT ORIENTED PROGRAMMING USING C++ BCA303T MODULE SPECIFICATION SHEET
B.C.A 2017 OBJECT ORIENTED PROGRAMMING USING C++ BCA303T MODULE SPECIFICATION SHEET Course Outline The main objective of this course is to introduce students to the basic concepts of a selected language
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 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 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 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 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 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 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 informationDEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Question Bank Subject Name: CS6402- Design & Analysis of Algorithm Year/Sem : II/IV UNIT-I INTRODUCTION
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 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 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 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 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 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 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 informationAnalysis of Algorithms
Second Edition Design and Analysis of Algorithms Prabhakar Gupta Vineet Agarwal Manish Varshney Design and Analysis of ALGORITHMS SECOND EDITION PRABHAKAR GUPTA Professor, Computer Science and Engineering
More informationSwami Ramanand Teerth Marathwada University, Nanded
Swami Ramanand Teerth Marathwada University, Nanded Syllabus B. Sc. First Year COMPUTER SCIENCE Semester System (MCQ Pattern) (To Be Implemented From Academic Year 2013-2014) Theory/ Practical Semester
More informationCS201 Design and Analysis of Algorithms Max.Marks:75
Syllabus for M.Sc. Computer Science Programme Semester II CS 201 Design and Analysis of Algorithms 100 ( 75 + 25 ) CS 202 Data Communication and Computer Network 100 ( 75 + 25 ) CS 203 Optimization Techniques
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 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 informationVirtual University of Pakistan
Virtual University of Pakistan Department of Computer Science Course Outline Course Instructor Dr. Sohail Aslam E mail Course Code Course Title Credit Hours 3 Prerequisites Objectives Learning Outcomes
More informationCLASSIC DATA STRUCTURES IN JAVA
CLASSIC DATA STRUCTURES IN JAVA Timothy Budd Oregon State University Boston San Francisco New York London Toronto Sydney Tokyo Singapore Madrid Mexico City Munich Paris Cape Town Hong Kong Montreal CONTENTS
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 informationCourse Review for Finals. Cpt S 223 Fall 2008
Course Review for Finals Cpt S 223 Fall 2008 1 Course Overview Introduction to advanced data structures Algorithmic asymptotic analysis Programming data structures Program design based on performance i.e.,
More informationQUESTION BANK. Prepared by,mrs.d.maladhy AP/IT,RGCET. Page 1
UNIT I 1.Write statements to declare integer Pointer and Float Pointer. Also write the statement to convert float pointer.(apr/may 2016) 2. What is a Stack? Mention the order followed to add or delete
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 informationCMPE 180A Data Structures and Algorithms in C++
San José State University Department of Computer Engineering CMPE 180A Data Structures and Algorithms in C++ Course and contact information Instructor: Ron Mak Office Location: ENG 250 Email: ron.mak@sjsu.edu
More informationMaanavaN.Com CS1203 OBJECT ORIENTED PROGRAMMING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING SUB CODE / SUBJECT: CS1203 / Object oriented programming YEAR / SEM: II / III QUESTION BANK UNIT I FUNDAMENTALS PART-A (2 MARKS) 1. What is Object Oriented
More informationS Y B Voc Software Development Syllabus
S Y B Voc Software Development Syllabus Course Level Job Roles Course Name: Pattern: Examination Pattern: Eligibility: Medium of Instruction: NSQF Level-VI 1. Jr. Software Developer 2. Trainer Software
More informationECE250: Algorithms and Data Structures Final Review Course
ECE250: Algorithms and Data Structures Final Review Course Ladan Tahvildari, PEng, SMIEEE Professor Software Technologies Applied Research (STAR) Group Dept. of Elect. & Comp. Eng. University of Waterloo
More informationObject Oriented Programming with c++ Question Bank
Object Oriented Programming with c++ Question Bank UNIT-1: Introduction to C++ 1. Describe the following characteristics of OOP. i Encapsulation ii Polymorphism, iii Inheritance 2. Discuss function prototyping,
More informationI BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++
No. of Printed Pages : 3 I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination 05723. June, 2015 BCS-031 : PROGRAMMING IN C ++ Time : 3 hours Maximum Marks : 100 (Weightage 75%)
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 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 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 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 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 informationCSC2100-Data Structures
CSC2100-Data Structures Final Remarks Department of Computer Science and Engineering The Chinese University of Hong Kong, Shatin, New Territories Interesting Topics More Graph Algorithms Finding cycles,
More informationAbout this exam review
Final Exam Review About this exam review I ve prepared an outline of the material covered in class May not be totally complete! Exam may ask about things that were covered in class but not in this review
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 informationObject Oriented Programming. Assistant Lecture Omar Al Khayat 2 nd Year
Object Oriented Programming Assistant Lecture Omar Al Khayat 2 nd Year Syllabus Overview of C++ Program Principles of object oriented programming including classes Introduction to Object-Oriented Paradigm:Structures
More information2. (a) Explain the concept of virtual functions in C++ with suitable examples. (b) Explain the concept of operator overloading in C++.
Code No: R059211201 Set No. 1 1. (a) What is a friend function? Explain the advantages and disadvantages of it? (b) What is static member function? Explain it s limitations. [8+8] 2. (a) Explain the concept
More informationVEER NARMAD SOUTH GUJARAT UNIVERSITY
VEER NARMAD SOUTH GUJARAT UNIVERSITY Revised syllabus B.C.A. Semester III B.C.A. Semester - III Teaching and Evaluation Scheme Paper No Paper Title Teaching Scheduled University Exam Theory/Practical Internal
More informationCOURSE PLAN. Assoc.Proffessor,Asst.Professor
COURSE PLAN FACULTY DETAILS: Name of the Faculty:: Designation: Department:: B.Madhavi,B.Deepthi Reddy Assoc.Proffessor,Asst.Professor IT COURSE DETAILS Name Of The Programme:: B.Tech Batch:: 2012-2016
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 informationCPSC 2380 Data Structures and Algorithms
CPSC 2380 Data Structures and Algorithms Spring 2014 Department of Computer Science University of Arkansas at Little Rock 2801 South University Avenue Little Rock, Arkansas 72204-1099 Class Hours: Tuesday
More informationUNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.5) Sessional Unit Code. Theory Unit Course
COURSE STRUCTURE (W.E.F. 2011 Batch Students) (Total Unit 7.5) Course Theory Unit Course Sessional Unit Code Code DCP 4001 Data Structures 1.0 DCP 4002 Data Structures Lab. 0.5 DEC 4003 Electronics Circuits
More informationLesson Plan. Subject: OBJECT ORIENTED PROGRAMMING USING C++ :15 weeks (From January, 2018 to April,2018)
Lesson Plan Name of the Faculty Discipline Semester :Mrs. Reena Rani : Computer Engineering : IV Subject: OBJECT ORIENTED PROGRAMMING USING C++ Lesson Plan Duration :15 weeks (From January, 2018 to April,2018)
More informationPreface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p.
Preface to the Second Edition p. iii Preface to the First Edition p. vi Brief Contents p. ix Introduction to C++ p. 1 A Review of Structures p. 1 The Need for Structures p. 1 Creating a New Data Type Using
More informationChapter 14. Graphs Pearson Addison-Wesley. All rights reserved 14 A-1
Chapter 14 Graphs 2011 Pearson Addison-Wesley. All rights reserved 14 A-1 Terminology G = {V, E} A graph G consists of two sets A set V of vertices, or nodes A set E of edges A subgraph Consists of a subset
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 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 informationAP Computer Science 4325
4325 Instructional Unit Algorithm Design Techniques -divide-and-conquer The students will be -Decide whether an algorithm -classroom discussion -backtracking able to classify uses divide-and-conquer, -worksheets
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 informationCS 206 Introduction to Computer Science II
CS 206 Introduction to Computer Science II 01 / 21 / 2015 Instructor: Michael Eckmann Today s Topics Introduction of myself Review the syllabus List of Topics we'll cover Start Java review Who is your
More informationDesign and Analysis of Algorithms. Comp 271. Mordecai Golin. Department of Computer Science, HKUST
Design and Analysis of Algorithms Revised 05/02/03 Comp 271 Mordecai Golin Department of Computer Science, HKUST Information about the Lecturer Dr. Mordecai Golin Office: 3559 Email: golin@cs.ust.hk http://www.cs.ust.hk/
More informationCOLLEGE OF THE DESERT
COLLEGE OF THE DESERT Course Code CS-009 Course Outline of Record 1. Course Code: CS-009 2. a. Long Course Title: Data Structures and Algorithms b. Short Course Title: DATA STRUCTURES 3. a. Catalog Course
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 informationOverview of Data Structures, Algorithm Analysis
SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : Advanced Data structures and Algorithms (16CS5804) Year & Sem: M.Tech
More informationChapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.
Chapter 9 Greedy Technique Copyright 2007 Pearson Addison-Wesley. All rights reserved. Greedy Technique Constructs a solution to an optimization problem piece by piece through a sequence of choices that
More informationCHOICE BASED CREDIT SYSTEM (With effect from )
B.Sc. Computer Science Syllabus Under the CHOICE BASED CREDIT SYSTEM (With effect from 2017-18) DEPARTMENT OF COMPUTER SCIENCE University College,TU,Nizamabad-503322 Syllabus for Computer Science (With
More informationPartha Sarathi Mandal
MA 253: Data Structures Lab with OOP Tutorial 1 http://www.iitg.ernet.in/psm/indexing_ma253/y13/index.html Partha Sarathi Mandal psm@iitg.ernet.in Dept. of Mathematics, IIT Guwahati Reference Books Cormen,
More informationRAJIV GANDHI COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY OBJECT ORIENTED PROGRAMMING QUESTION BANK UNIT I 2 MARKS
RAJIV GANDHI COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY OBJECT ORIENTED PROGRAMMING YEAR/SEM:II & III UNIT I 1) Give the evolution diagram of OOPS concept. 2) Give some
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 informationPage 1 of 7 SCAA Dt
Page 1 of 7 SCAA Dt. 06.02.2014 BHARATHIAR UNIVERSITY, COIMBATORE Br. I. (b). M.Sc. Mathematics (CA) (The curriculum is offered by the University Department under CBCS Pattern) (with effect from 2014-15
More informationM.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75
M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES (DMCS 01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45)
More information2) Explain in detail about different AVL rotation applied on unbalanced trees.
(DMCS 01) ASSIGNMENT - 1, MAY-2014. PAPER- I : DATA STRUCTURES 1) Define circular queue. Write an algorithm to describe insertion and deletion operation on a circular queue. Illustrate these operations
More informationSyllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE1303. B.Tech. Year - II
Subject Code: 01CE1303 Subject Name: Object Oriented Design and Programming B.Tech. Year - II Objective: The objectives of the course are to have students identify and practice the object-oriented programming
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 informationMCA 201 PROBABILITY AND STATISTICS
MCA 201 PROBABILITY AND STATISTICS Module 1:-Basic Statistics Measures of central tendency: - mean, median, mode; Measures of dispersion- Range, Mean deviation, Quartile deviation and Standard deviation;
More informationB.Sc. Computer Science (Ancillary)
Session - 03- onwards.. B.Sc. Computer Science (Ancillary) About the Course Technology is defined as the application of scientific knowledge for practical purposes. The radical changes in technologies
More informationXII- COMPUTER SCIENCE VOL-II MODEL TEST I
MODEL TEST I 1. What is the significance of an object? 2. What are Keyword in c++? List a few Keyword in c++?. 3. What is a Pointer? (or) What is a Pointer Variable? 4. What is an assignment operator?
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 informationUniversity of Waterloo Department of Electrical and Computer Engineering ECE 250 Data Structures and Algorithms. Final Examination T09:00
University of Waterloo Department of Electrical and Computer Engineering ECE 250 Data Structures and Algorithms Instructor: Douglas Wilhelm Harder Time: 2.5 hours Aides: none 18 pages Final Examination
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 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 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 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 informationFACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN
FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN Course Code: CS1005 Course Title: Object Oriented Programming Semester: II Course Time: Jul-Dec 2014 A B C D E F
More information