How to install windows10 /Features of Windows10/How to upgrade windows 10 over windows 8

How to install windows10 /How to upgrade windows 8

we have to follow very simple step to install windows 10 on our pc

विंडोज10 को अपने कम्प्युटर में इन्स्टाल करने के लिए हमे कुछ आसान step को फॉलो करना है!

step:-1 if you want to install windows 10 then you can use either windows tool from Microsoft 

         website or create boot able  DVD or USB Drive from Microsoft tool

Step:-1 यदि आप विंडोज10 इन्स्टाल करना छाते हो तो आप माइक्रोसॉफ़्ट की वैबसाइट से माइक्रोसॉफ़्ट का टूल डाउन लोड करके उसी टूल की हेल्प से विंडोज ८ या विंडोज ७ को directly upgrade कर सकते है,

या उसी टूल का use करके Bootable DVD या Bootable USB Drive बना सकते है! या iso image create कर सकते है!

Step:2  To download Microsoft tool click Here 

• Download Windows10 32 Bit
• Download Windows10 64 Bit

Step:-2 Microsoft Tool Download करने के लिए यहा पर क्लिक  करे!

• Download Windows10 32 Bit
• Download Windows10 64 Bit

  

Read More

भारतीय राजव्यवस्ता ( Indian Political Guideline)

भारतीय राजव्यवस्ता ( Indian Political Guideline)

राजनैतिक शब्दावली :-

भारतीय राजव्यवस्था के महत्वपूर्ण पॉइंट इस प्रकार है'। 

१. धर्मनिरपेक्ष :-

जहा  धर्म के आधार पर किसी भी प्रकार का भेदभाव नही किया जाता तथा सभी धर्मो को सामान रूप से देखा जाता है धर्मनिरपेक्ष कैहलता है । 

२. लोकतंत्र :-

लोकतंत्र जनता का ,जनता के द्वारा और जनता के लिए चलाई गई राजव्यवस्था है दूसरे शब्दों में हम कह सकते है की लोकतंत्र में सरकार को सारी  शक्तिया जनता से प्राप्त होती है । 

३.समाजवाद :-

समाजवाद एक ऐसी व्यवस्था जिसमे उत्पादन और वितरण का स्वमित्र राज्य के कंट्रोल में होता है 

४.गणराज्य :-

गणराज्य का मतलब यह  है की राज्य का अध्यक्ष एक निर्वाचित व्यक्ति जो एक निश्चित अवधि के लिए पद ग्रहण करता है । 

५. अध्यादेश :-

जब संसद का अधिवेशन नही चल रहा हो और किसी विशेष उद्देश्य के लिए कानून की आवश्यकता हो ,तो राष्ट्रपति अध्यादेश जारी कर सकता है । इस अध्यादेश का प्रभाव संसद द्वारा निर्मित कानून जैसा ही होगा । 

६. प्रश्नकाल :-

जब संसद की कार्यवाही शुरू होती है उसके शुरू के पहला घंटा प्रश्न काल कहलाता है । 

७. शून्यकाल :-

संसद के दोनों सदनों में प्रश्न काल  के ठीक बाद के समय को शून्य काल कहा जाता  है । 

८.सदन का स्थगण :-

स्थगण दुवारा सदन के कामकाज को विनिदिस्ट के लिए स्थगित कर दिया जाता है । 

 

Read More

Oracle Certified Associate (OCP) Syllabus

Oracle Certified Associate (OCP) Syllabus

Introduction

·         Describe the features of Oracle Database 12c

·         Describe the salient features of Oracle Cloud 12c

·         Explain the theoretical and physical aspects of a relational database

·         Describe Oracle server’s implementation of RDBMS and object relational database management system (ORDBMS)

Retrieving Data using the SQL SELECT Statement

·         Explain the capabilities of SQL SELECT statements

·         Execute a basic SELECT statement

Restricting and Sorting Data

·         Limit the rows that are retrieved by a query

·         Sort the rows that are retrieved by a query

·         Use ampersand substitution to restrict and sort output at runtime

Using Single-Row Functions to Customize Output

·         Describe various types of functions available in SQL

·         Use character, number, and date functions in SELECT statements

Using Conversion Functions and Conditional Expressions

·         Describe various types of conversion functions that are available in SQL

·         Use the TO_CHAR, TO_NUMBER, and TO_DATE conversion functions

·         Apply conditional expressions in a SELECT statement

Reporting Aggregated Data Using the Group Functions

·         Identify the available group functions

