Sunday, October 22, 2017

Security is our duty and we shall deliver it

"Security is our duty and we shall deliver it" - This slogan was given by Mohd Anwar Jamal Faiz as a part of his Whitepaper first published on W3Lc.com, Slideshare and LinkedIn.

Description of paper:
Quality Management, Information Security, Threat Hunting and Mitigation Plans for a Software Company or a Technology Start-up engaged in building, deploying or consulting in Software and Internet Applications.

Read - World Wide web Learners Consortium - W3LC
http://www.w3lc.com/2017/10/security-is-our-duty-and-we-shall.html

This paper could be best described in following words-

Quality Management, Information Security, Threat Hunting and Mitigation Plans for a Software Company or a Technology Start-up engaged in building, deploying or consulting in Software and Internet Applications.


The chief sections of the document would be:

  1. Introduction to Enterprise Risk & Cyber Security
  2. The technologies we employ in
  3. Types of Software testing
  4. Some examples of Cyber Security Firms and what they do
  5. How we achieve a secure product
  6. InfoSec and Managed Security Service Provider
  7. Training and development
  8. Safeguarding against Phishing and Multi-Factor Authentication
  9. Threat hunting, mitigation and Vulnerability Management
  10. The denouement


You can read and download the article from:
https://www.slideshare.net/toughjamy/security-is-our-duty-and-we-shall-deliver-it-white-paper

Read on LinkedIn:
https://www.linkedin.com/pulse/security-our-duty-we-shall-deliver-mohd-anwar-jamal-faiz/

Friday, March 31, 2017

Sabzi Taala Chaabi... Your but others use !

इसका जवाब दो,
तो मानेंगे whatsapp King: 👍

Its a Challenge.....😉.
      समय लिमिट ⏳: 1 घंटा 🕛

आपको अगर नहीं पता तो सबको forward करो और जानने की कोशिश करो.

इन सवालों के जवाब दीजिये...!!

1. बताओ वो कौन सी सब्ज़ी है जिस में ताला और चाबी दोनों आते हैं ? बताओ क्या है

2. ऐसी कौन सी चीज है जो है तो तुम्हारी, पर उसे दूसरे लोग इस्तेमाल करते हैं ?

3. वो कौन सा काम है जो 1 आदमी अपनी पूरी ज़िंदगी में 1 बार करता है, पर वही काम 1 औरत रोज़ करती है? बताओ क्या?

4. परिवार हरा हम भी हरे; एक थैली में तीन - चार भरे। बताओ क्या ?

👍👍👍 best of luck

3 No.सवाल का उत्तर सिर्फ बुद्धिमान ही दे सकते है। देखते है अपने ग्रुप में कितने बुद्धिमान है

जवाब भेजे,
ग्रुप वालो थोड़ा दिमाग लगाओ,
यह मुश्किल नही, आसान है ।

Www.JobPuzzles.com

Answer:

1.   Laukey   ( lock + key )

2. Naam ( hota aapka hai. Lekin pukarte doosre log hain )

3. Mard shadi karte hue sindoor bharta hai.   Phir aurat roz roz maang bharti hain. 😝

4. Balki sahi to hoga ki ek thaili me 6-7 bhare hote hain. Answer is Matar. Matar ki sabzi.

Tuesday, September 6, 2016

Birthday Box Puzzle : Girl on her birthday deposits 250 rupees. Sister on her birthday takes 50

Puzzle #81:
Birthday box puzzle


एक लडकी ने 20 साल कि उम्र मे एक बॉक्स खरीदा
वो अपने हर जन्मदिन पर ऊसमे Rs.250 डाल देती
और उसकी बहन ऊसमे से Rs.50 अपने हर जन्मदिन पर
निकाल लेती। अगर लडकी कि death 60 साल मेँ हुई।

जब बाक्स खुला तो उसमे से सिर्फ Rs.500 निकले। कैसे ??

Www.jobpuzzles.com

Thursday, December 4, 2014

Top List of Programming Interview Puzzles. Code Solution

Following list of programming puzzles and solution (MUST). This list has been prepared with my own voyage through various interviews at Microsoft, Symantec, Google, Adobe and Expedia etc. I have also been in talks with several friends of mine. And following is the list of top problems that seem to be asked in interviews.



Write a function to get the intersection point of two Linked Lists.
There are two singly linked lists in a system. By some programming error the end node of one of the linked list got linked into the second list, forming a inverted Y shaped list. Write a program to get the point where two linked list merge.

--> http://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/



Lowest Common Ancestor in a Binary Search Tree.
Given values of two nodes in a Binary Search Tree, write a c program to find the Lowest Common Ancestor (LCA). You may assume that both the values exist in the tree.

