Algorithms, merits and demerits, Exponentiation, How to compute fast exponentiation Linear Search, Binary Search "Big Oh" notation, Worst case

Size: px
Start display at page:

Download "Algorithms, merits and demerits, Exponentiation, How to compute fast exponentiation Linear Search, Binary Search "Big Oh" notation, Worst case"

Transcription

1 Class and Section...B.C.A (nd Sem.) Subject...Mathematical Foundation Of Computer Science Week Date Topics 8-Jan-8 Measure of Central Tendency 9-Jan-8 0-Jan-8 -Jan-8 -Jan-8 -Jan-8 -Jan-8 5-Jan-8 6-Jan-8 7-Jan-8 8-Jan-8 9-Jan-8 0-Jan-8 -Jan-8 -Jan-8 -Jan-8 -Jan-8 5-Jan-8 6-Jan-8 7-Jan-8 8-Jan-8 9-Jan-8 0-Jan-8 -Jan-8 Preparing frequency distribution table Mean, Mode, Median Measure of Dispersion: Range, Variance and Standard Deviations Correlation Regression Algorithms, merits and demerits, Exponentiation, How to compute fast exponentiation Linear Search, Binary Search "Big Oh" notation, Worst case Holiday(Vasant Panchmi) Advantage of logarithmic algorithms over linear algorithms Holiday(Sir Chotu Ram Jayanti) Republic Day Graphs, Types of graphs, degree of vertex, sub graph isomorphic and homeomorphic graphs

2 Class and Section...B.C.A (nd Sem.) Subject...M.F.C.S 5 -Feb-8 -Feb-8 -Feb-8 -Feb-8 5-Feb-8 6-Feb-8 7-Feb-8 8-Feb-8 9-Feb-8 0-Feb-8 -Feb-8 -Feb-8 -Feb-8 -Feb-8 5-Feb-8 6-Feb-8 7-Feb-8 8-Feb-8 9-Feb-8 0-Feb-8 -Feb-8 -Feb-8 -Feb-8 -Feb-8 5-Feb-8 6-Feb-8 7-Feb-8 8-Feb-8 Adjacent and incidence matrices Path Circuit ; Eulerian,Hamiltonian path circuit UNIT TEST- Trees Minimum distance trees Minimum weight and Minimum distance spanning S Holiday(Maharshi Dayanand Jayanti) Recursion: Recursively defined function. Holiday(Maha Shivratri) Merge sort Insertion sort Bubble sort Decimal to Binary Recurrence Relations: LHRR LHRRWCCs DCRR Recursive procedures Number Theory: Principle of Mathematical induction GCD Euclidean algorithm

3 Class and Section...B.C.A (nd Sem.) Subject...M.F.C.S 5 -Mar-8 -Mar-8 -Mar-8 -Mar-8 5-Mar-8 6-Mar-8 7-Mar-8 8-Mar-8 9-Mar-8 0-Mar-8 -Mar-8 -Mar-8 -Mar-8 -Mar-8 5-Mar-8 6-Mar-8 7-Mar-8 8-Mar-8 9-Mar-8 0-Mar-8 -Mar-8 -Mar-8 -Mar-8 -Mar-8 5-Mar-8 6-Mar-8 7-Mar-8 8-Mar-8 9-Mar-8 0-Mar-8 -Mar-8 Holiday(Guru Ravidas Birthday) Holiday(Holi) Fibonacci numbers UNIT-TEST- congruences and equivalence relations public key encryption sc UNIT- UNIT- UNIT- UNIT- UNIT- UNIT- UNIT- UNIT- UNIT- UNIT- UNIT- UNIT- UNIT- UNIT- /Ram Navami UNIT- UNIT- UNIT- Holiday(Mahavir Jayanti) UNIT- UNIT-

4 Name of the Assistant/Associate Professor KHUSHBOO Class and Section...B.C.A (nd Sem.) Subject...M.F.C.S -Apr-8 -Apr-8 -Apr-8 -Apr-8 5-Apr-8 6-Apr-8 7-Apr-8 8-Apr-8 9-Apr-8 0-Apr-8 -Apr-8 -Apr-8 -Apr-8 -Apr-8 5-Apr-8 6-Apr-8 7-Apr-8 8-Apr-8 9-Apr-8 0-Apr-8 -Apr-8 -Apr-8 -Apr-8 -Apr-8 5-Apr-8 6-Apr-8 7-Apr-8 8-Apr-8 9-Apr-8 0-Apr-8 UNIT- UNIT TEST- Holiday(Dr. Ambedkar Jayanti/Vaisakhi) Holiday(Parashu Ram Jayanti)

