now days most important of internet security

all business have own website but many of hacker that website and loss there business

todays topics is how to trace last activity in my server with access log

so all of hosting server provider provide raw access of your server with file when who is access

internet identification is ip address

so hosting service provider maintain access log

in your hosting account one of menu link like raw access etc

now open it there is all of log which ip address that access is your file server

find vulnerability of your code in your project easy to solve your problems

then check your website not in google or other website blacklist

type your site name in google then it show site is harmful so now your site is blacklist

you need to remove vulnerability code then submit your in google webmaster review

]]>open your oracle application express click on

>app builder

> shred components

>authentication schemes

> create

> choose type custom

> authentication function click help icon

showing this scripts

>

create or replace function authenticate_ft_users

(p_username in varchar2, p_password in varchar2)

return boolean

is

l_user_name ft_users.user_name%type := upper(p_username);

l_password ft_users.password%type;

l_hashed_password varchar2(1000);

l_count number;

begin

select count(*) into l_count from fit_users

where user_name = l_user_name;

if l_count > 0 then

l_hashed_password := ft_hash_password(l_user_name, p_password);

select password into l_password from ft_users where user_name = l_user_name;

if l_hashed_password = l_password then

return true;

else

return false;

end if;

else

return false;

end if;

return true;

end authenticate_ft_users;

goto oracle apex sql scripts

> create new

> past (above sql funcntion code )

> save and run it

>

if you found it error so comment

]]>

open your data base

phpmyadmin

login with your credentials

Default phpmyadmin Credentials id User name : root Password : leave blank

select your data base bottom of a database showing a data dictionary

click there showing your data dictionary

]]>

open your database server

open phpmyadmin select your databse

find database se wp-config file

// ** MySQL settings – You can get this info from your web host ** //

/** The name of the database for WordPress */

define(‘DB_NAME’, ‘i2561658_wp9’);

open your db

goto wp_option table

find active_plugin

disable all plugin clear active_plugin

filed
]]>

wordpress short code wordpress developer must be know

print current year in WordPress site : [current-year]

print site title in in wordpress site : [site-title]

site url wordpress short code : [site-url]

Copyright © [current-year] <a href=”[site-url]”>[site-title]</a>. All rights reserved.

]]>wordpress short code wordpress developer must be know

print current year in WordPress site : [current-year]

print site title in in wordpress site : [site-title]

site url wordpress short code : [site-url]

Copyright © [current-year] [site-title]. All rights reserved.
]]>

how to solve it ‘

https://developers.google.com/webmasters/hacked/docs/request_review

remove all malware , phishing type of code etc .

then review on google webmaster console

add your site in google webmaster

then goto Security Issues report in tab open review

]]>How To Become a Gate Topper ?

The Famous __‘__**Gate Topper**__‘ ____Algorithm__ will help you to organize your study :

**Check topics from this post.**

Study them from any standard textbook , if not understand go with nptel

**Try a couple of simple questions from end chapters to know if you understand basics of that topic**

Try gate previous years related questions

If you find some questions in gate papers not related to the topic you studied, go back to step 2

This is the most important subject according to GATE point of you. Approximately 25% Questions in Gate come from above topics and all are related with each other. If you are good in this subject this will not only help you in GATE but also after it in so many written exams and interviews of Different IITs and IIITs.

**C programming Questions are mostly based on finding outputs which contain some pointers, static variables, arrays, strings, functions etc. So the best way to practice C programming question is take questions from different books, try to solve them and try to do programming on Compiler. It will increase your skills and accuracy. Very high chances of common data questions. So if you are not good at programming start practice from now.**

**Understand Different Problems on Stack, Queue, Link List. Generally they come in a C program, But you can solve them only if you know the logic. Properties of Heap. Deletion and insertion of items in the heap.**

**Practice Tree problems like no of leaf nodes, non leaf nodes, total nodes, height of the tree, no of full nodes, mirror image, etc. AVL tree and balancing them on insertion and Deletion.**

**Binary tree, Binary Search Tree, Inorder, Preorder, Postorder traversal. Spanning Trees, Minimum Spanning Tree problems.**

