Tuesday 21 May 2013

::::|| VU ||:::: Oracle HRMS Technical

Hello,


Hope you are doing fine!!

Please review the requirement and if you are interested  then reply back with your  consultant resume and contact details ASAP torajit@hmgamerica.com


Position:Oracle HRMS Technical 

Location:NYC,NY
Duration:12 Months


Job Description:

The role requires 6-8 years of experience in Oracle HRMS involving100% technical in Oracle application stack primarily Oracle eBusiness 11.5 but also Fusion HCM.

About 6 year experience in implementation and maintenance of Oracle HRMS 11.5.10

4-6 years of experience in project analysis, design, development, integration, implementation, configuration and setup, maintenance & enhancement in Oracle HRMS.

Most importantly, excellent knowledge of Oracle PL/SQL

Experience in developing technical designs and specifications for applications extensions and customizations.

Hands-on experience in Oracle Apps schema structures, background workflows, and ability to utilize Oracle environment such as flexfields, lists of values, programs, concurrent manager, workflows and open APIs.

TECHNICAL SKILLS

Oracle Applications: HRMS 11i/R12, Oracle HR

Oracle Apps Tools: Oracle Application Frameworks 11.5.10, XML Publisher, Web ADI C/D, Fast Formulas, Oracle Approvals Management (AME)

Oracle Tools: Developer 6(Forms 6i and Reports), SQL*Plus, PL/SQL

RDBMS: Oracle 11g

Languages: SQL, PL/SQL, JAVA, XML

Web/App Server: Oracle Application Server



-- 

Thanks & Regards.

Rajit Ahuja
HMG America LLC
PH: 732-645-1086
E  : rajit@hmgamerica.com
W : www.hmgamerica.com

--
For study materials, past papers and assignments,
Join VU School at www.vuscool.com
 
Facebook Group link
http://www.facebook.com/groups/vuCoooL
 
CoooL Virtual University Students Google Group.
To post to this group, send email to coool_vu_students@googlegroups.com
 
home page
http://groups.google.com/group/coool_vu_students?hl=en
 
---
You received this message because you are subscribed to the Google Groups "CoooL Virtual University Students" group.
To unsubscribe from this group and stop receiving emails from it, send an email to coool_vu_students+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

::::|| VU ||::::

assignmnt 2
cs605 need?????

--
For study materials, past papers and assignments,
Join VU School at www.vuscool.com
 
Facebook Group link
http://www.facebook.com/groups/vuCoooL
 
CoooL Virtual University Students Google Group.
To post to this group, send email to coool_vu_students@googlegroups.com
 
home page
http://groups.google.com/group/coool_vu_students?hl=en
 
---
You received this message because you are subscribed to the Google Groups "CoooL Virtual University Students" group.
To unsubscribe from this group and stop receiving emails from it, send an email to coool_vu_students+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

Re: [Pak Youth] CS502 Today's 20 Solved n Unsolved Quiz (Date 21.05.2013)

good :) 


On Tue, May 21, 2013 at 5:42 PM, !!!мαѕσσм ƒ@!яу!!! <masooma.best@gmail.com> wrote:
Boxbe This message is eligible for Automatic Cleanup! (masooma.best@gmail.com) Add cleanup rule | More info

Question # 1
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
Select correct option:
    p.x only
    p.y only
    p.x & p.z
    p.x & p.y    (p10)

Question # 2
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
Select correct option:
    True    
    False    (p173)

Question # 3
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
Select correct option:
    Two
    Some
    Most
    All    (p18)


Question # 4
In ____________ we have to find rank of an element from given input.
Select correct option:
    Merge sort algorithm
    Selection problem    (p34)
    Brute force technique
    Plane Sweep algorithm

Question # 5
In Heap Sort algorithm, if heap property is violated _________
Select correct option:
    We call Build heap procedure
    We call Heapify procedure    (answer)
    We ignore
    Heap property can never be violated


Question # 6
We can not make any significant improvement in the running time which is better than that of brute-force algorithm.
Select correct option:
    True
    False    (p92 Not Sure)

Question # 7
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0
Select correct option:
    Less than
    Equal to or Less than        (p25 => for all n >= n0)
    Equal or Greater than
    Greater than