5 Name of the Assistant/Associate Professor Khushboo Bhargava Class and Section...B.C.A (th Sem.) Subject...Data Structure-II Week Date Topics 8-Jan-8 Introduction to Data Structure 9-Jan-8 0-Jan-8 -Jan-8 -Jan-8 -Jan-8 -Jan-8 5-Jan-8 6-Jan-8 7-Jan-8 8-Jan-8 9-Jan-8 0-Jan-8 -Jan-8 -Jan-8 -Jan-8 -Jan-8 5-Jan-8 6-Jan-8 7-Jan-8 8-Jan-8 9-Jan-8 0-Jan-8 -Jan-8 Tree: Header nodes, Threads Binary search trees, Searching Insertion in a Binary search tree deletion in a Binary search tree AVL search trees Insertion in AVL search tree, Deletion in AVL search tree m-way search tree Searching m-way search tree Insertion m-way search tree deletion B-trees, Searching, Holiday(Vasant Panchmi) Insertion in a B-tree Holiday(Sir Chotu Ram Jayanti) deletion in a B-tree Republic Day B+tree Huffman s algorithm, General trees.

6 Class and Section...B.C.A ( th SEM) Subject...Data Structure -II 5 -Feb-8 -Feb-8 -Feb-8 -Feb-8 5-Feb-8 6-Feb-8 7-Feb-8 8-Feb-8 9-Feb-8 0-Feb-8 -Feb-8 -Feb-8 -Feb-8 -Feb-8 5-Feb-8 6-Feb-8 7-Feb-8 8-Feb-8 9-Feb-8 0-Feb-8 -Feb-8 -Feb-8 -Feb-8 -Feb-8 5-Feb-8 6-Feb-8 7-Feb-8 8-Feb-8 Graphs: Warshall s algorithm for shortest path, Dijkstra algorithm for shortest path Unit- Unit Test Operations on graphs Traversal of graph, Topological sorting. Holiday(Maharshi Dayanand Jayanti) Holiday(Maha Shivratri) Radix sort, Quick sort Heap Heap sort Merge sort, Tournament sort Searching: Liner search, binary search Merging Comparison of various sorting and searching algorithms Files: Physical storage devices and their characteristics Files: Physical storage devices and their characteristics

7 Class and Section...B.C.A (th Sem.) Subject...Data Structure-II 5 -Mar-8 -Mar-8 -Mar-8 -Mar-8 5-Mar-8 6-Mar-8 7-Mar-8 8-Mar-8 9-Mar-8 0-Mar-8 -Mar-8 -Mar-8 -Mar-8 -Mar-8 5-Mar-8 6-Mar-8 7-Mar-8 8-Mar-8 9-Mar-8 0-Mar-8 -Mar-8 -Mar-8 -Mar-8 -Mar-8 5-Mar-8 6-Mar-8 7-Mar-8 8-Mar-8 9-Mar-8 0-Mar-8 -Mar-8 Holiday(Guru Ravidas Birthday) Holiday(Holi) Files: Physical storage devices and their characteristics Attributes of a file Classification of files File Operations Comparison of various types of files File organization: Serial Sequential Indexed-sequential Random-access/Direct Inverted Multilist file organization Hashing: Introduction Hashing functions Collision resolution method Collision resolution method Unit Test /Ram Navami Holiday(Mahavir Jayanti)

8 Class and Section...B.C.A (th Sem.) Subject...Data Structure-II -Apr-8 -Apr-8 Unit-Test -Apr-8 -Unit - -Apr-8 -Unit - 5-Apr-8 -Unit - 6-Apr-8 -Unit - 7-Apr-8 -Unit - 8-Apr-8 9-Apr-8 -Unit - 0-Apr-8 -Unit - -Apr-8 -Unit - -Apr-8 -Unit - -Apr-8 -Unit - -Apr-8 5-Apr-8 Holiday(Dr. Ambedkar Jayanti/Vaisakhi) 6-Apr-8 -Unit - 7-Apr-8 -Unit - 8-Apr-8 Holiday(Parashu Ram Jayanti) 9-Apr-8 -Unit - 0-Apr-8 -Unit - -Apr-8 -Unit - -Apr-8 -Apr-8 -Unit - -Apr-8 -Unit - 5-Apr-8 -Unit - 6-Apr-8 7-Apr-8 8-Apr-8 9-Apr-8 0-Apr-8 Presentation Presentation Presentation Presentation