·         Describe the use of group functions

·         Group data by using the GROUP BY clause

·         Include or exclude grouped rows by using the HAVING clause

Displaying Data From Multiple Tables Using Joins

·         Write SELECT statements to access data from more than one table using equijoins and nonequijoins

·         Join a table to itself by using a self-join

·         View data that generally does not meet a join condition by using OUTER joins

·         Generate a Cartesian product of all rows from two or more tables

Using Subqueries to Solve Queries

·         Define subqueries

·         Describe the types of problems that the subqueries can solve

·         Describe the types of subqueries

·         Write single-row and multiple-row subqueries

·         Using the SET Operators

·         Describe set operators

·         Use a set operator to combine multiple queries into a single query

·         Control the order of rows returned

Managing Tables using DML statements

·         Truncate data

·         Insert rows into a table

·         Update rows in a table

·         Delete rows from a table

·         Control transactions

Introduction to Data Definition Language

·         Categorize the main database objects

·         Explain the table structure

·         Describe the data types that are available for columns

·         Create a simple table

·         Explain how constraints are created at the time of table creation

·         Describe how schema objects work

Read More

How to Registered for Oracle Certified Associate (OCP)

Oracle Database 11g, 12c Certification flow 

Become an Oracle Certified Associate

Validate your expertise - follow the steps below to earn your associate level certification

Step 1 - Pass this exam

• Oracle Database 12c: SQL Fundamentals 1Z0-061 or
• Oracle Database 11g: SQL Fundamentals I 1Z0-051 or
• Oracle Database SQL Expert 1Z0-047

Step 2 - Pass Exam

Oracle Database 11g: Administration I 1Z0-052

Oracle Certified Associate Registration Step:-

• Purchase exam voucher from Oracle University

• Register for Exam at Pearson VUE

• Locate a test Centre 

• Register for Exam at an Oracle Test Centre 

Read More

MAMTA TUTORIAL: Tree in data structure What is tree ?

MAMTA TUTORIAL: Tree in data structure What is tree ?

Read More

Tree in data structure What is tree ?

What is tree 

Definition:-  Tree is  is hierarchical (or non-linear) data structure.

                           or

Tree is a finite set of elements that is either empty or partitioned into three  disjoint subsets ,the first subset contains a single element called the  root of the tree.The other two subset are themselves tree called left and right subtree  of original tree .Each element of tree is called a node of the tree .

Important Term related with trees-

Root Node-  The First Subset or single element called root or parent node  of the tree (Such as A is the root node in above figure)

Leaf Node -  The node that has no son is called  leaf node of tree (Such as D,E,F,G are the leaf node in above fig)

Sibling- Two nodes are sibling if they have same parent (such as D,E and F,G are siblings)

Level of tree-  The level of  a node in binary tree is the number of edges  traversed from the root node to the node i.e. root has 0 level and level of any other node is one more than the level of its parents (such as level of below tree is 3 )

 

Depth of Tree-    The depth of tree is the maximum level of any leaf  in the tree ( such as depth of below tree is 4)

Climbing-  Going from the leaves to the root is called "climbing"

Descending - Going from the root  to the leaves is called descending 

Types of Tree in data structure -Binary Tree Lecture 2

Read More

Types of Binary Trees?What are the different type of Binary Tree?

Types of Binary  Trees

1. Strictly Binary Tree-

• If Every non leaf node in binary tree has non empty left and right subtrees ,the tree term as strictly binary tree .

Important Point for Strictly Binary Tree-

•  Every non-leaf node has degree 2
• A strictly binary tree with n leaves has (2n -1 ) nodes 
• Thus strictly binary tree has odd number of nodes 

2. Complete Binary Tree -

• A complete Binary tree of  depth  d is the strictly binary tree whose all leave are at level d 
• A Complete Binary Tree of depth d is the binary tree that contains exactly  2^l (two ki power l nodes )
• Issi prakar kisi bhi complete Binary tree (CBT)  mein  total no of nodes (2^d+1 -1) where d is depth of tree 
• Isse ek conclusion ye nikalta hai ki complete Binary Tree hamesha Strict Binary tree hogi but strict binary tree hamesha  complete binary tree (CBT)  nhi hogi
• Jaisa ki hum jante hai CBT Hamesha Strict Binary tree hogi tab agar iske n leaves honge to isme total no of nodes 2n-1 honge 

Read More

What is Binary tree,Different type of tree in Data structure

Different type of tree in Data structure 

Binary Tree:-