**Very Important Topic. You need to practice more and with every problem you solved. Sometimes direct question comes related to complexity like give complexity of Heap sort. But mostly you are given a code or question. You need to find best average case complexity of that problem. So try to find complexity of every algorithm or program which you practice. Also understand properties of complexity. Sometimes relation between them is asked.**

**Searching and Sorting Problems. Difference between Different Techniques and how to apply them on different real life problems.**

**Questions on approach of dynamic programming, Divide and Conquer, Greedy and Brute Force. Practice basic problems like quick sort, merge sort, knapsack problem, matrix chain multiplication, LCS, Job sequencing, Compressing Mechanism. It will help you to solve other tricky problems.**

**Basic Theory of P-NP class**

Syllabus : Processes, Threads, Inter-process communication, Concurrency, Synchronization,

Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O

systems, Protection and security.

**Scheduling : Numerical Questions have more chances. Practice more in finding turn**

**Deadlock : Bankers Algo, Given Sequence is safe or not. Chances of common data**

**Synchronization : High Probability Of Questions in exam. Practice some question**

**Memory Management : Questions generally comes from page table size, number of**

Syllabus : Regular languages and finite automata, Context free languages and Push-down

automata, Recursively enumerable sets and Turing machines, Undecidability.

**Finite Automata covers approximately 50% questions from TOC. So give it more time then others. Do questions realted to finding minimum number of states, NFA to DFA conversion, Closure Properties of finite automata, Finding Regular Expressions,mealy moore machine etc.**

**In Context free grammer practice more on simplification of CFG, pushdown automata, closure properties etc.****Do problems on finding category of any language or grammar.****Concepts related to expressive power of different languages.****Basic problems related to NP-Completeness. Properties of Recursive and Recursive Enumerable Languages.****Turing Machine making and expressive power of different type of turing machine. ( also useful for interview ).**

**Parsing : there is always a question related to parsing. You need to practice all parsing technique because there is also chances for linked questions. finding first and follow,**

**Precedence and Associativity of operators.****Finding value from expression tree.****Ambiguous grammar.**

**No gate paper completed without Normalization. This is very easy once you understand and can solve questions quickly. Questions are like Finding normal form ( comes 70% times in gate paper ), finding candidate keys, decomposition of relation, loss less join and dependency preservation have more probability to come.**

**SQL Queries also asked in the paper. Practice select clause properly with properties of having,group by, any ,all, exits. Question may come with relational algebra in common**

**Practice joins because there is more probability of tricky questions from them.****Finding View and Conflict serializability. Finding Recoverable and Cascade schedule.lock based, Two phase, time stamp and graph based protocal with there properties**

**formation and structure of B and B+ tress. primary and clustering index. Numerical**

Syllabus : Logic functions, Minimization, Design and synthesis of combinational and

sequential circuits; Number representation and computer arithmetic (fixed and floating point).

**Digital logic contains very simple questions. If you practice and use your brain in a**

**Practice K-Map. very high chances of very simple question. Don’t loose your marks**

**Practice Multiplexer, De-multiplexer, Encoder, Decoder questions.****Understand concept of flip flop. They are given and modulas of counter is asked.****Practice questions related to Floating Point representation, integer representation,**

Syllabus : Machine instructions and addressing modes, ALU and data-path, CPU control

design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining,

Cache and main memory, Secondary storage.

**Addressing Modes : Theory and questions****Numerical related to program counter after some instruction, no of one address-two**

**Numerical Problems on Speed up of pipeline, time taken to complete instruction in**

**Numerical Problems on cache memory organization, mapping technique, multilevel**

**Questions are more tricky in this subject. So you need to practice more on different**

Syllabus : ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control

techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4),

Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs,

switches, gateways, and routers. Network security – basic concepts of public key and private

key cryptography, digital signature, firewalls.

**Addressing related questions : Subnet address, supernet address, brodcast address,**

**Properties Of Circuit Switching and packet switching, Routing Protocols and**

**Flow Control and Error Control Policies. Numerical Problems on Window Size, No Of**

**IP Header , TCP and UDP header format, theory related to Ethernet and token ring.****Basics Of Different Type of protocols like : FTP, HTTP, DHCP, ARP, RARP, SMTP,**

**Basic Concepts of Cryptography and firewalls.**