9 Name of the Assistant/Associate Professor KHUSHBOO Class and Section...B.C.A (6th Sem.) Subject.Object Technologies and Programming Using JAVA Week Date Topics 8-Jan-8 Object Oriented Methodology-: Paradigms of Programming Languages 9-Jan-8 0-Jan-8 -Jan-8 -Jan-8 -Jan-8 -Jan-8 5-Jan-8 6-Jan-8 7-Jan-8 8-Jan-8 9-Jan-8 0-Jan-8 -Jan-8 -Jan-8 -Jan-8 -Jan-8 5-Jan-8 6-Jan-8 7-Jan-8 8-Jan-8 9-Jan-8 0-Jan-8 -Jan-8 Evolution of OO Methodology Basic Concepts of OO Approach Basic Concepts of OO Approach Comparison of Object Oriented and Procedure Oriented Approaches Benefits of OOPs Introduction to Common OO Language Applications of OOPs Object Oriented Methodology-: Classes and Objects Abstraction and Encapsulation Inheritance Method Overriding Holiday(Vasant Panchmi) Polymorphism Holiday(Sir Chotu Ram Jayanti) Republic Day Java Language Basics: Introduction To Java Basic Features Java Virtual Machine Concepts

10 Class and Section...B.C.A (6th Sem.) Subject...JAVA 5 -Feb-8 -Feb-8 -Feb-8 -Feb-8 5-Feb-8 6-Feb-8 7-Feb-8 8-Feb-8 9-Feb-8 0-Feb-8 -Feb-8 -Feb-8 -Feb-8 -Feb-8 5-Feb-8 6-Feb-8 7-Feb-8 8-Feb-8 9-Feb-8 0-Feb-8 -Feb-8 -Feb-8 -Feb-8 -Feb-8 5-Feb-8 6-Feb-8 7-Feb-8 8-Feb-8 Primitive Data Type And Variables Java Operators Expressions, UNIT-TEST Statements Arrays Object Oriented Concepts: Class and Objects Holiday(Maharshi Dayanand Jayanti) Class Fundamentals Holiday(Maha Shivratri) Creating objects Assigning object reference variables Introducing Methods, Static methods Constructors,Overloading constructors This Keyword Using Objects as Parameters Argument passing Returning objects Method overloading Garbage Collection The Finalize ( ) Method Inheritance and Polymorphism: Inheritance Basics Access Control

11 Class and Section...B.C.A (6th Sem.) Subject...JAVA 5 -Mar-8 Holiday(Guru Ravidas Birthday) -Mar-8 Holiday(Holi) -Mar-8 Method Overriding -Mar-8 5-Mar-8 Abstract Classes 6-Mar-8 Polymorphism 7-Mar-8 Final Keyword 8-Mar-8 9-Mar-8 UNIT-TEST 0-Mar-8 Packages : Defining Package -Mar-8 -Mar-8 CLASSPATH -Mar-8 Package naming -Mar-8 Accessibility of Packages 5-Mar-8 Using Package Members 6-Mar-8 Interfaces: Implementing Interfaces 7-Mar-8 Interface and Abstract Classes 8-Mar-8 9-Mar-8 Extends and Implements together 0-Mar-8 Exceptions Handling : Exception -Mar-8 Handling of Exception, Using try-catch -Mar-8 Catching Multiple Exceptions -Mar-8 Using finally clause -Mar-8 Types of Exceptions, 5-Mar-8 /Ram Navami 6-Mar-8 Throwing Exceptions 7-Mar-8 Writing Exception Subclasses 8-Mar-8 Multithreading : Introduction 9-Mar-8 Holiday(Mahavir Jayanti) 0-Mar-8 The Main Thread -Mar-8 Java Thread Model

12 Class and Section...B.C.A(6th Sem.) Subject...JAVA -Apr-8 -Apr-8 -Apr-8 -Apr-8 5-Apr-8 6-Apr-8 7-Apr-8 8-Apr-8 9-Apr-8 0-Apr-8 -Apr-8 -Apr-8 -Apr-8 UNIT TEST- Thread Priorities, Synchronization in Java Inter thread Communication. I/O in Java : I/O Basics Streams and Stream Classes The Predefined Streams, Reading from, and Writing to, Console, Reading and Writing Files -Apr-8 5-Apr-8 6-Apr-8 7-Apr-8 8-Apr-8 9-Apr-8 0-Apr-8 -Apr-8 -Apr-8 -Apr-8 -Apr-8 5-Apr-8 6-Apr-8 7-Apr-8 8-Apr-8 9-Apr-8 0-Apr-8 Holiday(Dr. Ambedkar Jayanti/Vaisakhi) The Transient and Volatile Modifiers Using Instance of Native Methods. Holiday(Parashu Ram Jayanti) Strings and Characters : Fundamentals of Characters and Strings The String Class String Operations Data Conversion using Value Of ( ) Methods String Buffer Class and Methods. UNIT- UNIT- UNIT- UNIT- UNIT-