Question # 8
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
Select correct option:
    True
    False    (p10 => A RAM is an idealized machine)

Question # 9
In simple brute-force algorithm, we give no thought to efficiency.
Select correct option:
    True    (p11)
    False


Question # 10
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
Select correct option:
    Searching
    Sorting        (p39)
    Both Searching & Sorting
    Graphing

Question # 1 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1

The number of accesses to any element of space is not counted for the running time calculation of algorithm.

Select correct option:

True

 False

Question # 2 of 10 ( Start time: 07:01:56 PM ) Total Marks: 1

The O-notation is used to state only the asymptotic ________bounds.

Select correct option:

Two Lower

Upper

Both lower & upper

Question # 3 of 10 ( Start time: 07:02:28 PM ) Total Marks: 1

 In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.

Select correct option:

True

 False

Question # 4 of 10 ( Start time: 07:03:40 PM ) Total Marks: 1

 Floor and ceiling are ____________ to calculate while analyzing algorithms.

Select correct option:

Very easy

Usually considered difficult

Question # 5 of 10 ( Start time: 07:05:04 PM ) Total Marks: 1 In Heap Sort algorithm, the maximum levels an element can move upward is _________

Select correct option:

Theta (log n)

Order (log n)

Omega (log n)

 O (1) i.e. Constant time

Question # 6 of 10 ( Start time: 07:06:23 PM ) Total Marks: 1

A point p in 2-dimensional space is usually given by its integer coordinate(s)____________ Select correct option:

p.x only p.y

only p.x & p.z

 p.x & p.y

Question # 7 of 10 ( Start time: 07:06:49 PM ) Total Marks: 1

Algorithm analysts know for sure about efficient solutions for NP-complete problems.

Select correct option:

True

 False

Question # 8 of 10 ( Start time: 07:07:23 PM ) Total Marks: 1

In Heap Sort algorithm, the total running time for Heapify procedure is ____________

 Select correct option:

 Theta (log n)

Order (log n)

 Omega (log n)

O (1) i.e. Constant time

Question # 9 of 10 ( Start time: 07:08:49 PM ) Total Marks: 1

Which may be stable sort:

Select correct option:

Bubble sort

Insertion sort

Both of above   Page 54

Selection sort

Question # 10 of 10 ( Start time: 07:09:37 PM ) Total Marks: 1

For the worst-case running time analysis, the nested loop structure containing one "for" and one "while" loop, might be expressed as a pair of _________nested summations.

Select correct option:

1

 2

3

 4

 

 



--
-
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To post to this group, send email to pak-youth@googlegroups.com.
To unsubscribe from this group, send email to pak-youth+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/pak-youth?hl=en.
 
---
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To unsubscribe from this group and stop receiving emails from it, send an email to pak-youth+unsubscribe@googlegroups.com.
To post to this group, send email to pak-youth@googlegroups.com.
Visit this group at http://groups.google.com/group/pak-youth?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
 
 




--
++SUccess is a ladder that cannot be climbed with hands in PockET!

--
-
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To post to this group, send email to pak-youth@googlegroups.com.
To unsubscribe from this group, send email to pak-youth+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/pak-youth?hl=en.
 
---
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To unsubscribe from this group and stop receiving emails from it, send an email to pak-youth+unsubscribe@googlegroups.com.
To post to this group, send email to pak-youth@googlegroups.com.
Visit this group at http://groups.google.com/group/pak-youth?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

[Pak Youth] CS502 Today's 20 Solved n Unsolved Quiz (Date 21.05.2013)

Question # 1
A point p in 2-dimensional space is usually given by its integer coordinate(s)____________
Select correct option:
    p.x only
    p.y only
    p.x & p.z
    p.x & p.y    (p10)

Question # 2
Algorithm analysts know for sure about efficient solutions for NP-complete problems.
Select correct option:
    True    
    False    (p173)

Question # 3
Brute-force algorithm for 2D-Maxima is operated by comparing ________ pairs of points.
Select correct option:
    Two
    Some
    Most
    All    (p18)


Question # 4
In ____________ we have to find rank of an element from given input.
Select correct option:
    Merge sort algorithm
    Selection problem    (p34)
    Brute force technique
    Plane Sweep algorithm