• A Binary tree is a finite set of elements that is either empty or is partitioned into three disjoint subset 

• The First subset contains a single element called the root of the tree

• The other two subsets are themselves binary tree ,called left and right subtrees of the original tree.

• Each element of a binary tree called a node of the tree

          

Read More

MCQ of DBMS fundamental question

MCQ Data Base Management System on Basic  Fundamental

Q1.A Specific example where physical data independence would not hold is

1. When data file is changed from unordered file to sorted file 
2. When additional access  structure (Example an index ) is created for relation
3. When DBA decides to store the data in B+ tree
4. When the user writes an application program to join tables 

Q2.Integrity means________

1. Protecting the data against unauthorized users
2. Protecting data against authorized users
3. Making sure users are allowed to do the thing they are trying to do
4. None of These

Q3.Controlling redundancy in database management system help to 

1. Avoid duplication of effort
2. Avoid unnecessary wastage of storage space 
3. Avoid Inconsistence among data 
4. All of the above

Q4. Which of the following function not performed by DBA?

1. Planning ,designing ,and implementation of database system
2. Allocation of storage locations and data structures
3. Establishing standards and procedures system
4. Communicating with data base users

Q5.Which of the following is not an advantages of database approach ?

1. Elimination of the data redundancy 
2. Ability to associate related data 
3. increased security 
4. All of the above

Q.6 A data Dictionary doesn't provides information about 

1. Where data is located 
2. The size of the disk storage
3. Who owns or responsible for the data 
4. How data is stored 

Q7.The data base administrator is ,in effects ,the coordinator between the _____and the ____

1. DBMS ; database
2. Application program ; Database
3. Database ;Users
4. Application programs ;Users

Q.8 Which of the following is not usually part of the responsibilities of a DBA?

1. Approving Structure changes to the database
2. Designing data  entry screens 
3. Ensuring that an adequate backup regime is in place
4. Issuing Accounts to users and monitoring the performance of the system

Q9. Network Models are Complicated by

1. Physical keys ,but the relation model is faster because it uses logical keys.
2. Logical keys ,

Read More

What is RDBMS Lecture -4

What is RDBMS

DBMS:-

                    Data base management system (DBMS) which follows all the 12 rule given by  Dr Edgar F. Codd  known as Relational data base management system (RDBMS)

According to Dr.Edgar F codd rule are as follows

1 Information Rule :- 

                                        This rule states that all information (data) ,which stored in database must be stored in table  formats,this information can be user data or meta -data.

2.Guaranteed Access rule :-

                                        This rule states that every single data element (value) is guaranteed to be accessible logical with combination of table name and primary key .

3.Systematic Treatment of NULL value:-

                      This rule states that NULL value in the database must be given systematic treatment i.e. primary key value never be NULL because NULL have several meaning that cause various anomaly occurs in data base

4.Active online catalog :-

                                      This rule states that the structure of whole database must be stored  in an online catalog i.e. Data Dictionary

5. Comprehensive data sub-language rule :-

                                     This rule states that  database must have support for a language which has linear syntax which is capable of Data Definition ,Data Manipulation,Data control  

6.View Updating rule:-

                               This rule states that all system should able to updates all views of database  without any anomaly in the system

7. High-level insert -Update and Delete rule:-

                               This rule states that system must support high level insertion,updation ,deletion this must not be limited to a single row that it must support join operations to yield set of data

8. Physical data independence:-

                              This rule states that application should not have any concern about ,how the data physically stored in the system as well as any change in physical structure must not have any impact on application 

9.Logical Data Independence:-

                            This rule states that logical data must be independent of its user's view as well as any change in logical data must not imply any change in the application .e.g. if two table are merged or one is split into two different table there should be no impact on the application

10.Integrity Independence:-

                               This rule states that all integrity constraints can be independently modified without the any change in the application.this rule makes database independent of front-end application and its interface.

11.Distribution Independence:-

                      This rule states that the end user must not be able to see that the data in distributed over various locations,end user have feel that data is located at one site only. 

12. Non-subversion rule:-

                              This rule states that if system has an interface that provides access to low level records ,this interface then must not be able to subvert the system and bypass security and integrity constraint 

Click Here for Lecture -3

Read More

DBMS Data Independence Lecture -3

 Data Independence 

Data independence can be define as the capacity to change the schema at one level of data base system without having to change the schema at higher level .data independence further classified into to category as follow

1.Logical Data Independence

2.Physical data Independence