LESSON PLAN Name of the Assistant/Associate Professor HARBHAJAN SINGH Class and Section...BCA (2nd Sem.) Subject...

LESSON PLAN Name of the Assistant/Associate Professor HARBHAJAN SINGH Class and Section...BCA (2nd Sem.) Subject... Class and Section...BCA (nd Sem.) Subject...PROGRAMMING IN C Week Date Topics 8-Jan-8 Introduction to Programming Languages 9-Jan-8 0-Jan-8 -Jan-8 -Jan-8 -Jan-8 -Jan-8 5-Jan-8 6-Jan-8 7-Jan-8 8-Jan-8 9-Jan-8

More information

Course 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. 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 information

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

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 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 information

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

OBJECT 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 information

Java Fundamentals p. 1 The Origins of Java p. 2 How Java Relates to C and C++ p. 3 How Java Relates to C# p. 4 Java's Contribution to the Internet p.

Java Fundamentals p. 1 The Origins of Java p. 2 How Java Relates to C and C++ p. 3 How Java Relates to C# p. 4 Java's Contribution to the Internet p. Preface p. xix Java Fundamentals p. 1 The Origins of Java p. 2 How Java Relates to C and C++ p. 3 How Java Relates to C# p. 4 Java's Contribution to the Internet p. 5 Java Applets and Applications p. 5

More information

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (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 information

Question Paper Code : 97044

Question 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 information

About this exam review

About 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 information

SRM INSTITUTE OF SCIENCE & TECHNOLOGY Faculty of Science and Humanities Department of Computer Science UNIT I - INTRODUCTION TO JAVA

SRM INSTITUTE OF SCIENCE & TECHNOLOGY Faculty of Science and Humanities Department of Computer Science UNIT I - INTRODUCTION TO JAVA SRM INSTITUTE OF SCIENCE & TECHNOLOGY Faculty of Science and Humanities Department of Computer Science Subject code : UCS15301 Subject Name : Java Programming Staff Name : S.P.ANGELIN CLARET No. of : 5

More information

CSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid

CSCE 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 information

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

End-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 information

CSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid. Fall 2018

CSCE 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 information

Syllabus & Curriculum for Certificate Course in Java. CALL: , for Queries

Syllabus & Curriculum for Certificate Course in Java. CALL: , for Queries 1 CONTENTS 1. Introduction to Java 2. Holding Data 3. Controllin g the f l o w 4. Object Oriented Programming Concepts 5. Inheritance & Packaging 6. Handling Error/Exceptions 7. Handling Strings 8. Threads

More information

CS2013 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 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 information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 Course Title Course Code Regulation COMPUTER SCIENCE AND ENGINEERING COURSE DESCRIPTION FORM JAVA PROGRAMMING A40503 R15-JNTUH

More information

SECOND SEMESTER JAVA PROGRAMMING

SECOND 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 information

Java 2. Course Outcome Summary. Western Technical College. Course Information. Course History. Course Competencies

Java 2. Course Outcome Summary. Western Technical College. Course Information. Course History. Course Competencies Western Technical College 10152155 Java 2 Course Outcome Summary Course Information Description Career Cluster Instructional Level Total Credits 4.00 Total Hours 90.00 The goal as programmers, is to create

More information

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05

COURSE: 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 information

[Course Overview] After completing this module you are ready to: Develop Desktop applications, Networking & Multi-threaded programs in java.

[Course Overview] After completing this module you are ready to: Develop Desktop applications, Networking & Multi-threaded programs in java. [Course Overview] The Core Java technologies and application programming interfaces (APIs) are the foundation of the Java Platform, Standard Edition (Java SE). They are used in all classes of Java programming,

More information

CORE JAVA TRAINING COURSE CONTENT

CORE JAVA TRAINING COURSE CONTENT CORE JAVA TRAINING COURSE CONTENT SECTION 1 : INTRODUCTION Introduction about Programming Language Paradigms Why Java? Flavors of Java. Java Designing Goal. Role of Java Programmer in Industry Features

More information

SCHEME OF COURSE WORK

SCHEME OF COURSE WORK SCHEME OF COURSE WORK Course Details: Course Title Object oriented programming through JAVA Course Code 15CT1109 L T P C : 3 0 0 3 Program: B.Tech. Specialization: Information Technology Semester IV Prerequisites

More information

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

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 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

Contents. Figures. Tables. Examples. Foreword. Preface. 1 Basics of Java Programming 1. xix. xxi. xxiii. xxvii. xxix

Contents. Figures. Tables. Examples. Foreword. Preface. 1 Basics of Java Programming 1. xix. xxi. xxiii. xxvii. xxix PGJC4_JSE8_OCA.book Page ix Monday, June 20, 2016 2:31 PM Contents Figures Tables Examples Foreword Preface xix xxi xxiii xxvii xxix 1 Basics of Java Programming 1 1.1 Introduction 2 1.2 Classes 2 Declaring

More information

DATA ABSTRACTION AND PROBLEM SOLVING WITH JAVA

DATA ABSTRACTION AND PROBLEM SOLVING WITH JAVA DATA ABSTRACTION AND PROBLEM SOLVING WITH JAVA WALLS AND MIRRORS First Edition Frank M. Carrano University of Rhode Island Janet J. Prichard Bryant College Boston San Francisco New York London Toronto

More information

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

R10 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 information

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit: JAVA PROGRAMMING UNIT-1: Introduction To Java, Getting Started With Java, Applets And Application, Creating A Java Application, Creating A Java Applets, Object Oriented Programming In Java, Object And

More information

DATA STRUCTURES AND PROBLEM SOLVING USING JAVA

DATA STRUCTURES AND PROBLEM SOLVING USING JAVA DATA STRUCTURES AND PROBLEM SOLVING USING JAVA Second Edition MARK ALLEN WEISS Florida International University Addison Wesley Boston San Francisco New York London Toronto Sydney Tokyo Singapore Madrid

More information

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions) By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable

