Knowsh.com

Program to check if the string is Palindrome Permutation

http://www.knowsh.com

Given a string, write a function to check if it is a permutation of a palindrome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words. Language used: C#. Asked Microsoft interview.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140212/Program-To-Check-If-The-String-Is-Palindrome-Permutation

 

Knowsh.com

Stacks and its implementation, applications of stack, operation push and pop, reverse string, infix to postfix, simulating recursion, backtracking algorithm, algorithm to add, delete and search an element

http://www.knowsh.com

Stacks, Applications of Stacks, Operations on Stack, Implementation, Push operation, Pop Operation, Program to Reversing a string using Stack, Convert infix to postfix, Evaluate postfix expression, Simulating recursion, Parsing computer programs, Backtracking algorithms, Algorithm to add element in stack, Algorithm to delete element from stack, Algorithm to find if stack is full.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140211/Stacks-And-Its-Implementation-Applications-Of-Stack-Operation-Push-And-Pop-Reverse-String-Infix-To-Postfix-Simulating-Recursion-Backtracking-Algorithm-Algorithm-To-Add-Delete-And-Search-An-Element

Knowsh.com

Linked List, Singly Linked List, Operations on Linked List, Circular Linked List, Doubly Linked List, Polynomial Addition, Equivalence Relations, Sparse Matrix, Single Chain, Generalized Lists

http://www.knowsh.com

Implementations of Linked List, Singly Linked List, Operations on Linked List, Circular Linked List, Doubly Linked List, Polynomial Addition, Equivalence Relations, Sparse Matrix, Single Chain, Generalized Lists

http://knowsh.com/Notes/NotesSearch/NotesDetail/140210/Linked-List-Singly-Linked-List-Operations-On-Linked-List-Circular-Linked-List-Doubly-Linked-List-Polynomial-Addition-Equivalence-Relations-Sparse-Matrix-Single-Chain-Generalized-Lists

 

Knowsh.com

Hashing, Hash table, Collision Problem, Hash Function, Separate Chaining, Open Addressing, Linear Probing, Quadratic Probing, Double Hashing

http://www.knowsh.com

Hashing, Hash table, Collision Problem, Hash Function, Separate Chaining, Open Addressing, Linear Probing, Quadratic Probing, Double Hashing

http://knowsh.com/Notes/NotesSearch/NotesDetail/140209/Hashing-Hash-Table-Collision-Problem-Hash-Function-Separate-Chaining-Open-Addressing-Linear-Probing-Quadratic-Probing-Double-Hashing

 

Knowsh.com

Architecture Of DDBMS

http://www.knowsh.com

Architecture DDBMS, Dimensions of implementation, Issues with DDBMS, Fragmentation, Allocation, Replication, Optimization – Query Plan, Transparencies in a DDBMS, Date 12 Rules, Distributed Transaction Management.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140208/Architecture-DDBMS-Dimensions-Of-Implementation-Issues-With-DDBMS-Fragmentation-Allocation-Replication-Optimization-%E2%80%93-Query-Plan-Transparencies-In-A-DDBMS-Date-12-Rules-Distributed-Transaction-Manageme

 

Knowsh.com

Program to find if the given two string are anagram

http://www.knowsh.com

Definition of Anagram :- a word, phrase, or name formed by rearranging the letters of another, such as cinema, formed from iceman. Program to find if the given two string are anagram or not. Asked in Microsoft interview. Language used C#. Using an additional Data Structure Array to save the ASCII values of characters.

http://knowsh.com/Notes/NotesSearch/NotesDetail/140207/Program-To-Find-If-The-Given-Two-String-Are-Anagram