Syllabus : information gathering, requirement and feasibility analysis, data flow diagrams,

process specifications, input/output design, process life cycle, planning and managing the

project, design, coding, testing, implementation, maintenance.

**This Subject is more related with theory. So better collect some institutes notes on**

**Numerical Problem may come from COCOMO model, cyclomatic complexity etc.****Study Different Models and there properties along with difference between them.**

**Data flow Diagrams are also important.**

Syllabus

Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation;

Random Variables; Distributions; uniform, normal, exponential, Poisson,

Binomial.

Mathematical Logic: Propositional Logic; First Order Logic.

Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders;

Lattice; Boolean Algebra.

Combinatorics: Permutations; Combinations; Counting; Summation; generating

functions; recurrence relations; asymptotics.

Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering;

matching; independent sets; Colouring; Planarity; Isomorphism.

Linear Algebra: Algebra of matrices, determinants, systems of linear equations,

Eigen values and Eigen vectors.

Numerical Methods: LU decomposition for systems of linear equations; numerical

solutions of non-linear algebraic equations by Secant, Bisection and Newton-

Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.

Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems

of integral calculus, evaluation of definite & improper integrals, Partial

derivatives, Total derivatives, maxima & minima.

**For probability questions You need to practice Bays theorem, Normal**

**Different types of graph and there properties, graph coloring,**

**Eigen values and eigen vectors question. Simple questions related to**

**Finding Values of variable with some properties of linear equations**

**Newton Rapson Method and its application. Numerical Integration by**

**Finding Maxima and Minima. Properties of limit, Continuity and**

**Properties of relation, function. Partial and Total Ordering. Hasse**

**Tricky Problems on Permutations and Combinations. Pigeonhole**

**Simple problems on logic.**

Syllabus :

Verbal Ability: English grammar, sentence completion, verbal analogies, word groups,

instructions, critical reasoning and verbal deduction.

Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data

interpretation.

**Problems on Antonym, Synonym, Summary from paragraph, same or different pairs,**

**Problems on time and work, distance, data interpretation number system, percentages,**

**Quantitative and verbal reasoning –By R.S. Agarwal**

_{}^{}~~
]]>
~~

The Famous __‘ Gate Topper__

**Check topics from this post.**

Study them from any standard textbook , if not understand go with nptel

**Try a couple of simple questions from end chapters to know if you understand basics of that topic**

Try gate previous years related questions

If you find some questions in gate papers not related to the topic you studied, go back to step 2

**C + DataStructure**

__Important Points :__

This is the most important subject according to GATE point of you. Approximately 25% Questions in Gate come from above topics and all are related with each other. If you are good in this subject this will not only help you in GATE but also after it in so many written exams and interviews of Different IITs and IIITs.

**C programming Questions are mostly based on finding outputs which contain some pointers, static variables, arrays, strings, functions etc. So the best way to practice C programming question is take questions from different books, try to solve them and try to do programming on Compiler. It will increase your skills and accuracy. Very high chances of common data questions. So if you are not good at programming start practice from now.**

**Understand Different Problems on Stack, Queue, Link List. Generally they come in a C program, But you can solve them only if you know the logic. Properties of Heap. Deletion and insertion of items in the heap.**

**Practice Tree problems like no of leaf nodes, non leaf nodes, total nodes, height of the tree, no of full nodes, mirror image, etc. AVL tree and balancing them on insertion and Deletion.**

**Binary tree, Binary Search Tree, Inorder, Preorder, Postorder traversal. Spanning Trees, Minimum Spanning Tree problems.**

__Finding Complexity : __

**Very Important Topic. You need to practice more and with every problem you solved. Sometimes direct question comes related to complexity like give complexity of Heap sort. But mostly you are given a code or question. You need to find best average case complexity of that problem. So try to find complexity of every algorithm or program which you practice. Also understand properties of complexity. Sometimes relation between them is asked.**

**Searching and Sorting Problems. Difference between Different Techniques and how to apply them on different real life problems.**

**Questions on approach of dynamic programming, Divide and Conquer, Greedy and Brute Force. Practice basic problems like quick sort, merge sort, knapsack problem, matrix chain multiplication, LCS, Job sequencing, Compressing Mechanism. It will help you to solve other tricky problems.**