More information

Data Structures and Abstractions with Java

Data Structures and Abstractions with Java Global edition Data Structures and Abstractions with Java Fourth edition Frank M. Carrano Timothy M. Henry Data Structures and Abstractions with Java TM Fourth Edition Global Edition Frank M. Carrano University

More information

The Sun s Java Certification and its Possible Role in the Joint Teaching Material

The Sun s Java Certification and its Possible Role in the Joint Teaching Material The Sun s Java Certification and its Possible Role in the Joint Teaching Material Nataša Ibrajter Faculty of Science Department of Mathematics and Informatics Novi Sad 1 Contents Kinds of Sun Certified

More information

Big Java Late Objects

Big Java Late Objects Big Java Late Objects Horstmann, Cay S. ISBN-13: 9781118087886 Table of Contents 1. Introduction 1.1 Computer Programs 1.2 The Anatomy of a Computer 1.3 The Java Programming Language 1.4 Becoming Familiar

More information

Supplement I.A: Glossary. For Introduction to C++ Programming, Second Edition By Y. Daniel Liang

Supplement I.A: Glossary. For Introduction to C++ Programming, Second Edition By Y. Daniel Liang Chapter 1 Supplement I.A: Glossary For Introduction to C++ Programming, Second Edition By Y. Daniel Liang assembly language A low-level programming language in which a mnemonic is used to represent each

More information

MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE

MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE A Modern Approach to Discrete Mathematics SIXTH EDITION Judith L. Gersting University of Hawaii at Hilo W. H. Freeman and Company New York Preface Note to the

More information

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE PART A UNIT I 1. Differentiate object oriented programming from procedure oriented programming. 2. Define abstraction and encapsulation. 3. Differentiate

More information

Table of Contents. Chapter 1: Introduction to Data Structures... 1

Table 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 information

DEPARTMENT OF INFORMATION TECHNOLOGY

DEPARTMENT OF INFORMATION TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY II Year/III Sem CS8392- OBJECT ORIENTED PROGRAMMING Prepared by: Komal Kumar.N, AP/IT, VTHT UNIVERSITY QUESTIONS FROM 2011 to 2018 PART-A 1. What are the advantages

More information

SRI VENKATESWARA COLLEGE OF ENGINEERING. COURSE DELIVERY PLAN - THEORY Page 1 of 6

SRI 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 information

Computer Algorithms. Introduction to Algorithm

Computer Algorithms. Introduction to Algorithm Computer Algorithms Introduction to Algorithm CISC 4080 Yanjun Li 1 What is Algorithm? An Algorithm is a sequence of well-defined computational steps that transform the input into the output. These steps

More information

CONTENTS. PART 1 Structured Programming 1. 1 Getting started 3. 2 Basic programming elements 17

CONTENTS. PART 1 Structured Programming 1. 1 Getting started 3. 2 Basic programming elements 17 List of Programs xxv List of Figures xxix List of Tables xxxiii Preface to second version xxxv PART 1 Structured Programming 1 1 Getting started 3 1.1 Programming 3 1.2 Editing source code 5 Source code

More information

DESIGN AND ANALYSIS OF ALGORITHMS

