About

Pritam is the co-founder of OpenSense Labs and an alumnus of IIT Kharagpur. He qualified GATE-13 with percentile 99.93 . He also possess more than 3 years of industry experience of working for services based companies like TCS, AZRI Solutions & Enova Technologies.

Role

Alma Mater:

M. Tech.
IIT Kharagpur
2013 to 2015
B. E.
University Institute of Technology, RGPV, Bhopal
2007 to 2011

Experience:

Director
Perfecist Technologies
2015
Application Developer
Azri Solutions
2012 to 2013
Business Analyst
Tata Consultancy Services (TCS)
2011 to 2012
Web Developer
E-nova Technologies, Okhla, New Delhi
2009 to 2010
Tech
Post
1 month 2 weeks ago
Most often freshers mention the difficulty they face when they join the industry after completing the graduation. For some of them, it becomes the real challenge to adapt to the new environment where your capability is not judged just by looking at a single piece of paper, but by many factors like your problem-solving skills, team management, on-time delivery, quick learning skills and many other significant factors.

I believe, Internship is one of the ways where you get an opportunity to have a close understanding of how differently companies operate and what is the most suitable career path for you.

Do not miss an internship this summer!!

moreless
varunsingla1's picture
Varun Singla
niket151194's picture
Niket Gangwar
kavya8755's picture
Kavya Kamish Upadhyay
vaishali
Prashant Sharma
shailaja Praharaju
Gourav Jain
rtiwari95's picture
RAHUL TIWARI
sardendubharti's picture
sardendu
Prof R.K. Dhawan
laveshrawal's picture
LAVESH RAWAL
ARUN SINGH
shraddhagami's picture
Shraddha
Vaishali
shivani1234's picture
shivani

Pages

tajinder.minhas's picture
Tajinder Singh Minhas
3
ranita's picture
Ranita Biswas
906
atchyut's picture
atchyut kumar
908
ankur's picture
Ankur Jain
913
Rajeev
914
vivek14's picture
Vivek Vikram Singh
921
priyesh's picture
Priyesh Priyatam
923
Himanshi
976
shreyans's picture
Shreyans Dhankhar
977
ribhu122's picture
Ribhu Ranjan
986
pankaj's picture
PANKAJ NAYAK
989
vasudha_garg's picture
vasudha
990
maheshkumars's picture
Mahesh Kumar
1017
chandanchawda's picture
Chandan Chawda
1019
parulagarwal's picture
Parul Agarwal
1044

Pages

31 May 2016 - 6:30pm

Do you have the answer ? I am getting it O((logn)3).

more less

You can notice that remainder is 'cut' into half in every 2 steps. And since it cannot go less than 1, there can be atmost 2.[log2n] steps/recursions. Each step/recursion requires constant time, θ(1). So, this can be atmost 2.[log2n].θ(1) times.

Hence, θ(log n)

Refrences for more reading: Reference1   Reference2
Suggestion: Just remember that the complexity of finding GCD is O(logn)

more less
31 May 2016 - 5:33pm

Time complexity of a recursive function is the number of time recursive function is called. Give it a try and share what you are getting.

more less

Thank You Arvind.

more less
30 May 2016 - 9:41pm

shivanisrivarshini, question clearly asks the number of comparision, not the number of times code inside the loop is excuted. We have to count the last comparision returning FALSE too.

more less

We introdude these dependencies to handle some constraints (like foreign key constraint) which are not handeled so far by our normal forms.

An inclusion dependency R.X < S.Y between two sets of attributes ( X of schema R, and Y of schema S ) specifies the constraint that, at any specific time where r is a relation state of R and s is a relation state of S, we must have πX(r) ⊆ πY(s) . Here X and Y must have the same number of attributes and the domain of corresponding attribute must be compatible.

Examples: DEP.D_MGR_SSN < EMP.SSN  ie, Social Security Number of managers for a department is always a subset of Social Security Number of Employees of a department.

Template Dependency can be used to provide a general framework for specifying dependencies, especially those we know exist on the data but are hard to spell out in terms of our earlier dependencies.

There are two kinds of templates which are used to specify dependencies: tuple generating templates and constraint templates. Any template consists of a list of hypothesis tuples followed by a template conclusion. Note that for tuple generating templates, the conclusion is a set of tuples that must exist in the relation if the hypothesis tuples are there. While for constraint generating templates, the template conclusion is a condition that must hold on the hypothesis tuples.

For More Reading refer the following paper: http://www.sciencedirect.com/science/article/pii/0304397582900287

more less
30 May 2016 - 8:30am

Please refer the URL of the video. Moreover, while asking a question, do not intend to ask it to a particular person. Please remember that anyone can answer.

more less
29 May 2016 - 5:33pm

Sayyed, in the example given by you we have two FDs as below:

AB → CD
C → B

Which gives us two candidate key: AB and AC
hence non-prime attribute: D. Although, the example is correct in the sense that it is in 3NF but not in BCNF.

more less

Tis already commited hence there is no question of aborting it. However, Twill start executing again.

more less

Pages