--> http://www.geeksforgeeks.org/lowest-common-ancestor-in-a-binary-search-tree/



String matching where one string contains wildcard characters
Given two strings where first string may contain wild card characters and second string is a normal string. Write a function that returns true if the two strings match. The following are allowed wild card characters in first string.

--> http://www.geeksforgeeks.org/wildcard-character-matching/



Anagram Substring Search (Or Search for all permutations)
Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] and its permutations (or anagrams) in txt[]. You may assume that n > m.  Expected time complexity is O(n)

--> http://www.geeksforgeeks.org/anagram-substring-search-search-permutations/



Inorder Tree Traversal without recursion and without stack!
Using Morris Traversal, we can traverse the tree without using stack and recursion. The idea of Morris Traversal is based on Threaded Binary Tree. In this traversal, we first create links to Inorder successor and print the data using these links, and finally revert the changes to restore original tree.

--> http://www.geeksforgeeks.org/inorder-tree-traversal-without-recursion-and-without-stack/



Print all possible strings of length k that can be formed from a set of n characters
Given a set of characters and a positive integer k, print all possible strings of length k that can be formed from the given set.

--> http://www.geeksforgeeks.org/print-all-combinations-of-given-length/



Print all possible combinations of r elements in a given array of size n
Given an array of size n, generate and print all possible combinations of r elements in array. For example, if input array is {1, 2, 3, 4} and r is 2, then output should be {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4} and {3, 4}.

--> http://www.geeksforgeeks.org/print-all-possible-combinations-of-r-elements-in-a-given-array-of-size-n/



Check if a number is Palindrome
Given an integer, write a function that returns true if the given number is palindrome, else false. For example, 12321 is palindrome, but 1451 is not palindrome.

--> http://www.geeksforgeeks.org/check-if-a-number-is-palindrome/



Data Structure for Dictionary and Spell Checker?
Which data structure can be used for efficiently building a word dictionary and Spell Checker?

--> http://www.geeksforgeeks.org/data-structure-dictionary-spell-checker/




Count number of binary strings without consecutive 1’s
Given a positive integer N, count all possible distinct binary strings of length N such that there are no consecutive 1’s.

--> http://www.geeksforgeeks.org/count-number-binary-strings-without-consecutive-1s/



Shortest path with exactly k edges in a directed and weighted graph
Given a directed and two vertices ‘u’ and ‘v’ in it, find shortest path from ‘u’ to ‘v’ with exactly k edges on the path.

--> http://www.geeksforgeeks.org/shortest-path-exactly-k-edges-directed-weighted-graph/



Count all possible walks from a source to a destination with exactly k edges
Given a directed graph and two vertices ‘u’ and ‘v’ in it, count all possible walks from ‘u’ to ‘v’ with exactly k edges on the walk.

--> http://www.geeksforgeeks.org/count-possible-paths-source-destination-exactly-k-edges/



--Take Care
And Best Of Luck  :)
Anwar Jamal










Saturday, June 21, 2014

Highest floor fall - Eggs not break Puzzle. It is a 100 floor building.



The Puzzle:

Determine the highest floor on a 100 floor building from which an egg may be dropped without breaking.

You are given two identical eggs, which you can drop from various floors of the building, to carry out your test.

Assume that, if the egg doesn't break after being dropped, it may be reused without suffering any loss of quality.
But if both eggs break before you have determined the highest floor, then you are over.

Find what is the least number of times you must drop the eggs in order to determine the highest floor?



Our Solution:

The answer is: 14

You drop the first egg from the 14th floor.
If it breaks, you can then determine the highest floor by dropping the second snooker ball no more than 13 times.
The above process would be to drop it from the 1st floor, and if it doesn't break, drop it from the 2nd floor, and if it still doesn't break, drop from the 3rd, etc
Hence, 13+1=14 chances


However, if the first egg survives the drop from the 14th floor, you then drop it from the 27th floor (14 + 13 = 27).
If it breaks, you can complete your test in no more than 12 drops with the second ball by dropping it between the floors 15 to 26.

Then, If from the 27th floor the first ball still doesn't break, the next floor to drop it from is the 39th (14 + 13 + 12 = 39).
If it breaks, drop the second ball from floors 28 to 38 (max 11 drops).

after the 39th floor should be the 50th floor (14+13+12+11),
then the 60th floor (14+13+12+11+10), and so on.

If the first ball survives 11 drops, you will be on the 99th floor. In that case, it only takes one more drop to complete the whole test.



So, this solves the puzzle.


Oh! stop. Think again!!!
You have just verified that 14 is the right answer. But how did one reached that answer?
Think again!!