DESIGN AND ANALYSIS OF ALGORITHMS DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK Module 1 OBJECTIVE: Algorithms play the central role in both the science and the practice of computing. There are compelling reasons to study algorithms.

More information

ASSIGNMENTS. 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. 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 information

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

A6-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 information

CLASSIC DATA STRUCTURES IN JAVA

CLASSIC 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 information

Operations of E-commerce Credit cardtransaction Secure Hypertext Transfer Protocol (SHTP) Teaching/Quiz

Operations of E-commerce Credit cardtransaction Secure Hypertext Transfer Protocol (SHTP) Teaching/Quiz Name of Institution: Name of the Faculty: Seth Jai ParkashMukandLal Institute of Engg. & Tech.Radaur Er. Ravi Kamboj Discipline: Semester: MCA 4 th Subject: E-Commerce(BCA -243) Lesson Plan Duration: 13

More information

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Question Bank Subject Name: CS6402- Design & Analysis of Algorithm Year/Sem : II/IV UNIT-I INTRODUCTION

DEPARTMENT 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 information

Supplement I.A: Glossary For Introduction to Programming and Data Structures with C++ Fourth Edition By Y. Daniel Liang

Supplement I.A: Glossary For Introduction to Programming and Data Structures with C++ Fourth Edition By Y. Daniel Liang Chapter 1 Supplement I.A: Glossary For Introduction to Programming and Data Structures with C++ Fourth Edition By Y. Daniel Liang assembler A program that translates assembly-language programs into machine

More information

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24

Bachelor 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 information

University of Engineering and Technology School of Computer Science Syllabus of Course Academic Period 2018-II

University of Engineering and Technology School of Computer Science Syllabus of Course Academic Period 2018-II University of Engineering and Technology School of Computer Science Syllabus of Course Academic Period 2018-II 1. Code and Name: CS1103. Objects oriented programming II 2. Credits: 4 3. Hours of theory

More information

Supplement I.A: Glossary. For Introduction to C++ Programming, Third Edition By Y. Daniel Liang

Supplement I.A: Glossary. For Introduction to C++ Programming, Third Edition By Y. Daniel Liang Chapter 1 Supplement I.A: Glossary For Introduction to C++ Programming, Third Edition By Y. Daniel Liang assembler A program that translates assembly-language programs into machine code. assembly language

More information

CSC2100-Data Structures

CSC2100-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 information

Java SE 8 Programming

Java SE 8 Programming Oracle University Contact Us: +52 1 55 8525 3225 Java SE 8 Programming Duration: 5 Days What you will learn This Java SE 8 Programming training covers the core language features and Application Programming

More information

Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:

Tribhuvan 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 information

Seth Jai Parkash Polytechnic, Damla