**Basic Theory of P-NP class**

**Operating System**

Syllabus : Processes, Threads, Inter-process communication, Concurrency, Synchronization,

Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O

systems, Protection and security.

__Important Points :__

**Scheduling : Numerical Questions have more chances. Practice more in finding turn**

**around time and waiting time of different scheduling policies.**

**Deadlock : Bankers Algo, Given Sequence is safe or not. Chances of common data**

**or linked questions.**

**Synchronization : High Probability Of Questions in exam. Practice some question**

**related to semaphores and classical problems of synchronization (this will help you to solve other questions).**

**Memory Management : Questions generally comes from page table size, number of**

**pages, logical address, physical address, page size, inverted page table, virtual memory,**

**TLB etc.**

**Theory Of Computation **:

Syllabus : Regular languages and finite automata, Context free languages and Push-down

automata, Recursively enumerable sets and Turing machines, Undecidability.

__Important Points :__

**Finite Automata covers approximately 50% questions from TOC. So give it more time then others. Do questions realted to finding minimum number of states, NFA to DFA conversion, Closure Properties of finite automata, Finding Regular Expressions,mealy moore machine etc.**

**In Context free grammer practice more on simplification of CFG, pushdown automata, closure properties etc.****Do problems on finding category of any language or grammar.****Concepts related to expressive power of different languages.****Basic problems related to NP-Completeness. Properties of Recursive and Recursive Enumerable Languages.****Turing Machine making and expressive power of different type of turing machine. ( also useful for interview ).**

**Compiler Design**

__Important Points :__

**Parsing : there is always a question related to parsing. You need to practice all parsing technique because there is also chances for linked questions. finding first and follow,**

**LL(1)-LR(1)-SLR-LALR-CLR.**

**Precedence and Associativity of operators.****Finding value from expression tree.****Ambiguous grammar.**

**Databases**

__Important Points :__

**No gate paper completed without Normalization. This is very easy once you understand and can solve questions quickly. Questions are like Finding normal form ( comes 70% times in gate paper ), finding candidate keys, decomposition of relation, loss less join and dependency preservation have more probability to come.**

**SQL Queries also asked in the paper. Practice select clause properly with properties of having,group by, any ,all, exits. Question may come with relational algebra in common**

**data section.**

**Practice joins because there is more probability of tricky questions from them.****Finding View and Conflict serializability. Finding Recoverable and Cascade schedule.lock based, Two phase, time stamp and graph based protocal with there properties**

**like deadlock freedom, starvation freedom.**

**formation and structure of B and B+ tress. primary and clustering index. Numerical**

**Questions from no of block required in indexing of different type, collision resolution,**

**minimum and maximum no of nodes in B,B+ trees.**

**Digital Logic**

Syllabus : Logic functions, Minimization, Design and synthesis of combinational and

sequential circuits; Number representation and computer arithmetic (fixed and floating point).

__Important Points :__

**Digital logic contains very simple questions. If you practice and use your brain in a**

**right way you can do them easily.**

**Practice K-Map. very high chances of very simple question. Don’t loose your marks**

**here.**

**Practice Multiplexer, De-multiplexer, Encoder, Decoder questions.****Understand concept of flip flop. They are given and modulas of counter is asked.****Practice questions related to Floating Point representation, integer representation,**

**ieee format, range and precision.**

**Computer Organization and Architecture**

Syllabus : Machine instructions and addressing modes, ALU and data-path, CPU control

design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining,

Cache and main memory, Secondary storage.

__Important Points :__

**Addressing Modes : Theory and questions****Numerical related to program counter after some instruction, no of one address-two**

**address instructions, Values after shift and rotate instructions, horizontal and vertical**

**programming related questions.**

**Numerical Problems on Speed up of pipeline, time taken to complete instruction in**

**pipeline and non-pipeline architectures, Hazards in pipeline, hazards removal, branch**

**penalty etc.**

**Numerical Problems on cache memory organization, mapping technique, multilevel**

**caches, write through and write back technique**

**Questions are more tricky in this subject. So you need to practice more on different**

**types of Numerical Questions.**

**Computer Network**