Question # 5
In Heap Sort algorithm, if heap property is violated _________
Select correct option:
    We call Build heap procedure
    We call Heapify procedure    (answer)
    We ignore
    Heap property can never be violated


Question # 6
We can not make any significant improvement in the running time which is better than that of brute-force algorithm.
Select correct option:
    True
    False    (p92 Not Sure)

Question # 7
Upper bound requires that there exist positive constants c2 and n0 such that f(n) ____ c2n for all n <= n0
Select correct option:
    Less than
    Equal to or Less than        (p25 => for all n >= n0)
    Equal or Greater than
    Greater than


Question # 8
A RAM is an idealized algorithm with takes an infinitely large random-access memory.
Select correct option:
    True
    False    (p10 => A RAM is an idealized machine)

Question # 9
In simple brute-force algorithm, we give no thought to efficiency.
Select correct option:
    True    (p11)
    False


Question # 10
_________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
Select correct option:
    Searching
    Sorting        (p39)
    Both Searching & Sorting
    Graphing

Question # 1 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1

The number of accesses to any element of space is not counted for the running time calculation of algorithm.

Select correct option:

True

 False

Question # 2 of 10 ( Start time: 07:01:56 PM ) Total Marks: 1

The O-notation is used to state only the asymptotic ________bounds.

Select correct option:

Two Lower

Upper

Both lower & upper

Question # 3 of 10 ( Start time: 07:02:28 PM ) Total Marks: 1

 In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.

Select correct option:

True

 False

Question # 4 of 10 ( Start time: 07:03:40 PM ) Total Marks: 1

 Floor and ceiling are ____________ to calculate while analyzing algorithms.

Select correct option:

Very easy

Usually considered difficult

Question # 5 of 10 ( Start time: 07:05:04 PM ) Total Marks: 1 In Heap Sort algorithm, the maximum levels an element can move upward is _________

Select correct option:

Theta (log n)

Order (log n)

Omega (log n)

 O (1) i.e. Constant time

Question # 6 of 10 ( Start time: 07:06:23 PM ) Total Marks: 1

A point p in 2-dimensional space is usually given by its integer coordinate(s)____________ Select correct option:

p.x only p.y

only p.x & p.z

 p.x & p.y

Question # 7 of 10 ( Start time: 07:06:49 PM ) Total Marks: 1

Algorithm analysts know for sure about efficient solutions for NP-complete problems.

Select correct option:

True

 False

Question # 8 of 10 ( Start time: 07:07:23 PM ) Total Marks: 1

In Heap Sort algorithm, the total running time for Heapify procedure is ____________

 Select correct option:

 Theta (log n)

Order (log n)

 Omega (log n)

O (1) i.e. Constant time

Question # 9 of 10 ( Start time: 07:08:49 PM ) Total Marks: 1

Which may be stable sort:

Select correct option:

Bubble sort

Insertion sort

Both of above   Page 54

Selection sort

Question # 10 of 10 ( Start time: 07:09:37 PM ) Total Marks: 1

For the worst-case running time analysis, the nested loop structure containing one "for" and one "while" loop, might be expressed as a pair of _________nested summations.

Select correct option:

1

 2

3

 4

 

 



--
-
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To post to this group, send email to pak-youth@googlegroups.com.
To unsubscribe from this group, send email to pak-youth+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/pak-youth?hl=en.
 
---
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To unsubscribe from this group and stop receiving emails from it, send an email to pak-youth+unsubscribe@googlegroups.com.
To post to this group, send email to pak-youth@googlegroups.com.
Visit this group at http://groups.google.com/group/pak-youth?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

Re: ::::|| VU ||:::: Aik aansu meri palkon pe numanyan hi sahi

wah wah wah wah wah wah 
buhat khob 


hum ny har door main charty soraj ki poja ki hy 
log kahty hain humain kamina to kamina hi sahi 

adaaaaaaaaaaaaab 
wah wah 
kia sher mara hy 
:P



2013/5/21 Rizwan Saqib <hate.me.forever1@gmail.com>

Aik aansu meri palkon pe numanyan hi sahi
Laog kehtay hain charaghaan to charaghaan hi sahi

Hum ne har daor mein raaton se baghawat ki thi
Aaj pabandi-e-aaien shabistaan hi sahi