Seth Jai Parkash Polytechnic, Damla Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Ms Richa Kharbanda Discipline: Computer Engg. Semester: 4 th Subject: DATA STRUCTURES USING C Lesson Plan Duration: 15 weeks (from January, 2018

More information

Topic Analysis PART-A

Topic Analysis PART-A Govt. of Karnataka, Department of Technical Education Diploma in Information Science & Engineering Third Semester Subject: ANALYSIS AND DESIGN OF ALGORITHM Contact Hrs / week: Total hrs: 64 Topic Analysis

More information

Algorithms and Data Structures Spring 2008

Algorithms and Data Structures Spring 2008 Algorithms and Data Structures Spring 2008 Instructors: Professor Joe Fuller Dr. Sarita Bassil Office: 205B Gullickson Hall 207 Gullickson Hall Phone: 696-6204 696-5444 Email: fullerj@marshall.edu bassil@marshall.edu

More information

Data Structures and Algorithm Analysis in C++

Data 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 information

About the Author. Dependency Chart. Chapter 1: Logic and Sets 1. Chapter 2: Relations and Functions, Boolean Algebra, and Circuit Design

About the Author. Dependency Chart. Chapter 1: Logic and Sets 1. Chapter 2: Relations and Functions, Boolean Algebra, and Circuit Design Preface About the Author Dependency Chart xiii xix xxi Chapter 1: Logic and Sets 1 1.1: Logical Operators: Statements and Truth Values, Negations, Conjunctions, and Disjunctions, Truth Tables, Conditional

More information

Time : 3 hours. Full Marks : 75. Own words as far as practicable. The questions are of equal value. Answer any five questions.

Time : 3 hours. Full Marks : 75. Own words as far as practicable. The questions are of equal value. Answer any five questions. XEV (H-3) BCA (6) 2 0 1 0 Time : 3 hours Full Marks : 75 Candidates are required to give their answers in their Own words as far as practicable. The questions are of equal value. Answer any five questions.

More information

COURSE OUTCOMES OF M.Sc(IT)

COURSE OUTCOMES OF M.Sc(IT) COURSE OUTCOMES OF M.Sc(IT) Sr. No Subject Code Subject Name Sem-I CO Status Course Outcomes 1. A304101 PROGRAMMING USING C 2. A304102 FUNDAMENTALS OF COMPUTER & INFORMATION TECHNOLOGIES CO1 CO2 Understands

More information

QUESTION BANK. Prepared by,mrs.d.maladhy AP/IT,RGCET. Page 1

QUESTION 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 information

Virtual University of Pakistan

Virtual 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 information

STRUCTURE 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 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 information

SAURASHTRA UNIVERSITY

SAURASHTRA 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 information

Week. Lecture Topic day (including assignment/test) 1 st 1 st Introduction to Module 1 st. Practical

Week. Lecture Topic day (including assignment/test) 1 st 1 st Introduction to Module 1 st. Practical Name of faculty: Gaurav Gambhir Discipline: Computer Science Semester: 6 th Subject: CSE 304 N - Essentials of Information Technology Lesson Plan Duration: 15 Weeks (from January, 2018 to April, 2018)

More information

Java Training For Six Weeks

Java Training For Six Weeks Java Training For Six Weeks Java is a set of several computer software and specifications developed by Sun Microsystems, later acquired by Oracle Corporation that provides a system for developing application

More information

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

SRM 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 / III Subject Name

More information

Part I Basic Concepts 1

Part I Basic Concepts 1 Introduction xiii Part I Basic Concepts 1 Chapter 1 Integer Arithmetic 3 1.1 Example Program 3 1.2 Computer Program 4 1.3 Documentation 5 1.4 Input 6 1.5 Assignment Statement 7 1.5.1 Basics of assignment

More information

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

R13. 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 information

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Total 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 information

Get Unique study materials from

Get 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 information

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6

More information

AP Computer Science 4325

AP 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 information

Introduction to Algorithms Third Edition

Introduction to Algorithms Third Edition Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Preface xiü I Foundations Introduction

More information

Department of Information Technology

Department 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 information

Java SE 8 Programming

Java SE 8 Programming Oracle University Contact Us: Local: 1800 103 4775 Intl: +91 80 67863102 Java SE 8 Programming Duration: 5 Days What you will learn This Java SE 8 Programming training covers the core language features

More information

[CHAPTER] 1 INTRODUCTION 1

[CHAPTER] 1 INTRODUCTION 1 FM_TOC C7817 47493 1/28/11 9:29 AM Page iii Table of Contents [CHAPTER] 1 INTRODUCTION 1 1.1 Two Fundamental Ideas of Computer Science: Algorithms and Information Processing...2 1.1.1 Algorithms...2 1.1.2

More information

Name of subject: JAVA PROGRAMMING Subject code: Semester: V ASSIGNMENT 1

Name of subject: JAVA PROGRAMMING Subject code: Semester: V ASSIGNMENT 1 Name of subject: JAVA PROGRAMMING Subject code: 17515 Semester: V ASSIGNMENT 1 3 Marks Introduction to Java (16 Marks) 1. Write all primitive data types available in java with their storage size in bytes.

More information

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

DYNAMIC 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 information

INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTE OF AERONAUTICAL ENGINEERING INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) DUNDIGAL, YDERABAD -500 043 Course Title Course Code Regulation INFORMATION TECNOLOGY COURSE DESCRIPTION FORM JAVA PROGRAMMING A40503 R13 JNTU Course

More information

CS 210 Algorithms and Data Structures College of Information Technology and Engineering Weisberg Division of Engineering and Computer Science

CS 210 Algorithms and Data Structures College of Information Technology and Engineering Weisberg Division of Engineering and Computer Science CS 210 Algorithms and Data Structures College of Information Technology and Engineering Weisberg Division of Engineering and Computer Science Semester and Year: Fall 2008 Classroom Section, Meeting Times,

More information

CS 445: Data Structures Final Examination: Study Guide

CS 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 information

CS Internet programming Unit- I Part - A 1 Define Java. 2. What is a Class? 3. What is an Object? 4. What is an Instance?

CS Internet programming Unit- I Part - A 1 Define Java. 2. What is a Class? 3. What is an Object? 4. What is an Instance? CS6501 - Internet programming Unit- I Part - A 1 Define Java. Java is a programming language expressly designed for use in the distributed environment of the Internet. It was designed to have the "look

More information

Data Structures in C++ Using the Standard Template Library

Data 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 information