Logical data Independence:- 

                                            The capacity to change the conceptual Schema without having to change the external schema or users programs

Physical data Independence:-

                                                  The capacity to change the the internal Schema without having to change the conceptual schema

Click Here for Lecture -2

Read More

Database Management system (Advantage of DBMS over flat file system) Lecture -2

Advantage of DBMS over flat file system

1. Easy to Access [ By Indexing ]

2.Gives less I/O task to Access data 

3. It gives more concurrency level

4.More Security over the data File [By providing Views]

5. Data Independence [By providing three level Interdependency]

6.Data Integrity and Security

7.Data Administration

8.concurrent Access and crash recovery 

9.Control Redundancy [Duplication  of data]

10.Reduced Application Development time [By providing Higher level Interface]

Click Here for previous Lecture -1

Read More

Data Base Management System Made easy class room note Lecture -1

Data Base Management System Made easy class room note  Lecture -1

DBMS syllabus and reference for GATE 

Databases:   

              Relational model (ER-model, relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B+ trees), Transactions and concurrency control;

Reference Book:-

   Database Management systems  –>   Raghu RamaKrishnan
   Database system concepts  – > Silberschatz , Korth , Sudarshan
   Database systems   – >    C.J.Date (Normalisation is very lucidly written )
   Principles of Database Systems – > J.D.Ullman  (This is a very good book )

------------------------------------------------------------------------------------------------------

 Note:-

As per analysis of GATE previous years papers  found that all the topics of the above syllabus are important so i suggest you go through all the topic but as per previous GATE paper experience probability of occurring question are more from -Normalization,normal form relation algebra, SQL query and transactions and concurrency .

Once you will go through old paper you will find that maximum time 2 question (link question) asked from SQL query only or normalization (normal form) and one marks question from rest of the syllabus so focus on these two topics  so in our lecture we will cover these topic first .

--------------------------------------------------------------------------

What is DBMS?

                           Before understand DBMS we understand some basic terminology

Database:-  Database is a collection of related data

Management System:-  A software used to manage the database in efficient way

                DataBase+Management Syatem  =DBMS

DBMS Definition:-  Database is a computer base record keeping system and the way through which we manage the system known as management system

DBMS Definition by Korth:-

                                       A Database management system is a collection of interrelated data and set of programs to access these data.

DBMS Defination by Ullman:-

                                      DBMS is powerful tool for creating and managing large amount of data efficiently and allowing it to persist over long period of time.

Read More

Introduction of Java Programming (Basic Introduction) Lect-1

Introduction of Java Programming 

Key Note :-

• Before start Java programming you have to understand that how to learn java ,what strategy required to learn java because there are lot of book available in market/Internet for java which only provides you content but no book tell us that how to start /how to read /what are the right track for learning java programming 

• Second point which comes in your mind that to learn  java what kind of programming background required i.e. whether C/C++ mandatory to learn before start java .
• I frankly tell you that for java there is no need of background knowledge of C/C++,but if know its fruitful for you.

• The next  thing comes to your mind that why Java where various programming language available in the market?

•  Java is Almost pure object oriented /platform independent   programming language.which support concept of WORA(Write once run any where)

• Later on  I  will give many reason why java only

Read More

Introduction of java Lect-2

Introduction of java Lect-2

What is Java?

            Java is Pure Object  Oriented  platform Independent  (Architecture neutral) Language  developed by James Gosling from Sun Micro system(sun)in 1991. The first publicly available version of Java (Java 1.0) was released in 1995.

  

Note:-   Java technology is both a programming language and a platform. 

Note:-   Sun Microsystems was acquired by the Oracle Corporation in 2010

Note:-   Over time new enhanced versions of Java have been released.

Note:- The current version of Java is  Java 1.7 which is also known as Java 7

Note:- From the Java programming language the Java platform evolved.

Note:- The Java platform allows software developers to write program code in other languages than

         

             the Java programming language.

  History of Java Language

• In 1991 a group of Sun Microsystems engineers Led by James Gosling ,decided to develop a  Language for consumer device (Like- cable Box, Microwave ,Washing Machine etc)  
• They Wanted the language to be small because  these device don’t’ have powerful CPU.

• They also wanted the language to be hardware independent since different manufactures would use different CPU.

• The project was Name Green….

• They decided to compile the code to an intermediate machine like code for imaginary CPU called Virtual Machine (VM),actually there is a real CPU,that implement this virtual CPU

• This intermediate code called Byte Code

• Byte code Completely Hardware Independent

Read More