Meri taqdeer mein phoolon ka tassawur bhe mahal
Koi gulshan bakaf-o-khuld badamaan hi sahi

Mujh pe jo beet gai beet gai beet gai
Meri hasrat teray chehray se numayan hi sahi

Mar.ghaton per nai bunyaad-e-makan rakhain gai
Kar-e-tehzeeb Raqeeb-e-ser-o-samaan hi sahi

Kitni Aankhain huien be nar tujhay kiya maloom
Kar-e-nazarah teri bazm mein asaan hi sahi

Jabr Ke Zulm Laye huway san.natay mein
Koi shorsh koi halchal koi toofaan hi sahi

Yeah bhe kya kam hai ke hum chonktay hain jagtay hain
Zindegi silsila-e-khuwaab perishaan hi sahi

Bhairriyon ko nah yeah tareekh khula choray gi
Bhairriye asmat-e-aadam ke nigehbaan hi sahi

Zulm har rang mein pehchaan liya jaye ga
Tera daman hi sahi mera girebaan hi sahi


--



بسم الله الرحمن  الرحيم
اللهم صل على محمد واله وعترته بعد دا كل
معلو م لك
استغفر الله العظيم الذى لا اله الا هو الحى القيوم واتوب اليه
لا اله الا الله محمد رسول الله
قل هو الله احد الله الصمد لم يلد ولم يو لد ولم يكن له كفوا احد
اشهد ان لااله الا الله واشهد ان محمدا عبده ورسوله
ياهو هادى رب لا تذر على الارض قوما ظا لمين

اللَّهُمَّ صَلِّ عَلَى مُحَمَّدٍ وَّ عَلَى آلِ مُحَمَّدٍ كَمَا صَلَّيْتَ عَلَى إِبْرَاهِيمَ وَعَلَى آلِ إِبْرَاهِيمَ إِنَّكَ حَمِيدٌ مَجِيدٌ اللَّهُمَّ بَارِكْ عَلَى مُحَمَّدٍ وَّ عَلَى آلِ مُحَمَّدٍ كَمَا بَارَكْتَ عَلَى إِبْرَاهِيمَ وَعَلَى آلِ إِبْرَاهِيمَ إِنَّكَ
حَمِيدٌ مَجِيدٌ

--
For study materials, past papers and assignments,
Join VU School at www.vuscool.com
 
Facebook Group link
http://www.facebook.com/groups/vuCoooL
 
CoooL Virtual University Students Google Group.
To post to this group, send email to coool_vu_students@googlegroups.com
 
home page
http://groups.google.com/group/coool_vu_students?hl=en
 
---
You received this message because you are subscribed to the Google Groups "CoooL Virtual University Students" group.
To unsubscribe from this group and stop receiving emails from it, send an email to coool_vu_students+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

--
For study materials, past papers and assignments,
Join VU School at www.vuscool.com
 
Facebook Group link
http://www.facebook.com/groups/vuCoooL
 
CoooL Virtual University Students Google Group.
To post to this group, send email to coool_vu_students@googlegroups.com
 
home page
http://groups.google.com/group/coool_vu_students?hl=en
 
---
You received this message because you are subscribed to the Google Groups "CoooL Virtual University Students" group.
To unsubscribe from this group and stop receiving emails from it, send an email to coool_vu_students+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

Re: [Pak Youth] Story of the day





On Mon, May 20, 2013 at 9:34 PM, dya princess <wellcome2myfriends@gmail.com> wrote:
 


 

--
-
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To post to this group, send email to pak-youth@googlegroups.com.
To unsubscribe from this group, send email to pak-youth+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/pak-youth?hl=en.
 
---
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To unsubscribe from this group and stop receiving emails from it, send an email to pak-youth+unsubscribe@googlegroups.com.
To post to this group, send email to pak-youth@googlegroups.com.
Visit this group at http://groups.google.com/group/pak-youth?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

--
-
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To post to this group, send email to pak-youth@googlegroups.com.
To unsubscribe from this group, send email to pak-youth+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/pak-youth?hl=en.
 
---
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To unsubscribe from this group and stop receiving emails from it, send an email to pak-youth+unsubscribe@googlegroups.com.
To post to this group, send email to pak-youth@googlegroups.com.
Visit this group at http://groups.google.com/group/pak-youth?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.