Topics for CSCI 151 Final Exam Wednesday, May 10

Topics for CSCI 151 Final Exam Wednesday, May 10 Topics for CSCI 151 Final Exam Wednesday, May 10 Java and Programming Techniques Types Inheritance Generics Abstract classes and interfaces Exceptions Recursion Writing recursive methods Dynamic Programming

More information

WITH C+ + William Ford University of the Pacific. William Topp University of the Pacific. Prentice Hall, Englewood Cliffs, New Jersey 07632

WITH 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 information

Java Programming Training for Experienced Programmers (5 Days)

Java Programming Training for Experienced Programmers (5 Days) www.peaklearningllc.com Java Programming Training for Experienced Programmers (5 Days) This Java training course is intended for students with experience in a procedural or objectoriented language. It

More information

ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions.

ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions. ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 SOFTWARE ENGINEERING (DMCA201) Q1) Explain Spiral model with suitable example. Also explain how it differs from Software Prototyping model. Q2) a) Draw

More information

Fall 2018 Updates. Materials and Energy Balances. Fundamental Programming Concepts. Data Structure Essentials (Available now) Circuits (Algebra)

Fall 2018 Updates. Materials and Energy Balances. Fundamental Programming Concepts. Data Structure Essentials (Available now) Circuits (Algebra) Fall 2018 Updates Materials and Energy Balances New Sections Solver and least squares fits Error and statistics Interpolation 9.9 Integration and numerical integration 9.10 Math functions 9.11 Logical

More information

Systems I: Programming Abstractions

Systems I: Programming Abstractions Systems I: Programming Abstractions Course Philosophy: The goal of this course is to help students become facile with foundational concepts in programming, including experience with algorithmic problem

More information

«Computer Science» Requirements for applicants by Innopolis University

«Computer Science» Requirements for applicants by Innopolis University «Computer Science» Requirements for applicants by Innopolis University Contents Architecture and Organization... 2 Digital Logic and Digital Systems... 2 Machine Level Representation of Data... 2 Assembly

More information

Java SE 8 Programming

Java SE 8 Programming Java SE 8 Programming Training Calendar Date Training Time Location 16 September 2019 5 Days Bilginç IT Academy 28 October 2019 5 Days Bilginç IT Academy Training Details Training Time : 5 Days Capacity

More information

A- Core Java Audience Prerequisites Approach Objectives 1. Introduction

A- Core Java Audience Prerequisites Approach Objectives 1. Introduction OGIES 6/7 A- Core Java The Core Java segment deals with the basics of Java. It is designed keeping in mind the basics of Java Programming Language that will help new students to understand the Java language,

More information

Analysis of Algorithms

Analysis 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 information

Data Structures and Algorithms

Data Structures and Algorithms Berner Fachhochschule - Technik und Informatik Data Structures and Algorithms Topic 1: Algorithm Analysis Philipp Locher FS 2018 Outline Course and Textbook Overview Analysis of Algorithm Pseudo-Code and

More information

Core Java SYLLABUS COVERAGE SYLLABUS IN DETAILS

Core Java SYLLABUS COVERAGE SYLLABUS IN DETAILS Core Java SYLLABUS COVERAGE Introduction. OOPS Package Exception Handling. Multithreading Applet, AWT, Event Handling Using NetBean, Ecllipse. Input Output Streams, Serialization Networking Collection

More information

JAVA Training Overview (For Demo Classes Call Us )

JAVA Training Overview (For Demo Classes Call Us ) JAVA Training Overview (For Demo Classes Call Us +91 9990173465) IT SPARK - is one of the well-known and best institutes that provide Java training courses. Working professionals from MNC's associated

More information

Course Description. Learn To: : Intro to JAVA SE7 and Programming using JAVA SE7. Course Outline ::

Course Description. Learn To: : Intro to JAVA SE7 and Programming using JAVA SE7. Course Outline :: Module Title Duration : Intro to JAVA SE7 and Programming using JAVA SE7 : 9 days Course Description The Java SE 7 Fundamentals course was designed to enable students with little or no programming experience

More information

Chapter 1 Introduction

Chapter 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 information

MaanavaN.Com CS1203 OBJECT ORIENTED PROGRAMMING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

MaanavaN.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 information

Algorithms and Data Structures (INF1) Lecture 15/15 Hua Lu

Algorithms and Data Structures (INF1) Lecture 15/15 Hua Lu Algorithms and Data Structures (INF1) Lecture 15/15 Hua Lu Department of Computer Science Aalborg University Fall 2007 This Lecture Minimum spanning trees Definitions Kruskal s algorithm Prim s algorithm

More information