Syllabus : ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control

techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4),

Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs,

switches, gateways, and routers. Network security – basic concepts of public key and private

key cryptography, digital signature, firewalls.

__Important Points :__

**Addressing related questions : Subnet address, supernet address, brodcast address,**

**range of network, no of host, classless addressing, non continuous addresses, first host and**

**last host finding etc.**

**Properties Of Circuit Switching and packet switching, Routing Protocols and**

**Numerical Problems on them.**

**Flow Control and Error Control Policies. Numerical Problems on Window Size, No Of**

**Sequence bits, frame size, bandwidth, round trip time, utilization, Hamming Distance, CRC.**

**Congestion Control policies like slow start, congestion avoidence and Congestion Detection.**

**IP Header , TCP and UDP header format, theory related to Ethernet and token ring.****Basics Of Different Type of protocols like : FTP, HTTP, DHCP, ARP, RARP, SMTP,**

**ICMP,POP**

**Basic Concepts of Cryptography and firewalls.**

**Information System and Software Engineering**

Syllabus : information gathering, requirement and feasibility analysis, data flow diagrams,

process specifications, input/output design, process life cycle, planning and managing the

project, design, coding, testing, implementation, maintenance.

__Important Points :__

**This Subject is more related with theory. So better collect some institutes notes on**

**this subjects or prepare yourself.**

**Numerical Problem may come from COCOMO model, cyclomatic complexity etc.****Study Different Models and there properties along with difference between them.**

**Data flow Diagrams are also important.**

**Engineering Mathematics**

Syllabus

Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation;

Random Variables; Distributions; uniform, normal, exponential, Poisson,

Binomial.

Mathematical Logic: Propositional Logic; First Order Logic.

Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders;

Lattice; Boolean Algebra.

Combinatorics: Permutations; Combinations; Counting; Summation; generating

functions; recurrence relations; asymptotics.

Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering;

matching; independent sets; Colouring; Planarity; Isomorphism.

Linear Algebra: Algebra of matrices, determinants, systems of linear equations,

Eigen values and Eigen vectors.

Numerical Methods: LU decomposition for systems of linear equations; numerical

solutions of non-linear algebraic equations by Secant, Bisection and Newton-

Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.

Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems

of integral calculus, evaluation of definite & improper integrals, Partial

derivatives, Total derivatives, maxima & minima.

__Important Topics :__

**For probability questions You need to practice Bays theorem, Normal**

**and poisson distribution, mean and variance of different distributions.**

**Different types of graph and there properties, graph coloring,**

**isomorphism between graphs, Planner Graphs, Euler and Hamiltonian Graphs**

**and some tricky problems which need practice to solve them.**

**Eigen values and eigen vectors question. Simple questions related to**

**matrix.**

**Finding Values of variable with some properties of linear equations**

**like infinite no of solutions or unique solution.**

**Newton Rapson Method and its application. Numerical Integration by**

**different methods.**

**Finding Maxima and Minima. Properties of limit, Continuity and**

**differentiability. Finding values by Mean Value Theorem. Integration.**

**Properties of relation, function. Partial and Total Ordering. Hasse**

**Diagrams, Group Theory. Sets Related Questions.**

**Tricky Problems on Permutations and Combinations. Pigeonhole**

**principle.**

**Simple problems on logic.**

**General Aptitude**

Syllabus :

Verbal Ability: English grammar, sentence completion, verbal analogies, word groups,

instructions, critical reasoning and verbal deduction.

Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data

interpretation.

__Important Points :__

**Problems on Antonym, Synonym, Summary from paragraph, same or different pairs,**

**Ordering of words, sentences etc.**

**Problems on time and work, distance, data interpretation number system, percentages,**

**clocks, coding and decoding, Venn Diagram, cubes, blood relation, Directions, Number odd**

**man out, Boats and pipes etc.**

**Quantitative and verbal reasoning –By R.S. Agarwal**

]]>

step 1 : download owncloud zip from

owncloud 9.1

step 2 :then upload a your owncloud zip and exatract file in your hosting directory

then open url

check our php version greater then 5.4

step 3 :enter a admin username and password

then choose a database differance type

easy to configuration in sqllite databse

if have any problems then comment

]]>