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

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

SECOND SEMESTER BCA : Syllabus Copy

COURSE STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING HELD ON JULY TO BE EFFECTIVE FROM THE ACADEMIC YEAR

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

1) What is information system? Describe the basic concepts of information systems.

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

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

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY

DISCRETE MATHEMATICS

SIR C R REDDY COLLEGE OF ENGINEERING

Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 S. No. Course Outcomes

ADMINISTRATIVE MANAGEMENT COLLEGE

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

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

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

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

DATA ABSTRACTION AND PROBLEM SOLVING WITH JAVA

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

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.

Discrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London

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

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES

Fundamentals of Discrete Mathematical Structures

EC8393FUNDAMENTALS OF DATA STRUCTURES IN C Unit 3

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

Notation Index. Probability notation. (there exists) (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5.

(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY

Prepared By: Ms. Nidhi Solanki (Assist. Prof.) Page 1

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

Notation Index 9 (there exists) Fn-4 8 (for all) Fn-4 3 (such that) Fn-4 B n (Bell numbers) CL-25 s ο t (equivalence relation) GT-4 n k (binomial coef

Madhya Pradesh Bhoj (Open) University, Bhopal

LOGIC AND DISCRETE MATHEMATICS

Fundamental of I.T. (c) Application of computer *************

Design and implement a program to solve a real-world problem using the language idioms, data structures,, and standard library.

M.C.A. FIRST YEAR DEGREE

A Survey of Mathematics with Applications 8 th Edition, 2009

DESIGN AND ANALYSIS OF ALGORITHMS

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

17CS33:Data Structures Using C QUESTION BANK

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

SYLLABUS. M.Sc. I.T. Ist Year

Big Java Late Objects

12 Abstract Data Types

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

DATA STRUCTURES THROUGH C++

«Computer Science» Requirements for applicants by Innopolis University

Tilak Maharashtra Vidyapeeth, Pune

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER

COURSE OUTCOMES OF M.Sc(IT)

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

Integrated Math I. IM1.1.3 Understand and use the distributive, associative, and commutative properties.

The Course Structure for the MCA Programme

SUBJECT: INFORMATION TECHNOLOGY

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

4.1.2 Merge Sort Sorting Lower Bound Counting Sort Sorting in Practice Solving Problems by Sorting...

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu.

Introductory Combinatorics

Assignment No.1 What is ADT? Explain stack as an ADT with suitable example.

Computer Science and Engineering

r=1 The Binomial Theorem. 4 MA095/98G Revision

2) Explain in detail about different AVL rotation applied on unbalanced trees.

PESIT Bangalore South Campus Department of MCA Course Information for

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems

Madhya Pradesh Bhoj (Open) University, Bhopal

Object Oriented Programming

Seth Jai Parkash Polytechnic, Damla

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

YEAR 12 Core 1 & 2 Maths Curriculum (A Level Year 1)

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

Objective Questions for Online Practical Exams under CBCS Scheme Subject: Data Structure-I (CS-113)

(All chapters begin with an Introduction end with a Summary, Exercises, and Reference and Bibliography) Preliminaries An Overview of Database

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

CS301 - Data Structures Glossary By

2CSE401 Probability & Statistics [ ]

DEPARTMENT - Mathematics. Coding: N Number. A Algebra. G&M Geometry and Measure. S Statistics. P - Probability. R&P Ratio and Proportion

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

Department of Computer Science and Technology

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II

CLASSIC DATA STRUCTURES IN JAVA

Department of Computer Science and I.T. THE CURRICULUM SECOND YEAR

Krantiguru Shyamji Krishna Verma Kachchh University, Bhuj Master of Science (Computer Applications & Information Technology) Semester: II

CSc 225 Algorithms and Data Structures I Algorithm Analysis

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:

Bharati Vidyapeeth s College Of Engineering for Women Pune-43 Department E & TC. SE- Unit Test I Subject-DS

Computer Science Curriculum Content, KS5

VEER NARMAD SOUTH GUJARAT UNIVERSITY

Unit 2. Unit 3. Unit 4

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

AP Computer Science AB

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75

[CHAPTER] 1 INTRODUCTION 1

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

CS 445: Data Structures Final Examination: Study Guide

GARDEN CITY UNIVERSITY. Bachelor of Computer Applications SEMESTER- I. Course: CONCEPTS OF PROGRAMMING USING C LANGUAGE CODE: 05ABCAR17111 CREDITS: 04

Draw a diagram of an empty circular queue and describe it to the reader.

AP Computer Science 4325

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

Transcription:

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 Classes, Behavior And Attributes, Creating A Class, Inhetitance Works, Single And Multiple Inheritance, Creating A Subclass. Unit-2: Creating A New Object, accessing and setting class& instance variables, calling methods, references to objects, comaining objects, determining the class of an object, java class library, arrays, conditional & loops, how applets and application are different applets, passing parameters to applets. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit: Using Frames, Using Components, Events, Using Windows Listener Interface, Learning About Container, Using Layout,Managers& Handling Awt Events.The Graphic Class Drawing & Filling, Text And Fonts, Creating Font Objects, Using Color Objects, Creating Animation In Java, Threads: What Are They & The Need, Writing With Threads. Unit-4: Networking In Java, Windows Menu And Dialog Boxes,Creating Links Inside Applets, Opening Web Coonection, The Url Connection Class, Sockets, Package, Programming In Large, Programming In Small, Heading, Class, Interface. Unit-5 : Exception, Creating And Using Threads, The Runable, Interface, Thread Tester, Thread Scheduling, I/P Stream, O/P Stream.

DISCRETE MATHEMATICS & GRAPH THEORY UNIT 1 FUNDAMENTAL Sets And Subsets, Operations On Sets Sequences, Division In The Integers, Matrices, Mathematical Strutures. Logic Proposition And Logical Operations, Conditional Statements, Methods Of Proof, Mathematical Induction. UNIT 2 Mathematical Logic Statements And Notation, Connectives, Normal Forms, The Theory Of Inference For The Statement Calculus, The Predicate Calculus, Inference Theory Of The Predicate Calculus. UNIT 3 : Counting Permutations, Combinations, The Pigeonhole Principle, Recurrence Relations. Relations And Digraphs Product Sets And Partitions, Relations And Digraphs, Relations And Digraphs, Paths In Relations And Digraphs, Properties Of Relations, Equivalence Relations, Computer Representation Of Relations And Digraphs, Manipulation Or Relations, Transitive Closure And Warshalli s Algorithm. Function Definition And Introduction, Function For Computer Science, Permutation Functions, Growth Of Functions. Growth Of Functions. UNIT 4 Graph Theory Basic Concept Of Graph Theory, Euler Paths And Circuits, Hamiltonain Paths And Circuits.Other Relations And Structure Partially Ordered Sets, Lattices, Finite Boolean Algebras, Functions Of Boolean Algebras, Boolean Functions And Boolean Polynomials. Trees Introduction, Undirected Trees, Minimal Spanning Trees. UNIT 5: Semigroups And Groups- Binary Operations Revisited, Semigroups, Products And Quotients Of Semigrops, Groups, Products And Quotients Of Gropus.

Introduction To Computability Theory Languages, Finite-State Machines, Semigroups, Machines And Languages.

DATABASE MANAGEMENT SYSTEMS Unit-1: Database concept- Introduction, Data, Information Metadata, Terminology Of File, Association Between Fields, Entities And Their Attributes, Relationship Record And Files, Abstraction And Data Integration, Association Between Files( Record Types), Conventional File Processing System,Database System, Components Of Database Management System ( Classification Of DBMS Users, The Tree-Leve Architecture Proposal For DBMS, Mapping Between View, Data Independence. Unit-2 : Data Models- Introduction, Data Association-(Entities, Attributes And Associations, Relationship Among Entities, Representation Of Association And Relationship), Data Model Classification-(Approaches To The Relational Model, Hierarchical Model & Network Model Withan Examples), Entity Relationship Model, Concept Of File Organization Sequential Files, Index-Sequential Files, Direct Files,Secondary Key Retrieval. Unit-3: The Relational Model- Introduction, Relational Database: Attributes And Domains, Tuples, Relation And Their Schemas Relation Representation, Keys, Relationship, Relational Operations, Integrity Rules. Relational Algebra: Basic Operations, Relational Algebra Queries, Relational Calculus: Tuple Calculus, Domain Calculus. Relational Database Manipulations: Introduction, Sql, Data Manipulations In Sql, QUEL, Data Manipulations In QUEL,QBE, Data Manipulations In Qbe. UNIT-4: Relational Database Design- Relational Schema, Relational Design, Functional Dependency, Normalization, First Second- Third Normal Forms, Relational With More Than One Candidates Key,Good And Bad Decomposition, Multivalued Dependency, Fourth Normal Form, Fifth Normal Form. Network Data Model: The Architecture Of Dbtg System, Schema & Subshcema, And DBTG Data Manipulation Facility.

Hierarchical Data Model: The Tree Concept, Architecture Of Anims System, Data Manipulation. UNIT -5 : Database Operations And Maintence Database Administrator (DBA, Database Security, Integrity And Control (User With Password And Complete / Limited Authorization, Encryption Of Data). Concurrency Control : Problem Of Concurrent Access, Resource Looking, Deadlock. Database Recovery : Restore, Backward & Forward Recovery. Distributed Database : Introduction, Data Distribution, Deadlock In Distributed Systems, Security, Security And Protection, Homogeneous And Heterogeneous Systems. Knowledge Base And Database Systems, Expert Database Systems, Object Database System.

DATA STRUCTURES UNIT-1 : INTRODUCTION TO DATA STRUCTURES: ABOUT DATA STRUCTURE - Information And Meaning, Binary And Decimal Integer, Concept Of Data Types, Data Structure Data Representation / Implementation, Abstract Data Type, Sequence Of Value Definition, ADT For Varying Length Data String. Arrays, Records & Pointers- About Arrays, Records & Pointers; Their Implementation In Memory, Arrays As An Adt, Using One Dimensional Array& Two Dimensional, About Record & Pointers. Linked List - Concept Of Singly Linked List, Operations On Linked List, Inserting And Removing Nodes Froma List, Array Implementation Of Lists, Limitation Of The Array, Implementation Over Linked List, Concept Of Doubly Linked List, Generalized List. UNIT-2 STACK & QUEUES Stacks- Definition And Example, Primitive Operations, Stack As An ADT, Implementation Of Stacks As An Array And Linked List, Operations On Stacks, Stack Stored As A Linked List, Arithmetic Expression, Converting An Expression From Infix To Postfix. Queues - Definition And Examples Of Queues, Queues As An Abstract Data Type, Queues Stored As A Linked List, Circular Queue, Implementation Of Queues As An Array And Linked List, Operations On Queues, Priority Queue & Dequeue. UNIT-3: RECURSION: Recursive Definition And Process, Factorial Function, Multiplication Of Natural Numbers, Fabonacci Sequence, Properties Of Recursive Definitions, Writing Recursive Programs( The Tower Of Hanoi Problem, Converting Prefix To Postfix Using Recursion),Simulating Recursion( Return From A Function, Implementing Recursive Function, Simulation Of Factorial) UNIT-4: TREES & GRAPHS:

Trees- Definition Of Trees, Basic Terminology Of Trees,Binary Tree, Binary Tree Representation As An Array & Linked List, Application Of Trees, Binary Tree Traversal, Threaded Binary Tree, Height Balance Tree, B-Trees, General Trees. Graphs : Basic Terminology Of Graphs, Implementation Of Graphs As An Arrays& Linked List, Operation On Graphs, Graphs Traversals. UNIT-5: SORTING AND SEARCHING: Sorting Definition Of Sorting, Classification Of Sorting Techniques( Dictionary As An ADT, Sequencial Searching, Efficiency Of Sequential Searching ), Searching An Ordered Table, Binary Search.

Statistics & NUMERICAL MATHEMATICS Unit 1 introduction definition of statistics, importance and scope of statistics, Limitations of statistics, Distrust of statistics. Statistical data collection primary and secondary data, Methods of collecting primary data, sources and secondary data census and sample investigation. Presentation of statistical data classification, tabulation, frequency distribution, diagrams and graphs. Frequency distributions and Measure of Central Tendency Frequency distribution, continuous Frequency distribution, Graphic Representation of a Frequency Distribution average or measures of central tendency or measures of Locations, Requisites for an ideal measure of central tendency Arithmetic: Mean, Median, mode, geometric Mean and harmonic mean, eighted average, relationship amongst different averages. UNIT 2 Measures of dispersion, skewness and kurtosis Meaning and significance of dispersion, Methods of measuring Dispersion Range, quartile, mean deviation, standard deviation, coefficient of skewness, kurtosis, coefficient of dispersion, coefficient of variation. Correlation and regression definition of correlation, scatter diagram, karl pearson Coefficient of correlation, limits for correlation coefficient, definition of Regression, lines of Regression, Regression Curves, Regression Coefficients, properties of Regression coefficients, correlation analysis vs. Regression analysis. UNIT 3 Probability Introduction, Definitions of various Terms, Mathematical or classical Probability, statistical or Empirical Probability Statistical or Empirical Probability, Mathematical Tools, sets and Elements of sets, operations on sets, axiomatic Approach to Probability, Probability function, Mathematical law of Addition of Probabilities and Conditional Probabilities, Independent event, bayes Theorem Geometric probability. UNIT - 4 Random variables and Distribution functions definition of random variable, distribution function, properties of Distribution function, Discrete Random variable, Probability density function, continuous random variable, continuous density function, continuous distribution function. Mathematical Expectation and Generation function Definition of mathematical expectation, addition & multiplication Theorem of expectation, co-variance, Expectation & variance of a Linear combination of random variables, moment generation function, some limits of moment Generating function, theorem of moment generating function, cumulants.

UNIT 5 Theoretical discrete distributions Introduction, Bernoulli distribution, Binomial Distribution, Poisson Distribution, Geometric Distribution. Theoretical Continuous Distributions Introductions normal distribution, game distribution, cauchy s Distribution and central limit theorem.